Optuna optimization

We consider a scheduling problem where the schedule is represented by a vector \(\mathbf{x} = (x_0, x_1, \ldots, x_{T-1})^T\). This vector comprises \(T\) components, where \(x_j\) denotes the non-negative allocation (e.g., number of patients or tasks) to time slot \(j\), for \(j = 0, \ldots, T-1\). A fundamental constraint is that the total allocation across all time slots must equal a fixed constant \(N\): \[ \sum_{j=0}^{T-1} x_j = N \] We require \(x_j \ge 0\) for all \(j = 0, \ldots, T-1\). Consequently, a valid schedule \(\mathbf{x}\) belongs to the feasible set \(\mathcal{F} = \{ \mathbf{z} \in \mathbb{D}^{T} \mid \sum_{j=0}^{T-1} z_j = N, z_j \ge 0 \text{ for all } j\}\), where \(\mathbb{D}\) is typically the set of non-negative integers (\(\mathbb{Z}_{\ge 0}\)) or non-negative real numbers (\(\mathbb{R}_{\ge 0}\)). The definitions below use \(\mathbb{R}_{\ge 0}^{T}\).

We define a neighborhood structure for local search based on perturbation vectors derived from a set of \(T\) basis change vectors, \(v_i \in \mathbb{R}^{T}\), for \(i = 0, \ldots, T-1\). These basis vectors represent elementary shifts of allocation between time slots:

• \(v_0 = (-1, 0, \ldots, 0, 1)^T\) (Shift unit from slot 0 to slot \(T-1\))

• \(v_1 = (1, -1, 0, \ldots, 0)^T\) (Shift unit from slot 1 to slot 0)

• \(v_i = (0, \ldots, 0, \underbrace{1}_{\text{pos } i-1}, \underbrace{-1}_{\text{pos } i}, 0, \ldots, 0)^T\) for \(i = 2, \ldots, T-1\) (Shift unit from slot \(i\) to slot \(i-1\))

A key property of these basis vectors is that the sum of components for each vector is zero: \(\sum_{j=0}^{T-1} v_{ij} = 0\) for all \(i=0, \ldots, T-1\).

Perturbations are constructed using a binary selection vector \(\mathbf{U} = (u_0, u_1, \ldots, u_{T-1})^T\), where \(u_i \in \{0, 1\}\). Each \(u_i\) indicates whether the basis change \(v_i\) is included in the perturbation. The resulting perturbation vector \(\mathbf{r}(\mathbf{U}) \in \mathbb{R}^{T}\) is the linear combination: \[ \mathbf{r}(\mathbf{U}) := \sum_{i=0}^{T-1} u_i v_i \]

Since each \(v_i\) sums to zero, any perturbation \(\mathbf{r}(\mathbf{U})\) also sums to zero: \(\sum_{j=0}^{T-1} r_j(\mathbf{U}) = 0\). This ensures that applying such a perturbation to a valid schedule \(\mathbf{x}\) preserves the total allocation \(N\).

Two specific selection vectors result in a zero perturbation:

1. If \(\mathbf{U} = \mathbf{0} = (0, \ldots, 0)^T\), then \(\mathbf{r}(\mathbf{0}) = \mathbf{0}\).

2. If \(\mathbf{U} = \mathbf{1} = (1, \ldots, 1)^T\), then \(\mathbf{r}(\mathbf{1}) = \sum_{i=0}^{T-1} v_i = \mathbf{0}\), as demonstrated by summing the components of the basis vectors.

The neighborhood of a schedule \(\mathbf{x} \in \mathcal{F}\), denoted by \(\mathcal{N}(\mathbf{x})\), comprises all distinct, feasible schedules \(\mathbf{x}'\) reachable by applying a non-zero perturbation \(\mathbf{r}(\mathbf{U})\): \[ \mathcal{N}(\mathbf{x}) := \{ \mathbf{x}' \mid \mathbf{x}' = \mathbf{x} + \mathbf{r}(\mathbf{U}), \mathbf{U} \in \{0,1\}^T, \mathbf{r}(\mathbf{U}) \neq \mathbf{0}, \text{ and } x'_j \ge 0 \text{ for all } j = 0, \ldots, T-1 \} \]

Note that because \(\sum r_j(\mathbf{U}) = 0\), any \(\mathbf{x}'\) generated from \(\mathbf{x} \in \mathcal{F}\) automatically satisfies \(\sum x'_j = N\). The condition \(\mathbf{r}(\mathbf{U}) \neq \mathbf{0}\) explicitly excludes the transformations resulting from \(\mathbf{U}=\mathbf{0}\) and \(\mathbf{U}=\mathbf{1}\).

There are \(2^T\) possible selection vectors \(\mathbf{U}\). Since \(\mathbf{U}=\mathbf{0}\) and \(\mathbf{U}=\mathbf{1}\) both yield \(\mathbf{r}(\mathbf{U}) = \mathbf{0}\) (assuming \(T \ge 1\) so \(\mathbf{0} \neq \mathbf{1}\)), there are \(2^T - 2\) distinct selection vectors that generate non-zero perturbations. This establishes an upper bound on the number of candidate neighbors generated by unique non-zero perturbations: \[ |\mathcal{N}(\mathbf{x})| \le 2^T - 2 \]

The actual size of the neighborhood may be smaller than this bound due to the non-negativity constraint (\(\mathbf{x}'_j \ge 0\)) rendering some potential neighbors infeasible.

The local search aims to iteratively improve the schedule based on an objective function \(C(\mathbf{x})\). Given the following constants:

• \(\mathbf{x}\): The current feasible schedule vector (\(\mathbf{x} \in \mathcal{F}\)).

• \(N\): The total number of patients/tasks to be scheduled.

• \(T\): The number of time slots.

• \(d\): The duration of each time slot.

• \(s\): The service time distribution.

• \(q\): The no-show probability.

• \(w\): The objective function weight (\(w \in [0, 1]\)).

• \(EWT(\mathbf{x})\): Expected Waiting Time for schedule \(\mathbf{x}\).

• \(ESP(\mathbf{x})\): Expected Staff Penalty (e.g., idle/overtime) for schedule \(\mathbf{x}\).

and the objective function: \[ C(\mathbf{x}) = w \cdot EWT(\mathbf{x}) + (1-w) \cdot ESP(\mathbf{x}) \]

, a neighborhood search step seeks to find a neighbor \(\mathbf{x}' \in \mathcal{N}(\mathbf{x})\) such that \(C(\mathbf{x}') < C(\mathbf{x})\). This involves evaluating candidate schedules generated by \(\mathbf{x} + \mathbf{r}(\mathbf{U})\) for the \(2^T - 2\) selection vectors \(\mathbf{U}\) (where \(\mathbf{U} \neq \mathbf{0}\) and \(\mathbf{U} \neq \mathbf{1}\)), checking their feasibility (non-negativity), and comparing their objective function values to \(C(\mathbf{x})\).

In case such an improvement is found, the algorithm updates the current schedule to \(\mathbf{x}'\) and continues the search. If no better neighbor is found, the algorithm terminates, returning the best schedule found during the search. Because of the multi-modular nature of the objective function, a local optimum must also be the global optimum.

Setup

Load all necessary packages and initialize the constants

import optuna
import logging # Optional: To see pruned trial messages if desired
import sys
import math 
import numpy as np
import time
from scipy.optimize import minimize
from itertools import combinations
from typing import List, Dict, Tuple, Callable, Optional, Union, Any, Iterable # Added type hints
import multiprocessing as mp

# Optional: Configure logging to see messages about pruned trials
# optuna.logging.get_logger("optuna").addHandler(logging.StreamHandler(sys.stdout))

from functions import compute_convolutions, bailey_welch_schedule, get_v_star

N = 12 # Number of patients
T = 8 # Number of intervals
d = 5 # Length of each interval
max_s = 20 # Maximum service time
q = 0.20 # Probability of a scheduled patient not showing up
w = 0.1 # Weight for the waiting time in objective function
l = 10
v_star = get_v_star(T)
print("v_star: \n", v_star)

# Create service time distribution
def generate_weighted_list(max_s: int, l: float, i: int) -> Optional[np.ndarray]:
    """
    Generates a service time probability distribution using optimization.

    This function creates a discrete probability distribution over max_s possible
    service times (from 1 to max_s). It uses optimization (SLSQP) to find a
    distribution whose weighted average service time is as close as possible
    to a target value 'l', subject to the constraint that the probabilities
    sum to 1 and each probability is between 0 and 1.

    After finding the distribution, it sorts the probabilities: the first 'i'
    probabilities (corresponding to service times 1 to i) are sorted in
    ascending order, and the remaining probabilities (service times i+1 to max_s)
    are sorted in descending order.

    Note:
        - Requires NumPy and SciPy libraries (specifically scipy.optimize.minimize).

    Args:
        max_s (int): Maximum service time parameter (number of probability bins).
                     Must be a positive integer.
        l (float): The target weighted average service time for the distribution.
                   Must be between 1 and max_s, inclusive.
        i (int): The index determining the sorting split point. Probabilities
                 for service times 1 to 'i' are sorted ascendingly, and
                 probabilities for service times 'i+1' to 'max_s' are sorted
                 descendingly. Must be between 1 and max_s-1 for meaningful sorting.

    Returns:
        numpy.ndarray: An array of size max_s+1. The first element (index 0) is 0.
                       Elements from index 1 to max_s represent the calculated
                       and sorted probability distribution, summing to 1.
                       Returns None if optimization fails or inputs are invalid.
    """

    # --- Input Validation ---
    if not isinstance(max_s, int) or max_s <= 0:
        print(f"Error: max_s must be a positive integer, but got {max_s}")
        return None
    if not isinstance(l, (int, float)) or not (1 <= l <= max_s):
        print(f"Error: Target average 'l' ({l}) must be between 1 and max_s ({max_s}).")
        return None
    if not isinstance(i, int) or not (0 < i < max_s):
        print(f"Error: Sorting index 'i' ({i}) must be between 1 and max_s-1 ({max_s-1}).")
        # If clamping is desired instead of error:
        # print(f"Warning: Index 'i' ({i}) is outside the valid range (1 to {max_s-1}). Clamping i.")
        # i = max(1, min(i, max_s - 1))
        return None # Strict check based on docstring requirement

    # --- Inner helper function for optimization ---
    def objective(x: np.ndarray) -> float:
        """Objective function: Squared difference between weighted average and target l."""
        # x represents probabilities P(1) to P(max_s)
        service_times = np.arange(1, max_s + 1)
        weighted_avg = np.dot(service_times, x) # Equivalent to sum(k * P(k) for k=1 to max_s)
        return (weighted_avg - l) ** 2

    # --- Constraints for optimization ---
    # Constraint 1: The sum of the probabilities must be 1
    constraints = ({
        'type': 'eq',
        'fun': lambda x: np.sum(x) - 1.0 # Ensure float comparison
    })

    # Bounds: Each probability value x[k] must be between 0 and 1
    # Creates a list of max_s tuples, e.g., [(0, 1), (0, 1), ..., (0, 1)]
    bounds = [(0, 1)] * max_s

    # Initial guess: Use Dirichlet distribution to get a random distribution that sums to 1.
    # Provides a starting point for the optimizer. np.ones(max_s) gives equal weights initially.
    initial_guess = np.random.dirichlet(np.ones(max_s))

    # --- Perform Optimization ---
    try:
        result = minimize(
            objective,
            initial_guess,
            method='SLSQP',
            bounds=bounds,
            constraints=constraints,
            # options={'disp': False} # Set True for detailed optimizer output
        )

        # Check if optimization was successful
        if not result.success:
            print(f"Warning: Optimization failed! Message: {result.message}")
            # Optionally print result object for more details: print(result)
            return None # Indicate failure

        # The optimized probabilities (P(1) to P(max_s))
        optimized_probs = result.x

        # --- Post-process: Correct potential floating point inaccuracies ---
        # Ensure probabilities are non-negative and sum *exactly* to 1
        optimized_probs[optimized_probs < 0] = 0 # Clamp small negatives to 0
        current_sum = np.sum(optimized_probs)
        if not np.isclose(current_sum, 1.0):
            if current_sum > 0: # Avoid division by zero
                 optimized_probs /= current_sum # Normalize to sum to 1
            else:
                 print("Warning: Optimization resulted in zero sum probabilities after clamping negatives.")
                 # Handle this case - maybe return uniform distribution or None
                 return None # Or return uniform: np.ones(max_s) / max_s

    except Exception as e:
        print(f"An error occurred during optimization: {e}")
        return None

    # --- Reorder the probabilities based on the index 'i' ---
    # Split the probabilities P(1)...P(i) and P(i+1)...P(max_s)
    # Note: Python slicing is exclusive of the end index, array indexing is 0-based.
    # result.x[0] corresponds to P(1), result.x[i-1] to P(i).
    # result.x[i] corresponds to P(i+1), result.x[max_s-1] to P(max_s).

    first_part_probs = optimized_probs[:i]   # Probabilities P(1) to P(i)
    second_part_probs = optimized_probs[i:]  # Probabilities P(i+1) to P(max_s)

    # Sort the first part ascending, the second part descending
    sorted_first_part = np.sort(first_part_probs)
    sorted_second_part = np.sort(second_part_probs)[::-1] # [::-1] reverses

    # --- Create final output array ---
    # Array of size max_s + 1, initialized to zeros. Index 0 unused.
    values = np.zeros(max_s + 1)

    # Assign the sorted probabilities back into the correct slots (index 1 onwards)
    values[1 : i + 1] = sorted_first_part      # Assign P(1)...P(i)
    values[i + 1 : max_s + 1] = sorted_second_part # Assign P(i+1)...P(max_s)

    # Final check on sum after potential normalization/sorting
    if not np.isclose(np.sum(values[1:]), 1.0):
         print(f"Warning: Final distribution sum is {np.sum(values[1:])}, not 1.0. Check logic.")

    # Return the final array with the sorted probability distribution
    return values

i = 5  # First 5 highest values in ascending order, rest in descending order
s = generate_weighted_list(max_s, l, i)
print("Service time distribution: ", s)
print("Sum: ", np.sum(s))  # This should be 1
print("Weighted service time:", np.dot(np.arange(len(s)), s))  # This should be close to l
x_star = bailey_welch_schedule(T, d, N, s)
print(f"Initial schedule: {x_star}")
convolutions = compute_convolutions(s, N, q)

v_star: 
 [[-1  0  0  0  0  0  0  1]
 [ 1 -1  0  0  0  0  0  0]
 [ 0  1 -1  0  0  0  0  0]
 [ 0  0  1 -1  0  0  0  0]
 [ 0  0  0  1 -1  0  0  0]
 [ 0  0  0  0  1 -1  0  0]
 [ 0  0  0  0  0  1 -1  0]
 [ 0  0  0  0  0  0  1 -1]]
Service time distribution:  [0.         0.00209646 0.00251936 0.00660596 0.01921704 0.27057214
 0.12408766 0.10990817 0.10033277 0.06441305 0.04988183 0.04691165
 0.04519245 0.03169881 0.03037187 0.0248735  0.02474906 0.02414568
 0.0161761  0.00537739 0.00086904]
Sum:  1.0000000000067983
Weighted service time: 8.337676417476906
Initial schedule: [2, 1, 0, 1, 0, 1, 1, 6]

In order to compute the optimal solution with real cost, we can use the local search algorithm. The following code implements this approach. It uses the local_search function to compute the optimal solution.

from functions import local_search

# Computing optimal solution with real cost
start = time.time()
test_x = local_search(x_star, d, convolutions, w, v_star, T, echo=True)
end = time.time()
print(f"Time taken for local search: {end - start:.2f} seconds")

Initial solution: [2 1 0 1 0 1 1 6], cost: 58.46368078819344
Running local search with switching 1 patient(s)
Size of neighborhood: 6
Found better solution: [2 1 0 1 1 0 1 6], cost: 58.00677181779706
Running local search with switching 1 patient(s)
Size of neighborhood: 6
Found better solution: [2 1 0 1 1 1 0 6], cost: 57.72540204938591
Running local search with switching 1 patient(s)
Size of neighborhood: 6
Found better solution: [2 1 0 1 1 1 1 5], cost: 57.19051663825276
Running local search with switching 1 patient(s)
Size of neighborhood: 7
Found better solution: [2 1 1 0 1 1 1 5], cost: 57.110839974974674
Running local search with switching 1 patient(s)
Size of neighborhood: 7
Running local search with switching 2 patient(s)
Size of neighborhood: 22
Running local search with switching 3 patient(s)
Size of neighborhood: 41
Running local search with switching 4 patient(s)
Size of neighborhood: 50
Running local search with switching 5 patient(s)
Size of neighborhood: 41
Running local search with switching 6 patient(s)
Size of neighborhood: 22
Running local search with switching 7 patient(s)
Size of neighborhood: 7
Time taken for local search: 0.05 seconds

from vns_logic import variable_neighborhood_search

# This guard is ESSENTIAL for multiprocessing in notebooks/scripts
if __name__ == "__main__":
    # Ensure freeze_support is called (good practice)
    mp.freeze_support()

    print("Starting VNS from Quarto...")
    start_time = time.time()

    # Call the imported function
    best_solution, best_cost = variable_neighborhood_search(
        x_init=x_star,
        d=d,
        convolutions=convolutions,
        w=w,
        v_star=v_star,
        echo=True # Set to False for less output
    )

    end_time = time.time()
    print("\n--- VNS Result ---")
    print(f"Best solution found: {best_solution}")
    print(f"Best cost found: {best_cost:.4f}")
    print(f"Total execution time: {end_time - start_time:.2f} seconds")

Successfully imported helper functions from functions.py
Starting VNS from Quarto...
--------------------------------------------------
Starting Variable Neighborhood Search
Initial solution: [2 1 0 1 0 1 1 6], Initial cost: 58.4637
Max neighborhood size (t): 8
Number of parallel workers: 8
--------------------------------------------------

Attempting neighborhood t=1 (current best cost: 58.4637)
  Exploring neighborhood t=1 in parallel (current cost: 58.4637)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 6
  Size of neighborhood t=1: 6
  Using 'fork' start method for multiprocessing.
  Found potentially better solution (t=1): cost 58.0068 (neighbor: [2 1 0 1 1 0 1 6]). Stopping parallel search for t=1.
Improvement found! Updating best solution (t=1).
  Old cost: 58.4637 -> New cost: 58.0068
  New solution: [2 1 0 1 1 0 1 6]
Restarting search from t=1.

Attempting neighborhood t=1 (current best cost: 58.0068)
  Exploring neighborhood t=1 in parallel (current cost: 58.0068)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 6
  Size of neighborhood t=1: 6
  Using 'fork' start method for multiprocessing.
  Found potentially better solution (t=1): cost 57.7254 (neighbor: [2 1 0 1 1 1 0 6]). Stopping parallel search for t=1.
Improvement found! Updating best solution (t=1).
  Old cost: 58.0068 -> New cost: 57.7254
  New solution: [2 1 0 1 1 1 0 6]
Restarting search from t=1.

Attempting neighborhood t=1 (current best cost: 57.7254)
  Exploring neighborhood t=1 in parallel (current cost: 57.7254)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 6
  Size of neighborhood t=1: 6
  Using 'fork' start method for multiprocessing.
  Found potentially better solution (t=1): cost 57.1905 (neighbor: [2 1 0 1 1 1 1 5]). Stopping parallel search for t=1.
Improvement found! Updating best solution (t=1).
  Old cost: 57.7254 -> New cost: 57.1905
  New solution: [2 1 0 1 1 1 1 5]
Restarting search from t=1.

Attempting neighborhood t=1 (current best cost: 57.1905)
  Exploring neighborhood t=1 in parallel (current cost: 57.1905)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 7
  Size of neighborhood t=1: 7
  Using 'fork' start method for multiprocessing.
  Found potentially better solution (t=1): cost 57.1108 (neighbor: [2 1 1 0 1 1 1 5]). Stopping parallel search for t=1.
Improvement found! Updating best solution (t=1).
  Old cost: 57.1905 -> New cost: 57.1108
  New solution: [2 1 1 0 1 1 1 5]
Restarting search from t=1.

Attempting neighborhood t=1 (current best cost: 57.1108)
  Exploring neighborhood t=1 in parallel (current cost: 57.1108)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 7
  Size of neighborhood t=1: 7
  Using 'fork' start method for multiprocessing.
  No improvement found for t=1 after processing 7 neighbors.
No improving solution found or error occurred for t=1.

Attempting neighborhood t=2 (current best cost: 57.1108)
  Exploring neighborhood t=2 in parallel (current cost: 57.1108)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 22
  Size of neighborhood t=2: 22
  Using 'fork' start method for multiprocessing.
  No improvement found for t=2 after processing 22 neighbors.
No improving solution found or error occurred for t=2.

Attempting neighborhood t=3 (current best cost: 57.1108)
  Exploring neighborhood t=3 in parallel (current cost: 57.1108)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Attempt 50: Base x: [2 1 1 0 1 1 1 5], Adjustment: [ 0  0  1 -1  1  0 -1  0] (Indices: [3, 5, 6]), Candidate: [ 2  1  2 -1  2  1  0  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Finished generating neighbors. Total valid neighbors found: 41
  Size of neighborhood t=3: 41
  Using 'fork' start method for multiprocessing.
  No improvement found for t=3 after processing 41 neighbors.
No improving solution found or error occurred for t=3.

Attempting neighborhood t=4 (current best cost: 57.1108)
  Exploring neighborhood t=4 in parallel (current cost: 57.1108)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Attempt 50: Base x: [2 1 1 0 1 1 1 5], Adjustment: [ 1 -1  1 -1  1 -1  1 -1] (Indices: [1, 3, 5, 7]), Candidate: [ 3  0  2 -1  2  0  2  4]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Finished generating neighbors. Total valid neighbors found: 50
  Size of neighborhood t=4: 50
  Using 'fork' start method for multiprocessing.
  No improvement found for t=4 after processing 50 neighbors.
No improving solution found or error occurred for t=4.

Attempting neighborhood t=5 (current best cost: 57.1108)
  Exploring neighborhood t=5 in parallel (current cost: 57.1108)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Attempt 50: Base x: [2 1 1 0 1 1 1 5], Adjustment: [ 1 -1  0  1  0  0  0 -1] (Indices: [1, 4, 5, 6, 7]), Candidate: [3 0 1 1 1 1 1 4]
 -> Valid neighbor added.
Finished generating neighbors. Total valid neighbors found: 41
  Size of neighborhood t=5: 41
  Using 'fork' start method for multiprocessing.
  No improvement found for t=5 after processing 41 neighbors.
No improving solution found or error occurred for t=5.

Attempting neighborhood t=6 (current best cost: 57.1108)
  Exploring neighborhood t=6 in parallel (current cost: 57.1108)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 22
  Size of neighborhood t=6: 22
  Using 'fork' start method for multiprocessing.
  No improvement found for t=6 after processing 22 neighbors.
No improving solution found or error occurred for t=6.

Attempting neighborhood t=7 (current best cost: 57.1108)
  Exploring neighborhood t=7 in parallel (current cost: 57.1108)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 7
  Size of neighborhood t=7: 7
  Using 'fork' start method for multiprocessing.
  No improvement found for t=7 after processing 7 neighbors.
No improving solution found or error occurred for t=7.

Attempting neighborhood t=8 (current best cost: 57.1108)
  Exploring neighborhood t=8 in parallel (current cost: 57.1108)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 1
  Size of neighborhood t=8: 1
  Using 'fork' start method for multiprocessing.
  No improvement found for t=8 after processing 1 neighbors.
No improving solution found or error occurred for t=8.
--------------------------------------------------
Variable Neighborhood Search finished.
Final solution: [2 1 1 0 1 1 1 5]
Final cost: 57.1108
--------------------------------------------------

--- VNS Result ---
Best solution found: [2 1 1 0 1 1 1 5]
Best cost found: 57.1108
Total execution time: 0.78 seconds

Now we will try a larger instance.

N = 22 # Number of patients
T = 20 # Number of intervals
d = 5 # Length of each interval
max_s = 20 # Maximum service time
q = 0.20 # Probability of a scheduled patient not showing up
w = 0.1 # Weight for the waiting time in objective function
l = 10
v_star = get_v_star(T)
print("v_star: \n", v_star)

i = 5  # First 5 highest values in ascending order, rest in descending order
s = generate_weighted_list(max_s, l, i)
print(s)
print("Sum:", np.sum(s[1:]))  # This should be 1
print("Weighted service time:", np.dot(np.arange(len(s)), s))  # This should be close to l
x_star = bailey_welch_schedule(T, d, N, s)
print(f"Initial schedule: {x_star}")
convolutions = compute_convolutions(s, N, q)

v_star: 
 [[-1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1]
 [ 1 -1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0]
 [ 0  1 -1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0]
 [ 0  0  1 -1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0]
 [ 0  0  0  1 -1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0]
 [ 0  0  0  0  1 -1  0  0  0  0  0  0  0  0  0  0  0  0  0  0]
 [ 0  0  0  0  0  1 -1  0  0  0  0  0  0  0  0  0  0  0  0  0]
 [ 0  0  0  0  0  0  1 -1  0  0  0  0  0  0  0  0  0  0  0  0]
 [ 0  0  0  0  0  0  0  1 -1  0  0  0  0  0  0  0  0  0  0  0]
 [ 0  0  0  0  0  0  0  0  1 -1  0  0  0  0  0  0  0  0  0  0]
 [ 0  0  0  0  0  0  0  0  0  1 -1  0  0  0  0  0  0  0  0  0]
 [ 0  0  0  0  0  0  0  0  0  0  1 -1  0  0  0  0  0  0  0  0]
 [ 0  0  0  0  0  0  0  0  0  0  0  1 -1  0  0  0  0  0  0  0]
 [ 0  0  0  0  0  0  0  0  0  0  0  0  1 -1  0  0  0  0  0  0]
 [ 0  0  0  0  0  0  0  0  0  0  0  0  0  1 -1  0  0  0  0  0]
 [ 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 -1  0  0  0  0]
 [ 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 -1  0  0  0]
 [ 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 -1  0  0]
 [ 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 -1  0]
 [ 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 -1]]
[0.         0.00192023 0.00965074 0.02322618 0.11262943 0.15137384
 0.10015698 0.09431241 0.07074592 0.06735769 0.05321154 0.05210921
 0.05115596 0.04284618 0.03879572 0.03597808 0.02798924 0.02179162
 0.02004736 0.01279392 0.01190774]
Sum: 1.0000000000098572
Weighted service time: 8.750979565339122
Initial schedule: [2, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 10]

# Computing optimal solution with real cost
start = time.time()
test_x = local_search(x_star, d, convolutions, w, v_star, T, echo=True)
end = time.time()
print(f"Time taken for local search: {end - start:.2f} seconds")

Initial solution: [ 2  1  0  1  0  1  0  1  1  0  1  0  1  0  1  1  0  1  0 10], cost: 107.27429806880195
Running local search with switching 1 patient(s)
Size of neighborhood: 12
Found better solution: [ 2  1  0  1  0  1  1  0  1  0  1  0  1  0  1  1  0  1  0 10], cost: 107.25398203255153
Running local search with switching 1 patient(s)
Size of neighborhood: 12
Found better solution: [ 2  1  0  1  0  1  1  0  1  0  1  0  1  1  0  1  0  1  0 10], cost: 106.90635987152639
Running local search with switching 1 patient(s)
Size of neighborhood: 12
Found better solution: [ 2  1  0  1  0  1  1  0  1  0  1  1  0  1  0  1  0  1  0 10], cost: 106.76089679746309
Running local search with switching 1 patient(s)
Size of neighborhood: 12
Found better solution: [ 2  1  0  1  0  1  1  0  1  0  1  1  0  1  0  1  1  0  0 10], cost: 106.51012951906256
Running local search with switching 1 patient(s)
Size of neighborhood: 12
Found better solution: [ 2  1  0  1  0  1  1  0  1  1  0  1  0  1  0  1  1  0  0 10], cost: 106.4927797857604
Running local search with switching 1 patient(s)
Size of neighborhood: 12
Found better solution: [ 2  1  0  1  0  1  1  0  1  1  0  1  0  1  1  0  1  0  0 10], cost: 106.37812877916865
Running local search with switching 1 patient(s)
Size of neighborhood: 12
Found better solution: [2 1 0 1 0 1 1 0 1 1 0 1 0 1 1 0 1 0 1 9], cost: 103.23213136907579
Running local search with switching 1 patient(s)
Size of neighborhood: 13
Found better solution: [2 1 0 1 1 0 1 0 1 1 0 1 0 1 1 0 1 0 1 9], cost: 103.22703819525987
Running local search with switching 1 patient(s)
Size of neighborhood: 13
Found better solution: [2 1 0 1 1 0 1 0 1 1 0 1 1 0 1 0 1 0 1 9], cost: 103.09979867314706
Running local search with switching 1 patient(s)
Size of neighborhood: 13
Found better solution: [2 1 0 1 1 0 1 1 0 1 0 1 1 0 1 0 1 0 1 9], cost: 103.08477099925769
Running local search with switching 1 patient(s)
Size of neighborhood: 13
Found better solution: [2 1 0 1 1 0 1 1 0 1 0 1 1 0 1 1 0 0 1 9], cost: 103.05111850999474
Running local search with switching 1 patient(s)
Size of neighborhood: 13
Found better solution: [2 1 0 1 1 0 1 1 0 1 1 0 1 0 1 1 0 0 1 9], cost: 103.04483395638098
Running local search with switching 1 patient(s)
Size of neighborhood: 13
Found better solution: [2 1 0 1 1 0 1 1 0 1 1 0 1 0 1 1 0 1 0 9], cost: 101.82668430990311
Running local search with switching 1 patient(s)
Size of neighborhood: 13
Found better solution: [2 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 0 1 0 9], cost: 101.75957472650931
Running local search with switching 1 patient(s)
Size of neighborhood: 13
Found better solution: [2 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 0 9], cost: 101.73881737057354
Running local search with switching 1 patient(s)
Size of neighborhood: 13
Found better solution: [2 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 8], cost: 99.82377069961305
Running local search with switching 1 patient(s)
Size of neighborhood: 14
Found better solution: [2 1 0 1 1 0 1 1 0 1 1 0 1 1 1 0 1 0 1 8], cost: 99.81965941798984
Running local search with switching 1 patient(s)
Size of neighborhood: 14
Found better solution: [2 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1 0 1 8], cost: 99.8034657857529
Running local search with switching 1 patient(s)
Size of neighborhood: 14
Found better solution: [2 1 0 1 1 0 1 1 1 0 1 1 0 1 1 0 1 0 1 8], cost: 99.78099792140264
Running local search with switching 1 patient(s)
Size of neighborhood: 14
Found better solution: [2 1 0 1 1 1 0 1 1 0 1 1 0 1 1 0 1 0 1 8], cost: 99.7594081394088
Running local search with switching 1 patient(s)
Size of neighborhood: 14
Found better solution: [2 1 0 1 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 8], cost: 99.3314573408409
Running local search with switching 1 patient(s)
Size of neighborhood: 14
Found better solution: [2 1 0 1 1 1 0 1 1 0 1 1 0 1 1 0 1 1 1 7], cost: 98.73902131248309
Running local search with switching 1 patient(s)
Size of neighborhood: 15
Found better solution: [2 1 0 1 1 1 0 1 1 0 1 1 0 1 1 1 0 1 1 7], cost: 98.62669493250665
Running local search with switching 1 patient(s)
Size of neighborhood: 15
Found better solution: [2 1 1 0 1 1 0 1 1 0 1 1 0 1 1 1 0 1 1 7], cost: 98.62619354182672
Running local search with switching 1 patient(s)
Size of neighborhood: 15
Found better solution: [2 1 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1 1 7], cost: 98.59687811226715
Running local search with switching 1 patient(s)
Size of neighborhood: 15
Found better solution: [2 1 1 0 1 1 0 1 1 0 1 1 1 0 1 1 1 0 1 7], cost: 98.56425881038038
Running local search with switching 1 patient(s)
Size of neighborhood: 15
Found better solution: [2 1 1 0 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 7], cost: 98.55091551134987
Running local search with switching 1 patient(s)
Size of neighborhood: 15
Running local search with switching 2 patient(s)
Size of neighborhood: 110
Found better solution: [2 1 1 0 1 1 0 1 1 1 0 1 1 0 1 1 1 1 1 6], cost: 98.506761816214
Running local search with switching 1 patient(s)
Size of neighborhood: 16
Found better solution: [2 1 1 0 1 1 0 1 1 1 0 1 1 1 0 1 1 1 1 6], cost: 98.4793304225231
Running local search with switching 1 patient(s)
Size of neighborhood: 16
Found better solution: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], cost: 98.46626073068686
Running local search with switching 1 patient(s)
Size of neighborhood: 16
Running local search with switching 2 patient(s)
Size of neighborhood: 124
Running local search with switching 3 patient(s)
Size of neighborhood: 620
Running local search with switching 4 patient(s)
Size of neighborhood: 2246
Running local search with switching 5 patient(s)
Size of neighborhood: 6272
Running local search with switching 6 patient(s)
Size of neighborhood: 14018
Running local search with switching 7 patient(s)
Size of neighborhood: 25688
Running local search with switching 8 patient(s)
Size of neighborhood: 39209
Running local search with switching 9 patient(s)
Size of neighborhood: 50348
Running local search with switching 10 patient(s)
Size of neighborhood: 54692
Running local search with switching 11 patient(s)
Size of neighborhood: 50348
Running local search with switching 12 patient(s)
Size of neighborhood: 39209
Running local search with switching 13 patient(s)
Size of neighborhood: 25688
Running local search with switching 14 patient(s)
Size of neighborhood: 14018
Running local search with switching 15 patient(s)
Size of neighborhood: 6272
Running local search with switching 16 patient(s)
Size of neighborhood: 2246
Running local search with switching 17 patient(s)
Size of neighborhood: 620
Running local search with switching 18 patient(s)
Size of neighborhood: 124
Running local search with switching 19 patient(s)
Size of neighborhood: 16
Time taken for local search: 157.03 seconds

# This guard is ESSENTIAL for multiprocessing in notebooks/scripts
if __name__ == "__main__":
    # Ensure freeze_support is called (good practice)
    mp.freeze_support()

    print("Starting VNS from Quarto...")
    start_time = time.time()

    # Call the imported function
    best_solution, best_cost = variable_neighborhood_search(
        x_init=x_star,
        d=d,
        convolutions=convolutions,
        w=w,
        v_star=v_star,
        echo=True # Set to False for less output
    )

    end_time = time.time()
    print("\n--- VNS Result ---")
    print(f"Best solution found: {best_solution}")
    print(f"Best cost found: {best_cost:.4f}")
    print(f"Total execution time: {end_time - start_time:.2f} seconds")

Starting VNS from Quarto...
--------------------------------------------------
Starting Variable Neighborhood Search
Initial solution: [ 2  1  0  1  0  1  0  1  1  0  1  0  1  0  1  1  0  1  0 10], Initial cost: 107.2743
Max neighborhood size (t): 20
Number of parallel workers: 15
--------------------------------------------------

Attempting neighborhood t=1 (current best cost: 107.2743)
  Exploring neighborhood t=1 in parallel (current cost: 107.2743)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 12
  Size of neighborhood t=1: 12
  Using 'fork' start method for multiprocessing.
  Found potentially better solution (t=1): cost 107.2540 (neighbor: [ 2  1  0  1  0  1  1  0  1  0  1  0  1  0  1  1  0  1  0 10]). Stopping parallel search for t=1.
Improvement found! Updating best solution (t=1).
  Old cost: 107.2743 -> New cost: 107.2540
  New solution: [ 2  1  0  1  0  1  1  0  1  0  1  0  1  0  1  1  0  1  0 10]
Restarting search from t=1.

Attempting neighborhood t=1 (current best cost: 107.2540)
  Exploring neighborhood t=1 in parallel (current cost: 107.2540)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 12
  Size of neighborhood t=1: 12
  Using 'fork' start method for multiprocessing.
  Found potentially better solution (t=1): cost 106.9064 (neighbor: [ 2  1  0  1  0  1  1  0  1  0  1  0  1  1  0  1  0  1  0 10]). Stopping parallel search for t=1.
Improvement found! Updating best solution (t=1).
  Old cost: 107.2540 -> New cost: 106.9064
  New solution: [ 2  1  0  1  0  1  1  0  1  0  1  0  1  1  0  1  0  1  0 10]
Restarting search from t=1.

Attempting neighborhood t=1 (current best cost: 106.9064)
  Exploring neighborhood t=1 in parallel (current cost: 106.9064)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 12
  Size of neighborhood t=1: 12
  Using 'fork' start method for multiprocessing.
  Found potentially better solution (t=1): cost 106.7609 (neighbor: [ 2  1  0  1  0  1  1  0  1  0  1  1  0  1  0  1  0  1  0 10]). Stopping parallel search for t=1.
Improvement found! Updating best solution (t=1).
  Old cost: 106.9064 -> New cost: 106.7609
  New solution: [ 2  1  0  1  0  1  1  0  1  0  1  1  0  1  0  1  0  1  0 10]
Restarting search from t=1.

Attempting neighborhood t=1 (current best cost: 106.7609)
  Exploring neighborhood t=1 in parallel (current cost: 106.7609)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 12
  Size of neighborhood t=1: 12
  Using 'fork' start method for multiprocessing.
  Found potentially better solution (t=1): cost 104.5819 (neighbor: [2 1 0 1 0 1 1 0 1 0 1 1 0 1 0 1 0 1 1 9]). Stopping parallel search for t=1.
Improvement found! Updating best solution (t=1).
  Old cost: 106.7609 -> New cost: 104.5819
  New solution: [2 1 0 1 0 1 1 0 1 0 1 1 0 1 0 1 0 1 1 9]
Restarting search from t=1.

Attempting neighborhood t=1 (current best cost: 104.5819)
  Exploring neighborhood t=1 in parallel (current cost: 104.5819)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 13
  Size of neighborhood t=1: 13
  Using 'fork' start method for multiprocessing.
  Found potentially better solution (t=1): cost 104.5387 (neighbor: [2 1 0 1 0 1 1 0 1 1 0 1 0 1 0 1 0 1 1 9]). Stopping parallel search for t=1.
Improvement found! Updating best solution (t=1).
  Old cost: 104.5819 -> New cost: 104.5387
  New solution: [2 1 0 1 0 1 1 0 1 1 0 1 0 1 0 1 0 1 1 9]
Restarting search from t=1.

Attempting neighborhood t=1 (current best cost: 104.5387)
  Exploring neighborhood t=1 in parallel (current cost: 104.5387)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 13
  Size of neighborhood t=1: 13
  Using 'fork' start method for multiprocessing.
  Found potentially better solution (t=1): cost 104.4423 (neighbor: [2 1 0 1 0 1 1 0 1 1 0 1 0 1 1 0 0 1 1 9]). Stopping parallel search for t=1.
Improvement found! Updating best solution (t=1).
  Old cost: 104.5387 -> New cost: 104.4423
  New solution: [2 1 0 1 0 1 1 0 1 1 0 1 0 1 1 0 0 1 1 9]
Restarting search from t=1.

Attempting neighborhood t=1 (current best cost: 104.4423)
  Exploring neighborhood t=1 in parallel (current cost: 104.4423)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 13
  Size of neighborhood t=1: 13
  Using 'fork' start method for multiprocessing.
  Found potentially better solution (t=1): cost 104.3231 (neighbor: [2 1 0 1 0 1 1 0 1 1 0 1 0 1 1 0 0 2 0 9]). Stopping parallel search for t=1.
Improvement found! Updating best solution (t=1).
  Old cost: 104.4423 -> New cost: 104.3231
  New solution: [2 1 0 1 0 1 1 0 1 1 0 1 0 1 1 0 0 2 0 9]
Restarting search from t=1.

Attempting neighborhood t=1 (current best cost: 104.3231)
  Exploring neighborhood t=1 in parallel (current cost: 104.3231)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 12
  Size of neighborhood t=1: 12
  Using 'fork' start method for multiprocessing.
  Found potentially better solution (t=1): cost 104.3195 (neighbor: [2 1 0 1 0 1 1 0 1 1 0 1 1 0 1 0 0 2 0 9]). Stopping parallel search for t=1.
Improvement found! Updating best solution (t=1).
  Old cost: 104.3231 -> New cost: 104.3195
  New solution: [2 1 0 1 0 1 1 0 1 1 0 1 1 0 1 0 0 2 0 9]
Restarting search from t=1.

Attempting neighborhood t=1 (current best cost: 104.3195)
  Exploring neighborhood t=1 in parallel (current cost: 104.3195)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 12
  Size of neighborhood t=1: 12
  Using 'fork' start method for multiprocessing.
  Found potentially better solution (t=1): cost 104.3168 (neighbor: [2 1 0 1 1 0 1 0 1 1 0 1 1 0 1 0 0 2 0 9]). Stopping parallel search for t=1.
Improvement found! Updating best solution (t=1).
  Old cost: 104.3195 -> New cost: 104.3168
  New solution: [2 1 0 1 1 0 1 0 1 1 0 1 1 0 1 0 0 2 0 9]
Restarting search from t=1.

Attempting neighborhood t=1 (current best cost: 104.3168)
  Exploring neighborhood t=1 in parallel (current cost: 104.3168)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 12
  Size of neighborhood t=1: 12
  Using 'fork' start method for multiprocessing.
  Found potentially better solution (t=1): cost 102.2466 (neighbor: [2 1 0 1 1 0 1 0 1 1 0 1 1 0 1 0 1 1 0 9]). Stopping parallel search for t=1.
Improvement found! Updating best solution (t=1).
  Old cost: 104.3168 -> New cost: 102.2466
  New solution: [2 1 0 1 1 0 1 0 1 1 0 1 1 0 1 0 1 1 0 9]
Restarting search from t=1.

Attempting neighborhood t=1 (current best cost: 102.2466)
  Exploring neighborhood t=1 in parallel (current cost: 102.2466)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 13
  Size of neighborhood t=1: 13
  Using 'fork' start method for multiprocessing.
  Found potentially better solution (t=1): cost 102.2060 (neighbor: [2 1 0 1 1 0 1 1 0 1 0 1 1 0 1 0 1 1 0 9]). Stopping parallel search for t=1.
Improvement found! Updating best solution (t=1).
  Old cost: 102.2466 -> New cost: 102.2060
  New solution: [2 1 0 1 1 0 1 1 0 1 0 1 1 0 1 0 1 1 0 9]
Restarting search from t=1.

Attempting neighborhood t=1 (current best cost: 102.2060)
  Exploring neighborhood t=1 in parallel (current cost: 102.2060)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 13
  Size of neighborhood t=1: 13
  Using 'fork' start method for multiprocessing.
  Found potentially better solution (t=1): cost 102.1900 (neighbor: [2 1 0 1 1 0 1 1 0 1 1 0 1 0 1 0 1 1 0 9]). Stopping parallel search for t=1.
Improvement found! Updating best solution (t=1).
  Old cost: 102.2060 -> New cost: 102.1900
  New solution: [2 1 0 1 1 0 1 1 0 1 1 0 1 0 1 0 1 1 0 9]
Restarting search from t=1.

Attempting neighborhood t=1 (current best cost: 102.1900)
  Exploring neighborhood t=1 in parallel (current cost: 102.1900)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 13
  Size of neighborhood t=1: 13
  Using 'fork' start method for multiprocessing.
  Found potentially better solution (t=1): cost 101.8267 (neighbor: [2 1 0 1 1 0 1 1 0 1 1 0 1 0 1 1 0 1 0 9]). Stopping parallel search for t=1.
Improvement found! Updating best solution (t=1).
  Old cost: 102.1900 -> New cost: 101.8267
  New solution: [2 1 0 1 1 0 1 1 0 1 1 0 1 0 1 1 0 1 0 9]
Restarting search from t=1.

Attempting neighborhood t=1 (current best cost: 101.8267)
  Exploring neighborhood t=1 in parallel (current cost: 101.8267)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 13
  Size of neighborhood t=1: 13
  Using 'fork' start method for multiprocessing.
  Found potentially better solution (t=1): cost 101.7596 (neighbor: [2 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 0 1 0 9]). Stopping parallel search for t=1.
Improvement found! Updating best solution (t=1).
  Old cost: 101.8267 -> New cost: 101.7596
  New solution: [2 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 0 1 0 9]
Restarting search from t=1.

Attempting neighborhood t=1 (current best cost: 101.7596)
  Exploring neighborhood t=1 in parallel (current cost: 101.7596)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 13
  Size of neighborhood t=1: 13
  Using 'fork' start method for multiprocessing.
  Found potentially better solution (t=1): cost 101.7388 (neighbor: [2 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 0 9]). Stopping parallel search for t=1.
Improvement found! Updating best solution (t=1).
  Old cost: 101.7596 -> New cost: 101.7388
  New solution: [2 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 0 9]
Restarting search from t=1.

Attempting neighborhood t=1 (current best cost: 101.7388)
  Exploring neighborhood t=1 in parallel (current cost: 101.7388)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 13
  Size of neighborhood t=1: 13
  Using 'fork' start method for multiprocessing.
  Found potentially better solution (t=1): cost 99.8238 (neighbor: [2 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 8]). Stopping parallel search for t=1.
Improvement found! Updating best solution (t=1).
  Old cost: 101.7388 -> New cost: 99.8238
  New solution: [2 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 8]
Restarting search from t=1.

Attempting neighborhood t=1 (current best cost: 99.8238)
  Exploring neighborhood t=1 in parallel (current cost: 99.8238)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 14
  Size of neighborhood t=1: 14
  Using 'fork' start method for multiprocessing.
  Found potentially better solution (t=1): cost 99.8197 (neighbor: [2 1 0 1 1 0 1 1 0 1 1 0 1 1 1 0 1 0 1 8]). Stopping parallel search for t=1.
Improvement found! Updating best solution (t=1).
  Old cost: 99.8238 -> New cost: 99.8197
  New solution: [2 1 0 1 1 0 1 1 0 1 1 0 1 1 1 0 1 0 1 8]
Restarting search from t=1.

Attempting neighborhood t=1 (current best cost: 99.8197)
  Exploring neighborhood t=1 in parallel (current cost: 99.8197)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 14
  Size of neighborhood t=1: 14
  Using 'fork' start method for multiprocessing.
  Found potentially better solution (t=1): cost 99.8035 (neighbor: [2 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1 0 1 8]). Stopping parallel search for t=1.
Improvement found! Updating best solution (t=1).
  Old cost: 99.8197 -> New cost: 99.8035
  New solution: [2 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1 0 1 8]
Restarting search from t=1.

Attempting neighborhood t=1 (current best cost: 99.8035)
  Exploring neighborhood t=1 in parallel (current cost: 99.8035)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 14
  Size of neighborhood t=1: 14
  Using 'fork' start method for multiprocessing.
  Found potentially better solution (t=1): cost 99.7810 (neighbor: [2 1 0 1 1 0 1 1 1 0 1 1 0 1 1 0 1 0 1 8]). Stopping parallel search for t=1.
Improvement found! Updating best solution (t=1).
  Old cost: 99.8035 -> New cost: 99.7810
  New solution: [2 1 0 1 1 0 1 1 1 0 1 1 0 1 1 0 1 0 1 8]
Restarting search from t=1.

Attempting neighborhood t=1 (current best cost: 99.7810)
  Exploring neighborhood t=1 in parallel (current cost: 99.7810)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 14
  Size of neighborhood t=1: 14
  Using 'fork' start method for multiprocessing.
  Found potentially better solution (t=1): cost 99.7594 (neighbor: [2 1 0 1 1 1 0 1 1 0 1 1 0 1 1 0 1 0 1 8]). Stopping parallel search for t=1.
Improvement found! Updating best solution (t=1).
  Old cost: 99.7810 -> New cost: 99.7594
  New solution: [2 1 0 1 1 1 0 1 1 0 1 1 0 1 1 0 1 0 1 8]
Restarting search from t=1.

Attempting neighborhood t=1 (current best cost: 99.7594)
  Exploring neighborhood t=1 in parallel (current cost: 99.7594)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 14
  Size of neighborhood t=1: 14
  Using 'fork' start method for multiprocessing.
  Found potentially better solution (t=1): cost 99.3315 (neighbor: [2 1 0 1 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 8]). Stopping parallel search for t=1.
Improvement found! Updating best solution (t=1).
  Old cost: 99.7594 -> New cost: 99.3315
  New solution: [2 1 0 1 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 8]
Restarting search from t=1.

Attempting neighborhood t=1 (current best cost: 99.3315)
  Exploring neighborhood t=1 in parallel (current cost: 99.3315)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 14
  Size of neighborhood t=1: 14
  Using 'fork' start method for multiprocessing.
  Found potentially better solution (t=1): cost 98.7390 (neighbor: [2 1 0 1 1 1 0 1 1 0 1 1 0 1 1 0 1 1 1 7]). Stopping parallel search for t=1.
Improvement found! Updating best solution (t=1).
  Old cost: 99.3315 -> New cost: 98.7390
  New solution: [2 1 0 1 1 1 0 1 1 0 1 1 0 1 1 0 1 1 1 7]
Restarting search from t=1.

Attempting neighborhood t=1 (current best cost: 98.7390)
  Exploring neighborhood t=1 in parallel (current cost: 98.7390)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 15
  Size of neighborhood t=1: 15
  Using 'fork' start method for multiprocessing.
  Found potentially better solution (t=1): cost 98.6267 (neighbor: [2 1 0 1 1 1 0 1 1 0 1 1 0 1 1 1 0 1 1 7]). Stopping parallel search for t=1.
Improvement found! Updating best solution (t=1).
  Old cost: 98.7390 -> New cost: 98.6267
  New solution: [2 1 0 1 1 1 0 1 1 0 1 1 0 1 1 1 0 1 1 7]
Restarting search from t=1.

Attempting neighborhood t=1 (current best cost: 98.6267)
  Exploring neighborhood t=1 in parallel (current cost: 98.6267)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 15
  Size of neighborhood t=1: 15
  Using 'fork' start method for multiprocessing.
  Found potentially better solution (t=1): cost 98.6262 (neighbor: [2 1 1 0 1 1 0 1 1 0 1 1 0 1 1 1 0 1 1 7]). Stopping parallel search for t=1.
Improvement found! Updating best solution (t=1).
  Old cost: 98.6267 -> New cost: 98.6262
  New solution: [2 1 1 0 1 1 0 1 1 0 1 1 0 1 1 1 0 1 1 7]
Restarting search from t=1.

Attempting neighborhood t=1 (current best cost: 98.6262)
  Exploring neighborhood t=1 in parallel (current cost: 98.6262)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 15
  Size of neighborhood t=1: 15
  Using 'fork' start method for multiprocessing.
  Found potentially better solution (t=1): cost 98.5969 (neighbor: [2 1 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1 1 7]). Stopping parallel search for t=1.
Improvement found! Updating best solution (t=1).
  Old cost: 98.6262 -> New cost: 98.5969
  New solution: [2 1 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1 1 7]
Restarting search from t=1.

Attempting neighborhood t=1 (current best cost: 98.5969)
  Exploring neighborhood t=1 in parallel (current cost: 98.5969)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 15
  Size of neighborhood t=1: 15
  Using 'fork' start method for multiprocessing.
  Found potentially better solution (t=1): cost 98.5643 (neighbor: [2 1 1 0 1 1 0 1 1 0 1 1 1 0 1 1 1 0 1 7]). Stopping parallel search for t=1.
Improvement found! Updating best solution (t=1).
  Old cost: 98.5969 -> New cost: 98.5643
  New solution: [2 1 1 0 1 1 0 1 1 0 1 1 1 0 1 1 1 0 1 7]
Restarting search from t=1.

Attempting neighborhood t=1 (current best cost: 98.5643)
  Exploring neighborhood t=1 in parallel (current cost: 98.5643)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 15
  Size of neighborhood t=1: 15
  Using 'fork' start method for multiprocessing.
  Found potentially better solution (t=1): cost 98.5509 (neighbor: [2 1 1 0 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 7]). Stopping parallel search for t=1.
Improvement found! Updating best solution (t=1).
  Old cost: 98.5643 -> New cost: 98.5509
  New solution: [2 1 1 0 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 7]
Restarting search from t=1.

Attempting neighborhood t=1 (current best cost: 98.5509)
  Exploring neighborhood t=1 in parallel (current cost: 98.5509)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 15
  Size of neighborhood t=1: 15
  Using 'fork' start method for multiprocessing.
  No improvement found for t=1 after processing 15 neighbors.
No improving solution found or error occurred for t=1.

Attempting neighborhood t=2 (current best cost: 98.5509)
  Exploring neighborhood t=2 in parallel (current cost: 98.5509)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Attempt 50: Base x: [2 1 1 0 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 7], Adjustment: [ 0  1 -1  0  0  0  0  0  0  0  0  0  0  0  1 -1  0  0  0  0] (Indices: [2, 15]), Candidate: [2 2 0 0 1 1 0 1 1 1 0 1 1 0 2 0 1 0 1 7]
 -> Valid neighbor added.
Attempt 100: Base x: [2 1 1 0 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 7], Adjustment: [ 0  0  0  0  0  1  0 -1  0  0  0  0  0  0  0  0  0  0  0  0] (Indices: [6, 7]), Candidate: [2 1 1 0 1 2 0 0 1 1 0 1 1 0 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 150: Base x: [2 1 1 0 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 7], Adjustment: [ 0  0  0  0  0  0  0  0  0  1 -1  0  0  0  1 -1  0  0  0  0] (Indices: [10, 15]), Candidate: [ 2  1  1  0  1  1  0  1  1  2 -1  1  1  0  2  0  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Finished generating neighbors. Total valid neighbors found: 110
  Size of neighborhood t=2: 110
  Using 'fork' start method for multiprocessing.
  Found potentially better solution (t=2): cost 98.5068 (neighbor: [2 1 1 0 1 1 0 1 1 1 0 1 1 0 1 1 1 1 1 6]). Stopping parallel search for t=2.
Improvement found! Updating best solution (t=2).
  Old cost: 98.5509 -> New cost: 98.5068
  New solution: [2 1 1 0 1 1 0 1 1 1 0 1 1 0 1 1 1 1 1 6]
Restarting search from t=1.

Attempting neighborhood t=1 (current best cost: 98.5068)
  Exploring neighborhood t=1 in parallel (current cost: 98.5068)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 16
  Size of neighborhood t=1: 16
  Using 'fork' start method for multiprocessing.
  Found potentially better solution (t=1): cost 98.4793 (neighbor: [2 1 1 0 1 1 0 1 1 1 0 1 1 1 0 1 1 1 1 6]). Stopping parallel search for t=1.
Improvement found! Updating best solution (t=1).
  Old cost: 98.5068 -> New cost: 98.4793
  New solution: [2 1 1 0 1 1 0 1 1 1 0 1 1 1 0 1 1 1 1 6]
Restarting search from t=1.

Attempting neighborhood t=1 (current best cost: 98.4793)
  Exploring neighborhood t=1 in parallel (current cost: 98.4793)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 16
  Size of neighborhood t=1: 16
  Using 'fork' start method for multiprocessing.
  Found potentially better solution (t=1): cost 98.4663 (neighbor: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6]). Stopping parallel search for t=1.
Improvement found! Updating best solution (t=1).
  Old cost: 98.4793 -> New cost: 98.4663
  New solution: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6]
Restarting search from t=1.

Attempting neighborhood t=1 (current best cost: 98.4663)
  Exploring neighborhood t=1 in parallel (current cost: 98.4663)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 16
  Size of neighborhood t=1: 16
  Using 'fork' start method for multiprocessing.
  No improvement found for t=1 after processing 16 neighbors.
No improving solution found or error occurred for t=1.

Attempting neighborhood t=2 (current best cost: 98.4663)
  Exploring neighborhood t=2 in parallel (current cost: 98.4663)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Attempt 50: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  0  0  0  0  0  0  1 -1  0  0  0  0] (Indices: [2, 15]), Candidate: [2 2 0 0 1 1 1 0 1 1 0 1 1 1 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  0  0  0  0  0  0  0  0  0  0  0  0] (Indices: [6, 7]), Candidate: [ 2  1  1  0  1  2  1 -1  1  1  0  1  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0  1 -1  0  0  0  1 -1  0  0  0  0] (Indices: [10, 15]), Candidate: [ 2  1  1  0  1  1  1  0  1  2 -1  1  1  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Finished generating neighbors. Total valid neighbors found: 124
  Size of neighborhood t=2: 124
  Using 'fork' start method for multiprocessing.
  No improvement found for t=2 after processing 124 neighbors.
No improving solution found or error occurred for t=2.

Attempting neighborhood t=3 (current best cost: 98.4663)
  Exploring neighborhood t=3 in parallel (current cost: 98.4663)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Attempt 50: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 -1  1] (Indices: [0, 3, 18]), Candidate: [ 1  1  2 -1  1  1  1  0  1  1  0  1  1  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  0  0  0  0  0  1 -1  0  0  0  0  1] (Indices: [0, 7, 14]), Candidate: [ 1  1  1  0  1  1  2 -1  1  1  0  1  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  0  0  0  1 -1  0  0  0  0  0  1  0] (Indices: [0, 12, 19]), Candidate: [1 1 1 0 1 1 1 0 1 1 0 2 0 1 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  0  0  0  0  0  0  1 -1  0  0  0  0] (Indices: [1, 3, 15]), Candidate: [ 3  0  2 -1  1  1  1  0  1  1  0  1  1  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  0  0  1 -1  0  0  0  0  0  0  0  0] (Indices: [1, 7, 11]), Candidate: [ 3  0  1  0  1  1  2 -1  1  1  1  0  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  0  0  0  1 -1  0  0  1 -1  0  0  0] (Indices: [1, 12, 16]), Candidate: [3 0 1 0 1 1 1 0 1 1 0 2 0 1 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  0  0  0  0  0  1 -1  0  0  0  0  0] (Indices: [2, 4, 14]), Candidate: [ 2  2  0  1  0  1  1  0  1  1  0  1  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1 -1  0  0  0  0  1 -1  0  0  0  0  0] (Indices: [2, 8, 14]), Candidate: [ 2  2  0  0  1  1  1  1  0  1  0  1  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  0  0  0  0  0  1 -1  0  0  0  1 -1] (Indices: [2, 14, 19]), Candidate: [ 2  2  0  0  1  1  1  0  1  1  0  1  1  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  0  0  0  0  0  0  0  0  1 -1  0  0] (Indices: [3, 6, 17]), Candidate: [ 2  1  2 -1  1  2  0  0  1  1  0  1  1  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  0  0  1 -1  0  0  0  0  1 -1  0  0] (Indices: [3, 11, 17]), Candidate: [ 2  1  2 -1  1  1  1  0  1  1  1  0  1  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  0  0  0  1 -1  0  0  0  0  0  0  0] (Indices: [4, 6, 12]), Candidate: [2 1 1 1 0 2 0 0 1 1 0 2 0 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  0  0  1  0 -1  0  0  0  0  0  0  0] (Indices: [4, 11, 12]), Candidate: [2 1 1 1 0 1 1 0 1 1 1 1 0 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  1 -1  0  0  0  0  0  0  0  0  0  0] (Indices: [5, 7, 9]), Candidate: [ 2  1  1  0  2  0  2 -1  2  0  0  1  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  0  0  0  1 -1  1 -1  0  0  0  0  0] (Indices: [5, 12, 14]), Candidate: [ 2  1  1  0  2  0  1  0  1  1  0  2  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  1  0 -1  0  0  0  0  0  0  0  0  0] (Indices: [6, 9, 10]), Candidate: [ 2  1  1  0  1  2  0  0  2  1 -1  1  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  0  0  0  0  0  0  0  1 -1  1 -1  0] (Indices: [6, 16, 18]), Candidate: [2 1 1 0 1 2 0 0 1 1 0 1 1 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  0  0  0  0  1  0 -1  0  0  0  0  0] (Indices: [7, 13, 14]), Candidate: [ 2  1  1  0  1  1  2 -1  1  1  0  1  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1 -1  0  0  1 -1  0  1 -1  0  0  0  0] (Indices: [8, 12, 15]), Candidate: [2 1 1 0 1 1 1 1 0 1 0 2 0 1 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 1000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  1 -1  0  0  1  0 -1  0  0  0  0  0] (Indices: [9, 13, 14]), Candidate: [ 2  1  1  0  1  1  1  0  2  0  0  1  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0  1 -1  0  0  0  1 -1  0  0  1 -1] (Indices: [10, 15, 19]), Candidate: [ 2  1  1  0  1  1  1  0  1  2 -1  1  1  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0  0  0  1 -1  0  0  1  0 -1  0  0] (Indices: [12, 16, 17]), Candidate: [2 1 1 0 1 1 1 0 1 1 0 2 0 1 0 2 1 0 1 6]
 -> Valid neighbor added.
Finished generating neighbors. Total valid neighbors found: 620
  Size of neighborhood t=3: 620
  Using 'fork' start method for multiprocessing.
  No improvement found for t=3 after processing 620 neighbors.
No improving solution found or error occurred for t=3.

Attempting neighborhood t=4 (current best cost: 98.4663)
  Exploring neighborhood t=4 in parallel (current cost: 98.4663)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Attempt 50: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  0  0  0  0  0  0  0  0  0  0  0  1] (Indices: [0, 1, 5, 7]), Candidate: [ 2  0  1  0  2  0  2 -1  1  1  0  1  1  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  1 -1  1 -1  0  0  0  0  0  0  0  1] (Indices: [0, 1, 9, 11]), Candidate: [2 0 1 0 1 1 1 0 2 0 1 0 1 1 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 -1  0  1  0] (Indices: [0, 1, 16, 19]), Candidate: [2 0 1 0 1 1 1 0 1 1 0 1 1 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1 -1  0  0  0  0  0  0  0  0  0  0  1] (Indices: [0, 2, 6, 8]), Candidate: [1 2 0 0 1 2 0 1 0 1 0 1 1 1 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  0  1 -1  0  0  0  0  1 -1  0  0  1] (Indices: [0, 2, 10, 16]), Candidate: [ 1  2  0  0  1  1  1  0  1  2 -1  1  1  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  0  0  0  0  0  0  1 -1  0  0  0  1] (Indices: [0, 3, 4, 15]), Candidate: [1 1 2 0 0 1 1 0 1 1 0 1 1 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1 -1  0  0  0  0  0  1 -1  0  0  0  1] (Indices: [0, 3, 8, 15]), Candidate: [ 1  1  2 -1  1  1  1  1  0  1  0  1  1  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  0  0  0  0  0  0  1  0 -1  0  0  1] (Indices: [0, 3, 15, 16]), Candidate: [ 1  1  2 -1  1  1  1  0  1  1  0  1  1  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1 -1  1 -1  0  0  0  0  0  0  0  0  1] (Indices: [0, 4, 8, 10]), Candidate: [ 1  1  1  1  0  1  1  1  0  2 -1  1  1  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  0  0  0  0  0  1  0 -1  0  0  0  1] (Indices: [0, 4, 14, 15]), Candidate: [1 1 1 1 0 1 1 0 1 1 0 1 1 2 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1 -1  0  0  0  0  0  0  0  0  0  1  0] (Indices: [0, 5, 8, 19]), Candidate: [1 1 1 0 2 0 1 1 0 1 0 1 1 1 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  0  0  0  0  0  0  0  1  0 -1  0  1] (Indices: [0, 5, 16, 17]), Candidate: [1 1 1 0 2 0 1 0 1 1 0 1 1 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  0  0  1 -1  0  1 -1  0  0  0  0  1] (Indices: [0, 6, 11, 14]), Candidate: [ 1  1  1  0  1  2  0  0  1  1  1  0  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  1 -1  0  0  0  0  1 -1  0  0  0  1] (Indices: [0, 7, 9, 15]), Candidate: [ 1  1  1  0  1  1  2 -1  2  0  0  1  1  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1  0  0 -1  0  0  0  0  0  0  0  0  1] (Indices: [0, 8, 9, 10]), Candidate: [ 1  1  1  0  1  1  1  1  1  1 -1  1  1  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1 -1  0  0  0  0  0  0  1 -1  1 -1  1] (Indices: [0, 8, 16, 18]), Candidate: [1 1 1 0 1 1 1 1 0 1 0 1 1 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  0  1  0  0 -1  0  0  0  0  0  0  1] (Indices: [0, 10, 11, 12]), Candidate: [1 1 1 0 1 1 1 0 1 2 0 1 0 1 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  0  0  1 -1  0  1 -1  1 -1  0  0  1] (Indices: [0, 11, 14, 16]), Candidate: [ 1  1  1  0  1  1  1  0  1  1  1  0  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 -1  0  0  1] (Indices: [0, 14, 15, 16]), Candidate: [1 1 1 0 1 1 1 0 1 1 0 1 1 2 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 1000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 -1] (Indices: [1, 2, 4, 19]), Candidate: [3 1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 1050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1 -1  0  0  0  0  0  0  0  0  0  1 -1] (Indices: [1, 2, 8, 19]), Candidate: [3 1 0 0 1 1 1 1 0 1 0 1 1 1 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 1100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  0  0  0  0  0  0  0  1  0 -1  0  0] (Indices: [1, 2, 16, 17]), Candidate: [3 1 0 0 1 1 1 0 1 1 0 1 1 1 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 1150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  0  1 -1  0  0  0  0  0  0  0  0  0] (Indices: [1, 3, 7, 10]), Candidate: [ 3  0  2 -1  1  1  2 -1  1  2 -1  1  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 1200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  0  0  0  1 -1  0  1 -1  0  0  0  0] (Indices: [1, 3, 12, 15]), Candidate: [ 3  0  2 -1  1  1  1  0  1  1  0  2  0  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  0  0  0  0  0  0  0  0  1 -1  0  0] (Indices: [1, 4, 6, 17]), Candidate: [3 0 1 1 0 2 0 0 1 1 0 1 1 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 1300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  0  0  1 -1  0  0  0  0  1 -1  0  0] (Indices: [1, 4, 11, 17]), Candidate: [3 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 1350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  0  0  0  0  0  1 -1  0  0  0  0  0] (Indices: [1, 5, 7, 14]), Candidate: [ 3  0  1  0  2  0  2 -1  1  1  0  1  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  0  0  0  1 -1  0  0  0  0  0  1 -1] (Indices: [1, 5, 12, 19]), Candidate: [3 0 1 0 2 0 1 0 1 1 0 2 0 1 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 1450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  1 -1  0  0  0  0  1 -1  0  0  0  0] (Indices: [1, 6, 9, 15]), Candidate: [3 0 1 0 1 2 0 0 2 0 0 1 1 1 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 1500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0  0 -1  0  0  0  0  0  0  0  0  0  0] (Indices: [1, 7, 8, 9]), Candidate: [3 0 1 0 1 1 2 0 1 0 0 1 1 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 1550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  0  0  0  0  1 -1  0  0  0  0  1 -1] (Indices: [1, 7, 13, 19]), Candidate: [ 3  0  1  0  1  1  2 -1  1  1  0  1  2  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1 -1  0  0  0  1  0 -1  0  0  0  0  0] (Indices: [1, 8, 13, 14]), Candidate: [ 3  0  1  0  1  1  1  1  0  1  0  1  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  1 -1  0  0  1 -1  0  0  0  0  1 -1] (Indices: [1, 9, 13, 19]), Candidate: [3 0 1 0 1 1 1 0 2 0 0 1 2 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 1700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  0  1 -1  0  0  0  0  0  1 -1  1 -1] (Indices: [1, 10, 17, 19]), Candidate: [ 3  0  1  0  1  1  1  0  1  2 -1  1  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  0  0  0  1 -1  0  0  0  0  1  0 -1] (Indices: [1, 12, 18, 19]), Candidate: [3 0 1 0 1 1 1 0 1 1 0 2 0 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 1800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 -1] (Indices: [2, 3, 4, 19]), Candidate: [2 2 1 0 0 1 1 0 1 1 0 1 1 1 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 1850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1 -1  0  0  0  0  0  0  0  0  0  1 -1] (Indices: [2, 3, 8, 19]), Candidate: [ 2  2  1 -1  1  1  1  1  0  1  0  1  1  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  0  0  0  0  0  0  0  1  0 -1  0  0] (Indices: [2, 3, 16, 17]), Candidate: [ 2  2  1 -1  1  1  1  0  1  1  0  1  1  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1 -1  0  0  0  0  1 -1  0  0  0  0  0] (Indices: [2, 4, 8, 14]), Candidate: [ 2  2  0  1  0  1  1  1  0  1  0  1  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  0  0  0  0  0  1 -1  0  0  0  1 -1] (Indices: [2, 4, 14, 19]), Candidate: [ 2  2  0  1  0  1  1  0  1  1  0  1  1  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  1 -1  0  0  1 -1  0  0  0  0  0  0] (Indices: [2, 5, 9, 13]), Candidate: [2 2 0 0 2 0 1 0 2 0 0 1 2 0 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 2100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  0  0  0  0  0  0  0  0  1 -1  1 -1] (Indices: [2, 5, 17, 19]), Candidate: [2 2 0 0 2 0 1 0 1 1 0 1 1 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 2150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  0  0  1 -1  0  0  0  0  0  1 -1  0] (Indices: [2, 6, 11, 18]), Candidate: [2 2 0 0 1 2 0 0 1 1 1 0 1 1 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 2200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  1 -1  0  0  0  0  0  0  0  0  1 -1] (Indices: [2, 7, 9, 19]), Candidate: [ 2  2  0  0  1  1  2 -1  2  0  0  1  1  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1  0 -1  0  0  0  1 -1  0  0  0  0  0] (Indices: [2, 8, 9, 14]), Candidate: [ 2  2  0  0  1  1  1  1  1  0  0  1  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1 -1  0  0  0  0  0  0  0  0  1  0 -1] (Indices: [2, 8, 18, 19]), Candidate: [2 2 0 0 1 1 1 1 0 1 0 1 1 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 2350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  0  1  0 -1  0  0  0  1 -1  0  0  0] (Indices: [2, 10, 11, 16]), Candidate: [2 2 0 0 1 1 1 0 1 2 0 0 1 1 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 2400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  0  0  1 -1  0  0  1  0 -1  0  0  0] (Indices: [2, 11, 15, 16]), Candidate: [2 2 0 0 1 1 1 0 1 1 1 0 1 1 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 2450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  0  0  0  0  0  1 -1  1  0 -1  0  0] (Indices: [2, 14, 16, 17]), Candidate: [ 2  2  0  0  1  1  1  0  1  1  0  1  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  0  0  0  0  0  0  1 -1  0  0  0  0] (Indices: [3, 4, 7, 15]), Candidate: [ 2  1  2  0  0  1  2 -1  1  1  0  1  1  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  0  0  0  0  1  0 -1  0  0  0  0  0] (Indices: [3, 4, 13, 14]), Candidate: [ 2  1  2  0  0  1  1  0  1  1  0  1  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1 -1  0  0  0  1 -1  0  0  0  0  0  0] (Indices: [3, 5, 8, 13]), Candidate: [ 2  1  2 -1  2  0  1  1  0  1  0  1  2  0  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  0  0  0  0  0  1 -1  0  0  1 -1  0] (Indices: [3, 5, 14, 18]), Candidate: [ 2  1  2 -1  2  0  1  0  1  1  0  1  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  0  1 -1  0  0  0  0  1 -1  0  0  0] (Indices: [3, 6, 10, 16]), Candidate: [ 2  1  2 -1  1  2  0  0  1  2 -1  1  1  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0 -1  0  0  0  0  0  0  0  0  0  1 -1] (Indices: [3, 7, 8, 19]), Candidate: [ 2  1  2 -1  1  1  2  0  0  1  0  1  1  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  0  0  0  0  0  0  0  1  0 -1  0  0] (Indices: [3, 7, 16, 17]), Candidate: [ 2  1  2 -1  1  1  2 -1  1  1  0  1  1  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1 -1  0  0  0  0  1 -1  0  0  0  1 -1] (Indices: [3, 8, 14, 19]), Candidate: [ 2  1  2 -1  1  1  1  1  0  1  0  1  1  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  1 -1  0  0  0  0  0  1  0 -1  0  0] (Indices: [3, 9, 16, 17]), Candidate: [ 2  1  2 -1  1  1  1  0  2  0  0  1  1  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  0  0  1 -1  1 -1  1 -1  0  0  0  0] (Indices: [3, 11, 13, 15]), Candidate: [ 2  1  2 -1  1  1  1  0  1  1  1  0  2  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  0  0  0  0  1 -1  0  1  0 -1  0  0] (Indices: [3, 13, 16, 17]), Candidate: [ 2  1  2 -1  1  1  1  0  1  1  0  1  2  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  0  0  0  0  0  0  0  0  0  0  1 -1] (Indices: [4, 5, 7, 19]), Candidate: [ 2  1  1  1  1  0  2 -1  1  1  0  1  1  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  0  0  0  0  1 -1  0  0  0  1 -1  0] (Indices: [4, 5, 13, 18]), Candidate: [2 1 1 1 1 0 1 0 1 1 0 1 2 0 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 3150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  0  1  0 -1  0  0  0  0  0  0  0  0] (Indices: [4, 6, 10, 11]), Candidate: [2 1 1 1 0 2 0 0 1 2 0 0 1 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 3200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0 -1  0  0  0  0  1 -1  0  0  0  0  0] (Indices: [4, 7, 8, 14]), Candidate: [ 2  1  1  1  0  1  2  0  0  1  0  1  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  0  0  0  0  0  1 -1  0  0  0  1 -1] (Indices: [4, 7, 14, 19]), Candidate: [ 2  1  1  1  0  1  2 -1  1  1  0  1  1  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1 -1  0  0  0  1 -1  0  0  0  0  1 -1] (Indices: [4, 8, 13, 19]), Candidate: [2 1 1 1 0 1 1 1 0 1 0 1 2 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 3350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  1 -1  0  0  0  1 -1  0  0  0  1 -1] (Indices: [4, 9, 14, 19]), Candidate: [ 2  1  1  1  0  1  1  0  2  0  0  1  1  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  0  0  1  0 -1  0  0  1 -1  0  0  0] (Indices: [4, 11, 12, 16]), Candidate: [2 1 1 1 0 1 1 0 1 1 1 1 0 1 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 3450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  0  0  0  0  1  0 -1  0  0  0  1 -1] (Indices: [4, 13, 14, 19]), Candidate: [ 2  1  1  1  0  1  1  0  1  1  0  1  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1 -1  0  0  0  0  0  0  1 -1  0  0  0] (Indices: [5, 6, 8, 16]), Candidate: [2 1 1 0 2 1 0 1 0 1 0 1 1 1 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 3550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  0  0  0  0  0  0  1 -1  1 -1  0  0] (Indices: [5, 6, 15, 17]), Candidate: [2 1 1 0 2 1 0 0 1 1 0 1 1 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 3600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  0  0  0  1 -1  0  0  1 -1  0  0  0] (Indices: [5, 7, 12, 16]), Candidate: [ 2  1  1  0  2  0  2 -1  1  1  0  2  0  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1 -1  0  1 -1  0  0  0  0  0  1 -1  0] (Indices: [5, 8, 11, 18]), Candidate: [2 1 1 0 2 0 1 1 0 1 1 0 1 1 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 3700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  1 -1  0  1 -1  0  0  1 -1  0  0  0] (Indices: [5, 9, 12, 16]), Candidate: [2 1 1 0 2 0 1 0 2 0 0 2 0 1 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 3750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  0  1 -1  0  0  1 -1  0  0  0  1 -1] (Indices: [5, 10, 14, 19]), Candidate: [ 2  1  1  0  2  0  1  0  1  2 -1  1  1  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  0  0  0  1 -1  0  1  0 -1  0  0  0] (Indices: [5, 12, 15, 16]), Candidate: [2 1 1 0 2 0 1 0 1 1 0 2 0 1 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 3850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0 -1  0  0  0  0  1 -1  0  0  0  0  0] (Indices: [6, 7, 8, 14]), Candidate: [ 2  1  1  0  1  2  1  0  0  1  0  1  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  0  0  0  0  0  1 -1  0  0  0  1 -1] (Indices: [6, 7, 14, 19]), Candidate: [ 2  1  1  0  1  2  1 -1  1  1  0  1  1  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1 -1  0  0  0  1 -1  0  0  0  0  1 -1] (Indices: [6, 8, 13, 19]), Candidate: [2 1 1 0 1 2 0 1 0 1 0 1 2 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 4000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  1 -1  0  0  0  1 -1  0  0  0  1 -1] (Indices: [6, 9, 14, 19]), Candidate: [ 2  1  1  0  1  2  0  0  2  0  0  1  1  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  0  0  1  0 -1  0  0  1 -1  0  0  0] (Indices: [6, 11, 12, 16]), Candidate: [2 1 1 0 1 2 0 0 1 1 1 1 0 1 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 4100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  0  0  0  0  1  0 -1  0  0  0  1 -1] (Indices: [6, 13, 14, 19]), Candidate: [ 2  1  1  0  1  2  0  0  1  1  0  1  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0 -1  0  1  0 -1  0  0  0  0  0  0  0] (Indices: [7, 8, 11, 12]), Candidate: [2 1 1 0 1 1 2 0 0 1 1 1 0 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 4200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  1 -1  1 -1  0  0  0  0  1 -1  0  0] (Indices: [7, 9, 11, 17]), Candidate: [ 2  1  1  0  1  1  2 -1  2  0  1  0  1  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  0  1 -1  0  1 -1  0  0  0  1 -1  0] (Indices: [7, 10, 13, 18]), Candidate: [ 2  1  1  0  1  1  2 -1  1  2 -1  1  2  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  0  0  0  1  0 -1  0  0  0  0  1 -1] (Indices: [7, 12, 13, 19]), Candidate: [ 2  1  1  0  1  1  2 -1  1  1  0  2  1  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  0  0  0  0  0  0  0  0  1  0  0 -1] (Indices: [7, 17, 18, 19]), Candidate: [ 2  1  1  0  1  1  2 -1  1  1  0  1  1  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1 -1  1  0 -1  0  0  0  1 -1  0  0  0] (Indices: [8, 10, 11, 16]), Candidate: [2 1 1 0 1 1 1 1 0 2 0 0 1 1 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 4450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1 -1  0  1 -1  0  0  1  0 -1  0  0  0] (Indices: [8, 11, 15, 16]), Candidate: [2 1 1 0 1 1 1 1 0 1 1 0 1 1 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 4500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1 -1  0  0  0  0  1 -1  1  0 -1  0  0] (Indices: [8, 14, 16, 17]), Candidate: [ 2  1  1  0  1  1  1  1  0  1  0  1  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  1  0 -1  0  0  0  0  0  1 -1  1 -1] (Indices: [9, 10, 17, 19]), Candidate: [ 2  1  1  0  1  1  1  0  2  1 -1  1  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  1 -1  0  1 -1  0  0  0  0  1  0 -1] (Indices: [9, 12, 18, 19]), Candidate: [2 1 1 0 1 1 1 0 2 0 0 2 0 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 4650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0  1  0 -1  0  1 -1  1 -1  0  0  0] (Indices: [10, 11, 14, 16]), Candidate: [ 2  1  1  0  1  1  1  0  1  2  0  0  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0  1 -1  0  0  1  0  0 -1  0  0  0] (Indices: [10, 14, 15, 16]), Candidate: [ 2  1  1  0  1  1  1  0  1  2 -1  1  1  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0  0  1 -1  1 -1  0  1  0 -1  0  0] (Indices: [11, 13, 16, 17]), Candidate: [2 1 1 0 1 1 1 0 1 1 1 0 2 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 4800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0  0  0  1 -1  1 -1  0  0  1  0 -1] (Indices: [12, 14, 18, 19]), Candidate: [ 2  1  1  0  1  1  1  0  1  1  0  2  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Finished generating neighbors. Total valid neighbors found: 2246
  Size of neighborhood t=4: 2246
  Using 'fork' start method for multiprocessing.
  No improvement found for t=4 after processing 2246 neighbors.
No improving solution found or error occurred for t=4.

Attempting neighborhood t=5 (current best cost: 98.4663)
  Exploring neighborhood t=5 in parallel (current cost: 98.4663)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Attempt 50: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  0  0  1 -1  0  0  0  0  0  0  0  1] (Indices: [0, 1, 2, 6, 11]), Candidate: [2 1 0 0 1 2 0 0 1 1 1 0 1 1 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  0  1 -1  0  0  0  0  0  0  0  1  0] (Indices: [0, 1, 2, 10, 19]), Candidate: [ 2  1  0  0  1  1  1  0  1  2 -1  1  1  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  0  0  0  0  0  0  0  0  0  1 -1  1] (Indices: [0, 1, 3, 4, 18]), Candidate: [2 0 2 0 0 1 1 0 1 1 0 1 1 1 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1 -1  0  0  0  0  0  0  0  0  1 -1  1] (Indices: [0, 1, 3, 8, 18]), Candidate: [ 2  0  2 -1  1  1  1  1  0  1  0  1  1  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  0  0  0  0  0  0  1 -1  0  0  1  0] (Indices: [0, 1, 3, 15, 19]), Candidate: [ 2  0  2 -1  1  1  1  0  1  1  0  1  1  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1 -1  0  0  0  1 -1  0  0  0  0  0  1] (Indices: [0, 1, 4, 8, 13]), Candidate: [2 0 1 1 0 1 1 1 0 1 0 1 2 0 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  0  0  0  0  0  1 -1  0  0  1 -1  1] (Indices: [0, 1, 4, 14, 18]), Candidate: [ 2  0  1  1  0  1  1  0  1  1  0  1  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  1 -1  0  1 -1  0  0  0  0  0  0  1] (Indices: [0, 1, 5, 9, 12]), Candidate: [2 0 1 0 2 0 1 0 2 0 0 2 0 1 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  0  0  0  0  0  0  0  0  1  0 -1  1] (Indices: [0, 1, 5, 17, 18]), Candidate: [2 0 1 0 2 0 1 0 1 1 0 1 1 1 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  0  0  1 -1  0  0  0  0  1 -1  0  1] (Indices: [0, 1, 6, 11, 17]), Candidate: [2 0 1 0 1 2 0 0 1 1 1 0 1 1 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  1 -1  0  0  0  0  0  0  0  1 -1  1] (Indices: [0, 1, 7, 9, 18]), Candidate: [ 2  0  1  0  1  1  2 -1  2  0  0  1  1  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1  0 -1  0  0  1 -1  0  0  0  0  0  1] (Indices: [0, 1, 8, 9, 13]), Candidate: [2 0 1 0 1 1 1 1 1 0 0 1 2 0 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1 -1  0  0  0  0  0  0  0  1 -1  1  0] (Indices: [0, 1, 8, 17, 19]), Candidate: [2 0 1 0 1 1 1 1 0 1 0 1 1 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  0  1  0 -1  0  0  1 -1  0  0  0  1] (Indices: [0, 1, 10, 11, 15]), Candidate: [2 0 1 0 1 1 1 0 1 2 0 0 1 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  0  0  1 -1  0  1 -1  0  0  0  1  0] (Indices: [0, 1, 11, 14, 19]), Candidate: [ 2  0  1  0  1  1  1  0  1  1  1  0  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  0  0  0  0  0  1  0 -1  0  0  1  0] (Indices: [0, 1, 14, 15, 19]), Candidate: [2 0 1 0 1 1 1 0 1 1 0 1 1 2 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  0  0  1 -1  0  0  0  0  0  0  0  1] (Indices: [0, 2, 3, 6, 11]), Candidate: [ 1  2  1 -1  1  2  0  0  1  1  1  0  1  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  0  1 -1  0  0  0  0  0  0  0  1  0] (Indices: [0, 2, 3, 10, 19]), Candidate: [ 1  2  1 -1  1  1  1  0  1  2 -1  1  1  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  0  0  0  0  0  0  0  0  0  0  1  0] (Indices: [0, 2, 4, 5, 19]), Candidate: [1 2 0 1 1 0 1 0 1 1 0 1 1 1 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 1000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  0  1 -1  0  0  1 -1  0  0  0  0  1] (Indices: [0, 2, 4, 10, 14]), Candidate: [ 1  2  0  1  0  1  1  0  1  2 -1  1  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  0  0  0  0  0  0  1 -1  0  0  0  1] (Indices: [0, 2, 5, 6, 15]), Candidate: [1 2 0 0 2 1 0 0 1 1 0 1 1 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 1100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  0  0  1 -1  0  0  1 -1  0  0  0  1] (Indices: [0, 2, 5, 11, 15]), Candidate: [1 2 0 0 2 0 1 0 1 1 1 0 1 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 1150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1 -1  0  0  0  0  1 -1  0  0  0  0  1] (Indices: [0, 2, 6, 8, 14]), Candidate: [ 1  2  0  0  1  2  0  1  0  1  0  1  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  0  0  0  0  0  1 -1  0  0  0  1  0] (Indices: [0, 2, 6, 14, 19]), Candidate: [ 1  2  0  0  1  2  0  0  1  1  0  1  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  0  0  0  1 -1  1 -1  0  0  0  0  1] (Indices: [0, 2, 7, 12, 14]), Candidate: [ 1  2  0  0  1  1  2 -1  1  1  0  2  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1 -1  0  1 -1  0  0  0  1 -1  0  0  1] (Indices: [0, 2, 8, 11, 16]), Candidate: [1 2 0 0 1 1 1 1 0 1 1 0 1 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 1350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  1 -1  0  1 -1  1 -1  0  0  0  0  1] (Indices: [0, 2, 9, 12, 14]), Candidate: [ 1  2  0  0  1  1  1  0  2  0  0  2  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  0  1 -1  0  0  1 -1  0  1 -1  0  1] (Indices: [0, 2, 10, 14, 17]), Candidate: [ 1  2  0  0  1  1  1  0  1  2 -1  1  1  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  0  0  0  1 -1  1 -1  0  0  1 -1  1] (Indices: [0, 2, 12, 14, 18]), Candidate: [ 1  2  0  0  1  1  1  0  1  1  0  2  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  1 -1  0  0  0  0  0  0  0  0  0  1] (Indices: [0, 3, 4, 5, 9]), Candidate: [1 1 2 0 1 0 1 0 2 0 0 1 1 1 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 1550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  1 -1  0  0  1 -1  0  0  0  0  0  1] (Indices: [0, 3, 4, 9, 13]), Candidate: [1 1 2 0 0 1 1 0 2 0 0 1 2 0 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 1600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  0  0  0  0  0  0  0  0  1 -1  1  0] (Indices: [0, 3, 4, 17, 19]), Candidate: [1 1 2 0 0 1 1 0 1 1 0 1 1 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 1650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  0  1 -1  0  1 -1  0  0  0  0  0  1] (Indices: [0, 3, 5, 10, 13]), Candidate: [ 1  1  2 -1  2  0  1  0  1  2 -1  1  2  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  0  0  0  0  0  0  1 -1  0  0  0  1] (Indices: [0, 3, 6, 7, 15]), Candidate: [ 1  1  2 -1  1  2  1 -1  1  1  0  1  1  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  0  0  0  0  1  0 -1  0  0  0  0  1] (Indices: [0, 3, 6, 13, 14]), Candidate: [ 1  1  2 -1  1  2  0  0  1  1  0  1  2  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  0  1 -1  0  0  0  0  0  0  0  1  0] (Indices: [0, 3, 7, 10, 19]), Candidate: [ 1  1  2 -1  1  1  2 -1  1  2 -1  1  1  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 1850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1 -1  1 -1  0  0  1 -1  0  0  0  0  1] (Indices: [0, 3, 8, 10, 14]), Candidate: [ 1  1  2 -1  1  1  1  1  0  2 -1  1  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 1900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  1  0 -1  0  0  0  0  0  0  0  1  0] (Indices: [0, 3, 9, 10, 19]), Candidate: [ 1  1  2 -1  1  1  1  0  2  1 -1  1  1  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  0  1 -1  1 -1  0  0  0  0  1 -1  1] (Indices: [0, 3, 10, 12, 18]), Candidate: [ 1  1  2 -1  1  1  1  0  1  2 -1  2  0  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  0  0  1 -1  0  0  0  0  0  1  0  0] (Indices: [0, 3, 11, 18, 19]), Candidate: [ 1  1  2 -1  1  1  1  0  1  1  1  0  1  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  0  0  0  0  0  0  1 -1  1  0 -1  1] (Indices: [0, 3, 15, 17, 18]), Candidate: [ 1  1  2 -1  1  1  1  0  1  1  0  1  1  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  1 -1  0  0  0  0  0  0  1 -1  0  1] (Indices: [0, 4, 5, 9, 17]), Candidate: [1 1 1 1 1 0 1 0 2 0 0 1 1 1 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 2150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  0  1 -1  0  0  0  0  0  0  0  0  1] (Indices: [0, 4, 6, 7, 10]), Candidate: [ 1  1  1  1  0  2  1 -1  1  2 -1  1  1  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  0  0  0  1 -1  0  1 -1  0  0  0  1] (Indices: [0, 4, 6, 12, 15]), Candidate: [1 1 1 1 0 2 0 0 1 1 0 2 0 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 2250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  0  1 -1  0  0  1 -1  0  0  0  0  1] (Indices: [0, 4, 7, 10, 14]), Candidate: [ 1  1  1  1  0  1  2 -1  1  2 -1  1  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 2300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1  0 -1  0  0  0  0  0  0  0  1 -1  1] (Indices: [0, 4, 8, 9, 18]), Candidate: [1 1 1 1 0 1 1 1 1 0 0 1 1 1 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 2350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  1  0 -1  0  0  1 -1  0  0  0  0  1] (Indices: [0, 4, 9, 10, 14]), Candidate: [ 1  1  1  1  0  1  1  0  2  1 -1  1  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  0  1 -1  1  0 -1  0  0  0  0  0  1] (Indices: [0, 4, 10, 12, 13]), Candidate: [ 1  1  1  1  0  1  1  0  1  2 -1  2  1  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  0  0  1 -1  0  0  0  1  0 -1  0  1] (Indices: [0, 4, 11, 16, 17]), Candidate: [1 1 1 1 0 1 1 0 1 1 1 0 1 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 2500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  0  0  0  0  0  1 -1  0  1 -1  1  0] (Indices: [0, 4, 14, 17, 19]), Candidate: [ 1  1  1  1  0  1  1  0  1  1  0  1  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  0  1 -1  0  0  0  0  1 -1  0  0  1] (Indices: [0, 5, 6, 10, 16]), Candidate: [ 1  1  1  0  2  1  0  0  1  2 -1  1  1  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0 -1  0  0  0  0  0  0  0  0  0  1  0] (Indices: [0, 5, 7, 8, 19]), Candidate: [1 1 1 0 2 0 2 0 0 1 0 1 1 1 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 2650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  0  0  0  0  0  0  0  1  0 -1  0  1] (Indices: [0, 5, 7, 16, 17]), Candidate: [ 1  1  1  0  2  0  2 -1  1  1  0  1  1  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1 -1  0  0  0  0  1 -1  0  0  0  1  0] (Indices: [0, 5, 8, 14, 19]), Candidate: [ 1  1  1  0  2  0  1  1  0  1  0  1  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  1 -1  0  0  0  0  0  1  0 -1  0  1] (Indices: [0, 5, 9, 16, 17]), Candidate: [1 1 1 0 2 0 1 0 2 0 0 1 1 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 2800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  0  0  1 -1  1 -1  1 -1  0  0  0  1] (Indices: [0, 5, 11, 13, 15]), Candidate: [1 1 1 0 2 0 1 0 1 1 1 0 2 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 2850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  0  0  0  0  1 -1  0  1  0 -1  0  1] (Indices: [0, 5, 13, 16, 17]), Candidate: [1 1 1 0 2 0 1 0 1 1 0 1 2 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 2900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  0  1 -1  0  0  1 -1  0  0  0  0  1] (Indices: [0, 6, 7, 10, 14]), Candidate: [ 1  1  1  0  1  2  1 -1  1  2 -1  1  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 2950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1  0 -1  0  0  0  0  0  0  0  1 -1  1] (Indices: [0, 6, 8, 9, 18]), Candidate: [1 1 1 0 1 2 0 1 1 0 0 1 1 1 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 3000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  1  0 -1  0  0  1 -1  0  0  0  0  1] (Indices: [0, 6, 9, 10, 14]), Candidate: [ 1  1  1  0  1  2  0  0  2  1 -1  1  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  0  1 -1  1  0 -1  0  0  0  0  0  1] (Indices: [0, 6, 10, 12, 13]), Candidate: [ 1  1  1  0  1  2  0  0  1  2 -1  2  1  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  0  0  1 -1  0  0  0  1  0 -1  0  1] (Indices: [0, 6, 11, 16, 17]), Candidate: [1 1 1 0 1 2 0 0 1 1 1 0 1 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 3150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  0  0  0  0  0  1 -1  0  1 -1  1  0] (Indices: [0, 6, 14, 17, 19]), Candidate: [ 1  1  1  0  1  2  0  0  1  1  0  1  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0 -1  0  0  0  1 -1  0  0  0  1 -1  1] (Indices: [0, 7, 8, 13, 18]), Candidate: [1 1 1 0 1 1 2 0 0 1 0 1 2 0 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 3250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  1 -1  0  0  0  1 -1  0  0  1 -1  1] (Indices: [0, 7, 9, 14, 18]), Candidate: [ 1  1  1  0  1  1  2 -1  2  0  0  1  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  0  0  1  0 -1  0  1 -1  0  0  0  1] (Indices: [0, 7, 11, 12, 15]), Candidate: [ 1  1  1  0  1  1  2 -1  1  1  1  1  0  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  0  0  0  0  1  0 -1  0  0  1 -1  1] (Indices: [0, 7, 13, 14, 18]), Candidate: [ 1  1  1  0  1  1  2 -1  1  1  0  1  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1  0 -1  0  1 -1  1 -1  0  0  0  0  1] (Indices: [0, 8, 9, 12, 14]), Candidate: [ 1  1  1  0  1  1  1  1  1  0  0  2  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1 -1  1 -1  0  0  1 -1  0  1 -1  0  1] (Indices: [0, 8, 10, 14, 17]), Candidate: [ 1  1  1  0  1  1  1  1  0  2 -1  1  1  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1 -1  0  0  1 -1  1 -1  0  0  1 -1  1] (Indices: [0, 8, 12, 14, 18]), Candidate: [ 1  1  1  0  1  1  1  1  0  1  0  2  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  1  0  0 -1  0  0  1 -1  0  0  0  1] (Indices: [0, 9, 10, 11, 15]), Candidate: [1 1 1 0 1 1 1 0 2 1 0 0 1 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 3600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  1 -1  1 -1  0  1 -1  0  0  0  1  0] (Indices: [0, 9, 11, 14, 19]), Candidate: [ 1  1  1  0  1  1  1  0  2  0  1  0  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  1 -1  0  0  0  1  0 -1  0  0  1  0] (Indices: [0, 9, 14, 15, 19]), Candidate: [1 1 1 0 1 1 1 0 2 0 0 1 1 2 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 3700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  0  1 -1  1  0 -1  0  0  0  0  1  0] (Indices: [0, 10, 12, 13, 19]), Candidate: [ 1  1  1  0  1  1  1  0  1  2 -1  2  1  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  0  1 -1  0  0  0  0  0  1  0  0  0] (Indices: [0, 10, 17, 18, 19]), Candidate: [ 1  1  1  0  1  1  1  0  1  2 -1  1  1  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  0  0  1 -1  0  0  1 -1  1  0 -1  1] (Indices: [0, 11, 15, 17, 18]), Candidate: [1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 3850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  0  0  0  0  1  0 -1  0  1 -1  1  0] (Indices: [0, 13, 14, 17, 19]), Candidate: [ 1  1  1  0  1  1  1  0  1  1  0  1  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  0  0  0  0  0  1 -1  0  0  0  0  0] (Indices: [1, 2, 3, 5, 14]), Candidate: [ 3  1  1 -1  2  0  1  0  1  1  0  1  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  1 -1  0  0  0  0  0  0  0  1 -1  0] (Indices: [1, 2, 3, 9, 18]), Candidate: [ 3  1  1 -1  1  1  1  0  2  0  0  1  1  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  1 -1  0  0  0  0  0  0  0  0  0  0] (Indices: [1, 2, 4, 5, 9]), Candidate: [3 1 0 1 1 0 1 0 2 0 0 1 1 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 4050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  1 -1  0  0  1 -1  0  0  0  0  0  0] (Indices: [1, 2, 4, 9, 13]), Candidate: [3 1 0 1 0 1 1 0 2 0 0 1 2 0 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 4100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  0  0  0  0  0  0  0  0  1 -1  1 -1] (Indices: [1, 2, 4, 17, 19]), Candidate: [3 1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 4150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  0  1 -1  0  1 -1  0  0  0  0  0  0] (Indices: [1, 2, 5, 10, 13]), Candidate: [ 3  1  0  0  2  0  1  0  1  2 -1  1  2  0  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  0  0  0  0  0  0  1 -1  0  0  0  0] (Indices: [1, 2, 6, 7, 15]), Candidate: [ 3  1  0  0  1  2  1 -1  1  1  0  1  1  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  0  0  0  0  1  0 -1  0  0  0  0  0] (Indices: [1, 2, 6, 13, 14]), Candidate: [ 3  1  0  0  1  2  0  0  1  1  0  1  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  0  1 -1  0  0  0  0  0  0  0  1 -1] (Indices: [1, 2, 7, 10, 19]), Candidate: [ 3  1  0  0  1  1  2 -1  1  2 -1  1  1  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1 -1  1 -1  0  0  1 -1  0  0  0  0  0] (Indices: [1, 2, 8, 10, 14]), Candidate: [ 3  1  0  0  1  1  1  1  0  2 -1  1  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  1  0 -1  0  0  0  0  0  0  0  1 -1] (Indices: [1, 2, 9, 10, 19]), Candidate: [ 3  1  0  0  1  1  1  0  2  1 -1  1  1  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  0  1 -1  1 -1  0  0  0  0  1 -1  0] (Indices: [1, 2, 10, 12, 18]), Candidate: [ 3  1  0  0  1  1  1  0  1  2 -1  2  0  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  0  0  1 -1  0  0  0  0  0  1  0 -1] (Indices: [1, 2, 11, 18, 19]), Candidate: [3 1 0 0 1 1 1 0 1 1 1 0 1 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 4550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  0  0  0  0  0  0  1 -1  1  0 -1  0] (Indices: [1, 2, 15, 17, 18]), Candidate: [3 1 0 0 1 1 1 0 1 1 0 1 1 1 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 4600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1 -1  0  0  0  1 -1  0  0  0  0  0  0] (Indices: [1, 3, 4, 8, 13]), Candidate: [3 0 2 0 0 1 1 1 0 1 0 1 2 0 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 4650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  0  0  0  0  0  1 -1  0  0  1 -1  0] (Indices: [1, 3, 4, 14, 18]), Candidate: [ 3  0  2  0  0  1  1  0  1  1  0  1  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  1 -1  0  1 -1  0  0  0  0  0  0  0] (Indices: [1, 3, 5, 9, 12]), Candidate: [ 3  0  2 -1  2  0  1  0  2  0  0  2  0  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  0  0  0  0  0  0  0  0  1  0 -1  0] (Indices: [1, 3, 5, 17, 18]), Candidate: [ 3  0  2 -1  2  0  1  0  1  1  0  1  1  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  0  0  1 -1  0  0  0  0  1 -1  0  0] (Indices: [1, 3, 6, 11, 17]), Candidate: [ 3  0  2 -1  1  2  0  0  1  1  1  0  1  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  1 -1  0  0  0  0  0  0  0  1 -1  0] (Indices: [1, 3, 7, 9, 18]), Candidate: [ 3  0  2 -1  1  1  2 -1  2  0  0  1  1  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1  0 -1  0  0  1 -1  0  0  0  0  0  0] (Indices: [1, 3, 8, 9, 13]), Candidate: [ 3  0  2 -1  1  1  1  1  1  0  0  1  2  0  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1 -1  0  0  0  0  0  0  0  1 -1  1 -1] (Indices: [1, 3, 8, 17, 19]), Candidate: [ 3  0  2 -1  1  1  1  1  0  1  0  1  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  0  1  0 -1  0  0  1 -1  0  0  0  0] (Indices: [1, 3, 10, 11, 15]), Candidate: [ 3  0  2 -1  1  1  1  0  1  2  0  0  1  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  0  0  1 -1  0  1 -1  0  0  0  1 -1] (Indices: [1, 3, 11, 14, 19]), Candidate: [ 3  0  2 -1  1  1  1  0  1  1  1  0  1  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  0  0  0  0  0  1  0 -1  0  0  1 -1] (Indices: [1, 3, 14, 15, 19]), Candidate: [ 3  0  2 -1  1  1  1  0  1  1  0  1  1  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1 -1  0  0  0  0  0  0  0  1 -1  0  0] (Indices: [1, 4, 5, 8, 17]), Candidate: [3 0 1 1 1 0 1 1 0 1 0 1 1 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 5200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  0  0  0  0  0  0  1 -1  0  1 -1  0] (Indices: [1, 4, 5, 15, 18]), Candidate: [3 0 1 1 1 0 1 0 1 1 0 1 1 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 5250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  0  0  1  0 -1  0  0  0  0  0  0  0] (Indices: [1, 4, 6, 11, 12]), Candidate: [3 0 1 1 0 2 0 0 1 1 1 1 0 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 5300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  1 -1  0  0  1 -1  0  0  0  0  0  0] (Indices: [1, 4, 7, 9, 13]), Candidate: [ 3  0  1  1  0  1  2 -1  2  0  0  1  2  0  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  0  0  0  0  0  0  0  0  1 -1  1 -1] (Indices: [1, 4, 7, 17, 19]), Candidate: [ 3  0  1  1  0  1  2 -1  1  1  0  1  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1 -1  0  0  0  0  0  1 -1  0  0  1 -1] (Indices: [1, 4, 8, 15, 19]), Candidate: [3 0 1 1 0 1 1 1 0 1 0 1 1 1 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 5450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  1 -1  0  0  0  0  0  0  1 -1  1 -1] (Indices: [1, 4, 9, 17, 19]), Candidate: [3 0 1 1 0 1 1 0 2 0 0 1 1 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 5500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  0  0  1 -1  1 -1  0  0  0  0  1 -1] (Indices: [1, 4, 11, 13, 19]), Candidate: [3 0 1 1 0 1 1 0 1 1 1 0 2 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 5550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  0  0  0  0  1 -1  0  0  1 -1  1 -1] (Indices: [1, 4, 13, 17, 19]), Candidate: [3 0 1 1 0 1 1 0 1 1 0 1 2 0 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 5600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  1 -1  0  0  0  0  1 -1  0  0  0  0] (Indices: [1, 5, 6, 9, 15]), Candidate: [3 0 1 0 2 1 0 0 2 0 0 1 1 1 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 5650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0  0 -1  0  0  0  0  0  0  0  0  0  0] (Indices: [1, 5, 7, 8, 9]), Candidate: [3 0 1 0 2 0 2 0 1 0 0 1 1 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 5700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  0  0  0  0  1 -1  0  0  0  0  1 -1] (Indices: [1, 5, 7, 13, 19]), Candidate: [ 3  0  1  0  2  0  2 -1  1  1  0  1  2  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1 -1  0  0  0  1  0 -1  0  0  0  0  0] (Indices: [1, 5, 8, 13, 14]), Candidate: [ 3  0  1  0  2  0  1  1  0  1  0  1  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  1 -1  0  0  1 -1  0  0  0  0  1 -1] (Indices: [1, 5, 9, 13, 19]), Candidate: [3 0 1 0 2 0 1 0 2 0 0 1 2 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 5850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  0  1 -1  0  0  0  0  0  1 -1  1 -1] (Indices: [1, 5, 10, 17, 19]), Candidate: [ 3  0  1  0  2  0  1  0  1  2 -1  1  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  0  0  0  1 -1  0  0  0  0  1  0 -1] (Indices: [1, 5, 12, 18, 19]), Candidate: [3 0 1 0 2 0 1 0 1 1 0 2 0 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 5950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  1 -1  0  0  1 -1  0  0  0  0  0  0] (Indices: [1, 6, 7, 9, 13]), Candidate: [ 3  0  1  0  1  2  1 -1  2  0  0  1  2  0  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  0  0  0  0  0  0  0  0  1 -1  1 -1] (Indices: [1, 6, 7, 17, 19]), Candidate: [ 3  0  1  0  1  2  1 -1  1  1  0  1  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1 -1  0  0  0  0  0  1 -1  0  0  1 -1] (Indices: [1, 6, 8, 15, 19]), Candidate: [3 0 1 0 1 2 0 1 0 1 0 1 1 1 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 6100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  1 -1  0  0  0  0  0  0  1 -1  1 -1] (Indices: [1, 6, 9, 17, 19]), Candidate: [3 0 1 0 1 2 0 0 2 0 0 1 1 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 6150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  0  0  1 -1  1 -1  0  0  0  0  1 -1] (Indices: [1, 6, 11, 13, 19]), Candidate: [3 0 1 0 1 2 0 0 1 1 1 0 2 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 6200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  0  0  0  0  1 -1  0  0  1 -1  1 -1] (Indices: [1, 6, 13, 17, 19]), Candidate: [3 0 1 0 1 2 0 0 1 1 0 1 2 0 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 6250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0 -1  0  0  1 -1  1 -1  0  0  0  0  0] (Indices: [1, 7, 8, 12, 14]), Candidate: [ 3  0  1  0  1  1  2  0  0  1  0  2  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  1 -1  0  1 -1  0  0  0  0  0  1 -1] (Indices: [1, 7, 9, 12, 19]), Candidate: [ 3  0  1  0  1  1  2 -1  2  0  0  2  0  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  0  1 -1  0  0  0  1 -1  0  1 -1  0] (Indices: [1, 7, 10, 15, 18]), Candidate: [ 3  0  1  0  1  1  2 -1  1  2 -1  1  1  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  0  0  0  1 -1  0  1 -1  0  0  1 -1] (Indices: [1, 7, 12, 15, 19]), Candidate: [ 3  0  1  0  1  1  2 -1  1  1  0  2  0  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1  0  0 -1  0  0  0  0  0  0  0  1 -1] (Indices: [1, 8, 9, 10, 19]), Candidate: [ 3  0  1  0  1  1  1  1  1  1 -1  1  1  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1 -1  1 -1  1 -1  0  0  0  0  1 -1  0] (Indices: [1, 8, 10, 12, 18]), Candidate: [ 3  0  1  0  1  1  1  1  0  2 -1  2  0  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1 -1  0  1 -1  0  0  0  0  0  1  0 -1] (Indices: [1, 8, 11, 18, 19]), Candidate: [3 0 1 0 1 1 1 1 0 1 1 0 1 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 6600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1 -1  0  0  0  0  0  1 -1  1  0 -1  0] (Indices: [1, 8, 15, 17, 18]), Candidate: [3 0 1 0 1 1 1 1 0 1 0 1 1 1 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 6650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  1 -1  1 -1  1  0 -1  0  0  0  0  0] (Indices: [1, 9, 11, 13, 14]), Candidate: [ 3  0  1  0  1  1  1  0  2  0  1  0  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  1 -1  0  0  1 -1  1 -1  0  0  1 -1] (Indices: [1, 9, 13, 15, 19]), Candidate: [3 0 1 0 1 1 1 0 2 0 0 1 2 0 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 6750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  0  1  0 -1  0  0  0  1 -1  1 -1  0] (Indices: [1, 10, 11, 16, 18]), Candidate: [3 0 1 0 1 1 1 0 1 2 0 0 1 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 6800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  0  1 -1  0  0  1 -1  0  0  1  0 -1] (Indices: [1, 10, 14, 18, 19]), Candidate: [ 3  0  1  0  1  1  1  0  1  2 -1  1  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  0  0  1 -1  0  1  0 -1  0  0  1 -1] (Indices: [1, 11, 14, 15, 19]), Candidate: [3 0 1 0 1 1 1 0 1 1 1 0 1 2 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 6900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  0  0  0  1 -1  0  0  1 -1  1  0 -1] (Indices: [1, 12, 16, 18, 19]), Candidate: [3 0 1 0 1 1 1 0 1 1 0 2 0 1 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 6950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  0  0  0  0  0  0  0  0  0  0  1 -1] (Indices: [2, 3, 4, 5, 19]), Candidate: [2 2 1 0 1 0 1 0 1 1 0 1 1 1 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 7000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  0  1 -1  0  0  1 -1  0  0  0  0  0] (Indices: [2, 3, 4, 10, 14]), Candidate: [ 2  2  1  0  0  1  1  0  1  2 -1  1  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  0  0  0  0  0  0  1 -1  0  0  0  0] (Indices: [2, 3, 5, 6, 15]), Candidate: [ 2  2  1 -1  2  1  0  0  1  1  0  1  1  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  0  0  1 -1  0  0  1 -1  0  0  0  0] (Indices: [2, 3, 5, 11, 15]), Candidate: [ 2  2  1 -1  2  0  1  0  1  1  1  0  1  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1 -1  0  0  0  0  1 -1  0  0  0  0  0] (Indices: [2, 3, 6, 8, 14]), Candidate: [ 2  2  1 -1  1  2  0  1  0  1  0  1  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  0  0  0  0  0  1 -1  0  0  0  1 -1] (Indices: [2, 3, 6, 14, 19]), Candidate: [ 2  2  1 -1  1  2  0  0  1  1  0  1  1  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  0  0  0  1 -1  1 -1  0  0  0  0  0] (Indices: [2, 3, 7, 12, 14]), Candidate: [ 2  2  1 -1  1  1  2 -1  1  1  0  2  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 7300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1 -1  0  1 -1  0  0  0  1 -1  0  0  0] (Indices: [2, 3, 8, 11, 16]), Candidate: [ 2  2  1 -1  1  1  1  1  0  1  1  0  1  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  1 -1  0  1 -1  1 -1  0  0  0  0  0] (Indices: [2, 3, 9, 12, 14]), Candidate: [ 2  2  1 -1  1  1  1  0  2  0  0  2  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  0  1 -1  0  0  1 -1  0  1 -1  0  0] (Indices: [2, 3, 10, 14, 17]), Candidate: [ 2  2  1 -1  1  1  1  0  1  2 -1  1  1  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 7450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  0  0  0  1 -1  1 -1  0  0  1 -1  0] (Indices: [2, 3, 12, 14, 18]), Candidate: [ 2  2  1 -1  1  1  1  0  1  1  0  2  0  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  0  1 -1  0  0  0  0  0  0  0  0  0] (Indices: [2, 4, 5, 6, 10]), Candidate: [ 2  2  0  1  1  1  0  0  1  2 -1  1  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  0  1 -1  0  0  0  0  0  0  1 -1  0] (Indices: [2, 4, 5, 10, 18]), Candidate: [ 2  2  0  1  1  0  1  0  1  2 -1  1  1  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1  0 -1  0  0  0  0  0  0  0  0  0  0] (Indices: [2, 4, 6, 8, 9]), Candidate: [2 2 0 1 0 2 0 1 1 0 0 1 1 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 7650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  0  0  0  0  1 -1  0  0  0  0  1 -1] (Indices: [2, 4, 6, 13, 19]), Candidate: [2 2 0 1 0 2 0 0 1 1 0 1 2 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 7700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  0  0  1 -1  0  0  0  1 -1  0  0  0] (Indices: [2, 4, 7, 11, 16]), Candidate: [ 2  2  0  1  0  1  2 -1  1  1  1  0  1  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1 -1  1 -1  0  0  0  0  0  0  0  1 -1] (Indices: [2, 4, 8, 10, 19]), Candidate: [ 2  2  0  1  0  1  1  1  0  2 -1  1  1  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  1 -1  1 -1  0  0  0  1 -1  0  0  0] (Indices: [2, 4, 9, 11, 16]), Candidate: [2 2 0 1 0 1 1 0 2 0 1 0 1 1 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 7850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  0  1 -1  0  1 -1  0  0  1 -1  0  0] (Indices: [2, 4, 10, 13, 17]), Candidate: [ 2  2  0  1  0  1  1  0  1  2 -1  1  2  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  0  0  0  1  0 -1  0  0  0  1 -1  0] (Indices: [2, 4, 12, 13, 18]), Candidate: [2 2 0 1 0 1 1 0 1 1 0 2 1 0 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 7950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  0  0  0  0  0  0  0  1 -1  1  0 -1] (Indices: [2, 4, 16, 18, 19]), Candidate: [2 2 0 1 0 1 1 0 1 1 0 1 1 1 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 8000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  0  0  1 -1  0  0  0  0  0  1 -1  0] (Indices: [2, 5, 6, 11, 18]), Candidate: [2 2 0 0 2 1 0 0 1 1 1 0 1 1 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 8050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  1 -1  0  0  0  0  0  0  0  0  1 -1] (Indices: [2, 5, 7, 9, 19]), Candidate: [ 2  2  0  0  2  0  2 -1  2  0  0  1  1  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1  0 -1  0  0  0  1 -1  0  0  0  0  0] (Indices: [2, 5, 8, 9, 14]), Candidate: [ 2  2  0  0  2  0  1  1  1  0  0  1  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1 -1  0  0  0  0  0  0  0  0  1  0 -1] (Indices: [2, 5, 8, 18, 19]), Candidate: [2 2 0 0 2 0 1 1 0 1 0 1 1 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 8200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  0  1  0 -1  0  0  0  1 -1  0  0  0] (Indices: [2, 5, 10, 11, 16]), Candidate: [2 2 0 0 2 0 1 0 1 2 0 0 1 1 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 8250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  0  0  1 -1  0  0  1  0 -1  0  0  0] (Indices: [2, 5, 11, 15, 16]), Candidate: [2 2 0 0 2 0 1 0 1 1 1 0 1 1 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 8300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  0  0  0  0  0  1 -1  1  0 -1  0  0] (Indices: [2, 5, 14, 16, 17]), Candidate: [ 2  2  0  0  2  0  1  0  1  1  0  1  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  0  0  1 -1  0  0  0  1 -1  0  0  0] (Indices: [2, 6, 7, 11, 16]), Candidate: [ 2  2  0  0  1  2  1 -1  1  1  1  0  1  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1 -1  1 -1  0  0  0  0  0  0  0  1 -1] (Indices: [2, 6, 8, 10, 19]), Candidate: [ 2  2  0  0  1  2  0  1  0  2 -1  1  1  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  1 -1  1 -1  0  0  0  1 -1  0  0  0] (Indices: [2, 6, 9, 11, 16]), Candidate: [2 2 0 0 1 2 0 0 2 0 1 0 1 1 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 8500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  0  1 -1  0  1 -1  0  0  1 -1  0  0] (Indices: [2, 6, 10, 13, 17]), Candidate: [ 2  2  0  0  1  2  0  0  1  2 -1  1  2  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  0  0  0  1  0 -1  0  0  0  1 -1  0] (Indices: [2, 6, 12, 13, 18]), Candidate: [2 2 0 0 1 2 0 0 1 1 0 2 1 0 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 8600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  0  0  0  0  0  0  0  1 -1  1  0 -1] (Indices: [2, 6, 16, 18, 19]), Candidate: [2 2 0 0 1 2 0 0 1 1 0 1 1 1 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 8650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0 -1  0  0  0  0  0  1 -1  0  0  1 -1] (Indices: [2, 7, 8, 15, 19]), Candidate: [2 2 0 0 1 1 2 0 0 1 0 1 1 1 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 8700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  1 -1  0  0  0  0  0  0  1 -1  1 -1] (Indices: [2, 7, 9, 17, 19]), Candidate: [ 2  2  0  0  1  1  2 -1  2  0  0  1  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  0  0  1 -1  1 -1  0  0  0  0  1 -1] (Indices: [2, 7, 11, 13, 19]), Candidate: [ 2  2  0  0  1  1  2 -1  1  1  1  0  2  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  0  0  0  0  1 -1  0  0  1 -1  1 -1] (Indices: [2, 7, 13, 17, 19]), Candidate: [ 2  2  0  0  1  1  2 -1  1  1  0  1  2  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1  0 -1  0  0  1 -1  0  0  0  1 -1  0] (Indices: [2, 8, 9, 13, 18]), Candidate: [2 2 0 0 1 1 1 1 1 0 0 1 2 0 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 8900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1 -1  1 -1  0  0  0  0  0  1  0 -1  0] (Indices: [2, 8, 10, 17, 18]), Candidate: [ 2  2  0  0  1  1  1  1  0  2 -1  1  1  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1 -1  0  0  1 -1  0  0  0  1 -1  1 -1] (Indices: [2, 8, 12, 17, 19]), Candidate: [2 2 0 0 1 1 1 1 0 1 0 2 0 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 9000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  1  0 -1  1 -1  0  0  0  0  1 -1  0] (Indices: [2, 9, 10, 12, 18]), Candidate: [ 2  2  0  0  1  1  1  0  2  1 -1  2  0  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  1 -1  1 -1  0  0  0  0  0  1  0 -1] (Indices: [2, 9, 11, 18, 19]), Candidate: [2 2 0 0 1 1 1 0 2 0 1 0 1 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 9100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  1 -1  0  0  0  0  1 -1  1  0 -1  0] (Indices: [2, 9, 15, 17, 18]), Candidate: [2 2 0 0 1 1 1 0 2 0 0 1 1 1 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 9150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  0  1 -1  1 -1  0  0  1  0 -1  0  0] (Indices: [2, 10, 12, 16, 17]), Candidate: [ 2  2  0  0  1  1  1  0  1  2 -1  2  0  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  0  0  1  0 -1  1 -1  0  0  1 -1  0] (Indices: [2, 11, 12, 14, 18]), Candidate: [ 2  2  0  0  1  1  1  0  1  1  1  1  0  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  0  0  0  1  0  0 -1  0  0  1 -1  0] (Indices: [2, 12, 13, 14, 18]), Candidate: [ 2  2  0  0  1  1  1  0  1  1  0  2  1  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  0  0  0  0  1 -1  0  1 -1  1  0 -1] (Indices: [2, 13, 16, 18, 19]), Candidate: [2 2 0 0 1 1 1 0 1 1 0 1 2 0 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 9350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1 -1  0  0  0  0  0  0  0  1 -1  0  0] (Indices: [3, 4, 5, 8, 17]), Candidate: [2 1 2 0 1 0 1 1 0 1 0 1 1 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 9400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  0  0  0  0  0  0  1 -1  0  1 -1  0] (Indices: [3, 4, 5, 15, 18]), Candidate: [2 1 2 0 1 0 1 0 1 1 0 1 1 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 9450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  0  0  1  0 -1  0  0  0  0  0  0  0] (Indices: [3, 4, 6, 11, 12]), Candidate: [2 1 2 0 0 2 0 0 1 1 1 1 0 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 9500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  1 -1  0  0  1 -1  0  0  0  0  0  0] (Indices: [3, 4, 7, 9, 13]), Candidate: [ 2  1  2  0  0  1  2 -1  2  0  0  1  2  0  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  0  0  0  0  0  0  0  0  1 -1  1 -1] (Indices: [3, 4, 7, 17, 19]), Candidate: [ 2  1  2  0  0  1  2 -1  1  1  0  1  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1 -1  0  0  0  0  0  1 -1  0  0  1 -1] (Indices: [3, 4, 8, 15, 19]), Candidate: [2 1 2 0 0 1 1 1 0 1 0 1 1 1 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 9650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  1 -1  0  0  0  0  0  0  1 -1  1 -1] (Indices: [3, 4, 9, 17, 19]), Candidate: [2 1 2 0 0 1 1 0 2 0 0 1 1 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 9700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  0  0  1 -1  1 -1  0  0  0  0  1 -1] (Indices: [3, 4, 11, 13, 19]), Candidate: [2 1 2 0 0 1 1 0 1 1 1 0 2 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 9750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  0  0  0  0  1 -1  0  0  1 -1  1 -1] (Indices: [3, 4, 13, 17, 19]), Candidate: [2 1 2 0 0 1 1 0 1 1 0 1 2 0 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 9800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  1 -1  0  0  0  0  1 -1  0  0  0  0] (Indices: [3, 5, 6, 9, 15]), Candidate: [ 2  1  2 -1  2  1  0  0  2  0  0  1  1  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0  0 -1  0  0  0  0  0  0  0  0  0  0] (Indices: [3, 5, 7, 8, 9]), Candidate: [ 2  1  2 -1  2  0  2  0  1  0  0  1  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  0  0  0  0  1 -1  0  0  0  0  1 -1] (Indices: [3, 5, 7, 13, 19]), Candidate: [ 2  1  2 -1  2  0  2 -1  1  1  0  1  2  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1 -1  0  0  0  1  0 -1  0  0  0  0  0] (Indices: [3, 5, 8, 13, 14]), Candidate: [ 2  1  2 -1  2  0  1  1  0  1  0  1  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  1 -1  0  0  1 -1  0  0  0  0  1 -1] (Indices: [3, 5, 9, 13, 19]), Candidate: [ 2  1  2 -1  2  0  1  0  2  0  0  1  2  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  0  1 -1  0  0  0  0  0  1 -1  1 -1] (Indices: [3, 5, 10, 17, 19]), Candidate: [ 2  1  2 -1  2  0  1  0  1  2 -1  1  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  0  0  0  1 -1  0  0  0  0  1  0 -1] (Indices: [3, 5, 12, 18, 19]), Candidate: [ 2  1  2 -1  2  0  1  0  1  1  0  2  0  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  1 -1  0  0  1 -1  0  0  0  0  0  0] (Indices: [3, 6, 7, 9, 13]), Candidate: [ 2  1  2 -1  1  2  1 -1  2  0  0  1  2  0  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  0  0  0  0  0  0  0  0  1 -1  1 -1] (Indices: [3, 6, 7, 17, 19]), Candidate: [ 2  1  2 -1  1  2  1 -1  1  1  0  1  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1 -1  0  0  0  0  0  1 -1  0  0  1 -1] (Indices: [3, 6, 8, 15, 19]), Candidate: [ 2  1  2 -1  1  2  0  1  0  1  0  1  1  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  1 -1  0  0  0  0  0  0  1 -1  1 -1] (Indices: [3, 6, 9, 17, 19]), Candidate: [ 2  1  2 -1  1  2  0  0  2  0  0  1  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  0  0  1 -1  1 -1  0  0  0  0  1 -1] (Indices: [3, 6, 11, 13, 19]), Candidate: [ 2  1  2 -1  1  2  0  0  1  1  1  0  2  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  0  0  0  0  1 -1  0  0  1 -1  1 -1] (Indices: [3, 6, 13, 17, 19]), Candidate: [ 2  1  2 -1  1  2  0  0  1  1  0  1  2  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0 -1  0  0  1 -1  1 -1  0  0  0  0  0] (Indices: [3, 7, 8, 12, 14]), Candidate: [ 2  1  2 -1  1  1  2  0  0  1  0  2  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  1 -1  0  1 -1  0  0  0  0  0  1 -1] (Indices: [3, 7, 9, 12, 19]), Candidate: [ 2  1  2 -1  1  1  2 -1  2  0  0  2  0  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  0  1 -1  0  0  0  1 -1  0  1 -1  0] (Indices: [3, 7, 10, 15, 18]), Candidate: [ 2  1  2 -1  1  1  2 -1  1  2 -1  1  1  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 10600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  0  0  0  1 -1  0  1 -1  0  0  1 -1] (Indices: [3, 7, 12, 15, 19]), Candidate: [ 2  1  2 -1  1  1  2 -1  1  1  0  2  0  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1  0  0 -1  0  0  0  0  0  0  0  1 -1] (Indices: [3, 8, 9, 10, 19]), Candidate: [ 2  1  2 -1  1  1  1  1  1  1 -1  1  1  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1 -1  1 -1  1 -1  0  0  0  0  1 -1  0] (Indices: [3, 8, 10, 12, 18]), Candidate: [ 2  1  2 -1  1  1  1  1  0  2 -1  2  0  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1 -1  0  1 -1  0  0  0  0  0  1  0 -1] (Indices: [3, 8, 11, 18, 19]), Candidate: [ 2  1  2 -1  1  1  1  1  0  1  1  0  1  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1 -1  0  0  0  0  0  1 -1  1  0 -1  0] (Indices: [3, 8, 15, 17, 18]), Candidate: [ 2  1  2 -1  1  1  1  1  0  1  0  1  1  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  1 -1  1 -1  1  0 -1  0  0  0  0  0] (Indices: [3, 9, 11, 13, 14]), Candidate: [ 2  1  2 -1  1  1  1  0  2  0  1  0  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  1 -1  0  0  1 -1  1 -1  0  0  1 -1] (Indices: [3, 9, 13, 15, 19]), Candidate: [ 2  1  2 -1  1  1  1  0  2  0  0  1  2  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  0  1  0 -1  0  0  0  1 -1  1 -1  0] (Indices: [3, 10, 11, 16, 18]), Candidate: [ 2  1  2 -1  1  1  1  0  1  2  0  0  1  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  0  1 -1  0  0  1 -1  0  0  1  0 -1] (Indices: [3, 10, 14, 18, 19]), Candidate: [ 2  1  2 -1  1  1  1  0  1  2 -1  1  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 11050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  0  0  1 -1  0  1  0 -1  0  0  1 -1] (Indices: [3, 11, 14, 15, 19]), Candidate: [ 2  1  2 -1  1  1  1  0  1  1  1  0  1  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  0  0  0  1 -1  0  0  1 -1  1  0 -1] (Indices: [3, 12, 16, 18, 19]), Candidate: [ 2  1  2 -1  1  1  1  0  1  1  0  2  0  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1 -1  1 -1  0  0  0  0  0  0  0  0  0] (Indices: [4, 5, 6, 8, 10]), Candidate: [ 2  1  1  1  1  1  0  1  0  2 -1  1  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  0  0  0  0  0  1  0 -1  0  0  0  0] (Indices: [4, 5, 6, 14, 15]), Candidate: [2 1 1 1 1 1 0 0 1 1 0 1 1 2 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 11250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  0  0  1 -1  0  0  0  0  1 -1  0  0] (Indices: [4, 5, 7, 11, 17]), Candidate: [ 2  1  1  1  1  0  2 -1  1  1  1  0  1  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1 -1  0  1  0 -1  0  0  0  0  0  0  0] (Indices: [4, 5, 8, 11, 12]), Candidate: [2 1 1 1 1 0 1 1 0 1 1 1 0 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 11350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  1 -1  1 -1  0  0  0  0  1 -1  0  0] (Indices: [4, 5, 9, 11, 17]), Candidate: [2 1 1 1 1 0 1 0 2 0 1 0 1 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 11400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  0  1 -1  0  1 -1  0  0  0  1 -1  0] (Indices: [4, 5, 10, 13, 18]), Candidate: [ 2  1  1  1  1  0  1  0  1  2 -1  1  2  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  0  0  0  1  0 -1  0  0  0  0  1 -1] (Indices: [4, 5, 12, 13, 19]), Candidate: [2 1 1 1 1 0 1 0 1 1 0 2 1 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 11500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  0  0  0  0  0  0  0  0  1  0  0 -1] (Indices: [4, 5, 17, 18, 19]), Candidate: [2 1 1 1 1 0 1 0 1 1 0 1 1 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 11550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  0  0  0  0  1 -1  0  0  0  1 -1  0] (Indices: [4, 6, 7, 13, 18]), Candidate: [ 2  1  1  1  0  2  1 -1  1  1  0  1  2  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1 -1  0  0  1 -1  0  0  0  0  0  1 -1] (Indices: [4, 6, 8, 12, 19]), Candidate: [2 1 1 1 0 2 0 1 0 1 0 2 0 1 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 11650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  1 -1  0  0  1 -1  0  0  0  1 -1  0] (Indices: [4, 6, 9, 13, 18]), Candidate: [2 1 1 1 0 2 0 0 2 0 0 1 2 0 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 11700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  0  1 -1  0  0  0  0  0  1  0 -1  0] (Indices: [4, 6, 10, 17, 18]), Candidate: [ 2  1  1  1  0  2  0  0  1  2 -1  1  1  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  0  0  0  1 -1  0  0  0  1 -1  1 -1] (Indices: [4, 6, 12, 17, 19]), Candidate: [2 1 1 1 0 2 0 0 1 1 0 2 0 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 11800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0 -1  1 -1  0  0  1 -1  0  0  0  0  0] (Indices: [4, 7, 8, 10, 14]), Candidate: [ 2  1  1  1  0  1  2  0  0  2 -1  1  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 11850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  1  0 -1  0  0  0  0  0  0  0  1 -1] (Indices: [4, 7, 9, 10, 19]), Candidate: [ 2  1  1  1  0  1  2 -1  2  1 -1  1  1  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 11900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  0  1 -1  1 -1  0  0  0  0  1 -1  0] (Indices: [4, 7, 10, 12, 18]), Candidate: [ 2  1  1  1  0  1  2 -1  1  2 -1  2  0  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 11950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  0  0  1 -1  0  0  0  0  0  1  0 -1] (Indices: [4, 7, 11, 18, 19]), Candidate: [ 2  1  1  1  0  1  2 -1  1  1  1  0  1  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  0  0  0  0  0  0  1 -1  1  0 -1  0] (Indices: [4, 7, 15, 17, 18]), Candidate: [ 2  1  1  1  0  1  2 -1  1  1  0  1  1  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1  0 -1  0  0  0  0  0  0  1 -1  1 -1] (Indices: [4, 8, 9, 17, 19]), Candidate: [2 1 1 1 0 1 1 1 1 0 0 1 1 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 12100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1 -1  0  1 -1  1 -1  0  0  0  0  1 -1] (Indices: [4, 8, 11, 13, 19]), Candidate: [2 1 1 1 0 1 1 1 0 1 1 0 2 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 12150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1 -1  0  0  0  1 -1  0  0  1 -1  1 -1] (Indices: [4, 8, 13, 17, 19]), Candidate: [2 1 1 1 0 1 1 1 0 1 0 1 2 0 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 12200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  1  0 -1  0  0  0  1 -1  0  1 -1  0] (Indices: [4, 9, 10, 15, 18]), Candidate: [ 2  1  1  1  0  1  1  0  2  1 -1  1  1  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  1 -1  0  1 -1  0  1 -1  0  0  1 -1] (Indices: [4, 9, 12, 15, 19]), Candidate: [2 1 1 1 0 1 1 0 2 0 0 2 0 1 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 12300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  0  1  0 -1  1 -1  1 -1  0  0  0  0] (Indices: [4, 10, 11, 13, 15]), Candidate: [2 1 1 1 0 1 1 0 1 2 0 0 2 0 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 12350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  0  1 -1  0  1 -1  0  1  0 -1  0  0] (Indices: [4, 10, 13, 16, 17]), Candidate: [ 2  1  1  1  0  1  1  0  1  2 -1  1  2  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  0  0  1 -1  1  0 -1  0  0  1 -1  0] (Indices: [4, 11, 13, 14, 18]), Candidate: [ 2  1  1  1  0  1  1  0  1  1  1  0  2  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  0  0  0  1 -1  1  0 -1  0  0  1 -1] (Indices: [4, 12, 14, 15, 19]), Candidate: [2 1 1 1 0 1 1 0 1 1 0 2 0 2 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 12500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  0  0  0  0  0  0  1 -1  1  0  0 -1] (Indices: [4, 15, 17, 18, 19]), Candidate: [2 1 1 1 0 1 1 0 1 1 0 1 1 1 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 12550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  0  0  0  0  1 -1  0  0  1 -1  0  0] (Indices: [5, 6, 7, 13, 17]), Candidate: [ 2  1  1  0  2  1  1 -1  1  1  0  1  2  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1 -1  0  0  1 -1  0  0  0  0  1 -1  0] (Indices: [5, 6, 8, 12, 18]), Candidate: [2 1 1 0 2 1 0 1 0 1 0 2 0 1 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 12650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  1 -1  0  0  1 -1  0  0  1 -1  0  0] (Indices: [5, 6, 9, 13, 17]), Candidate: [2 1 1 0 2 1 0 0 2 0 0 1 2 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 12700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  0  1 -1  0  0  0  0  1 -1  0  1 -1] (Indices: [5, 6, 10, 16, 19]), Candidate: [ 2  1  1  0  2  1  0  0  1  2 -1  1  1  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  0  0  0  1 -1  0  0  0  1  0 -1  0] (Indices: [5, 6, 12, 17, 18]), Candidate: [2 1 1 0 2 1 0 0 1 1 0 2 0 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 12800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0 -1  1 -1  0  1 -1  0  0  0  0  0  0] (Indices: [5, 7, 8, 10, 13]), Candidate: [ 2  1  1  0  2  0  2  0  0  2 -1  1  2  0  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  1  0 -1  0  0  0  0  0  0  1 -1  0] (Indices: [5, 7, 9, 10, 18]), Candidate: [ 2  1  1  0  2  0  2 -1  2  1 -1  1  1  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 12900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  0  1 -1  1 -1  0  0  0  1 -1  0  0] (Indices: [5, 7, 10, 12, 17]), Candidate: [ 2  1  1  0  2  0  2 -1  1  2 -1  2  0  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 12950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  0  0  1 -1  0  0  0  0  1 -1  1 -1] (Indices: [5, 7, 11, 17, 19]), Candidate: [ 2  1  1  0  2  0  2 -1  1  1  1  0  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  0  0  0  0  0  0  1  0 -1  0  1 -1] (Indices: [5, 7, 15, 16, 19]), Candidate: [ 2  1  1  0  2  0  2 -1  1  1  0  1  1  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1  0 -1  0  0  0  0  0  0  1  0 -1  0] (Indices: [5, 8, 9, 17, 18]), Candidate: [2 1 1 0 2 0 1 1 1 0 0 1 1 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 13100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1 -1  0  1 -1  1 -1  0  0  0  1 -1  0] (Indices: [5, 8, 11, 13, 18]), Candidate: [2 1 1 0 2 0 1 1 0 1 1 0 2 0 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 13150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1 -1  0  0  0  1 -1  0  0  1  0 -1  0] (Indices: [5, 8, 13, 17, 18]), Candidate: [2 1 1 0 2 0 1 1 0 1 0 1 2 0 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 13200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  1  0 -1  0  0  0  1 -1  1 -1  0  0] (Indices: [5, 9, 10, 15, 17]), Candidate: [ 2  1  1  0  2  0  1  0  2  1 -1  1  1  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  1 -1  0  1 -1  0  1 -1  0  1 -1  0] (Indices: [5, 9, 12, 15, 18]), Candidate: [2 1 1 0 2 0 1 0 2 0 0 2 0 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 13300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  0  1  0 -1  1  0 -1  0  0  0  0  0] (Indices: [5, 10, 11, 13, 14]), Candidate: [ 2  1  1  0  2  0  1  0  1  2  0  0  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  0  1 -1  0  1 -1  1 -1  0  0  1 -1] (Indices: [5, 10, 13, 15, 19]), Candidate: [ 2  1  1  0  2  0  1  0  1  2 -1  1  2  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  0  0  1 -1  1  0 -1  0  1 -1  0  0] (Indices: [5, 11, 13, 14, 17]), Candidate: [ 2  1  1  0  2  0  1  0  1  1  1  0  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  0  0  0  1 -1  1  0 -1  0  1 -1  0] (Indices: [5, 12, 14, 15, 18]), Candidate: [2 1 1 0 2 0 1 0 1 1 0 2 0 2 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 13500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  0  0  0  0  0  0  1  0 -1  1  0 -1] (Indices: [5, 15, 16, 18, 19]), Candidate: [2 1 1 0 2 0 1 0 1 1 0 1 1 1 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 13550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0 -1  0  0  0  0  0  1 -1  0  1 -1  0] (Indices: [6, 7, 8, 15, 18]), Candidate: [2 1 1 0 1 2 1 0 0 1 0 1 1 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 13600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  1 -1  0  0  0  0  0  0  1  0 -1  0] (Indices: [6, 7, 9, 17, 18]), Candidate: [ 2  1  1  0  1  2  1 -1  2  0  0  1  1  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  0  0  1 -1  1 -1  0  0  0  1 -1  0] (Indices: [6, 7, 11, 13, 18]), Candidate: [ 2  1  1  0  1  2  1 -1  1  1  1  0  2  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  0  0  0  0  1 -1  0  0  1  0 -1  0] (Indices: [6, 7, 13, 17, 18]), Candidate: [ 2  1  1  0  1  2  1 -1  1  1  0  1  2  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1  0 -1  0  0  1 -1  0  0  1 -1  0  0] (Indices: [6, 8, 9, 13, 17]), Candidate: [2 1 1 0 1 2 0 1 1 0 0 1 2 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 13800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1 -1  1 -1  0  0  0  0  1 -1  0  1 -1] (Indices: [6, 8, 10, 16, 19]), Candidate: [ 2  1  1  0  1  2  0  1  0  2 -1  1  1  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1 -1  0  0  1 -1  0  0  0  1  0 -1  0] (Indices: [6, 8, 12, 17, 18]), Candidate: [2 1 1 0 1 2 0 1 0 1 0 2 0 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 13900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  1  0 -1  1 -1  0  0  0  1 -1  0  0] (Indices: [6, 9, 10, 12, 17]), Candidate: [ 2  1  1  0  1  2  0  0  2  1 -1  2  0  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  1 -1  1 -1  0  0  0  0  1 -1  1 -1] (Indices: [6, 9, 11, 17, 19]), Candidate: [2 1 1 0 1 2 0 0 2 0 1 0 1 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 14000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  1 -1  0  0  0  0  1  0 -1  0  1 -1] (Indices: [6, 9, 15, 16, 19]), Candidate: [2 1 1 0 1 2 0 0 2 0 0 1 1 1 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 14050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  0  1 -1  1 -1  0  1 -1  0  0  1 -1] (Indices: [6, 10, 12, 15, 19]), Candidate: [ 2  1  1  0  1  2  0  0  1  2 -1  2  0  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  0  0  1  0 -1  1 -1  0  1 -1  0  0] (Indices: [6, 11, 12, 14, 17]), Candidate: [ 2  1  1  0  1  2  0  0  1  1  1  1  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  0  0  0  1  0  0 -1  0  1 -1  0  0] (Indices: [6, 12, 13, 14, 17]), Candidate: [ 2  1  1  0  1  2  0  0  1  1  0  2  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  0  0  0  0  1 -1  0  1  0 -1  1 -1] (Indices: [6, 13, 16, 17, 19]), Candidate: [2 1 1 0 1 2 0 0 1 1 0 1 2 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 14250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0  0 -1  0  0  0  1 -1  0  1 -1  0  0] (Indices: [7, 8, 9, 14, 17]), Candidate: [ 2  1  1  0  1  1  2  0  1  0  0  1  1  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0 -1  0  1  0 -1  1 -1  0  0  0  0  0] (Indices: [7, 8, 11, 12, 14]), Candidate: [ 2  1  1  0  1  1  2  0  0  1  1  1  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0 -1  0  0  0  1  0 -1  0  1 -1  0  0] (Indices: [7, 8, 13, 14, 17]), Candidate: [ 2  1  1  0  1  1  2  0  0  1  0  1  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  1  0 -1  0  1 -1  0  1 -1  0  0  0] (Indices: [7, 9, 10, 13, 16]), Candidate: [ 2  1  1  0  1  1  2 -1  2  1 -1  1  2  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 14450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  1 -1  0  1  0 -1  0  0  1 -1  0  0] (Indices: [7, 9, 12, 13, 17]), Candidate: [ 2  1  1  0  1  1  2 -1  2  0  0  2  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  1 -1  0  0  0  0  0  1  0 -1  1 -1] (Indices: [7, 9, 16, 17, 19]), Candidate: [ 2  1  1  0  1  1  2 -1  2  0  0  1  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  0  1 -1  1 -1  0  0  0  1 -1  1 -1] (Indices: [7, 10, 12, 17, 19]), Candidate: [ 2  1  1  0  1  1  2 -1  1  2 -1  2  0  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 14600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  0  0  1  0 -1  0  1 -1  0  1 -1  0] (Indices: [7, 11, 12, 15, 18]), Candidate: [ 2  1  1  0  1  1  2 -1  1  1  1  1  0  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  0  0  0  1  0 -1  1 -1  0  1 -1  0] (Indices: [7, 12, 13, 15, 18]), Candidate: [ 2  1  1  0  1  1  2 -1  1  1  0  2  1  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  0  0  0  0  0  1  0  0 -1  0  1 -1] (Indices: [7, 14, 15, 16, 19]), Candidate: [ 2  1  1  0  1  1  2 -1  1  1  0  1  1  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1  0 -1  1  0 -1  1 -1  0  0  0  0  0] (Indices: [8, 9, 11, 12, 14]), Candidate: [ 2  1  1  0  1  1  1  1  1  0  1  1  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1  0 -1  0  0  1  0 -1  0  1 -1  0  0] (Indices: [8, 9, 13, 14, 17]), Candidate: [ 2  1  1  0  1  1  1  1  1  0  0  1  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1 -1  1  0 -1  0  1 -1  0  0  0  1 -1] (Indices: [8, 10, 11, 14, 19]), Candidate: [ 2  1  1  0  1  1  1  1  0  2  0  0  1  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1 -1  1 -1  0  0  1  0 -1  0  0  1 -1] (Indices: [8, 10, 14, 15, 19]), Candidate: [ 2  1  1  0  1  1  1  1  0  2 -1  1  1  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1 -1  0  1 -1  1 -1  0  0  1  0 -1  0] (Indices: [8, 11, 13, 17, 18]), Candidate: [2 1 1 0 1 1 1 1 0 1 1 0 2 0 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 15000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1 -1  0  0  1 -1  0  1  0 -1  0  1 -1] (Indices: [8, 12, 15, 16, 19]), Candidate: [2 1 1 0 1 1 1 1 0 1 0 2 0 1 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 15050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  1  0  0 -1  1  0 -1  0  0  0  0  0] (Indices: [9, 10, 11, 13, 14]), Candidate: [ 2  1  1  0  1  1  1  0  2  1  0  0  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  1  0 -1  0  1 -1  1 -1  0  0  1 -1] (Indices: [9, 10, 13, 15, 19]), Candidate: [ 2  1  1  0  1  1  1  0  2  1 -1  1  2  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  1 -1  1 -1  1  0 -1  0  1 -1  0  0] (Indices: [9, 11, 13, 14, 17]), Candidate: [ 2  1  1  0  1  1  1  0  2  0  1  0  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  1 -1  0  1 -1  1  0 -1  0  1 -1  0] (Indices: [9, 12, 14, 15, 18]), Candidate: [2 1 1 0 1 1 1 0 2 0 0 2 0 2 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 15250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  1 -1  0  0  0  0  1  0 -1  1  0 -1] (Indices: [9, 15, 16, 18, 19]), Candidate: [2 1 1 0 1 1 1 0 2 0 0 1 1 1 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 15300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0  1  0 -1  0  0  1  0 -1  1 -1  0] (Indices: [10, 11, 15, 16, 18]), Candidate: [2 1 1 0 1 1 1 0 1 2 0 0 1 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 15350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0  1 -1  0  1  0 -1  1 -1  0  1 -1] (Indices: [10, 13, 14, 16, 19]), Candidate: [ 2  1  1  0  1  1  1  0  1  2 -1  1  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0  0  1  0 -1  1 -1  1 -1  0  1 -1] (Indices: [11, 12, 14, 16, 19]), Candidate: [ 2  1  1  0  1  1  1  0  1  1  1  1  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 -1  1 -1  0  0] (Indices: [12, 13, 14, 15, 17]), Candidate: [2 1 1 0 1 1 1 0 1 1 0 2 1 1 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 15500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 -1  1 -1] (Indices: [14, 15, 16, 17, 19]), Candidate: [2 1 1 0 1 1 1 0 1 1 0 1 1 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Finished generating neighbors. Total valid neighbors found: 6272
  Size of neighborhood t=5: 6272
  Using 'fork' start method for multiprocessing.
  No improvement found for t=5 after processing 6272 neighbors.
No improving solution found or error occurred for t=5.

Attempting neighborhood t=6 (current best cost: 98.4663)
  Exploring neighborhood t=6 in parallel (current cost: 98.4663)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Attempt 50: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  0  0  0  0  0  0  1 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 7, 15]), Candidate: [ 2  1  1 -1  1  1  2 -1  1  1  0  1  1  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  0  0  0  0  1  0 -1  0  0  0  0  1] (Indices: [0, 1, 2, 3, 13, 14]), Candidate: [ 2  1  1 -1  1  1  1  0  1  1  0  1  2  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  0  1 -1  0  0  0  0  0  0  0  0  1] (Indices: [0, 1, 2, 4, 7, 10]), Candidate: [ 2  1  0  1  0  1  2 -1  1  2 -1  1  1  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  0  0  0  1 -1  0  1 -1  0  0  0  1] (Indices: [0, 1, 2, 4, 12, 15]), Candidate: [2 1 0 1 0 1 1 0 1 1 0 2 0 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  0  0  0  0  0  0  0  0  0  0  1  0] (Indices: [0, 1, 2, 5, 7, 19]), Candidate: [ 2  1  0  0  2  0  2 -1  1  1  0  1  1  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  0  0  0  0  1 -1  0  0  0  1 -1  1] (Indices: [0, 1, 2, 5, 13, 18]), Candidate: [2 1 0 0 2 0 1 0 1 1 0 1 2 0 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  0  1  0 -1  0  0  0  0  0  0  0  1] (Indices: [0, 1, 2, 6, 10, 11]), Candidate: [2 1 0 0 1 2 0 0 1 2 0 0 1 1 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0 -1  0  0  0  0  1 -1  0  0  0  0  1] (Indices: [0, 1, 2, 7, 8, 14]), Candidate: [ 2  1  0  0  1  1  2  0  0  1  0  1  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  0  0  0  0  0  1 -1  0  0  0  1  0] (Indices: [0, 1, 2, 7, 14, 19]), Candidate: [ 2  1  0  0  1  1  2 -1  1  1  0  1  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1 -1  0  0  0  1 -1  0  0  0  0  1  0] (Indices: [0, 1, 2, 8, 13, 19]), Candidate: [2 1 0 0 1 1 1 1 0 1 0 1 2 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  1 -1  0  0  0  1 -1  0  0  0  1  0] (Indices: [0, 1, 2, 9, 14, 19]), Candidate: [ 2  1  0  0  1  1  1  0  2  0  0  1  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  0  0  1  0 -1  0  0  1 -1  0  0  1] (Indices: [0, 1, 2, 11, 12, 16]), Candidate: [2 1 0 0 1 1 1 0 1 1 1 1 0 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  0  0  0  0  1  0 -1  0  0  0  1  0] (Indices: [0, 1, 2, 13, 14, 19]), Candidate: [ 2  1  0  0  1  1  1  0  1  1  0  1  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  0  0  0  1 -1  0  0  0  0  0  0  1] (Indices: [0, 1, 3, 4, 6, 12]), Candidate: [2 0 2 0 0 2 0 0 1 1 0 2 0 1 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  0  0  1  0 -1  0  0  0  0  0  0  1] (Indices: [0, 1, 3, 4, 11, 12]), Candidate: [2 0 2 0 0 1 1 0 1 1 1 1 0 1 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  1 -1  0  0  0  0  0  0  0  0  0  1] (Indices: [0, 1, 3, 5, 7, 9]), Candidate: [ 2  0  2 -1  2  0  2 -1  2  0  0  1  1  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  0  0  0  1 -1  1 -1  0  0  0  0  1] (Indices: [0, 1, 3, 5, 12, 14]), Candidate: [ 2  0  2 -1  2  0  1  0  1  1  0  2  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  1  0 -1  0  0  0  0  0  0  0  0  1] (Indices: [0, 1, 3, 6, 9, 10]), Candidate: [ 2  0  2 -1  1  2  0  0  2  1 -1  1  1  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  0  0  0  0  0  0  0  1 -1  1 -1  1] (Indices: [0, 1, 3, 6, 16, 18]), Candidate: [ 2  0  2 -1  1  2  0  0  1  1  0  1  1  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  0  0  0  0  1  0 -1  0  0  0  0  1] (Indices: [0, 1, 3, 7, 13, 14]), Candidate: [ 2  0  2 -1  1  1  2 -1  1  1  0  1  2  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 1050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1 -1  0  0  1 -1  0  1 -1  0  0  0  1] (Indices: [0, 1, 3, 8, 12, 15]), Candidate: [ 2  0  2 -1  1  1  1  1  0  1  0  2  0  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  1 -1  0  0  1  0 -1  0  0  0  0  1] (Indices: [0, 1, 3, 9, 13, 14]), Candidate: [ 2  0  2 -1  1  1  1  0  2  0  0  1  2  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  0  1 -1  0  0  0  1 -1  0  0  1  0] (Indices: [0, 1, 3, 10, 15, 19]), Candidate: [ 2  0  2 -1  1  1  1  0  1  2 -1  1  1  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  0  0  0  1 -1  0  0  1  0 -1  0  1] (Indices: [0, 1, 3, 12, 16, 17]), Candidate: [ 2  0  2 -1  1  1  1  0  1  1  0  2  0  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  0  0  0  0  0  0  0  1 -1  0  0  1] (Indices: [0, 1, 4, 5, 6, 16]), Candidate: [2 0 1 1 1 1 0 0 1 1 0 1 1 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 1300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  0  0  1 -1  0  0  0  1 -1  0  0  1] (Indices: [0, 1, 4, 5, 11, 16]), Candidate: [2 0 1 1 1 0 1 0 1 1 1 0 1 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 1350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1 -1  0  0  0  0  0  1 -1  0  0  0  1] (Indices: [0, 1, 4, 6, 8, 15]), Candidate: [2 0 1 1 0 2 0 1 0 1 0 1 1 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 1400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  0  0  0  0  0  0  1  0 -1  0  0  1] (Indices: [0, 1, 4, 6, 15, 16]), Candidate: [2 0 1 1 0 2 0 0 1 1 0 1 1 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 1450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  0  0  0  1 -1  0  1 -1  0  0  0  1] (Indices: [0, 1, 4, 7, 12, 15]), Candidate: [ 2  0  1  1  0  1  2 -1  1  1  0  2  0  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1 -1  0  1 -1  0  0  0  0  1 -1  0  1] (Indices: [0, 1, 4, 8, 11, 17]), Candidate: [2 0 1 1 0 1 1 1 0 1 1 0 1 1 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 1550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  1 -1  0  1 -1  0  1 -1  0  0  0  1] (Indices: [0, 1, 4, 9, 12, 15]), Candidate: [2 0 1 1 0 1 1 0 2 0 0 2 0 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 1600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  0  1 -1  0  0  1 -1  0  0  1 -1  1] (Indices: [0, 1, 4, 10, 14, 18]), Candidate: [ 2  0  1  1  0  1  1  0  1  2 -1  1  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  0  0  0  1 -1  1 -1  0  0  0  1  0] (Indices: [0, 1, 4, 12, 14, 19]), Candidate: [ 2  0  1  1  0  1  1  0  1  1  0  2  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  0  0  0  1 -1  0  0  0  0  0  0  1] (Indices: [0, 1, 5, 6, 7, 12]), Candidate: [ 2  0  1  0  2  1  1 -1  1  1  0  2  0  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  0  0  0  1 -1  0  0  0  1 -1  0  1] (Indices: [0, 1, 5, 6, 12, 17]), Candidate: [2 0 1 0 2 1 0 0 1 1 0 2 0 1 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 1800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  0  1 -1  0  0  0  0  1 -1  0  0  1] (Indices: [0, 1, 5, 7, 10, 16]), Candidate: [ 2  0  1  0  2  0  2 -1  1  2 -1  1  1  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1 -1  1  0 -1  0  0  0  0  0  0  0  1] (Indices: [0, 1, 5, 8, 10, 11]), Candidate: [2 0 1 0 2 0 1 1 0 2 0 0 1 1 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 1900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  1  0 -1  0  0  0  0  1 -1  0  0  1] (Indices: [0, 1, 5, 9, 10, 16]), Candidate: [ 2  0  1  0  2  0  1  0  2  1 -1  1  1  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  0  1 -1  1 -1  0  1 -1  0  0  0  1] (Indices: [0, 1, 5, 10, 12, 15]), Candidate: [ 2  0  1  0  2  0  1  0  1  2 -1  2  0  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  0  0  1 -1  0  0  0  1 -1  0  1  0] (Indices: [0, 1, 5, 11, 16, 19]), Candidate: [2 0 1 0 2 0 1 0 1 1 1 0 1 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 2050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  0  0  0  0  0  0  1  0  0 -1  0  1] (Indices: [0, 1, 5, 15, 16, 17]), Candidate: [2 0 1 0 2 0 1 0 1 1 0 1 1 1 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 2100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  0  0  0  1 -1  0  1 -1  0  0  0  1] (Indices: [0, 1, 6, 7, 12, 15]), Candidate: [ 2  0  1  0  1  2  1 -1  1  1  0  2  0  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1 -1  0  1 -1  0  0  0  0  1 -1  0  1] (Indices: [0, 1, 6, 8, 11, 17]), Candidate: [2 0 1 0 1 2 0 1 0 1 1 0 1 1 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 2200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  1 -1  0  1 -1  0  1 -1  0  0  0  1] (Indices: [0, 1, 6, 9, 12, 15]), Candidate: [2 0 1 0 1 2 0 0 2 0 0 2 0 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 2250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  0  1 -1  0  0  1 -1  0  0  1 -1  1] (Indices: [0, 1, 6, 10, 14, 18]), Candidate: [ 2  0  1  0  1  2  0  0  1  2 -1  1  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  0  0  0  1 -1  1 -1  0  0  0  1  0] (Indices: [0, 1, 6, 12, 14, 19]), Candidate: [ 2  0  1  0  1  2  0  0  1  1  0  2  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0  0 -1  0  0  0  1 -1  0  0  0  0  1] (Indices: [0, 1, 7, 8, 9, 14]), Candidate: [ 2  0  1  0  1  1  2  0  1  0  0  1  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0 -1  0  0  0  0  0  0  0  0  1  0  0] (Indices: [0, 1, 7, 8, 18, 19]), Candidate: [2 0 1 0 1 1 2 0 0 1 0 1 1 1 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 2450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  0  1  0 -1  0  0  0  1 -1  0  0  1] (Indices: [0, 1, 7, 10, 11, 16]), Candidate: [ 2  0  1  0  1  1  2 -1  1  2  0  0  1  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  0  0  1 -1  0  0  1  0 -1  0  0  1] (Indices: [0, 1, 7, 11, 15, 16]), Candidate: [ 2  0  1  0  1  1  2 -1  1  1  1  0  1  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  0  0  0  0  0  1 -1  1  0 -1  0  1] (Indices: [0, 1, 7, 14, 16, 17]), Candidate: [ 2  0  1  0  1  1  2 -1  1  1  0  1  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1  0 -1  0  0  0  1 -1  0  0  0  1  0] (Indices: [0, 1, 8, 9, 14, 19]), Candidate: [ 2  0  1  0  1  1  1  1  1  0  0  1  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1 -1  0  1  0 -1  0  0  1 -1  0  0  1] (Indices: [0, 1, 8, 11, 12, 16]), Candidate: [2 0 1 0 1 1 1 1 0 1 1 1 0 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 2700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1 -1  0  0  0  1  0 -1  0  0  0  1  0] (Indices: [0, 1, 8, 13, 14, 19]), Candidate: [ 2  0  1  0  1  1  1  1  0  1  0  1  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  1  0 -1  0  1 -1  0  0  0  1 -1  1] (Indices: [0, 1, 9, 10, 13, 18]), Candidate: [ 2  0  1  0  1  1  1  0  2  1 -1  1  2  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  1 -1  0  1  0 -1  0  0  0  0  1  0] (Indices: [0, 1, 9, 12, 13, 19]), Candidate: [2 0 1 0 1 1 1 0 2 0 0 2 1 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 2850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  1 -1  0  0  0  0  0  0  1  0  0  0] (Indices: [0, 1, 9, 17, 18, 19]), Candidate: [2 0 1 0 1 1 1 0 2 0 0 1 1 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 2900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  0  1 -1  0  1  0  0 -1  0  0  0  1] (Indices: [0, 1, 10, 13, 14, 15]), Candidate: [ 2  0  1  0  1  1  1  0  1  2 -1  1  2  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  0  0  1  0 -1  0  0  1  0 -1  0  1] (Indices: [0, 1, 11, 12, 16, 17]), Candidate: [2 0 1 0 1 1 1 0 1 1 1 1 0 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 3000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  0  0  0  1  0 -1  0  1  0 -1  0  1] (Indices: [0, 1, 12, 13, 16, 17]), Candidate: [2 0 1 0 1 1 1 0 1 1 0 2 1 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 3050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  0  0  0  0  0  1  0 -1  1 -1  1  0] (Indices: [0, 1, 14, 15, 17, 19]), Candidate: [2 0 1 0 1 1 1 0 1 1 0 1 1 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 3100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1  0 -1  0  0  0  0  0  0  0  0  0  1] (Indices: [0, 2, 3, 4, 8, 9]), Candidate: [1 2 1 0 0 1 1 1 1 0 0 1 1 1 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 3150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  0  0  0  0  1 -1  0  0  0  0  1  0] (Indices: [0, 2, 3, 4, 13, 19]), Candidate: [1 2 1 0 0 1 1 0 1 1 0 1 2 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 3200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1 -1  0  0  0  0  0  0  0  0  1 -1  1] (Indices: [0, 2, 3, 5, 8, 18]), Candidate: [ 1  2  1 -1  2  0  1  1  0  1  0  1  1  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  0  0  0  0  0  0  1 -1  0  0  1  0] (Indices: [0, 2, 3, 5, 15, 19]), Candidate: [ 1  2  1 -1  2  0  1  0  1  1  0  1  1  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  0  0  1 -1  1 -1  0  0  0  0  0  1] (Indices: [0, 2, 3, 6, 11, 13]), Candidate: [ 1  2  1 -1  1  2  0  0  1  1  1  0  2  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  1 -1  0  0  0  1 -1  0  0  0  0  1] (Indices: [0, 2, 3, 7, 9, 14]), Candidate: [ 1  2  1 -1  1  1  2 -1  2  0  0  1  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 3400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  0  0  0  0  0  0  0  0  0  1  0  0] (Indices: [0, 2, 3, 7, 18, 19]), Candidate: [ 1  2  1 -1  1  1  2 -1  1  1  0  1  1  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1 -1  0  0  0  0  0  0  1  0 -1  0  1] (Indices: [0, 2, 3, 8, 16, 17]), Candidate: [ 1  2  1 -1  1  1  1  1  0  1  0  1  1  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  1 -1  0  0  0  0  0  0  0  1  0  0] (Indices: [0, 2, 3, 9, 18, 19]), Candidate: [ 1  2  1 -1  1  1  1  0  2  0  0  1  1  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  0  0  1 -1  0  1  0 -1  0  0  0  1] (Indices: [0, 2, 3, 11, 14, 15]), Candidate: [ 1  2  1 -1  1  1  1  0  1  1  1  0  1  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  0  0  0  0  1 -1  0  0  0  1  0  0] (Indices: [0, 2, 3, 13, 18, 19]), Candidate: [ 1  2  1 -1  1  1  1  0  1  1  0  1  2  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1 -1  0  0  0  1 -1  0  0  0  0  0  1] (Indices: [0, 2, 4, 5, 8, 13]), Candidate: [1 2 0 1 1 0 1 1 0 1 0 1 2 0 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 3700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  0  0  0  0  0  1 -1  0  0  1 -1  1] (Indices: [0, 2, 4, 5, 14, 18]), Candidate: [ 1  2  0  1  1  0  1  0  1  1  0  1  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  0  1 -1  0  0  0  0  1 -1  0  0  1] (Indices: [0, 2, 4, 6, 10, 16]), Candidate: [ 1  2  0  1  0  2  0  0  1  2 -1  1  1  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0 -1  0  0  0  0  0  0  0  0  0  1  0] (Indices: [0, 2, 4, 7, 8, 19]), Candidate: [1 2 0 1 0 1 2 0 0 1 0 1 1 1 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 3850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  0  0  0  0  0  0  0  1  0 -1  0  1] (Indices: [0, 2, 4, 7, 16, 17]), Candidate: [ 1  2  0  1  0  1  2 -1  1  1  0  1  1  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1 -1  0  0  0  0  1 -1  0  0  0  1  0] (Indices: [0, 2, 4, 8, 14, 19]), Candidate: [ 1  2  0  1  0  1  1  1  0  1  0  1  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  1 -1  0  0  0  0  0  1  0 -1  0  1] (Indices: [0, 2, 4, 9, 16, 17]), Candidate: [1 2 0 1 0 1 1 0 2 0 0 1 1 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 4000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  0  0  1 -1  1 -1  1 -1  0  0  0  1] (Indices: [0, 2, 4, 11, 13, 15]), Candidate: [1 2 0 1 0 1 1 0 1 1 1 0 2 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 4050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  0  0  0  0  1 -1  0  1  0 -1  0  1] (Indices: [0, 2, 4, 13, 16, 17]), Candidate: [1 2 0 1 0 1 1 0 1 1 0 1 2 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 4100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  1 -1  1 -1  0  0  0  0  0  0  0  1] (Indices: [0, 2, 5, 6, 9, 11]), Candidate: [1 2 0 0 2 1 0 0 2 0 1 0 1 1 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 4150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  0  0  0  0  0  0  0  1 -1  0  1  0] (Indices: [0, 2, 5, 6, 16, 19]), Candidate: [1 2 0 0 2 1 0 0 1 1 0 1 1 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 4200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  0  0  0  0  1 -1  1 -1  0  0  0  1] (Indices: [0, 2, 5, 7, 13, 15]), Candidate: [ 1  2  0  0  2  0  2 -1  1  1  0  1  2  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1 -1  0  0  1 -1  0  0  1 -1  0  0  1] (Indices: [0, 2, 5, 8, 12, 16]), Candidate: [1 2 0 0 2 0 1 1 0 1 0 2 0 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 4300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  1 -1  0  0  1 -1  1 -1  0  0  0  1] (Indices: [0, 2, 5, 9, 13, 15]), Candidate: [1 2 0 0 2 0 1 0 2 0 0 1 2 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 4350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  0  1 -1  0  0  0  0  1  0 -1  0  1] (Indices: [0, 2, 5, 10, 16, 17]), Candidate: [ 1  2  0  0  2  0  1  0  1  2 -1  1  1  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  0  0  0  1 -1  0  0  1 -1  1 -1  1] (Indices: [0, 2, 5, 12, 16, 18]), Candidate: [1 2 0 0 2 0 1 0 1 1 0 2 0 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 4450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0 -1  0  0  0  0  0  0  0  0  0  1  0] (Indices: [0, 2, 6, 7, 8, 19]), Candidate: [1 2 0 0 1 2 1 0 0 1 0 1 1 1 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 4500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  0  0  0  0  0  0  0  1  0 -1  0  1] (Indices: [0, 2, 6, 7, 16, 17]), Candidate: [ 1  2  0  0  1  2  1 -1  1  1  0  1  1  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1 -1  0  0  0  0  1 -1  0  0  0  1  0] (Indices: [0, 2, 6, 8, 14, 19]), Candidate: [ 1  2  0  0  1  2  0  1  0  1  0  1  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  1 -1  0  0  0  0  0  1  0 -1  0  1] (Indices: [0, 2, 6, 9, 16, 17]), Candidate: [1 2 0 0 1 2 0 0 2 0 0 1 1 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 4650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  0  0  1 -1  1 -1  1 -1  0  0  0  1] (Indices: [0, 2, 6, 11, 13, 15]), Candidate: [1 2 0 0 1 2 0 0 1 1 1 0 2 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 4700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  0  0  0  0  1 -1  0  1  0 -1  0  1] (Indices: [0, 2, 6, 13, 16, 17]), Candidate: [1 2 0 0 1 2 0 0 1 1 0 1 2 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 4750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0 -1  0  1 -1  0  0  0  0  1 -1  0  1] (Indices: [0, 2, 7, 8, 11, 17]), Candidate: [1 2 0 0 1 1 2 0 0 1 1 0 1 1 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 4800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  1 -1  0  1 -1  0  1 -1  0  0  0  1] (Indices: [0, 2, 7, 9, 12, 15]), Candidate: [ 1  2  0  0  1  1  2 -1  2  0  0  2  0  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  0  1 -1  0  0  1 -1  0  0  1 -1  1] (Indices: [0, 2, 7, 10, 14, 18]), Candidate: [ 1  2  0  0  1  1  2 -1  1  2 -1  1  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 4900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  0  0  0  1 -1  1 -1  0  0  0  1  0] (Indices: [0, 2, 7, 12, 14, 19]), Candidate: [ 1  2  0  0  1  1  2 -1  1  1  0  2  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1  0  0 -1  0  0  0  1 -1  0  0  0  1] (Indices: [0, 2, 8, 9, 10, 15]), Candidate: [ 1  2  0  0  1  1  1  1  1  1 -1  1  1  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1 -1  1 -1  1 -1  1 -1  0  0  0  0  1] (Indices: [0, 2, 8, 10, 12, 14]), Candidate: [ 1  2  0  0  1  1  1  1  0  2 -1  2  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1 -1  0  1 -1  0  0  0  1 -1  1 -1  1] (Indices: [0, 2, 8, 11, 16, 18]), Candidate: [1 2 0 0 1 1 1 1 0 1 1 0 1 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 5100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1 -1  0  0  0  0  1 -1  0  0  1  0  0] (Indices: [0, 2, 8, 14, 18, 19]), Candidate: [ 1  2  0  0  1  1  1  1  0  1  0  1  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  1 -1  1  0 -1  0  0  1 -1  0  0  1] (Indices: [0, 2, 9, 11, 12, 16]), Candidate: [1 2 0 0 1 1 1 0 2 0 1 1 0 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 5200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  1 -1  0  0  1  0 -1  0  0  0  1  0] (Indices: [0, 2, 9, 13, 14, 19]), Candidate: [ 1  2  0  0  1  1  1  0  2  0  0  1  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  0  1  0 -1  0  0  1 -1  1 -1  0  1] (Indices: [0, 2, 10, 11, 15, 17]), Candidate: [1 2 0 0 1 1 1 0 1 2 0 0 1 1 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 5300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  0  1 -1  0  0  1 -1  1 -1  1 -1  1] (Indices: [0, 2, 10, 14, 16, 18]), Candidate: [ 1  2  0  0  1  1  1  0  1  2 -1  1  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  0  0  1 -1  1 -1  0  0  0  1  0  0] (Indices: [0, 2, 11, 13, 18, 19]), Candidate: [1 2 0 0 1 1 1 0 1 1 1 0 2 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 5400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  0  0  0  1 -1  0  1 -1  1 -1  1  0] (Indices: [0, 2, 12, 15, 17, 19]), Candidate: [1 2 0 0 1 1 1 0 1 1 0 2 0 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 5450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  0  0  0  0  0  0  0  1 -1  0  0  1] (Indices: [0, 3, 4, 5, 6, 16]), Candidate: [1 1 2 0 1 1 0 0 1 1 0 1 1 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 5500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  0  0  1 -1  0  0  0  1 -1  0  0  1] (Indices: [0, 3, 4, 5, 11, 16]), Candidate: [1 1 2 0 1 0 1 0 1 1 1 0 1 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 5550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1 -1  0  0  0  0  0  1 -1  0  0  0  1] (Indices: [0, 3, 4, 6, 8, 15]), Candidate: [1 1 2 0 0 2 0 1 0 1 0 1 1 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 5600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  0  0  0  0  0  0  1  0 -1  0  0  1] (Indices: [0, 3, 4, 6, 15, 16]), Candidate: [1 1 2 0 0 2 0 0 1 1 0 1 1 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 5650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  0  0  0  1 -1  0  1 -1  0  0  0  1] (Indices: [0, 3, 4, 7, 12, 15]), Candidate: [ 1  1  2  0  0  1  2 -1  1  1  0  2  0  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1 -1  0  1 -1  0  0  0  0  1 -1  0  1] (Indices: [0, 3, 4, 8, 11, 17]), Candidate: [1 1 2 0 0 1 1 1 0 1 1 0 1 1 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 5750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  1 -1  0  1 -1  0  1 -1  0  0  0  1] (Indices: [0, 3, 4, 9, 12, 15]), Candidate: [1 1 2 0 0 1 1 0 2 0 0 2 0 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 5800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  0  1 -1  0  0  1 -1  0  0  1 -1  1] (Indices: [0, 3, 4, 10, 14, 18]), Candidate: [ 1  1  2  0  0  1  1  0  1  2 -1  1  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  0  0  0  1 -1  1 -1  0  0  0  1  0] (Indices: [0, 3, 4, 12, 14, 19]), Candidate: [ 1  1  2  0  0  1  1  0  1  1  0  2  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  0  0  0  1 -1  0  0  0  0  0  0  1] (Indices: [0, 3, 5, 6, 7, 12]), Candidate: [ 1  1  2 -1  2  1  1 -1  1  1  0  2  0  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  0  0  0  1 -1  0  0  0  1 -1  0  1] (Indices: [0, 3, 5, 6, 12, 17]), Candidate: [ 1  1  2 -1  2  1  0  0  1  1  0  2  0  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  0  1 -1  0  0  0  0  1 -1  0  0  1] (Indices: [0, 3, 5, 7, 10, 16]), Candidate: [ 1  1  2 -1  2  0  2 -1  1  2 -1  1  1  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 6050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1 -1  1  0 -1  0  0  0  0  0  0  0  1] (Indices: [0, 3, 5, 8, 10, 11]), Candidate: [ 1  1  2 -1  2  0  1  1  0  2  0  0  1  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  1  0 -1  0  0  0  0  1 -1  0  0  1] (Indices: [0, 3, 5, 9, 10, 16]), Candidate: [ 1  1  2 -1  2  0  1  0  2  1 -1  1  1  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  0  1 -1  1 -1  0  1 -1  0  0  0  1] (Indices: [0, 3, 5, 10, 12, 15]), Candidate: [ 1  1  2 -1  2  0  1  0  1  2 -1  2  0  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  0  0  1 -1  0  0  0  1 -1  0  1  0] (Indices: [0, 3, 5, 11, 16, 19]), Candidate: [ 1  1  2 -1  2  0  1  0  1  1  1  0  1  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  0  0  0  0  0  0  1  0  0 -1  0  1] (Indices: [0, 3, 5, 15, 16, 17]), Candidate: [ 1  1  2 -1  2  0  1  0  1  1  0  1  1  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  0  0  0  1 -1  0  1 -1  0  0  0  1] (Indices: [0, 3, 6, 7, 12, 15]), Candidate: [ 1  1  2 -1  1  2  1 -1  1  1  0  2  0  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1 -1  0  1 -1  0  0  0  0  1 -1  0  1] (Indices: [0, 3, 6, 8, 11, 17]), Candidate: [ 1  1  2 -1  1  2  0  1  0  1  1  0  1  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  1 -1  0  1 -1  0  1 -1  0  0  0  1] (Indices: [0, 3, 6, 9, 12, 15]), Candidate: [ 1  1  2 -1  1  2  0  0  2  0  0  2  0  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  0  1 -1  0  0  1 -1  0  0  1 -1  1] (Indices: [0, 3, 6, 10, 14, 18]), Candidate: [ 1  1  2 -1  1  2  0  0  1  2 -1  1  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 6500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  0  0  0  1 -1  1 -1  0  0  0  1  0] (Indices: [0, 3, 6, 12, 14, 19]), Candidate: [ 1  1  2 -1  1  2  0  0  1  1  0  2  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0  0 -1  0  0  0  1 -1  0  0  0  0  1] (Indices: [0, 3, 7, 8, 9, 14]), Candidate: [ 1  1  2 -1  1  1  2  0  1  0  0  1  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0 -1  0  0  0  0  0  0  0  0  1  0  0] (Indices: [0, 3, 7, 8, 18, 19]), Candidate: [ 1  1  2 -1  1  1  2  0  0  1  0  1  1  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  0  1  0 -1  0  0  0  1 -1  0  0  1] (Indices: [0, 3, 7, 10, 11, 16]), Candidate: [ 1  1  2 -1  1  1  2 -1  1  2  0  0  1  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  0  0  1 -1  0  0  1  0 -1  0  0  1] (Indices: [0, 3, 7, 11, 15, 16]), Candidate: [ 1  1  2 -1  1  1  2 -1  1  1  1  0  1  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  0  0  0  0  0  1 -1  1  0 -1  0  1] (Indices: [0, 3, 7, 14, 16, 17]), Candidate: [ 1  1  2 -1  1  1  2 -1  1  1  0  1  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 6800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1  0 -1  0  0  0  1 -1  0  0  0  1  0] (Indices: [0, 3, 8, 9, 14, 19]), Candidate: [ 1  1  2 -1  1  1  1  1  1  0  0  1  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1 -1  0  1  0 -1  0  0  1 -1  0  0  1] (Indices: [0, 3, 8, 11, 12, 16]), Candidate: [ 1  1  2 -1  1  1  1  1  0  1  1  1  0  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1 -1  0  0  0  1  0 -1  0  0  0  1  0] (Indices: [0, 3, 8, 13, 14, 19]), Candidate: [ 1  1  2 -1  1  1  1  1  0  1  0  1  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  1  0 -1  0  1 -1  0  0  0  1 -1  1] (Indices: [0, 3, 9, 10, 13, 18]), Candidate: [ 1  1  2 -1  1  1  1  0  2  1 -1  1  2  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  1 -1  0  1  0 -1  0  0  0  0  1  0] (Indices: [0, 3, 9, 12, 13, 19]), Candidate: [ 1  1  2 -1  1  1  1  0  2  0  0  2  1  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  1 -1  0  0  0  0  0  0  1  0  0  0] (Indices: [0, 3, 9, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  1  1  0  2  0  0  1  1  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  0  1 -1  0  1  0  0 -1  0  0  0  1] (Indices: [0, 3, 10, 13, 14, 15]), Candidate: [ 1  1  2 -1  1  1  1  0  1  2 -1  1  2  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  0  0  1  0 -1  0  0  1  0 -1  0  1] (Indices: [0, 3, 11, 12, 16, 17]), Candidate: [ 1  1  2 -1  1  1  1  0  1  1  1  1  0  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  0  0  0  1  0 -1  0  1  0 -1  0  1] (Indices: [0, 3, 12, 13, 16, 17]), Candidate: [ 1  1  2 -1  1  1  1  0  1  1  0  2  1  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  0  0  0  0  0  1  0 -1  1 -1  1  0] (Indices: [0, 3, 14, 15, 17, 19]), Candidate: [ 1  1  2 -1  1  1  1  0  1  1  0  1  1  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  0  1 -1  0  0  0  0  0  1 -1  0  1] (Indices: [0, 4, 5, 6, 10, 17]), Candidate: [ 1  1  1  1  1  1  0  0  1  2 -1  1  1  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  1  0 -1  0  0  0  0  0  0  0  0  1] (Indices: [0, 4, 5, 7, 9, 10]), Candidate: [ 1  1  1  1  1  0  2 -1  2  1 -1  1  1  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  0  0  0  0  0  0  0  1 -1  1 -1  1] (Indices: [0, 4, 5, 7, 16, 18]), Candidate: [ 1  1  1  1  1  0  2 -1  1  1  0  1  1  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1 -1  0  0  0  0  0  1  0 -1  0  0  1] (Indices: [0, 4, 5, 8, 15, 16]), Candidate: [1 1 1 1 1 0 1 1 0 1 0 1 1 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 7500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  1 -1  0  0  0  0  0  1 -1  1 -1  1] (Indices: [0, 4, 5, 9, 16, 18]), Candidate: [1 1 1 1 1 0 1 0 2 0 0 1 1 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 7550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  0  0  1 -1  1 -1  0  1 -1  0  0  1] (Indices: [0, 4, 5, 11, 13, 16]), Candidate: [1 1 1 1 1 0 1 0 1 1 1 0 2 0 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 7600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  0  0  0  0  1 -1  0  1 -1  1 -1  1] (Indices: [0, 4, 5, 13, 16, 18]), Candidate: [1 1 1 1 1 0 1 0 1 1 0 1 2 0 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 7650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  0  1 -1  0  0  0  1 -1  0  0  0  1] (Indices: [0, 4, 6, 7, 10, 15]), Candidate: [ 1  1  1  1  0  2  1 -1  1  2 -1  1  1  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1  0 -1  0  0  0  0  0  0  0  0  1  0] (Indices: [0, 4, 6, 8, 9, 19]), Candidate: [1 1 1 1 0 2 0 1 1 0 0 1 1 1 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 7750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  1  0 -1  0  0  0  1 -1  0  0  0  1] (Indices: [0, 4, 6, 9, 10, 15]), Candidate: [ 1  1  1  1  0  2  0  0  2  1 -1  1  1  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  0  1 -1  1 -1  1 -1  0  0  0  0  1] (Indices: [0, 4, 6, 10, 12, 14]), Candidate: [ 1  1  1  1  0  2  0  0  1  2 -1  2  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  0  0  1 -1  0  0  0  1 -1  1 -1  1] (Indices: [0, 4, 6, 11, 16, 18]), Candidate: [1 1 1 1 0 2 0 0 1 1 1 0 1 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 7900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  0  0  0  0  0  1 -1  0  0  1  0  0] (Indices: [0, 4, 6, 14, 18, 19]), Candidate: [ 1  1  1  1  0  2  0  0  1  1  0  1  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0 -1  0  0  0  1 -1  0  0  0  0  1  0] (Indices: [0, 4, 7, 8, 13, 19]), Candidate: [1 1 1 1 0 1 2 0 0 1 0 1 2 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 8000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  1 -1  0  0  0  1 -1  0  0  0  1  0] (Indices: [0, 4, 7, 9, 14, 19]), Candidate: [ 1  1  1  1  0  1  2 -1  2  0  0  1  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  0  0  1  0 -1  0  0  1 -1  0  0  1] (Indices: [0, 4, 7, 11, 12, 16]), Candidate: [ 1  1  1  1  0  1  2 -1  1  1  1  1  0  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  0  0  0  0  1  0 -1  0  0  0  1  0] (Indices: [0, 4, 7, 13, 14, 19]), Candidate: [ 1  1  1  1  0  1  2 -1  1  1  0  1  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1  0 -1  0  1 -1  0  1 -1  0  0  0  1] (Indices: [0, 4, 8, 9, 12, 15]), Candidate: [1 1 1 1 0 1 1 1 1 0 0 2 0 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 8200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1 -1  1 -1  0  0  1 -1  0  0  1 -1  1] (Indices: [0, 4, 8, 10, 14, 18]), Candidate: [ 1  1  1  1  0  1  1  1  0  2 -1  1  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1 -1  0  0  1 -1  1 -1  0  0  0  1  0] (Indices: [0, 4, 8, 12, 14, 19]), Candidate: [ 1  1  1  1  0  1  1  1  0  1  0  2  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  1  0  0 -1  0  0  0  1 -1  0  0  1] (Indices: [0, 4, 9, 10, 11, 16]), Candidate: [1 1 1 1 0 1 1 0 2 1 0 0 1 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 8350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  1 -1  1 -1  0  0  1  0 -1  0  0  1] (Indices: [0, 4, 9, 11, 15, 16]), Candidate: [1 1 1 1 0 1 1 0 2 0 1 0 1 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 8400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  1 -1  0  0  0  1 -1  1  0 -1  0  1] (Indices: [0, 4, 9, 14, 16, 17]), Candidate: [ 1  1  1  1  0  1  1  0  2  0  0  1  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  0  1 -1  1 -1  1  0 -1  0  0  0  1] (Indices: [0, 4, 10, 12, 14, 15]), Candidate: [ 1  1  1  1  0  1  1  0  1  2 -1  2  0  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  0  0  1  0  0  0 -1  0  0  0  0  1] (Indices: [0, 4, 11, 12, 13, 14]), Candidate: [ 1  1  1  1  0  1  1  0  1  1  1  1  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  0  0  1 -1  0  0  1 -1  1 -1  1  0] (Indices: [0, 4, 11, 15, 17, 19]), Candidate: [1 1 1 1 0 1 1 0 1 1 1 0 1 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 8600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  0  0  0  0  1  0 -1  0  0  1  0  0] (Indices: [0, 4, 13, 14, 18, 19]), Candidate: [ 1  1  1  1  0  1  1  0  1  1  0  1  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  0  1 -1  0  0  1 -1  0  0  0  0  1] (Indices: [0, 5, 6, 7, 10, 14]), Candidate: [ 1  1  1  0  2  1  1 -1  1  2 -1  1  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 8700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1  0 -1  0  0  0  0  0  0  0  1 -1  1] (Indices: [0, 5, 6, 8, 9, 18]), Candidate: [1 1 1 0 2 1 0 1 1 0 0 1 1 1 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 8750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  1  0 -1  0  0  1 -1  0  0  0  0  1] (Indices: [0, 5, 6, 9, 10, 14]), Candidate: [ 1  1  1  0  2  1  0  0  2  1 -1  1  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  0  1 -1  1  0 -1  0  0  0  0  0  1] (Indices: [0, 5, 6, 10, 12, 13]), Candidate: [ 1  1  1  0  2  1  0  0  1  2 -1  2  1  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  0  0  1 -1  0  0  0  1  0 -1  0  1] (Indices: [0, 5, 6, 11, 16, 17]), Candidate: [1 1 1 0 2 1 0 0 1 1 1 0 1 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 8900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  0  0  0  0  0  1 -1  0  1 -1  1  0] (Indices: [0, 5, 6, 14, 17, 19]), Candidate: [ 1  1  1  0  2  1  0  0  1  1  0  1  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0 -1  0  0  0  1 -1  0  0  0  1 -1  1] (Indices: [0, 5, 7, 8, 13, 18]), Candidate: [1 1 1 0 2 0 2 0 0 1 0 1 2 0 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 9000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  1 -1  0  0  0  1 -1  0  0  1 -1  1] (Indices: [0, 5, 7, 9, 14, 18]), Candidate: [ 1  1  1  0  2  0  2 -1  2  0  0  1  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  0  0  1  0 -1  0  1 -1  0  0  0  1] (Indices: [0, 5, 7, 11, 12, 15]), Candidate: [ 1  1  1  0  2  0  2 -1  1  1  1  1  0  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  0  0  0  0  1  0 -1  0  0  1 -1  1] (Indices: [0, 5, 7, 13, 14, 18]), Candidate: [ 1  1  1  0  2  0  2 -1  1  1  0  1  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1  0 -1  0  1 -1  1 -1  0  0  0  0  1] (Indices: [0, 5, 8, 9, 12, 14]), Candidate: [ 1  1  1  0  2  0  1  1  1  0  0  2  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1 -1  1 -1  0  0  1 -1  0  1 -1  0  1] (Indices: [0, 5, 8, 10, 14, 17]), Candidate: [ 1  1  1  0  2  0  1  1  0  2 -1  1  1  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1 -1  0  0  1 -1  1 -1  0  0  1 -1  1] (Indices: [0, 5, 8, 12, 14, 18]), Candidate: [ 1  1  1  0  2  0  1  1  0  1  0  2  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  1  0  0 -1  0  0  1 -1  0  0  0  1] (Indices: [0, 5, 9, 10, 11, 15]), Candidate: [1 1 1 0 2 0 1 0 2 1 0 0 1 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 9350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  1 -1  1 -1  0  1 -1  0  0  0  1  0] (Indices: [0, 5, 9, 11, 14, 19]), Candidate: [ 1  1  1  0  2  0  1  0  2  0  1  0  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  1 -1  0  0  0  1  0 -1  0  0  1  0] (Indices: [0, 5, 9, 14, 15, 19]), Candidate: [1 1 1 0 2 0 1 0 2 0 0 1 1 2 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 9450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  0  1 -1  1  0 -1  0  0  0  0  1  0] (Indices: [0, 5, 10, 12, 13, 19]), Candidate: [ 1  1  1  0  2  0  1  0  1  2 -1  2  1  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  0  1 -1  0  0  0  0  0  1  0  0  0] (Indices: [0, 5, 10, 17, 18, 19]), Candidate: [ 1  1  1  0  2  0  1  0  1  2 -1  1  1  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  0  0  1 -1  0  0  1 -1  1  0 -1  1] (Indices: [0, 5, 11, 15, 17, 18]), Candidate: [1 1 1 0 2 0 1 0 1 1 1 0 1 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 9600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  0  0  0  0  1  0 -1  0  1 -1  1  0] (Indices: [0, 5, 13, 14, 17, 19]), Candidate: [ 1  1  1  0  2  0  1  0  1  1  0  1  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0 -1  0  1 -1  0  0  0  1 -1  0  0  1] (Indices: [0, 6, 7, 8, 11, 16]), Candidate: [1 1 1 0 1 2 1 0 0 1 1 0 1 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 9700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  1 -1  0  1 -1  1 -1  0  0  0  0  1] (Indices: [0, 6, 7, 9, 12, 14]), Candidate: [ 1  1  1  0  1  2  1 -1  2  0  0  2  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  0  1 -1  0  0  1 -1  0  1 -1  0  1] (Indices: [0, 6, 7, 10, 14, 17]), Candidate: [ 1  1  1  0  1  2  1 -1  1  2 -1  1  1  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 9800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  0  0  0  1 -1  1 -1  0  0  1 -1  1] (Indices: [0, 6, 7, 12, 14, 18]), Candidate: [ 1  1  1  0  1  2  1 -1  1  1  0  2  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1  0  0 -1  0  0  1 -1  0  0  0  0  1] (Indices: [0, 6, 8, 9, 10, 14]), Candidate: [ 1  1  1  0  1  2  0  1  1  1 -1  1  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1 -1  1 -1  1  0 -1  0  0  0  0  0  1] (Indices: [0, 6, 8, 10, 12, 13]), Candidate: [ 1  1  1  0  1  2  0  1  0  2 -1  2  1  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1 -1  0  1 -1  0  0  0  1  0 -1  0  1] (Indices: [0, 6, 8, 11, 16, 17]), Candidate: [1 1 1 0 1 2 0 1 0 1 1 0 1 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 10000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1 -1  0  0  0  0  1 -1  0  1 -1  1  0] (Indices: [0, 6, 8, 14, 17, 19]), Candidate: [ 1  1  1  0  1  2  0  1  0  1  0  1  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  1 -1  1  0 -1  0  1 -1  0  0  0  1] (Indices: [0, 6, 9, 11, 12, 15]), Candidate: [1 1 1 0 1 2 0 0 2 0 1 1 0 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 10100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  1 -1  0  0  1  0 -1  0  0  1 -1  1] (Indices: [0, 6, 9, 13, 14, 18]), Candidate: [ 1  1  1  0  1  2  0  0  2  0  0  1  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  0  1  0 -1  0  0  1  0 -1  0  0  1] (Indices: [0, 6, 10, 11, 15, 16]), Candidate: [1 1 1 0 1 2 0 0 1 2 0 0 1 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 10200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  0  1 -1  0  0  1 -1  1  0 -1  0  1] (Indices: [0, 6, 10, 14, 16, 17]), Candidate: [ 1  1  1  0  1  2  0  0  1  2 -1  1  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  0  0  1 -1  1 -1  0  0  1 -1  1  0] (Indices: [0, 6, 11, 13, 17, 19]), Candidate: [1 1 1 0 1 2 0 0 1 1 1 0 2 0 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 10300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  0  0  0  1 -1  0  1 -1  1  0 -1  1] (Indices: [0, 6, 12, 15, 17, 18]), Candidate: [1 1 1 0 1 2 0 0 1 1 0 2 0 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 10350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0  0  0 -1  0  0  0  0  0  0  0  1  0] (Indices: [0, 7, 8, 9, 10, 19]), Candidate: [ 1  1  1  0  1  1  2  0  1  1 -1  1  1  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0 -1  1 -1  1 -1  0  0  0  0  1 -1  1] (Indices: [0, 7, 8, 10, 12, 18]), Candidate: [ 1  1  1  0  1  1  2  0  0  2 -1  2  0  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0 -1  0  1 -1  0  0  0  0  0  1  0  0] (Indices: [0, 7, 8, 11, 18, 19]), Candidate: [1 1 1 0 1 1 2 0 0 1 1 0 1 1 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 10500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0 -1  0  0  0  0  0  1 -1  1  0 -1  1] (Indices: [0, 7, 8, 15, 17, 18]), Candidate: [1 1 1 0 1 1 2 0 0 1 0 1 1 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 10550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  1 -1  1 -1  1  0 -1  0  0  0  0  1] (Indices: [0, 7, 9, 11, 13, 14]), Candidate: [ 1  1  1  0  1  1  2 -1  2  0  1  0  2  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  1 -1  0  0  1 -1  1 -1  0  0  1  0] (Indices: [0, 7, 9, 13, 15, 19]), Candidate: [ 1  1  1  0  1  1  2 -1  2  0  0  1  2  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  0  1  0 -1  0  0  0  1 -1  1 -1  1] (Indices: [0, 7, 10, 11, 16, 18]), Candidate: [ 1  1  1  0  1  1  2 -1  1  2  0  0  1  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  0  1 -1  0  0  1 -1  0  0  1  0  0] (Indices: [0, 7, 10, 14, 18, 19]), Candidate: [ 1  1  1  0  1  1  2 -1  1  2 -1  1  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 10750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  0  0  1 -1  0  1  0 -1  0  0  1  0] (Indices: [0, 7, 11, 14, 15, 19]), Candidate: [ 1  1  1  0  1  1  2 -1  1  1  1  0  1  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  0  0  0  1 -1  0  0  1 -1  1  0  0] (Indices: [0, 7, 12, 16, 18, 19]), Candidate: [ 1  1  1  0  1  1  2 -1  1  1  0  2  0  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1  0  0 -1  1 -1  0  0  0  0  1 -1  1] (Indices: [0, 8, 9, 10, 12, 18]), Candidate: [ 1  1  1  0  1  1  1  1  1  1 -1  2  0  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1  0 -1  1 -1  0  0  0  0  0  1  0  0] (Indices: [0, 8, 9, 11, 18, 19]), Candidate: [1 1 1 0 1 1 1 1 1 0 1 0 1 1 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 10950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1  0 -1  0  0  0  0  1 -1  1  0 -1  1] (Indices: [0, 8, 9, 15, 17, 18]), Candidate: [1 1 1 0 1 1 1 1 1 0 0 1 1 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 11000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1 -1  1 -1  1 -1  0  0  1  0 -1  0  1] (Indices: [0, 8, 10, 12, 16, 17]), Candidate: [ 1  1  1  0  1  1  1  1  0  2 -1  2  0  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1 -1  0  1  0 -1  1 -1  0  0  1 -1  1] (Indices: [0, 8, 11, 12, 14, 18]), Candidate: [ 1  1  1  0  1  1  1  1  0  1  1  1  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1 -1  0  0  1  0  0 -1  0  0  1 -1  1] (Indices: [0, 8, 12, 13, 14, 18]), Candidate: [ 1  1  1  0  1  1  1  1  0  1  0  2  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1 -1  0  0  0  1 -1  0  1 -1  1  0  0] (Indices: [0, 8, 13, 16, 18, 19]), Candidate: [1 1 1 0 1 1 1 1 0 1 0 1 2 0 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 11200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  1  0 -1  1  0 -1  0  0  0  0  1  0] (Indices: [0, 9, 10, 12, 13, 19]), Candidate: [ 1  1  1  0  1  1  1  0  2  1 -1  2  1  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  1  0 -1  0  0  0  0  0  1  0  0  0] (Indices: [0, 9, 10, 17, 18, 19]), Candidate: [ 1  1  1  0  1  1  1  0  2  1 -1  1  1  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  1 -1  1 -1  0  0  1 -1  1  0 -1  1] (Indices: [0, 9, 11, 15, 17, 18]), Candidate: [1 1 1 0 1 1 1 0 2 0 1 0 1 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 11350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  1 -1  0  0  1  0 -1  0  1 -1  1  0] (Indices: [0, 9, 13, 14, 17, 19]), Candidate: [ 1  1  1  0  1  1  1  0  2  0  0  1  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  0  1  0 -1  1  0 -1  0  1 -1  0  1] (Indices: [0, 10, 11, 13, 14, 17]), Candidate: [ 1  1  1  0  1  1  1  0  1  2  0  0  2  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  0  1 -1  1 -1  1  0 -1  0  1 -1  1] (Indices: [0, 10, 12, 14, 15, 18]), Candidate: [ 1  1  1  0  1  1  1  0  1  2 -1  2  0  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  0  1 -1  0  0  0  1  0 -1  1  0  0] (Indices: [0, 10, 15, 16, 18, 19]), Candidate: [ 1  1  1  0  1  1  1  0  1  2 -1  1  1  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  0  0  1 -1  1 -1  1  0 -1  0  1  0] (Indices: [0, 11, 13, 15, 16, 19]), Candidate: [1 1 1 0 1 1 1 0 1 1 1 0 2 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 11600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  0  0  0  1 -1  1 -1  1  0 -1  1  0] (Indices: [0, 12, 14, 16, 17, 19]), Candidate: [ 1  1  1  0  1  1  1  0  1  1  0  2  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  0  0  0  0  0  1 -1  0  0  0  0  0] (Indices: [1, 2, 3, 4, 6, 14]), Candidate: [ 3  1  1  0  0  2  0  0  1  1  0  1  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  0  0  1 -1  0  1 -1  0  0  0  0  0] (Indices: [1, 2, 3, 4, 11, 14]), Candidate: [ 3  1  1  0  0  1  1  0  1  1  1  0  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  0  0  1 -1  0  0  0  0  0  0  0  0] (Indices: [1, 2, 3, 5, 7, 11]), Candidate: [ 3  1  1 -1  2  0  2 -1  1  1  1  0  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 11800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  0  0  0  1 -1  0  0  1 -1  0  0  0] (Indices: [1, 2, 3, 5, 12, 16]), Candidate: [ 3  1  1 -1  2  0  1  0  1  1  0  2  0  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  1 -1  0  1 -1  0  0  0  0  0  0  0] (Indices: [1, 2, 3, 6, 9, 12]), Candidate: [ 3  1  1 -1  1  2  0  0  2  0  0  2  0  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  0  0  0  0  0  0  0  0  1  0 -1  0] (Indices: [1, 2, 3, 6, 17, 18]), Candidate: [ 3  1  1 -1  1  2  0  0  1  1  0  1  1  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  0  0  0  0  1 -1  0  1 -1  0  0  0] (Indices: [1, 2, 3, 7, 13, 16]), Candidate: [ 3  1  1 -1  1  1  2 -1  1  1  0  1  2  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 12000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1 -1  0  0  1 -1  0  0  0  1 -1  0  0] (Indices: [1, 2, 3, 8, 12, 17]), Candidate: [ 3  1  1 -1  1  1  1  1  0  1  0  2  0  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  1 -1  0  0  1 -1  0  1 -1  0  0  0] (Indices: [1, 2, 3, 9, 13, 16]), Candidate: [ 3  1  1 -1  1  1  1  0  2  0  0  1  2  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  0  1 -1  0  0  0  0  1 -1  1 -1  0] (Indices: [1, 2, 3, 10, 16, 18]), Candidate: [ 3  1  1 -1  1  1  1  0  1  2 -1  1  1  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 12150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  0  0  0  1 -1  0  0  1 -1  0  1 -1] (Indices: [1, 2, 3, 12, 16, 19]), Candidate: [ 3  1  1 -1  1  1  1  0  1  1  0  2  0  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  0  0  0  0  0  0  0  0  0  1 -1  0] (Indices: [1, 2, 4, 5, 6, 18]), Candidate: [3 1 0 1 1 1 0 0 1 1 0 1 1 1 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 12250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  0  0  1 -1  0  0  0  0  0  1 -1  0] (Indices: [1, 2, 4, 5, 11, 18]), Candidate: [3 1 0 1 1 0 1 0 1 1 1 0 1 1 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 12300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1 -1  0  0  0  0  0  0  0  1 -1  0  0] (Indices: [1, 2, 4, 6, 8, 17]), Candidate: [3 1 0 1 0 2 0 1 0 1 0 1 1 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 12350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  0  0  0  0  0  0  1 -1  0  1 -1  0] (Indices: [1, 2, 4, 6, 15, 18]), Candidate: [3 1 0 1 0 2 0 0 1 1 0 1 1 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 12400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  0  0  0  1 -1  0  0  0  1 -1  0  0] (Indices: [1, 2, 4, 7, 12, 17]), Candidate: [ 3  1  0  1  0  1  2 -1  1  1  0  2  0  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1 -1  0  1 -1  0  0  0  0  0  0  1 -1] (Indices: [1, 2, 4, 8, 11, 19]), Candidate: [3 1 0 1 0 1 1 1 0 1 1 0 1 1 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 12500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  1 -1  0  1 -1  0  0  0  1 -1  0  0] (Indices: [1, 2, 4, 9, 12, 17]), Candidate: [3 1 0 1 0 1 1 0 2 0 0 2 0 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 12550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  0  1 -1  0  0  0  1  0 -1  0  0  0] (Indices: [1, 2, 4, 10, 15, 16]), Candidate: [ 3  1  0  1  0  1  1  0  1  2 -1  1  1  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  0  0  0  1 -1  0  1 -1  1 -1  0  0] (Indices: [1, 2, 4, 12, 15, 17]), Candidate: [3 1 0 1 0 1 1 0 1 1 0 2 0 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 12650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  0  0  0  0  0  1 -1  0  0  0  0  0] (Indices: [1, 2, 5, 6, 7, 14]), Candidate: [ 3  1  0  0  2  1  1 -1  1  1  0  1  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 12700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  0  0  0  1 -1  0  0  0  0  0  1 -1] (Indices: [1, 2, 5, 6, 12, 19]), Candidate: [3 1 0 0 2 1 0 0 1 1 0 2 0 1 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 12750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  0  1 -1  0  0  0  0  0  0  1 -1  0] (Indices: [1, 2, 5, 7, 10, 18]), Candidate: [ 3  1  0  0  2  0  2 -1  1  2 -1  1  1  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 12800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1 -1  1 -1  0  1 -1  0  0  0  0  0  0] (Indices: [1, 2, 5, 8, 10, 13]), Candidate: [ 3  1  0  0  2  0  1  1  0  2 -1  1  2  0  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  1  0 -1  0  0  0  0  0  0  1 -1  0] (Indices: [1, 2, 5, 9, 10, 18]), Candidate: [ 3  1  0  0  2  0  1  0  2  1 -1  1  1  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  0  1 -1  1 -1  0  0  0  1 -1  0  0] (Indices: [1, 2, 5, 10, 12, 17]), Candidate: [ 3  1  0  0  2  0  1  0  1  2 -1  2  0  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  0  0  1 -1  0  0  0  0  1 -1  1 -1] (Indices: [1, 2, 5, 11, 17, 19]), Candidate: [3 1 0 0 2 0 1 0 1 1 1 0 1 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 13000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  0  0  0  0  0  0  1  0 -1  0  1 -1] (Indices: [1, 2, 5, 15, 16, 19]), Candidate: [3 1 0 0 2 0 1 0 1 1 0 1 1 1 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 13050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  0  0  0  1 -1  0  0  0  1 -1  0  0] (Indices: [1, 2, 6, 7, 12, 17]), Candidate: [ 3  1  0  0  1  2  1 -1  1  1  0  2  0  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1 -1  0  1 -1  0  0  0  0  0  0  1 -1] (Indices: [1, 2, 6, 8, 11, 19]), Candidate: [3 1 0 0 1 2 0 1 0 1 1 0 1 1 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 13150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  1 -1  0  1 -1  0  0  0  1 -1  0  0] (Indices: [1, 2, 6, 9, 12, 17]), Candidate: [3 1 0 0 1 2 0 0 2 0 0 2 0 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 13200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  0  1 -1  0  0  0  1  0 -1  0  0  0] (Indices: [1, 2, 6, 10, 15, 16]), Candidate: [ 3  1  0  0  1  2  0  0  1  2 -1  1  1  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  0  0  0  1 -1  0  1 -1  1 -1  0  0] (Indices: [1, 2, 6, 12, 15, 17]), Candidate: [3 1 0 0 1 2 0 0 1 1 0 2 0 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 13300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0  0 -1  0  0  0  0  0  1 -1  0  0  0] (Indices: [1, 2, 7, 8, 9, 16]), Candidate: [3 1 0 0 1 1 2 0 1 0 0 1 1 1 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 13350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  1  0 -1  1 -1  0  0  0  0  0  0  0] (Indices: [1, 2, 7, 9, 10, 12]), Candidate: [ 3  1  0  0  1  1  2 -1  2  1 -1  2  0  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 13400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  0  1  0 -1  0  0  0  0  0  1 -1  0] (Indices: [1, 2, 7, 10, 11, 18]), Candidate: [ 3  1  0  0  1  1  2 -1  1  2  0  0  1  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  0  0  1 -1  0  0  1 -1  0  1 -1  0] (Indices: [1, 2, 7, 11, 15, 18]), Candidate: [ 3  1  0  0  1  1  2 -1  1  1  1  0  1  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  0  0  0  0  0  1 -1  1 -1  0  1 -1] (Indices: [1, 2, 7, 14, 16, 19]), Candidate: [ 3  1  0  0  1  1  2 -1  1  1  0  1  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 13550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1  0 -1  0  0  0  0  1 -1  1 -1  0  0] (Indices: [1, 2, 8, 9, 15, 17]), Candidate: [3 1 0 0 1 1 1 1 1 0 0 1 1 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 13600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1 -1  0  1  0 -1  0  0  0  0  1 -1  0] (Indices: [1, 2, 8, 11, 12, 18]), Candidate: [3 1 0 0 1 1 1 1 0 1 1 1 0 1 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 13650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1 -1  0  0  0  1 -1  1 -1  1 -1  0  0] (Indices: [1, 2, 8, 13, 15, 17]), Candidate: [3 1 0 0 1 1 1 1 0 1 0 1 2 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 13700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  1  0 -1  0  0  1  0 -1  0  0  0  0] (Indices: [1, 2, 9, 10, 14, 15]), Candidate: [ 3  1  0  0  1  1  1  0  2  1 -1  1  1  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  1 -1  0  1 -1  1 -1  1 -1  0  0  0] (Indices: [1, 2, 9, 12, 14, 16]), Candidate: [ 3  1  0  0  1  1  1  0  2  0  0  2  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  0  1  0  0 -1  1 -1  0  0  0  0  0] (Indices: [1, 2, 10, 11, 12, 14]), Candidate: [ 3  1  0  0  1  1  1  0  1  2  0  1  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  0  1 -1  0  1  0 -1  0  1 -1  0  0] (Indices: [1, 2, 10, 13, 14, 17]), Candidate: [ 3  1  0  0  1  1  1  0  1  2 -1  1  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 13900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  0  0  1  0 -1  0  0  1 -1  0  1 -1] (Indices: [1, 2, 11, 12, 16, 19]), Candidate: [3 1 0 0 1 1 1 0 1 1 1 1 0 1 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 13950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  0  0  0  1  0 -1  0  1 -1  0  1 -1] (Indices: [1, 2, 12, 13, 16, 19]), Candidate: [3 1 0 0 1 1 1 0 1 1 0 2 1 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 14000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  0  0  0  0  0  1 -1  1  0  0 -1  0] (Indices: [1, 2, 14, 16, 17, 18]), Candidate: [ 3  1  0  0  1  1  1  0  1  1  0  1  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  1 -1  0  0  0  0  1 -1  0  0  0  0] (Indices: [1, 3, 4, 5, 9, 15]), Candidate: [3 0 2 0 1 0 1 0 2 0 0 1 1 1 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 14100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0 -1  0  0  0  0  0  0  0  0  0  0  0] (Indices: [1, 3, 4, 6, 7, 8]), Candidate: [3 0 2 0 0 2 1 0 0 1 0 1 1 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 14150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  0  0  0  1  0 -1  0  0  0  0  0  0] (Indices: [1, 3, 4, 6, 12, 13]), Candidate: [3 0 2 0 0 2 0 0 1 1 0 2 1 0 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 14200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  0  1 -1  1 -1  0  0  0  0  0  0  0] (Indices: [1, 3, 4, 7, 10, 12]), Candidate: [ 3  0  2  0  0  1  2 -1  1  2 -1  2  0  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 14250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1  0 -1  0  0  0  0  0  1 -1  0  0  0] (Indices: [1, 3, 4, 8, 9, 16]), Candidate: [3 0 2 0 0 1 1 1 1 0 0 1 1 1 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 14300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  1  0 -1  1 -1  0  0  0  0  0  0  0] (Indices: [1, 3, 4, 9, 10, 12]), Candidate: [ 3  0  2  0  0  1  1  0  2  1 -1  2  0  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  0  1  0 -1  0  0  0  0  0  1 -1  0] (Indices: [1, 3, 4, 10, 11, 18]), Candidate: [3 0 2 0 0 1 1 0 1 2 0 0 1 1 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 14400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  0  0  1 -1  0  0  1 -1  0  1 -1  0] (Indices: [1, 3, 4, 11, 15, 18]), Candidate: [3 0 2 0 0 1 1 0 1 1 1 0 1 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 14450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  0  0  0  0  0  1 -1  1 -1  0  1 -1] (Indices: [1, 3, 4, 14, 16, 19]), Candidate: [ 3  0  2  0  0  1  1  0  1  1  0  1  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  0  1 -1  0  0  1 -1  0  0  0  0  0] (Indices: [1, 3, 5, 6, 10, 14]), Candidate: [ 3  0  2 -1  2  1  0  0  1  2 -1  1  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 14550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0 -1  0  0  0  0  0  0  0  1 -1  0  0] (Indices: [1, 3, 5, 7, 8, 17]), Candidate: [ 3  0  2 -1  2  0  2  0  0  1  0  1  1  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  0  0  0  0  0  0  1 -1  0  1 -1  0] (Indices: [1, 3, 5, 7, 15, 18]), Candidate: [ 3  0  2 -1  2  0  2 -1  1  1  0  1  1  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 14650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1 -1  0  0  0  0  1 -1  0  1 -1  0  0] (Indices: [1, 3, 5, 8, 14, 17]), Candidate: [ 3  0  2 -1  2  0  1  1  0  1  0  1  1  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 14700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  1 -1  0  0  0  0  1 -1  0  1 -1  0] (Indices: [1, 3, 5, 9, 15, 18]), Candidate: [ 3  0  2 -1  2  0  1  0  2  0  0  1  1  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  0  0  1  0 -1  0  0  0  0  0  1 -1] (Indices: [1, 3, 5, 11, 12, 19]), Candidate: [ 3  0  2 -1  2  0  1  0  1  1  1  1  0  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  0  0  0  0  1 -1  1 -1  0  1 -1  0] (Indices: [1, 3, 5, 13, 15, 18]), Candidate: [ 3  0  2 -1  2  0  1  0  1  1  0  1  2  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  0  1 -1  1 -1  0  0  0  0  0  0  0] (Indices: [1, 3, 6, 7, 10, 12]), Candidate: [ 3  0  2 -1  1  2  1 -1  1  2 -1  2  0  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 14900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1  0 -1  0  0  0  0  0  1 -1  0  0  0] (Indices: [1, 3, 6, 8, 9, 16]), Candidate: [ 3  0  2 -1  1  2  0  1  1  0  0  1  1  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  1  0 -1  1 -1  0  0  0  0  0  0  0] (Indices: [1, 3, 6, 9, 10, 12]), Candidate: [ 3  0  2 -1  1  2  0  0  2  1 -1  2  0  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  0  1  0 -1  0  0  0  0  0  1 -1  0] (Indices: [1, 3, 6, 10, 11, 18]), Candidate: [ 3  0  2 -1  1  2  0  0  1  2  0  0  1  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  0  0  1 -1  0  0  1 -1  0  1 -1  0] (Indices: [1, 3, 6, 11, 15, 18]), Candidate: [ 3  0  2 -1  1  2  0  0  1  1  1  0  1  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  0  0  0  0  0  1 -1  1 -1  0  1 -1] (Indices: [1, 3, 6, 14, 16, 19]), Candidate: [ 3  0  2 -1  1  2  0  0  1  1  0  1  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0 -1  0  0  0  1 -1  0  1 -1  0  0  0] (Indices: [1, 3, 7, 8, 13, 16]), Candidate: [ 3  0  2 -1  1  1  2  0  0  1  0  1  2  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  1 -1  0  0  0  1 -1  1 -1  0  0  0] (Indices: [1, 3, 7, 9, 14, 16]), Candidate: [ 3  0  2 -1  1  1  2 -1  2  0  0  1  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 15250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  0  0  1  0  0 -1  0  0  0  0  0  0] (Indices: [1, 3, 7, 11, 12, 13]), Candidate: [ 3  0  2 -1  1  1  2 -1  1  1  1  1  1  0  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  0  0  0  0  1  0 -1  1 -1  0  0  0] (Indices: [1, 3, 7, 13, 14, 16]), Candidate: [ 3  0  2 -1  1  1  2 -1  1  1  0  1  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 15350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1  0 -1  1 -1  0  0  0  0  0  0  1 -1] (Indices: [1, 3, 8, 9, 11, 19]), Candidate: [ 3  0  2 -1  1  1  1  1  1  0  1  0  1  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1 -1  1 -1  0  0  1  0 -1  0  0  0  0] (Indices: [1, 3, 8, 10, 14, 15]), Candidate: [ 3  0  2 -1  1  1  1  1  0  2 -1  1  1  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1 -1  0  0  1 -1  1 -1  1 -1  0  0  0] (Indices: [1, 3, 8, 12, 14, 16]), Candidate: [ 3  0  2 -1  1  1  1  1  0  1  0  2  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  1  0  0 -1  1 -1  0  0  0  0  0  0] (Indices: [1, 3, 9, 10, 11, 13]), Candidate: [ 3  0  2 -1  1  1  1  0  2  1  0  0  2  0  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  1 -1  1 -1  0  1 -1  0  1 -1  0  0] (Indices: [1, 3, 9, 11, 14, 17]), Candidate: [ 3  0  2 -1  1  1  1  0  2  0  1  0  1  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  1 -1  0  0  0  1  0 -1  1 -1  0  0] (Indices: [1, 3, 9, 14, 15, 17]), Candidate: [ 3  0  2 -1  1  1  1  0  2  0  0  1  1  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  0  1 -1  1  0 -1  0  0  1 -1  0  0] (Indices: [1, 3, 10, 12, 13, 17]), Candidate: [ 3  0  2 -1  1  1  1  0  1  2 -1  2  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  0  1 -1  0  0  0  0  1  0 -1  1 -1] (Indices: [1, 3, 10, 16, 17, 19]), Candidate: [ 3  0  2 -1  1  1  1  0  1  2 -1  1  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  0  0  1 -1  0  0  1  0 -1  1 -1  0] (Indices: [1, 3, 11, 15, 16, 18]), Candidate: [ 3  0  2 -1  1  1  1  0  1  1  1  0  1  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  0  0  0  0  1  0 -1  1 -1  0  1 -1] (Indices: [1, 3, 13, 14, 16, 19]), Candidate: [ 3  0  2 -1  1  1  1  0  1  1  0  1  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1 -1  0  0  0  0  0  0  0  0  1 -1  0] (Indices: [1, 4, 5, 6, 8, 18]), Candidate: [3 0 1 1 1 1 0 1 0 1 0 1 1 1 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 15900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  0  0  0  0  0  0  1 -1  0  0  1 -1] (Indices: [1, 4, 5, 6, 15, 19]), Candidate: [3 0 1 1 1 1 0 0 1 1 0 1 1 1 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 15950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  0  0  0  1 -1  0  0  0  0  1 -1  0] (Indices: [1, 4, 5, 7, 12, 18]), Candidate: [ 3  0  1  1  1  0  2 -1  1  1  0  2  0  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1 -1  0  0  1  0 -1  0  0  0  0  0  0] (Indices: [1, 4, 5, 8, 12, 13]), Candidate: [3 0 1 1 1 0 1 1 0 1 0 2 1 0 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 16050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  1 -1  0  1 -1  0  0  0  0  1 -1  0] (Indices: [1, 4, 5, 9, 12, 18]), Candidate: [3 0 1 1 1 0 1 0 2 0 0 2 0 1 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 16100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  0  1 -1  0  0  0  1 -1  1 -1  0  0] (Indices: [1, 4, 5, 10, 15, 17]), Candidate: [ 3  0  1  1  1  0  1  0  1  2 -1  1  1  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  0  0  0  1 -1  0  1 -1  0  1 -1  0] (Indices: [1, 4, 5, 12, 15, 18]), Candidate: [3 0 1 1 1 0 1 0 1 1 0 2 0 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 16200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0 -1  0  0  0  0  0  0  1 -1  0  0  0] (Indices: [1, 4, 6, 7, 8, 16]), Candidate: [3 0 1 1 0 2 1 0 0 1 0 1 1 1 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 16250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  0  0  0  0  0  0  1 -1  1 -1  0  0] (Indices: [1, 4, 6, 7, 15, 17]), Candidate: [ 3  0  1  1  0  2  1 -1  1  1  0  1  1  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1 -1  0  0  0  0  1 -1  1 -1  0  0  0] (Indices: [1, 4, 6, 8, 14, 16]), Candidate: [ 3  0  1  1  0  2  0  1  0  1  0  1  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  1 -1  0  0  0  0  1 -1  1 -1  0  0] (Indices: [1, 4, 6, 9, 15, 17]), Candidate: [3 0 1 1 0 2 0 0 2 0 0 1 1 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 16400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  0  0  1  0 -1  0  0  0  0  1 -1  0] (Indices: [1, 4, 6, 11, 12, 18]), Candidate: [3 0 1 1 0 2 0 0 1 1 1 1 0 1 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 16450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  0  0  0  0  1 -1  1 -1  1 -1  0  0] (Indices: [1, 4, 6, 13, 15, 17]), Candidate: [3 0 1 1 0 2 0 0 1 1 0 1 2 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 16500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0 -1  0  1 -1  0  1 -1  0  0  0  0  0] (Indices: [1, 4, 7, 8, 11, 14]), Candidate: [ 3  0  1  1  0  1  2  0  0  1  1  0  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  1 -1  1 -1  0  0  0  0  0  0  1 -1] (Indices: [1, 4, 7, 9, 11, 19]), Candidate: [ 3  0  1  1  0  1  2 -1  2  0  1  0  1  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  0  1 -1  0  0  1  0 -1  0  0  0  0] (Indices: [1, 4, 7, 10, 14, 15]), Candidate: [ 3  0  1  1  0  1  2 -1  1  2 -1  1  1  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  0  0  0  1 -1  1 -1  1 -1  0  0  0] (Indices: [1, 4, 7, 12, 14, 16]), Candidate: [ 3  0  1  1  0  1  2 -1  1  1  0  2  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1  0  0 -1  1 -1  0  0  0  0  0  0  0] (Indices: [1, 4, 8, 9, 10, 12]), Candidate: [ 3  0  1  1  0  1  1  1  1  1 -1  2  0  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1 -1  1  0 -1  0  0  0  0  0  1 -1  0] (Indices: [1, 4, 8, 10, 11, 18]), Candidate: [3 0 1 1 0 1 1 1 0 2 0 0 1 1 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 16800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1 -1  0  1 -1  0  0  1 -1  0  1 -1  0] (Indices: [1, 4, 8, 11, 15, 18]), Candidate: [3 0 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 16850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1 -1  0  0  0  0  1 -1  1 -1  0  1 -1] (Indices: [1, 4, 8, 14, 16, 19]), Candidate: [ 3  0  1  1  0  1  1  1  0  1  0  1  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  1 -1  1  0  0 -1  0  0  0  0  0  0] (Indices: [1, 4, 9, 11, 12, 13]), Candidate: [3 0 1 1 0 1 1 0 2 0 1 1 1 0 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 16950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  1 -1  0  0  1  0 -1  1 -1  0  0  0] (Indices: [1, 4, 9, 13, 14, 16]), Candidate: [ 3  0  1  1  0  1  1  0  2  0  0  1  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  0  1  0 -1  0  1 -1  0  0  1 -1  0] (Indices: [1, 4, 10, 11, 14, 18]), Candidate: [ 3  0  1  1  0  1  1  0  1  2  0  0  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  0  1 -1  0  0  1  0 -1  0  1 -1  0] (Indices: [1, 4, 10, 14, 15, 18]), Candidate: [ 3  0  1  1  0  1  1  0  1  2 -1  1  1  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  0  0  1 -1  1 -1  0  1 -1  0  1 -1] (Indices: [1, 4, 11, 13, 16, 19]), Candidate: [3 0 1 1 0 1 1 0 1 1 1 0 2 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 17150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  0  0  0  1 -1  0  1  0 -1  1 -1  0] (Indices: [1, 4, 12, 15, 16, 18]), Candidate: [3 0 1 1 0 1 1 0 1 1 0 2 0 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 17200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0 -1  0  0  0  0  0  1 -1  0  0  0  0] (Indices: [1, 5, 6, 7, 8, 15]), Candidate: [3 0 1 0 2 1 1 0 0 1 0 1 1 1 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 17250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  0  0  0  0  0  0  1  0 -1  0  0  0] (Indices: [1, 5, 6, 7, 15, 16]), Candidate: [ 3  0  1  0  2  1  1 -1  1  1  0  1  1  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1 -1  0  0  0  0  1  0 -1  0  0  0  0] (Indices: [1, 5, 6, 8, 14, 15]), Candidate: [3 0 1 0 2 1 0 1 0 1 0 1 1 2 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 17350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  1 -1  0  0  0  0  1  0 -1  0  0  0] (Indices: [1, 5, 6, 9, 15, 16]), Candidate: [3 0 1 0 2 1 0 0 2 0 0 1 1 1 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 17400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  0  0  1  0 -1  0  0  0  1 -1  0  0] (Indices: [1, 5, 6, 11, 12, 17]), Candidate: [3 0 1 0 2 1 0 0 1 1 1 1 0 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 17450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  0  0  0  0  1 -1  1  0 -1  0  0  0] (Indices: [1, 5, 6, 13, 15, 16]), Candidate: [3 0 1 0 2 1 0 0 1 1 0 1 2 0 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 17500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0 -1  0  1 -1  1 -1  0  0  0  0  0  0] (Indices: [1, 5, 7, 8, 11, 13]), Candidate: [3 0 1 0 2 0 2 0 0 1 1 0 2 0 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 17550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  1 -1  1 -1  0  0  0  0  0  1 -1  0] (Indices: [1, 5, 7, 9, 11, 18]), Candidate: [ 3  0  1  0  2  0  2 -1  2  0  1  0  1  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  0  1 -1  0  1 -1  0  0  0  0  1 -1] (Indices: [1, 5, 7, 10, 13, 19]), Candidate: [ 3  0  1  0  2  0  2 -1  1  2 -1  1  2  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 17650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  0  0  0  1 -1  1  0 -1  0  0  0  0] (Indices: [1, 5, 7, 12, 14, 15]), Candidate: [ 3  0  1  0  2  0  2 -1  1  1  0  2  0  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1  0  0  0 -1  0  0  0  0  0  0  0  0] (Indices: [1, 5, 8, 9, 10, 11]), Candidate: [3 0 1 0 2 0 1 1 1 1 0 0 1 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 17750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1 -1  1  0 -1  0  0  0  0  1 -1  0  0] (Indices: [1, 5, 8, 10, 11, 17]), Candidate: [3 0 1 0 2 0 1 1 0 2 0 0 1 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 17800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1 -1  0  1 -1  0  0  1 -1  1 -1  0  0] (Indices: [1, 5, 8, 11, 15, 17]), Candidate: [3 0 1 0 2 0 1 1 0 1 1 0 1 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 17850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1 -1  0  0  0  0  1 -1  1 -1  1 -1  0] (Indices: [1, 5, 8, 14, 16, 18]), Candidate: [ 3  0  1  0  2  0  1  1  0  1  0  1  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  1  0 -1  0  0  0  0  0  0  1  0 -1] (Indices: [1, 5, 9, 10, 18, 19]), Candidate: [ 3  0  1  0  2  0  1  0  2  1 -1  1  1  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  1 -1  0  0  1  0  0 -1  0  0  0  0] (Indices: [1, 5, 9, 13, 14, 15]), Candidate: [3 0 1 0 2 0 1 0 2 0 0 1 2 1 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 18000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  0  1  0 -1  0  1 -1  0  1 -1  0  0] (Indices: [1, 5, 10, 11, 14, 17]), Candidate: [ 3  0  1  0  2  0  1  0  1  2  0  0  1  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  0  1 -1  0  0  1  0 -1  1 -1  0  0] (Indices: [1, 5, 10, 14, 15, 17]), Candidate: [ 3  0  1  0  2  0  1  0  1  2 -1  1  1  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  0  0  1 -1  1 -1  0  1 -1  1 -1  0] (Indices: [1, 5, 11, 13, 16, 18]), Candidate: [3 0 1 0 2 0 1 0 1 1 1 0 2 0 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 18150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  0  0  0  1 -1  0  1  0  0 -1  0  0] (Indices: [1, 5, 12, 15, 16, 17]), Candidate: [3 0 1 0 2 0 1 0 1 1 0 2 0 1 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 18200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0  0 -1  0  0  0  0  1 -1  0  0  0  0] (Indices: [1, 6, 7, 8, 9, 15]), Candidate: [3 0 1 0 1 2 1 0 1 0 0 1 1 1 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 18250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  1  0  0 -1  0  0  0  0  0  0  0  0] (Indices: [1, 6, 7, 9, 10, 11]), Candidate: [ 3  0  1  0  1  2  1 -1  2  1  0  0  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  0  1  0 -1  0  0  0  0  1 -1  0  0] (Indices: [1, 6, 7, 10, 11, 17]), Candidate: [ 3  0  1  0  1  2  1 -1  1  2  0  0  1  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  0  0  1 -1  0  0  1 -1  1 -1  0  0] (Indices: [1, 6, 7, 11, 15, 17]), Candidate: [ 3  0  1  0  1  2  1 -1  1  1  1  0  1  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  0  0  0  0  0  1 -1  1 -1  1 -1  0] (Indices: [1, 6, 7, 14, 16, 18]), Candidate: [ 3  0  1  0  1  2  1 -1  1  1  0  1  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1  0 -1  0  0  0  0  1  0 -1  0  0  0] (Indices: [1, 6, 8, 9, 15, 16]), Candidate: [3 0 1 0 1 2 0 1 1 0 0 1 1 1 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 18500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1 -1  0  1  0 -1  0  0  0  1 -1  0  0] (Indices: [1, 6, 8, 11, 12, 17]), Candidate: [3 0 1 0 1 2 0 1 0 1 1 1 0 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 18550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1 -1  0  0  0  1 -1  1  0 -1  0  0  0] (Indices: [1, 6, 8, 13, 15, 16]), Candidate: [3 0 1 0 1 2 0 1 0 1 0 1 2 0 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 18600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  1  0 -1  0  1 -1  0  0  0  0  1 -1] (Indices: [1, 6, 9, 10, 13, 19]), Candidate: [ 3  0  1  0  1  2  0  0  2  1 -1  1  2  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  1 -1  0  1 -1  1  0 -1  0  0  0  0] (Indices: [1, 6, 9, 12, 14, 15]), Candidate: [3 0 1 0 1 2 0 0 2 0 0 2 0 2 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 18700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  0  1  0  0  0 -1  0  0  0  0  0  0] (Indices: [1, 6, 10, 11, 12, 13]), Candidate: [3 0 1 0 1 2 0 0 1 2 0 1 1 0 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 18750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  0  1 -1  0  1  0 -1  1 -1  0  0  0] (Indices: [1, 6, 10, 13, 14, 16]), Candidate: [ 3  0  1  0  1  2  0  0  1  2 -1  1  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  0  0  1  0 -1  0  0  1 -1  1 -1  0] (Indices: [1, 6, 11, 12, 16, 18]), Candidate: [3 0 1 0 1 2 0 0 1 1 1 1 0 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 18850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  0  0  0  1  0 -1  0  1 -1  1 -1  0] (Indices: [1, 6, 12, 13, 16, 18]), Candidate: [3 0 1 0 1 2 0 0 1 1 0 2 1 0 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 18900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  0  0  0  0  0  1  0 -1  0  1  0 -1] (Indices: [1, 6, 14, 15, 18, 19]), Candidate: [3 0 1 0 1 2 0 0 1 1 0 1 1 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 18950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0  0 -1  0  0  0  0  0  1 -1  1 -1  0] (Indices: [1, 7, 8, 9, 16, 18]), Candidate: [3 0 1 0 1 1 2 0 1 0 0 1 1 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 19000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0 -1  0  1 -1  1 -1  0  1 -1  0  0  0] (Indices: [1, 7, 8, 11, 13, 16]), Candidate: [3 0 1 0 1 1 2 0 0 1 1 0 2 0 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 19050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0 -1  0  0  0  1 -1  0  1 -1  1 -1  0] (Indices: [1, 7, 8, 13, 16, 18]), Candidate: [3 0 1 0 1 1 2 0 0 1 0 1 2 0 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 19100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  1  0 -1  0  0  1 -1  0  0  0  1 -1] (Indices: [1, 7, 9, 10, 14, 19]), Candidate: [ 3  0  1  0  1  1  2 -1  2  1 -1  1  1  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 19150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  1 -1  0  1 -1  0  1  0 -1  0  0  0] (Indices: [1, 7, 9, 12, 15, 16]), Candidate: [ 3  0  1  0  1  1  2 -1  2  0  0  2  0  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  0  1  0  0 -1  0  0  0  0  1 -1  0] (Indices: [1, 7, 10, 11, 12, 18]), Candidate: [ 3  0  1  0  1  1  2 -1  1  2  0  1  0  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  0  1 -1  0  1 -1  1 -1  1 -1  0  0] (Indices: [1, 7, 10, 13, 15, 17]), Candidate: [ 3  0  1  0  1  1  2 -1  1  2 -1  1  2  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 19300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  0  0  1 -1  1  0  0 -1  0  0  0  0] (Indices: [1, 7, 11, 13, 14, 15]), Candidate: [ 3  0  1  0  1  1  2 -1  1  1  1  0  2  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  0  0  0  1 -1  1  0  0 -1  0  0  0] (Indices: [1, 7, 12, 14, 15, 16]), Candidate: [ 3  0  1  0  1  1  2 -1  1  1  0  2  0  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  0  0  0  0  0  0  1  0  0  0 -1  0] (Indices: [1, 7, 15, 16, 17, 18]), Candidate: [ 3  0  1  0  1  1  2 -1  1  1  0  1  1  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1  0 -1  1 -1  1 -1  0  1 -1  0  0  0] (Indices: [1, 8, 9, 11, 13, 16]), Candidate: [3 0 1 0 1 1 1 1 1 0 1 0 2 0 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 19500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1  0 -1  0  0  1 -1  0  1 -1  1 -1  0] (Indices: [1, 8, 9, 13, 16, 18]), Candidate: [3 0 1 0 1 1 1 1 1 0 0 1 2 0 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 19550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1 -1  1  0 -1  0  0  0  0  1  0 -1  0] (Indices: [1, 8, 10, 11, 17, 18]), Candidate: [3 0 1 0 1 1 1 1 0 2 0 0 1 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 19600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1 -1  1 -1  0  0  0  1  0 -1  1 -1  0] (Indices: [1, 8, 10, 15, 16, 18]), Candidate: [ 3  0  1  0  1  1  1  1  0  2 -1  1  1  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1 -1  0  1 -1  0  1 -1  1 -1  1 -1  0] (Indices: [1, 8, 11, 14, 16, 18]), Candidate: [ 3  0  1  0  1  1  1  1  0  1  1  0  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1 -1  0  0  0  1  0  0  0 -1  0  0  0] (Indices: [1, 8, 13, 14, 15, 16]), Candidate: [3 0 1 0 1 1 1 1 0 1 0 1 2 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 19750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  1  0  0 -1  0  1 -1  0  1 -1  0  0] (Indices: [1, 9, 10, 11, 14, 17]), Candidate: [ 3  0  1  0  1  1  1  0  2  1  0  0  1  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  1  0 -1  0  0  1  0 -1  1 -1  0  0] (Indices: [1, 9, 10, 14, 15, 17]), Candidate: [ 3  0  1  0  1  1  1  0  2  1 -1  1  1  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  1 -1  1 -1  1 -1  0  1 -1  1 -1  0] (Indices: [1, 9, 11, 13, 16, 18]), Candidate: [3 0 1 0 1 1 1 0 2 0 1 0 2 0 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 19900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  1 -1  0  1 -1  0  1  0  0 -1  0  0] (Indices: [1, 9, 12, 15, 16, 17]), Candidate: [3 0 1 0 1 1 1 0 2 0 0 2 0 1 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 19950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  0  1  0  0  0 -1  0  0  0  0  1 -1] (Indices: [1, 10, 11, 12, 13, 19]), Candidate: [3 0 1 0 1 1 1 0 1 2 0 1 1 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 20000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  0  1  0 -1  0  0  0  0  1  0  0 -1] (Indices: [1, 10, 11, 17, 18, 19]), Candidate: [3 0 1 0 1 1 1 0 1 2 0 0 1 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 20050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  0  1 -1  0  1 -1  1 -1  1 -1  1 -1] (Indices: [1, 10, 13, 15, 17, 19]), Candidate: [ 3  0  1  0  1  1  1  0  1  2 -1  1  2  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  0  0  1  0 -1  0  1 -1  1 -1  1 -1] (Indices: [1, 11, 12, 15, 17, 19]), Candidate: [3 0 1 0 1 1 1 0 1 1 1 1 0 1 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 20150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  0  0  0  1  0  0 -1  0  0  1  0 -1] (Indices: [1, 12, 13, 14, 18, 19]), Candidate: [ 3  0  1  0  1  1  1  0  1  1  0  2  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  0  1 -1  0  0  0  0  0  0  0  0  0] (Indices: [2, 3, 4, 5, 6, 10]), Candidate: [ 2  2  1  0  1  1  0  0  1  2 -1  1  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  0  1 -1  0  0  0  0  0  0  1 -1  0] (Indices: [2, 3, 4, 5, 10, 18]), Candidate: [ 2  2  1  0  1  0  1  0  1  2 -1  1  1  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1  0 -1  0  0  0  0  0  0  0  0  0  0] (Indices: [2, 3, 4, 6, 8, 9]), Candidate: [2 2 1 0 0 2 0 1 1 0 0 1 1 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 20350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  0  0  0  0  1 -1  0  0  0  0  1 -1] (Indices: [2, 3, 4, 6, 13, 19]), Candidate: [2 2 1 0 0 2 0 0 1 1 0 1 2 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 20400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  0  0  1 -1  0  0  0  1 -1  0  0  0] (Indices: [2, 3, 4, 7, 11, 16]), Candidate: [ 2  2  1  0  0  1  2 -1  1  1  1  0  1  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1 -1  1 -1  0  0  0  0  0  0  0  1 -1] (Indices: [2, 3, 4, 8, 10, 19]), Candidate: [ 2  2  1  0  0  1  1  1  0  2 -1  1  1  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  1 -1  1 -1  0  0  0  1 -1  0  0  0] (Indices: [2, 3, 4, 9, 11, 16]), Candidate: [2 2 1 0 0 1 1 0 2 0 1 0 1 1 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 20550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  0  1 -1  0  1 -1  0  0  1 -1  0  0] (Indices: [2, 3, 4, 10, 13, 17]), Candidate: [ 2  2  1  0  0  1  1  0  1  2 -1  1  2  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  0  0  0  1  0 -1  0  0  0  1 -1  0] (Indices: [2, 3, 4, 12, 13, 18]), Candidate: [2 2 1 0 0 1 1 0 1 1 0 2 1 0 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 20650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  0  0  0  0  0  0  0  1 -1  1  0 -1] (Indices: [2, 3, 4, 16, 18, 19]), Candidate: [2 2 1 0 0 1 1 0 1 1 0 1 1 1 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 20700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  0  0  1 -1  0  0  0  0  0  1 -1  0] (Indices: [2, 3, 5, 6, 11, 18]), Candidate: [ 2  2  1 -1  2  1  0  0  1  1  1  0  1  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  1 -1  0  0  0  0  0  0  0  0  1 -1] (Indices: [2, 3, 5, 7, 9, 19]), Candidate: [ 2  2  1 -1  2  0  2 -1  2  0  0  1  1  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1  0 -1  0  0  0  1 -1  0  0  0  0  0] (Indices: [2, 3, 5, 8, 9, 14]), Candidate: [ 2  2  1 -1  2  0  1  1  1  0  0  1  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1 -1  0  0  0  0  0  0  0  0  1  0 -1] (Indices: [2, 3, 5, 8, 18, 19]), Candidate: [ 2  2  1 -1  2  0  1  1  0  1  0  1  1  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  0  1  0 -1  0  0  0  1 -1  0  0  0] (Indices: [2, 3, 5, 10, 11, 16]), Candidate: [ 2  2  1 -1  2  0  1  0  1  2  0  0  1  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  0  0  1 -1  0  0  1  0 -1  0  0  0] (Indices: [2, 3, 5, 11, 15, 16]), Candidate: [ 2  2  1 -1  2  0  1  0  1  1  1  0  1  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  0  0  0  0  0  1 -1  1  0 -1  0  0] (Indices: [2, 3, 5, 14, 16, 17]), Candidate: [ 2  2  1 -1  2  0  1  0  1  1  0  1  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  0  0  1 -1  0  0  0  1 -1  0  0  0] (Indices: [2, 3, 6, 7, 11, 16]), Candidate: [ 2  2  1 -1  1  2  1 -1  1  1  1  0  1  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1 -1  1 -1  0  0  0  0  0  0  0  1 -1] (Indices: [2, 3, 6, 8, 10, 19]), Candidate: [ 2  2  1 -1  1  2  0  1  0  2 -1  1  1  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  1 -1  1 -1  0  0  0  1 -1  0  0  0] (Indices: [2, 3, 6, 9, 11, 16]), Candidate: [ 2  2  1 -1  1  2  0  0  2  0  1  0  1  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  0  1 -1  0  1 -1  0  0  1 -1  0  0] (Indices: [2, 3, 6, 10, 13, 17]), Candidate: [ 2  2  1 -1  1  2  0  0  1  2 -1  1  2  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  0  0  0  1  0 -1  0  0  0  1 -1  0] (Indices: [2, 3, 6, 12, 13, 18]), Candidate: [ 2  2  1 -1  1  2  0  0  1  1  0  2  1  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  0  0  0  0  0  0  0  1 -1  1  0 -1] (Indices: [2, 3, 6, 16, 18, 19]), Candidate: [ 2  2  1 -1  1  2  0  0  1  1  0  1  1  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0 -1  0  0  0  0  0  1 -1  0  0  1 -1] (Indices: [2, 3, 7, 8, 15, 19]), Candidate: [ 2  2  1 -1  1  1  2  0  0  1  0  1  1  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  1 -1  0  0  0  0  0  0  1 -1  1 -1] (Indices: [2, 3, 7, 9, 17, 19]), Candidate: [ 2  2  1 -1  1  1  2 -1  2  0  0  1  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  0  0  1 -1  1 -1  0  0  0  0  1 -1] (Indices: [2, 3, 7, 11, 13, 19]), Candidate: [ 2  2  1 -1  1  1  2 -1  1  1  1  0  2  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  0  0  0  0  1 -1  0  0  1 -1  1 -1] (Indices: [2, 3, 7, 13, 17, 19]), Candidate: [ 2  2  1 -1  1  1  2 -1  1  1  0  1  2  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1  0 -1  0  0  1 -1  0  0  0  1 -1  0] (Indices: [2, 3, 8, 9, 13, 18]), Candidate: [ 2  2  1 -1  1  1  1  1  1  0  0  1  2  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1 -1  1 -1  0  0  0  0  0  1  0 -1  0] (Indices: [2, 3, 8, 10, 17, 18]), Candidate: [ 2  2  1 -1  1  1  1  1  0  2 -1  1  1  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1 -1  0  0  1 -1  0  0  0  1 -1  1 -1] (Indices: [2, 3, 8, 12, 17, 19]), Candidate: [ 2  2  1 -1  1  1  1  1  0  1  0  2  0  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  1  0 -1  1 -1  0  0  0  0  1 -1  0] (Indices: [2, 3, 9, 10, 12, 18]), Candidate: [ 2  2  1 -1  1  1  1  0  2  1 -1  2  0  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  1 -1  1 -1  0  0  0  0  0  1  0 -1] (Indices: [2, 3, 9, 11, 18, 19]), Candidate: [ 2  2  1 -1  1  1  1  0  2  0  1  0  1  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  1 -1  0  0  0  0  1 -1  1  0 -1  0] (Indices: [2, 3, 9, 15, 17, 18]), Candidate: [ 2  2  1 -1  1  1  1  0  2  0  0  1  1  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  0  1 -1  1 -1  0  0  1  0 -1  0  0] (Indices: [2, 3, 10, 12, 16, 17]), Candidate: [ 2  2  1 -1  1  1  1  0  1  2 -1  2  0  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  0  0  1  0 -1  1 -1  0  0  1 -1  0] (Indices: [2, 3, 11, 12, 14, 18]), Candidate: [ 2  2  1 -1  1  1  1  0  1  1  1  1  0  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  0  0  0  1  0  0 -1  0  0  1 -1  0] (Indices: [2, 3, 12, 13, 14, 18]), Candidate: [ 2  2  1 -1  1  1  1  0  1  1  0  2  1  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 22000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  0  0  0  0  1 -1  0  1 -1  1  0 -1] (Indices: [2, 3, 13, 16, 18, 19]), Candidate: [ 2  2  1 -1  1  1  1  0  1  1  0  1  2  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  0  1  0 -1  0  0  0  0  0  0  0  0] (Indices: [2, 4, 5, 6, 10, 11]), Candidate: [2 2 0 1 1 1 0 0 1 2 0 0 1 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 22100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0 -1  0  0  0  0  1 -1  0  0  0  0  0] (Indices: [2, 4, 5, 7, 8, 14]), Candidate: [ 2  2  0  1  1  0  2  0  0  1  0  1  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  0  0  0  0  0  1 -1  0  0  0  1 -1] (Indices: [2, 4, 5, 7, 14, 19]), Candidate: [ 2  2  0  1  1  0  2 -1  1  1  0  1  1  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 22200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1 -1  0  0  0  1 -1  0  0  0  0  1 -1] (Indices: [2, 4, 5, 8, 13, 19]), Candidate: [2 2 0 1 1 0 1 1 0 1 0 1 2 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 22250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  1 -1  0  0  0  1 -1  0  0  0  1 -1] (Indices: [2, 4, 5, 9, 14, 19]), Candidate: [ 2  2  0  1  1  0  1  0  2  0  0  1  1  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  0  0  1  0 -1  0  0  1 -1  0  0  0] (Indices: [2, 4, 5, 11, 12, 16]), Candidate: [2 2 0 1 1 0 1 0 1 1 1 1 0 1 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 22350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  0  0  0  0  1  0 -1  0  0  0  1 -1] (Indices: [2, 4, 5, 13, 14, 19]), Candidate: [ 2  2  0  1  1  0  1  0  1  1  0  1  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  1 -1  0  0  0  0  0  0  0  1 -1  0] (Indices: [2, 4, 6, 7, 9, 18]), Candidate: [ 2  2  0  1  0  2  1 -1  2  0  0  1  1  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1  0 -1  0  0  1 -1  0  0  0  0  0  0] (Indices: [2, 4, 6, 8, 9, 13]), Candidate: [2 2 0 1 0 2 0 1 1 0 0 1 2 0 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 22500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1 -1  0  0  0  0  0  0  0  1 -1  1 -1] (Indices: [2, 4, 6, 8, 17, 19]), Candidate: [2 2 0 1 0 2 0 1 0 1 0 1 1 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 22550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  0  1  0 -1  0  0  1 -1  0  0  0  0] (Indices: [2, 4, 6, 10, 11, 15]), Candidate: [2 2 0 1 0 2 0 0 1 2 0 0 1 1 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 22600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  0  0  1 -1  0  1 -1  0  0  0  1 -1] (Indices: [2, 4, 6, 11, 14, 19]), Candidate: [ 2  2  0  1  0  2  0  0  1  1  1  0  1  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  0  0  0  0  0  1  0 -1  0  0  1 -1] (Indices: [2, 4, 6, 14, 15, 19]), Candidate: [2 2 0 1 0 2 0 0 1 1 0 1 1 2 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 22700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0 -1  0  0  1 -1  0  0  0  0  0  1 -1] (Indices: [2, 4, 7, 8, 12, 19]), Candidate: [2 2 0 1 0 1 2 0 0 1 0 2 0 1 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 22750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  1 -1  0  0  1 -1  0  0  0  1 -1  0] (Indices: [2, 4, 7, 9, 13, 18]), Candidate: [ 2  2  0  1  0  1  2 -1  2  0  0  1  2  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  0  1 -1  0  0  0  0  0  1  0 -1  0] (Indices: [2, 4, 7, 10, 17, 18]), Candidate: [ 2  2  0  1  0  1  2 -1  1  2 -1  1  1  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 22850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  0  0  0  1 -1  0  0  0  1 -1  1 -1] (Indices: [2, 4, 7, 12, 17, 19]), Candidate: [ 2  2  0  1  0  1  2 -1  1  1  0  2  0  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1  0 -1  1 -1  0  0  0  1 -1  0  0  0] (Indices: [2, 4, 8, 9, 11, 16]), Candidate: [2 2 0 1 0 1 1 1 1 0 1 0 1 1 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 22950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1 -1  1 -1  0  1 -1  0  0  1 -1  0  0] (Indices: [2, 4, 8, 10, 13, 17]), Candidate: [ 2  2  0  1  0  1  1  1  0  2 -1  1  2  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1 -1  0  0  1  0 -1  0  0  0  1 -1  0] (Indices: [2, 4, 8, 12, 13, 18]), Candidate: [2 2 0 1 0 1 1 1 0 1 0 2 1 0 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 23050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1 -1  0  0  0  0  0  0  1 -1  1  0 -1] (Indices: [2, 4, 8, 16, 18, 19]), Candidate: [2 2 0 1 0 1 1 1 0 1 0 1 1 1 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 23100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  1 -1  1 -1  1 -1  0  0  0  0  1 -1] (Indices: [2, 4, 9, 11, 13, 19]), Candidate: [2 2 0 1 0 1 1 0 2 0 1 0 2 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 23150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  1 -1  0  0  1 -1  0  0  1 -1  1 -1] (Indices: [2, 4, 9, 13, 17, 19]), Candidate: [2 2 0 1 0 1 1 0 2 0 0 1 2 0 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 23200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  0  1 -1  1  0  0 -1  0  0  0  0  0] (Indices: [2, 4, 10, 12, 13, 14]), Candidate: [ 2  2  0  1  0  1  1  0  1  2 -1  2  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 23250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  0  1 -1  0  0  0  1 -1  1 -1  1 -1] (Indices: [2, 4, 10, 15, 17, 19]), Candidate: [ 2  2  0  1  0  1  1  0  1  2 -1  1  1  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  0  0  1 -1  0  1 -1  0  1 -1  1 -1] (Indices: [2, 4, 11, 14, 17, 19]), Candidate: [ 2  2  0  1  0  1  1  0  1  1  1  0  1  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  0  0  0  0  1  0  0 -1  0  0  1 -1] (Indices: [2, 4, 13, 14, 15, 19]), Candidate: [2 2 0 1 0 1 1 0 1 1 0 1 2 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 23400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  1 -1  0  0  0  0  0  0  1 -1  0  0] (Indices: [2, 5, 6, 7, 9, 17]), Candidate: [ 2  2  0  0  2  1  1 -1  2  0  0  1  1  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1  0 -1  0  1 -1  0  0  0  0  0  0  0] (Indices: [2, 5, 6, 8, 9, 12]), Candidate: [2 2 0 0 2 1 0 1 1 0 0 2 0 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 23500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1 -1  0  0  0  0  0  0  0  1  0 -1  0] (Indices: [2, 5, 6, 8, 17, 18]), Candidate: [2 2 0 0 2 1 0 1 0 1 0 1 1 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 23550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  0  1  0 -1  0  1 -1  0  0  0  0  0] (Indices: [2, 5, 6, 10, 11, 14]), Candidate: [ 2  2  0  0  2  1  0  0  1  2  0  0  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  0  0  1 -1  0  1 -1  0  0  1 -1  0] (Indices: [2, 5, 6, 11, 14, 18]), Candidate: [ 2  2  0  0  2  1  0  0  1  1  1  0  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  0  0  0  0  0  1  0 -1  0  1 -1  0] (Indices: [2, 5, 6, 14, 15, 18]), Candidate: [2 2 0 0 2 1 0 0 1 1 0 1 1 2 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 23700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0 -1  0  0  1 -1  0  0  0  0  1 -1  0] (Indices: [2, 5, 7, 8, 12, 18]), Candidate: [2 2 0 0 2 0 2 0 0 1 0 2 0 1 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 23750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  1 -1  0  0  1 -1  0  0  1 -1  0  0] (Indices: [2, 5, 7, 9, 13, 17]), Candidate: [ 2  2  0  0  2  0  2 -1  2  0  0  1  2  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  0  1 -1  0  0  0  0  1 -1  0  1 -1] (Indices: [2, 5, 7, 10, 16, 19]), Candidate: [ 2  2  0  0  2  0  2 -1  1  2 -1  1  1  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 23850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  0  0  0  1 -1  0  0  0  1  0 -1  0] (Indices: [2, 5, 7, 12, 17, 18]), Candidate: [ 2  2  0  0  2  0  2 -1  1  1  0  2  0  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1  0 -1  1 -1  0  0  1 -1  0  0  0  0] (Indices: [2, 5, 8, 9, 11, 15]), Candidate: [2 2 0 0 2 0 1 1 1 0 1 0 1 1 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 23950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1 -1  1 -1  0  1 -1  0  1 -1  0  0  0] (Indices: [2, 5, 8, 10, 13, 16]), Candidate: [ 2  2  0  0  2  0  1  1  0  2 -1  1  2  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1 -1  0  0  1  0 -1  0  0  1 -1  0  0] (Indices: [2, 5, 8, 12, 13, 17]), Candidate: [2 2 0 0 2 0 1 1 0 1 0 2 1 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 24050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1 -1  0  0  0  0  0  0  1  0 -1  1 -1] (Indices: [2, 5, 8, 16, 17, 19]), Candidate: [2 2 0 0 2 0 1 1 0 1 0 1 1 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 24100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  1 -1  1 -1  1 -1  0  0  0  1 -1  0] (Indices: [2, 5, 9, 11, 13, 18]), Candidate: [2 2 0 0 2 0 1 0 2 0 1 0 2 0 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 24150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  1 -1  0  0  1 -1  0  0  1  0 -1  0] (Indices: [2, 5, 9, 13, 17, 18]), Candidate: [2 2 0 0 2 0 1 0 2 0 0 1 2 0 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 24200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  0  1  0 -1  0  0  0  0  0  1  0 -1] (Indices: [2, 5, 10, 11, 18, 19]), Candidate: [2 2 0 0 2 0 1 0 1 2 0 0 1 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 24250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  0  1 -1  0  0  0  1 -1  1  0 -1  0] (Indices: [2, 5, 10, 15, 17, 18]), Candidate: [ 2  2  0  0  2  0  1  0  1  2 -1  1  1  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  0  0  1 -1  0  1 -1  0  1  0 -1  0] (Indices: [2, 5, 11, 14, 17, 18]), Candidate: [ 2  2  0  0  2  0  1  0  1  1  1  0  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  0  0  0  0  1  0  0 -1  0  1 -1  0] (Indices: [2, 5, 13, 14, 15, 18]), Candidate: [2 2 0 0 2 0 1 0 1 1 0 1 2 1 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 24400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0 -1  1 -1  0  0  0  0  0  0  1 -1  0] (Indices: [2, 6, 7, 8, 10, 18]), Candidate: [ 2  2  0  0  1  2  1  0  0  2 -1  1  1  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  1 -1  1 -1  0  0  1 -1  0  0  0  0] (Indices: [2, 6, 7, 9, 11, 15]), Candidate: [ 2  2  0  0  1  2  1 -1  2  0  1  0  1  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  0  1 -1  0  1 -1  0  1 -1  0  0  0] (Indices: [2, 6, 7, 10, 13, 16]), Candidate: [ 2  2  0  0  1  2  1 -1  1  2 -1  1  2  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 24550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  0  0  0  1  0 -1  0  0  1 -1  0  0] (Indices: [2, 6, 7, 12, 13, 17]), Candidate: [ 2  2  0  0  1  2  1 -1  1  1  0  2  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  0  0  0  0  0  0  0  1  0 -1  1 -1] (Indices: [2, 6, 7, 16, 17, 19]), Candidate: [ 2  2  0  0  1  2  1 -1  1  1  0  1  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1 -1  1  0 -1  0  1 -1  0  0  0  0  0] (Indices: [2, 6, 8, 10, 11, 14]), Candidate: [ 2  2  0  0  1  2  0  1  0  2  0  0  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1 -1  0  1 -1  0  1 -1  0  0  1 -1  0] (Indices: [2, 6, 8, 11, 14, 18]), Candidate: [ 2  2  0  0  1  2  0  1  0  1  1  0  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1 -1  0  0  0  0  1  0 -1  0  1 -1  0] (Indices: [2, 6, 8, 14, 15, 18]), Candidate: [2 2 0 0 1 2 0 1 0 1 0 1 1 2 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 24800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  1  0 -1  0  0  0  0  1 -1  0  1 -1] (Indices: [2, 6, 9, 10, 16, 19]), Candidate: [ 2  2  0  0  1  2  0  0  2  1 -1  1  1  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  1 -1  0  1 -1  0  0  0  1  0 -1  0] (Indices: [2, 6, 9, 12, 17, 18]), Candidate: [2 2 0 0 1 2 0 0 2 0 0 2 0 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 24900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  0  1  0 -1  1 -1  0  0  0  0  1 -1] (Indices: [2, 6, 10, 11, 13, 19]), Candidate: [2 2 0 0 1 2 0 0 1 2 0 0 2 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 24950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  0  1 -1  0  1 -1  0  0  1 -1  1 -1] (Indices: [2, 6, 10, 13, 17, 19]), Candidate: [ 2  2  0  0  1  2  0  0  1  2 -1  1  2  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  0  0  1 -1  1 -1  1 -1  0  1 -1  0] (Indices: [2, 6, 11, 13, 15, 18]), Candidate: [2 2 0 0 1 2 0 0 1 1 1 0 2 0 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 25050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  0  0  0  1 -1  1 -1  0  1  0 -1  0] (Indices: [2, 6, 12, 14, 17, 18]), Candidate: [ 2  2  0  0  1  2  0  0  1  1  0  2  0  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0  0  0 -1  0  1 -1  0  0  0  0  0  0] (Indices: [2, 7, 8, 9, 10, 13]), Candidate: [ 2  2  0  0  1  1  2  0  1  1 -1  1  2  0  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0 -1  1  0 -1  0  0  0  0  0  0  1 -1] (Indices: [2, 7, 8, 10, 11, 19]), Candidate: [2 2 0 0 1 1 2 0 0 2 0 0 1 1 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 25200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0 -1  0  1 -1  0  0  1 -1  0  0  1 -1] (Indices: [2, 7, 8, 11, 15, 19]), Candidate: [2 2 0 0 1 1 2 0 0 1 1 0 1 1 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 25250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0 -1  0  0  0  0  1 -1  0  1  0 -1  0] (Indices: [2, 7, 8, 14, 17, 18]), Candidate: [ 2  2  0  0  1  1  2  0  0  1  0  1  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  1 -1  1  0 -1  1 -1  0  0  0  0  0] (Indices: [2, 7, 9, 11, 12, 14]), Candidate: [ 2  2  0  0  1  1  2 -1  2  0  1  1  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 25350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  1 -1  0  0  1  0 -1  0  1 -1  0  0] (Indices: [2, 7, 9, 13, 14, 17]), Candidate: [ 2  2  0  0  1  1  2 -1  2  0  0  1  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 25400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  0  1  0 -1  0  1 -1  0  0  0  1 -1] (Indices: [2, 7, 10, 11, 14, 19]), Candidate: [ 2  2  0  0  1  1  2 -1  1  2  0  0  1  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 25450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  0  1 -1  0  0  1  0 -1  0  0  1 -1] (Indices: [2, 7, 10, 14, 15, 19]), Candidate: [ 2  2  0  0  1  1  2 -1  1  2 -1  1  1  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 25500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  0  0  1 -1  1 -1  0  0  1  0 -1  0] (Indices: [2, 7, 11, 13, 17, 18]), Candidate: [ 2  2  0  0  1  1  2 -1  1  1  1  0  2  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  0  0  0  1 -1  0  1  0 -1  0  1 -1] (Indices: [2, 7, 12, 15, 16, 19]), Candidate: [ 2  2  0  0  1  1  2 -1  1  1  0  2  0  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1  0  0  0 -1  0  0  0  0  0  0  1 -1] (Indices: [2, 8, 9, 10, 11, 19]), Candidate: [2 2 0 0 1 1 1 1 1 1 0 0 1 1 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 25650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1  0 -1  1 -1  0  0  1 -1  0  0  1 -1] (Indices: [2, 8, 9, 11, 15, 19]), Candidate: [2 2 0 0 1 1 1 1 1 0 1 0 1 1 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 25700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1  0 -1  0  0  0  1 -1  0  1  0 -1  0] (Indices: [2, 8, 9, 14, 17, 18]), Candidate: [ 2  2  0  0  1  1  1  1  1  0  0  1  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1 -1  1 -1  1 -1  1 -1  0  0  1 -1  0] (Indices: [2, 8, 10, 12, 14, 18]), Candidate: [ 2  2  0  0  1  1  1  1  0  2 -1  2  0  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 25800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1 -1  0  1  0  0 -1  0  0  1 -1  0  0] (Indices: [2, 8, 11, 12, 13, 17]), Candidate: [2 2 0 0 1 1 1 1 0 1 1 1 1 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 25850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1 -1  0  1 -1  0  0  0  1  0 -1  1 -1] (Indices: [2, 8, 11, 16, 17, 19]), Candidate: [2 2 0 0 1 1 1 1 0 1 1 0 1 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 25900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1 -1  0  0  0  1 -1  1  0 -1  0  1 -1] (Indices: [2, 8, 13, 15, 16, 19]), Candidate: [2 2 0 0 1 1 1 1 0 1 0 1 2 0 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 25950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  1  0  0 -1  0  0  0  0  0  1  0 -1] (Indices: [2, 9, 10, 11, 18, 19]), Candidate: [2 2 0 0 1 1 1 0 2 1 0 0 1 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 26000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  1  0 -1  0  0  0  1 -1  1  0 -1  0] (Indices: [2, 9, 10, 15, 17, 18]), Candidate: [ 2  2  0  0  1  1  1  0  2  1 -1  1  1  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  1 -1  1 -1  0  1 -1  0  1  0 -1  0] (Indices: [2, 9, 11, 14, 17, 18]), Candidate: [ 2  2  0  0  1  1  1  0  2  0  1  0  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  1 -1  0  0  1  0  0 -1  0  1 -1  0] (Indices: [2, 9, 13, 14, 15, 18]), Candidate: [2 2 0 0 1 1 1 0 2 0 0 1 2 1 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 26150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  0  1  0  0 -1  0  0  1 -1  0  1 -1] (Indices: [2, 10, 11, 12, 16, 19]), Candidate: [2 2 0 0 1 1 1 0 1 2 0 1 0 1 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 26200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  0  1 -1  1  0 -1  0  1 -1  0  1 -1] (Indices: [2, 10, 12, 13, 16, 19]), Candidate: [ 2  2  0  0  1  1  1  0  1  2 -1  2  1  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  0  1 -1  0  0  1 -1  1  0  0 -1  0] (Indices: [2, 10, 14, 16, 17, 18]), Candidate: [ 2  2  0  0  1  1  1  0  1  2 -1  1  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 26300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  0  0  1 -1  1  0 -1  1 -1  0  1 -1] (Indices: [2, 11, 13, 14, 16, 19]), Candidate: [ 2  2  0  0  1  1  1  0  1  1  1  0  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  0  0  0  1 -1  1  0  0 -1  1 -1  0] (Indices: [2, 12, 14, 15, 16, 18]), Candidate: [2 2 0 0 1 1 1 0 1 1 0 2 0 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 26400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1 -1  0  0  1 -1  0  0  0  0  0  0  0] (Indices: [3, 4, 5, 6, 8, 12]), Candidate: [2 1 2 0 1 1 0 1 0 1 0 2 0 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 26450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  0  0  0  0  0  1 -1  0  1 -1  0  0] (Indices: [3, 4, 5, 6, 14, 17]), Candidate: [ 2  1  2  0  1  1  0  0  1  1  0  1  1  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  0  0  1 -1  0  0  0  0  0  0  1 -1] (Indices: [3, 4, 5, 7, 11, 19]), Candidate: [ 2  1  2  0  1  0  2 -1  1  1  1  0  1  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1 -1  0  1 -1  0  1 -1  0  0  0  0  0] (Indices: [3, 4, 5, 8, 11, 14]), Candidate: [ 2  1  2  0  1  0  1  1  0  1  1  0  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  1 -1  1 -1  0  0  0  0  0  0  1 -1] (Indices: [3, 4, 5, 9, 11, 19]), Candidate: [2 1 2 0 1 0 1 0 2 0 1 0 1 1 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 26650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  0  1 -1  0  0  1  0 -1  0  0  0  0] (Indices: [3, 4, 5, 10, 14, 15]), Candidate: [ 2  1  2  0  1  0  1  0  1  2 -1  1  1  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  0  0  0  1 -1  1 -1  1 -1  0  0  0] (Indices: [3, 4, 5, 12, 14, 16]), Candidate: [ 2  1  2  0  1  0  1  0  1  1  0  2  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0 -1  1 -1  0  0  0  0  0  0  0  0  0] (Indices: [3, 4, 6, 7, 8, 10]), Candidate: [ 2  1  2  0  0  2  1  0  0  2 -1  1  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  0  0  0  0  0  1  0 -1  0  0  0  0] (Indices: [3, 4, 6, 7, 14, 15]), Candidate: [ 2  1  2  0  0  2  1 -1  1  1  0  1  1  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1 -1  0  0  0  1 -1  1 -1  0  0  0  0] (Indices: [3, 4, 6, 8, 13, 15]), Candidate: [2 1 2 0 0 2 0 1 0 1 0 1 2 0 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 26900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  1 -1  0  0  0  1  0 -1  0  0  0  0] (Indices: [3, 4, 6, 9, 14, 15]), Candidate: [2 1 2 0 0 2 0 0 2 0 0 1 1 2 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 26950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  0  1 -1  0  0  0  0  0  0  1  0 -1] (Indices: [3, 4, 6, 10, 18, 19]), Candidate: [ 2  1  2  0  0  2  0  0  1  2 -1  1  1  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  0  0  0  0  1  0  0 -1  0  0  0  0] (Indices: [3, 4, 6, 13, 14, 15]), Candidate: [2 1 2 0 0 2 0 0 1 1 0 1 2 1 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 27050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0 -1  1 -1  0  0  0  0  1 -1  0  0  0] (Indices: [3, 4, 7, 8, 10, 16]), Candidate: [ 2  1  2  0  0  1  2  0  0  2 -1  1  1  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  1 -1  1 -1  1 -1  0  0  0  0  0  0] (Indices: [3, 4, 7, 9, 11, 13]), Candidate: [ 2  1  2  0  0  1  2 -1  2  0  1  0  2  0  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  0  1 -1  0  1  0 -1  0  0  0  0  0] (Indices: [3, 4, 7, 10, 13, 14]), Candidate: [ 2  1  2  0  0  1  2 -1  1  2 -1  1  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 27200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  0  0  0  1  0 -1  1 -1  0  0  0  0] (Indices: [3, 4, 7, 12, 13, 15]), Candidate: [ 2  1  2  0  0  1  2 -1  1  1  0  2  1  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  0  0  0  0  0  0  1 -1  0  1  0 -1] (Indices: [3, 4, 7, 15, 18, 19]), Candidate: [ 2  1  2  0  0  1  2 -1  1  1  0  1  1  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1 -1  1  0  0 -1  0  0  0  0  0  0  0] (Indices: [3, 4, 8, 10, 11, 12]), Candidate: [2 1 2 0 0 1 1 1 0 2 0 1 0 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 27350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1 -1  0  1 -1  0  1 -1  1 -1  0  0  0] (Indices: [3, 4, 8, 11, 14, 16]), Candidate: [ 2  1  2  0  0  1  1  1  0  1  1  0  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1 -1  0  0  0  0  1  0  0 -1  0  0  0] (Indices: [3, 4, 8, 14, 15, 16]), Candidate: [2 1 2 0 0 1 1 1 0 1 0 1 1 2 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 27450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  1  0 -1  0  0  0  0  1  0 -1  0  0] (Indices: [3, 4, 9, 10, 16, 17]), Candidate: [ 2  1  2  0  0  1  1  0  2  1 -1  1  1  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  1 -1  0  1 -1  0  0  1 -1  1 -1  0] (Indices: [3, 4, 9, 12, 16, 18]), Candidate: [2 1 2 0 0 1 1 0 2 0 0 2 0 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 27550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  0  1  0 -1  1 -1  0  0  1 -1  0  0] (Indices: [3, 4, 10, 11, 13, 17]), Candidate: [2 1 2 0 0 1 1 0 1 2 0 0 2 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 27600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  0  1 -1  0  1 -1  0  1 -1  0  1 -1] (Indices: [3, 4, 10, 13, 16, 19]), Candidate: [ 2  1  2  0  0  1  1  0  1  2 -1  1  2  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  0  0  1 -1  1 -1  1  0 -1  0  0  0] (Indices: [3, 4, 11, 13, 15, 16]), Candidate: [2 1 2 0 0 1 1 0 1 1 1 0 2 0 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 27700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  0  0  0  1 -1  1 -1  1 -1  1 -1  0] (Indices: [3, 4, 12, 14, 16, 18]), Candidate: [ 2  1  2  0  0  1  1  0  1  1  0  2  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0  0 -1  0  0  0  0  0  0  0  0  0  0] (Indices: [3, 5, 6, 7, 8, 9]), Candidate: [ 2  1  2 -1  2  1  1  0  1  0  0  1  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  0  0  0  0  1 -1  0  0  0  0  1 -1] (Indices: [3, 5, 6, 7, 13, 19]), Candidate: [ 2  1  2 -1  2  1  1 -1  1  1  0  1  2  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1 -1  0  0  0  1  0 -1  0  0  0  0  0] (Indices: [3, 5, 6, 8, 13, 14]), Candidate: [ 2  1  2 -1  2  1  0  1  0  1  0  1  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  1 -1  0  0  1 -1  0  0  0  0  1 -1] (Indices: [3, 5, 6, 9, 13, 19]), Candidate: [ 2  1  2 -1  2  1  0  0  2  0  0  1  2  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  0  1 -1  0  0  0  0  0  1 -1  1 -1] (Indices: [3, 5, 6, 10, 17, 19]), Candidate: [ 2  1  2 -1  2  1  0  0  1  2 -1  1  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  0  0  0  1 -1  0  0  0  0  1  0 -1] (Indices: [3, 5, 6, 12, 18, 19]), Candidate: [ 2  1  2 -1  2  1  0  0  1  1  0  2  0  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0 -1  1 -1  0  0  0  1 -1  0  0  0  0] (Indices: [3, 5, 7, 8, 10, 15]), Candidate: [ 2  1  2 -1  2  0  2  0  0  2 -1  1  1  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  1 -1  1  0 -1  0  0  0  0  0  0  0] (Indices: [3, 5, 7, 9, 11, 12]), Candidate: [ 2  1  2 -1  2  0  2 -1  2  0  1  1  0  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  0  1 -1  1 -1  0  0  0  0  0  1 -1] (Indices: [3, 5, 7, 10, 12, 19]), Candidate: [ 2  1  2 -1  2  0  2 -1  1  2 -1  2  0  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 28200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  0  0  0  1  0  0 -1  0  0  0  0  0] (Indices: [3, 5, 7, 12, 13, 14]), Candidate: [ 2  1  2 -1  2  0  2 -1  1  1  0  2  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 28250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  0  0  0  0  0  0  1 -1  1 -1  1 -1] (Indices: [3, 5, 7, 15, 17, 19]), Candidate: [ 2  1  2 -1  2  0  2 -1  1  1  0  1  1  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1  0 -1  0  0  0  0  0  0  0  1  0 -1] (Indices: [3, 5, 8, 9, 18, 19]), Candidate: [ 2  1  2 -1  2  0  1  1  1  0  0  1  1  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1 -1  0  1 -1  0  1  0 -1  0  0  0  0] (Indices: [3, 5, 8, 11, 14, 15]), Candidate: [ 2  1  2 -1  2  0  1  1  0  1  1  0  1  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1 -1  0  0  0  1 -1  0  0  0  1  0 -1] (Indices: [3, 5, 8, 13, 18, 19]), Candidate: [ 2  1  2 -1  2  0  1  1  0  1  0  1  2  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  1  0 -1  0  0  0  1 -1  0  0  1 -1] (Indices: [3, 5, 9, 10, 15, 19]), Candidate: [ 2  1  2 -1  2  0  1  0  2  1 -1  1  1  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  1 -1  0  1 -1  0  0  1  0 -1  0  0] (Indices: [3, 5, 9, 12, 16, 17]), Candidate: [ 2  1  2 -1  2  0  1  0  2  0  0  2  0  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  0  1  0 -1  1 -1  0  1 -1  0  0  0] (Indices: [3, 5, 10, 11, 13, 16]), Candidate: [ 2  1  2 -1  2  0  1  0  1  2  0  0  2  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  0  1 -1  0  1 -1  0  1 -1  1 -1  0] (Indices: [3, 5, 10, 13, 16, 18]), Candidate: [ 2  1  2 -1  2  0  1  0  1  2 -1  1  2  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  0  0  1 -1  1  0 -1  0  0  0  1 -1] (Indices: [3, 5, 11, 13, 14, 19]), Candidate: [ 2  1  2 -1  2  0  1  0  1  1  1  0  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  0  0  0  1 -1  1 -1  1  0 -1  0  0] (Indices: [3, 5, 12, 14, 16, 17]), Candidate: [ 2  1  2 -1  2  0  1  0  1  1  0  2  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  0  0  0  0  0  0  0  1  0  0  0 -1] (Indices: [3, 5, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  0  1  0  1  1  0  1  1  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0 -1  0  0  0  0  0  0  1  0 -1  0  0] (Indices: [3, 6, 7, 8, 16, 17]), Candidate: [ 2  1  2 -1  1  2  1  0  0  1  0  1  1  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  1 -1  0  0  0  0  0  0  0  1  0 -1] (Indices: [3, 6, 7, 9, 18, 19]), Candidate: [ 2  1  2 -1  1  2  1 -1  2  0  0  1  1  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  0  0  1 -1  0  1  0 -1  0  0  0  0] (Indices: [3, 6, 7, 11, 14, 15]), Candidate: [ 2  1  2 -1  1  2  1 -1  1  1  1  0  1  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  0  0  0  0  1 -1  0  0  0  1  0 -1] (Indices: [3, 6, 7, 13, 18, 19]), Candidate: [ 2  1  2 -1  1  2  1 -1  1  1  0  1  2  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1  0 -1  0  0  1 -1  0  0  0  0  1 -1] (Indices: [3, 6, 8, 9, 13, 19]), Candidate: [ 2  1  2 -1  1  2  0  1  1  0  0  1  2  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1 -1  1 -1  0  0  0  0  0  1 -1  1 -1] (Indices: [3, 6, 8, 10, 17, 19]), Candidate: [ 2  1  2 -1  1  2  0  1  0  2 -1  1  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1 -1  0  0  1 -1  0  0  0  0  1  0 -1] (Indices: [3, 6, 8, 12, 18, 19]), Candidate: [ 2  1  2 -1  1  2  0  1  0  1  0  2  0  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  1  0 -1  1 -1  0  0  0  0  0  1 -1] (Indices: [3, 6, 9, 10, 12, 19]), Candidate: [ 2  1  2 -1  1  2  0  0  2  1 -1  2  0  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  1 -1  0  1  0  0 -1  0  0  0  0  0] (Indices: [3, 6, 9, 12, 13, 14]), Candidate: [ 2  1  2 -1  1  2  0  0  2  0  0  2  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  1 -1  0  0  0  0  1 -1  1 -1  1 -1] (Indices: [3, 6, 9, 15, 17, 19]), Candidate: [ 2  1  2 -1  1  2  0  0  2  0  0  1  1  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  0  1 -1  1 -1  0  0  1 -1  1 -1  0] (Indices: [3, 6, 10, 12, 16, 18]), Candidate: [ 2  1  2 -1  1  2  0  0  1  2 -1  2  0  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  0  0  1  0 -1  1 -1  0  0  0  1 -1] (Indices: [3, 6, 11, 12, 14, 19]), Candidate: [ 2  1  2 -1  1  2  0  0  1  1  1  1  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  0  0  0  1  0  0 -1  0  0  0  1 -1] (Indices: [3, 6, 12, 13, 14, 19]), Candidate: [ 2  1  2 -1  1  2  0  0  1  1  0  2  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  0  0  0  0  1 -1  0  0  1  0  0 -1] (Indices: [3, 6, 13, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  2  0  0  1  1  0  1  2  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0  0 -1  0  0  0  1 -1  0  0  0  1 -1] (Indices: [3, 7, 8, 9, 14, 19]), Candidate: [ 2  1  2 -1  1  1  2  0  1  0  0  1  1  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0 -1  0  1  0 -1  0  0  1 -1  0  0  0] (Indices: [3, 7, 8, 11, 12, 16]), Candidate: [ 2  1  2 -1  1  1  2  0  0  1  1  1  0  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0 -1  0  0  0  1  0 -1  0  0  0  1 -1] (Indices: [3, 7, 8, 13, 14, 19]), Candidate: [ 2  1  2 -1  1  1  2  0  0  1  0  1  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  1  0 -1  0  1 -1  0  0  0  1 -1  0] (Indices: [3, 7, 9, 10, 13, 18]), Candidate: [ 2  1  2 -1  1  1  2 -1  2  1 -1  1  2  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 29700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  1 -1  0  1  0 -1  0  0  0  0  1 -1] (Indices: [3, 7, 9, 12, 13, 19]), Candidate: [ 2  1  2 -1  1  1  2 -1  2  0  0  2  1  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  1 -1  0  0  0  0  0  0  1  0  0 -1] (Indices: [3, 7, 9, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  1  2 -1  2  0  0  1  1  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  0  1 -1  0  1  0  0 -1  0  0  0  0] (Indices: [3, 7, 10, 13, 14, 15]), Candidate: [ 2  1  2 -1  1  1  2 -1  1  2 -1  1  2  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 29850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  0  0  1  0 -1  0  0  1  0 -1  0  0] (Indices: [3, 7, 11, 12, 16, 17]), Candidate: [ 2  1  2 -1  1  1  2 -1  1  1  1  1  0  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  0  0  0  1  0 -1  0  1  0 -1  0  0] (Indices: [3, 7, 12, 13, 16, 17]), Candidate: [ 2  1  2 -1  1  1  2 -1  1  1  0  2  1  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  0  0  0  0  0  1  0 -1  1 -1  1 -1] (Indices: [3, 7, 14, 15, 17, 19]), Candidate: [ 2  1  2 -1  1  1  2 -1  1  1  0  1  1  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 30000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1  0 -1  1  0 -1  0  0  1 -1  0  0  0] (Indices: [3, 8, 9, 11, 12, 16]), Candidate: [ 2  1  2 -1  1  1  1  1  1  0  1  1  0  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1  0 -1  0  0  1  0 -1  0  0  0  1 -1] (Indices: [3, 8, 9, 13, 14, 19]), Candidate: [ 2  1  2 -1  1  1  1  1  1  0  0  1  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 30100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1 -1  1  0 -1  0  0  1 -1  1 -1  0  0] (Indices: [3, 8, 10, 11, 15, 17]), Candidate: [ 2  1  2 -1  1  1  1  1  0  2  0  0  1  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1 -1  1 -1  0  0  1 -1  1 -1  1 -1  0] (Indices: [3, 8, 10, 14, 16, 18]), Candidate: [ 2  1  2 -1  1  1  1  1  0  2 -1  1  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 30200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1 -1  0  1 -1  1 -1  0  0  0  1  0 -1] (Indices: [3, 8, 11, 13, 18, 19]), Candidate: [ 2  1  2 -1  1  1  1  1  0  1  1  0  2  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1 -1  0  0  1 -1  0  1 -1  1 -1  1 -1] (Indices: [3, 8, 12, 15, 17, 19]), Candidate: [ 2  1  2 -1  1  1  1  1  0  1  0  2  0  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  1  0  0 -1  1 -1  0  1 -1  0  0  0] (Indices: [3, 9, 10, 11, 13, 16]), Candidate: [ 2  1  2 -1  1  1  1  0  2  1  0  0  2  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  1  0 -1  0  1 -1  0  1 -1  1 -1  0] (Indices: [3, 9, 10, 13, 16, 18]), Candidate: [ 2  1  2 -1  1  1  1  0  2  1 -1  1  2  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 30400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  1 -1  1 -1  1  0 -1  0  0  0  1 -1] (Indices: [3, 9, 11, 13, 14, 19]), Candidate: [ 2  1  2 -1  1  1  1  0  2  0  1  0  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 30450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  1 -1  0  1 -1  1 -1  1  0 -1  0  0] (Indices: [3, 9, 12, 14, 16, 17]), Candidate: [ 2  1  2 -1  1  1  1  0  2  0  0  2  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 30500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  1 -1  0  0  0  0  0  1  0  0  0 -1] (Indices: [3, 9, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  1  1  0  2  0  0  1  1  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  0  1  0 -1  0  0  1 -1  1  0 -1  0] (Indices: [3, 10, 11, 15, 17, 18]), Candidate: [ 2  1  2 -1  1  1  1  0  1  2  0  0  1  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  0  1 -1  0  1  0 -1  0  1 -1  1 -1] (Indices: [3, 10, 13, 14, 17, 19]), Candidate: [ 2  1  2 -1  1  1  1  0  1  2 -1  1  2  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 30650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  0  0  1  0 -1  1 -1  0  1 -1  1 -1] (Indices: [3, 11, 12, 14, 17, 19]), Candidate: [ 2  1  2 -1  1  1  1  0  1  1  1  1  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 30700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  0  0  0  1  0  0  0 -1  0  0  1 -1] (Indices: [3, 12, 13, 14, 15, 19]), Candidate: [ 2  1  2 -1  1  1  1  0  1  1  0  2  1  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  0  0  0  0  0  1  0 -1  1  0  0 -1] (Indices: [3, 14, 15, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  1  1  0  1  1  0  1  1  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  0  0  0  0  1 -1  0  1 -1  0  0  0] (Indices: [4, 5, 6, 7, 13, 16]), Candidate: [ 2  1  1  1  1  1  1 -1  1  1  0  1  2  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1 -1  0  0  1 -1  0  0  0  1 -1  0  0] (Indices: [4, 5, 6, 8, 12, 17]), Candidate: [2 1 1 1 1 1 0 1 0 1 0 2 0 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 30900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  1 -1  0  0  1 -1  0  1 -1  0  0  0] (Indices: [4, 5, 6, 9, 13, 16]), Candidate: [2 1 1 1 1 1 0 0 2 0 0 1 2 0 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 30950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  0  1 -1  0  0  0  0  1 -1  1 -1  0] (Indices: [4, 5, 6, 10, 16, 18]), Candidate: [ 2  1  1  1  1  1  0  0  1  2 -1  1  1  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  0  0  0  1 -1  0  0  1 -1  0  1 -1] (Indices: [4, 5, 6, 12, 16, 19]), Candidate: [2 1 1 1 1 1 0 0 1 1 0 2 0 1 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 31050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0 -1  1 -1  1 -1  0  0  0  0  0  0  0] (Indices: [4, 5, 7, 8, 10, 12]), Candidate: [ 2  1  1  1  1  0  2  0  0  2 -1  2  0  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  1  0 -1  0  0  0  0  0  1 -1  0  0] (Indices: [4, 5, 7, 9, 10, 17]), Candidate: [ 2  1  1  1  1  0  2 -1  2  1 -1  1  1  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  0  1 -1  1 -1  0  0  1 -1  0  0  0] (Indices: [4, 5, 7, 10, 12, 16]), Candidate: [ 2  1  1  1  1  0  2 -1  1  2 -1  2  0  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  0  0  1 -1  0  0  0  0  1  0 -1  0] (Indices: [4, 5, 7, 11, 17, 18]), Candidate: [ 2  1  1  1  1  0  2 -1  1  1  1  0  1  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  0  0  0  0  0  0  1  0 -1  1 -1  0] (Indices: [4, 5, 7, 15, 16, 18]), Candidate: [ 2  1  1  1  1  0  2 -1  1  1  0  1  1  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1  0 -1  0  0  0  0  0  1 -1  0  1 -1] (Indices: [4, 5, 8, 9, 16, 19]), Candidate: [2 1 1 1 1 0 1 1 1 0 0 1 1 1 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 31350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1 -1  0  1 -1  1 -1  0  0  1 -1  0  0] (Indices: [4, 5, 8, 11, 13, 17]), Candidate: [2 1 1 1 1 0 1 1 0 1 1 0 2 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 31400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1 -1  0  0  0  1 -1  0  1 -1  0  1 -1] (Indices: [4, 5, 8, 13, 16, 19]), Candidate: [2 1 1 1 1 0 1 1 0 1 0 1 2 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 31450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  1  0 -1  0  0  0  1  0 -1  0  0  0] (Indices: [4, 5, 9, 10, 15, 16]), Candidate: [ 2  1  1  1  1  0  1  0  2  1 -1  1  1  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  1 -1  0  1 -1  0  1 -1  1 -1  0  0] (Indices: [4, 5, 9, 12, 15, 17]), Candidate: [2 1 1 1 1 0 1 0 2 0 0 2 0 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 31550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  0  1  0  0 -1  0  0  0  0  0  1 -1] (Indices: [4, 5, 10, 11, 12, 19]), Candidate: [2 1 1 1 1 0 1 0 1 2 0 1 0 1 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 31600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  0  1 -1  0  1 -1  1 -1  0  1 -1  0] (Indices: [4, 5, 10, 13, 15, 18]), Candidate: [ 2  1  1  1  1  0  1  0  1  2 -1  1  2  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  0  0  1 -1  1  0 -1  1 -1  0  0  0] (Indices: [4, 5, 11, 13, 14, 16]), Candidate: [ 2  1  1  1  1  0  1  0  1  1  1  0  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  0  0  0  1 -1  1  0 -1  1 -1  0  0] (Indices: [4, 5, 12, 14, 15, 17]), Candidate: [2 1 1 1 1 0 1 0 1 1 0 2 0 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 31750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  0  0  0  0  0  0  1  0  0 -1  1 -1] (Indices: [4, 5, 15, 16, 17, 19]), Candidate: [2 1 1 1 1 0 1 0 1 1 0 1 1 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 31800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0 -1  0  0  0  0  0  1 -1  1 -1  0  0] (Indices: [4, 6, 7, 8, 15, 17]), Candidate: [2 1 1 1 0 2 1 0 0 1 0 1 1 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 31850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  1 -1  0  0  0  0  0  1 -1  0  1 -1] (Indices: [4, 6, 7, 9, 16, 19]), Candidate: [ 2  1  1  1  0  2  1 -1  2  0  0  1  1  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  0  0  1 -1  1 -1  0  0  1 -1  0  0] (Indices: [4, 6, 7, 11, 13, 17]), Candidate: [ 2  1  1  1  0  2  1 -1  1  1  1  0  2  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  0  0  0  0  1 -1  0  1 -1  0  1 -1] (Indices: [4, 6, 7, 13, 16, 19]), Candidate: [ 2  1  1  1  0  2  1 -1  1  1  0  1  2  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1  0 -1  0  0  1 -1  0  1 -1  0  0  0] (Indices: [4, 6, 8, 9, 13, 16]), Candidate: [2 1 1 1 0 2 0 1 1 0 0 1 2 0 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 32050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1 -1  1 -1  0  0  0  0  1 -1  1 -1  0] (Indices: [4, 6, 8, 10, 16, 18]), Candidate: [ 2  1  1  1  0  2  0  1  0  2 -1  1  1  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1 -1  0  0  1 -1  0  0  1 -1  0  1 -1] (Indices: [4, 6, 8, 12, 16, 19]), Candidate: [2 1 1 1 0 2 0 1 0 1 0 2 0 1 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 32150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  1  0 -1  1 -1  0  0  1 -1  0  0  0] (Indices: [4, 6, 9, 10, 12, 16]), Candidate: [ 2  1  1  1  0  2  0  0  2  1 -1  2  0  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  1 -1  1 -1  0  0  0  0  1  0 -1  0] (Indices: [4, 6, 9, 11, 17, 18]), Candidate: [2 1 1 1 0 2 0 0 2 0 1 0 1 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 32250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  1 -1  0  0  0  0  1  0 -1  1 -1  0] (Indices: [4, 6, 9, 15, 16, 18]), Candidate: [2 1 1 1 0 2 0 0 2 0 0 1 1 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 32300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  0  1 -1  1 -1  0  1 -1  0  1 -1  0] (Indices: [4, 6, 10, 12, 15, 18]), Candidate: [ 2  1  1  1  0  2  0  0  1  2 -1  2  0  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  0  0  1  0 -1  1 -1  1 -1  0  0  0] (Indices: [4, 6, 11, 12, 14, 16]), Candidate: [ 2  1  1  1  0  2  0  0  1  1  1  1  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  0  0  0  1  0  0 -1  1 -1  0  0  0] (Indices: [4, 6, 12, 13, 14, 16]), Candidate: [ 2  1  1  1  0  2  0  0  1  1  0  2  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  0  0  0  0  1 -1  0  1  0  0 -1  0] (Indices: [4, 6, 13, 16, 17, 18]), Candidate: [2 1 1 1 0 2 0 0 1 1 0 1 2 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 32500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0  0 -1  0  0  0  1 -1  1 -1  0  0  0] (Indices: [4, 7, 8, 9, 14, 16]), Candidate: [ 2  1  1  1  0  1  2  0  1  0  0  1  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0 -1  0  1  0  0 -1  0  0  0  0  0  0] (Indices: [4, 7, 8, 11, 12, 13]), Candidate: [2 1 1 1 0 1 2 0 0 1 1 1 1 0 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 32600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0 -1  0  0  0  1  0 -1  1 -1  0  0  0] (Indices: [4, 7, 8, 13, 14, 16]), Candidate: [ 2  1  1  1  0  1  2  0  0  1  0  1  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  1  0 -1  0  1 -1  1 -1  0  0  0  0] (Indices: [4, 7, 9, 10, 13, 15]), Candidate: [ 2  1  1  1  0  1  2 -1  2  1 -1  1  2  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  1 -1  0  1  0 -1  0  1 -1  0  0  0] (Indices: [4, 7, 9, 12, 13, 16]), Candidate: [ 2  1  1  1  0  1  2 -1  2  0  0  2  1  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  1 -1  0  0  0  0  0  1  0  0 -1  0] (Indices: [4, 7, 9, 16, 17, 18]), Candidate: [ 2  1  1  1  0  1  2 -1  2  0  0  1  1  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  0  1 -1  1 -1  0  0  0  1  0 -1  0] (Indices: [4, 7, 10, 12, 17, 18]), Candidate: [ 2  1  1  1  0  1  2 -1  1  2 -1  2  0  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  0  0  1  0 -1  0  1 -1  1 -1  0  0] (Indices: [4, 7, 11, 12, 15, 17]), Candidate: [ 2  1  1  1  0  1  2 -1  1  1  1  1  0  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  0  0  0  1  0 -1  1 -1  1 -1  0  0] (Indices: [4, 7, 12, 13, 15, 17]), Candidate: [ 2  1  1  1  0  1  2 -1  1  1  0  2  1  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  0  0  0  0  0  1  0  0 -1  1 -1  0] (Indices: [4, 7, 14, 15, 16, 18]), Candidate: [ 2  1  1  1  0  1  2 -1  1  1  0  1  1  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1  0 -1  1  0  0 -1  0  0  0  0  0  0] (Indices: [4, 8, 9, 11, 12, 13]), Candidate: [2 1 1 1 0 1 1 1 1 0 1 1 1 0 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 33050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1  0 -1  0  0  1  0 -1  1 -1  0  0  0] (Indices: [4, 8, 9, 13, 14, 16]), Candidate: [ 2  1  1  1  0  1  1  1  1  0  0  1  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1 -1  1  0 -1  0  1 -1  0  0  1 -1  0] (Indices: [4, 8, 10, 11, 14, 18]), Candidate: [ 2  1  1  1  0  1  1  1  0  2  0  0  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1 -1  1 -1  0  0  1  0 -1  0  1 -1  0] (Indices: [4, 8, 10, 14, 15, 18]), Candidate: [ 2  1  1  1  0  1  1  1  0  2 -1  1  1  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1 -1  0  1 -1  1 -1  0  1 -1  0  1 -1] (Indices: [4, 8, 11, 13, 16, 19]), Candidate: [2 1 1 1 0 1 1 1 0 1 1 0 2 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 33250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1 -1  0  0  1 -1  0  1  0 -1  1 -1  0] (Indices: [4, 8, 12, 15, 16, 18]), Candidate: [2 1 1 1 0 1 1 1 0 1 0 2 0 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 33300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  1  0  0  0 -1  0  0  0  0  0  1 -1] (Indices: [4, 9, 10, 11, 12, 19]), Candidate: [2 1 1 1 0 1 1 0 2 1 0 1 0 1 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 33350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  1  0 -1  0  1 -1  1 -1  0  1 -1  0] (Indices: [4, 9, 10, 13, 15, 18]), Candidate: [ 2  1  1  1  0  1  1  0  2  1 -1  1  2  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  1 -1  1 -1  1  0 -1  1 -1  0  0  0] (Indices: [4, 9, 11, 13, 14, 16]), Candidate: [ 2  1  1  1  0  1  1  0  2  0  1  0  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  1 -1  0  1 -1  1  0 -1  1 -1  0  0] (Indices: [4, 9, 12, 14, 15, 17]), Candidate: [2 1 1 1 0 1 1 0 2 0 0 2 0 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 33500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  1 -1  0  0  0  0  1  0  0 -1  1 -1] (Indices: [4, 9, 15, 16, 17, 19]), Candidate: [2 1 1 1 0 1 1 0 2 0 0 1 1 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 33550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  0  1  0 -1  0  0  1  0  0 -1  0  0] (Indices: [4, 10, 11, 15, 16, 17]), Candidate: [2 1 1 1 0 1 1 0 1 2 0 0 1 1 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 33600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  0  1 -1  0  1  0 -1  1 -1  1 -1  0] (Indices: [4, 10, 13, 14, 16, 18]), Candidate: [ 2  1  1  1  0  1  1  0  1  2 -1  1  2  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 33650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  0  0  1  0 -1  1 -1  1 -1  1 -1  0] (Indices: [4, 11, 12, 14, 16, 18]), Candidate: [ 2  1  1  1  0  1  1  0  1  1  1  1  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  0  0  0  1  0  0  0  0 -1  0  0  0] (Indices: [4, 12, 13, 14, 15, 16]), Candidate: [2 1 1 1 0 1 1 0 1 1 0 2 1 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 33750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  0  0  0  0  0  1  0  0  0  0 -1  0] (Indices: [4, 14, 15, 16, 17, 18]), Candidate: [2 1 1 1 0 1 1 0 1 1 0 1 1 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 33800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0 -1  0  0  0  0  1 -1  0  0  0  1 -1] (Indices: [5, 6, 7, 8, 14, 19]), Candidate: [ 2  1  1  0  2  1  1  0  0  1  0  1  1  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  1 -1  0  0  0  0  0  1  0 -1  0  0] (Indices: [5, 6, 7, 9, 16, 17]), Candidate: [ 2  1  1  0  2  1  1 -1  2  0  0  1  1  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  0  0  1 -1  1 -1  1 -1  0  0  0  0] (Indices: [5, 6, 7, 11, 13, 15]), Candidate: [ 2  1  1  0  2  1  1 -1  1  1  1  0  2  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  0  0  0  0  1 -1  0  1  0 -1  0  0] (Indices: [5, 6, 7, 13, 16, 17]), Candidate: [ 2  1  1  0  2  1  1 -1  1  1  0  1  2  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1  0 -1  0  0  1  0 -1  0  0  0  0  0] (Indices: [5, 6, 8, 9, 13, 14]), Candidate: [ 2  1  1  0  2  1  0  1  1  0  0  1  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1 -1  1 -1  0  0  0  1 -1  0  0  1 -1] (Indices: [5, 6, 8, 10, 15, 19]), Candidate: [ 2  1  1  0  2  1  0  1  0  2 -1  1  1  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1 -1  0  0  1 -1  0  0  1  0 -1  0  0] (Indices: [5, 6, 8, 12, 16, 17]), Candidate: [2 1 1 0 2 1 0 1 0 1 0 2 0 1 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 34150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  1  0 -1  1 -1  1 -1  0  0  0  0  0] (Indices: [5, 6, 9, 10, 12, 14]), Candidate: [ 2  1  1  0  2  1  0  0  2  1 -1  2  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  1 -1  1 -1  0  0  0  1 -1  1 -1  0] (Indices: [5, 6, 9, 11, 16, 18]), Candidate: [2 1 1 0 2 1 0 0 2 0 1 0 1 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 34250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  1 -1  0  0  0  1 -1  0  0  1  0 -1] (Indices: [5, 6, 9, 14, 18, 19]), Candidate: [ 2  1  1  0  2  1  0  0  2  0  0  1  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  0  1 -1  1 -1  0  1  0 -1  0  0  0] (Indices: [5, 6, 10, 12, 15, 16]), Candidate: [ 2  1  1  0  2  1  0  0  1  2 -1  2  0  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  0  0  1  0  0 -1  0  0  0  0  1 -1] (Indices: [5, 6, 11, 12, 13, 19]), Candidate: [2 1 1 0 2 1 0 0 1 1 1 1 1 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 34400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  0  0  1 -1  0  0  0  0  1  0  0 -1] (Indices: [5, 6, 11, 17, 18, 19]), Candidate: [2 1 1 0 2 1 0 0 1 1 1 0 1 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 34450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  0  0  0  0  1 -1  1 -1  1 -1  1 -1] (Indices: [5, 6, 13, 15, 17, 19]), Candidate: [2 1 1 0 2 1 0 0 1 1 0 1 2 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 34500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0  0 -1  0  0  1 -1  0  0  0  0  1 -1] (Indices: [5, 7, 8, 9, 13, 19]), Candidate: [2 1 1 0 2 0 2 0 1 0 0 1 2 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 34550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0 -1  1 -1  0  0  0  0  0  1 -1  1 -1] (Indices: [5, 7, 8, 10, 17, 19]), Candidate: [ 2  1  1  0  2  0  2  0  0  2 -1  1  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0 -1  0  0  1 -1  0  0  0  0  1  0 -1] (Indices: [5, 7, 8, 12, 18, 19]), Candidate: [2 1 1 0 2 0 2 0 0 1 0 2 0 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 34650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  1  0 -1  1 -1  0  0  0  0  0  1 -1] (Indices: [5, 7, 9, 10, 12, 19]), Candidate: [ 2  1  1  0  2  0  2 -1  2  1 -1  2  0  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  1 -1  0  1  0  0 -1  0  0  0  0  0] (Indices: [5, 7, 9, 12, 13, 14]), Candidate: [ 2  1  1  0  2  0  2 -1  2  0  0  2  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  1 -1  0  0  0  0  1 -1  1 -1  1 -1] (Indices: [5, 7, 9, 15, 17, 19]), Candidate: [ 2  1  1  0  2  0  2 -1  2  0  0  1  1  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  0  1 -1  1 -1  0  0  1 -1  1 -1  0] (Indices: [5, 7, 10, 12, 16, 18]), Candidate: [ 2  1  1  0  2  0  2 -1  1  2 -1  2  0  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  0  0  1  0 -1  1 -1  0  0  0  1 -1] (Indices: [5, 7, 11, 12, 14, 19]), Candidate: [ 2  1  1  0  2  0  2 -1  1  1  1  1  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  0  0  0  1  0  0 -1  0  0  0  1 -1] (Indices: [5, 7, 12, 13, 14, 19]), Candidate: [ 2  1  1  0  2  0  2 -1  1  1  0  2  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  0  0  0  0  1 -1  0  0  1  0  0 -1] (Indices: [5, 7, 13, 17, 18, 19]), Candidate: [ 2  1  1  0  2  0  2 -1  1  1  0  1  2  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1  0  0 -1  0  0  0  0  0  1 -1  1 -1] (Indices: [5, 8, 9, 10, 17, 19]), Candidate: [ 2  1  1  0  2  0  1  1  1  1 -1  1  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1  0 -1  0  1 -1  0  0  0  0  1  0 -1] (Indices: [5, 8, 9, 12, 18, 19]), Candidate: [2 1 1 0 2 0 1 1 1 0 0 2 0 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 35100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1 -1  1  0 -1  0  1 -1  1 -1  0  0  0] (Indices: [5, 8, 10, 11, 14, 16]), Candidate: [ 2  1  1  0  2  0  1  1  0  2  0  0  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1 -1  1 -1  0  0  1  0  0 -1  0  0  0] (Indices: [5, 8, 10, 14, 15, 16]), Candidate: [ 2  1  1  0  2  0  1  1  0  2 -1  1  1  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1 -1  0  1 -1  1 -1  0  1  0 -1  0  0] (Indices: [5, 8, 11, 13, 16, 17]), Candidate: [2 1 1 0 2 0 1 1 0 1 1 0 2 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 35250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1 -1  0  0  1 -1  1 -1  0  0  1  0 -1] (Indices: [5, 8, 12, 14, 18, 19]), Candidate: [ 2  1  1  0  2  0  1  1  0  1  0  2  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  1  0  0  0 -1  0  0  0  1 -1  0  0] (Indices: [5, 9, 10, 11, 12, 17]), Candidate: [2 1 1 0 2 0 1 0 2 1 0 1 0 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 35350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  1  0 -1  0  1 -1  1  0 -1  0  0  0] (Indices: [5, 9, 10, 13, 15, 16]), Candidate: [ 2  1  1  0  2  0  1  0  2  1 -1  1  2  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  1 -1  1  0 -1  0  0  0  0  1  0 -1] (Indices: [5, 9, 11, 12, 18, 19]), Candidate: [2 1 1 0 2 0 1 0 2 0 1 1 0 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 35450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  1 -1  0  1  0 -1  0  0  0  1  0 -1] (Indices: [5, 9, 12, 13, 18, 19]), Candidate: [2 1 1 0 2 0 1 0 2 0 0 2 1 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 35500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  1 -1  0  0  0  1 -1  0  1  0  0 -1] (Indices: [5, 9, 14, 17, 18, 19]), Candidate: [ 2  1  1  0  2  0  1  0  2  0  0  1  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  0  1  0 -1  0  1 -1  0  1 -1  1 -1] (Indices: [5, 10, 11, 14, 17, 19]), Candidate: [ 2  1  1  0  2  0  1  0  1  2  0  0  1  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  0  1 -1  0  1  0  0 -1  0  0  1 -1] (Indices: [5, 10, 13, 14, 15, 19]), Candidate: [ 2  1  1  0  2  0  1  0  1  2 -1  1  2  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  0  0  1  0 -1  1  0 -1  0  0  1 -1] (Indices: [5, 11, 12, 14, 15, 19]), Candidate: [2 1 1 0 2 0 1 0 1 1 1 1 0 2 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 35700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  0  0  1 -1  0  0  1 -1  1  0  0 -1] (Indices: [5, 11, 15, 17, 18, 19]), Candidate: [2 1 1 0 2 0 1 0 1 1 1 0 1 1 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 35750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  0  0  0  0  1 -1  1 -1  1  0  0 -1] (Indices: [5, 13, 15, 17, 18, 19]), Candidate: [2 1 1 0 2 0 1 0 1 1 0 1 2 0 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 35800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0  0 -1  0  0  0  0  0  0  1  0 -1  0] (Indices: [6, 7, 8, 9, 17, 18]), Candidate: [2 1 1 0 1 2 1 0 1 0 0 1 1 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 35850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0 -1  0  1 -1  1 -1  0  0  0  1 -1  0] (Indices: [6, 7, 8, 11, 13, 18]), Candidate: [2 1 1 0 1 2 1 0 0 1 1 0 2 0 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 35900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0 -1  0  0  0  1 -1  0  0  1  0 -1  0] (Indices: [6, 7, 8, 13, 17, 18]), Candidate: [2 1 1 0 1 2 1 0 0 1 0 1 2 0 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 35950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  1  0 -1  0  0  0  1 -1  1 -1  0  0] (Indices: [6, 7, 9, 10, 15, 17]), Candidate: [ 2  1  1  0  1  2  1 -1  2  1 -1  1  1  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  1 -1  0  1 -1  0  1 -1  0  1 -1  0] (Indices: [6, 7, 9, 12, 15, 18]), Candidate: [ 2  1  1  0  1  2  1 -1  2  0  0  2  0  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  0  1  0 -1  1  0 -1  0  0  0  0  0] (Indices: [6, 7, 10, 11, 13, 14]), Candidate: [ 2  1  1  0  1  2  1 -1  1  2  0  0  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  0  1 -1  0  1 -1  1 -1  0  0  1 -1] (Indices: [6, 7, 10, 13, 15, 19]), Candidate: [ 2  1  1  0  1  2  1 -1  1  2 -1  1  2  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  0  0  1 -1  1  0 -1  0  1 -1  0  0] (Indices: [6, 7, 11, 13, 14, 17]), Candidate: [ 2  1  1  0  1  2  1 -1  1  1  1  0  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  0  0  0  1 -1  1  0 -1  0  1 -1  0] (Indices: [6, 7, 12, 14, 15, 18]), Candidate: [ 2  1  1  0  1  2  1 -1  1  1  0  2  0  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  0  0  0  0  0  0  1  0 -1  1  0 -1] (Indices: [6, 7, 15, 16, 18, 19]), Candidate: [ 2  1  1  0  1  2  1 -1  1  1  0  1  1  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1  0 -1  1 -1  1 -1  0  0  0  1 -1  0] (Indices: [6, 8, 9, 11, 13, 18]), Candidate: [2 1 1 0 1 2 0 1 1 0 1 0 2 0 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 36350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1  0 -1  0  0  1 -1  0  0  1  0 -1  0] (Indices: [6, 8, 9, 13, 17, 18]), Candidate: [2 1 1 0 1 2 0 1 1 0 0 1 2 0 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 36400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1 -1  1  0 -1  0  0  0  0  0  1  0 -1] (Indices: [6, 8, 10, 11, 18, 19]), Candidate: [2 1 1 0 1 2 0 1 0 2 0 0 1 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 36450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1 -1  1 -1  0  0  0  1 -1  1  0 -1  0] (Indices: [6, 8, 10, 15, 17, 18]), Candidate: [ 2  1  1  0  1  2  0  1  0  2 -1  1  1  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1 -1  0  1 -1  0  1 -1  0  1  0 -1  0] (Indices: [6, 8, 11, 14, 17, 18]), Candidate: [ 2  1  1  0  1  2  0  1  0  1  1  0  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1 -1  0  0  0  1  0  0 -1  0  1 -1  0] (Indices: [6, 8, 13, 14, 15, 18]), Candidate: [2 1 1 0 1 2 0 1 0 1 0 1 2 1 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 36600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  1  0  0 -1  0  1 -1  0  0  0  1 -1] (Indices: [6, 9, 10, 11, 14, 19]), Candidate: [ 2  1  1  0  1  2  0  0  2  1  0  0  1  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  1  0 -1  0  0  1  0 -1  0  0  1 -1] (Indices: [6, 9, 10, 14, 15, 19]), Candidate: [ 2  1  1  0  1  2  0  0  2  1 -1  1  1  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  1 -1  1 -1  1 -1  0  0  1  0 -1  0] (Indices: [6, 9, 11, 13, 17, 18]), Candidate: [2 1 1 0 1 2 0 0 2 0 1 0 2 0 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 36750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  1 -1  0  1 -1  0  1  0 -1  0  1 -1] (Indices: [6, 9, 12, 15, 16, 19]), Candidate: [2 1 1 0 1 2 0 0 2 0 0 2 0 1 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 36800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  0  1  0  0 -1  1 -1  1 -1  0  0  0] (Indices: [6, 10, 11, 12, 14, 16]), Candidate: [ 2  1  1  0  1  2  0  0  1  2  0  1  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  0  1 -1  1  0  0 -1  1 -1  0  0  0] (Indices: [6, 10, 12, 13, 14, 16]), Candidate: [ 2  1  1  0  1  2  0  0  1  2 -1  2  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  0  1 -1  0  1 -1  0  1  0  0 -1  0] (Indices: [6, 10, 13, 16, 17, 18]), Candidate: [ 2  1  1  0  1  2  0  0  1  2 -1  1  2  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  0  0  1  0 -1  0  0  1  0  0 -1  0] (Indices: [6, 11, 12, 16, 17, 18]), Candidate: [2 1 1 0 1 2 0 0 1 1 1 1 0 1 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 37000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  0  0  0  1  0 -1  1  0 -1  1 -1  0] (Indices: [6, 12, 13, 15, 16, 18]), Candidate: [2 1 1 0 1 2 0 0 1 1 0 2 1 0 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 37050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0  0  0  0 -1  0  0  0  0  1 -1  0  0] (Indices: [7, 8, 9, 10, 11, 17]), Candidate: [2 1 1 0 1 1 2 0 1 1 0 0 1 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 37100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0  0 -1  1 -1  0  0  1 -1  1 -1  0  0] (Indices: [7, 8, 9, 11, 15, 17]), Candidate: [2 1 1 0 1 1 2 0 1 0 1 0 1 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 37150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0  0 -1  0  0  0  1 -1  1 -1  1 -1  0] (Indices: [7, 8, 9, 14, 16, 18]), Candidate: [ 2  1  1  0  1  1  2  0  1  0  0  1  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0 -1  1 -1  1 -1  1 -1  1 -1  0  0  0] (Indices: [7, 8, 10, 12, 14, 16]), Candidate: [ 2  1  1  0  1  1  2  0  0  2 -1  2  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0 -1  0  1  0  0 -1  1 -1  0  0  0  0] (Indices: [7, 8, 11, 12, 13, 15]), Candidate: [2 1 1 0 1 1 2 0 0 1 1 1 1 0 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 37300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0 -1  0  1 -1  0  0  1 -1  0  1  0 -1] (Indices: [7, 8, 11, 15, 18, 19]), Candidate: [2 1 1 0 1 1 2 0 0 1 1 0 1 1 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 37350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0 -1  0  0  0  1 -1  1  0  0 -1  0  0] (Indices: [7, 8, 13, 15, 16, 17]), Candidate: [2 1 1 0 1 1 2 0 0 1 0 1 2 0 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 37400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  1  0  0 -1  0  0  0  0  1  0 -1  0] (Indices: [7, 9, 10, 11, 17, 18]), Candidate: [ 2  1  1  0  1  1  2 -1  2  1  0  0  1  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  1  0 -1  0  0  0  1  0 -1  1 -1  0] (Indices: [7, 9, 10, 15, 16, 18]), Candidate: [ 2  1  1  0  1  1  2 -1  2  1 -1  1  1  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  1 -1  1 -1  0  1 -1  1 -1  1 -1  0] (Indices: [7, 9, 11, 14, 16, 18]), Candidate: [ 2  1  1  0  1  1  2 -1  2  0  1  0  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  1 -1  0  0  1  0  0  0 -1  0  0  0] (Indices: [7, 9, 13, 14, 15, 16]), Candidate: [ 2  1  1  0  1  1  2 -1  2  0  0  1  2  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  0  1  0  0 -1  0  0  1  0 -1  0  0] (Indices: [7, 10, 11, 12, 16, 17]), Candidate: [ 2  1  1  0  1  1  2 -1  1  2  0  1  0  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  0  1 -1  1  0 -1  0  1  0 -1  0  0] (Indices: [7, 10, 12, 13, 16, 17]), Candidate: [ 2  1  1  0  1  1  2 -1  1  2 -1  2  1  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  0  1 -1  0  0  1  0 -1  1 -1  1 -1] (Indices: [7, 10, 14, 15, 17, 19]), Candidate: [ 2  1  1  0  1  1  2 -1  1  2 -1  1  1  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  0  0  1 -1  1  0 -1  1  0 -1  0  0] (Indices: [7, 11, 13, 14, 16, 17]), Candidate: [ 2  1  1  0  1  1  2 -1  1  1  1  0  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  0  0  0  1  0 -1  0  0  1  0  0 -1] (Indices: [7, 12, 13, 17, 18, 19]), Candidate: [ 2  1  1  0  1  1  2 -1  1  1  0  2  1  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1  0  0  0 -1  0  1  0 -1  0  0  0  0] (Indices: [8, 9, 10, 11, 14, 15]), Candidate: [2 1 1 0 1 1 1 1 1 1 0 0 1 2 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 37900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1  0  0 -1  0  1 -1  0  0  0  1  0 -1] (Indices: [8, 9, 10, 13, 18, 19]), Candidate: [ 2  1  1  0  1  1  1  1  1  1 -1  1  2  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1  0 -1  1 -1  1 -1  1 -1  0  0  1 -1] (Indices: [8, 9, 11, 13, 15, 19]), Candidate: [2 1 1 0 1 1 1 1 1 0 1 0 2 0 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 38000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1  0 -1  0  1 -1  1 -1  0  1 -1  1 -1] (Indices: [8, 9, 12, 14, 17, 19]), Candidate: [ 2  1  1  0  1  1  1  1  1  0  0  2  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1 -1  1  0  0  0 -1  0  0  1 -1  0  0] (Indices: [8, 10, 11, 12, 13, 17]), Candidate: [2 1 1 0 1 1 1 1 0 2 0 1 1 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 38100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1 -1  1  0 -1  0  0  0  1  0 -1  1 -1] (Indices: [8, 10, 11, 16, 17, 19]), Candidate: [2 1 1 0 1 1 1 1 0 2 0 0 1 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 38150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1 -1  1 -1  0  1 -1  1  0 -1  0  1 -1] (Indices: [8, 10, 13, 15, 16, 19]), Candidate: [ 2  1  1  0  1  1  1  1  0  2 -1  1  2  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1 -1  0  1  0 -1  0  1  0 -1  0  1 -1] (Indices: [8, 11, 12, 15, 16, 19]), Candidate: [2 1 1 0 1 1 1 1 0 1 1 1 0 1 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 38250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1 -1  0  0  1  0  0 -1  0  1  0 -1  0] (Indices: [8, 12, 13, 14, 17, 18]), Candidate: [ 2  1  1  0  1  1  1  1  0  1  0  2  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  1  0  0  0  0 -1  1 -1  0  0  0  0] (Indices: [9, 10, 11, 12, 13, 15]), Candidate: [2 1 1 0 1 1 1 0 2 1 0 1 1 0 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 38350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  1  0  0 -1  0  0  1 -1  0  1  0 -1] (Indices: [9, 10, 11, 15, 18, 19]), Candidate: [2 1 1 0 1 1 1 0 2 1 0 0 1 1 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 38400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  1  0 -1  0  1 -1  1  0  0 -1  0  0] (Indices: [9, 10, 13, 15, 16, 17]), Candidate: [ 2  1  1  0  1  1  1  0  2  1 -1  1  2  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  1 -1  1  0 -1  0  1  0  0 -1  0  0] (Indices: [9, 11, 12, 15, 16, 17]), Candidate: [2 1 1 0 1 1 1 0 2 0 1 1 0 1 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 38500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  1 -1  0  1  0  0 -1  1 -1  1 -1  0] (Indices: [9, 12, 13, 14, 16, 18]), Candidate: [ 2  1  1  0  1  1  1  0  2  0  0  2  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  1 -1  0  0  0  0  1  0  0  0  0 -1] (Indices: [9, 15, 16, 17, 18, 19]), Candidate: [2 1 1 0 1 1 1 0 2 0 0 1 1 1 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 38600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0  1  0 -1  1 -1  1 -1  1 -1  1 -1] (Indices: [10, 11, 13, 15, 17, 19]), Candidate: [2 1 1 0 1 1 1 0 1 2 0 0 2 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 38650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0  1 -1  1 -1  1 -1  0  1  0  0 -1] (Indices: [10, 12, 14, 17, 18, 19]), Candidate: [ 2  1  1  0  1  1  1  0  1  2 -1  2  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0  0  1  0 -1  1  0 -1  1  0 -1  0] (Indices: [11, 12, 14, 15, 17, 18]), Candidate: [2 1 1 0 1 1 1 0 1 1 1 1 0 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 38750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0  0  0  1 -1  1  0  0 -1  1  0 -1] (Indices: [12, 14, 15, 16, 18, 19]), Candidate: [2 1 1 0 1 1 1 0 1 1 0 2 0 2 0 1 0 2 1 5]
 -> Valid neighbor added.
Finished generating neighbors. Total valid neighbors found: 14018
  Size of neighborhood t=6: 14018
  Using 'fork' start method for multiprocessing.
  No improvement found for t=6 after processing 14018 neighbors.
No improving solution found or error occurred for t=6.

Attempting neighborhood t=7 (current best cost: 98.4663)
  Exploring neighborhood t=7 in parallel (current cost: 98.4663)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Attempt 50: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1 -1  0  0  0  0  0  0  0  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 8, 19]), Candidate: [2 1 1 0 0 1 1 1 0 1 0 1 1 1 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  0  0  0  0  0  0  0  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 16, 17]), Candidate: [2 1 1 0 0 1 1 0 1 1 0 1 1 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  1 -1  0  0  0  0  0  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 5, 9, 18]), Candidate: [ 2  1  1 -1  2  0  1  0  2  0  0  1  1  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  0  0  1 -1  0  0  0  0  0  0  0  1] (Indices: [0, 1, 2, 3, 6, 7, 11]), Candidate: [ 2  1  1 -1  1  2  1 -1  1  1  1  0  1  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  0  0  0  1 -1  0  0  1 -1  0  0  1] (Indices: [0, 1, 2, 3, 6, 12, 16]), Candidate: [ 2  1  1 -1  1  2  0  0  1  1  0  2  0  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  0  1 -1  0  0  0  1 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 7, 10, 15]), Candidate: [ 2  1  1 -1  1  1  2 -1  1  2 -1  1  1  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1  0 -1  0  0  0  0  0  0  0  0  1  0] (Indices: [0, 1, 2, 3, 8, 9, 19]), Candidate: [ 2  1  1 -1  1  1  1  1  1  0  0  1  1  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  1  0 -1  0  0  0  1 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 9, 10, 15]), Candidate: [ 2  1  1 -1  1  1  1  0  2  1 -1  1  1  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  0  1 -1  1 -1  1 -1  0  0  0  0  1] (Indices: [0, 1, 2, 3, 10, 12, 14]), Candidate: [ 2  1  1 -1  1  1  1  0  1  2 -1  2  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  0  0  1 -1  0  0  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 3, 11, 16, 18]), Candidate: [ 2  1  1 -1  1  1  1  0  1  1  1  0  1  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  0  0  0  0  0  1 -1  0  0  1  0  0] (Indices: [0, 1, 2, 3, 14, 18, 19]), Candidate: [ 2  1  1 -1  1  1  1  0  1  1  0  1  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  1 -1  0  0  1 -1  0  0  0  0  0  1] (Indices: [0, 1, 2, 4, 5, 9, 13]), Candidate: [2 1 0 1 1 0 1 0 2 0 0 1 2 0 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  0  0  0  0  0  0  0  0  1 -1  1  0] (Indices: [0, 1, 2, 4, 5, 17, 19]), Candidate: [2 1 0 1 1 0 1 0 1 1 0 1 1 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  0  0  1 -1  0  0  0  0  0  1 -1  1] (Indices: [0, 1, 2, 4, 6, 11, 18]), Candidate: [2 1 0 1 0 2 0 0 1 1 1 0 1 1 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  1 -1  0  0  0  0  0  0  0  0  1  0] (Indices: [0, 1, 2, 4, 7, 9, 19]), Candidate: [ 2  1  0  1  0  1  2 -1  2  0  0  1  1  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1  0 -1  0  0  0  1 -1  0  0  0  0  1] (Indices: [0, 1, 2, 4, 8, 9, 14]), Candidate: [ 2  1  0  1  0  1  1  1  1  0  0  1  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1 -1  0  0  0  0  0  0  0  0  1  0  0] (Indices: [0, 1, 2, 4, 8, 18, 19]), Candidate: [2 1 0 1 0 1 1 1 0 1 0 1 1 1 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  0  1  0 -1  0  0  0  1 -1  0  0  1] (Indices: [0, 1, 2, 4, 10, 11, 16]), Candidate: [2 1 0 1 0 1 1 0 1 2 0 0 1 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  0  0  1 -1  0  0  1  0 -1  0  0  1] (Indices: [0, 1, 2, 4, 11, 15, 16]), Candidate: [2 1 0 1 0 1 1 0 1 1 1 0 1 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 1000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  0  0  0  0  0  1 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 4, 14, 16, 17]), Candidate: [ 2  1  0  1  0  1  1  0  1  1  0  1  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  0  1 -1  1 -1  0  0  0  0  0  0  1] (Indices: [0, 1, 2, 5, 6, 10, 12]), Candidate: [ 2  1  0  0  2  1  0  0  1  2 -1  2  0  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0 -1  0  0  0  0  0  1 -1  0  0  0  1] (Indices: [0, 1, 2, 5, 7, 8, 15]), Candidate: [2 1 0 0 2 0 2 0 0 1 0 1 1 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 1150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  0  0  0  0  0  0  1  0 -1  0  0  1] (Indices: [0, 1, 2, 5, 7, 15, 16]), Candidate: [ 2  1  0  0  2  0  2 -1  1  1  0  1  1  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1 -1  0  0  0  0  1  0 -1  0  0  0  1] (Indices: [0, 1, 2, 5, 8, 14, 15]), Candidate: [2 1 0 0 2 0 1 1 0 1 0 1 1 2 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 1250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  1 -1  0  0  0  0  1  0 -1  0  0  1] (Indices: [0, 1, 2, 5, 9, 15, 16]), Candidate: [2 1 0 0 2 0 1 0 2 0 0 1 1 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 1300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  0  0  1  0 -1  0  0  0  1 -1  0  1] (Indices: [0, 1, 2, 5, 11, 12, 17]), Candidate: [2 1 0 0 2 0 1 0 1 1 1 1 0 1 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 1350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  0  0  0  0  1 -1  1  0 -1  0  0  1] (Indices: [0, 1, 2, 5, 13, 15, 16]), Candidate: [2 1 0 0 2 0 1 0 1 1 0 1 2 0 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 1400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  1 -1  0  0  0  0  0  0  0  0  1  0] (Indices: [0, 1, 2, 6, 7, 9, 19]), Candidate: [ 2  1  0  0  1  2  1 -1  2  0  0  1  1  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1  0 -1  0  0  0  1 -1  0  0  0  0  1] (Indices: [0, 1, 2, 6, 8, 9, 14]), Candidate: [ 2  1  0  0  1  2  0  1  1  0  0  1  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1 -1  0  0  0  0  0  0  0  0  1  0  0] (Indices: [0, 1, 2, 6, 8, 18, 19]), Candidate: [2 1 0 0 1 2 0 1 0 1 0 1 1 1 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 1550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  0  1  0 -1  0  0  0  1 -1  0  0  1] (Indices: [0, 1, 2, 6, 10, 11, 16]), Candidate: [2 1 0 0 1 2 0 0 1 2 0 0 1 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 1600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  0  0  1 -1  0  0  1  0 -1  0  0  1] (Indices: [0, 1, 2, 6, 11, 15, 16]), Candidate: [2 1 0 0 1 2 0 0 1 1 1 0 1 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 1650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  0  0  0  0  0  1 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 6, 14, 16, 17]), Candidate: [ 2  1  0  0  1  2  0  0  1  1  0  1  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0 -1  0  0  0  1  0 -1  0  0  0  0  1] (Indices: [0, 1, 2, 7, 8, 13, 14]), Candidate: [ 2  1  0  0  1  1  2  0  0  1  0  1  2  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  1 -1  0  0  1 -1  0  0  0  0  1  0] (Indices: [0, 1, 2, 7, 9, 13, 19]), Candidate: [ 2  1  0  0  1  1  2 -1  2  0  0  1  2  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  0  1 -1  0  0  0  0  0  1 -1  1  0] (Indices: [0, 1, 2, 7, 10, 17, 19]), Candidate: [ 2  1  0  0  1  1  2 -1  1  2 -1  1  1  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  0  0  0  1 -1  0  0  0  0  1  0  0] (Indices: [0, 1, 2, 7, 12, 18, 19]), Candidate: [ 2  1  0  0  1  1  2 -1  1  1  0  2  0  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1  0 -1  1 -1  0  0  0  0  1 -1  0  1] (Indices: [0, 1, 2, 8, 9, 11, 17]), Candidate: [2 1 0 0 1 1 1 1 1 0 1 0 1 1 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 1950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1 -1  1 -1  0  1 -1  0  0  0  1 -1  1] (Indices: [0, 1, 2, 8, 10, 13, 18]), Candidate: [ 2  1  0  0  1  1  1  1  0  2 -1  1  2  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1 -1  0  0  1  0 -1  0  0  0  0  1  0] (Indices: [0, 1, 2, 8, 12, 13, 19]), Candidate: [2 1 0 0 1 1 1 1 0 1 0 2 1 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 2050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1 -1  0  0  0  0  0  0  0  1  0  0  0] (Indices: [0, 1, 2, 8, 17, 18, 19]), Candidate: [2 1 0 0 1 1 1 1 0 1 0 1 1 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 2100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  1 -1  1 -1  0  1  0 -1  0  0  0  1] (Indices: [0, 1, 2, 9, 11, 14, 15]), Candidate: [2 1 0 0 1 1 1 0 2 0 1 0 1 2 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 2150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  1 -1  0  0  1 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 9, 13, 18, 19]), Candidate: [2 1 0 0 1 1 1 0 2 0 0 1 2 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 2200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  0  1 -1  1  0 -1  1 -1  0  0  0  1] (Indices: [0, 1, 2, 10, 12, 13, 15]), Candidate: [ 2  1  0  0  1  1  1  0  1  2 -1  2  1  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  0  1 -1  0  0  0  1 -1  0  1  0  0] (Indices: [0, 1, 2, 10, 15, 18, 19]), Candidate: [ 2  1  0  0  1  1  1  0  1  2 -1  1  1  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  0  0  1 -1  0  1 -1  0  0  1  0  0] (Indices: [0, 1, 2, 11, 14, 18, 19]), Candidate: [ 2  1  0  0  1  1  1  0  1  1  1  0  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  0  0  0  0  1  0 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 13, 14, 16, 17]), Candidate: [ 2  1  0  0  1  1  1  0  1  1  0  1  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  0  0  0  0  0  1 -1  0  0  0  0  1] (Indices: [0, 1, 3, 4, 5, 7, 14]), Candidate: [ 2  0  2  0  1  0  2 -1  1  1  0  1  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  0  0  0  1 -1  0  0  0  0  0  1  0] (Indices: [0, 1, 3, 4, 5, 12, 19]), Candidate: [2 0 2 0 1 0 1 0 1 1 0 2 0 1 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 2500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  1 -1  0  0  0  0  1 -1  0  0  0  1] (Indices: [0, 1, 3, 4, 6, 9, 15]), Candidate: [2 0 2 0 0 2 0 0 2 0 0 1 1 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 2550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0  0 -1  0  0  0  0  0  0  0  0  0  1] (Indices: [0, 1, 3, 4, 7, 8, 9]), Candidate: [2 0 2 0 0 1 2 0 1 0 0 1 1 1 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 2600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  0  0  0  0  1 -1  0  0  0  0  1  0] (Indices: [0, 1, 3, 4, 7, 13, 19]), Candidate: [ 2  0  2  0  0  1  2 -1  1  1  0  1  2  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1 -1  0  0  0  1  0 -1  0  0  0  0  1] (Indices: [0, 1, 3, 4, 8, 13, 14]), Candidate: [ 2  0  2  0  0  1  1  1  0  1  0  1  2  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  1 -1  0  0  1 -1  0  0  0  0  1  0] (Indices: [0, 1, 3, 4, 9, 13, 19]), Candidate: [2 0 2 0 0 1 1 0 2 0 0 1 2 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 2750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  0  1 -1  0  0  0  0  0  1 -1  1  0] (Indices: [0, 1, 3, 4, 10, 17, 19]), Candidate: [ 2  0  2  0  0  1  1  0  1  2 -1  1  1  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  0  0  0  1 -1  0  0  0  0  1  0  0] (Indices: [0, 1, 3, 4, 12, 18, 19]), Candidate: [2 0 2 0 0 1 1 0 1 1 0 2 0 1 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 2850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1 -1  0  1 -1  0  0  0  0  0  0  0  1] (Indices: [0, 1, 3, 5, 6, 8, 11]), Candidate: [ 2  0  2 -1  2  1  0  1  0  1  1  0  1  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  0  0  0  0  0  1 -1  1 -1  0  0  1] (Indices: [0, 1, 3, 5, 6, 14, 16]), Candidate: [ 2  0  2 -1  2  1  0  0  1  1  0  1  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  0  0  1 -1  0  0  0  0  0  1 -1  1] (Indices: [0, 1, 3, 5, 7, 11, 18]), Candidate: [ 2  0  2 -1  2  0  2 -1  1  1  1  0  1  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1 -1  0  1 -1  1 -1  0  0  0  0  0  1] (Indices: [0, 1, 3, 5, 8, 11, 13]), Candidate: [ 2  0  2 -1  2  0  1  1  0  1  1  0  2  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  1 -1  1 -1  0  0  0  0  0  1 -1  1] (Indices: [0, 1, 3, 5, 9, 11, 18]), Candidate: [ 2  0  2 -1  2  0  1  0  2  0  1  0  1  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  0  1 -1  0  1 -1  0  0  0  0  1  0] (Indices: [0, 1, 3, 5, 10, 13, 19]), Candidate: [ 2  0  2 -1  2  0  1  0  1  2 -1  1  2  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  0  0  0  1 -1  1  0 -1  0  0  0  1] (Indices: [0, 1, 3, 5, 12, 14, 15]), Candidate: [ 2  0  2 -1  2  0  1  0  1  1  0  2  0  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0  0 -1  0  0  0  0  0  0  0  0  0  1] (Indices: [0, 1, 3, 6, 7, 8, 9]), Candidate: [ 2  0  2 -1  1  2  1  0  1  0  0  1  1  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  0  0  0  0  1 -1  0  0  0  0  1  0] (Indices: [0, 1, 3, 6, 7, 13, 19]), Candidate: [ 2  0  2 -1  1  2  1 -1  1  1  0  1  2  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1 -1  0  0  0  1  0 -1  0  0  0  0  1] (Indices: [0, 1, 3, 6, 8, 13, 14]), Candidate: [ 2  0  2 -1  1  2  0  1  0  1  0  1  2  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  1 -1  0  0  1 -1  0  0  0  0  1  0] (Indices: [0, 1, 3, 6, 9, 13, 19]), Candidate: [ 2  0  2 -1  1  2  0  0  2  0  0  1  2  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  0  1 -1  0  0  0  0  0  1 -1  1  0] (Indices: [0, 1, 3, 6, 10, 17, 19]), Candidate: [ 2  0  2 -1  1  2  0  0  1  2 -1  1  1  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  0  0  0  1 -1  0  0  0  0  1  0  0] (Indices: [0, 1, 3, 6, 12, 18, 19]), Candidate: [ 2  0  2 -1  1  2  0  0  1  1  0  2  0  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0 -1  1 -1  0  0  0  1 -1  0  0  0  1] (Indices: [0, 1, 3, 7, 8, 10, 15]), Candidate: [ 2  0  2 -1  1  1  2  0  0  2 -1  1  1  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  1 -1  1  0 -1  0  0  0  0  0  0  1] (Indices: [0, 1, 3, 7, 9, 11, 12]), Candidate: [ 2  0  2 -1  1  1  2 -1  2  0  1  1  0  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  0  1 -1  1 -1  0  0  0  0  0  1  0] (Indices: [0, 1, 3, 7, 10, 12, 19]), Candidate: [ 2  0  2 -1  1  1  2 -1  1  2 -1  2  0  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 3650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  0  0  0  1  0  0 -1  0  0  0  0  1] (Indices: [0, 1, 3, 7, 12, 13, 14]), Candidate: [ 2  0  2 -1  1  1  2 -1  1  1  0  2  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 3700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  0  0  0  0  0  0  1 -1  1 -1  1  0] (Indices: [0, 1, 3, 7, 15, 17, 19]), Candidate: [ 2  0  2 -1  1  1  2 -1  1  1  0  1  1  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1  0 -1  0  0  0  0  0  0  0  1  0  0] (Indices: [0, 1, 3, 8, 9, 18, 19]), Candidate: [ 2  0  2 -1  1  1  1  1  1  0  0  1  1  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1 -1  0  1 -1  0  1  0 -1  0  0  0  1] (Indices: [0, 1, 3, 8, 11, 14, 15]), Candidate: [ 2  0  2 -1  1  1  1  1  0  1  1  0  1  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1 -1  0  0  0  1 -1  0  0  0  1  0  0] (Indices: [0, 1, 3, 8, 13, 18, 19]), Candidate: [ 2  0  2 -1  1  1  1  1  0  1  0  1  2  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  1  0 -1  0  0  0  1 -1  0  0  1  0] (Indices: [0, 1, 3, 9, 10, 15, 19]), Candidate: [ 2  0  2 -1  1  1  1  0  2  1 -1  1  1  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  1 -1  0  1 -1  0  0  1  0 -1  0  1] (Indices: [0, 1, 3, 9, 12, 16, 17]), Candidate: [ 2  0  2 -1  1  1  1  0  2  0  0  2  0  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  0  1  0 -1  1 -1  0  1 -1  0  0  1] (Indices: [0, 1, 3, 10, 11, 13, 16]), Candidate: [ 2  0  2 -1  1  1  1  0  1  2  0  0  2  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  0  1 -1  0  1 -1  0  1 -1  1 -1  1] (Indices: [0, 1, 3, 10, 13, 16, 18]), Candidate: [ 2  0  2 -1  1  1  1  0  1  2 -1  1  2  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  0  0  1 -1  1  0 -1  0  0  0  1  0] (Indices: [0, 1, 3, 11, 13, 14, 19]), Candidate: [ 2  0  2 -1  1  1  1  0  1  1  1  0  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  0  0  0  1 -1  1 -1  1  0 -1  0  1] (Indices: [0, 1, 3, 12, 14, 16, 17]), Candidate: [ 2  0  2 -1  1  1  1  0  1  1  0  2  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0] (Indices: [0, 1, 3, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  1  0  1  1  0  1  1  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  0  0  1 -1  0  0  0  0  0  0  1  0] (Indices: [0, 1, 4, 5, 6, 11, 19]), Candidate: [2 0 1 1 1 1 0 0 1 1 1 0 1 1 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 4300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  0  1  0 -1  0  0  0  0  0  0  0  1] (Indices: [0, 1, 4, 5, 7, 10, 11]), Candidate: [ 2  0  1  1  1  0  2 -1  1  2  0  0  1  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1  0 -1  0  0  0  0  1 -1  0  0  0  1] (Indices: [0, 1, 4, 5, 8, 9, 15]), Candidate: [2 0 1 1 1 0 1 1 1 0 0 1 1 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 4400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  1  0  0 -1  0  0  0  0  0  0  0  1] (Indices: [0, 1, 4, 5, 9, 10, 11]), Candidate: [2 0 1 1 1 0 1 0 2 1 0 0 1 1 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 4450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  0  1  0 -1  0  0  0  0  1 -1  0  1] (Indices: [0, 1, 4, 5, 10, 11, 17]), Candidate: [2 0 1 1 1 0 1 0 1 2 0 0 1 1 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 4500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  0  0  1 -1  0  0  1 -1  1 -1  0  1] (Indices: [0, 1, 4, 5, 11, 15, 17]), Candidate: [2 0 1 1 1 0 1 0 1 1 1 0 1 1 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 4550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  0  0  0  0  0  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 4, 5, 14, 16, 18]), Candidate: [ 2  0  1  1  1  0  1  0  1  1  0  1  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  0  0  1 -1  0  0  0  0  1 -1  0  1] (Indices: [0, 1, 4, 6, 7, 11, 17]), Candidate: [ 2  0  1  1  0  2  1 -1  1  1  1  0  1  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1 -1  0  1  0 -1  0  0  0  0  0  0  1] (Indices: [0, 1, 4, 6, 8, 11, 12]), Candidate: [2 0 1 1 0 2 0 1 0 1 1 1 0 1 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 4700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  1 -1  1 -1  0  0  0  0  1 -1  0  1] (Indices: [0, 1, 4, 6, 9, 11, 17]), Candidate: [2 0 1 1 0 2 0 0 2 0 1 0 1 1 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 4750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  0  1 -1  0  1 -1  0  0  0  1 -1  1] (Indices: [0, 1, 4, 6, 10, 13, 18]), Candidate: [ 2  0  1  1  0  2  0  0  1  2 -1  1  2  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  0  0  0  1  0 -1  0  0  0  0  1  0] (Indices: [0, 1, 4, 6, 12, 13, 19]), Candidate: [2 0 1 1 0 2 0 0 1 1 0 2 1 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 4850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  0  0  0  0  0  0  0  0  1  0  0  0] (Indices: [0, 1, 4, 6, 17, 18, 19]), Candidate: [2 0 1 1 0 2 0 0 1 1 0 1 1 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 4900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0 -1  0  0  0  0  0  0  1  0 -1  0  1] (Indices: [0, 1, 4, 7, 8, 16, 17]), Candidate: [2 0 1 1 0 1 2 0 0 1 0 1 1 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 4950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  1 -1  0  0  0  0  0  0  0  1  0  0] (Indices: [0, 1, 4, 7, 9, 18, 19]), Candidate: [ 2  0  1  1  0  1  2 -1  2  0  0  1  1  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  0  0  1 -1  0  1  0 -1  0  0  0  1] (Indices: [0, 1, 4, 7, 11, 14, 15]), Candidate: [ 2  0  1  1  0  1  2 -1  1  1  1  0  1  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  0  0  0  0  1 -1  0  0  0  1  0  0] (Indices: [0, 1, 4, 7, 13, 18, 19]), Candidate: [ 2  0  1  1  0  1  2 -1  1  1  0  1  2  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1  0 -1  0  0  1 -1  0  0  0  0  1  0] (Indices: [0, 1, 4, 8, 9, 13, 19]), Candidate: [2 0 1 1 0 1 1 1 1 0 0 1 2 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 5150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1 -1  1 -1  0  0  0  0  0  1 -1  1  0] (Indices: [0, 1, 4, 8, 10, 17, 19]), Candidate: [ 2  0  1  1  0  1  1  1  0  2 -1  1  1  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1 -1  0  0  1 -1  0  0  0  0  1  0  0] (Indices: [0, 1, 4, 8, 12, 18, 19]), Candidate: [2 0 1 1 0 1 1 1 0 1 0 2 0 1 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 5250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  1  0 -1  1 -1  0  0  0  0  0  1  0] (Indices: [0, 1, 4, 9, 10, 12, 19]), Candidate: [ 2  0  1  1  0  1  1  0  2  1 -1  2  0  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  1 -1  0  1  0  0 -1  0  0  0  0  1] (Indices: [0, 1, 4, 9, 12, 13, 14]), Candidate: [ 2  0  1  1  0  1  1  0  2  0  0  2  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  1 -1  0  0  0  0  1 -1  1 -1  1  0] (Indices: [0, 1, 4, 9, 15, 17, 19]), Candidate: [2 0 1 1 0 1 1 0 2 0 0 1 1 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 5400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  0  1 -1  1 -1  0  0  1 -1  1 -1  1] (Indices: [0, 1, 4, 10, 12, 16, 18]), Candidate: [ 2  0  1  1  0  1  1  0  1  2 -1  2  0  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  0  0  1  0 -1  1 -1  0  0  0  1  0] (Indices: [0, 1, 4, 11, 12, 14, 19]), Candidate: [ 2  0  1  1  0  1  1  0  1  1  1  1  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  0  0  0  1  0  0 -1  0  0  0  1  0] (Indices: [0, 1, 4, 12, 13, 14, 19]), Candidate: [ 2  0  1  1  0  1  1  0  1  1  0  2  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  0  0  0  0  1 -1  0  0  1  0  0  0] (Indices: [0, 1, 4, 13, 17, 18, 19]), Candidate: [2 0 1 1 0 1 1 0 1 1 0 1 2 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 5600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  0  0  1 -1  0  0  0  1 -1  0  0  1] (Indices: [0, 1, 5, 6, 7, 11, 16]), Candidate: [ 2  0  1  0  2  1  1 -1  1  1  1  0  1  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1 -1  1 -1  0  0  0  0  0  0  0  1  0] (Indices: [0, 1, 5, 6, 8, 10, 19]), Candidate: [ 2  0  1  0  2  1  0  1  0  2 -1  1  1  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  1 -1  1 -1  0  0  0  1 -1  0  0  1] (Indices: [0, 1, 5, 6, 9, 11, 16]), Candidate: [2 0 1 0 2 1 0 0 2 0 1 0 1 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 5750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  0  1 -1  0  1 -1  0  0  1 -1  0  1] (Indices: [0, 1, 5, 6, 10, 13, 17]), Candidate: [ 2  0  1  0  2  1  0  0  1  2 -1  1  2  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  0  0  0  1  0 -1  0  0  0  1 -1  1] (Indices: [0, 1, 5, 6, 12, 13, 18]), Candidate: [2 0 1 0 2 1 0 0 1 1 0 2 1 0 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 5850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  0  0  0  0  0  0  0  1 -1  1  0  0] (Indices: [0, 1, 5, 6, 16, 18, 19]), Candidate: [2 0 1 0 2 1 0 0 1 1 0 1 1 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 5900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0 -1  0  0  0  0  0  1 -1  0  0  1  0] (Indices: [0, 1, 5, 7, 8, 15, 19]), Candidate: [2 0 1 0 2 0 2 0 0 1 0 1 1 1 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 5950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  1 -1  0  0  0  0  0  0  1 -1  1  0] (Indices: [0, 1, 5, 7, 9, 17, 19]), Candidate: [ 2  0  1  0  2  0  2 -1  2  0  0  1  1  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  0  0  1 -1  1 -1  0  0  0  0  1  0] (Indices: [0, 1, 5, 7, 11, 13, 19]), Candidate: [ 2  0  1  0  2  0  2 -1  1  1  1  0  2  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  0  0  0  0  1 -1  0  0  1 -1  1  0] (Indices: [0, 1, 5, 7, 13, 17, 19]), Candidate: [ 2  0  1  0  2  0  2 -1  1  1  0  1  2  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1  0 -1  0  0  1 -1  0  0  0  1 -1  1] (Indices: [0, 1, 5, 8, 9, 13, 18]), Candidate: [2 0 1 0 2 0 1 1 1 0 0 1 2 0 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 6150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1 -1  1 -1  0  0  0  0  0  1  0 -1  1] (Indices: [0, 1, 5, 8, 10, 17, 18]), Candidate: [ 2  0  1  0  2  0  1  1  0  2 -1  1  1  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1 -1  0  0  1 -1  0  0  0  1 -1  1  0] (Indices: [0, 1, 5, 8, 12, 17, 19]), Candidate: [2 0 1 0 2 0 1 1 0 1 0 2 0 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 6250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  1  0 -1  1 -1  0  0  0  0  1 -1  1] (Indices: [0, 1, 5, 9, 10, 12, 18]), Candidate: [ 2  0  1  0  2  0  1  0  2  1 -1  2  0  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  1 -1  1 -1  0  0  0  0  0  1  0  0] (Indices: [0, 1, 5, 9, 11, 18, 19]), Candidate: [2 0 1 0 2 0 1 0 2 0 1 0 1 1 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 6350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  1 -1  0  0  0  0  1 -1  1  0 -1  1] (Indices: [0, 1, 5, 9, 15, 17, 18]), Candidate: [2 0 1 0 2 0 1 0 2 0 0 1 1 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 6400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  0  1 -1  1 -1  0  0  1  0 -1  0  1] (Indices: [0, 1, 5, 10, 12, 16, 17]), Candidate: [ 2  0  1  0  2  0  1  0  1  2 -1  2  0  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  0  0  1  0 -1  1 -1  0  0  1 -1  1] (Indices: [0, 1, 5, 11, 12, 14, 18]), Candidate: [ 2  0  1  0  2  0  1  0  1  1  1  1  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  0  0  0  1  0  0 -1  0  0  1 -1  1] (Indices: [0, 1, 5, 12, 13, 14, 18]), Candidate: [ 2  0  1  0  2  0  1  0  1  1  0  2  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  0  0  0  0  1 -1  0  1 -1  1  0  0] (Indices: [0, 1, 5, 13, 16, 18, 19]), Candidate: [2 0 1 0 2 0 1 0 1 1 0 1 2 0 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 6600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0 -1  0  0  1 -1  0  0  0  0  0  1  0] (Indices: [0, 1, 6, 7, 8, 12, 19]), Candidate: [2 0 1 0 1 2 1 0 0 1 0 2 0 1 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 6650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  1 -1  0  0  1 -1  0  0  0  1 -1  1] (Indices: [0, 1, 6, 7, 9, 13, 18]), Candidate: [ 2  0  1  0  1  2  1 -1  2  0  0  1  2  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  0  1 -1  0  0  0  0  0  1  0 -1  1] (Indices: [0, 1, 6, 7, 10, 17, 18]), Candidate: [ 2  0  1  0  1  2  1 -1  1  2 -1  1  1  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  0  0  0  1 -1  0  0  0  1 -1  1  0] (Indices: [0, 1, 6, 7, 12, 17, 19]), Candidate: [ 2  0  1  0  1  2  1 -1  1  1  0  2  0  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1  0 -1  1 -1  0  0  0  1 -1  0  0  1] (Indices: [0, 1, 6, 8, 9, 11, 16]), Candidate: [2 0 1 0 1 2 0 1 1 0 1 0 1 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 6850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1 -1  1 -1  0  1 -1  0  0  1 -1  0  1] (Indices: [0, 1, 6, 8, 10, 13, 17]), Candidate: [ 2  0  1  0  1  2  0  1  0  2 -1  1  2  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1 -1  0  0  1  0 -1  0  0  0  1 -1  1] (Indices: [0, 1, 6, 8, 12, 13, 18]), Candidate: [2 0 1 0 1 2 0 1 0 1 0 2 1 0 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 6950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1 -1  0  0  0  0  0  0  1 -1  1  0  0] (Indices: [0, 1, 6, 8, 16, 18, 19]), Candidate: [2 0 1 0 1 2 0 1 0 1 0 1 1 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 7000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  1 -1  1 -1  1 -1  0  0  0  0  1  0] (Indices: [0, 1, 6, 9, 11, 13, 19]), Candidate: [2 0 1 0 1 2 0 0 2 0 1 0 2 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 7050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  1 -1  0  0  1 -1  0  0  1 -1  1  0] (Indices: [0, 1, 6, 9, 13, 17, 19]), Candidate: [2 0 1 0 1 2 0 0 2 0 0 1 2 0 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 7100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  0  1 -1  1  0  0 -1  0  0  0  0  1] (Indices: [0, 1, 6, 10, 12, 13, 14]), Candidate: [ 2  0  1  0  1  2  0  0  1  2 -1  2  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  0  1 -1  0  0  0  1 -1  1 -1  1  0] (Indices: [0, 1, 6, 10, 15, 17, 19]), Candidate: [ 2  0  1  0  1  2  0  0  1  2 -1  1  1  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  0  0  1 -1  0  1 -1  0  1 -1  1  0] (Indices: [0, 1, 6, 11, 14, 17, 19]), Candidate: [ 2  0  1  0  1  2  0  0  1  1  1  0  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  0  0  0  0  1  0  0 -1  0  0  1  0] (Indices: [0, 1, 6, 13, 14, 15, 19]), Candidate: [2 0 1 0 1 2 0 0 1 1 0 1 2 1 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 7300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0  0 -1  0  1 -1  1 -1  0  0  0  0  1] (Indices: [0, 1, 7, 8, 9, 12, 14]), Candidate: [ 2  0  1  0  1  1  2  0  1  0  0  2  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0 -1  1 -1  0  0  1 -1  0  1 -1  0  1] (Indices: [0, 1, 7, 8, 10, 14, 17]), Candidate: [ 2  0  1  0  1  1  2  0  0  2 -1  1  1  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0 -1  0  0  1 -1  1 -1  0  0  1 -1  1] (Indices: [0, 1, 7, 8, 12, 14, 18]), Candidate: [ 2  0  1  0  1  1  2  0  0  1  0  2  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  1  0  0 -1  0  0  1 -1  0  0  0  1] (Indices: [0, 1, 7, 9, 10, 11, 15]), Candidate: [ 2  0  1  0  1  1  2 -1  2  1  0  0  1  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  1 -1  1 -1  0  1 -1  0  0  0  1  0] (Indices: [0, 1, 7, 9, 11, 14, 19]), Candidate: [ 2  0  1  0  1  1  2 -1  2  0  1  0  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  1 -1  0  0  0  1  0 -1  0  0  1  0] (Indices: [0, 1, 7, 9, 14, 15, 19]), Candidate: [ 2  0  1  0  1  1  2 -1  2  0  0  1  1  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  0  1 -1  1  0 -1  0  0  0  0  1  0] (Indices: [0, 1, 7, 10, 12, 13, 19]), Candidate: [ 2  0  1  0  1  1  2 -1  1  2 -1  2  1  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  0  1 -1  0  0  0  0  0  1  0  0  0] (Indices: [0, 1, 7, 10, 17, 18, 19]), Candidate: [ 2  0  1  0  1  1  2 -1  1  2 -1  1  1  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  0  0  1 -1  0  0  1 -1  1  0 -1  1] (Indices: [0, 1, 7, 11, 15, 17, 18]), Candidate: [ 2  0  1  0  1  1  2 -1  1  1  1  0  1  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  0  0  0  0  1  0 -1  0  1 -1  1  0] (Indices: [0, 1, 7, 13, 14, 17, 19]), Candidate: [ 2  0  1  0  1  1  2 -1  1  1  0  1  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1  0  0 -1  0  0  1 -1  0  1 -1  0  1] (Indices: [0, 1, 8, 9, 10, 14, 17]), Candidate: [ 2  0  1  0  1  1  1  1  1  1 -1  1  1  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1  0 -1  0  1 -1  1 -1  0  0  1 -1  1] (Indices: [0, 1, 8, 9, 12, 14, 18]), Candidate: [ 2  0  1  0  1  1  1  1  1  0  0  2  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1 -1  1  0  0 -1  0  0  1 -1  0  0  1] (Indices: [0, 1, 8, 10, 11, 12, 16]), Candidate: [2 0 1 0 1 1 1 1 0 2 0 1 0 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 7950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1 -1  1 -1  0  1  0 -1  0  0  0  1  0] (Indices: [0, 1, 8, 10, 13, 14, 19]), Candidate: [ 2  0  1  0  1  1  1  1  0  2 -1  1  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1 -1  0  1  0 -1  0  0  0  1 -1  1  0] (Indices: [0, 1, 8, 11, 12, 17, 19]), Candidate: [2 0 1 0 1 1 1 1 0 1 1 1 0 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 8050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1 -1  0  0  1  0 -1  0  0  1 -1  1  0] (Indices: [0, 1, 8, 12, 13, 17, 19]), Candidate: [2 0 1 0 1 1 1 1 0 1 0 2 1 0 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 8100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1 -1  0  0  0  0  1 -1  1 -1  1  0  0] (Indices: [0, 1, 8, 14, 16, 18, 19]), Candidate: [ 2  0  1  0  1  1  1  1  0  1  0  1  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  1  0 -1  1 -1  0  0  1  0 -1  0  1] (Indices: [0, 1, 9, 10, 12, 16, 17]), Candidate: [ 2  0  1  0  1  1  1  0  2  1 -1  2  0  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  1 -1  1  0 -1  1 -1  0  0  1 -1  1] (Indices: [0, 1, 9, 11, 12, 14, 18]), Candidate: [ 2  0  1  0  1  1  1  0  2  0  1  1  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  1 -1  0  1  0  0 -1  0  0  1 -1  1] (Indices: [0, 1, 9, 12, 13, 14, 18]), Candidate: [ 2  0  1  0  1  1  1  0  2  0  0  2  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  1 -1  0  0  1 -1  0  1 -1  1  0  0] (Indices: [0, 1, 9, 13, 16, 18, 19]), Candidate: [2 0 1 0 1 1 1 0 2 0 0 1 2 0 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 8350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  0  1  0 -1  1 -1  0  0  1  0 -1  1] (Indices: [0, 1, 10, 11, 13, 17, 18]), Candidate: [2 0 1 0 1 1 1 0 1 2 0 0 2 0 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 8400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  0  1 -1  1 -1  0  1  0 -1  0  1  0] (Indices: [0, 1, 10, 12, 15, 16, 19]), Candidate: [ 2  0  1  0  1  1  1  0  1  2 -1  2  0  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  0  0  1  0  0 -1  1 -1  0  1 -1  1] (Indices: [0, 1, 11, 12, 13, 15, 18]), Candidate: [2 0 1 0 1 1 1 0 1 1 1 1 1 0 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 8500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  0  0  1 -1  0  1  0  0 -1  0  1  0] (Indices: [0, 1, 11, 14, 15, 16, 19]), Candidate: [2 0 1 0 1 1 1 0 1 1 1 0 1 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 8550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  0  0  0  0  1  0  0  0 -1  0  1  0] (Indices: [0, 1, 13, 14, 15, 16, 19]), Candidate: [2 0 1 0 1 1 1 0 1 1 0 1 2 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 8600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1 -1  0  0  0  0  0  1 -1  0  0  0  1] (Indices: [0, 2, 3, 4, 5, 8, 15]), Candidate: [1 2 1 0 1 0 1 1 0 1 0 1 1 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 8650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  0  0  0  0  0  0  1  0 -1  0  0  1] (Indices: [0, 2, 3, 4, 5, 15, 16]), Candidate: [1 2 1 0 1 0 1 0 1 1 0 1 1 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 8700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  0  1 -1  0  0  0  0  0  0  1 -1  1] (Indices: [0, 2, 3, 4, 6, 10, 18]), Candidate: [ 1  2  1  0  0  2  0  0  1  2 -1  1  1  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  1 -1  1 -1  0  0  0  0  0  0  0  1] (Indices: [0, 2, 3, 4, 7, 9, 11]), Candidate: [ 1  2  1  0  0  1  2 -1  2  0  1  0  1  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  0  0  0  0  0  0  0  1 -1  0  1  0] (Indices: [0, 2, 3, 4, 7, 16, 19]), Candidate: [ 1  2  1  0  0  1  2 -1  1  1  0  1  1  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1 -1  0  0  0  0  0  1 -1  1 -1  0  1] (Indices: [0, 2, 3, 4, 8, 15, 17]), Candidate: [1 2 1 0 0 1 1 1 0 1 0 1 1 1 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 8900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  1 -1  0  0  0  0  0  1 -1  0  1  0] (Indices: [0, 2, 3, 4, 9, 16, 19]), Candidate: [1 2 1 0 0 1 1 0 2 0 0 1 1 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 8950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  0  0  1 -1  1 -1  0  0  1 -1  0  1] (Indices: [0, 2, 3, 4, 11, 13, 17]), Candidate: [1 2 1 0 0 1 1 0 1 1 1 0 2 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 9000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  0  0  0  0  1 -1  0  1 -1  0  1  0] (Indices: [0, 2, 3, 4, 13, 16, 19]), Candidate: [1 2 1 0 0 1 1 0 1 1 0 1 2 0 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 9050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  1 -1  0  0  1 -1  0  0  0  0  0  1] (Indices: [0, 2, 3, 5, 6, 9, 13]), Candidate: [ 1  2  1 -1  2  1  0  0  2  0  0  1  2  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  0  0  0  0  0  0  0  0  1 -1  1  0] (Indices: [0, 2, 3, 5, 6, 17, 19]), Candidate: [ 1  2  1 -1  2  1  0  0  1  1  0  1  1  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  0  0  0  0  1 -1  0  0  1 -1  0  1] (Indices: [0, 2, 3, 5, 7, 13, 17]), Candidate: [ 1  2  1 -1  2  0  2 -1  1  1  0  1  2  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1 -1  0  0  1 -1  0  0  0  0  1 -1  1] (Indices: [0, 2, 3, 5, 8, 12, 18]), Candidate: [ 1  2  1 -1  2  0  1  1  0  1  0  2  0  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  1 -1  0  0  1 -1  0  0  1 -1  0  1] (Indices: [0, 2, 3, 5, 9, 13, 17]), Candidate: [ 1  2  1 -1  2  0  1  0  2  0  0  1  2  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  0  1 -1  0  0  0  0  1 -1  0  1  0] (Indices: [0, 2, 3, 5, 10, 16, 19]), Candidate: [ 1  2  1 -1  2  0  1  0  1  2 -1  1  1  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  0  0  0  1 -1  0  0  0  1  0 -1  1] (Indices: [0, 2, 3, 5, 12, 17, 18]), Candidate: [ 1  2  1 -1  2  0  1  0  1  1  0  2  0  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  1 -1  1 -1  0  0  0  0  0  0  0  1] (Indices: [0, 2, 3, 6, 7, 9, 11]), Candidate: [ 1  2  1 -1  1  2  1 -1  2  0  1  0  1  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  0  0  0  0  0  0  0  1 -1  0  1  0] (Indices: [0, 2, 3, 6, 7, 16, 19]), Candidate: [ 1  2  1 -1  1  2  1 -1  1  1  0  1  1  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1 -1  0  0  0  0  0  1 -1  1 -1  0  1] (Indices: [0, 2, 3, 6, 8, 15, 17]), Candidate: [ 1  2  1 -1  1  2  0  1  0  1  0  1  1  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  1 -1  0  0  0  0  0  1 -1  0  1  0] (Indices: [0, 2, 3, 6, 9, 16, 19]), Candidate: [ 1  2  1 -1  1  2  0  0  2  0  0  1  1  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  0  0  1 -1  1 -1  0  0  1 -1  0  1] (Indices: [0, 2, 3, 6, 11, 13, 17]), Candidate: [ 1  2  1 -1  1  2  0  0  1  1  1  0  2  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  0  0  0  0  1 -1  0  1 -1  0  1  0] (Indices: [0, 2, 3, 6, 13, 16, 19]), Candidate: [ 1  2  1 -1  1  2  0  0  1  1  0  1  2  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0 -1  0  1 -1  0  0  0  0  0  0  1  0] (Indices: [0, 2, 3, 7, 8, 11, 19]), Candidate: [ 1  2  1 -1  1  1  2  0  0  1  1  0  1  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  1 -1  0  1 -1  0  0  0  1 -1  0  1] (Indices: [0, 2, 3, 7, 9, 12, 17]), Candidate: [ 1  2  1 -1  1  1  2 -1  2  0  0  2  0  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  0  1 -1  0  0  0  1  0 -1  0  0  1] (Indices: [0, 2, 3, 7, 10, 15, 16]), Candidate: [ 1  2  1 -1  1  1  2 -1  1  2 -1  1  1  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 9850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  0  0  0  1 -1  0  1 -1  1 -1  0  1] (Indices: [0, 2, 3, 7, 12, 15, 17]), Candidate: [ 1  2  1 -1  1  1  2 -1  1  1  0  2  0  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1  0  0 -1  0  0  0  0  0  1 -1  0  1] (Indices: [0, 2, 3, 8, 9, 10, 17]), Candidate: [ 1  2  1 -1  1  1  1  1  1  1 -1  1  1  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1 -1  1 -1  1 -1  0  0  1 -1  0  0  1] (Indices: [0, 2, 3, 8, 10, 12, 16]), Candidate: [ 1  2  1 -1  1  1  1  1  0  2 -1  2  0  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1 -1  0  1 -1  0  0  0  0  1  0 -1  1] (Indices: [0, 2, 3, 8, 11, 17, 18]), Candidate: [ 1  2  1 -1  1  1  1  1  0  1  1  0  1  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1 -1  0  0  0  0  0  1  0 -1  1 -1  1] (Indices: [0, 2, 3, 8, 15, 16, 18]), Candidate: [ 1  2  1 -1  1  1  1  1  0  1  0  1  1  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  1 -1  1  0 -1  0  0  0  0  1 -1  1] (Indices: [0, 2, 3, 9, 11, 12, 18]), Candidate: [ 1  2  1 -1  1  1  1  0  2  0  1  1  0  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  1 -1  0  0  1 -1  1 -1  1 -1  0  1] (Indices: [0, 2, 3, 9, 13, 15, 17]), Candidate: [ 1  2  1 -1  1  1  1  0  2  0  0  1  2  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  0  1  0 -1  0  0  1 -1  0  0  1  0] (Indices: [0, 2, 3, 10, 11, 15, 19]), Candidate: [ 1  2  1 -1  1  1  1  0  1  2  0  0  1  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  0  1 -1  0  0  1 -1  0  1  0 -1  1] (Indices: [0, 2, 3, 10, 14, 17, 18]), Candidate: [ 1  2  1 -1  1  1  1  0  1  2 -1  1  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 10300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  0  0  1 -1  0  1  0 -1  1 -1  0  1] (Indices: [0, 2, 3, 11, 14, 15, 17]), Candidate: [ 1  2  1 -1  1  1  1  0  1  1  1  0  1  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  0  0  0  1 -1  0  0  1  0  0 -1  1] (Indices: [0, 2, 3, 12, 16, 17, 18]), Candidate: [ 1  2  1 -1  1  1  1  0  1  1  0  2  0  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  0  0  0  0  0  0  0  0  0  0  1  0] (Indices: [0, 2, 4, 5, 6, 7, 19]), Candidate: [ 1  2  0  1  1  1  1 -1  1  1  0  1  1  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  0  0  0  0  1 -1  0  0  0  1 -1  1] (Indices: [0, 2, 4, 5, 6, 13, 18]), Candidate: [1 2 0 1 1 1 0 0 1 1 0 1 2 0 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 10500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  0  0  1 -1  0  0  1 -1  0  0  0  1] (Indices: [0, 2, 4, 5, 7, 11, 15]), Candidate: [ 1  2  0  1  1  0  2 -1  1  1  1  0  1  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1 -1  1 -1  0  0  0  0  0  0  1 -1  1] (Indices: [0, 2, 4, 5, 8, 10, 18]), Candidate: [ 1  2  0  1  1  0  1  1  0  2 -1  1  1  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  1 -1  1 -1  0  0  1 -1  0  0  0  1] (Indices: [0, 2, 4, 5, 9, 11, 15]), Candidate: [1 2 0 1 1 0 1 0 2 0 1 0 1 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 10650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  0  1 -1  0  1 -1  0  1 -1  0  0  1] (Indices: [0, 2, 4, 5, 10, 13, 16]), Candidate: [ 1  2  0  1  1  0  1  0  1  2 -1  1  2  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  0  0  0  1  0 -1  0  0  1 -1  0  1] (Indices: [0, 2, 4, 5, 12, 13, 17]), Candidate: [1 2 0 1 1 0 1 0 1 1 0 2 1 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 10750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  0  0  0  0  0  0  0  1  0 -1  1  0] (Indices: [0, 2, 4, 5, 16, 17, 19]), Candidate: [1 2 0 1 1 0 1 0 1 1 0 1 1 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 10800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  0  0  0  0  1 -1  0  1 -1  0  0  1] (Indices: [0, 2, 4, 6, 7, 13, 16]), Candidate: [ 1  2  0  1  0  2  1 -1  1  1  0  1  2  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1 -1  0  0  1 -1  0  0  0  1 -1  0  1] (Indices: [0, 2, 4, 6, 8, 12, 17]), Candidate: [1 2 0 1 0 2 0 1 0 1 0 2 0 1 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 10900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  1 -1  0  0  1 -1  0  1 -1  0  0  1] (Indices: [0, 2, 4, 6, 9, 13, 16]), Candidate: [1 2 0 1 0 2 0 0 2 0 0 1 2 0 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 10950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  0  1 -1  0  0  0  0  1 -1  1 -1  1] (Indices: [0, 2, 4, 6, 10, 16, 18]), Candidate: [ 1  2  0  1  0  2  0  0  1  2 -1  1  1  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  0  0  0  1 -1  0  0  1 -1  0  1  0] (Indices: [0, 2, 4, 6, 12, 16, 19]), Candidate: [1 2 0 1 0 2 0 0 1 1 0 2 0 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 11050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0 -1  1 -1  1 -1  0  0  0  0  0  0  1] (Indices: [0, 2, 4, 7, 8, 10, 12]), Candidate: [ 1  2  0  1  0  1  2  0  0  2 -1  2  0  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  1  0 -1  0  0  0  0  0  1 -1  0  1] (Indices: [0, 2, 4, 7, 9, 10, 17]), Candidate: [ 1  2  0  1  0  1  2 -1  2  1 -1  1  1  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 11150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  0  1 -1  1 -1  0  0  1 -1  0  0  1] (Indices: [0, 2, 4, 7, 10, 12, 16]), Candidate: [ 1  2  0  1  0  1  2 -1  1  2 -1  2  0  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 11200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  0  0  1 -1  0  0  0  0  1  0 -1  1] (Indices: [0, 2, 4, 7, 11, 17, 18]), Candidate: [ 1  2  0  1  0  1  2 -1  1  1  1  0  1  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  0  0  0  0  0  0  1  0 -1  1 -1  1] (Indices: [0, 2, 4, 7, 15, 16, 18]), Candidate: [ 1  2  0  1  0  1  2 -1  1  1  0  1  1  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1  0 -1  0  0  0  0  0  1 -1  0  1  0] (Indices: [0, 2, 4, 8, 9, 16, 19]), Candidate: [1 2 0 1 0 1 1 1 1 0 0 1 1 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 11350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1 -1  0  1 -1  1 -1  0  0  1 -1  0  1] (Indices: [0, 2, 4, 8, 11, 13, 17]), Candidate: [1 2 0 1 0 1 1 1 0 1 1 0 2 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 11400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1 -1  0  0  0  1 -1  0  1 -1  0  1  0] (Indices: [0, 2, 4, 8, 13, 16, 19]), Candidate: [1 2 0 1 0 1 1 1 0 1 0 1 2 0 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 11450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  1  0 -1  0  0  0  1  0 -1  0  0  1] (Indices: [0, 2, 4, 9, 10, 15, 16]), Candidate: [ 1  2  0  1  0  1  1  0  2  1 -1  1  1  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  1 -1  0  1 -1  0  1 -1  1 -1  0  1] (Indices: [0, 2, 4, 9, 12, 15, 17]), Candidate: [1 2 0 1 0 1 1 0 2 0 0 2 0 1 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 11550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  0  1  0  0 -1  0  0  0  0  0  1  0] (Indices: [0, 2, 4, 10, 11, 12, 19]), Candidate: [1 2 0 1 0 1 1 0 1 2 0 1 0 1 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 11600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  0  1 -1  0  1 -1  1 -1  0  1 -1  1] (Indices: [0, 2, 4, 10, 13, 15, 18]), Candidate: [ 1  2  0  1  0  1  1  0  1  2 -1  1  2  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  0  0  1 -1  1  0 -1  1 -1  0  0  1] (Indices: [0, 2, 4, 11, 13, 14, 16]), Candidate: [ 1  2  0  1  0  1  1  0  1  1  1  0  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  0  0  0  1 -1  1  0 -1  1 -1  0  1] (Indices: [0, 2, 4, 12, 14, 15, 17]), Candidate: [1 2 0 1 0 1 1 0 1 1 0 2 0 2 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 11750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  0  0  0  0  0  0  1  0  0 -1  1  0] (Indices: [0, 2, 4, 15, 16, 17, 19]), Candidate: [1 2 0 1 0 1 1 0 1 1 0 1 1 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 11800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  0  0  0  0  1 -1  1 -1  0  0  0  1] (Indices: [0, 2, 5, 6, 7, 13, 15]), Candidate: [ 1  2  0  0  2  1  1 -1  1  1  0  1  2  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1 -1  0  0  1 -1  0  0  1 -1  0  0  1] (Indices: [0, 2, 5, 6, 8, 12, 16]), Candidate: [1 2 0 0 2 1 0 1 0 1 0 2 0 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 11900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  1 -1  0  0  1 -1  1 -1  0  0  0  1] (Indices: [0, 2, 5, 6, 9, 13, 15]), Candidate: [1 2 0 0 2 1 0 0 2 0 0 1 2 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 11950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  0  1 -1  0  0  0  0  1  0 -1  0  1] (Indices: [0, 2, 5, 6, 10, 16, 17]), Candidate: [ 1  2  0  0  2  1  0  0  1  2 -1  1  1  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  0  0  0  1 -1  0  0  1 -1  1 -1  1] (Indices: [0, 2, 5, 6, 12, 16, 18]), Candidate: [1 2 0 0 2 1 0 0 1 1 0 2 0 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 12050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0 -1  1  0 -1  0  0  0  0  0  0  0  1] (Indices: [0, 2, 5, 7, 8, 10, 11]), Candidate: [1 2 0 0 2 0 2 0 0 2 0 0 1 1 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 12100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  1  0 -1  0  0  0  0  1 -1  0  0  1] (Indices: [0, 2, 5, 7, 9, 10, 16]), Candidate: [ 1  2  0  0  2  0  2 -1  2  1 -1  1  1  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 12150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  0  1 -1  1 -1  0  1 -1  0  0  0  1] (Indices: [0, 2, 5, 7, 10, 12, 15]), Candidate: [ 1  2  0  0  2  0  2 -1  1  2 -1  2  0  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 12200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  0  0  1 -1  0  0  0  1 -1  0  1  0] (Indices: [0, 2, 5, 7, 11, 16, 19]), Candidate: [ 1  2  0  0  2  0  2 -1  1  1  1  0  1  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  0  0  0  0  0  0  1  0  0 -1  0  1] (Indices: [0, 2, 5, 7, 15, 16, 17]), Candidate: [ 1  2  0  0  2  0  2 -1  1  1  0  1  1  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1  0 -1  0  0  0  0  0  1 -1  1 -1  1] (Indices: [0, 2, 5, 8, 9, 16, 18]), Candidate: [1 2 0 0 2 0 1 1 1 0 0 1 1 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 12350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1 -1  0  1 -1  1 -1  0  1 -1  0  0  1] (Indices: [0, 2, 5, 8, 11, 13, 16]), Candidate: [1 2 0 0 2 0 1 1 0 1 1 0 2 0 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 12400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1 -1  0  0  0  1 -1  0  1 -1  1 -1  1] (Indices: [0, 2, 5, 8, 13, 16, 18]), Candidate: [1 2 0 0 2 0 1 1 0 1 0 1 2 0 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 12450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  1  0 -1  0  0  1 -1  0  0  0  1  0] (Indices: [0, 2, 5, 9, 10, 14, 19]), Candidate: [ 1  2  0  0  2  0  1  0  2  1 -1  1  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 12500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  1 -1  0  1 -1  0  1  0 -1  0  0  1] (Indices: [0, 2, 5, 9, 12, 15, 16]), Candidate: [1 2 0 0 2 0 1 0 2 0 0 2 0 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 12550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  0  1  0  0 -1  0  0  0  0  1 -1  1] (Indices: [0, 2, 5, 10, 11, 12, 18]), Candidate: [1 2 0 0 2 0 1 0 1 2 0 1 0 1 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 12600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  0  1 -1  0  1 -1  1 -1  1 -1  0  1] (Indices: [0, 2, 5, 10, 13, 15, 17]), Candidate: [ 1  2  0  0  2  0  1  0  1  2 -1  1  2  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  0  0  1 -1  1  0  0 -1  0  0  0  1] (Indices: [0, 2, 5, 11, 13, 14, 15]), Candidate: [1 2 0 0 2 0 1 0 1 1 1 0 2 1 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 12700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  0  0  0  1 -1  1  0  0 -1  0  0  1] (Indices: [0, 2, 5, 12, 14, 15, 16]), Candidate: [1 2 0 0 2 0 1 0 1 1 0 2 0 2 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 12750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  0  0  0  0  0  0  1  0  0  0 -1  1] (Indices: [0, 2, 5, 15, 16, 17, 18]), Candidate: [1 2 0 0 2 0 1 0 1 1 0 1 1 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 12800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0 -1  0  0  0  0  0  1  0 -1  0  0  1] (Indices: [0, 2, 6, 7, 8, 15, 16]), Candidate: [1 2 0 0 1 2 1 0 0 1 0 1 1 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 12850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  1 -1  0  0  0  0  0  1 -1  1 -1  1] (Indices: [0, 2, 6, 7, 9, 16, 18]), Candidate: [ 1  2  0  0  1  2  1 -1  2  0  0  1  1  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  0  0  1 -1  1 -1  0  1 -1  0  0  1] (Indices: [0, 2, 6, 7, 11, 13, 16]), Candidate: [ 1  2  0  0  1  2  1 -1  1  1  1  0  2  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  0  0  0  0  1 -1  0  1 -1  1 -1  1] (Indices: [0, 2, 6, 7, 13, 16, 18]), Candidate: [ 1  2  0  0  1  2  1 -1  1  1  0  1  2  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1  0 -1  0  0  1 -1  1 -1  0  0  0  1] (Indices: [0, 2, 6, 8, 9, 13, 15]), Candidate: [1 2 0 0 1 2 0 1 1 0 0 1 2 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 13050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1 -1  1 -1  0  0  0  0  1  0 -1  0  1] (Indices: [0, 2, 6, 8, 10, 16, 17]), Candidate: [ 1  2  0  0  1  2  0  1  0  2 -1  1  1  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1 -1  0  0  1 -1  0  0  1 -1  1 -1  1] (Indices: [0, 2, 6, 8, 12, 16, 18]), Candidate: [1 2 0 0 1 2 0 1 0 1 0 2 0 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 13150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  1  0 -1  1 -1  0  1 -1  0  0  0  1] (Indices: [0, 2, 6, 9, 10, 12, 15]), Candidate: [ 1  2  0  0  1  2  0  0  2  1 -1  2  0  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  1 -1  1 -1  0  0  0  1 -1  0  1  0] (Indices: [0, 2, 6, 9, 11, 16, 19]), Candidate: [1 2 0 0 1 2 0 0 2 0 1 0 1 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 13250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  1 -1  0  0  0  0  1  0  0 -1  0  1] (Indices: [0, 2, 6, 9, 15, 16, 17]), Candidate: [1 2 0 0 1 2 0 0 2 0 0 1 1 1 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 13300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  0  1 -1  1 -1  0  1 -1  1 -1  0  1] (Indices: [0, 2, 6, 10, 12, 15, 17]), Candidate: [ 1  2  0  0  1  2  0  0  1  2 -1  2  0  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  0  0  1  0 -1  1  0 -1  0  0  0  1] (Indices: [0, 2, 6, 11, 12, 14, 15]), Candidate: [1 2 0 0 1 2 0 0 1 1 1 1 0 2 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 13400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  0  0  0  1  0  0  0 -1  0  0  0  1] (Indices: [0, 2, 6, 12, 13, 14, 15]), Candidate: [1 2 0 0 1 2 0 0 1 1 0 2 1 1 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 13450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  0  0  0  0  1 -1  1 -1  0  1  0  0] (Indices: [0, 2, 6, 13, 15, 18, 19]), Candidate: [1 2 0 0 1 2 0 0 1 1 0 1 2 0 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 13500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0  0 -1  0  0  0  1  0 -1  0  0  0  1] (Indices: [0, 2, 7, 8, 9, 14, 15]), Candidate: [1 2 0 0 1 1 2 0 1 0 0 1 1 2 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 13550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0 -1  1 -1  0  0  0  0  0  0  1  0  0] (Indices: [0, 2, 7, 8, 10, 18, 19]), Candidate: [ 1  2  0  0  1  1  2  0  0  2 -1  1  1  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0 -1  0  0  0  1  0  0 -1  0  0  0  1] (Indices: [0, 2, 7, 8, 13, 14, 15]), Candidate: [1 2 0 0 1 1 2 0 0 1 0 1 2 1 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 13650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  1  0 -1  0  1  0 -1  0  0  0  0  1] (Indices: [0, 2, 7, 9, 10, 13, 14]), Candidate: [ 1  2  0  0  1  1  2 -1  2  1 -1  1  2  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 13700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  1 -1  0  1  0 -1  1 -1  0  0  0  1] (Indices: [0, 2, 7, 9, 12, 13, 15]), Candidate: [ 1  2  0  0  1  1  2 -1  2  0  0  2  1  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  1 -1  0  0  0  0  1 -1  0  1  0  0] (Indices: [0, 2, 7, 9, 15, 18, 19]), Candidate: [ 1  2  0  0  1  1  2 -1  2  0  0  1  1  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  0  1 -1  1 -1  0  0  1 -1  0  1  0] (Indices: [0, 2, 7, 10, 12, 16, 19]), Candidate: [ 1  2  0  0  1  1  2 -1  1  2 -1  2  0  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 13850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  0  0  1  0 -1  0  1  0 -1  0  0  1] (Indices: [0, 2, 7, 11, 12, 15, 16]), Candidate: [ 1  2  0  0  1  1  2 -1  1  1  1  1  0  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  0  0  0  1  0 -1  1  0 -1  0  0  1] (Indices: [0, 2, 7, 12, 13, 15, 16]), Candidate: [ 1  2  0  0  1  1  2 -1  1  1  0  2  1  0  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  0  0  0  0  0  1  0  0  0 -1  0  1] (Indices: [0, 2, 7, 14, 15, 16, 17]), Candidate: [ 1  2  0  0  1  1  2 -1  1  1  0  1  1  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1  0  0 -1  0  0  0  0  0  0  1  0  0] (Indices: [0, 2, 8, 9, 10, 18, 19]), Candidate: [ 1  2  0  0  1  1  1  1  1  1 -1  1  1  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1  0 -1  0  0  1  0  0 -1  0  0  0  1] (Indices: [0, 2, 8, 9, 13, 14, 15]), Candidate: [1 2 0 0 1 1 1 1 1 0 0 1 2 1 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 14100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1 -1  1  0 -1  0  1 -1  0  1 -1  0  1] (Indices: [0, 2, 8, 10, 11, 14, 17]), Candidate: [ 1  2  0  0  1  1  1  1  0  2  0  0  1  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1 -1  1 -1  0  0  1  0 -1  1 -1  0  1] (Indices: [0, 2, 8, 10, 14, 15, 17]), Candidate: [ 1  2  0  0  1  1  1  1  0  2 -1  1  1  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1 -1  0  1 -1  1 -1  0  1 -1  1 -1  1] (Indices: [0, 2, 8, 11, 13, 16, 18]), Candidate: [1 2 0 0 1 1 1 1 0 1 1 0 2 0 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 14250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1 -1  0  0  1 -1  0  1  0  0 -1  0  1] (Indices: [0, 2, 8, 12, 15, 16, 17]), Candidate: [1 2 0 0 1 1 1 1 0 1 0 2 0 1 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 14300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  1  0  0  0 -1  0  0  0  0  1 -1  1] (Indices: [0, 2, 9, 10, 11, 12, 18]), Candidate: [1 2 0 0 1 1 1 0 2 1 0 1 0 1 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 14350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  1  0 -1  0  1 -1  1 -1  1 -1  0  1] (Indices: [0, 2, 9, 10, 13, 15, 17]), Candidate: [ 1  2  0  0  1  1  1  0  2  1 -1  1  2  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  1 -1  1 -1  1  0  0 -1  0  0  0  1] (Indices: [0, 2, 9, 11, 13, 14, 15]), Candidate: [1 2 0 0 1 1 1 0 2 0 1 0 2 1 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 14450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  1 -1  0  1 -1  1  0  0 -1  0  0  1] (Indices: [0, 2, 9, 12, 14, 15, 16]), Candidate: [1 2 0 0 1 1 1 0 2 0 0 2 0 2 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 14500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  1 -1  0  0  0  0  1  0  0  0 -1  1] (Indices: [0, 2, 9, 15, 16, 17, 18]), Candidate: [1 2 0 0 1 1 1 0 2 0 0 1 1 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 14550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  0  1  0 -1  0  1 -1  0  0  1  0  0] (Indices: [0, 2, 10, 11, 14, 18, 19]), Candidate: [ 1  2  0  0  1  1  1  0  1  2  0  0  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  0  1 -1  0  1  0 -1  1  0 -1  0  1] (Indices: [0, 2, 10, 13, 14, 16, 17]), Candidate: [ 1  2  0  0  1  1  1  0  1  2 -1  1  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 14650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  0  0  1  0 -1  1 -1  1  0 -1  0  1] (Indices: [0, 2, 11, 12, 14, 16, 17]), Candidate: [ 1  2  0  0  1  1  1  0  1  1  1  1  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  0  0  1 -1  0  0  0  1  0  0  0  0] (Indices: [0, 2, 11, 16, 17, 18, 19]), Candidate: [1 2 0 0 1 1 1 0 1 1 1 0 1 1 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 14750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  0  0  0  0  1 -1  0  1  0  0  0  0] (Indices: [0, 2, 13, 16, 17, 18, 19]), Candidate: [1 2 0 0 1 1 1 0 1 1 0 1 2 0 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 14800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  0  0  1 -1  1 -1  0  0  0  0  0  1] (Indices: [0, 3, 4, 5, 6, 11, 13]), Candidate: [1 1 2 0 1 1 0 0 1 1 1 0 2 0 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 14850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  1 -1  0  0  0  1 -1  0  0  0  0  1] (Indices: [0, 3, 4, 5, 7, 9, 14]), Candidate: [ 1  1  2  0  1  0  2 -1  2  0  0  1  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 14900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  0  0  0  0  0  0  0  0  0  1  0  0] (Indices: [0, 3, 4, 5, 7, 18, 19]), Candidate: [ 1  1  2  0  1  0  2 -1  1  1  0  1  1  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1 -1  0  0  0  0  0  0  1  0 -1  0  1] (Indices: [0, 3, 4, 5, 8, 16, 17]), Candidate: [1 1 2 0 1 0 1 1 0 1 0 1 1 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 15000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  1 -1  0  0  0  0  0  0  0  1  0  0] (Indices: [0, 3, 4, 5, 9, 18, 19]), Candidate: [1 1 2 0 1 0 1 0 2 0 0 1 1 1 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 15050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  0  0  1 -1  0  1  0 -1  0  0  0  1] (Indices: [0, 3, 4, 5, 11, 14, 15]), Candidate: [1 1 2 0 1 0 1 0 1 1 1 0 1 2 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 15100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  0  0  0  0  1 -1  0  0  0  1  0  0] (Indices: [0, 3, 4, 5, 13, 18, 19]), Candidate: [1 1 2 0 1 0 1 0 1 1 0 1 2 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 15150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  0  1 -1  0  0  0  0  0  0  0  1  0] (Indices: [0, 3, 4, 6, 7, 10, 19]), Candidate: [ 1  1  2  0  0  2  1 -1  1  2 -1  1  1  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1 -1  1 -1  0  0  1 -1  0  0  0  0  1] (Indices: [0, 3, 4, 6, 8, 10, 14]), Candidate: [ 1  1  2  0  0  2  0  1  0  2 -1  1  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  1  0 -1  0  0  0  0  0  0  0  1  0] (Indices: [0, 3, 4, 6, 9, 10, 19]), Candidate: [ 1  1  2  0  0  2  0  0  2  1 -1  1  1  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  0  1 -1  1 -1  0  0  0  0  1 -1  1] (Indices: [0, 3, 4, 6, 10, 12, 18]), Candidate: [ 1  1  2  0  0  2  0  0  1  2 -1  2  0  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  0  0  1 -1  0  0  0  0  0  1  0  0] (Indices: [0, 3, 4, 6, 11, 18, 19]), Candidate: [1 1 2 0 0 2 0 0 1 1 1 0 1 1 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 15400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  0  0  0  0  0  0  1 -1  1  0 -1  1] (Indices: [0, 3, 4, 6, 15, 17, 18]), Candidate: [1 1 2 0 0 2 0 0 1 1 0 1 1 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 15450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0 -1  0  0  0  0  1 -1  0  0  1 -1  1] (Indices: [0, 3, 4, 7, 8, 14, 18]), Candidate: [ 1  1  2  0  0  1  2  0  0  1  0  1  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  1 -1  0  0  0  0  1 -1  0  0  1  0] (Indices: [0, 3, 4, 7, 9, 15, 19]), Candidate: [ 1  1  2  0  0  1  2 -1  2  0  0  1  1  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  0  0  1 -1  1  0 -1  0  0  0  0  1] (Indices: [0, 3, 4, 7, 11, 13, 14]), Candidate: [ 1  1  2  0  0  1  2 -1  1  1  1  0  2  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  0  0  0  0  1 -1  1 -1  0  0  1  0] (Indices: [0, 3, 4, 7, 13, 15, 19]), Candidate: [ 1  1  2  0  0  1  2 -1  1  1  0  1  2  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1  0 -1  0  1 -1  0  0  0  0  0  1  0] (Indices: [0, 3, 4, 8, 9, 12, 19]), Candidate: [1 1 2 0 0 1 1 1 1 0 0 2 0 1 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 15700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1 -1  1 -1  0  0  0  1 -1  0  1 -1  1] (Indices: [0, 3, 4, 8, 10, 15, 18]), Candidate: [ 1  1  2  0  0  1  1  1  0  2 -1  1  1  1  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1 -1  0  0  1 -1  0  1 -1  0  0  1  0] (Indices: [0, 3, 4, 8, 12, 15, 19]), Candidate: [1 1 2 0 0 1 1 1 0 1 0 2 0 1 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 15800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  1  0 -1  1  0 -1  0  0  0  0  0  1] (Indices: [0, 3, 4, 9, 10, 12, 13]), Candidate: [ 1  1  2  0  0  1  1  0  2  1 -1  2  1  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  1 -1  1 -1  0  0  0  1  0 -1  0  1] (Indices: [0, 3, 4, 9, 11, 16, 17]), Candidate: [1 1 2 0 0 1 1 0 2 0 1 0 1 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 15900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  1 -1  0  0  0  1 -1  0  1 -1  1  0] (Indices: [0, 3, 4, 9, 14, 17, 19]), Candidate: [ 1  1  2  0  0  1  1  0  2  0  0  1  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  0  1 -1  1 -1  1 -1  0  0  0  1  0] (Indices: [0, 3, 4, 10, 12, 14, 19]), Candidate: [ 1  1  2  0  0  1  1  0  1  2 -1  2  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  0  0  1  0  0 -1  0  0  0  1 -1  1] (Indices: [0, 3, 4, 11, 12, 13, 18]), Candidate: [1 1 2 0 0 1 1 0 1 1 1 1 1 0 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 16050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  0  0  1 -1  0  0  0  1 -1  1  0  0] (Indices: [0, 3, 4, 11, 16, 18, 19]), Candidate: [1 1 2 0 0 1 1 0 1 1 1 0 1 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 16100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  0  0  0  0  1 -1  1 -1  1  0 -1  1] (Indices: [0, 3, 4, 13, 15, 17, 18]), Candidate: [1 1 2 0 0 1 1 0 1 1 0 1 2 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 16150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  0  1 -1  0  0  0  0  0  0  1 -1  1] (Indices: [0, 3, 5, 6, 7, 10, 18]), Candidate: [ 1  1  2 -1  2  1  1 -1  1  2 -1  1  1  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 16200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1 -1  1 -1  0  1 -1  0  0  0  0  0  1] (Indices: [0, 3, 5, 6, 8, 10, 13]), Candidate: [ 1  1  2 -1  2  1  0  1  0  2 -1  1  2  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  1  0 -1  0  0  0  0  0  0  1 -1  1] (Indices: [0, 3, 5, 6, 9, 10, 18]), Candidate: [ 1  1  2 -1  2  1  0  0  2  1 -1  1  1  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  0  1 -1  1 -1  0  0  0  1 -1  0  1] (Indices: [0, 3, 5, 6, 10, 12, 17]), Candidate: [ 1  1  2 -1  2  1  0  0  1  2 -1  2  0  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  0  0  1 -1  0  0  0  0  1 -1  1  0] (Indices: [0, 3, 5, 6, 11, 17, 19]), Candidate: [ 1  1  2 -1  2  1  0  0  1  1  1  0  1  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  0  0  0  0  0  0  1  0 -1  0  1  0] (Indices: [0, 3, 5, 6, 15, 16, 19]), Candidate: [ 1  1  2 -1  2  1  0  0  1  1  0  1  1  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0 -1  0  0  0  0  1 -1  0  1 -1  0  1] (Indices: [0, 3, 5, 7, 8, 14, 17]), Candidate: [ 1  1  2 -1  2  0  2  0  0  1  0  1  1  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  1 -1  0  0  0  0  1 -1  0  1 -1  1] (Indices: [0, 3, 5, 7, 9, 15, 18]), Candidate: [ 1  1  2 -1  2  0  2 -1  2  0  0  1  1  1  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  0  0  1  0 -1  0  0  0  0  0  1  0] (Indices: [0, 3, 5, 7, 11, 12, 19]), Candidate: [ 1  1  2 -1  2  0  2 -1  1  1  1  1  0  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  0  0  0  0  1 -1  1 -1  0  1 -1  1] (Indices: [0, 3, 5, 7, 13, 15, 18]), Candidate: [ 1  1  2 -1  2  0  2 -1  1  1  0  1  2  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1  0 -1  0  1 -1  0  0  0  0  1 -1  1] (Indices: [0, 3, 5, 8, 9, 12, 18]), Candidate: [ 1  1  2 -1  2  0  1  1  1  0  0  2  0  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1 -1  1 -1  0  0  0  1 -1  1 -1  0  1] (Indices: [0, 3, 5, 8, 10, 15, 17]), Candidate: [ 1  1  2 -1  2  0  1  1  0  2 -1  1  1  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1 -1  0  0  1 -1  0  1 -1  0  1 -1  1] (Indices: [0, 3, 5, 8, 12, 15, 18]), Candidate: [ 1  1  2 -1  2  0  1  1  0  1  0  2  0  1  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  1  0  0 -1  0  0  0  0  0  0  1  0] (Indices: [0, 3, 5, 9, 10, 11, 19]), Candidate: [ 1  1  2 -1  2  0  1  0  2  1  0  0  1  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  1 -1  1 -1  0  0  1 -1  0  0  1  0] (Indices: [0, 3, 5, 9, 11, 15, 19]), Candidate: [ 1  1  2 -1  2  0  1  0  2  0  1  0  1  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  1 -1  0  0  0  1 -1  0  1  0 -1  1] (Indices: [0, 3, 5, 9, 14, 17, 18]), Candidate: [ 1  1  2 -1  2  0  1  0  2  0  0  1  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  0  1 -1  1 -1  1 -1  0  0  1 -1  1] (Indices: [0, 3, 5, 10, 12, 14, 18]), Candidate: [ 1  1  2 -1  2  0  1  0  1  2 -1  2  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 17000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  0  0  1  0  0 -1  0  0  1 -1  0  1] (Indices: [0, 3, 5, 11, 12, 13, 17]), Candidate: [ 1  1  2 -1  2  0  1  0  1  1  1  1  1  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  0  0  1 -1  0  0  0  1  0 -1  1  0] (Indices: [0, 3, 5, 11, 16, 17, 19]), Candidate: [ 1  1  2 -1  2  0  1  0  1  1  1  0  1  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  0  0  0  0  1 -1  1  0 -1  0  1  0] (Indices: [0, 3, 5, 13, 15, 16, 19]), Candidate: [ 1  1  2 -1  2  0  1  0  1  1  0  1  2  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0 -1  0  0  1  0 -1  0  0  0  0  0  1] (Indices: [0, 3, 6, 7, 8, 12, 13]), Candidate: [ 1  1  2 -1  1  2  1  0  0  1  0  2  1  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  1 -1  0  1 -1  0  0  0  0  1 -1  1] (Indices: [0, 3, 6, 7, 9, 12, 18]), Candidate: [ 1  1  2 -1  1  2  1 -1  2  0  0  2  0  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 17250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  0  1 -1  0  0  0  1 -1  1 -1  0  1] (Indices: [0, 3, 6, 7, 10, 15, 17]), Candidate: [ 1  1  2 -1  1  2  1 -1  1  2 -1  1  1  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 17300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  0  0  0  1 -1  0  1 -1  0  1 -1  1] (Indices: [0, 3, 6, 7, 12, 15, 18]), Candidate: [ 1  1  2 -1  1  2  1 -1  1  1  0  2  0  1  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 17350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1  0  0 -1  0  0  0  0  0  0  1 -1  1] (Indices: [0, 3, 6, 8, 9, 10, 18]), Candidate: [ 1  1  2 -1  1  2  0  1  1  1 -1  1  1  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 17400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1 -1  1 -1  1 -1  0  0  0  1 -1  0  1] (Indices: [0, 3, 6, 8, 10, 12, 17]), Candidate: [ 1  1  2 -1  1  2  0  1  0  2 -1  2  0  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 17450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1 -1  0  1 -1  0  0  0  0  1 -1  1  0] (Indices: [0, 3, 6, 8, 11, 17, 19]), Candidate: [ 1  1  2 -1  1  2  0  1  0  1  1  0  1  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1 -1  0  0  0  0  0  1  0 -1  0  1  0] (Indices: [0, 3, 6, 8, 15, 16, 19]), Candidate: [ 1  1  2 -1  1  2  0  1  0  1  0  1  1  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  1 -1  1  0 -1  0  0  0  0  0  1  0] (Indices: [0, 3, 6, 9, 11, 12, 19]), Candidate: [ 1  1  2 -1  1  2  0  0  2  0  1  1  0  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  1 -1  0  0  1 -1  1 -1  0  1 -1  1] (Indices: [0, 3, 6, 9, 13, 15, 18]), Candidate: [ 1  1  2 -1  1  2  0  0  2  0  0  1  2  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  0  1  0 -1  0  0  0  1  0 -1  0  1] (Indices: [0, 3, 6, 10, 11, 16, 17]), Candidate: [ 1  1  2 -1  1  2  0  0  1  2  0  0  1  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  0  1 -1  0  0  1 -1  0  1 -1  1  0] (Indices: [0, 3, 6, 10, 14, 17, 19]), Candidate: [ 1  1  2 -1  1  2  0  0  1  2 -1  1  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 17750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  0  0  1 -1  0  1  0 -1  0  1 -1  1] (Indices: [0, 3, 6, 11, 14, 15, 18]), Candidate: [ 1  1  2 -1  1  2  0  0  1  1  1  0  1  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  0  0  0  1 -1  0  0  1  0 -1  1  0] (Indices: [0, 3, 6, 12, 16, 17, 19]), Candidate: [ 1  1  2 -1  1  2  0  0  1  1  0  2  0  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0  0 -1  1 -1  0  0  1 -1  0  0  0  1] (Indices: [0, 3, 7, 8, 9, 11, 15]), Candidate: [ 1  1  2 -1  1  1  2  0  1  0  1  0  1  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0 -1  1 -1  0  1 -1  0  1 -1  0  0  1] (Indices: [0, 3, 7, 8, 10, 13, 16]), Candidate: [ 1  1  2 -1  1  1  2  0  0  2 -1  1  2  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 17950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0 -1  0  0  1  0 -1  0  0  1 -1  0  1] (Indices: [0, 3, 7, 8, 12, 13, 17]), Candidate: [ 1  1  2 -1  1  1  2  0  0  1  0  2  1  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0 -1  0  0  0  0  0  0  1  0 -1  1  0] (Indices: [0, 3, 7, 8, 16, 17, 19]), Candidate: [ 1  1  2 -1  1  1  2  0  0  1  0  1  1  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  1 -1  1 -1  1 -1  0  0  0  1 -1  1] (Indices: [0, 3, 7, 9, 11, 13, 18]), Candidate: [ 1  1  2 -1  1  1  2 -1  2  0  1  0  2  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  1 -1  0  0  1 -1  0  0  1  0 -1  1] (Indices: [0, 3, 7, 9, 13, 17, 18]), Candidate: [ 1  1  2 -1  1  1  2 -1  2  0  0  1  2  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  0  1  0 -1  0  0  0  0  0  1  0  0] (Indices: [0, 3, 7, 10, 11, 18, 19]), Candidate: [ 1  1  2 -1  1  1  2 -1  1  2  0  0  1  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  0  1 -1  0  0  0  1 -1  1  0 -1  1] (Indices: [0, 3, 7, 10, 15, 17, 18]), Candidate: [ 1  1  2 -1  1  1  2 -1  1  2 -1  1  1  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 18250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  0  0  1 -1  0  1 -1  0  1  0 -1  1] (Indices: [0, 3, 7, 11, 14, 17, 18]), Candidate: [ 1  1  2 -1  1  1  2 -1  1  1  1  0  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 18300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  0  0  0  0  1  0  0 -1  0  1 -1  1] (Indices: [0, 3, 7, 13, 14, 15, 18]), Candidate: [ 1  1  2 -1  1  1  2 -1  1  1  0  1  2  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1  0  0 -1  0  1 -1  0  1 -1  0  0  1] (Indices: [0, 3, 8, 9, 10, 13, 16]), Candidate: [ 1  1  2 -1  1  1  1  1  1  1 -1  1  2  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1  0 -1  0  1  0 -1  0  0  1 -1  0  1] (Indices: [0, 3, 8, 9, 12, 13, 17]), Candidate: [ 1  1  2 -1  1  1  1  1  1  0  0  2  1  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1  0 -1  0  0  0  0  0  1  0 -1  1  0] (Indices: [0, 3, 8, 9, 16, 17, 19]), Candidate: [ 1  1  2 -1  1  1  1  1  1  0  0  1  1  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1 -1  1 -1  1 -1  0  0  0  1 -1  1  0] (Indices: [0, 3, 8, 10, 12, 17, 19]), Candidate: [ 1  1  2 -1  1  1  1  1  0  2 -1  2  0  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1 -1  0  1  0 -1  0  1 -1  0  1 -1  1] (Indices: [0, 3, 8, 11, 12, 15, 18]), Candidate: [ 1  1  2 -1  1  1  1  1  0  1  1  1  0  1  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1 -1  0  0  1  0 -1  1 -1  0  1 -1  1] (Indices: [0, 3, 8, 12, 13, 15, 18]), Candidate: [ 1  1  2 -1  1  1  1  1  0  1  0  2  1  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1 -1  0  0  0  0  1  0  0 -1  0  1  0] (Indices: [0, 3, 8, 14, 15, 16, 19]), Candidate: [ 1  1  2 -1  1  1  1  1  0  1  0  1  1  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  1  0 -1  1 -1  1 -1  0  0  1 -1  1] (Indices: [0, 3, 9, 10, 12, 14, 18]), Candidate: [ 1  1  2 -1  1  1  1  0  2  1 -1  2  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 18750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  1 -1  1  0  0 -1  0  0  1 -1  0  1] (Indices: [0, 3, 9, 11, 12, 13, 17]), Candidate: [ 1  1  2 -1  1  1  1  0  2  0  1  1  1  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  1 -1  1 -1  0  0  0  1  0 -1  1  0] (Indices: [0, 3, 9, 11, 16, 17, 19]), Candidate: [ 1  1  2 -1  1  1  1  0  2  0  1  0  1  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  1 -1  0  0  1 -1  1  0 -1  0  1  0] (Indices: [0, 3, 9, 13, 15, 16, 19]), Candidate: [ 1  1  2 -1  1  1  1  0  2  0  0  1  2  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  0  1  0 -1  1 -1  1 -1  1 -1  0  1] (Indices: [0, 3, 10, 11, 13, 15, 17]), Candidate: [ 1  1  2 -1  1  1  1  0  1  2  0  0  2  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  0  1 -1  1 -1  1 -1  1 -1  0  1  0] (Indices: [0, 3, 10, 12, 14, 16, 19]), Candidate: [ 1  1  2 -1  1  1  1  0  1  2 -1  2  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 19000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  0  0  1  0  0  0 -1  1 -1  0  0  1] (Indices: [0, 3, 11, 12, 13, 14, 16]), Candidate: [ 1  1  2 -1  1  1  1  0  1  1  1  1  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 19050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  0  0  1 -1  1 -1  0  1  0  0 -1  1] (Indices: [0, 3, 11, 13, 16, 17, 18]), Candidate: [ 1  1  2 -1  1  1  1  0  1  1  1  0  2  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  0  0  0  1 -1  0  1  0  0 -1  1  0] (Indices: [0, 3, 12, 15, 16, 17, 19]), Candidate: [ 1  1  2 -1  1  1  1  0  1  1  0  2  0  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  0  1 -1  0  0  0  1 -1  0  0  0  1] (Indices: [0, 4, 5, 6, 7, 10, 15]), Candidate: [ 1  1  1  1  1  1  1 -1  1  2 -1  1  1  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 19200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1  0 -1  0  0  0  0  0  0  0  0  1  0] (Indices: [0, 4, 5, 6, 8, 9, 19]), Candidate: [1 1 1 1 1 1 0 1 1 0 0 1 1 1 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 19250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  1  0 -1  0  0  0  1 -1  0  0  0  1] (Indices: [0, 4, 5, 6, 9, 10, 15]), Candidate: [ 1  1  1  1  1  1  0  0  2  1 -1  1  1  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  0  1 -1  1 -1  1 -1  0  0  0  0  1] (Indices: [0, 4, 5, 6, 10, 12, 14]), Candidate: [ 1  1  1  1  1  1  0  0  1  2 -1  2  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 19350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  0  0  1 -1  0  0  0  1 -1  1 -1  1] (Indices: [0, 4, 5, 6, 11, 16, 18]), Candidate: [1 1 1 1 1 1 0 0 1 1 1 0 1 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 19400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  0  0  0  0  0  1 -1  0  0  1  0  0] (Indices: [0, 4, 5, 6, 14, 18, 19]), Candidate: [ 1  1  1  1  1  1  0  0  1  1  0  1  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0 -1  0  0  0  1 -1  0  0  0  0  1  0] (Indices: [0, 4, 5, 7, 8, 13, 19]), Candidate: [1 1 1 1 1 0 2 0 0 1 0 1 2 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 19500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  1 -1  0  0  0  1 -1  0  0  0  1  0] (Indices: [0, 4, 5, 7, 9, 14, 19]), Candidate: [ 1  1  1  1  1  0  2 -1  2  0  0  1  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 19550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  0  0  1  0 -1  0  0  1 -1  0  0  1] (Indices: [0, 4, 5, 7, 11, 12, 16]), Candidate: [ 1  1  1  1  1  0  2 -1  1  1  1  1  0  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  0  0  0  0  1  0 -1  0  0  0  1  0] (Indices: [0, 4, 5, 7, 13, 14, 19]), Candidate: [ 1  1  1  1  1  0  2 -1  1  1  0  1  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 19650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1  0 -1  0  1 -1  0  1 -1  0  0  0  1] (Indices: [0, 4, 5, 8, 9, 12, 15]), Candidate: [1 1 1 1 1 0 1 1 1 0 0 2 0 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 19700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1 -1  1 -1  0  0  1 -1  0  0  1 -1  1] (Indices: [0, 4, 5, 8, 10, 14, 18]), Candidate: [ 1  1  1  1  1  0  1  1  0  2 -1  1  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 19750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1 -1  0  0  1 -1  1 -1  0  0  0  1  0] (Indices: [0, 4, 5, 8, 12, 14, 19]), Candidate: [ 1  1  1  1  1  0  1  1  0  1  0  2  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  1  0  0 -1  0  0  0  1 -1  0  0  1] (Indices: [0, 4, 5, 9, 10, 11, 16]), Candidate: [1 1 1 1 1 0 1 0 2 1 0 0 1 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 19850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  1 -1  1 -1  0  0  1  0 -1  0  0  1] (Indices: [0, 4, 5, 9, 11, 15, 16]), Candidate: [1 1 1 1 1 0 1 0 2 0 1 0 1 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 19900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  1 -1  0  0  0  1 -1  1  0 -1  0  1] (Indices: [0, 4, 5, 9, 14, 16, 17]), Candidate: [ 1  1  1  1  1  0  1  0  2  0  0  1  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  0  1 -1  1 -1  1  0 -1  0  0  0  1] (Indices: [0, 4, 5, 10, 12, 14, 15]), Candidate: [ 1  1  1  1  1  0  1  0  1  2 -1  2  0  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  0  0  1  0  0  0 -1  0  0  0  0  1] (Indices: [0, 4, 5, 11, 12, 13, 14]), Candidate: [ 1  1  1  1  1  0  1  0  1  1  1  1  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  0  0  1 -1  0  0  1 -1  1 -1  1  0] (Indices: [0, 4, 5, 11, 15, 17, 19]), Candidate: [1 1 1 1 1 0 1 0 1 1 1 0 1 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 20100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  0  0  0  0  1  0 -1  0  0  1  0  0] (Indices: [0, 4, 5, 13, 14, 18, 19]), Candidate: [ 1  1  1  1  1  0  1  0  1  1  0  1  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0 -1  0  1 -1  0  0  0  0  1 -1  0  1] (Indices: [0, 4, 6, 7, 8, 11, 17]), Candidate: [1 1 1 1 0 2 1 0 0 1 1 0 1 1 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 20200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  1 -1  0  1 -1  0  1 -1  0  0  0  1] (Indices: [0, 4, 6, 7, 9, 12, 15]), Candidate: [ 1  1  1  1  0  2  1 -1  2  0  0  2  0  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  0  1 -1  0  0  1 -1  0  0  1 -1  1] (Indices: [0, 4, 6, 7, 10, 14, 18]), Candidate: [ 1  1  1  1  0  2  1 -1  1  2 -1  1  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 20300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  0  0  0  1 -1  1 -1  0  0  0  1  0] (Indices: [0, 4, 6, 7, 12, 14, 19]), Candidate: [ 1  1  1  1  0  2  1 -1  1  1  0  2  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1  0  0 -1  0  0  0  1 -1  0  0  0  1] (Indices: [0, 4, 6, 8, 9, 10, 15]), Candidate: [ 1  1  1  1  0  2  0  1  1  1 -1  1  1  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1 -1  1 -1  1 -1  1 -1  0  0  0  0  1] (Indices: [0, 4, 6, 8, 10, 12, 14]), Candidate: [ 1  1  1  1  0  2  0  1  0  2 -1  2  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1 -1  0  1 -1  0  0  0  1 -1  1 -1  1] (Indices: [0, 4, 6, 8, 11, 16, 18]), Candidate: [1 1 1 1 0 2 0 1 0 1 1 0 1 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 20500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1 -1  0  0  0  0  1 -1  0  0  1  0  0] (Indices: [0, 4, 6, 8, 14, 18, 19]), Candidate: [ 1  1  1  1  0  2  0  1  0  1  0  1  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  1 -1  1  0 -1  0  0  1 -1  0  0  1] (Indices: [0, 4, 6, 9, 11, 12, 16]), Candidate: [1 1 1 1 0 2 0 0 2 0 1 1 0 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 20600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  1 -1  0  0  1  0 -1  0  0  0  1  0] (Indices: [0, 4, 6, 9, 13, 14, 19]), Candidate: [ 1  1  1  1  0  2  0  0  2  0  0  1  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  0  1  0 -1  0  0  1 -1  1 -1  0  1] (Indices: [0, 4, 6, 10, 11, 15, 17]), Candidate: [1 1 1 1 0 2 0 0 1 2 0 0 1 1 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 20700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  0  1 -1  0  0  1 -1  1 -1  1 -1  1] (Indices: [0, 4, 6, 10, 14, 16, 18]), Candidate: [ 1  1  1  1  0  2  0  0  1  2 -1  1  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  0  0  1 -1  1 -1  0  0  0  1  0  0] (Indices: [0, 4, 6, 11, 13, 18, 19]), Candidate: [1 1 1 1 0 2 0 0 1 1 1 0 2 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 20800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  0  0  0  1 -1  0  1 -1  1 -1  1  0] (Indices: [0, 4, 6, 12, 15, 17, 19]), Candidate: [1 1 1 1 0 2 0 0 1 1 0 2 0 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 20850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0  0 -1  1  0 -1  0  0  0  0  0  0  1] (Indices: [0, 4, 7, 8, 9, 11, 12]), Candidate: [1 1 1 1 0 1 2 0 1 0 1 1 0 1 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 20900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0 -1  1 -1  1 -1  0  0  0  0  0  1  0] (Indices: [0, 4, 7, 8, 10, 12, 19]), Candidate: [ 1  1  1  1  0  1  2  0  0  2 -1  2  0  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0 -1  0  0  1  0  0 -1  0  0  0  0  1] (Indices: [0, 4, 7, 8, 12, 13, 14]), Candidate: [ 1  1  1  1  0  1  2  0  0  1  0  2  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0 -1  0  0  0  0  0  1 -1  1 -1  1  0] (Indices: [0, 4, 7, 8, 15, 17, 19]), Candidate: [1 1 1 1 0 1 2 0 0 1 0 1 1 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 21050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  1 -1  1 -1  1 -1  1 -1  0  0  0  1] (Indices: [0, 4, 7, 9, 11, 13, 15]), Candidate: [ 1  1  1  1  0  1  2 -1  2  0  1  0  2  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  1 -1  0  0  1 -1  0  1  0 -1  0  1] (Indices: [0, 4, 7, 9, 13, 16, 17]), Candidate: [ 1  1  1  1  0  1  2 -1  2  0  0  1  2  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  0  1  0 -1  0  0  0  1 -1  0  1  0] (Indices: [0, 4, 7, 10, 11, 16, 19]), Candidate: [ 1  1  1  1  0  1  2 -1  1  2  0  0  1  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  0  1 -1  0  0  0  1  0  0 -1  0  1] (Indices: [0, 4, 7, 10, 15, 16, 17]), Candidate: [ 1  1  1  1  0  1  2 -1  1  2 -1  1  1  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  0  0  1 -1  0  1 -1  1  0 -1  0  1] (Indices: [0, 4, 7, 11, 14, 16, 17]), Candidate: [ 1  1  1  1  0  1  2 -1  1  1  1  0  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  0  0  0  1 -1  0  0  0  1  0  0  0] (Indices: [0, 4, 7, 12, 17, 18, 19]), Candidate: [ 1  1  1  1  0  1  2 -1  1  1  0  2  0  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1  0  0 -1  1 -1  0  0  0  0  0  1  0] (Indices: [0, 4, 8, 9, 10, 12, 19]), Candidate: [ 1  1  1  1  0  1  1  1  1  1 -1  2  0  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1  0 -1  0  1  0  0 -1  0  0  0  0  1] (Indices: [0, 4, 8, 9, 12, 13, 14]), Candidate: [ 1  1  1  1  0  1  1  1  1  0  0  2  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1  0 -1  0  0  0  0  1 -1  1 -1  1  0] (Indices: [0, 4, 8, 9, 15, 17, 19]), Candidate: [1 1 1 1 0 1 1 1 1 0 0 1 1 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 21500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1 -1  1 -1  1 -1  0  0  1 -1  1 -1  1] (Indices: [0, 4, 8, 10, 12, 16, 18]), Candidate: [ 1  1  1  1  0  1  1  1  0  2 -1  2  0  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1 -1  0  1  0 -1  1 -1  0  0  0  1  0] (Indices: [0, 4, 8, 11, 12, 14, 19]), Candidate: [ 1  1  1  1  0  1  1  1  0  1  1  1  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1 -1  0  0  1  0  0 -1  0  0  0  1  0] (Indices: [0, 4, 8, 12, 13, 14, 19]), Candidate: [ 1  1  1  1  0  1  1  1  0  1  0  2  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1 -1  0  0  0  1 -1  0  0  1  0  0  0] (Indices: [0, 4, 8, 13, 17, 18, 19]), Candidate: [1 1 1 1 0 1 1 1 0 1 0 1 2 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 21700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  1  0 -1  1 -1  1  0 -1  0  0  0  1] (Indices: [0, 4, 9, 10, 12, 14, 15]), Candidate: [ 1  1  1  1  0  1  1  0  2  1 -1  2  0  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  1 -1  1  0  0  0 -1  0  0  0  0  1] (Indices: [0, 4, 9, 11, 12, 13, 14]), Candidate: [ 1  1  1  1  0  1  1  0  2  0  1  1  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  1 -1  1 -1  0  0  1 -1  1 -1  1  0] (Indices: [0, 4, 9, 11, 15, 17, 19]), Candidate: [1 1 1 1 0 1 1 0 2 0 1 0 1 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 21850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  1 -1  0  0  1  0 -1  0  0  1  0  0] (Indices: [0, 4, 9, 13, 14, 18, 19]), Candidate: [ 1  1  1  1  0  1  1  0  2  0  0  1  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  0  1  0 -1  1  0 -1  0  0  1 -1  1] (Indices: [0, 4, 10, 11, 13, 14, 18]), Candidate: [ 1  1  1  1  0  1  1  0  1  2  0  0  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  0  1 -1  1 -1  1  0 -1  0  0  1  0] (Indices: [0, 4, 10, 12, 14, 15, 19]), Candidate: [ 1  1  1  1  0  1  1  0  1  2 -1  2  0  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  0  1 -1  0  0  0  1 -1  1  0  0  0] (Indices: [0, 4, 10, 15, 17, 18, 19]), Candidate: [ 1  1  1  1  0  1  1  0  1  2 -1  1  1  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  0  0  1 -1  1 -1  1 -1  1  0 -1  1] (Indices: [0, 4, 11, 13, 15, 17, 18]), Candidate: [1 1 1 1 0 1 1 0 1 1 1 0 2 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 22100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  0  0  0  1 -1  1 -1  1 -1  1  0  0] (Indices: [0, 4, 12, 14, 16, 18, 19]), Candidate: [ 1  1  1  1  0  1  1  0  1  1  0  2  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0 -1  0  1 -1  0  0  1 -1  0  0  0  1] (Indices: [0, 5, 6, 7, 8, 11, 15]), Candidate: [1 1 1 0 2 1 1 0 0 1 1 0 1 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 22200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  1 -1  0  1  0 -1  0  0  0  0  0  1] (Indices: [0, 5, 6, 7, 9, 12, 13]), Candidate: [ 1  1  1  0  2  1  1 -1  2  0  0  2  1  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  0  1 -1  0  0  1 -1  1 -1  0  0  1] (Indices: [0, 5, 6, 7, 10, 14, 16]), Candidate: [ 1  1  1  0  2  1  1 -1  1  2 -1  1  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 22300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  0  0  0  1 -1  1 -1  0  1 -1  0  1] (Indices: [0, 5, 6, 7, 12, 14, 17]), Candidate: [ 1  1  1  0  2  1  1 -1  1  1  0  2  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 22350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1  0  0 -1  0  1 -1  0  0  0  0  0  1] (Indices: [0, 5, 6, 8, 9, 10, 13]), Candidate: [ 1  1  1  0  2  1  0  1  1  1 -1  1  2  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1 -1  1  0 -1  0  0  0  0  0  0  1  0] (Indices: [0, 5, 6, 8, 10, 11, 19]), Candidate: [1 1 1 0 2 1 0 1 0 2 0 0 1 1 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 22450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1 -1  0  1 -1  0  0  1 -1  0  0  1  0] (Indices: [0, 5, 6, 8, 11, 15, 19]), Candidate: [1 1 1 0 2 1 0 1 0 1 1 0 1 1 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 22500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1 -1  0  0  0  0  1 -1  0  1  0 -1  1] (Indices: [0, 5, 6, 8, 14, 17, 18]), Candidate: [ 1  1  1  0  2  1  0  1  0  1  0  1  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  1 -1  1  0 -1  1 -1  0  0  0  0  1] (Indices: [0, 5, 6, 9, 11, 12, 14]), Candidate: [ 1  1  1  0  2  1  0  0  2  0  1  1  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  1 -1  0  0  1  0 -1  0  1 -1  0  1] (Indices: [0, 5, 6, 9, 13, 14, 17]), Candidate: [ 1  1  1  0  2  1  0  0  2  0  0  1  2  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  0  1  0 -1  0  1 -1  0  0  0  1  0] (Indices: [0, 5, 6, 10, 11, 14, 19]), Candidate: [ 1  1  1  0  2  1  0  0  1  2  0  0  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  0  1 -1  0  0  1  0 -1  0  0  1  0] (Indices: [0, 5, 6, 10, 14, 15, 19]), Candidate: [ 1  1  1  0  2  1  0  0  1  2 -1  1  1  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  0  0  1 -1  1 -1  0  0  1  0 -1  1] (Indices: [0, 5, 6, 11, 13, 17, 18]), Candidate: [1 1 1 0 2 1 0 0 1 1 1 0 2 0 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 22800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  0  0  0  1 -1  0  1  0 -1  0  1  0] (Indices: [0, 5, 6, 12, 15, 16, 19]), Candidate: [1 1 1 0 2 1 0 0 1 1 0 2 0 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 22850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0  0  0 -1  0  0  0  0  0  0  1 -1  1] (Indices: [0, 5, 7, 8, 9, 10, 18]), Candidate: [ 1  1  1  0  2  0  2  0  1  1 -1  1  1  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0 -1  1 -1  1 -1  0  0  0  1 -1  0  1] (Indices: [0, 5, 7, 8, 10, 12, 17]), Candidate: [ 1  1  1  0  2  0  2  0  0  2 -1  2  0  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0 -1  0  1 -1  0  0  0  0  1 -1  1  0] (Indices: [0, 5, 7, 8, 11, 17, 19]), Candidate: [1 1 1 0 2 0 2 0 0 1 1 0 1 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 23000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0 -1  0  0  0  0  0  1  0 -1  0  1  0] (Indices: [0, 5, 7, 8, 15, 16, 19]), Candidate: [1 1 1 0 2 0 2 0 0 1 0 1 1 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 23050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  1 -1  1  0 -1  0  0  0  0  0  1  0] (Indices: [0, 5, 7, 9, 11, 12, 19]), Candidate: [ 1  1  1  0  2  0  2 -1  2  0  1  1  0  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  1 -1  0  0  1 -1  1 -1  0  1 -1  1] (Indices: [0, 5, 7, 9, 13, 15, 18]), Candidate: [ 1  1  1  0  2  0  2 -1  2  0  0  1  2  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  0  1  0 -1  0  0  0  1  0 -1  0  1] (Indices: [0, 5, 7, 10, 11, 16, 17]), Candidate: [ 1  1  1  0  2  0  2 -1  1  2  0  0  1  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  0  1 -1  0  0  1 -1  0  1 -1  1  0] (Indices: [0, 5, 7, 10, 14, 17, 19]), Candidate: [ 1  1  1  0  2  0  2 -1  1  2 -1  1  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 23250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  0  0  1 -1  0  1  0 -1  0  1 -1  1] (Indices: [0, 5, 7, 11, 14, 15, 18]), Candidate: [ 1  1  1  0  2  0  2 -1  1  1  1  0  1  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  0  0  0  1 -1  0  0  1  0 -1  1  0] (Indices: [0, 5, 7, 12, 16, 17, 19]), Candidate: [ 1  1  1  0  2  0  2 -1  1  1  0  2  0  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1  0  0 -1  1 -1  0  0  0  1 -1  0  1] (Indices: [0, 5, 8, 9, 10, 12, 17]), Candidate: [ 1  1  1  0  2  0  1  1  1  1 -1  2  0  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1  0 -1  1 -1  0  0  0  0  1 -1  1  0] (Indices: [0, 5, 8, 9, 11, 17, 19]), Candidate: [1 1 1 0 2 0 1 1 1 0 1 0 1 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 23450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1  0 -1  0  0  0  0  1  0 -1  0  1  0] (Indices: [0, 5, 8, 9, 15, 16, 19]), Candidate: [1 1 1 0 2 0 1 1 1 0 0 1 1 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 23500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1 -1  1 -1  1 -1  0  1 -1  0  0  1  0] (Indices: [0, 5, 8, 10, 12, 15, 19]), Candidate: [ 1  1  1  0  2  0  1  1  0  2 -1  2  0  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1 -1  0  1  0 -1  1 -1  0  1 -1  0  1] (Indices: [0, 5, 8, 11, 12, 14, 17]), Candidate: [ 1  1  1  0  2  0  1  1  0  1  1  1  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1 -1  0  0  1  0  0 -1  0  1 -1  0  1] (Indices: [0, 5, 8, 12, 13, 14, 17]), Candidate: [ 1  1  1  0  2  0  1  1  0  1  0  2  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1 -1  0  0  0  1 -1  0  1  0 -1  1  0] (Indices: [0, 5, 8, 13, 16, 17, 19]), Candidate: [1 1 1 0 2 0 1 1 0 1 0 1 2 0 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 23700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  1  0 -1  1  0 -1  0  0  0  1 -1  1] (Indices: [0, 5, 9, 10, 12, 13, 18]), Candidate: [ 1  1  1  0  2  0  1  0  2  1 -1  2  1  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  1  0 -1  0  0  0  0  1 -1  1  0  0] (Indices: [0, 5, 9, 10, 16, 18, 19]), Candidate: [ 1  1  1  0  2  0  1  0  2  1 -1  1  1  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  1 -1  1 -1  0  0  1  0 -1  0  1  0] (Indices: [0, 5, 9, 11, 15, 16, 19]), Candidate: [1 1 1 0 2 0 1 0 2 0 1 0 1 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 23850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  1 -1  0  0  1  0 -1  0  1  0 -1  1] (Indices: [0, 5, 9, 13, 14, 17, 18]), Candidate: [ 1  1  1  0  2  0  1  0  2  0  0  1  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  0  1  0 -1  1  0 -1  1 -1  0  0  1] (Indices: [0, 5, 10, 11, 13, 14, 16]), Candidate: [ 1  1  1  0  2  0  1  0  1  2  0  0  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  0  1 -1  1 -1  1  0 -1  1 -1  0  1] (Indices: [0, 5, 10, 12, 14, 15, 17]), Candidate: [ 1  1  1  0  2  0  1  0  1  2 -1  2  0  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  0  1 -1  0  0  0  1  0  0 -1  1  0] (Indices: [0, 5, 10, 15, 16, 17, 19]), Candidate: [ 1  1  1  0  2  0  1  0  1  2 -1  1  1  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  0  0  1 -1  1 -1  1  0 -1  1 -1  1] (Indices: [0, 5, 11, 13, 15, 16, 18]), Candidate: [1 1 1 0 2 0 1 0 1 1 1 0 2 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 24100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  0  0  0  1 -1  1 -1  1  0  0 -1  1] (Indices: [0, 5, 12, 14, 16, 17, 18]), Candidate: [ 1  1  1  0  2  0  1  0  1  1  0  2  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0  0 -1  0  1 -1  0  0  1 -1  0  0  1] (Indices: [0, 6, 7, 8, 9, 12, 16]), Candidate: [1 1 1 0 1 2 1 0 1 0 0 2 0 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 24200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0 -1  1 -1  0  0  1 -1  0  0  0  1  0] (Indices: [0, 6, 7, 8, 10, 14, 19]), Candidate: [ 1  1  1  0  1  2  1  0  0  2 -1  1  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 24250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0 -1  0  0  1 -1  0  1  0 -1  0  0  1] (Indices: [0, 6, 7, 8, 12, 15, 16]), Candidate: [1 1 1 0 1 2 1 0 0 1 0 2 0 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 24300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  1  0  0 -1  0  0  0  0  1 -1  0  1] (Indices: [0, 6, 7, 9, 10, 11, 17]), Candidate: [ 1  1  1  0  1  2  1 -1  2  1  0  0  1  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  1 -1  1 -1  0  0  1 -1  1 -1  0  1] (Indices: [0, 6, 7, 9, 11, 15, 17]), Candidate: [ 1  1  1  0  1  2  1 -1  2  0  1  0  1  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  1 -1  0  0  0  1 -1  1 -1  1 -1  1] (Indices: [0, 6, 7, 9, 14, 16, 18]), Candidate: [ 1  1  1  0  1  2  1 -1  2  0  0  1  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 24450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  0  1 -1  1 -1  1 -1  1 -1  0  0  1] (Indices: [0, 6, 7, 10, 12, 14, 16]), Candidate: [ 1  1  1  0  1  2  1 -1  1  2 -1  2  0  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 24500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  0  0  1  0  0 -1  1 -1  0  0  0  1] (Indices: [0, 6, 7, 11, 12, 13, 15]), Candidate: [ 1  1  1  0  1  2  1 -1  1  1  1  1  1  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  0  0  1 -1  0  0  1 -1  0  1  0  0] (Indices: [0, 6, 7, 11, 15, 18, 19]), Candidate: [ 1  1  1  0  1  2  1 -1  1  1  1  0  1  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  0  0  0  0  1 -1  1  0  0 -1  0  1] (Indices: [0, 6, 7, 13, 15, 16, 17]), Candidate: [ 1  1  1  0  1  2  1 -1  1  1  0  1  2  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1  0  0 -1  0  0  1 -1  0  0  0  1  0] (Indices: [0, 6, 8, 9, 10, 14, 19]), Candidate: [ 1  1  1  0  1  2  0  1  1  1 -1  1  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 24700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1  0 -1  0  1 -1  0  1  0 -1  0  0  1] (Indices: [0, 6, 8, 9, 12, 15, 16]), Candidate: [1 1 1 0 1 2 0 1 1 0 0 2 0 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 24750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1 -1  1  0  0 -1  0  0  0  0  1 -1  1] (Indices: [0, 6, 8, 10, 11, 12, 18]), Candidate: [1 1 1 0 1 2 0 1 0 2 0 1 0 1 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 24800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1 -1  1 -1  0  1 -1  1 -1  1 -1  0  1] (Indices: [0, 6, 8, 10, 13, 15, 17]), Candidate: [ 1  1  1  0  1  2  0  1  0  2 -1  1  2  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1 -1  0  1 -1  1  0  0 -1  0  0  0  1] (Indices: [0, 6, 8, 11, 13, 14, 15]), Candidate: [1 1 1 0 1 2 0 1 0 1 1 0 2 1 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 24900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1 -1  0  0  1 -1  1  0  0 -1  0  0  1] (Indices: [0, 6, 8, 12, 14, 15, 16]), Candidate: [1 1 1 0 1 2 0 1 0 1 0 2 0 2 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 24950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1 -1  0  0  0  0  0  1  0  0  0 -1  1] (Indices: [0, 6, 8, 15, 16, 17, 18]), Candidate: [1 1 1 0 1 2 0 1 0 1 0 1 1 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 25000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  1  0 -1  1 -1  0  0  1 -1  0  1  0] (Indices: [0, 6, 9, 10, 12, 16, 19]), Candidate: [ 1  1  1  0  1  2  0  0  2  1 -1  2  0  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  1 -1  1  0 -1  0  1  0 -1  0  0  1] (Indices: [0, 6, 9, 11, 12, 15, 16]), Candidate: [1 1 1 0 1 2 0 0 2 0 1 1 0 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 25100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  1 -1  0  1  0 -1  1  0 -1  0  0  1] (Indices: [0, 6, 9, 12, 13, 15, 16]), Candidate: [1 1 1 0 1 2 0 0 2 0 0 2 1 0 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 25150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  1 -1  0  0  0  1  0  0  0 -1  0  1] (Indices: [0, 6, 9, 14, 15, 16, 17]), Candidate: [1 1 1 0 1 2 0 0 2 0 0 1 1 2 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 25200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  0  1  0 -1  1 -1  0  0  0  1  0  0] (Indices: [0, 6, 10, 11, 13, 18, 19]), Candidate: [1 1 1 0 1 2 0 0 1 2 0 0 2 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 25250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  0  1 -1  1 -1  0  1 -1  1 -1  1  0] (Indices: [0, 6, 10, 12, 15, 17, 19]), Candidate: [ 1  1  1  0  1  2  0  0  1  2 -1  2  0  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  0  0  1  0  0 -1  0  1  0 -1  0  1] (Indices: [0, 6, 11, 12, 13, 16, 17]), Candidate: [1 1 1 0 1 2 0 0 1 1 1 1 1 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 25350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  0  0  1 -1  0  1  0 -1  1 -1  1  0] (Indices: [0, 6, 11, 14, 15, 17, 19]), Candidate: [1 1 1 0 1 2 0 0 1 1 1 0 1 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 25400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  0  0  0  0  1  0  0 -1  1 -1  1  0] (Indices: [0, 6, 13, 14, 15, 17, 19]), Candidate: [1 1 1 0 1 2 0 0 1 1 0 1 2 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 25450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0  0  0 -1  0  0  0  0  0  1  0 -1  1] (Indices: [0, 7, 8, 9, 10, 17, 18]), Candidate: [ 1  1  1  0  1  1  2  0  1  1 -1  1  1  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0  0 -1  0  1 -1  0  0  0  1 -1  1  0] (Indices: [0, 7, 8, 9, 12, 17, 19]), Candidate: [1 1 1 0 1 1 2 0 1 0 0 2 0 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 25550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0 -1  1  0 -1  0  1  0 -1  0  0  0  1] (Indices: [0, 7, 8, 10, 11, 14, 15]), Candidate: [1 1 1 0 1 1 2 0 0 2 0 0 1 2 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 25600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0 -1  1 -1  0  1 -1  0  0  0  1  0  0] (Indices: [0, 7, 8, 10, 13, 18, 19]), Candidate: [ 1  1  1  0  1  1  2  0  0  2 -1  1  2  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0 -1  0  1 -1  1 -1  1 -1  0  0  1  0] (Indices: [0, 7, 8, 11, 13, 15, 19]), Candidate: [1 1 1 0 1 1 2 0 0 1 1 0 2 0 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 25700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0 -1  0  0  1 -1  1 -1  0  1 -1  1  0] (Indices: [0, 7, 8, 12, 14, 17, 19]), Candidate: [ 1  1  1  0  1  1  2  0  0  1  0  2  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  1  0  0  0 -1  0  0  1 -1  0  0  1] (Indices: [0, 7, 9, 10, 11, 12, 16]), Candidate: [ 1  1  1  0  1  1  2 -1  2  1  0  1  0  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  1  0 -1  0  1  0 -1  0  0  0  1  0] (Indices: [0, 7, 9, 10, 13, 14, 19]), Candidate: [ 1  1  1  0  1  1  2 -1  2  1 -1  1  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 25850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  1 -1  1  0 -1  0  0  0  1 -1  1  0] (Indices: [0, 7, 9, 11, 12, 17, 19]), Candidate: [ 1  1  1  0  1  1  2 -1  2  0  1  1  0  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  1 -1  0  1  0 -1  0  0  1 -1  1  0] (Indices: [0, 7, 9, 12, 13, 17, 19]), Candidate: [ 1  1  1  0  1  1  2 -1  2  0  0  2  1  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  1 -1  0  0  0  1 -1  1 -1  1  0  0] (Indices: [0, 7, 9, 14, 16, 18, 19]), Candidate: [ 1  1  1  0  1  1  2 -1  2  0  0  1  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 26000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  0  1  0 -1  0  1 -1  0  1  0 -1  1] (Indices: [0, 7, 10, 11, 14, 17, 18]), Candidate: [ 1  1  1  0  1  1  2 -1  1  2  0  0  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 26050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  0  1 -1  0  1  0  0 -1  0  1 -1  1] (Indices: [0, 7, 10, 13, 14, 15, 18]), Candidate: [ 1  1  1  0  1  1  2 -1  1  2 -1  1  2  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 26100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  0  0  1  0 -1  1  0 -1  0  1 -1  1] (Indices: [0, 7, 11, 12, 14, 15, 18]), Candidate: [ 1  1  1  0  1  1  2 -1  1  1  1  1  0  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  0  0  1 -1  0  0  1  0 -1  1  0  0] (Indices: [0, 7, 11, 15, 16, 18, 19]), Candidate: [ 1  1  1  0  1  1  2 -1  1  1  1  0  1  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  0  0  0  0  1 -1  1  0 -1  1  0  0] (Indices: [0, 7, 13, 15, 16, 18, 19]), Candidate: [ 1  1  1  0  1  1  2 -1  1  1  0  1  2  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1  0  0 -1  1 -1  0  1 -1  0  1 -1  1] (Indices: [0, 8, 9, 10, 12, 15, 18]), Candidate: [ 1  1  1  0  1  1  1  1  1  1 -1  2  0  1  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1  0 -1  1  0 -1  1 -1  1 -1  0  0  1] (Indices: [0, 8, 9, 11, 12, 14, 16]), Candidate: [ 1  1  1  0  1  1  1  1  1  0  1  1  0  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1  0 -1  0  1  0  0 -1  1 -1  0  0  1] (Indices: [0, 8, 9, 12, 13, 14, 16]), Candidate: [ 1  1  1  0  1  1  1  1  1  0  0  2  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1  0 -1  0  0  1 -1  0  1  0  0 -1  1] (Indices: [0, 8, 9, 13, 16, 17, 18]), Candidate: [1 1 1 0 1 1 1 1 1 0 0 1 2 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 26450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1 -1  1  0 -1  1 -1  0  1 -1  1 -1  1] (Indices: [0, 8, 10, 11, 13, 16, 18]), Candidate: [1 1 1 0 1 1 1 1 0 2 0 0 2 0 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 26500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1 -1  1 -1  1 -1  0  1  0  0 -1  0  1] (Indices: [0, 8, 10, 12, 15, 16, 17]), Candidate: [ 1  1  1  0  1  1  1  1  0  2 -1  2  0  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1 -1  0  1  0  0 -1  1  0 -1  0  0  1] (Indices: [0, 8, 11, 12, 13, 15, 16]), Candidate: [1 1 1 0 1 1 1 1 0 1 1 1 1 0 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 26600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1 -1  0  1 -1  0  1  0  0  0 -1  0  1] (Indices: [0, 8, 11, 14, 15, 16, 17]), Candidate: [1 1 1 0 1 1 1 1 0 1 1 0 1 2 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 26650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1 -1  0  0  0  1  0  0  0  0 -1  0  1] (Indices: [0, 8, 13, 14, 15, 16, 17]), Candidate: [1 1 1 0 1 1 1 1 0 1 0 1 2 1 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 26700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  1  0  0 -1  1 -1  1 -1  0  0  1  0] (Indices: [0, 9, 10, 11, 13, 15, 19]), Candidate: [1 1 1 0 1 1 1 0 2 1 0 0 2 0 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 26750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  1  0 -1  1 -1  1 -1  0  1 -1  1  0] (Indices: [0, 9, 10, 12, 14, 17, 19]), Candidate: [ 1  1  1  0  1  1  1  0  2  1 -1  2  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 26800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  1 -1  1  0  0  0 -1  0  0  1 -1  1] (Indices: [0, 9, 11, 12, 13, 14, 18]), Candidate: [ 1  1  1  0  1  1  1  0  2  0  1  1  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  1 -1  1 -1  1 -1  0  1 -1  1  0  0] (Indices: [0, 9, 11, 13, 16, 18, 19]), Candidate: [1 1 1 0 1 1 1 0 2 0 1 0 2 0 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 26900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  1 -1  0  1 -1  0  1 -1  1  0  0  0] (Indices: [0, 9, 12, 15, 17, 18, 19]), Candidate: [1 1 1 0 1 1 1 0 2 0 0 2 0 1 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 26950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  0  1  0  0 -1  0  1  0 -1  0  1  0] (Indices: [0, 10, 11, 12, 15, 16, 19]), Candidate: [1 1 1 0 1 1 1 0 1 2 0 1 0 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 27000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  0  1 -1  1  0  0 -1  0  1  0 -1  1] (Indices: [0, 10, 12, 13, 14, 17, 18]), Candidate: [ 1  1  1  0  1  1  1  0  1  2 -1  2  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  0  0  1  0  0  0  0 -1  1 -1  0  1] (Indices: [0, 11, 12, 13, 14, 15, 17]), Candidate: [1 1 1 0 1 1 1 0 1 1 1 1 1 1 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 27100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  0  0  1 -1  0  1  0  0  0 -1  1  0] (Indices: [0, 11, 14, 15, 16, 17, 19]), Candidate: [1 1 1 0 1 1 1 0 1 1 1 0 1 2 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 27150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  0  0  0  1 -1  0  0  0  0  0  0  0] (Indices: [1, 2, 3, 4, 5, 7, 12]), Candidate: [ 3  1  1  0  1  0  2 -1  1  1  0  2  0  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  0  0  0  1 -1  0  0  0  1 -1  0  0] (Indices: [1, 2, 3, 4, 5, 12, 17]), Candidate: [3 1 1 0 1 0 1 0 1 1 0 2 0 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 27250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  1 -1  0  0  1 -1  0  0  0  0  0  0] (Indices: [1, 2, 3, 4, 6, 9, 13]), Candidate: [3 1 1 0 0 2 0 0 2 0 0 1 2 0 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 27300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  0  0  0  0  0  0  0  0  1 -1  1 -1] (Indices: [1, 2, 3, 4, 6, 17, 19]), Candidate: [3 1 1 0 0 2 0 0 1 1 0 1 1 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 27350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  0  0  0  0  1 -1  0  0  1 -1  0  0] (Indices: [1, 2, 3, 4, 7, 13, 17]), Candidate: [ 3  1  1  0  0  1  2 -1  1  1  0  1  2  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1 -1  0  0  1 -1  0  0  0  0  1 -1  0] (Indices: [1, 2, 3, 4, 8, 12, 18]), Candidate: [3 1 1 0 0 1 1 1 0 1 0 2 0 1 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 27450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  1 -1  0  0  1 -1  0  0  1 -1  0  0] (Indices: [1, 2, 3, 4, 9, 13, 17]), Candidate: [3 1 1 0 0 1 1 0 2 0 0 1 2 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 27500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  0  1 -1  0  0  0  0  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 10, 16, 19]), Candidate: [ 3  1  1  0  0  1  1  0  1  2 -1  1  1  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  0  0  0  1 -1  0  0  0  1  0 -1  0] (Indices: [1, 2, 3, 4, 12, 17, 18]), Candidate: [3 1 1 0 0 1 1 0 1 1 0 2 0 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 27600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1  0 -1  0  0  0  0  0  0  0  0  0  0] (Indices: [1, 2, 3, 5, 6, 8, 9]), Candidate: [ 3  1  1 -1  2  1  0  1  1  0  0  1  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  0  0  0  0  1 -1  0  0  0  0  1 -1] (Indices: [1, 2, 3, 5, 6, 13, 19]), Candidate: [ 3  1  1 -1  2  1  0  0  1  1  0  1  2  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  0  0  1 -1  0  0  0  1 -1  0  0  0] (Indices: [1, 2, 3, 5, 7, 11, 16]), Candidate: [ 3  1  1 -1  2  0  2 -1  1  1  1  0  1  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1 -1  1 -1  0  0  0  0  0  0  0  1 -1] (Indices: [1, 2, 3, 5, 8, 10, 19]), Candidate: [ 3  1  1 -1  2  0  1  1  0  2 -1  1  1  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  1 -1  1 -1  0  0  0  1 -1  0  0  0] (Indices: [1, 2, 3, 5, 9, 11, 16]), Candidate: [ 3  1  1 -1  2  0  1  0  2  0  1  0  1  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  0  1 -1  0  1 -1  0  0  1 -1  0  0] (Indices: [1, 2, 3, 5, 10, 13, 17]), Candidate: [ 3  1  1 -1  2  0  1  0  1  2 -1  1  2  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  0  0  0  1  0 -1  0  0  0  1 -1  0] (Indices: [1, 2, 3, 5, 12, 13, 18]), Candidate: [ 3  1  1 -1  2  0  1  0  1  1  0  2  1  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  0  0  0  0  0  0  0  1 -1  1  0 -1] (Indices: [1, 2, 3, 5, 16, 18, 19]), Candidate: [ 3  1  1 -1  2  0  1  0  1  1  0  1  1  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  0  0  0  0  1 -1  0  0  1 -1  0  0] (Indices: [1, 2, 3, 6, 7, 13, 17]), Candidate: [ 3  1  1 -1  1  2  1 -1  1  1  0  1  2  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1 -1  0  0  1 -1  0  0  0  0  1 -1  0] (Indices: [1, 2, 3, 6, 8, 12, 18]), Candidate: [ 3  1  1 -1  1  2  0  1  0  1  0  2  0  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  1 -1  0  0  1 -1  0  0  1 -1  0  0] (Indices: [1, 2, 3, 6, 9, 13, 17]), Candidate: [ 3  1  1 -1  1  2  0  0  2  0  0  1  2  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  0  1 -1  0  0  0  0  1 -1  0  1 -1] (Indices: [1, 2, 3, 6, 10, 16, 19]), Candidate: [ 3  1  1 -1  1  2  0  0  1  2 -1  1  1  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  0  0  0  1 -1  0  0  0  1  0 -1  0] (Indices: [1, 2, 3, 6, 12, 17, 18]), Candidate: [ 3  1  1 -1  1  2  0  0  1  1  0  2  0  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0 -1  1 -1  0  1 -1  0  0  0  0  0  0] (Indices: [1, 2, 3, 7, 8, 10, 13]), Candidate: [ 3  1  1 -1  1  1  2  0  0  2 -1  1  2  0  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  1  0 -1  0  0  0  0  0  0  1 -1  0] (Indices: [1, 2, 3, 7, 9, 10, 18]), Candidate: [ 3  1  1 -1  1  1  2 -1  2  1 -1  1  1  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 28350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  0  1 -1  1 -1  0  0  0  1 -1  0  0] (Indices: [1, 2, 3, 7, 10, 12, 17]), Candidate: [ 3  1  1 -1  1  1  2 -1  1  2 -1  2  0  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 28400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  0  0  1 -1  0  0  0  0  1 -1  1 -1] (Indices: [1, 2, 3, 7, 11, 17, 19]), Candidate: [ 3  1  1 -1  1  1  2 -1  1  1  1  0  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  0  0  0  0  0  0  1  0 -1  0  1 -1] (Indices: [1, 2, 3, 7, 15, 16, 19]), Candidate: [ 3  1  1 -1  1  1  2 -1  1  1  0  1  1  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1  0 -1  0  0  0  0  0  0  1  0 -1  0] (Indices: [1, 2, 3, 8, 9, 17, 18]), Candidate: [ 3  1  1 -1  1  1  1  1  1  0  0  1  1  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1 -1  0  1 -1  1 -1  0  0  0  1 -1  0] (Indices: [1, 2, 3, 8, 11, 13, 18]), Candidate: [ 3  1  1 -1  1  1  1  1  0  1  1  0  2  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1 -1  0  0  0  1 -1  0  0  1  0 -1  0] (Indices: [1, 2, 3, 8, 13, 17, 18]), Candidate: [ 3  1  1 -1  1  1  1  1  0  1  0  1  2  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  1  0 -1  0  0  0  1 -1  1 -1  0  0] (Indices: [1, 2, 3, 9, 10, 15, 17]), Candidate: [ 3  1  1 -1  1  1  1  0  2  1 -1  1  1  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  1 -1  0  1 -1  0  1 -1  0  1 -1  0] (Indices: [1, 2, 3, 9, 12, 15, 18]), Candidate: [ 3  1  1 -1  1  1  1  0  2  0  0  2  0  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  0  1  0 -1  1  0 -1  0  0  0  0  0] (Indices: [1, 2, 3, 10, 11, 13, 14]), Candidate: [ 3  1  1 -1  1  1  1  0  1  2  0  0  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  0  1 -1  0  1 -1  1 -1  0  0  1 -1] (Indices: [1, 2, 3, 10, 13, 15, 19]), Candidate: [ 3  1  1 -1  1  1  1  0  1  2 -1  1  2  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  0  0  1 -1  1  0 -1  0  1 -1  0  0] (Indices: [1, 2, 3, 11, 13, 14, 17]), Candidate: [ 3  1  1 -1  1  1  1  0  1  1  1  0  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  0  0  0  1 -1  1  0 -1  0  1 -1  0] (Indices: [1, 2, 3, 12, 14, 15, 18]), Candidate: [ 3  1  1 -1  1  1  1  0  1  1  0  2  0  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  0  0  0  0  0  0  1  0 -1  1  0 -1] (Indices: [1, 2, 3, 15, 16, 18, 19]), Candidate: [ 3  1  1 -1  1  1  1  0  1  1  0  1  1  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  0  0  1 -1  0  0  0  0  1 -1  0  0] (Indices: [1, 2, 4, 5, 6, 11, 17]), Candidate: [3 1 0 1 1 1 0 0 1 1 1 0 1 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 29050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  1 -1  0  0  0  0  0  0  0  1 -1  0] (Indices: [1, 2, 4, 5, 7, 9, 18]), Candidate: [ 3  1  0  1  1  0  2 -1  2  0  0  1  1  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1  0 -1  0  0  1 -1  0  0  0  0  0  0] (Indices: [1, 2, 4, 5, 8, 9, 13]), Candidate: [3 1 0 1 1 0 1 1 1 0 0 1 2 0 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 29150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1 -1  0  0  0  0  0  0  0  1 -1  1 -1] (Indices: [1, 2, 4, 5, 8, 17, 19]), Candidate: [3 1 0 1 1 0 1 1 0 1 0 1 1 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 29200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  0  1  0 -1  0  0  1 -1  0  0  0  0] (Indices: [1, 2, 4, 5, 10, 11, 15]), Candidate: [3 1 0 1 1 0 1 0 1 2 0 0 1 1 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 29250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  0  0  1 -1  0  1 -1  0  0  0  1 -1] (Indices: [1, 2, 4, 5, 11, 14, 19]), Candidate: [ 3  1  0  1  1  0  1  0  1  1  1  0  1  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  0  0  0  0  0  1  0 -1  0  0  1 -1] (Indices: [1, 2, 4, 5, 14, 15, 19]), Candidate: [3 1 0 1 1 0 1 0 1 1 0 1 1 2 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 29350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  0  0  1 -1  0  0  1 -1  0  0  0  0] (Indices: [1, 2, 4, 6, 7, 11, 15]), Candidate: [ 3  1  0  1  0  2  1 -1  1  1  1  0  1  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1 -1  1 -1  0  0  0  0  0  0  1 -1  0] (Indices: [1, 2, 4, 6, 8, 10, 18]), Candidate: [ 3  1  0  1  0  2  0  1  0  2 -1  1  1  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  1 -1  1 -1  0  0  1 -1  0  0  0  0] (Indices: [1, 2, 4, 6, 9, 11, 15]), Candidate: [3 1 0 1 0 2 0 0 2 0 1 0 1 1 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 29500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  0  1 -1  0  1 -1  0  1 -1  0  0  0] (Indices: [1, 2, 4, 6, 10, 13, 16]), Candidate: [ 3  1  0  1  0  2  0  0  1  2 -1  1  2  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  0  0  0  1  0 -1  0  0  1 -1  0  0] (Indices: [1, 2, 4, 6, 12, 13, 17]), Candidate: [3 1 0 1 0 2 0 0 1 1 0 2 1 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 29600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  0  0  0  0  0  0  0  1  0 -1  1 -1] (Indices: [1, 2, 4, 6, 16, 17, 19]), Candidate: [3 1 0 1 0 2 0 0 1 1 0 1 1 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 29650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0 -1  0  0  0  0  0  1 -1  0  1 -1  0] (Indices: [1, 2, 4, 7, 8, 15, 18]), Candidate: [3 1 0 1 0 1 2 0 0 1 0 1 1 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 29700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  1 -1  0  0  0  0  0  0  1  0 -1  0] (Indices: [1, 2, 4, 7, 9, 17, 18]), Candidate: [ 3  1  0  1  0  1  2 -1  2  0  0  1  1  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  0  0  1 -1  1 -1  0  0  0  1 -1  0] (Indices: [1, 2, 4, 7, 11, 13, 18]), Candidate: [ 3  1  0  1  0  1  2 -1  1  1  1  0  2  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  0  0  0  0  1 -1  0  0  1  0 -1  0] (Indices: [1, 2, 4, 7, 13, 17, 18]), Candidate: [ 3  1  0  1  0  1  2 -1  1  1  0  1  2  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1  0 -1  0  0  1 -1  0  0  1 -1  0  0] (Indices: [1, 2, 4, 8, 9, 13, 17]), Candidate: [3 1 0 1 0 1 1 1 1 0 0 1 2 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 29900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1 -1  1 -1  0  0  0  0  1 -1  0  1 -1] (Indices: [1, 2, 4, 8, 10, 16, 19]), Candidate: [ 3  1  0  1  0  1  1  1  0  2 -1  1  1  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1 -1  0  0  1 -1  0  0  0  1  0 -1  0] (Indices: [1, 2, 4, 8, 12, 17, 18]), Candidate: [3 1 0 1 0 1 1 1 0 1 0 2 0 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 30000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  1  0 -1  1 -1  0  0  0  1 -1  0  0] (Indices: [1, 2, 4, 9, 10, 12, 17]), Candidate: [ 3  1  0  1  0  1  1  0  2  1 -1  2  0  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  1 -1  1 -1  0  0  0  0  1 -1  1 -1] (Indices: [1, 2, 4, 9, 11, 17, 19]), Candidate: [3 1 0 1 0 1 1 0 2 0 1 0 1 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 30100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  1 -1  0  0  0  0  1  0 -1  0  1 -1] (Indices: [1, 2, 4, 9, 15, 16, 19]), Candidate: [3 1 0 1 0 1 1 0 2 0 0 1 1 1 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 30150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  0  1 -1  1 -1  0  1 -1  0  0  1 -1] (Indices: [1, 2, 4, 10, 12, 15, 19]), Candidate: [ 3  1  0  1  0  1  1  0  1  2 -1  2  0  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  0  0  1  0 -1  1 -1  0  1 -1  0  0] (Indices: [1, 2, 4, 11, 12, 14, 17]), Candidate: [ 3  1  0  1  0  1  1  0  1  1  1  1  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  0  0  0  1  0  0 -1  0  1 -1  0  0] (Indices: [1, 2, 4, 12, 13, 14, 17]), Candidate: [ 3  1  0  1  0  1  1  0  1  1  0  2  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  0  0  0  0  1 -1  0  1  0 -1  1 -1] (Indices: [1, 2, 4, 13, 16, 17, 19]), Candidate: [3 1 0 1 0 1 1 0 1 1 0 1 2 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 30350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  0  0  1 -1  0  1 -1  0  0  0  0  0] (Indices: [1, 2, 5, 6, 7, 11, 14]), Candidate: [ 3  1  0  0  2  1  1 -1  1  1  1  0  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 30400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1 -1  1 -1  0  0  0  0  0  1 -1  0  0] (Indices: [1, 2, 5, 6, 8, 10, 17]), Candidate: [ 3  1  0  0  2  1  0  1  0  2 -1  1  1  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  1 -1  1 -1  0  1 -1  0  0  0  0  0] (Indices: [1, 2, 5, 6, 9, 11, 14]), Candidate: [ 3  1  0  0  2  1  0  0  2  0  1  0  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  0  1 -1  0  1 -1  1 -1  0  0  0  0] (Indices: [1, 2, 5, 6, 10, 13, 15]), Candidate: [ 3  1  0  0  2  1  0  0  1  2 -1  1  2  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  0  0  0  1  0 -1  0  1 -1  0  0  0] (Indices: [1, 2, 5, 6, 12, 13, 16]), Candidate: [3 1 0 0 2 1 0 0 1 1 0 2 1 0 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 30600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  0  0  0  0  0  0  0  1  0  0 -1  0] (Indices: [1, 2, 5, 6, 16, 17, 18]), Candidate: [3 1 0 0 2 1 0 0 1 1 0 1 1 1 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 30650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0 -1  0  0  0  0  0  1 -1  1 -1  0  0] (Indices: [1, 2, 5, 7, 8, 15, 17]), Candidate: [3 1 0 0 2 0 2 0 0 1 0 1 1 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 30700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  1 -1  0  0  0  0  0  1 -1  0  1 -1] (Indices: [1, 2, 5, 7, 9, 16, 19]), Candidate: [ 3  1  0  0  2  0  2 -1  2  0  0  1  1  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  0  0  1 -1  1 -1  0  0  1 -1  0  0] (Indices: [1, 2, 5, 7, 11, 13, 17]), Candidate: [ 3  1  0  0  2  0  2 -1  1  1  1  0  2  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  0  0  0  0  1 -1  0  1 -1  0  1 -1] (Indices: [1, 2, 5, 7, 13, 16, 19]), Candidate: [ 3  1  0  0  2  0  2 -1  1  1  0  1  2  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1  0 -1  0  0  1 -1  0  1 -1  0  0  0] (Indices: [1, 2, 5, 8, 9, 13, 16]), Candidate: [3 1 0 0 2 0 1 1 1 0 0 1 2 0 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 30900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1 -1  1 -1  0  0  0  0  1 -1  1 -1  0] (Indices: [1, 2, 5, 8, 10, 16, 18]), Candidate: [ 3  1  0  0  2  0  1  1  0  2 -1  1  1  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1 -1  0  0  1 -1  0  0  1 -1  0  1 -1] (Indices: [1, 2, 5, 8, 12, 16, 19]), Candidate: [3 1 0 0 2 0 1 1 0 1 0 2 0 1 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 31000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  1  0 -1  1 -1  0  0  1 -1  0  0  0] (Indices: [1, 2, 5, 9, 10, 12, 16]), Candidate: [ 3  1  0  0  2  0  1  0  2  1 -1  2  0  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  1 -1  1 -1  0  0  0  0  1  0 -1  0] (Indices: [1, 2, 5, 9, 11, 17, 18]), Candidate: [3 1 0 0 2 0 1 0 2 0 1 0 1 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 31100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  1 -1  0  0  0  0  1  0 -1  1 -1  0] (Indices: [1, 2, 5, 9, 15, 16, 18]), Candidate: [3 1 0 0 2 0 1 0 2 0 0 1 1 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 31150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  0  1 -1  1 -1  0  1 -1  0  1 -1  0] (Indices: [1, 2, 5, 10, 12, 15, 18]), Candidate: [ 3  1  0  0  2  0  1  0  1  2 -1  2  0  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  0  0  1  0 -1  1 -1  1 -1  0  0  0] (Indices: [1, 2, 5, 11, 12, 14, 16]), Candidate: [ 3  1  0  0  2  0  1  0  1  1  1  1  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  0  0  0  1  0  0 -1  1 -1  0  0  0] (Indices: [1, 2, 5, 12, 13, 14, 16]), Candidate: [ 3  1  0  0  2  0  1  0  1  1  0  2  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  0  0  0  0  1 -1  0  1  0  0 -1  0] (Indices: [1, 2, 5, 13, 16, 17, 18]), Candidate: [3 1 0 0 2 0 1 0 1 1 0 1 2 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 31350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0 -1  0  0  1 -1  0  0  0  1 -1  0  0] (Indices: [1, 2, 6, 7, 8, 12, 17]), Candidate: [3 1 0 0 1 2 1 0 0 1 0 2 0 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 31400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  1 -1  0  0  1 -1  0  1 -1  0  0  0] (Indices: [1, 2, 6, 7, 9, 13, 16]), Candidate: [ 3  1  0  0  1  2  1 -1  2  0  0  1  2  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  0  1 -1  0  0  0  0  1 -1  1 -1  0] (Indices: [1, 2, 6, 7, 10, 16, 18]), Candidate: [ 3  1  0  0  1  2  1 -1  1  2 -1  1  1  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  0  0  0  1 -1  0  0  1 -1  0  1 -1] (Indices: [1, 2, 6, 7, 12, 16, 19]), Candidate: [ 3  1  0  0  1  2  1 -1  1  1  0  2  0  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1  0 -1  1 -1  0  1 -1  0  0  0  0  0] (Indices: [1, 2, 6, 8, 9, 11, 14]), Candidate: [ 3  1  0  0  1  2  0  1  1  0  1  0  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1 -1  1 -1  0  1 -1  1 -1  0  0  0  0] (Indices: [1, 2, 6, 8, 10, 13, 15]), Candidate: [ 3  1  0  0  1  2  0  1  0  2 -1  1  2  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1 -1  0  0  1  0 -1  0  1 -1  0  0  0] (Indices: [1, 2, 6, 8, 12, 13, 16]), Candidate: [3 1 0 0 1 2 0 1 0 1 0 2 1 0 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 31700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1 -1  0  0  0  0  0  0  1  0  0 -1  0] (Indices: [1, 2, 6, 8, 16, 17, 18]), Candidate: [3 1 0 0 1 2 0 1 0 1 0 1 1 1 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 31750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  1 -1  1 -1  1 -1  0  0  1 -1  0  0] (Indices: [1, 2, 6, 9, 11, 13, 17]), Candidate: [3 1 0 0 1 2 0 0 2 0 1 0 2 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 31800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  1 -1  0  0  1 -1  0  1 -1  0  1 -1] (Indices: [1, 2, 6, 9, 13, 16, 19]), Candidate: [3 1 0 0 1 2 0 0 2 0 0 1 2 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 31850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  0  1  0 -1  0  0  0  0  1 -1  1 -1] (Indices: [1, 2, 6, 10, 11, 17, 19]), Candidate: [3 1 0 0 1 2 0 0 1 2 0 0 1 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 31900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  0  1 -1  0  0  0  1  0 -1  0  1 -1] (Indices: [1, 2, 6, 10, 15, 16, 19]), Candidate: [ 3  1  0  0  1  2  0  0  1  2 -1  1  1  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  0  0  1 -1  0  1 -1  1 -1  0  1 -1] (Indices: [1, 2, 6, 11, 14, 16, 19]), Candidate: [ 3  1  0  0  1  2  0  0  1  1  1  0  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  0  0  0  0  1  0  0 -1  1 -1  0  0] (Indices: [1, 2, 6, 13, 14, 15, 17]), Candidate: [3 1 0 0 1 2 0 0 1 1 0 1 2 1 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 32050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0  0 -1  1 -1  0  0  0  0  0  0  1 -1] (Indices: [1, 2, 7, 8, 9, 11, 19]), Candidate: [3 1 0 0 1 1 2 0 1 0 1 0 1 1 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 32100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0 -1  1 -1  0  0  1  0 -1  0  0  0  0] (Indices: [1, 2, 7, 8, 10, 14, 15]), Candidate: [ 3  1  0  0  1  1  2  0  0  2 -1  1  1  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0 -1  0  0  1 -1  1 -1  1 -1  0  0  0] (Indices: [1, 2, 7, 8, 12, 14, 16]), Candidate: [ 3  1  0  0  1  1  2  0  0  1  0  2  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  1  0  0 -1  1 -1  0  0  0  0  0  0] (Indices: [1, 2, 7, 9, 10, 11, 13]), Candidate: [ 3  1  0  0  1  1  2 -1  2  1  0  0  2  0  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  1 -1  1 -1  0  1 -1  0  1 -1  0  0] (Indices: [1, 2, 7, 9, 11, 14, 17]), Candidate: [ 3  1  0  0  1  1  2 -1  2  0  1  0  1  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  1 -1  0  0  0  1  0 -1  1 -1  0  0] (Indices: [1, 2, 7, 9, 14, 15, 17]), Candidate: [ 3  1  0  0  1  1  2 -1  2  0  0  1  1  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  0  1 -1  1  0 -1  0  0  1 -1  0  0] (Indices: [1, 2, 7, 10, 12, 13, 17]), Candidate: [ 3  1  0  0  1  1  2 -1  1  2 -1  2  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  0  1 -1  0  0  0  0  1  0 -1  1 -1] (Indices: [1, 2, 7, 10, 16, 17, 19]), Candidate: [ 3  1  0  0  1  1  2 -1  1  2 -1  1  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  0  0  1 -1  0  0  1  0 -1  1 -1  0] (Indices: [1, 2, 7, 11, 15, 16, 18]), Candidate: [ 3  1  0  0  1  1  2 -1  1  1  1  0  1  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  0  0  0  0  1  0 -1  1 -1  0  1 -1] (Indices: [1, 2, 7, 13, 14, 16, 19]), Candidate: [ 3  1  0  0  1  1  2 -1  1  1  0  1  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1  0  0 -1  0  0  1  0 -1  0  0  0  0] (Indices: [1, 2, 8, 9, 10, 14, 15]), Candidate: [ 3  1  0  0  1  1  1  1  1  1 -1  1  1  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1  0 -1  0  1 -1  1 -1  1 -1  0  0  0] (Indices: [1, 2, 8, 9, 12, 14, 16]), Candidate: [ 3  1  0  0  1  1  1  1  1  0  0  2  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1 -1  1  0  0 -1  1 -1  0  0  0  0  0] (Indices: [1, 2, 8, 10, 11, 12, 14]), Candidate: [ 3  1  0  0  1  1  1  1  0  2  0  1  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1 -1  1 -1  0  1  0 -1  0  1 -1  0  0] (Indices: [1, 2, 8, 10, 13, 14, 17]), Candidate: [ 3  1  0  0  1  1  1  1  0  2 -1  1  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1 -1  0  1  0 -1  0  0  1 -1  0  1 -1] (Indices: [1, 2, 8, 11, 12, 16, 19]), Candidate: [3 1 0 0 1 1 1 1 0 1 1 1 0 1 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 32800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1 -1  0  0  1  0 -1  0  1 -1  0  1 -1] (Indices: [1, 2, 8, 12, 13, 16, 19]), Candidate: [3 1 0 0 1 1 1 1 0 1 0 2 1 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 32850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1 -1  0  0  0  0  1 -1  1  0  0 -1  0] (Indices: [1, 2, 8, 14, 16, 17, 18]), Candidate: [ 3  1  0  0  1  1  1  1  0  1  0  1  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  1  0 -1  1 -1  0  1 -1  0  1 -1  0] (Indices: [1, 2, 9, 10, 12, 15, 18]), Candidate: [ 3  1  0  0  1  1  1  0  2  1 -1  2  0  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  1 -1  1  0 -1  1 -1  1 -1  0  0  0] (Indices: [1, 2, 9, 11, 12, 14, 16]), Candidate: [ 3  1  0  0  1  1  1  0  2  0  1  1  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  1 -1  0  1  0  0 -1  1 -1  0  0  0] (Indices: [1, 2, 9, 12, 13, 14, 16]), Candidate: [ 3  1  0  0  1  1  1  0  2  0  0  2  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  1 -1  0  0  1 -1  0  1  0  0 -1  0] (Indices: [1, 2, 9, 13, 16, 17, 18]), Candidate: [3 1 0 0 1 1 1 0 2 0 0 1 2 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 33100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  0  1  0 -1  1 -1  0  1 -1  1 -1  0] (Indices: [1, 2, 10, 11, 13, 16, 18]), Candidate: [3 1 0 0 1 1 1 0 1 2 0 0 2 0 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 33150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  0  1 -1  1 -1  0  1  0  0 -1  0  0] (Indices: [1, 2, 10, 12, 15, 16, 17]), Candidate: [ 3  1  0  0  1  1  1  0  1  2 -1  2  0  1  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  0  0  1  0  0 -1  1  0 -1  0  0  0] (Indices: [1, 2, 11, 12, 13, 15, 16]), Candidate: [3 1 0 0 1 1 1 0 1 1 1 1 1 0 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 33250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  0  0  1 -1  0  1  0  0  0 -1  0  0] (Indices: [1, 2, 11, 14, 15, 16, 17]), Candidate: [3 1 0 0 1 1 1 0 1 1 1 0 1 2 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 33300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  0  0  0  0  1  0  0  0  0 -1  0  0] (Indices: [1, 2, 13, 14, 15, 16, 17]), Candidate: [3 1 0 0 1 1 1 0 1 1 0 1 2 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 33350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  1 -1  0  0  0  0  0  1 -1  0  0  0] (Indices: [1, 3, 4, 5, 6, 9, 16]), Candidate: [3 0 2 0 1 1 0 0 2 0 0 1 1 1 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 33400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0 -1  1 -1  0  0  0  0  0  0  0  0  0] (Indices: [1, 3, 4, 5, 7, 8, 10]), Candidate: [ 3  0  2  0  1  0  2  0  0  2 -1  1  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  0  0  0  0  0  1  0 -1  0  0  0  0] (Indices: [1, 3, 4, 5, 7, 14, 15]), Candidate: [ 3  0  2  0  1  0  2 -1  1  1  0  1  1  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1 -1  0  0  0  1 -1  1 -1  0  0  0  0] (Indices: [1, 3, 4, 5, 8, 13, 15]), Candidate: [3 0 2 0 1 0 1 1 0 1 0 1 2 0 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 33550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  1 -1  0  0  0  1  0 -1  0  0  0  0] (Indices: [1, 3, 4, 5, 9, 14, 15]), Candidate: [3 0 2 0 1 0 1 0 2 0 0 1 1 2 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 33600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  0  1 -1  0  0  0  0  0  0  1  0 -1] (Indices: [1, 3, 4, 5, 10, 18, 19]), Candidate: [ 3  0  2  0  1  0  1  0  1  2 -1  1  1  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  0  0  0  0  1  0  0 -1  0  0  0  0] (Indices: [1, 3, 4, 5, 13, 14, 15]), Candidate: [3 0 2 0 1 0 1 0 1 1 0 1 2 1 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 33700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  1 -1  0  0  0  1 -1  0  0  0  0  0] (Indices: [1, 3, 4, 6, 7, 9, 14]), Candidate: [ 3  0  2  0  0  2  1 -1  2  0  0  1  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 33750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  0  0  0  0  0  0  0  0  0  1  0 -1] (Indices: [1, 3, 4, 6, 7, 18, 19]), Candidate: [ 3  0  2  0  0  2  1 -1  1  1  0  1  1  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1 -1  0  0  0  0  0  0  1  0 -1  0  0] (Indices: [1, 3, 4, 6, 8, 16, 17]), Candidate: [3 0 2 0 0 2 0 1 0 1 0 1 1 1 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 33850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  1 -1  0  0  0  0  0  0  0  1  0 -1] (Indices: [1, 3, 4, 6, 9, 18, 19]), Candidate: [3 0 2 0 0 2 0 0 2 0 0 1 1 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 33900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  0  0  1 -1  0  1  0 -1  0  0  0  0] (Indices: [1, 3, 4, 6, 11, 14, 15]), Candidate: [3 0 2 0 0 2 0 0 1 1 1 0 1 2 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 33950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  0  0  0  0  1 -1  0  0  0  1  0 -1] (Indices: [1, 3, 4, 6, 13, 18, 19]), Candidate: [3 0 2 0 0 2 0 0 1 1 0 1 2 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 34000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0 -1  0  0  1 -1  0  1 -1  0  0  0  0] (Indices: [1, 3, 4, 7, 8, 12, 15]), Candidate: [3 0 2 0 0 1 2 0 0 1 0 2 0 1 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 34050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  1 -1  0  0  1  0 -1  0  0  0  0  0] (Indices: [1, 3, 4, 7, 9, 13, 14]), Candidate: [ 3  0  2  0  0  1  2 -1  2  0  0  1  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  0  1 -1  0  0  0  1 -1  0  0  1 -1] (Indices: [1, 3, 4, 7, 10, 15, 19]), Candidate: [ 3  0  2  0  0  1  2 -1  1  2 -1  1  1  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  0  0  0  1 -1  0  0  1  0 -1  0  0] (Indices: [1, 3, 4, 7, 12, 16, 17]), Candidate: [ 3  0  2  0  0  1  2 -1  1  1  0  2  0  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1  0 -1  1  0 -1  0  0  0  0  0  0  0] (Indices: [1, 3, 4, 8, 9, 11, 12]), Candidate: [3 0 2 0 0 1 1 1 1 0 1 1 0 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 34250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1 -1  1 -1  1 -1  0  0  0  0  0  1 -1] (Indices: [1, 3, 4, 8, 10, 12, 19]), Candidate: [ 3  0  2  0  0  1  1  1  0  2 -1  2  0  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1 -1  0  0  1  0  0 -1  0  0  0  0  0] (Indices: [1, 3, 4, 8, 12, 13, 14]), Candidate: [ 3  0  2  0  0  1  1  1  0  1  0  2  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1 -1  0  0  0  0  0  1 -1  1 -1  1 -1] (Indices: [1, 3, 4, 8, 15, 17, 19]), Candidate: [3 0 2 0 0 1 1 1 0 1 0 1 1 1 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 34400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  1 -1  1 -1  1 -1  1 -1  0  0  0  0] (Indices: [1, 3, 4, 9, 11, 13, 15]), Candidate: [3 0 2 0 0 1 1 0 2 0 1 0 2 0 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 34450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  1 -1  0  0  1 -1  0  1  0 -1  0  0] (Indices: [1, 3, 4, 9, 13, 16, 17]), Candidate: [3 0 2 0 0 1 1 0 2 0 0 1 2 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 34500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  0  1  0 -1  0  0  0  1 -1  0  1 -1] (Indices: [1, 3, 4, 10, 11, 16, 19]), Candidate: [3 0 2 0 0 1 1 0 1 2 0 0 1 1 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 34550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  0  1 -1  0  0  0  1  0  0 -1  0  0] (Indices: [1, 3, 4, 10, 15, 16, 17]), Candidate: [ 3  0  2  0  0  1  1  0  1  2 -1  1  1  1  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  0  0  1 -1  0  1 -1  1  0 -1  0  0] (Indices: [1, 3, 4, 11, 14, 16, 17]), Candidate: [ 3  0  2  0  0  1  1  0  1  1  1  0  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  0  0  0  1 -1  0  0  0  1  0  0 -1] (Indices: [1, 3, 4, 12, 17, 18, 19]), Candidate: [3 0 2 0 0 1 1 0 1 1 0 2 0 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 34700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  1 -1  0  0  1 -1  0  0  0  0  0  0] (Indices: [1, 3, 5, 6, 7, 9, 13]), Candidate: [ 3  0  2 -1  2  1  1 -1  2  0  0  1  2  0  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  0  0  0  0  0  0  0  0  1 -1  1 -1] (Indices: [1, 3, 5, 6, 7, 17, 19]), Candidate: [ 3  0  2 -1  2  1  1 -1  1  1  0  1  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1 -1  0  0  0  0  0  1 -1  0  0  1 -1] (Indices: [1, 3, 5, 6, 8, 15, 19]), Candidate: [ 3  0  2 -1  2  1  0  1  0  1  0  1  1  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  1 -1  0  0  0  0  0  0  1 -1  1 -1] (Indices: [1, 3, 5, 6, 9, 17, 19]), Candidate: [ 3  0  2 -1  2  1  0  0  2  0  0  1  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  0  0  1 -1  1 -1  0  0  0  0  1 -1] (Indices: [1, 3, 5, 6, 11, 13, 19]), Candidate: [ 3  0  2 -1  2  1  0  0  1  1  1  0  2  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  0  0  0  0  1 -1  0  0  1 -1  1 -1] (Indices: [1, 3, 5, 6, 13, 17, 19]), Candidate: [ 3  0  2 -1  2  1  0  0  1  1  0  1  2  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0 -1  0  0  1 -1  1 -1  0  0  0  0  0] (Indices: [1, 3, 5, 7, 8, 12, 14]), Candidate: [ 3  0  2 -1  2  0  2  0  0  1  0  2  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  1 -1  0  1 -1  0  0  0  0  0  1 -1] (Indices: [1, 3, 5, 7, 9, 12, 19]), Candidate: [ 3  0  2 -1  2  0  2 -1  2  0  0  2  0  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  0  1 -1  0  0  0  1 -1  0  1 -1  0] (Indices: [1, 3, 5, 7, 10, 15, 18]), Candidate: [ 3  0  2 -1  2  0  2 -1  1  2 -1  1  1  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 35150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  0  0  0  1 -1  0  1 -1  0  0  1 -1] (Indices: [1, 3, 5, 7, 12, 15, 19]), Candidate: [ 3  0  2 -1  2  0  2 -1  1  1  0  2  0  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1  0  0 -1  0  0  0  0  0  0  0  1 -1] (Indices: [1, 3, 5, 8, 9, 10, 19]), Candidate: [ 3  0  2 -1  2  0  1  1  1  1 -1  1  1  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1 -1  1 -1  1 -1  0  0  0  0  1 -1  0] (Indices: [1, 3, 5, 8, 10, 12, 18]), Candidate: [ 3  0  2 -1  2  0  1  1  0  2 -1  2  0  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1 -1  0  1 -1  0  0  0  0  0  1  0 -1] (Indices: [1, 3, 5, 8, 11, 18, 19]), Candidate: [ 3  0  2 -1  2  0  1  1  0  1  1  0  1  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1 -1  0  0  0  0  0  1 -1  1  0 -1  0] (Indices: [1, 3, 5, 8, 15, 17, 18]), Candidate: [ 3  0  2 -1  2  0  1  1  0  1  0  1  1  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  1 -1  1 -1  1  0 -1  0  0  0  0  0] (Indices: [1, 3, 5, 9, 11, 13, 14]), Candidate: [ 3  0  2 -1  2  0  1  0  2  0  1  0  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  1 -1  0  0  1 -1  1 -1  0  0  1 -1] (Indices: [1, 3, 5, 9, 13, 15, 19]), Candidate: [ 3  0  2 -1  2  0  1  0  2  0  0  1  2  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  0  1  0 -1  0  0  0  1 -1  1 -1  0] (Indices: [1, 3, 5, 10, 11, 16, 18]), Candidate: [ 3  0  2 -1  2  0  1  0  1  2  0  0  1  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  0  1 -1  0  0  1 -1  0  0  1  0 -1] (Indices: [1, 3, 5, 10, 14, 18, 19]), Candidate: [ 3  0  2 -1  2  0  1  0  1  2 -1  1  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 35600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  0  0  1 -1  0  1  0 -1  0  0  1 -1] (Indices: [1, 3, 5, 11, 14, 15, 19]), Candidate: [ 3  0  2 -1  2  0  1  0  1  1  1  0  1  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  0  0  0  1 -1  0  0  1 -1  1  0 -1] (Indices: [1, 3, 5, 12, 16, 18, 19]), Candidate: [ 3  0  2 -1  2  0  1  0  1  1  0  2  0  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0 -1  1 -1  0  0  1 -1  0  0  0  0  0] (Indices: [1, 3, 6, 7, 8, 10, 14]), Candidate: [ 3  0  2 -1  1  2  1  0  0  2 -1  1  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 35750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  1  0 -1  0  0  0  0  0  0  0  1 -1] (Indices: [1, 3, 6, 7, 9, 10, 19]), Candidate: [ 3  0  2 -1  1  2  1 -1  2  1 -1  1  1  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 35800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  0  1 -1  1 -1  0  0  0  0  1 -1  0] (Indices: [1, 3, 6, 7, 10, 12, 18]), Candidate: [ 3  0  2 -1  1  2  1 -1  1  2 -1  2  0  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 35850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  0  0  1 -1  0  0  0  0  0  1  0 -1] (Indices: [1, 3, 6, 7, 11, 18, 19]), Candidate: [ 3  0  2 -1  1  2  1 -1  1  1  1  0  1  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  0  0  0  0  0  0  1 -1  1  0 -1  0] (Indices: [1, 3, 6, 7, 15, 17, 18]), Candidate: [ 3  0  2 -1  1  2  1 -1  1  1  0  1  1  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1  0 -1  0  0  0  0  0  0  1 -1  1 -1] (Indices: [1, 3, 6, 8, 9, 17, 19]), Candidate: [ 3  0  2 -1  1  2  0  1  1  0  0  1  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1 -1  0  1 -1  1 -1  0  0  0  0  1 -1] (Indices: [1, 3, 6, 8, 11, 13, 19]), Candidate: [ 3  0  2 -1  1  2  0  1  0  1  1  0  2  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1 -1  0  0  0  1 -1  0  0  1 -1  1 -1] (Indices: [1, 3, 6, 8, 13, 17, 19]), Candidate: [ 3  0  2 -1  1  2  0  1  0  1  0  1  2  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  1  0 -1  0  0  0  1 -1  0  1 -1  0] (Indices: [1, 3, 6, 9, 10, 15, 18]), Candidate: [ 3  0  2 -1  1  2  0  0  2  1 -1  1  1  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  1 -1  0  1 -1  0  1 -1  0  0  1 -1] (Indices: [1, 3, 6, 9, 12, 15, 19]), Candidate: [ 3  0  2 -1  1  2  0  0  2  0  0  2  0  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  0  1  0 -1  1 -1  1 -1  0  0  0  0] (Indices: [1, 3, 6, 10, 11, 13, 15]), Candidate: [ 3  0  2 -1  1  2  0  0  1  2  0  0  2  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  0  1 -1  0  1 -1  0  1  0 -1  0  0] (Indices: [1, 3, 6, 10, 13, 16, 17]), Candidate: [ 3  0  2 -1  1  2  0  0  1  2 -1  1  2  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  0  0  1 -1  1  0 -1  0  0  1 -1  0] (Indices: [1, 3, 6, 11, 13, 14, 18]), Candidate: [ 3  0  2 -1  1  2  0  0  1  1  1  0  2  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  0  0  0  1 -1  1  0 -1  0  0  1 -1] (Indices: [1, 3, 6, 12, 14, 15, 19]), Candidate: [ 3  0  2 -1  1  2  0  0  1  1  0  2  0  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  0  0  0  0  0  0  1 -1  1  0  0 -1] (Indices: [1, 3, 6, 15, 17, 18, 19]), Candidate: [ 3  0  2 -1  1  2  0  0  1  1  0  1  1  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0 -1  1  0 -1  0  0  1 -1  0  0  0  0] (Indices: [1, 3, 7, 8, 10, 11, 15]), Candidate: [ 3  0  2 -1  1  1  2  0  0  2  0  0  1  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0 -1  0  1 -1  0  1 -1  0  0  0  1 -1] (Indices: [1, 3, 7, 8, 11, 14, 19]), Candidate: [ 3  0  2 -1  1  1  2  0  0  1  1  0  1  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0 -1  0  0  0  0  1  0 -1  0  0  1 -1] (Indices: [1, 3, 7, 8, 14, 15, 19]), Candidate: [ 3  0  2 -1  1  1  2  0  0  1  0  1  1  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  1  0 -1  0  0  0  0  0  1  0 -1  0] (Indices: [1, 3, 7, 9, 10, 17, 18]), Candidate: [ 3  0  2 -1  1  1  2 -1  2  1 -1  1  1  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 36650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  1 -1  0  1 -1  0  0  0  1 -1  1 -1] (Indices: [1, 3, 7, 9, 12, 17, 19]), Candidate: [ 3  0  2 -1  1  1  2 -1  2  0  0  2  0  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  0  1  0 -1  0  1  0 -1  0  0  0  0] (Indices: [1, 3, 7, 10, 11, 14, 15]), Candidate: [ 3  0  2 -1  1  1  2 -1  1  2  0  0  1  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  0  1 -1  0  1 -1  0  0  0  1  0 -1] (Indices: [1, 3, 7, 10, 13, 18, 19]), Candidate: [ 3  0  2 -1  1  1  2 -1  1  2 -1  1  2  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 36800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  0  0  1 -1  1 -1  1 -1  0  0  1 -1] (Indices: [1, 3, 7, 11, 13, 15, 19]), Candidate: [ 3  0  2 -1  1  1  2 -1  1  1  1  0  2  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  0  0  0  1 -1  1 -1  0  1 -1  1 -1] (Indices: [1, 3, 7, 12, 14, 17, 19]), Candidate: [ 3  0  2 -1  1  1  2 -1  1  1  0  2  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 36900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1  0  0  0 -1  0  0  1 -1  0  0  0  0] (Indices: [1, 3, 8, 9, 10, 11, 15]), Candidate: [ 3  0  2 -1  1  1  1  1  1  1  0  0  1  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1  0 -1  1 -1  0  1 -1  0  0  0  1 -1] (Indices: [1, 3, 8, 9, 11, 14, 19]), Candidate: [ 3  0  2 -1  1  1  1  1  1  0  1  0  1  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1  0 -1  0  0  0  1  0 -1  0  0  1 -1] (Indices: [1, 3, 8, 9, 14, 15, 19]), Candidate: [ 3  0  2 -1  1  1  1  1  1  0  0  1  1  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1 -1  1 -1  1  0 -1  0  0  0  0  1 -1] (Indices: [1, 3, 8, 10, 12, 13, 19]), Candidate: [ 3  0  2 -1  1  1  1  1  0  2 -1  2  1  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1 -1  1 -1  0  0  0  0  0  1  0  0 -1] (Indices: [1, 3, 8, 10, 17, 18, 19]), Candidate: [ 3  0  2 -1  1  1  1  1  0  2 -1  1  1  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1 -1  0  1 -1  0  0  1 -1  1  0 -1  0] (Indices: [1, 3, 8, 11, 15, 17, 18]), Candidate: [ 3  0  2 -1  1  1  1  1  0  1  1  0  1  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1 -1  0  0  0  1  0 -1  0  1 -1  1 -1] (Indices: [1, 3, 8, 13, 14, 17, 19]), Candidate: [ 3  0  2 -1  1  1  1  1  0  1  0  1  2  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  1  0  0 -1  0  0  0  1 -1  1 -1  0] (Indices: [1, 3, 9, 10, 11, 16, 18]), Candidate: [ 3  0  2 -1  1  1  1  0  2  1  0  0  1  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  1  0 -1  0  0  1 -1  0  0  1  0 -1] (Indices: [1, 3, 9, 10, 14, 18, 19]), Candidate: [ 3  0  2 -1  1  1  1  0  2  1 -1  1  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 37350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  1 -1  1 -1  0  1  0 -1  0  0  1 -1] (Indices: [1, 3, 9, 11, 14, 15, 19]), Candidate: [ 3  0  2 -1  1  1  1  0  2  0  1  0  1  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  1 -1  0  1 -1  0  0  1 -1  1  0 -1] (Indices: [1, 3, 9, 12, 16, 18, 19]), Candidate: [ 3  0  2 -1  1  1  1  0  2  0  0  2  0  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  0  1  0  0 -1  0  1 -1  0  1 -1  0] (Indices: [1, 3, 10, 11, 12, 15, 18]), Candidate: [ 3  0  2 -1  1  1  1  0  1  2  0  1  0  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  0  1 -1  1  0 -1  1 -1  0  1 -1  0] (Indices: [1, 3, 10, 12, 13, 15, 18]), Candidate: [ 3  0  2 -1  1  1  1  0  1  2 -1  2  1  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  0  1 -1  0  0  1  0  0 -1  0  1 -1] (Indices: [1, 3, 10, 14, 15, 16, 19]), Candidate: [ 3  0  2 -1  1  1  1  0  1  2 -1  1  1  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  0  0  1 -1  1  0  0 -1  0  1 -1  0] (Indices: [1, 3, 11, 13, 14, 15, 18]), Candidate: [ 3  0  2 -1  1  1  1  0  1  1  1  0  2  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  0  0  0  1  0 -1  0  1  0 -1  1 -1] (Indices: [1, 3, 12, 13, 16, 17, 19]), Candidate: [ 3  0  2 -1  1  1  1  0  1  1  0  2  1  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  1  0 -1  0  0  0  0  0  0  0  0  0] (Indices: [1, 4, 5, 6, 7, 9, 10]), Candidate: [ 3  0  1  1  1  1  1 -1  2  1 -1  1  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  0  0  0  0  0  0  0  1 -1  1 -1  0] (Indices: [1, 4, 5, 6, 7, 16, 18]), Candidate: [ 3  0  1  1  1  1  1 -1  1  1  0  1  1  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1 -1  0  0  0  0  0  1  0 -1  0  0  0] (Indices: [1, 4, 5, 6, 8, 15, 16]), Candidate: [3 0 1 1 1 1 0 1 0 1 0 1 1 1 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 37850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  1 -1  0  0  0  0  0  1 -1  1 -1  0] (Indices: [1, 4, 5, 6, 9, 16, 18]), Candidate: [3 0 1 1 1 1 0 0 2 0 0 1 1 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 37900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  0  0  1 -1  1 -1  0  1 -1  0  0  0] (Indices: [1, 4, 5, 6, 11, 13, 16]), Candidate: [3 0 1 1 1 1 0 0 1 1 1 0 2 0 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 37950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  0  0  0  0  1 -1  0  1 -1  1 -1  0] (Indices: [1, 4, 5, 6, 13, 16, 18]), Candidate: [3 0 1 1 1 1 0 0 1 1 0 1 2 0 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 38000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0 -1  0  1 -1  0  0  0  0  0  1 -1  0] (Indices: [1, 4, 5, 7, 8, 11, 18]), Candidate: [3 0 1 1 1 0 2 0 0 1 1 0 1 1 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 38050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  1 -1  0  1 -1  0  0  1 -1  0  0  0] (Indices: [1, 4, 5, 7, 9, 12, 16]), Candidate: [ 3  0  1  1  1  0  2 -1  2  0  0  2  0  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  0  1 -1  0  0  1 -1  0  0  0  1 -1] (Indices: [1, 4, 5, 7, 10, 14, 19]), Candidate: [ 3  0  1  1  1  0  2 -1  1  2 -1  1  1  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 38150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  0  0  0  1 -1  0  1  0 -1  0  0  0] (Indices: [1, 4, 5, 7, 12, 15, 16]), Candidate: [ 3  0  1  1  1  0  2 -1  1  1  0  2  0  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1  0  0 -1  0  0  0  0  1 -1  0  0  0] (Indices: [1, 4, 5, 8, 9, 10, 16]), Candidate: [ 3  0  1  1  1  0  1  1  1  1 -1  1  1  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1 -1  1 -1  1 -1  0  1 -1  0  0  0  0] (Indices: [1, 4, 5, 8, 10, 12, 15]), Candidate: [ 3  0  1  1  1  0  1  1  0  2 -1  2  0  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1 -1  0  1 -1  0  0  0  1 -1  0  1 -1] (Indices: [1, 4, 5, 8, 11, 16, 19]), Candidate: [3 0 1 1 1 0 1 1 0 1 1 0 1 1 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 38350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1 -1  0  0  0  0  0  1  0  0 -1  0  0] (Indices: [1, 4, 5, 8, 15, 16, 17]), Candidate: [3 0 1 1 1 0 1 1 0 1 0 1 1 1 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 38400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  1 -1  1  0 -1  0  0  0  1 -1  0  0] (Indices: [1, 4, 5, 9, 11, 12, 17]), Candidate: [3 0 1 1 1 0 1 0 2 0 1 1 0 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 38450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  1 -1  0  0  1 -1  1  0 -1  0  0  0] (Indices: [1, 4, 5, 9, 13, 15, 16]), Candidate: [3 0 1 1 1 0 1 0 2 0 0 1 2 0 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 38500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  0  1  0 -1  0  0  1 -1  0  1 -1  0] (Indices: [1, 4, 5, 10, 11, 15, 18]), Candidate: [3 0 1 1 1 0 1 0 1 2 0 0 1 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 38550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  0  1 -1  0  0  1 -1  1 -1  0  1 -1] (Indices: [1, 4, 5, 10, 14, 16, 19]), Candidate: [ 3  0  1  1  1  0  1  0  1  2 -1  1  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  0  0  1 -1  0  1  0  0 -1  0  0  0] (Indices: [1, 4, 5, 11, 14, 15, 16]), Candidate: [3 0 1 1 1 0 1 0 1 1 1 0 1 2 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 38650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  0  0  0  1 -1  0  1 -1  0  1  0 -1] (Indices: [1, 4, 5, 12, 15, 18, 19]), Candidate: [3 0 1 1 1 0 1 0 1 1 0 2 0 1 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 38700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0 -1  1  0 -1  0  0  0  0  0  0  0  0] (Indices: [1, 4, 6, 7, 8, 10, 11]), Candidate: [3 0 1 1 0 2 1 0 0 2 0 0 1 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 38750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  1  0 -1  0  0  0  0  1 -1  0  0  0] (Indices: [1, 4, 6, 7, 9, 10, 16]), Candidate: [ 3  0  1  1  0  2  1 -1  2  1 -1  1  1  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  0  1 -1  1 -1  0  1 -1  0  0  0  0] (Indices: [1, 4, 6, 7, 10, 12, 15]), Candidate: [ 3  0  1  1  0  2  1 -1  1  2 -1  2  0  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  0  0  1 -1  0  0  0  1 -1  0  1 -1] (Indices: [1, 4, 6, 7, 11, 16, 19]), Candidate: [ 3  0  1  1  0  2  1 -1  1  1  1  0  1  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  0  0  0  0  0  0  1  0  0 -1  0  0] (Indices: [1, 4, 6, 7, 15, 16, 17]), Candidate: [ 3  0  1  1  0  2  1 -1  1  1  0  1  1  1  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1  0 -1  0  0  0  0  0  1 -1  1 -1  0] (Indices: [1, 4, 6, 8, 9, 16, 18]), Candidate: [3 0 1 1 0 2 0 1 1 0 0 1 1 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 39000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1 -1  0  1 -1  1 -1  0  1 -1  0  0  0] (Indices: [1, 4, 6, 8, 11, 13, 16]), Candidate: [3 0 1 1 0 2 0 1 0 1 1 0 2 0 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 39050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1 -1  0  0  0  1 -1  0  1 -1  1 -1  0] (Indices: [1, 4, 6, 8, 13, 16, 18]), Candidate: [3 0 1 1 0 2 0 1 0 1 0 1 2 0 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 39100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  1  0 -1  0  0  1 -1  0  0  0  1 -1] (Indices: [1, 4, 6, 9, 10, 14, 19]), Candidate: [ 3  0  1  1  0  2  0  0  2  1 -1  1  1  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  1 -1  0  1 -1  0  1  0 -1  0  0  0] (Indices: [1, 4, 6, 9, 12, 15, 16]), Candidate: [3 0 1 1 0 2 0 0 2 0 0 2 0 1 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 39200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  0  1  0  0 -1  0  0  0  0  1 -1  0] (Indices: [1, 4, 6, 10, 11, 12, 18]), Candidate: [3 0 1 1 0 2 0 0 1 2 0 1 0 1 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 39250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  0  1 -1  0  1 -1  1 -1  1 -1  0  0] (Indices: [1, 4, 6, 10, 13, 15, 17]), Candidate: [ 3  0  1  1  0  2  0  0  1  2 -1  1  2  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  0  0  1 -1  1  0  0 -1  0  0  0  0] (Indices: [1, 4, 6, 11, 13, 14, 15]), Candidate: [3 0 1 1 0 2 0 0 1 1 1 0 2 1 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 39350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  0  0  0  1 -1  1  0  0 -1  0  0  0] (Indices: [1, 4, 6, 12, 14, 15, 16]), Candidate: [3 0 1 1 0 2 0 0 1 1 0 2 0 2 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 39400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  0  0  0  0  0  0  1  0  0  0 -1  0] (Indices: [1, 4, 6, 15, 16, 17, 18]), Candidate: [3 0 1 1 0 2 0 0 1 1 0 1 1 1 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 39450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0 -1  1  0  0 -1  0  0  0  0  0  0  0] (Indices: [1, 4, 7, 8, 10, 11, 12]), Candidate: [3 0 1 1 0 1 2 0 0 2 0 1 0 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 39500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0 -1  0  1 -1  0  1 -1  1 -1  0  0  0] (Indices: [1, 4, 7, 8, 11, 14, 16]), Candidate: [ 3  0  1  1  0  1  2  0  0  1  1  0  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0 -1  0  0  0  0  1  0  0 -1  0  0  0] (Indices: [1, 4, 7, 8, 14, 15, 16]), Candidate: [3 0 1 1 0 1 2 0 0 1 0 1 1 2 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 39600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  1  0 -1  0  0  0  0  1  0 -1  0  0] (Indices: [1, 4, 7, 9, 10, 16, 17]), Candidate: [ 3  0  1  1  0  1  2 -1  2  1 -1  1  1  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  1 -1  0  1 -1  0  0  1 -1  1 -1  0] (Indices: [1, 4, 7, 9, 12, 16, 18]), Candidate: [ 3  0  1  1  0  1  2 -1  2  0  0  2  0  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  0  1  0 -1  1 -1  0  0  1 -1  0  0] (Indices: [1, 4, 7, 10, 11, 13, 17]), Candidate: [ 3  0  1  1  0  1  2 -1  1  2  0  0  2  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  0  1 -1  0  1 -1  0  1 -1  0  1 -1] (Indices: [1, 4, 7, 10, 13, 16, 19]), Candidate: [ 3  0  1  1  0  1  2 -1  1  2 -1  1  2  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  0  0  1 -1  1 -1  1  0 -1  0  0  0] (Indices: [1, 4, 7, 11, 13, 15, 16]), Candidate: [ 3  0  1  1  0  1  2 -1  1  1  1  0  2  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  0  0  0  1 -1  1 -1  1 -1  1 -1  0] (Indices: [1, 4, 7, 12, 14, 16, 18]), Candidate: [ 3  0  1  1  0  1  2 -1  1  1  0  2  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1  0  0  0  0 -1  0  0  0  0  0  0  0] (Indices: [1, 4, 8, 9, 10, 11, 12]), Candidate: [3 0 1 1 0 1 1 1 1 1 0 1 0 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 39950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1  0 -1  1 -1  0  1 -1  1 -1  0  0  0] (Indices: [1, 4, 8, 9, 11, 14, 16]), Candidate: [ 3  0  1  1  0  1  1  1  1  0  1  0  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1  0 -1  0  0  0  1  0  0 -1  0  0  0] (Indices: [1, 4, 8, 9, 14, 15, 16]), Candidate: [3 0 1 1 0 1 1 1 1 0 0 1 1 2 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 40050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1 -1  1 -1  1  0 -1  0  1 -1  0  0  0] (Indices: [1, 4, 8, 10, 12, 13, 16]), Candidate: [ 3  0  1  1  0  1  1  1  0  2 -1  2  1  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1 -1  1 -1  0  0  0  0  1  0  0 -1  0] (Indices: [1, 4, 8, 10, 16, 17, 18]), Candidate: [ 3  0  1  1  0  1  1  1  0  2 -1  1  1  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1 -1  0  1 -1  0  0  1  0  0 -1  0  0] (Indices: [1, 4, 8, 11, 15, 16, 17]), Candidate: [3 0 1 1 0 1 1 1 0 1 1 0 1 1 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 40200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1 -1  0  0  0  1  0 -1  1 -1  1 -1  0] (Indices: [1, 4, 8, 13, 14, 16, 18]), Candidate: [ 3  0  1  1  0  1  1  1  0  1  0  1  2  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  1  0  0 -1  0  0  1 -1  0  1 -1  0] (Indices: [1, 4, 9, 10, 11, 15, 18]), Candidate: [3 0 1 1 0 1 1 0 2 1 0 0 1 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 40300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  1  0 -1  0  0  1 -1  1 -1  0  1 -1] (Indices: [1, 4, 9, 10, 14, 16, 19]), Candidate: [ 3  0  1  1  0  1  1  0  2  1 -1  1  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 40350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  1 -1  1 -1  0  1  0  0 -1  0  0  0] (Indices: [1, 4, 9, 11, 14, 15, 16]), Candidate: [3 0 1 1 0 1 1 0 2 0 1 0 1 2 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 40400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  1 -1  0  1 -1  0  1 -1  0  1  0 -1] (Indices: [1, 4, 9, 12, 15, 18, 19]), Candidate: [3 0 1 1 0 1 1 0 2 0 0 2 0 1 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 40450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  0  1  0  0 -1  1 -1  0  0  0  1 -1] (Indices: [1, 4, 10, 11, 12, 14, 19]), Candidate: [ 3  0  1  1  0  1  1  0  1  2  0  1  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  0  1 -1  1  0  0 -1  0  0  0  1 -1] (Indices: [1, 4, 10, 12, 13, 14, 19]), Candidate: [ 3  0  1  1  0  1  1  0  1  2 -1  2  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 40550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  0  1 -1  0  1 -1  0  0  1  0  0 -1] (Indices: [1, 4, 10, 13, 17, 18, 19]), Candidate: [ 3  0  1  1  0  1  1  0  1  2 -1  1  2  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  0  0  1  0 -1  0  0  0  1  0  0 -1] (Indices: [1, 4, 11, 12, 17, 18, 19]), Candidate: [3 0 1 1 0 1 1 0 1 1 1 1 0 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 40650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  0  0  0  1  0 -1  1 -1  1 -1  1 -1] (Indices: [1, 4, 12, 13, 15, 17, 19]), Candidate: [3 0 1 1 0 1 1 0 1 1 0 2 1 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 40700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0  0 -1  0  0  0  0  0  0  0  1 -1  0] (Indices: [1, 5, 6, 7, 8, 9, 18]), Candidate: [3 0 1 0 2 1 1 0 1 0 0 1 1 1 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 40750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  1  0 -1  0  0  1 -1  0  0  0  0  0] (Indices: [1, 5, 6, 7, 9, 10, 14]), Candidate: [ 3  0  1  0  2  1  1 -1  2  1 -1  1  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 40800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  0  1 -1  1  0 -1  0  0  0  0  0  0] (Indices: [1, 5, 6, 7, 10, 12, 13]), Candidate: [ 3  0  1  0  2  1  1 -1  1  2 -1  2  1  0  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 40850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  0  0  1 -1  0  0  0  1  0 -1  0  0] (Indices: [1, 5, 6, 7, 11, 16, 17]), Candidate: [ 3  0  1  0  2  1  1 -1  1  1  1  0  1  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  0  0  0  0  0  1 -1  0  1 -1  1 -1] (Indices: [1, 5, 6, 7, 14, 17, 19]), Candidate: [ 3  0  1  0  2  1  1 -1  1  1  0  1  1  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 40950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1  0 -1  0  0  0  0  1 -1  0  0  1 -1] (Indices: [1, 5, 6, 8, 9, 15, 19]), Candidate: [3 0 1 0 2 1 0 1 1 0 0 1 1 1 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 41000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1 -1  0  1 -1  1  0 -1  0  0  0  0  0] (Indices: [1, 5, 6, 8, 11, 13, 14]), Candidate: [ 3  0  1  0  2  1  0  1  0  1  1  0  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1 -1  0  0  0  1 -1  1 -1  0  0  1 -1] (Indices: [1, 5, 6, 8, 13, 15, 19]), Candidate: [3 0 1 0 2 1 0 1 0 1 0 1 2 0 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 41100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  1  0 -1  0  0  1 -1  0  1 -1  0  0] (Indices: [1, 5, 6, 9, 10, 14, 17]), Candidate: [ 3  0  1  0  2  1  0  0  2  1 -1  1  1  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 41150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  1 -1  0  1 -1  1 -1  0  0  1 -1  0] (Indices: [1, 5, 6, 9, 12, 14, 18]), Candidate: [ 3  0  1  0  2  1  0  0  2  0  0  2  0  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  0  1  0  0 -1  0  0  1 -1  0  0  0] (Indices: [1, 5, 6, 10, 11, 12, 16]), Candidate: [3 0 1 0 2 1 0 0 1 2 0 1 0 1 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 41250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  0  1 -1  0  1  0 -1  0  0  0  1 -1] (Indices: [1, 5, 6, 10, 13, 14, 19]), Candidate: [ 3  0  1  0  2  1  0  0  1  2 -1  1  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 41300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  0  0  1  0 -1  0  0  0  1 -1  1 -1] (Indices: [1, 5, 6, 11, 12, 17, 19]), Candidate: [3 0 1 0 2 1 0 0 1 1 1 1 0 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 41350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  0  0  0  1  0 -1  0  0  1 -1  1 -1] (Indices: [1, 5, 6, 12, 13, 17, 19]), Candidate: [3 0 1 0 2 1 0 0 1 1 0 2 1 0 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 41400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  0  0  0  0  0  1 -1  1 -1  1  0 -1] (Indices: [1, 5, 6, 14, 16, 18, 19]), Candidate: [ 3  0  1  0  2  1  0  0  1  1  0  1  1  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0  0 -1  0  0  0  0  0  0  1 -1  1 -1] (Indices: [1, 5, 7, 8, 9, 17, 19]), Candidate: [3 0 1 0 2 0 2 0 1 0 0 1 1 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 41500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0 -1  0  1 -1  1 -1  0  0  0  0  1 -1] (Indices: [1, 5, 7, 8, 11, 13, 19]), Candidate: [3 0 1 0 2 0 2 0 0 1 1 0 2 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 41550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0 -1  0  0  0  1 -1  0  0  1 -1  1 -1] (Indices: [1, 5, 7, 8, 13, 17, 19]), Candidate: [3 0 1 0 2 0 2 0 0 1 0 1 2 0 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 41600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  1  0 -1  0  0  0  1 -1  0  1 -1  0] (Indices: [1, 5, 7, 9, 10, 15, 18]), Candidate: [ 3  0  1  0  2  0  2 -1  2  1 -1  1  1  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 41650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  1 -1  0  1 -1  0  1 -1  0  0  1 -1] (Indices: [1, 5, 7, 9, 12, 15, 19]), Candidate: [ 3  0  1  0  2  0  2 -1  2  0  0  2  0  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  0  1  0 -1  1 -1  1 -1  0  0  0  0] (Indices: [1, 5, 7, 10, 11, 13, 15]), Candidate: [ 3  0  1  0  2  0  2 -1  1  2  0  0  2  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  0  1 -1  0  1 -1  0  1  0 -1  0  0] (Indices: [1, 5, 7, 10, 13, 16, 17]), Candidate: [ 3  0  1  0  2  0  2 -1  1  2 -1  1  2  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 41800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  0  0  1 -1  1  0 -1  0  0  1 -1  0] (Indices: [1, 5, 7, 11, 13, 14, 18]), Candidate: [ 3  0  1  0  2  0  2 -1  1  1  1  0  2  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 41850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  0  0  0  1 -1  1  0 -1  0  0  1 -1] (Indices: [1, 5, 7, 12, 14, 15, 19]), Candidate: [ 3  0  1  0  2  0  2 -1  1  1  0  2  0  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  0  0  0  0  0  0  1 -1  1  0  0 -1] (Indices: [1, 5, 7, 15, 17, 18, 19]), Candidate: [ 3  0  1  0  2  0  2 -1  1  1  0  1  1  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1  0 -1  1 -1  1 -1  0  0  0  0  1 -1] (Indices: [1, 5, 8, 9, 11, 13, 19]), Candidate: [3 0 1 0 2 0 1 1 1 0 1 0 2 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 42000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1  0 -1  0  0  1 -1  0  0  1 -1  1 -1] (Indices: [1, 5, 8, 9, 13, 17, 19]), Candidate: [3 0 1 0 2 0 1 1 1 0 0 1 2 0 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 42050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1 -1  1 -1  1  0  0 -1  0  0  0  0  0] (Indices: [1, 5, 8, 10, 12, 13, 14]), Candidate: [ 3  0  1  0  2  0  1  1  0  2 -1  2  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 42100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1 -1  1 -1  0  0  0  1 -1  1 -1  1 -1] (Indices: [1, 5, 8, 10, 15, 17, 19]), Candidate: [ 3  0  1  0  2  0  1  1  0  2 -1  1  1  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1 -1  0  1 -1  0  1 -1  0  1 -1  1 -1] (Indices: [1, 5, 8, 11, 14, 17, 19]), Candidate: [ 3  0  1  0  2  0  1  1  0  1  1  0  1  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1 -1  0  0  0  1  0  0 -1  0  0  1 -1] (Indices: [1, 5, 8, 13, 14, 15, 19]), Candidate: [3 0 1 0 2 0 1 1 0 1 0 1 2 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 42250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  1  0  0 -1  0  0  1  0 -1  0  0  0] (Indices: [1, 5, 9, 10, 11, 15, 16]), Candidate: [3 0 1 0 2 0 1 0 2 1 0 0 1 1 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 42300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  1  0 -1  0  0  1 -1  1  0 -1  0  0] (Indices: [1, 5, 9, 10, 14, 16, 17]), Candidate: [ 3  0  1  0  2  0  1  0  2  1 -1  1  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 42350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  1 -1  1 -1  1 -1  0  0  1 -1  1 -1] (Indices: [1, 5, 9, 11, 13, 17, 19]), Candidate: [3 0 1 0 2 0 1 0 2 0 1 0 2 0 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 42400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  1 -1  0  1 -1  0  1 -1  1  0 -1  0] (Indices: [1, 5, 9, 12, 15, 17, 18]), Candidate: [3 0 1 0 2 0 1 0 2 0 0 2 0 1 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 42450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  0  1  0  0 -1  1 -1  0  1 -1  0  0] (Indices: [1, 5, 10, 11, 12, 14, 17]), Candidate: [ 3  0  1  0  2  0  1  0  1  2  0  1  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  0  1 -1  1  0  0 -1  0  1 -1  0  0] (Indices: [1, 5, 10, 12, 13, 14, 17]), Candidate: [ 3  0  1  0  2  0  1  0  1  2 -1  2  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 42550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  0  1 -1  0  1 -1  0  1  0 -1  1 -1] (Indices: [1, 5, 10, 13, 16, 17, 19]), Candidate: [ 3  0  1  0  2  0  1  0  1  2 -1  1  2  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  0  0  1  0 -1  0  0  1  0 -1  1 -1] (Indices: [1, 5, 11, 12, 16, 17, 19]), Candidate: [3 0 1 0 2 0 1 0 1 1 1 1 0 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 42650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  0  0  0  1  0 -1  1  0 -1  0  1 -1] (Indices: [1, 5, 12, 13, 15, 16, 19]), Candidate: [3 0 1 0 2 0 1 0 1 1 0 2 1 0 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 42700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0  0  0 -1  0  0  0  0  0  1 -1  0  0] (Indices: [1, 6, 7, 8, 9, 10, 17]), Candidate: [ 3  0  1  0  1  2  1  0  1  1 -1  1  1  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0 -1  1 -1  1 -1  0  0  1 -1  0  0  0] (Indices: [1, 6, 7, 8, 10, 12, 16]), Candidate: [ 3  0  1  0  1  2  1  0  0  2 -1  2  0  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0 -1  0  1 -1  0  0  0  0  1  0 -1  0] (Indices: [1, 6, 7, 8, 11, 17, 18]), Candidate: [3 0 1 0 1 2 1 0 0 1 1 0 1 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 42850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0 -1  0  0  0  0  0  1  0 -1  1 -1  0] (Indices: [1, 6, 7, 8, 15, 16, 18]), Candidate: [3 0 1 0 1 2 1 0 0 1 0 1 1 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 42900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  1 -1  1  0 -1  0  0  0  0  1 -1  0] (Indices: [1, 6, 7, 9, 11, 12, 18]), Candidate: [ 3  0  1  0  1  2  1 -1  2  0  1  1  0  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  1 -1  0  0  1 -1  1 -1  1 -1  0  0] (Indices: [1, 6, 7, 9, 13, 15, 17]), Candidate: [ 3  0  1  0  1  2  1 -1  2  0  0  1  2  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  0  1  0 -1  0  0  1 -1  0  0  1 -1] (Indices: [1, 6, 7, 10, 11, 15, 19]), Candidate: [ 3  0  1  0  1  2  1 -1  1  2  0  0  1  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  0  1 -1  0  0  1 -1  0  1  0 -1  0] (Indices: [1, 6, 7, 10, 14, 17, 18]), Candidate: [ 3  0  1  0  1  2  1 -1  1  2 -1  1  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 43100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  0  0  1 -1  0  1  0 -1  1 -1  0  0] (Indices: [1, 6, 7, 11, 14, 15, 17]), Candidate: [ 3  0  1  0  1  2  1 -1  1  1  1  0  1  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  0  0  0  1 -1  0  0  1  0  0 -1  0] (Indices: [1, 6, 7, 12, 16, 17, 18]), Candidate: [ 3  0  1  0  1  2  1 -1  1  1  0  2  0  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1  0  0 -1  1 -1  0  0  1 -1  0  0  0] (Indices: [1, 6, 8, 9, 10, 12, 16]), Candidate: [ 3  0  1  0  1  2  0  1  1  1 -1  2  0  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1  0 -1  1 -1  0  0  0  0  1  0 -1  0] (Indices: [1, 6, 8, 9, 11, 17, 18]), Candidate: [3 0 1 0 1 2 0 1 1 0 1 0 1 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 43300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1  0 -1  0  0  0  0  1  0 -1  1 -1  0] (Indices: [1, 6, 8, 9, 15, 16, 18]), Candidate: [3 0 1 0 1 2 0 1 1 0 0 1 1 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 43350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1 -1  1 -1  1 -1  0  1 -1  0  1 -1  0] (Indices: [1, 6, 8, 10, 12, 15, 18]), Candidate: [ 3  0  1  0  1  2  0  1  0  2 -1  2  0  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1 -1  0  1  0 -1  1 -1  1 -1  0  0  0] (Indices: [1, 6, 8, 11, 12, 14, 16]), Candidate: [ 3  0  1  0  1  2  0  1  0  1  1  1  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1 -1  0  0  1  0  0 -1  1 -1  0  0  0] (Indices: [1, 6, 8, 12, 13, 14, 16]), Candidate: [ 3  0  1  0  1  2  0  1  0  1  0  2  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1 -1  0  0  0  1 -1  0  1  0  0 -1  0] (Indices: [1, 6, 8, 13, 16, 17, 18]), Candidate: [3 0 1 0 1 2 0 1 0 1 0 1 2 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 43550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  1  0 -1  1  0 -1  0  0  1 -1  0  0] (Indices: [1, 6, 9, 10, 12, 13, 17]), Candidate: [ 3  0  1  0  1  2  0  0  2  1 -1  2  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  1  0 -1  0  0  0  0  1  0 -1  1 -1] (Indices: [1, 6, 9, 10, 16, 17, 19]), Candidate: [ 3  0  1  0  1  2  0  0  2  1 -1  1  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  1 -1  1 -1  0  0  1  0 -1  1 -1  0] (Indices: [1, 6, 9, 11, 15, 16, 18]), Candidate: [3 0 1 0 1 2 0 0 2 0 1 0 1 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 43700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  1 -1  0  0  1  0 -1  1 -1  0  1 -1] (Indices: [1, 6, 9, 13, 14, 16, 19]), Candidate: [ 3  0  1  0  1  2  0  0  2  0  0  1  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  0  1  0 -1  1  0  0 -1  0  0  0  0] (Indices: [1, 6, 10, 11, 13, 14, 15]), Candidate: [3 0 1 0 1 2 0 0 1 2 0 0 2 1 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 43800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  0  1 -1  1 -1  1  0  0 -1  0  0  0] (Indices: [1, 6, 10, 12, 14, 15, 16]), Candidate: [ 3  0  1  0  1  2  0  0  1  2 -1  2  0  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  0  1 -1  0  0  0  1  0  0  0 -1  0] (Indices: [1, 6, 10, 15, 16, 17, 18]), Candidate: [ 3  0  1  0  1  2  0  0  1  2 -1  1  1  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  0  0  1 -1  1 -1  1  0  0 -1  0  0] (Indices: [1, 6, 11, 13, 15, 16, 17]), Candidate: [3 0 1 0 1 2 0 0 1 1 1 0 2 0 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 43950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  0  0  0  1 -1  1  0 -1  0  1  0 -1] (Indices: [1, 6, 12, 14, 15, 18, 19]), Candidate: [3 0 1 0 1 2 0 0 1 1 0 2 0 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 44000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0  0  0 -1  0  1 -1  0  0  0  1 -1  0] (Indices: [1, 7, 8, 9, 10, 13, 18]), Candidate: [ 3  0  1  0  1  1  2  0  1  1 -1  1  2  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0  0 -1  0  1  0 -1  0  0  0  0  1 -1] (Indices: [1, 7, 8, 9, 12, 13, 19]), Candidate: [3 0 1 0 1 1 2 0 1 0 0 2 1 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 44100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0  0 -1  0  0  0  0  0  0  1  0  0 -1] (Indices: [1, 7, 8, 9, 17, 18, 19]), Candidate: [3 0 1 0 1 1 2 0 1 0 0 1 1 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 44150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0 -1  1 -1  0  1  0  0 -1  0  0  0  0] (Indices: [1, 7, 8, 10, 13, 14, 15]), Candidate: [ 3  0  1  0  1  1  2  0  0  2 -1  1  2  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0 -1  0  1  0 -1  0  0  1  0 -1  0  0] (Indices: [1, 7, 8, 11, 12, 16, 17]), Candidate: [3 0 1 0 1 1 2 0 0 1 1 1 0 1 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 44250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0 -1  0  0  1  0 -1  0  1  0 -1  0  0] (Indices: [1, 7, 8, 12, 13, 16, 17]), Candidate: [3 0 1 0 1 1 2 0 0 1 0 2 1 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 44300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0 -1  0  0  0  0  1  0 -1  1 -1  1 -1] (Indices: [1, 7, 8, 14, 15, 17, 19]), Candidate: [3 0 1 0 1 1 2 0 0 1 0 1 1 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 44350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  1  0 -1  1 -1  0  1  0 -1  0  0  0] (Indices: [1, 7, 9, 10, 12, 15, 16]), Candidate: [ 3  0  1  0  1  1  2 -1  2  1 -1  2  0  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 44400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  1 -1  1  0  0 -1  0  0  0  0  1 -1] (Indices: [1, 7, 9, 11, 12, 13, 19]), Candidate: [ 3  0  1  0  1  1  2 -1  2  0  1  1  1  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  1 -1  1 -1  0  0  0  0  1  0  0 -1] (Indices: [1, 7, 9, 11, 17, 18, 19]), Candidate: [ 3  0  1  0  1  1  2 -1  2  0  1  0  1  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  1 -1  0  0  1 -1  1 -1  1 -1  1 -1] (Indices: [1, 7, 9, 13, 15, 17, 19]), Candidate: [ 3  0  1  0  1  1  2 -1  2  0  0  1  2  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  0  1  0 -1  1 -1  1 -1  0  0  1 -1] (Indices: [1, 7, 10, 11, 13, 15, 19]), Candidate: [ 3  0  1  0  1  1  2 -1  1  2  0  0  2  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  0  1 -1  1 -1  1 -1  0  1 -1  1 -1] (Indices: [1, 7, 10, 12, 14, 17, 19]), Candidate: [ 3  0  1  0  1  1  2 -1  1  2 -1  2  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 44650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  0  0  1  0  0  0 -1  0  0  1 -1  0] (Indices: [1, 7, 11, 12, 13, 14, 18]), Candidate: [ 3  0  1  0  1  1  2 -1  1  1  1  1  1  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 44700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  0  0  1 -1  1 -1  0  1 -1  1  0 -1] (Indices: [1, 7, 11, 13, 16, 18, 19]), Candidate: [ 3  0  1  0  1  1  2 -1  1  1  1  0  2  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  0  0  0  1 -1  0  1 -1  1  0  0 -1] (Indices: [1, 7, 12, 15, 17, 18, 19]), Candidate: [ 3  0  1  0  1  1  2 -1  1  1  0  2  0  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1  0  0  0 -1  0  0  0  0  0  1  0 -1] (Indices: [1, 8, 9, 10, 11, 18, 19]), Candidate: [3 0 1 0 1 1 1 1 1 1 0 0 1 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 44850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1  0  0 -1  0  0  0  1 -1  1  0 -1  0] (Indices: [1, 8, 9, 10, 15, 17, 18]), Candidate: [ 3  0  1  0  1  1  1  1  1  1 -1  1  1  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1  0 -1  1 -1  0  1 -1  0  1  0 -1  0] (Indices: [1, 8, 9, 11, 14, 17, 18]), Candidate: [ 3  0  1  0  1  1  1  1  1  0  1  0  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1  0 -1  0  0  1  0  0 -1  0  1 -1  0] (Indices: [1, 8, 9, 13, 14, 15, 18]), Candidate: [3 0 1 0 1 1 1 1 1 0 0 1 2 1 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 45000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1 -1  1  0  0 -1  0  0  1 -1  0  1 -1] (Indices: [1, 8, 10, 11, 12, 16, 19]), Candidate: [3 0 1 0 1 1 1 1 0 2 0 1 0 1 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 45050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1 -1  1 -1  1  0 -1  0  1 -1  0  1 -1] (Indices: [1, 8, 10, 12, 13, 16, 19]), Candidate: [ 3  0  1  0  1  1  1  1  0  2 -1  2  1  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1 -1  1 -1  0  0  1 -1  1  0  0 -1  0] (Indices: [1, 8, 10, 14, 16, 17, 18]), Candidate: [ 3  0  1  0  1  1  1  1  0  2 -1  1  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 45150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1 -1  0  1 -1  1  0 -1  1 -1  0  1 -1] (Indices: [1, 8, 11, 13, 14, 16, 19]), Candidate: [ 3  0  1  0  1  1  1  1  0  1  1  0  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1 -1  0  0  1 -1  1  0  0 -1  1 -1  0] (Indices: [1, 8, 12, 14, 15, 16, 18]), Candidate: [3 0 1 0 1 1 1 1 0 1 0 2 0 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 45250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  1  0  0  0 -1  0  0  1  0 -1  0  0] (Indices: [1, 9, 10, 11, 12, 16, 17]), Candidate: [3 0 1 0 1 1 1 0 2 1 0 1 0 1 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 45300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  1  0 -1  1  0 -1  0  1  0 -1  0  0] (Indices: [1, 9, 10, 12, 13, 16, 17]), Candidate: [ 3  0  1  0  1  1  1  0  2  1 -1  2  1  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  1  0 -1  0  0  1  0 -1  1 -1  1 -1] (Indices: [1, 9, 10, 14, 15, 17, 19]), Candidate: [ 3  0  1  0  1  1  1  0  2  1 -1  1  1  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  1 -1  1 -1  1  0 -1  1  0 -1  0  0] (Indices: [1, 9, 11, 13, 14, 16, 17]), Candidate: [ 3  0  1  0  1  1  1  0  2  0  1  0  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  1 -1  0  1  0 -1  0  0  1  0  0 -1] (Indices: [1, 9, 12, 13, 17, 18, 19]), Candidate: [3 0 1 0 1 1 1 0 2 0 0 2 1 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 45500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  0  1  0  0  0 -1  0  0  1 -1  1 -1] (Indices: [1, 10, 11, 12, 13, 17, 19]), Candidate: [3 0 1 0 1 1 1 0 1 2 0 1 1 0 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 45550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  0  1  0 -1  0  1 -1  1 -1  1  0 -1] (Indices: [1, 10, 11, 14, 16, 18, 19]), Candidate: [ 3  0  1  0  1  1  1  0  1  2  0  0  1  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  0  1 -1  0  1  0 -1  1 -1  1  0 -1] (Indices: [1, 10, 13, 14, 16, 18, 19]), Candidate: [ 3  0  1  0  1  1  1  0  1  2 -1  1  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 45650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  0  0  1 -1  1  0  0  0 -1  0  1 -1] (Indices: [1, 11, 13, 14, 15, 16, 19]), Candidate: [3 0 1 0 1 1 1 0 1 1 1 0 2 1 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 45700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  0  0  1 -1  0  0  0  0  0  0  0  0] (Indices: [2, 3, 4, 5, 6, 7, 11]), Candidate: [ 2  2  1  0  1  1  1 -1  1  1  1  0  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  0  0  0  1 -1  0  0  1 -1  0  0  0] (Indices: [2, 3, 4, 5, 6, 12, 16]), Candidate: [2 2 1 0 1 1 0 0 1 1 0 2 0 1 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 45800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  0  1 -1  0  0  0  1 -1  0  0  0  0] (Indices: [2, 3, 4, 5, 7, 10, 15]), Candidate: [ 2  2  1  0  1  0  2 -1  1  2 -1  1  1  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 45850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1  0 -1  0  0  0  0  0  0  0  0  1 -1] (Indices: [2, 3, 4, 5, 8, 9, 19]), Candidate: [2 2 1 0 1 0 1 1 1 0 0 1 1 1 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 45900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  1  0 -1  0  0  0  1 -1  0  0  0  0] (Indices: [2, 3, 4, 5, 9, 10, 15]), Candidate: [ 2  2  1  0  1  0  1  0  2  1 -1  1  1  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  0  1 -1  1 -1  1 -1  0  0  0  0  0] (Indices: [2, 3, 4, 5, 10, 12, 14]), Candidate: [ 2  2  1  0  1  0  1  0  1  2 -1  2  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 46000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  0  0  1 -1  0  0  0  1 -1  1 -1  0] (Indices: [2, 3, 4, 5, 11, 16, 18]), Candidate: [2 2 1 0 1 0 1 0 1 1 1 0 1 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 46050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  0  0  0  0  0  1 -1  0  0  1  0 -1] (Indices: [2, 3, 4, 5, 14, 18, 19]), Candidate: [ 2  2  1  0  1  0  1  0  1  1  0  1  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  0  0  0  1 -1  1 -1  0  0  0  0  0] (Indices: [2, 3, 4, 6, 7, 12, 14]), Candidate: [ 2  2  1  0  0  2  1 -1  1  1  0  2  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 46150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1 -1  0  1 -1  0  0  0  1 -1  0  0  0] (Indices: [2, 3, 4, 6, 8, 11, 16]), Candidate: [2 2 1 0 0 2 0 1 0 1 1 0 1 1 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 46200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  1 -1  0  1 -1  1 -1  0  0  0  0  0] (Indices: [2, 3, 4, 6, 9, 12, 14]), Candidate: [ 2  2  1  0  0  2  0  0  2  0  0  2  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  0  1 -1  0  0  1 -1  0  1 -1  0  0] (Indices: [2, 3, 4, 6, 10, 14, 17]), Candidate: [ 2  2  1  0  0  2  0  0  1  2 -1  1  1  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 46300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  0  0  0  1 -1  1 -1  0  0  1 -1  0] (Indices: [2, 3, 4, 6, 12, 14, 18]), Candidate: [ 2  2  1  0  0  2  0  0  1  1  0  2  0  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0  0 -1  0  0  1 -1  0  0  0  0  0  0] (Indices: [2, 3, 4, 7, 8, 9, 13]), Candidate: [2 2 1 0 0 1 2 0 1 0 0 1 2 0 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 46400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0 -1  0  0  0  0  0  0  0  1 -1  1 -1] (Indices: [2, 3, 4, 7, 8, 17, 19]), Candidate: [2 2 1 0 0 1 2 0 0 1 0 1 1 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 46450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  0  1  0 -1  0  0  1 -1  0  0  0  0] (Indices: [2, 3, 4, 7, 10, 11, 15]), Candidate: [ 2  2  1  0  0  1  2 -1  1  2  0  0  1  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  0  0  1 -1  0  1 -1  0  0  0  1 -1] (Indices: [2, 3, 4, 7, 11, 14, 19]), Candidate: [ 2  2  1  0  0  1  2 -1  1  1  1  0  1  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 46550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  0  0  0  0  0  1  0 -1  0  0  1 -1] (Indices: [2, 3, 4, 7, 14, 15, 19]), Candidate: [ 2  2  1  0  0  1  2 -1  1  1  0  1  1  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1  0 -1  0  0  0  1 -1  0  0  1 -1  0] (Indices: [2, 3, 4, 8, 9, 14, 18]), Candidate: [ 2  2  1  0  0  1  1  1  1  0  0  1  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1 -1  0  1  0 -1  0  1 -1  0  0  0  0] (Indices: [2, 3, 4, 8, 11, 12, 15]), Candidate: [2 2 1 0 0 1 1 1 0 1 1 1 0 1 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 46700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1 -1  0  0  0  1  0 -1  0  0  1 -1  0] (Indices: [2, 3, 4, 8, 13, 14, 18]), Candidate: [ 2  2  1  0  0  1  1  1  0  1  0  1  2  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  1  0 -1  0  1 -1  0  0  1 -1  0  0] (Indices: [2, 3, 4, 9, 10, 13, 17]), Candidate: [ 2  2  1  0  0  1  1  0  2  1 -1  1  2  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  1 -1  0  1  0 -1  0  0  0  1 -1  0] (Indices: [2, 3, 4, 9, 12, 13, 18]), Candidate: [2 2 1 0 0 1 1 0 2 0 0 2 1 0 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 46850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  1 -1  0  0  0  0  0  1 -1  1  0 -1] (Indices: [2, 3, 4, 9, 16, 18, 19]), Candidate: [2 2 1 0 0 1 1 0 2 0 0 1 1 1 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 46900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  0  1 -1  1 -1  0  0  0  0  1  0 -1] (Indices: [2, 3, 4, 10, 12, 18, 19]), Candidate: [ 2  2  1  0  0  1  1  0  1  2 -1  2  0  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  0  0  1  0 -1  0  1 -1  0  0  1 -1] (Indices: [2, 3, 4, 11, 12, 15, 19]), Candidate: [2 2 1 0 0 1 1 0 1 1 1 1 0 1 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 47000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  0  0  0  1  0 -1  1 -1  0  0  1 -1] (Indices: [2, 3, 4, 12, 13, 15, 19]), Candidate: [2 2 1 0 0 1 1 0 1 1 0 2 1 0 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 47050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  0  0  0  0  0  1  0 -1  1  0 -1  0] (Indices: [2, 3, 4, 14, 15, 17, 18]), Candidate: [2 2 1 0 0 1 1 0 1 1 0 1 1 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 47100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  0  0  0  1  0 -1  0  0  0  0  0  0] (Indices: [2, 3, 5, 6, 7, 12, 13]), Candidate: [ 2  2  1 -1  2  1  1 -1  1  1  0  2  1  0  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 47150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1 -1  0  1 -1  0  0  1 -1  0  0  0  0] (Indices: [2, 3, 5, 6, 8, 11, 15]), Candidate: [ 2  2  1 -1  2  1  0  1  0  1  1  0  1  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  1 -1  0  1  0 -1  0  0  0  0  0  0] (Indices: [2, 3, 5, 6, 9, 12, 13]), Candidate: [ 2  2  1 -1  2  1  0  0  2  0  0  2  1  0  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  0  1 -1  0  0  1 -1  1 -1  0  0  0] (Indices: [2, 3, 5, 6, 10, 14, 16]), Candidate: [ 2  2  1 -1  2  1  0  0  1  2 -1  1  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 47300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  0  0  0  1 -1  1 -1  0  1 -1  0  0] (Indices: [2, 3, 5, 6, 12, 14, 17]), Candidate: [ 2  2  1 -1  2  1  0  0  1  1  0  2  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 47350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0  0 -1  0  1 -1  0  0  0  0  0  0  0] (Indices: [2, 3, 5, 7, 8, 9, 12]), Candidate: [ 2  2  1 -1  2  0  2  0  1  0  0  2  0  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0 -1  0  0  0  0  0  0  0  1  0 -1  0] (Indices: [2, 3, 5, 7, 8, 17, 18]), Candidate: [ 2  2  1 -1  2  0  2  0  0  1  0  1  1  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  0  1  0 -1  0  1 -1  0  0  0  0  0] (Indices: [2, 3, 5, 7, 10, 11, 14]), Candidate: [ 2  2  1 -1  2  0  2 -1  1  2  0  0  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 47500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  0  0  1 -1  0  1 -1  0  0  1 -1  0] (Indices: [2, 3, 5, 7, 11, 14, 18]), Candidate: [ 2  2  1 -1  2  0  2 -1  1  1  1  0  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 47550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  0  0  0  0  0  1  0 -1  0  1 -1  0] (Indices: [2, 3, 5, 7, 14, 15, 18]), Candidate: [ 2  2  1 -1  2  0  2 -1  1  1  0  1  1  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 47600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1  0 -1  0  0  0  1 -1  0  1 -1  0  0] (Indices: [2, 3, 5, 8, 9, 14, 17]), Candidate: [ 2  2  1 -1  2  0  1  1  1  0  0  1  1  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 47650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1 -1  0  1  0 -1  1 -1  0  0  0  0  0] (Indices: [2, 3, 5, 8, 11, 12, 14]), Candidate: [ 2  2  1 -1  2  0  1  1  0  1  1  1  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 47700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1 -1  0  0  0  1  0 -1  0  1 -1  0  0] (Indices: [2, 3, 5, 8, 13, 14, 17]), Candidate: [ 2  2  1 -1  2  0  1  1  0  1  0  1  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 47750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  1  0 -1  0  1 -1  0  1 -1  0  0  0] (Indices: [2, 3, 5, 9, 10, 13, 16]), Candidate: [ 2  2  1 -1  2  0  1  0  2  1 -1  1  2  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 47800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  1 -1  0  1  0 -1  0  0  1 -1  0  0] (Indices: [2, 3, 5, 9, 12, 13, 17]), Candidate: [ 2  2  1 -1  2  0  1  0  2  0  0  2  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  1 -1  0  0  0  0  0  1  0 -1  1 -1] (Indices: [2, 3, 5, 9, 16, 17, 19]), Candidate: [ 2  2  1 -1  2  0  1  0  2  0  0  1  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  0  1 -1  1 -1  0  0  0  1 -1  1 -1] (Indices: [2, 3, 5, 10, 12, 17, 19]), Candidate: [ 2  2  1 -1  2  0  1  0  1  2 -1  2  0  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 47950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  0  0  1  0 -1  0  1 -1  0  1 -1  0] (Indices: [2, 3, 5, 11, 12, 15, 18]), Candidate: [ 2  2  1 -1  2  0  1  0  1  1  1  1  0  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  0  0  0  1  0 -1  1 -1  0  1 -1  0] (Indices: [2, 3, 5, 12, 13, 15, 18]), Candidate: [ 2  2  1 -1  2  0  1  0  1  1  0  2  1  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  0  0  0  0  0  1  0  0 -1  0  1 -1] (Indices: [2, 3, 5, 14, 15, 16, 19]), Candidate: [ 2  2  1 -1  2  0  1  0  1  1  0  1  1  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0 -1  0  0  0  1 -1  0  0  1 -1  0  0] (Indices: [2, 3, 6, 7, 8, 13, 17]), Candidate: [ 2  2  1 -1  1  2  1  0  0  1  0  1  2  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  1 -1  0  0  0  1 -1  0  1 -1  0  0] (Indices: [2, 3, 6, 7, 9, 14, 17]), Candidate: [ 2  2  1 -1  1  2  1 -1  2  0  0  1  1  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 48200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  0  0  1  0 -1  1 -1  0  0  0  0  0] (Indices: [2, 3, 6, 7, 11, 12, 14]), Candidate: [ 2  2  1 -1  1  2  1 -1  1  1  1  1  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 48250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  0  0  0  0  1  0 -1  0  1 -1  0  0] (Indices: [2, 3, 6, 7, 13, 14, 17]), Candidate: [ 2  2  1 -1  1  2  1 -1  1  1  0  1  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 48300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1  0 -1  0  1  0 -1  0  0  0  0  0  0] (Indices: [2, 3, 6, 8, 9, 12, 13]), Candidate: [ 2  2  1 -1  1  2  0  1  1  0  0  2  1  0  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1 -1  1 -1  0  0  1 -1  1 -1  0  0  0] (Indices: [2, 3, 6, 8, 10, 14, 16]), Candidate: [ 2  2  1 -1  1  2  0  1  0  2 -1  1  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 48400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1 -1  0  0  1 -1  1 -1  0  1 -1  0  0] (Indices: [2, 3, 6, 8, 12, 14, 17]), Candidate: [ 2  2  1 -1  1  2  0  1  0  1  0  2  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 48450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  1  0  0 -1  0  1 -1  0  0  0  0  0] (Indices: [2, 3, 6, 9, 10, 11, 14]), Candidate: [ 2  2  1 -1  1  2  0  0  2  1  0  0  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 48500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  1 -1  1 -1  0  1 -1  0  0  1 -1  0] (Indices: [2, 3, 6, 9, 11, 14, 18]), Candidate: [ 2  2  1 -1  1  2  0  0  2  0  1  0  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 48550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  1 -1  0  0  0  1  0 -1  0  1 -1  0] (Indices: [2, 3, 6, 9, 14, 15, 18]), Candidate: [ 2  2  1 -1  1  2  0  0  2  0  0  1  1  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  0  1 -1  1  0 -1  0  0  0  1 -1  0] (Indices: [2, 3, 6, 10, 12, 13, 18]), Candidate: [ 2  2  1 -1  1  2  0  0  1  2 -1  2  1  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 48650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  0  1 -1  0  0  0  0  1 -1  1  0 -1] (Indices: [2, 3, 6, 10, 16, 18, 19]), Candidate: [ 2  2  1 -1  1  2  0  0  1  2 -1  1  1  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 48700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  0  0  1 -1  0  0  1  0 -1  0  1 -1] (Indices: [2, 3, 6, 11, 15, 16, 19]), Candidate: [ 2  2  1 -1  1  2  0  0  1  1  1  0  1  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  0  0  0  0  1  0 -1  0  1  0 -1  0] (Indices: [2, 3, 6, 13, 14, 17, 18]), Candidate: [ 2  2  1 -1  1  2  0  0  1  1  0  1  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 48800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0  0 -1  0  1 -1  0  0  0  0  1 -1  0] (Indices: [2, 3, 7, 8, 9, 12, 18]), Candidate: [ 2  2  1 -1  1  1  2  0  1  0  0  2  0  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0 -1  1 -1  0  0  0  1 -1  1 -1  0  0] (Indices: [2, 3, 7, 8, 10, 15, 17]), Candidate: [ 2  2  1 -1  1  1  2  0  0  2 -1  1  1  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 48900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0 -1  0  0  1 -1  0  1 -1  0  1 -1  0] (Indices: [2, 3, 7, 8, 12, 15, 18]), Candidate: [ 2  2  1 -1  1  1  2  0  0  1  0  2  0  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  1  0  0 -1  0  0  0  0  0  0  1 -1] (Indices: [2, 3, 7, 9, 10, 11, 19]), Candidate: [ 2  2  1 -1  1  1  2 -1  2  1  0  0  1  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 49000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  1 -1  1 -1  0  0  1 -1  0  0  1 -1] (Indices: [2, 3, 7, 9, 11, 15, 19]), Candidate: [ 2  2  1 -1  1  1  2 -1  2  0  1  0  1  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 49050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  1 -1  0  0  0  1 -1  0  1  0 -1  0] (Indices: [2, 3, 7, 9, 14, 17, 18]), Candidate: [ 2  2  1 -1  1  1  2 -1  2  0  0  1  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 49100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  0  1 -1  1 -1  1 -1  0  0  1 -1  0] (Indices: [2, 3, 7, 10, 12, 14, 18]), Candidate: [ 2  2  1 -1  1  1  2 -1  1  2 -1  2  0  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 49150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  0  0  1  0  0 -1  0  0  1 -1  0  0] (Indices: [2, 3, 7, 11, 12, 13, 17]), Candidate: [ 2  2  1 -1  1  1  2 -1  1  1  1  1  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 49200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  0  0  1 -1  0  0  0  1  0 -1  1 -1] (Indices: [2, 3, 7, 11, 16, 17, 19]), Candidate: [ 2  2  1 -1  1  1  2 -1  1  1  1  0  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 49250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  0  0  0  0  1 -1  1  0 -1  0  1 -1] (Indices: [2, 3, 7, 13, 15, 16, 19]), Candidate: [ 2  2  1 -1  1  1  2 -1  1  1  0  1  2  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 49300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1  0  0 -1  0  0  0  1 -1  1 -1  0  0] (Indices: [2, 3, 8, 9, 10, 15, 17]), Candidate: [ 2  2  1 -1  1  1  1  1  1  1 -1  1  1  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 49350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1  0 -1  0  1 -1  0  1 -1  0  1 -1  0] (Indices: [2, 3, 8, 9, 12, 15, 18]), Candidate: [ 2  2  1 -1  1  1  1  1  1  0  0  2  0  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1 -1  1  0 -1  1  0 -1  0  0  0  0  0] (Indices: [2, 3, 8, 10, 11, 13, 14]), Candidate: [ 2  2  1 -1  1  1  1  1  0  2  0  0  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 49450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1 -1  1 -1  0  1 -1  1 -1  0  0  1 -1] (Indices: [2, 3, 8, 10, 13, 15, 19]), Candidate: [ 2  2  1 -1  1  1  1  1  0  2 -1  1  2  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 49500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1 -1  0  1 -1  1  0 -1  0  1 -1  0  0] (Indices: [2, 3, 8, 11, 13, 14, 17]), Candidate: [ 2  2  1 -1  1  1  1  1  0  1  1  0  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 49550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1 -1  0  0  1 -1  1  0 -1  0  1 -1  0] (Indices: [2, 3, 8, 12, 14, 15, 18]), Candidate: [ 2  2  1 -1  1  1  1  1  0  1  0  2  0  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1 -1  0  0  0  0  0  1  0 -1  1  0 -1] (Indices: [2, 3, 8, 15, 16, 18, 19]), Candidate: [ 2  2  1 -1  1  1  1  1  0  1  0  1  1  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  1  0 -1  1 -1  0  0  0  1 -1  1 -1] (Indices: [2, 3, 9, 10, 12, 17, 19]), Candidate: [ 2  2  1 -1  1  1  1  0  2  1 -1  2  0  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 49700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  1 -1  1  0 -1  0  1 -1  0  1 -1  0] (Indices: [2, 3, 9, 11, 12, 15, 18]), Candidate: [ 2  2  1 -1  1  1  1  0  2  0  1  1  0  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  1 -1  0  1  0 -1  1 -1  0  1 -1  0] (Indices: [2, 3, 9, 12, 13, 15, 18]), Candidate: [ 2  2  1 -1  1  1  1  0  2  0  0  2  1  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  1 -1  0  0  0  1  0  0 -1  0  1 -1] (Indices: [2, 3, 9, 14, 15, 16, 19]), Candidate: [ 2  2  1 -1  1  1  1  0  2  0  0  1  1  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  0  1  0 -1  0  1  0 -1  1 -1  0  0] (Indices: [2, 3, 10, 11, 14, 15, 17]), Candidate: [ 2  2  1 -1  1  1  1  0  1  2  0  0  1  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  0  1 -1  1 -1  0  0  1  0  0 -1  0] (Indices: [2, 3, 10, 12, 16, 17, 18]), Candidate: [ 2  2  1 -1  1  1  1  0  1  2 -1  2  0  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 49950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  0  0  1  0  0 -1  0  1 -1  0  1 -1] (Indices: [2, 3, 11, 12, 13, 16, 19]), Candidate: [ 2  2  1 -1  1  1  1  0  1  1  1  1  1  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  0  0  1 -1  0  1 -1  1  0  0 -1  0] (Indices: [2, 3, 11, 14, 16, 17, 18]), Candidate: [ 2  2  1 -1  1  1  1  0  1  1  1  0  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 50050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  0  0  0  0  1  0 -1  1  0  0 -1  0] (Indices: [2, 3, 13, 14, 16, 17, 18]), Candidate: [ 2  2  1 -1  1  1  1  0  1  1  0  1  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 50100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  0  0  1 -1  0  0  0  0  1 -1  0  0] (Indices: [2, 4, 5, 6, 7, 11, 17]), Candidate: [ 2  2  0  1  1  1  1 -1  1  1  1  0  1  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1 -1  0  1  0 -1  0  0  0  0  0  0  0] (Indices: [2, 4, 5, 6, 8, 11, 12]), Candidate: [2 2 0 1 1 1 0 1 0 1 1 1 0 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 50200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  1 -1  1 -1  0  0  0  0  1 -1  0  0] (Indices: [2, 4, 5, 6, 9, 11, 17]), Candidate: [2 2 0 1 1 1 0 0 2 0 1 0 1 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 50250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  0  1 -1  0  1 -1  0  0  0  1 -1  0] (Indices: [2, 4, 5, 6, 10, 13, 18]), Candidate: [ 2  2  0  1  1  1  0  0  1  2 -1  1  2  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  0  0  0  1  0 -1  0  0  0  0  1 -1] (Indices: [2, 4, 5, 6, 12, 13, 19]), Candidate: [2 2 0 1 1 1 0 0 1 1 0 2 1 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 50350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  0  0  0  0  0  0  0  0  1  0  0 -1] (Indices: [2, 4, 5, 6, 17, 18, 19]), Candidate: [2 2 0 1 1 1 0 0 1 1 0 1 1 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 50400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0 -1  0  0  0  0  0  0  1  0 -1  0  0] (Indices: [2, 4, 5, 7, 8, 16, 17]), Candidate: [2 2 0 1 1 0 2 0 0 1 0 1 1 1 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 50450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  1 -1  0  0  0  0  0  0  0  1  0 -1] (Indices: [2, 4, 5, 7, 9, 18, 19]), Candidate: [ 2  2  0  1  1  0  2 -1  2  0  0  1  1  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  0  0  1 -1  0  1  0 -1  0  0  0  0] (Indices: [2, 4, 5, 7, 11, 14, 15]), Candidate: [ 2  2  0  1  1  0  2 -1  1  1  1  0  1  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  0  0  0  0  1 -1  0  0  0  1  0 -1] (Indices: [2, 4, 5, 7, 13, 18, 19]), Candidate: [ 2  2  0  1  1  0  2 -1  1  1  0  1  2  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1  0 -1  0  0  1 -1  0  0  0  0  1 -1] (Indices: [2, 4, 5, 8, 9, 13, 19]), Candidate: [2 2 0 1 1 0 1 1 1 0 0 1 2 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 50650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1 -1  1 -1  0  0  0  0  0  1 -1  1 -1] (Indices: [2, 4, 5, 8, 10, 17, 19]), Candidate: [ 2  2  0  1  1  0  1  1  0  2 -1  1  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1 -1  0  0  1 -1  0  0  0  0  1  0 -1] (Indices: [2, 4, 5, 8, 12, 18, 19]), Candidate: [2 2 0 1 1 0 1 1 0 1 0 2 0 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 50750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  1  0 -1  1 -1  0  0  0  0  0  1 -1] (Indices: [2, 4, 5, 9, 10, 12, 19]), Candidate: [ 2  2  0  1  1  0  1  0  2  1 -1  2  0  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  1 -1  0  1  0  0 -1  0  0  0  0  0] (Indices: [2, 4, 5, 9, 12, 13, 14]), Candidate: [ 2  2  0  1  1  0  1  0  2  0  0  2  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  1 -1  0  0  0  0  1 -1  1 -1  1 -1] (Indices: [2, 4, 5, 9, 15, 17, 19]), Candidate: [2 2 0 1 1 0 1 0 2 0 0 1 1 1 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 50900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  0  1 -1  1 -1  0  0  1 -1  1 -1  0] (Indices: [2, 4, 5, 10, 12, 16, 18]), Candidate: [ 2  2  0  1  1  0  1  0  1  2 -1  2  0  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  0  0  1  0 -1  1 -1  0  0  0  1 -1] (Indices: [2, 4, 5, 11, 12, 14, 19]), Candidate: [ 2  2  0  1  1  0  1  0  1  1  1  1  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  0  0  0  1  0  0 -1  0  0  0  1 -1] (Indices: [2, 4, 5, 12, 13, 14, 19]), Candidate: [ 2  2  0  1  1  0  1  0  1  1  0  2  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  0  0  0  0  1 -1  0  0  1  0  0 -1] (Indices: [2, 4, 5, 13, 17, 18, 19]), Candidate: [2 2 0 1 1 0 1 0 1 1 0 1 2 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 51100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0 -1  0  0  0  1  0 -1  0  0  0  0  0] (Indices: [2, 4, 6, 7, 8, 13, 14]), Candidate: [ 2  2  0  1  0  2  1  0  0  1  0  1  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  1 -1  0  0  1 -1  0  0  0  0  1 -1] (Indices: [2, 4, 6, 7, 9, 13, 19]), Candidate: [ 2  2  0  1  0  2  1 -1  2  0  0  1  2  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  0  1 -1  0  0  0  0  0  1 -1  1 -1] (Indices: [2, 4, 6, 7, 10, 17, 19]), Candidate: [ 2  2  0  1  0  2  1 -1  1  2 -1  1  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 51250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  0  0  0  1 -1  0  0  0  0  1  0 -1] (Indices: [2, 4, 6, 7, 12, 18, 19]), Candidate: [ 2  2  0  1  0  2  1 -1  1  1  0  2  0  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1  0 -1  1 -1  0  0  0  0  1 -1  0  0] (Indices: [2, 4, 6, 8, 9, 11, 17]), Candidate: [2 2 0 1 0 2 0 1 1 0 1 0 1 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 51350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1 -1  1 -1  0  1 -1  0  0  0  1 -1  0] (Indices: [2, 4, 6, 8, 10, 13, 18]), Candidate: [ 2  2  0  1  0  2  0  1  0  2 -1  1  2  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1 -1  0  0  1  0 -1  0  0  0  0  1 -1] (Indices: [2, 4, 6, 8, 12, 13, 19]), Candidate: [2 2 0 1 0 2 0 1 0 1 0 2 1 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 51450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1 -1  0  0  0  0  0  0  0  1  0  0 -1] (Indices: [2, 4, 6, 8, 17, 18, 19]), Candidate: [2 2 0 1 0 2 0 1 0 1 0 1 1 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 51500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  1 -1  1 -1  0  1  0 -1  0  0  0  0] (Indices: [2, 4, 6, 9, 11, 14, 15]), Candidate: [2 2 0 1 0 2 0 0 2 0 1 0 1 2 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 51550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  1 -1  0  0  1 -1  0  0  0  1  0 -1] (Indices: [2, 4, 6, 9, 13, 18, 19]), Candidate: [2 2 0 1 0 2 0 0 2 0 0 1 2 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 51600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  0  1 -1  1  0 -1  1 -1  0  0  0  0] (Indices: [2, 4, 6, 10, 12, 13, 15]), Candidate: [ 2  2  0  1  0  2  0  0  1  2 -1  2  1  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  0  1 -1  0  0  0  1 -1  0  1  0 -1] (Indices: [2, 4, 6, 10, 15, 18, 19]), Candidate: [ 2  2  0  1  0  2  0  0  1  2 -1  1  1  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  0  0  1 -1  0  1 -1  0  0  1  0 -1] (Indices: [2, 4, 6, 11, 14, 18, 19]), Candidate: [ 2  2  0  1  0  2  0  0  1  1  1  0  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  0  0  0  0  1  0 -1  1  0 -1  0  0] (Indices: [2, 4, 6, 13, 14, 16, 17]), Candidate: [ 2  2  0  1  0  2  0  0  1  1  0  1  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0  0 -1  0  1 -1  0  1 -1  0  0  0  0] (Indices: [2, 4, 7, 8, 9, 12, 15]), Candidate: [2 2 0 1 0 1 2 0 1 0 0 2 0 1 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 51850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0 -1  1 -1  0  0  1 -1  0  0  1 -1  0] (Indices: [2, 4, 7, 8, 10, 14, 18]), Candidate: [ 2  2  0  1  0  1  2  0  0  2 -1  1  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 51900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0 -1  0  0  1 -1  1 -1  0  0  0  1 -1] (Indices: [2, 4, 7, 8, 12, 14, 19]), Candidate: [ 2  2  0  1  0  1  2  0  0  1  0  2  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  1  0  0 -1  0  0  0  1 -1  0  0  0] (Indices: [2, 4, 7, 9, 10, 11, 16]), Candidate: [ 2  2  0  1  0  1  2 -1  2  1  0  0  1  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  1 -1  1 -1  0  0  1  0 -1  0  0  0] (Indices: [2, 4, 7, 9, 11, 15, 16]), Candidate: [ 2  2  0  1  0  1  2 -1  2  0  1  0  1  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  1 -1  0  0  0  1 -1  1  0 -1  0  0] (Indices: [2, 4, 7, 9, 14, 16, 17]), Candidate: [ 2  2  0  1  0  1  2 -1  2  0  0  1  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  0  1 -1  1 -1  1  0 -1  0  0  0  0] (Indices: [2, 4, 7, 10, 12, 14, 15]), Candidate: [ 2  2  0  1  0  1  2 -1  1  2 -1  2  0  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  0  0  1  0  0  0 -1  0  0  0  0  0] (Indices: [2, 4, 7, 11, 12, 13, 14]), Candidate: [ 2  2  0  1  0  1  2 -1  1  1  1  1  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  0  0  1 -1  0  0  1 -1  1 -1  1 -1] (Indices: [2, 4, 7, 11, 15, 17, 19]), Candidate: [ 2  2  0  1  0  1  2 -1  1  1  1  0  1  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  0  0  0  0  1  0 -1  0  0  1  0 -1] (Indices: [2, 4, 7, 13, 14, 18, 19]), Candidate: [ 2  2  0  1  0  1  2 -1  1  1  0  1  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1  0  0 -1  0  0  1 -1  0  0  1 -1  0] (Indices: [2, 4, 8, 9, 10, 14, 18]), Candidate: [ 2  2  0  1  0  1  1  1  1  1 -1  1  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1  0 -1  0  1 -1  1 -1  0  0  0  1 -1] (Indices: [2, 4, 8, 9, 12, 14, 19]), Candidate: [ 2  2  0  1  0  1  1  1  1  0  0  2  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1 -1  1  0  0 -1  0  0  0  1 -1  0  0] (Indices: [2, 4, 8, 10, 11, 12, 17]), Candidate: [2 2 0 1 0 1 1 1 0 2 0 1 0 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 52450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1 -1  1 -1  0  1 -1  1  0 -1  0  0  0] (Indices: [2, 4, 8, 10, 13, 15, 16]), Candidate: [ 2  2  0  1  0  1  1  1  0  2 -1  1  2  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1 -1  0  1  0 -1  0  0  0  0  1  0 -1] (Indices: [2, 4, 8, 11, 12, 18, 19]), Candidate: [2 2 0 1 0 1 1 1 0 1 1 1 0 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 52550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1 -1  0  0  1  0 -1  0  0  0  1  0 -1] (Indices: [2, 4, 8, 12, 13, 18, 19]), Candidate: [2 2 0 1 0 1 1 1 0 1 0 2 1 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 52600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1 -1  0  0  0  0  1 -1  0  1  0  0 -1] (Indices: [2, 4, 8, 14, 17, 18, 19]), Candidate: [ 2  2  0  1  0  1  1  1  0  1  0  1  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  1  0 -1  1 -1  0  0  1 -1  1 -1  0] (Indices: [2, 4, 9, 10, 12, 16, 18]), Candidate: [ 2  2  0  1  0  1  1  0  2  1 -1  2  0  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  1 -1  1  0 -1  1 -1  0  0  0  1 -1] (Indices: [2, 4, 9, 11, 12, 14, 19]), Candidate: [ 2  2  0  1  0  1  1  0  2  0  1  1  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  1 -1  0  1  0  0 -1  0  0  0  1 -1] (Indices: [2, 4, 9, 12, 13, 14, 19]), Candidate: [ 2  2  0  1  0  1  1  0  2  0  0  2  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  1 -1  0  0  1 -1  0  0  1  0  0 -1] (Indices: [2, 4, 9, 13, 17, 18, 19]), Candidate: [2 2 0 1 0 1 1 0 2 0 0 1 2 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 52850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  0  1  0 -1  1 -1  0  0  1 -1  1 -1] (Indices: [2, 4, 10, 11, 13, 17, 19]), Candidate: [2 2 0 1 0 1 1 0 1 2 0 0 2 0 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 52900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  0  1 -1  1 -1  0  1 -1  1  0 -1  0] (Indices: [2, 4, 10, 12, 15, 17, 18]), Candidate: [ 2  2  0  1  0  1  1  0  1  2 -1  2  0  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  0  0  1  0  0 -1  1 -1  0  0  1 -1] (Indices: [2, 4, 11, 12, 13, 15, 19]), Candidate: [2 2 0 1 0 1 1 0 1 1 1 1 1 0 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 53000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  0  0  1 -1  0  1  0 -1  1  0 -1  0] (Indices: [2, 4, 11, 14, 15, 17, 18]), Candidate: [2 2 0 1 0 1 1 0 1 1 1 0 1 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 53050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  0  0  0  0  1  0  0 -1  1  0 -1  0] (Indices: [2, 4, 13, 14, 15, 17, 18]), Candidate: [2 2 0 1 0 1 1 0 1 1 0 1 2 1 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 53100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0 -1  0  0  1 -1  0  0  0  0  1 -1  0] (Indices: [2, 5, 6, 7, 8, 12, 18]), Candidate: [2 2 0 0 2 1 1 0 0 1 0 2 0 1 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 53150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  1 -1  0  0  1 -1  0  0  1 -1  0  0] (Indices: [2, 5, 6, 7, 9, 13, 17]), Candidate: [ 2  2  0  0  2  1  1 -1  2  0  0  1  2  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  0  1 -1  0  0  0  0  1 -1  0  1 -1] (Indices: [2, 5, 6, 7, 10, 16, 19]), Candidate: [ 2  2  0  0  2  1  1 -1  1  2 -1  1  1  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 53250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  0  0  0  1 -1  0  0  0  1  0 -1  0] (Indices: [2, 5, 6, 7, 12, 17, 18]), Candidate: [ 2  2  0  0  2  1  1 -1  1  1  0  2  0  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1  0 -1  1 -1  0  0  1 -1  0  0  0  0] (Indices: [2, 5, 6, 8, 9, 11, 15]), Candidate: [2 2 0 0 2 1 0 1 1 0 1 0 1 1 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 53350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1 -1  1 -1  0  1 -1  0  1 -1  0  0  0] (Indices: [2, 5, 6, 8, 10, 13, 16]), Candidate: [ 2  2  0  0  2  1  0  1  0  2 -1  1  2  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1 -1  0  0  1  0 -1  0  0  1 -1  0  0] (Indices: [2, 5, 6, 8, 12, 13, 17]), Candidate: [2 2 0 0 2 1 0 1 0 1 0 2 1 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 53450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1 -1  0  0  0  0  0  0  1  0 -1  1 -1] (Indices: [2, 5, 6, 8, 16, 17, 19]), Candidate: [2 2 0 0 2 1 0 1 0 1 0 1 1 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 53500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  1 -1  1 -1  1 -1  0  0  0  1 -1  0] (Indices: [2, 5, 6, 9, 11, 13, 18]), Candidate: [2 2 0 0 2 1 0 0 2 0 1 0 2 0 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 53550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  1 -1  0  0  1 -1  0  0  1  0 -1  0] (Indices: [2, 5, 6, 9, 13, 17, 18]), Candidate: [2 2 0 0 2 1 0 0 2 0 0 1 2 0 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 53600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  0  1  0 -1  0  0  0  0  0  1  0 -1] (Indices: [2, 5, 6, 10, 11, 18, 19]), Candidate: [2 2 0 0 2 1 0 0 1 2 0 0 1 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 53650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  0  1 -1  0  0  0  1 -1  1  0 -1  0] (Indices: [2, 5, 6, 10, 15, 17, 18]), Candidate: [ 2  2  0  0  2  1  0  0  1  2 -1  1  1  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  0  0  1 -1  0  1 -1  0  1  0 -1  0] (Indices: [2, 5, 6, 11, 14, 17, 18]), Candidate: [ 2  2  0  0  2  1  0  0  1  1  1  0  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  0  0  0  0  1  0  0 -1  0  1 -1  0] (Indices: [2, 5, 6, 13, 14, 15, 18]), Candidate: [2 2 0 0 2 1 0 0 1 1 0 1 2 1 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 53800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0  0 -1  0  1  0 -1  0  0  0  0  0  0] (Indices: [2, 5, 7, 8, 9, 12, 13]), Candidate: [2 2 0 0 2 0 2 0 1 0 0 2 1 0 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 53850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0 -1  1 -1  0  0  1 -1  1 -1  0  0  0] (Indices: [2, 5, 7, 8, 10, 14, 16]), Candidate: [ 2  2  0  0  2  0  2  0  0  2 -1  1  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 53900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0 -1  0  0  1 -1  1 -1  0  1 -1  0  0] (Indices: [2, 5, 7, 8, 12, 14, 17]), Candidate: [ 2  2  0  0  2  0  2  0  0  1  0  2  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  1  0  0 -1  0  1 -1  0  0  0  0  0] (Indices: [2, 5, 7, 9, 10, 11, 14]), Candidate: [ 2  2  0  0  2  0  2 -1  2  1  0  0  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 54000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  1 -1  1 -1  0  1 -1  0  0  1 -1  0] (Indices: [2, 5, 7, 9, 11, 14, 18]), Candidate: [ 2  2  0  0  2  0  2 -1  2  0  1  0  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 54050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  1 -1  0  0  0  1  0 -1  0  1 -1  0] (Indices: [2, 5, 7, 9, 14, 15, 18]), Candidate: [ 2  2  0  0  2  0  2 -1  2  0  0  1  1  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  0  1 -1  1  0 -1  0  0  0  1 -1  0] (Indices: [2, 5, 7, 10, 12, 13, 18]), Candidate: [ 2  2  0  0  2  0  2 -1  1  2 -1  2  1  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 54150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  0  1 -1  0  0  0  0  1 -1  1  0 -1] (Indices: [2, 5, 7, 10, 16, 18, 19]), Candidate: [ 2  2  0  0  2  0  2 -1  1  2 -1  1  1  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 54200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  0  0  1 -1  0  0  1  0 -1  0  1 -1] (Indices: [2, 5, 7, 11, 15, 16, 19]), Candidate: [ 2  2  0  0  2  0  2 -1  1  1  1  0  1  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  0  0  0  0  1  0 -1  0  1  0 -1  0] (Indices: [2, 5, 7, 13, 14, 17, 18]), Candidate: [ 2  2  0  0  2  0  2 -1  1  1  0  1  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 54300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1  0  0 -1  0  0  1 -1  1 -1  0  0  0] (Indices: [2, 5, 8, 9, 10, 14, 16]), Candidate: [ 2  2  0  0  2  0  1  1  1  1 -1  1  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 54350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1  0 -1  0  1 -1  1 -1  0  1 -1  0  0] (Indices: [2, 5, 8, 9, 12, 14, 17]), Candidate: [ 2  2  0  0  2  0  1  1  1  0  0  2  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1 -1  1  0  0 -1  0  1 -1  0  0  0  0] (Indices: [2, 5, 8, 10, 11, 12, 15]), Candidate: [2 2 0 0 2 0 1 1 0 2 0 1 0 1 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 54450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1 -1  1 -1  0  1  0 -1  0  0  1 -1  0] (Indices: [2, 5, 8, 10, 13, 14, 18]), Candidate: [ 2  2  0  0  2  0  1  1  0  2 -1  1  2  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 54500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1 -1  0  1  0 -1  0  0  0  1  0 -1  0] (Indices: [2, 5, 8, 11, 12, 17, 18]), Candidate: [2 2 0 0 2 0 1 1 0 1 1 1 0 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 54550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1 -1  0  0  1  0 -1  0  0  1  0 -1  0] (Indices: [2, 5, 8, 12, 13, 17, 18]), Candidate: [2 2 0 0 2 0 1 1 0 1 0 2 1 0 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 54600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1 -1  0  0  0  0  1 -1  1  0 -1  1 -1] (Indices: [2, 5, 8, 14, 16, 17, 19]), Candidate: [ 2  2  0  0  2  0  1  1  0  1  0  1  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  1  0 -1  1 -1  0  1 -1  0  0  1 -1] (Indices: [2, 5, 9, 10, 12, 15, 19]), Candidate: [ 2  2  0  0  2  0  1  0  2  1 -1  2  0  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  1 -1  1  0 -1  1 -1  0  1 -1  0  0] (Indices: [2, 5, 9, 11, 12, 14, 17]), Candidate: [ 2  2  0  0  2  0  1  0  2  0  1  1  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  1 -1  0  1  0  0 -1  0  1 -1  0  0] (Indices: [2, 5, 9, 12, 13, 14, 17]), Candidate: [ 2  2  0  0  2  0  1  0  2  0  0  2  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  1 -1  0  0  1 -1  0  1  0 -1  1 -1] (Indices: [2, 5, 9, 13, 16, 17, 19]), Candidate: [2 2 0 0 2 0 1 0 2 0 0 1 2 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 54850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  0  1  0 -1  1 -1  0  1 -1  0  1 -1] (Indices: [2, 5, 10, 11, 13, 16, 19]), Candidate: [2 2 0 0 2 0 1 0 1 2 0 0 2 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 54900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  0  1 -1  1 -1  0  1  0 -1  1 -1  0] (Indices: [2, 5, 10, 12, 15, 16, 18]), Candidate: [ 2  2  0  0  2  0  1  0  1  2 -1  2  0  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  0  0  1  0  0 -1  1 -1  1 -1  0  0] (Indices: [2, 5, 11, 12, 13, 15, 17]), Candidate: [2 2 0 0 2 0 1 0 1 1 1 1 1 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 55000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  0  0  1 -1  0  1  0  0 -1  1 -1  0] (Indices: [2, 5, 11, 14, 15, 16, 18]), Candidate: [2 2 0 0 2 0 1 0 1 1 1 0 1 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 55050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  0  0  0  0  1  0  0  0 -1  1 -1  0] (Indices: [2, 5, 13, 14, 15, 16, 18]), Candidate: [2 2 0 0 2 0 1 0 1 1 0 1 2 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 55100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0  0 -1  0  0  0  1  0 -1  0  0  0  0] (Indices: [2, 6, 7, 8, 9, 14, 15]), Candidate: [2 2 0 0 1 2 1 0 1 0 0 1 1 2 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 55150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0 -1  1 -1  0  0  0  0  0  0  1  0 -1] (Indices: [2, 6, 7, 8, 10, 18, 19]), Candidate: [ 2  2  0  0  1  2  1  0  0  2 -1  1  1  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0 -1  0  0  0  1  0  0 -1  0  0  0  0] (Indices: [2, 6, 7, 8, 13, 14, 15]), Candidate: [2 2 0 0 1 2 1 0 0 1 0 1 2 1 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 55250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  1  0 -1  0  1  0 -1  0  0  0  0  0] (Indices: [2, 6, 7, 9, 10, 13, 14]), Candidate: [ 2  2  0  0  1  2  1 -1  2  1 -1  1  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 55300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  1 -1  0  1  0 -1  1 -1  0  0  0  0] (Indices: [2, 6, 7, 9, 12, 13, 15]), Candidate: [ 2  2  0  0  1  2  1 -1  2  0  0  2  1  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  1 -1  0  0  0  0  1 -1  0  1  0 -1] (Indices: [2, 6, 7, 9, 15, 18, 19]), Candidate: [ 2  2  0  0  1  2  1 -1  2  0  0  1  1  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  0  1 -1  1 -1  0  0  1 -1  0  1 -1] (Indices: [2, 6, 7, 10, 12, 16, 19]), Candidate: [ 2  2  0  0  1  2  1 -1  1  2 -1  2  0  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  0  0  1  0 -1  0  1  0 -1  0  0  0] (Indices: [2, 6, 7, 11, 12, 15, 16]), Candidate: [ 2  2  0  0  1  2  1 -1  1  1  1  1  0  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  0  0  0  1  0 -1  1  0 -1  0  0  0] (Indices: [2, 6, 7, 12, 13, 15, 16]), Candidate: [ 2  2  0  0  1  2  1 -1  1  1  0  2  1  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  0  0  0  0  0  1  0  0  0 -1  0  0] (Indices: [2, 6, 7, 14, 15, 16, 17]), Candidate: [ 2  2  0  0  1  2  1 -1  1  1  0  1  1  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1  0  0 -1  0  0  0  0  0  0  1  0 -1] (Indices: [2, 6, 8, 9, 10, 18, 19]), Candidate: [ 2  2  0  0  1  2  0  1  1  1 -1  1  1  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1  0 -1  0  0  1  0  0 -1  0  0  0  0] (Indices: [2, 6, 8, 9, 13, 14, 15]), Candidate: [2 2 0 0 1 2 0 1 1 0 0 1 2 1 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 55700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1 -1  1  0 -1  0  1 -1  0  1 -1  0  0] (Indices: [2, 6, 8, 10, 11, 14, 17]), Candidate: [ 2  2  0  0  1  2  0  1  0  2  0  0  1  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1 -1  1 -1  0  0  1  0 -1  1 -1  0  0] (Indices: [2, 6, 8, 10, 14, 15, 17]), Candidate: [ 2  2  0  0  1  2  0  1  0  2 -1  1  1  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1 -1  0  1 -1  1 -1  0  1 -1  1 -1  0] (Indices: [2, 6, 8, 11, 13, 16, 18]), Candidate: [2 2 0 0 1 2 0 1 0 1 1 0 2 0 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 55850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1 -1  0  0  1 -1  0  1  0  0 -1  0  0] (Indices: [2, 6, 8, 12, 15, 16, 17]), Candidate: [2 2 0 0 1 2 0 1 0 1 0 2 0 1 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 55900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  1  0  0  0 -1  0  0  0  0  1 -1  0] (Indices: [2, 6, 9, 10, 11, 12, 18]), Candidate: [2 2 0 0 1 2 0 0 2 1 0 1 0 1 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 55950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  1  0 -1  0  1 -1  1 -1  1 -1  0  0] (Indices: [2, 6, 9, 10, 13, 15, 17]), Candidate: [ 2  2  0  0  1  2  0  0  2  1 -1  1  2  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  1 -1  1 -1  1  0  0 -1  0  0  0  0] (Indices: [2, 6, 9, 11, 13, 14, 15]), Candidate: [2 2 0 0 1 2 0 0 2 0 1 0 2 1 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 56050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  1 -1  0  1 -1  1  0  0 -1  0  0  0] (Indices: [2, 6, 9, 12, 14, 15, 16]), Candidate: [2 2 0 0 1 2 0 0 2 0 0 2 0 2 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 56100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  1 -1  0  0  0  0  1  0  0  0 -1  0] (Indices: [2, 6, 9, 15, 16, 17, 18]), Candidate: [2 2 0 0 1 2 0 0 2 0 0 1 1 1 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 56150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  0  1  0 -1  0  1 -1  0  0  1  0 -1] (Indices: [2, 6, 10, 11, 14, 18, 19]), Candidate: [ 2  2  0  0  1  2  0  0  1  2  0  0  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  0  1 -1  0  1  0 -1  1  0 -1  0  0] (Indices: [2, 6, 10, 13, 14, 16, 17]), Candidate: [ 2  2  0  0  1  2  0  0  1  2 -1  1  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  0  0  1  0 -1  1 -1  1  0 -1  0  0] (Indices: [2, 6, 11, 12, 14, 16, 17]), Candidate: [ 2  2  0  0  1  2  0  0  1  1  1  1  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  0  0  1 -1  0  0  0  1  0  0  0 -1] (Indices: [2, 6, 11, 16, 17, 18, 19]), Candidate: [2 2 0 0 1 2 0 0 1 1 1 0 1 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 56350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  0  0  0  0  1 -1  0  1  0  0  0 -1] (Indices: [2, 6, 13, 16, 17, 18, 19]), Candidate: [2 2 0 0 1 2 0 0 1 1 0 1 2 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 56400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0  0 -1  1 -1  1  0 -1  0  0  0  0  0] (Indices: [2, 7, 8, 9, 11, 13, 14]), Candidate: [ 2  2  0  0  1  1  2  0  1  0  1  0  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0  0 -1  0  0  1 -1  1 -1  0  0  1 -1] (Indices: [2, 7, 8, 9, 13, 15, 19]), Candidate: [2 2 0 0 1 1 2 0 1 0 0 1 2 0 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 56500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0 -1  1  0 -1  0  0  0  1 -1  1 -1  0] (Indices: [2, 7, 8, 10, 11, 16, 18]), Candidate: [2 2 0 0 1 1 2 0 0 2 0 0 1 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 56550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0 -1  1 -1  0  0  1 -1  0  0  1  0 -1] (Indices: [2, 7, 8, 10, 14, 18, 19]), Candidate: [ 2  2  0  0  1  1  2  0  0  2 -1  1  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0 -1  0  1 -1  0  1  0 -1  0  0  1 -1] (Indices: [2, 7, 8, 11, 14, 15, 19]), Candidate: [2 2 0 0 1 1 2 0 0 1 1 0 1 2 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 56650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0 -1  0  0  1 -1  0  0  1 -1  1  0 -1] (Indices: [2, 7, 8, 12, 16, 18, 19]), Candidate: [2 2 0 0 1 1 2 0 0 1 0 2 0 1 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 56700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  1  0  0 -1  0  1  0 -1  0  0  0  0] (Indices: [2, 7, 9, 10, 11, 14, 15]), Candidate: [ 2  2  0  0  1  1  2 -1  2  1  0  0  1  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  1  0 -1  0  1 -1  0  0  0  1  0 -1] (Indices: [2, 7, 9, 10, 13, 18, 19]), Candidate: [ 2  2  0  0  1  1  2 -1  2  1 -1  1  2  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  1 -1  1 -1  1 -1  1 -1  0  0  1 -1] (Indices: [2, 7, 9, 11, 13, 15, 19]), Candidate: [ 2  2  0  0  1  1  2 -1  2  0  1  0  2  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  1 -1  0  1 -1  1 -1  0  1 -1  1 -1] (Indices: [2, 7, 9, 12, 14, 17, 19]), Candidate: [ 2  2  0  0  1  1  2 -1  2  0  0  2  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  0  1  0  0  0 -1  0  0  1 -1  0  0] (Indices: [2, 7, 10, 11, 12, 13, 17]), Candidate: [ 2  2  0  0  1  1  2 -1  1  2  0  1  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  0  1  0 -1  0  0  0  1  0 -1  1 -1] (Indices: [2, 7, 10, 11, 16, 17, 19]), Candidate: [ 2  2  0  0  1  1  2 -1  1  2  0  0  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  0  1 -1  0  1 -1  1  0 -1  0  1 -1] (Indices: [2, 7, 10, 13, 15, 16, 19]), Candidate: [ 2  2  0  0  1  1  2 -1  1  2 -1  1  2  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  0  0  1  0 -1  0  1  0 -1  0  1 -1] (Indices: [2, 7, 11, 12, 15, 16, 19]), Candidate: [ 2  2  0  0  1  1  2 -1  1  1  1  1  0  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  0  0  0  1  0  0 -1  0  1  0 -1  0] (Indices: [2, 7, 12, 13, 14, 17, 18]), Candidate: [ 2  2  0  0  1  1  2 -1  1  1  0  2  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1  0  0  0  0 -1  1 -1  0  0  0  0  0] (Indices: [2, 8, 9, 10, 11, 12, 14]), Candidate: [ 2  2  0  0  1  1  1  1  1  1  0  1  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1  0  0 -1  0  1  0 -1  0  1 -1  0  0] (Indices: [2, 8, 9, 10, 13, 14, 17]), Candidate: [ 2  2  0  0  1  1  1  1  1  1 -1  1  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1  0 -1  1  0 -1  0  0  1 -1  0  1 -1] (Indices: [2, 8, 9, 11, 12, 16, 19]), Candidate: [2 2 0 0 1 1 1 1 1 0 1 1 0 1 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 57300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1  0 -1  0  1  0 -1  0  1 -1  0  1 -1] (Indices: [2, 8, 9, 12, 13, 16, 19]), Candidate: [2 2 0 0 1 1 1 1 1 0 0 2 1 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 57350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1  0 -1  0  0  0  1 -1  1  0  0 -1  0] (Indices: [2, 8, 9, 14, 16, 17, 18]), Candidate: [ 2  2  0  0  1  1  1  1  1  0  0  1  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1 -1  1  0 -1  0  1 -1  1 -1  1 -1  0] (Indices: [2, 8, 10, 11, 14, 16, 18]), Candidate: [ 2  2  0  0  1  1  1  1  0  2  0  0  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1 -1  1 -1  0  1  0  0  0 -1  0  0  0] (Indices: [2, 8, 10, 13, 14, 15, 16]), Candidate: [ 2  2  0  0  1  1  1  1  0  2 -1  1  2  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1 -1  0  1  0 -1  1  0  0 -1  0  0  0] (Indices: [2, 8, 11, 12, 14, 15, 16]), Candidate: [2 2 0 0 1 1 1 1 0 1 1 1 0 2 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 57550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1 -1  0  1 -1  0  0  1  0  0  0 -1  0] (Indices: [2, 8, 11, 15, 16, 17, 18]), Candidate: [2 2 0 0 1 1 1 1 0 1 1 0 1 1 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 57600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1 -1  0  0  0  1 -1  1  0  0  0 -1  0] (Indices: [2, 8, 13, 15, 16, 17, 18]), Candidate: [2 2 0 0 1 1 1 1 0 1 0 1 2 0 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 57650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  1  0  0 -1  0  1  0 -1  0  0  1 -1] (Indices: [2, 9, 10, 11, 14, 15, 19]), Candidate: [2 2 0 0 1 1 1 0 2 1 0 0 1 2 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 57700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  1  0 -1  1 -1  0  0  1 -1  1  0 -1] (Indices: [2, 9, 10, 12, 16, 18, 19]), Candidate: [ 2  2  0  0  1  1  1  0  2  1 -1  2  0  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  1 -1  1  0  0 -1  0  0  1 -1  1 -1] (Indices: [2, 9, 11, 12, 13, 17, 19]), Candidate: [2 2 0 0 1 1 1 0 2 0 1 1 1 0 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 57800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  1 -1  1 -1  0  1 -1  1 -1  1  0 -1] (Indices: [2, 9, 11, 14, 16, 18, 19]), Candidate: [ 2  2  0  0  1  1  1  0  2  0  1  0  1  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  1 -1  0  0  1  0 -1  1 -1  1  0 -1] (Indices: [2, 9, 13, 14, 16, 18, 19]), Candidate: [ 2  2  0  0  1  1  1  0  2  0  0  1  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  0  1  0 -1  1  0  0 -1  0  1 -1  0] (Indices: [2, 10, 11, 13, 14, 15, 18]), Candidate: [2 2 0 0 1 1 1 0 1 2 0 0 2 1 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 57950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  0  1 -1  1  0 -1  0  1  0 -1  1 -1] (Indices: [2, 10, 12, 13, 16, 17, 19]), Candidate: [ 2  2  0  0  1  1  1  0  1  2 -1  2  1  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  0  0  1  0  0 -1  1  0 -1  1 -1  0] (Indices: [2, 11, 12, 13, 15, 16, 18]), Candidate: [2 2 0 0 1 1 1 0 1 1 1 1 1 0 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 58050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  0  0  0  1  0  0  0 -1  0  1  0 -1] (Indices: [2, 12, 13, 14, 15, 18, 19]), Candidate: [2 2 0 0 1 1 1 0 1 1 0 2 1 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 58100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  0  1 -1  0  0  0  0  0  1 -1  0  0] (Indices: [3, 4, 5, 6, 7, 10, 17]), Candidate: [ 2  1  2  0  1  1  1 -1  1  2 -1  1  1  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1 -1  1 -1  1 -1  0  0  0  0  0  0  0] (Indices: [3, 4, 5, 6, 8, 10, 12]), Candidate: [ 2  1  2  0  1  1  0  1  0  2 -1  2  0  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  1  0 -1  0  0  0  0  0  1 -1  0  0] (Indices: [3, 4, 5, 6, 9, 10, 17]), Candidate: [ 2  1  2  0  1  1  0  0  2  1 -1  1  1  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  0  1 -1  1 -1  0  0  1 -1  0  0  0] (Indices: [3, 4, 5, 6, 10, 12, 16]), Candidate: [ 2  1  2  0  1  1  0  0  1  2 -1  2  0  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  0  0  1 -1  0  0  0  0  1  0 -1  0] (Indices: [3, 4, 5, 6, 11, 17, 18]), Candidate: [2 1 2 0 1 1 0 0 1 1 1 0 1 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 58350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  0  0  0  0  0  0  1  0 -1  1 -1  0] (Indices: [3, 4, 5, 6, 15, 16, 18]), Candidate: [2 1 2 0 1 1 0 0 1 1 0 1 1 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 58400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0 -1  0  0  0  0  1 -1  1 -1  0  0  0] (Indices: [3, 4, 5, 7, 8, 14, 16]), Candidate: [ 2  1  2  0  1  0  2  0  0  1  0  1  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  1 -1  0  0  0  0  1 -1  1 -1  0  0] (Indices: [3, 4, 5, 7, 9, 15, 17]), Candidate: [ 2  1  2  0  1  0  2 -1  2  0  0  1  1  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  0  0  1  0 -1  0  0  0  0  1 -1  0] (Indices: [3, 4, 5, 7, 11, 12, 18]), Candidate: [ 2  1  2  0  1  0  2 -1  1  1  1  1  0  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  0  0  0  0  1 -1  1 -1  1 -1  0  0] (Indices: [3, 4, 5, 7, 13, 15, 17]), Candidate: [ 2  1  2  0  1  0  2 -1  1  1  0  1  2  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1  0 -1  0  1 -1  0  0  0  1 -1  0  0] (Indices: [3, 4, 5, 8, 9, 12, 17]), Candidate: [2 1 2 0 1 0 1 1 1 0 0 2 0 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 58650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1 -1  1 -1  0  0  0  1  0 -1  0  0  0] (Indices: [3, 4, 5, 8, 10, 15, 16]), Candidate: [ 2  1  2  0  1  0  1  1  0  2 -1  1  1  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1 -1  0  0  1 -1  0  1 -1  1 -1  0  0] (Indices: [3, 4, 5, 8, 12, 15, 17]), Candidate: [2 1 2 0 1 0 1 1 0 1 0 2 0 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 58750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  1  0  0 -1  0  0  0  0  0  1 -1  0] (Indices: [3, 4, 5, 9, 10, 11, 18]), Candidate: [2 1 2 0 1 0 1 0 2 1 0 0 1 1 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 58800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  1 -1  1 -1  0  0  1 -1  0  1 -1  0] (Indices: [3, 4, 5, 9, 11, 15, 18]), Candidate: [2 1 2 0 1 0 1 0 2 0 1 0 1 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 58850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  1 -1  0  0  0  1 -1  1 -1  0  1 -1] (Indices: [3, 4, 5, 9, 14, 16, 19]), Candidate: [ 2  1  2  0  1  0  1  0  2  0  0  1  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  0  1 -1  1 -1  1 -1  0  1 -1  0  0] (Indices: [3, 4, 5, 10, 12, 14, 17]), Candidate: [ 2  1  2  0  1  0  1  0  1  2 -1  2  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  0  0  1  0  0 -1  0  1 -1  0  0  0] (Indices: [3, 4, 5, 11, 12, 13, 16]), Candidate: [2 1 2 0 1 0 1 0 1 1 1 1 1 0 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 59000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  0  0  1 -1  0  0  0  1  0  0 -1  0] (Indices: [3, 4, 5, 11, 16, 17, 18]), Candidate: [2 1 2 0 1 0 1 0 1 1 1 0 1 1 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 59050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  0  0  0  0  1 -1  1  0 -1  1 -1  0] (Indices: [3, 4, 5, 13, 15, 16, 18]), Candidate: [2 1 2 0 1 0 1 0 1 1 0 1 2 0 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 59100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0 -1  0  1 -1  0  0  0  0  0  0  1 -1] (Indices: [3, 4, 6, 7, 8, 11, 19]), Candidate: [2 1 2 0 0 2 1 0 0 1 1 0 1 1 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 59150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  1 -1  0  1 -1  0  0  0  1 -1  0  0] (Indices: [3, 4, 6, 7, 9, 12, 17]), Candidate: [ 2  1  2  0  0  2  1 -1  2  0  0  2  0  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  0  1 -1  0  0  0  1  0 -1  0  0  0] (Indices: [3, 4, 6, 7, 10, 15, 16]), Candidate: [ 2  1  2  0  0  2  1 -1  1  2 -1  1  1  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 59250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  0  0  0  1 -1  0  1 -1  1 -1  0  0] (Indices: [3, 4, 6, 7, 12, 15, 17]), Candidate: [ 2  1  2  0  0  2  1 -1  1  1  0  2  0  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1  0  0 -1  0  0  0  0  0  1 -1  0  0] (Indices: [3, 4, 6, 8, 9, 10, 17]), Candidate: [ 2  1  2  0  0  2  0  1  1  1 -1  1  1  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1 -1  1 -1  1 -1  0  0  1 -1  0  0  0] (Indices: [3, 4, 6, 8, 10, 12, 16]), Candidate: [ 2  1  2  0  0  2  0  1  0  2 -1  2  0  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1 -1  0  1 -1  0  0  0  0  1  0 -1  0] (Indices: [3, 4, 6, 8, 11, 17, 18]), Candidate: [2 1 2 0 0 2 0 1 0 1 1 0 1 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 59450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1 -1  0  0  0  0  0  1  0 -1  1 -1  0] (Indices: [3, 4, 6, 8, 15, 16, 18]), Candidate: [2 1 2 0 0 2 0 1 0 1 0 1 1 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 59500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  1 -1  1  0 -1  0  0  0  0  1 -1  0] (Indices: [3, 4, 6, 9, 11, 12, 18]), Candidate: [2 1 2 0 0 2 0 0 2 0 1 1 0 1 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 59550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  1 -1  0  0  1 -1  1 -1  1 -1  0  0] (Indices: [3, 4, 6, 9, 13, 15, 17]), Candidate: [2 1 2 0 0 2 0 0 2 0 0 1 2 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 59600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  0  1  0 -1  0  0  1 -1  0  0  1 -1] (Indices: [3, 4, 6, 10, 11, 15, 19]), Candidate: [2 1 2 0 0 2 0 0 1 2 0 0 1 1 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 59650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  0  1 -1  0  0  1 -1  0  1  0 -1  0] (Indices: [3, 4, 6, 10, 14, 17, 18]), Candidate: [ 2  1  2  0  0  2  0  0  1  2 -1  1  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 59700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  0  0  1 -1  0  1  0 -1  1 -1  0  0] (Indices: [3, 4, 6, 11, 14, 15, 17]), Candidate: [2 1 2 0 0 2 0 0 1 1 1 0 1 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 59750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  0  0  0  1 -1  0  0  1  0  0 -1  0] (Indices: [3, 4, 6, 12, 16, 17, 18]), Candidate: [2 1 2 0 0 2 0 0 1 1 0 2 0 1 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 59800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0  0 -1  1 -1  0  1 -1  0  0  0  0  0] (Indices: [3, 4, 7, 8, 9, 11, 14]), Candidate: [ 2  1  2  0  0  1  2  0  1  0  1  0  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0 -1  1 -1  0  1 -1  1 -1  0  0  0  0] (Indices: [3, 4, 7, 8, 10, 13, 15]), Candidate: [ 2  1  2  0  0  1  2  0  0  2 -1  1  2  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0 -1  0  0  1  0 -1  0  1 -1  0  0  0] (Indices: [3, 4, 7, 8, 12, 13, 16]), Candidate: [2 1 2 0 0 1 2 0 0 1 0 2 1 0 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 59950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0 -1  0  0  0  0  0  0  1  0  0 -1  0] (Indices: [3, 4, 7, 8, 16, 17, 18]), Candidate: [2 1 2 0 0 1 2 0 0 1 0 1 1 1 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 60000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  1 -1  1 -1  1 -1  0  0  1 -1  0  0] (Indices: [3, 4, 7, 9, 11, 13, 17]), Candidate: [ 2  1  2  0  0  1  2 -1  2  0  1  0  2  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  1 -1  0  0  1 -1  0  1 -1  0  1 -1] (Indices: [3, 4, 7, 9, 13, 16, 19]), Candidate: [ 2  1  2  0  0  1  2 -1  2  0  0  1  2  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  0  1  0 -1  0  0  0  0  1 -1  1 -1] (Indices: [3, 4, 7, 10, 11, 17, 19]), Candidate: [ 2  1  2  0  0  1  2 -1  1  2  0  0  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  0  1 -1  0  0  0  1  0 -1  0  1 -1] (Indices: [3, 4, 7, 10, 15, 16, 19]), Candidate: [ 2  1  2  0  0  1  2 -1  1  2 -1  1  1  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 60200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  0  0  1 -1  0  1 -1  1 -1  0  1 -1] (Indices: [3, 4, 7, 11, 14, 16, 19]), Candidate: [ 2  1  2  0  0  1  2 -1  1  1  1  0  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 60250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  0  0  0  0  1  0  0 -1  1 -1  0  0] (Indices: [3, 4, 7, 13, 14, 15, 17]), Candidate: [ 2  1  2  0  0  1  2 -1  1  1  0  1  2  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1  0  0 -1  0  1 -1  1 -1  0  0  0  0] (Indices: [3, 4, 8, 9, 10, 13, 15]), Candidate: [ 2  1  2  0  0  1  1  1  1  1 -1  1  2  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1  0 -1  0  1  0 -1  0  1 -1  0  0  0] (Indices: [3, 4, 8, 9, 12, 13, 16]), Candidate: [2 1 2 0 0 1 1 1 1 0 0 2 1 0 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 60400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1  0 -1  0  0  0  0  0  1  0  0 -1  0] (Indices: [3, 4, 8, 9, 16, 17, 18]), Candidate: [2 1 2 0 0 1 1 1 1 0 0 1 1 1 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 60450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1 -1  1 -1  1 -1  0  0  0  1  0 -1  0] (Indices: [3, 4, 8, 10, 12, 17, 18]), Candidate: [ 2  1  2  0  0  1  1  1  0  2 -1  2  0  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1 -1  0  1  0 -1  0  1 -1  1 -1  0  0] (Indices: [3, 4, 8, 11, 12, 15, 17]), Candidate: [2 1 2 0 0 1 1 1 0 1 1 1 0 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 60550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1 -1  0  0  1  0 -1  1 -1  1 -1  0  0] (Indices: [3, 4, 8, 12, 13, 15, 17]), Candidate: [2 1 2 0 0 1 1 1 0 1 0 2 1 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 60600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1 -1  0  0  0  0  1  0  0 -1  1 -1  0] (Indices: [3, 4, 8, 14, 15, 16, 18]), Candidate: [2 1 2 0 0 1 1 1 0 1 0 1 1 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 60650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  1  0 -1  1 -1  1 -1  0  1 -1  0  0] (Indices: [3, 4, 9, 10, 12, 14, 17]), Candidate: [ 2  1  2  0  0  1  1  0  2  1 -1  2  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 60700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  1 -1  1  0  0 -1  0  1 -1  0  0  0] (Indices: [3, 4, 9, 11, 12, 13, 16]), Candidate: [2 1 2 0 0 1 1 0 2 0 1 1 1 0 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 60750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  1 -1  1 -1  0  0  0  1  0  0 -1  0] (Indices: [3, 4, 9, 11, 16, 17, 18]), Candidate: [2 1 2 0 0 1 1 0 2 0 1 0 1 1 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 60800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  1 -1  0  0  1 -1  1  0 -1  1 -1  0] (Indices: [3, 4, 9, 13, 15, 16, 18]), Candidate: [2 1 2 0 0 1 1 0 2 0 0 1 2 0 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 60850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  0  1  0 -1  1 -1  1  0 -1  0  0  0] (Indices: [3, 4, 10, 11, 13, 15, 16]), Candidate: [2 1 2 0 0 1 1 0 1 2 0 0 2 0 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 60900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  0  1 -1  1 -1  1 -1  1 -1  1 -1  0] (Indices: [3, 4, 10, 12, 14, 16, 18]), Candidate: [ 2  1  2  0  0  1  1  0  1  2 -1  2  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 60950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  0  0  1  0  0  0  0 -1  0  0  0  0] (Indices: [3, 4, 11, 12, 13, 14, 15]), Candidate: [2 1 2 0 0 1 1 0 1 1 1 1 1 1 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 61000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  0  0  1 -1  1 -1  1 -1  0  1  0 -1] (Indices: [3, 4, 11, 13, 15, 18, 19]), Candidate: [2 1 2 0 0 1 1 0 1 1 1 0 2 0 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 61050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  0  0  0  1 -1  0  1  0  0  0 -1  0] (Indices: [3, 4, 12, 15, 16, 17, 18]), Candidate: [2 1 2 0 0 1 1 0 1 1 0 2 0 1 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 61100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0 -1  0  1 -1  0  0  0  0  1 -1  0  0] (Indices: [3, 5, 6, 7, 8, 11, 17]), Candidate: [ 2  1  2 -1  2  1  1  0  0  1  1  0  1  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  1 -1  0  1 -1  0  1 -1  0  0  0  0] (Indices: [3, 5, 6, 7, 9, 12, 15]), Candidate: [ 2  1  2 -1  2  1  1 -1  2  0  0  2  0  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 61200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  0  1 -1  0  0  1 -1  0  0  1 -1  0] (Indices: [3, 5, 6, 7, 10, 14, 18]), Candidate: [ 2  1  2 -1  2  1  1 -1  1  2 -1  1  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 61250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  0  0  0  1 -1  1 -1  0  0  0  1 -1] (Indices: [3, 5, 6, 7, 12, 14, 19]), Candidate: [ 2  1  2 -1  2  1  1 -1  1  1  0  2  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 61300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1  0  0 -1  0  0  0  1 -1  0  0  0  0] (Indices: [3, 5, 6, 8, 9, 10, 15]), Candidate: [ 2  1  2 -1  2  1  0  1  1  1 -1  1  1  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 61350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1 -1  1 -1  1 -1  1 -1  0  0  0  0  0] (Indices: [3, 5, 6, 8, 10, 12, 14]), Candidate: [ 2  1  2 -1  2  1  0  1  0  2 -1  2  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 61400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1 -1  0  1 -1  0  0  0  1 -1  1 -1  0] (Indices: [3, 5, 6, 8, 11, 16, 18]), Candidate: [ 2  1  2 -1  2  1  0  1  0  1  1  0  1  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1 -1  0  0  0  0  1 -1  0  0  1  0 -1] (Indices: [3, 5, 6, 8, 14, 18, 19]), Candidate: [ 2  1  2 -1  2  1  0  1  0  1  0  1  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 61500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  1 -1  1  0 -1  0  0  1 -1  0  0  0] (Indices: [3, 5, 6, 9, 11, 12, 16]), Candidate: [ 2  1  2 -1  2  1  0  0  2  0  1  1  0  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  1 -1  0  0  1  0 -1  0  0  0  1 -1] (Indices: [3, 5, 6, 9, 13, 14, 19]), Candidate: [ 2  1  2 -1  2  1  0  0  2  0  0  1  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 61600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  0  1  0 -1  0  0  1 -1  1 -1  0  0] (Indices: [3, 5, 6, 10, 11, 15, 17]), Candidate: [ 2  1  2 -1  2  1  0  0  1  2  0  0  1  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  0  1 -1  0  0  1 -1  1 -1  1 -1  0] (Indices: [3, 5, 6, 10, 14, 16, 18]), Candidate: [ 2  1  2 -1  2  1  0  0  1  2 -1  1  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 61700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  0  0  1 -1  1 -1  0  0  0  1  0 -1] (Indices: [3, 5, 6, 11, 13, 18, 19]), Candidate: [ 2  1  2 -1  2  1  0  0  1  1  1  0  2  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  0  0  0  1 -1  0  1 -1  1 -1  1 -1] (Indices: [3, 5, 6, 12, 15, 17, 19]), Candidate: [ 2  1  2 -1  2  1  0  0  1  1  0  2  0  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0  0 -1  1  0 -1  0  0  0  0  0  0  0] (Indices: [3, 5, 7, 8, 9, 11, 12]), Candidate: [ 2  1  2 -1  2  0  2  0  1  0  1  1  0  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0 -1  1 -1  1 -1  0  0  0  0  0  1 -1] (Indices: [3, 5, 7, 8, 10, 12, 19]), Candidate: [ 2  1  2 -1  2  0  2  0  0  2 -1  2  0  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 61900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0 -1  0  0  1  0  0 -1  0  0  0  0  0] (Indices: [3, 5, 7, 8, 12, 13, 14]), Candidate: [ 2  1  2 -1  2  0  2  0  0  1  0  2  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 61950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0 -1  0  0  0  0  0  1 -1  1 -1  1 -1] (Indices: [3, 5, 7, 8, 15, 17, 19]), Candidate: [ 2  1  2 -1  2  0  2  0  0  1  0  1  1  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  1 -1  1 -1  1 -1  1 -1  0  0  0  0] (Indices: [3, 5, 7, 9, 11, 13, 15]), Candidate: [ 2  1  2 -1  2  0  2 -1  2  0  1  0  2  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 62050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  1 -1  0  0  1 -1  0  1  0 -1  0  0] (Indices: [3, 5, 7, 9, 13, 16, 17]), Candidate: [ 2  1  2 -1  2  0  2 -1  2  0  0  1  2  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 62100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  0  1  0 -1  0  0  0  1 -1  0  1 -1] (Indices: [3, 5, 7, 10, 11, 16, 19]), Candidate: [ 2  1  2 -1  2  0  2 -1  1  2  0  0  1  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 62150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  0  1 -1  0  0  0  1  0  0 -1  0  0] (Indices: [3, 5, 7, 10, 15, 16, 17]), Candidate: [ 2  1  2 -1  2  0  2 -1  1  2 -1  1  1  1  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 62200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  0  0  1 -1  0  1 -1  1  0 -1  0  0] (Indices: [3, 5, 7, 11, 14, 16, 17]), Candidate: [ 2  1  2 -1  2  0  2 -1  1  1  1  0  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 62250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  0  0  0  1 -1  0  0  0  1  0  0 -1] (Indices: [3, 5, 7, 12, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  0  2 -1  1  1  0  2  0  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 62300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1  0  0 -1  1 -1  0  0  0  0  0  1 -1] (Indices: [3, 5, 8, 9, 10, 12, 19]), Candidate: [ 2  1  2 -1  2  0  1  1  1  1 -1  2  0  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 62350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1  0 -1  0  1  0  0 -1  0  0  0  0  0] (Indices: [3, 5, 8, 9, 12, 13, 14]), Candidate: [ 2  1  2 -1  2  0  1  1  1  0  0  2  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 62400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1  0 -1  0  0  0  0  1 -1  1 -1  1 -1] (Indices: [3, 5, 8, 9, 15, 17, 19]), Candidate: [ 2  1  2 -1  2  0  1  1  1  0  0  1  1  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1 -1  1 -1  1 -1  0  0  1 -1  1 -1  0] (Indices: [3, 5, 8, 10, 12, 16, 18]), Candidate: [ 2  1  2 -1  2  0  1  1  0  2 -1  2  0  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 62500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1 -1  0  1  0 -1  1 -1  0  0  0  1 -1] (Indices: [3, 5, 8, 11, 12, 14, 19]), Candidate: [ 2  1  2 -1  2  0  1  1  0  1  1  1  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 62550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1 -1  0  0  1  0  0 -1  0  0  0  1 -1] (Indices: [3, 5, 8, 12, 13, 14, 19]), Candidate: [ 2  1  2 -1  2  0  1  1  0  1  0  2  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 62600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1 -1  0  0  0  1 -1  0  0  1  0  0 -1] (Indices: [3, 5, 8, 13, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  0  1  1  0  1  0  1  2  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  1  0 -1  1 -1  1  0 -1  0  0  0  0] (Indices: [3, 5, 9, 10, 12, 14, 15]), Candidate: [ 2  1  2 -1  2  0  1  0  2  1 -1  2  0  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 62700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  1 -1  1  0  0  0 -1  0  0  0  0  0] (Indices: [3, 5, 9, 11, 12, 13, 14]), Candidate: [ 2  1  2 -1  2  0  1  0  2  0  1  1  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 62750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  1 -1  1 -1  0  0  1 -1  1 -1  1 -1] (Indices: [3, 5, 9, 11, 15, 17, 19]), Candidate: [ 2  1  2 -1  2  0  1  0  2  0  1  0  1  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  1 -1  0  0  1  0 -1  0  0  1  0 -1] (Indices: [3, 5, 9, 13, 14, 18, 19]), Candidate: [ 2  1  2 -1  2  0  1  0  2  0  0  1  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 62850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  0  1  0 -1  1  0 -1  0  0  1 -1  0] (Indices: [3, 5, 10, 11, 13, 14, 18]), Candidate: [ 2  1  2 -1  2  0  1  0  1  2  0  0  2  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 62900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  0  1 -1  1 -1  1  0 -1  0  0  1 -1] (Indices: [3, 5, 10, 12, 14, 15, 19]), Candidate: [ 2  1  2 -1  2  0  1  0  1  2 -1  2  0  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 62950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  0  1 -1  0  0  0  1 -1  1  0  0 -1] (Indices: [3, 5, 10, 15, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  0  1  0  1  2 -1  1  1  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 63000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  0  0  1 -1  1 -1  1 -1  1  0 -1  0] (Indices: [3, 5, 11, 13, 15, 17, 18]), Candidate: [ 2  1  2 -1  2  0  1  0  1  1  1  0  2  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  0  0  0  1 -1  1 -1  1 -1  1  0 -1] (Indices: [3, 5, 12, 14, 16, 18, 19]), Candidate: [ 2  1  2 -1  2  0  1  0  1  1  0  2  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 63100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0  0 -1  0  1 -1  0  0  0  0  1 -1  0] (Indices: [3, 6, 7, 8, 9, 12, 18]), Candidate: [ 2  1  2 -1  1  2  1  0  1  0  0  2  0  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0 -1  1 -1  0  0  0  1 -1  1 -1  0  0] (Indices: [3, 6, 7, 8, 10, 15, 17]), Candidate: [ 2  1  2 -1  1  2  1  0  0  2 -1  1  1  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 63200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0 -1  0  0  1 -1  0  1 -1  0  1 -1  0] (Indices: [3, 6, 7, 8, 12, 15, 18]), Candidate: [ 2  1  2 -1  1  2  1  0  0  1  0  2  0  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  1  0  0 -1  0  0  0  0  0  0  1 -1] (Indices: [3, 6, 7, 9, 10, 11, 19]), Candidate: [ 2  1  2 -1  1  2  1 -1  2  1  0  0  1  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 63300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  1 -1  1 -1  0  0  1 -1  0  0  1 -1] (Indices: [3, 6, 7, 9, 11, 15, 19]), Candidate: [ 2  1  2 -1  1  2  1 -1  2  0  1  0  1  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 63350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  1 -1  0  0  0  1 -1  0  1  0 -1  0] (Indices: [3, 6, 7, 9, 14, 17, 18]), Candidate: [ 2  1  2 -1  1  2  1 -1  2  0  0  1  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 63400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  0  1 -1  1 -1  1 -1  0  0  1 -1  0] (Indices: [3, 6, 7, 10, 12, 14, 18]), Candidate: [ 2  1  2 -1  1  2  1 -1  1  2 -1  2  0  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 63450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  0  0  1  0  0 -1  0  0  1 -1  0  0] (Indices: [3, 6, 7, 11, 12, 13, 17]), Candidate: [ 2  1  2 -1  1  2  1 -1  1  1  1  1  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 63500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  0  0  1 -1  0  0  0  1  0 -1  1 -1] (Indices: [3, 6, 7, 11, 16, 17, 19]), Candidate: [ 2  1  2 -1  1  2  1 -1  1  1  1  0  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 63550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  0  0  0  0  1 -1  1  0 -1  0  1 -1] (Indices: [3, 6, 7, 13, 15, 16, 19]), Candidate: [ 2  1  2 -1  1  2  1 -1  1  1  0  1  2  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 63600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1  0  0 -1  0  0  0  1 -1  1 -1  0  0] (Indices: [3, 6, 8, 9, 10, 15, 17]), Candidate: [ 2  1  2 -1  1  2  0  1  1  1 -1  1  1  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 63650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1  0 -1  0  1 -1  0  1 -1  0  1 -1  0] (Indices: [3, 6, 8, 9, 12, 15, 18]), Candidate: [ 2  1  2 -1  1  2  0  1  1  0  0  2  0  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1 -1  1  0 -1  1  0 -1  0  0  0  0  0] (Indices: [3, 6, 8, 10, 11, 13, 14]), Candidate: [ 2  1  2 -1  1  2  0  1  0  2  0  0  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 63750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1 -1  1 -1  0  1 -1  1 -1  0  0  1 -1] (Indices: [3, 6, 8, 10, 13, 15, 19]), Candidate: [ 2  1  2 -1  1  2  0  1  0  2 -1  1  2  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 63800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1 -1  0  1 -1  1  0 -1  0  1 -1  0  0] (Indices: [3, 6, 8, 11, 13, 14, 17]), Candidate: [ 2  1  2 -1  1  2  0  1  0  1  1  0  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 63850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1 -1  0  0  1 -1  1  0 -1  0  1 -1  0] (Indices: [3, 6, 8, 12, 14, 15, 18]), Candidate: [ 2  1  2 -1  1  2  0  1  0  1  0  2  0  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1 -1  0  0  0  0  0  1  0 -1  1  0 -1] (Indices: [3, 6, 8, 15, 16, 18, 19]), Candidate: [ 2  1  2 -1  1  2  0  1  0  1  0  1  1  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  1  0 -1  1 -1  0  0  0  1 -1  1 -1] (Indices: [3, 6, 9, 10, 12, 17, 19]), Candidate: [ 2  1  2 -1  1  2  0  0  2  1 -1  2  0  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 64000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  1 -1  1  0 -1  0  1 -1  0  1 -1  0] (Indices: [3, 6, 9, 11, 12, 15, 18]), Candidate: [ 2  1  2 -1  1  2  0  0  2  0  1  1  0  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  1 -1  0  1  0 -1  1 -1  0  1 -1  0] (Indices: [3, 6, 9, 12, 13, 15, 18]), Candidate: [ 2  1  2 -1  1  2  0  0  2  0  0  2  1  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  1 -1  0  0  0  1  0  0 -1  0  1 -1] (Indices: [3, 6, 9, 14, 15, 16, 19]), Candidate: [ 2  1  2 -1  1  2  0  0  2  0  0  1  1  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  0  1  0 -1  0  1  0 -1  1 -1  0  0] (Indices: [3, 6, 10, 11, 14, 15, 17]), Candidate: [ 2  1  2 -1  1  2  0  0  1  2  0  0  1  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  0  1 -1  1 -1  0  0  1  0  0 -1  0] (Indices: [3, 6, 10, 12, 16, 17, 18]), Candidate: [ 2  1  2 -1  1  2  0  0  1  2 -1  2  0  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 64250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  0  0  1  0  0 -1  0  1 -1  0  1 -1] (Indices: [3, 6, 11, 12, 13, 16, 19]), Candidate: [ 2  1  2 -1  1  2  0  0  1  1  1  1  1  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  0  0  1 -1  0  1 -1  1  0  0 -1  0] (Indices: [3, 6, 11, 14, 16, 17, 18]), Candidate: [ 2  1  2 -1  1  2  0  0  1  1  1  0  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 64350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  0  0  0  0  1  0 -1  1  0  0 -1  0] (Indices: [3, 6, 13, 14, 16, 17, 18]), Candidate: [ 2  1  2 -1  1  2  0  0  1  1  0  1  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 64400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0  0  0 -1  0  0  0  0  0  0  1  0 -1] (Indices: [3, 7, 8, 9, 10, 18, 19]), Candidate: [ 2  1  2 -1  1  1  2  0  1  1 -1  1  1  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 64450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0  0 -1  0  0  1  0  0 -1  0  0  0  0] (Indices: [3, 7, 8, 9, 13, 14, 15]), Candidate: [ 2  1  2 -1  1  1  2  0  1  0  0  1  2  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0 -1  1  0 -1  0  1 -1  0  1 -1  0  0] (Indices: [3, 7, 8, 10, 11, 14, 17]), Candidate: [ 2  1  2 -1  1  1  2  0  0  2  0  0  1  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 64550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0 -1  1 -1  0  0  1  0 -1  1 -1  0  0] (Indices: [3, 7, 8, 10, 14, 15, 17]), Candidate: [ 2  1  2 -1  1  1  2  0  0  2 -1  1  1  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 64600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0 -1  0  1 -1  1 -1  0  1 -1  1 -1  0] (Indices: [3, 7, 8, 11, 13, 16, 18]), Candidate: [ 2  1  2 -1  1  1  2  0  0  1  1  0  2  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0 -1  0  0  1 -1  0  1  0  0 -1  0  0] (Indices: [3, 7, 8, 12, 15, 16, 17]), Candidate: [ 2  1  2 -1  1  1  2  0  0  1  0  2  0  1  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  1  0  0  0 -1  0  0  0  0  1 -1  0] (Indices: [3, 7, 9, 10, 11, 12, 18]), Candidate: [ 2  1  2 -1  1  1  2 -1  2  1  0  1  0  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 64750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  1  0 -1  0  1 -1  1 -1  1 -1  0  0] (Indices: [3, 7, 9, 10, 13, 15, 17]), Candidate: [ 2  1  2 -1  1  1  2 -1  2  1 -1  1  2  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 64800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  1 -1  1 -1  1  0  0 -1  0  0  0  0] (Indices: [3, 7, 9, 11, 13, 14, 15]), Candidate: [ 2  1  2 -1  1  1  2 -1  2  0  1  0  2  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 64850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  1 -1  0  1 -1  1  0  0 -1  0  0  0] (Indices: [3, 7, 9, 12, 14, 15, 16]), Candidate: [ 2  1  2 -1  1  1  2 -1  2  0  0  2  0  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 64900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  1 -1  0  0  0  0  1  0  0  0 -1  0] (Indices: [3, 7, 9, 15, 16, 17, 18]), Candidate: [ 2  1  2 -1  1  1  2 -1  2  0  0  1  1  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 64950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  0  1  0 -1  0  1 -1  0  0  1  0 -1] (Indices: [3, 7, 10, 11, 14, 18, 19]), Candidate: [ 2  1  2 -1  1  1  2 -1  1  2  0  0  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 65000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  0  1 -1  0  1  0 -1  1  0 -1  0  0] (Indices: [3, 7, 10, 13, 14, 16, 17]), Candidate: [ 2  1  2 -1  1  1  2 -1  1  2 -1  1  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 65050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  0  0  1  0 -1  1 -1  1  0 -1  0  0] (Indices: [3, 7, 11, 12, 14, 16, 17]), Candidate: [ 2  1  2 -1  1  1  2 -1  1  1  1  1  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 65100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  0  0  1 -1  0  0  0  1  0  0  0 -1] (Indices: [3, 7, 11, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  1  2 -1  1  1  1  0  1  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 65150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  0  0  0  0  1 -1  0  1  0  0  0 -1] (Indices: [3, 7, 13, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  1  2 -1  1  1  0  1  2  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 65200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1  0  0 -1  1 -1  0  0  1  0 -1  0  0] (Indices: [3, 8, 9, 10, 12, 16, 17]), Candidate: [ 2  1  2 -1  1  1  1  1  1  1 -1  2  0  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 65250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1  0 -1  1  0 -1  1 -1  0  0  1 -1  0] (Indices: [3, 8, 9, 11, 12, 14, 18]), Candidate: [ 2  1  2 -1  1  1  1  1  1  0  1  1  0  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 65300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1  0 -1  0  1  0  0 -1  0  0  1 -1  0] (Indices: [3, 8, 9, 12, 13, 14, 18]), Candidate: [ 2  1  2 -1  1  1  1  1  1  0  0  2  1  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 65350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1  0 -1  0  0  1 -1  0  1 -1  1  0 -1] (Indices: [3, 8, 9, 13, 16, 18, 19]), Candidate: [ 2  1  2 -1  1  1  1  1  1  0  0  1  2  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1 -1  1  0 -1  1 -1  0  0  1  0 -1  0] (Indices: [3, 8, 10, 11, 13, 17, 18]), Candidate: [ 2  1  2 -1  1  1  1  1  0  2  0  0  2  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1 -1  1 -1  1 -1  0  1  0 -1  0  1 -1] (Indices: [3, 8, 10, 12, 15, 16, 19]), Candidate: [ 2  1  2 -1  1  1  1  1  0  2 -1  2  0  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 65500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1 -1  0  1  0  0 -1  1 -1  0  1 -1  0] (Indices: [3, 8, 11, 12, 13, 15, 18]), Candidate: [ 2  1  2 -1  1  1  1  1  0  1  1  1  1  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1 -1  0  1 -1  0  1  0  0 -1  0  1 -1] (Indices: [3, 8, 11, 14, 15, 16, 19]), Candidate: [ 2  1  2 -1  1  1  1  1  0  1  1  0  1  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1 -1  0  0  0  1  0  0  0 -1  0  1 -1] (Indices: [3, 8, 13, 14, 15, 16, 19]), Candidate: [ 2  1  2 -1  1  1  1  1  0  1  0  1  2  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  1  0  0 -1  1 -1  0  1 -1  1 -1  0] (Indices: [3, 9, 10, 11, 13, 16, 18]), Candidate: [ 2  1  2 -1  1  1  1  0  2  1  0  0  2  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  1  0 -1  1 -1  0  1  0  0 -1  0  0] (Indices: [3, 9, 10, 12, 15, 16, 17]), Candidate: [ 2  1  2 -1  1  1  1  0  2  1 -1  2  0  1  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 65750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  1 -1  1  0  0 -1  1  0 -1  0  0  0] (Indices: [3, 9, 11, 12, 13, 15, 16]), Candidate: [ 2  1  2 -1  1  1  1  0  2  0  1  1  1  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  1 -1  1 -1  0  1  0  0  0 -1  0  0] (Indices: [3, 9, 11, 14, 15, 16, 17]), Candidate: [ 2  1  2 -1  1  1  1  0  2  0  1  0  1  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  1 -1  0  0  1  0  0  0  0 -1  0  0] (Indices: [3, 9, 13, 14, 15, 16, 17]), Candidate: [ 2  1  2 -1  1  1  1  0  2  0  0  1  2  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  0  1  0  0 -1  0  1 -1  1 -1  1 -1] (Indices: [3, 10, 11, 12, 15, 17, 19]), Candidate: [ 2  1  2 -1  1  1  1  0  1  2  0  1  0  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  0  1 -1  1  0  0 -1  0  0  1  0 -1] (Indices: [3, 10, 12, 13, 14, 18, 19]), Candidate: [ 2  1  2 -1  1  1  1  0  1  2 -1  2  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 66000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  0  0  1  0  0  0  0 -1  0  0  1 -1] (Indices: [3, 11, 12, 13, 14, 15, 19]), Candidate: [ 2  1  2 -1  1  1  1  0  1  1  1  1  1  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  0  0  1 -1  0  1  0 -1  1  0  0 -1] (Indices: [3, 11, 14, 15, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  1  1  0  1  1  1  0  1  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0 -1  0  1  0 -1  0  0  0  0  0  0  0] (Indices: [4, 5, 6, 7, 8, 11, 12]), Candidate: [2 1 1 1 1 1 1 0 0 1 1 1 0 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 66150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  1 -1  1 -1  0  0  0  0  1 -1  0  0] (Indices: [4, 5, 6, 7, 9, 11, 17]), Candidate: [ 2  1  1  1  1  1  1 -1  2  0  1  0  1  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  0  1 -1  0  1 -1  0  0  0  1 -1  0] (Indices: [4, 5, 6, 7, 10, 13, 18]), Candidate: [ 2  1  1  1  1  1  1 -1  1  2 -1  1  2  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 66250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  0  0  0  1  0 -1  0  0  0  0  1 -1] (Indices: [4, 5, 6, 7, 12, 13, 19]), Candidate: [ 2  1  1  1  1  1  1 -1  1  1  0  2  1  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  0  0  0  0  0  0  0  0  1  0  0 -1] (Indices: [4, 5, 6, 7, 17, 18, 19]), Candidate: [ 2  1  1  1  1  1  1 -1  1  1  0  1  1  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1 -1  1  0 -1  0  0  0  1 -1  0  0  0] (Indices: [4, 5, 6, 8, 10, 11, 16]), Candidate: [2 1 1 1 1 1 0 1 0 2 0 0 1 1 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 66400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1 -1  0  1 -1  0  0  1  0 -1  0  0  0] (Indices: [4, 5, 6, 8, 11, 15, 16]), Candidate: [2 1 1 1 1 1 0 1 0 1 1 0 1 1 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 66450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1 -1  0  0  0  0  1 -1  1  0 -1  0  0] (Indices: [4, 5, 6, 8, 14, 16, 17]), Candidate: [ 2  1  1  1  1  1  0  1  0  1  0  1  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  1  0 -1  0  0  0  0  0  1 -1  1 -1] (Indices: [4, 5, 6, 9, 10, 17, 19]), Candidate: [ 2  1  1  1  1  1  0  0  2  1 -1  1  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  1 -1  0  1 -1  0  0  0  0  1  0 -1] (Indices: [4, 5, 6, 9, 12, 18, 19]), Candidate: [2 1 1 1 1 1 0 0 2 0 0 2 0 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 66600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  0  1  0 -1  0  1 -1  1 -1  0  0  0] (Indices: [4, 5, 6, 10, 11, 14, 16]), Candidate: [ 2  1  1  1  1  1  0  0  1  2  0  0  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  0  1 -1  0  0  1  0  0 -1  0  0  0] (Indices: [4, 5, 6, 10, 14, 15, 16]), Candidate: [ 2  1  1  1  1  1  0  0  1  2 -1  1  1  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  0  0  1 -1  1 -1  0  1  0 -1  0  0] (Indices: [4, 5, 6, 11, 13, 16, 17]), Candidate: [2 1 1 1 1 1 0 0 1 1 1 0 2 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 66750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  0  0  0  1 -1  1 -1  0  0  1  0 -1] (Indices: [4, 5, 6, 12, 14, 18, 19]), Candidate: [ 2  1  1  1  1  1  0  0  1  1  0  2  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0  0  0 -1  0  0  0  1 -1  0  0  0  0] (Indices: [4, 5, 7, 8, 9, 10, 15]), Candidate: [ 2  1  1  1  1  0  2  0  1  1 -1  1  1  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0 -1  1 -1  1 -1  1 -1  0  0  0  0  0] (Indices: [4, 5, 7, 8, 10, 12, 14]), Candidate: [ 2  1  1  1  1  0  2  0  0  2 -1  2  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 66900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0 -1  0  1 -1  0  0  0  1 -1  1 -1  0] (Indices: [4, 5, 7, 8, 11, 16, 18]), Candidate: [2 1 1 1 1 0 2 0 0 1 1 0 1 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 66950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0 -1  0  0  0  0  1 -1  0  0  1  0 -1] (Indices: [4, 5, 7, 8, 14, 18, 19]), Candidate: [ 2  1  1  1  1  0  2  0  0  1  0  1  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  1 -1  1  0 -1  0  0  1 -1  0  0  0] (Indices: [4, 5, 7, 9, 11, 12, 16]), Candidate: [ 2  1  1  1  1  0  2 -1  2  0  1  1  0  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  1 -1  0  0  1  0 -1  0  0  0  1 -1] (Indices: [4, 5, 7, 9, 13, 14, 19]), Candidate: [ 2  1  1  1  1  0  2 -1  2  0  0  1  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 67100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  0  1  0 -1  0  0  1 -1  1 -1  0  0] (Indices: [4, 5, 7, 10, 11, 15, 17]), Candidate: [ 2  1  1  1  1  0  2 -1  1  2  0  0  1  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  0  1 -1  0  0  1 -1  1 -1  1 -1  0] (Indices: [4, 5, 7, 10, 14, 16, 18]), Candidate: [ 2  1  1  1  1  0  2 -1  1  2 -1  1  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 67200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  0  0  1 -1  1 -1  0  0  0  1  0 -1] (Indices: [4, 5, 7, 11, 13, 18, 19]), Candidate: [ 2  1  1  1  1  0  2 -1  1  1  1  0  2  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  0  0  0  1 -1  0  1 -1  1 -1  1 -1] (Indices: [4, 5, 7, 12, 15, 17, 19]), Candidate: [ 2  1  1  1  1  0  2 -1  1  1  0  2  0  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1  0  0 -1  1 -1  1 -1  0  0  0  0  0] (Indices: [4, 5, 8, 9, 10, 12, 14]), Candidate: [ 2  1  1  1  1  0  1  1  1  1 -1  2  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 67350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1  0 -1  1 -1  0  0  0  1 -1  1 -1  0] (Indices: [4, 5, 8, 9, 11, 16, 18]), Candidate: [2 1 1 1 1 0 1 1 1 0 1 0 1 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 67400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1  0 -1  0  0  0  1 -1  0  0  1  0 -1] (Indices: [4, 5, 8, 9, 14, 18, 19]), Candidate: [ 2  1  1  1  1  0  1  1  1  0  0  1  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1 -1  1 -1  1 -1  0  1  0 -1  0  0  0] (Indices: [4, 5, 8, 10, 12, 15, 16]), Candidate: [ 2  1  1  1  1  0  1  1  0  2 -1  2  0  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1 -1  0  1  0  0 -1  0  0  0  0  1 -1] (Indices: [4, 5, 8, 11, 12, 13, 19]), Candidate: [2 1 1 1 1 0 1 1 0 1 1 1 1 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 67550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1 -1  0  1 -1  0  0  0  0  1  0  0 -1] (Indices: [4, 5, 8, 11, 17, 18, 19]), Candidate: [2 1 1 1 1 0 1 1 0 1 1 0 1 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 67600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1 -1  0  0  0  1 -1  1 -1  1 -1  1 -1] (Indices: [4, 5, 8, 13, 15, 17, 19]), Candidate: [2 1 1 1 1 0 1 1 0 1 0 1 2 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 67650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  1  0 -1  1  0 -1  1 -1  0  0  0  0] (Indices: [4, 5, 9, 10, 12, 13, 15]), Candidate: [ 2  1  1  1  1  0  1  0  2  1 -1  2  1  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  1  0 -1  0  0  0  1 -1  0  1  0 -1] (Indices: [4, 5, 9, 10, 15, 18, 19]), Candidate: [ 2  1  1  1  1  0  1  0  2  1 -1  1  1  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  1 -1  1 -1  0  1 -1  0  0  1  0 -1] (Indices: [4, 5, 9, 11, 14, 18, 19]), Candidate: [ 2  1  1  1  1  0  1  0  2  0  1  0  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  1 -1  0  0  1  0 -1  1  0 -1  0  0] (Indices: [4, 5, 9, 13, 14, 16, 17]), Candidate: [ 2  1  1  1  1  0  1  0  2  0  0  1  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  0  1  0  0 -1  0  0  0  1 -1  1 -1] (Indices: [4, 5, 10, 11, 12, 17, 19]), Candidate: [2 1 1 1 1 0 1 0 1 2 0 1 0 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 67900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  0  1 -1  1  0 -1  0  0  1 -1  1 -1] (Indices: [4, 5, 10, 12, 13, 17, 19]), Candidate: [ 2  1  1  1  1  0  1  0  1  2 -1  2  1  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  0  1 -1  0  0  1 -1  1 -1  1  0 -1] (Indices: [4, 5, 10, 14, 16, 18, 19]), Candidate: [ 2  1  1  1  1  0  1  0  1  2 -1  1  1  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  0  0  1 -1  1  0 -1  0  1 -1  1 -1] (Indices: [4, 5, 11, 13, 14, 17, 19]), Candidate: [ 2  1  1  1  1  0  1  0  1  1  1  0  2  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  0  0  0  1 -1  1  0 -1  1  0 -1  0] (Indices: [4, 5, 12, 14, 15, 17, 18]), Candidate: [2 1 1 1 1 0 1 0 1 1 0 2 0 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 68100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0  0 -1  0  1  0 -1  0  0  0  0  0  0] (Indices: [4, 6, 7, 8, 9, 12, 13]), Candidate: [2 1 1 1 0 2 1 0 1 0 0 2 1 0 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 68150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0 -1  1 -1  0  0  1 -1  1 -1  0  0  0] (Indices: [4, 6, 7, 8, 10, 14, 16]), Candidate: [ 2  1  1  1  0  2  1  0  0  2 -1  1  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0 -1  0  0  1 -1  1 -1  0  1 -1  0  0] (Indices: [4, 6, 7, 8, 12, 14, 17]), Candidate: [ 2  1  1  1  0  2  1  0  0  1  0  2  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  1  0  0 -1  0  1 -1  0  0  0  0  0] (Indices: [4, 6, 7, 9, 10, 11, 14]), Candidate: [ 2  1  1  1  0  2  1 -1  2  1  0  0  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  1 -1  1 -1  0  1 -1  0  0  1 -1  0] (Indices: [4, 6, 7, 9, 11, 14, 18]), Candidate: [ 2  1  1  1  0  2  1 -1  2  0  1  0  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  1 -1  0  0  0  1  0 -1  0  1 -1  0] (Indices: [4, 6, 7, 9, 14, 15, 18]), Candidate: [ 2  1  1  1  0  2  1 -1  2  0  0  1  1  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  0  1 -1  1  0 -1  0  0  0  1 -1  0] (Indices: [4, 6, 7, 10, 12, 13, 18]), Candidate: [ 2  1  1  1  0  2  1 -1  1  2 -1  2  1  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  0  1 -1  0  0  0  0  1 -1  1  0 -1] (Indices: [4, 6, 7, 10, 16, 18, 19]), Candidate: [ 2  1  1  1  0  2  1 -1  1  2 -1  1  1  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  0  0  1 -1  0  0  1  0 -1  0  1 -1] (Indices: [4, 6, 7, 11, 15, 16, 19]), Candidate: [ 2  1  1  1  0  2  1 -1  1  1  1  0  1  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  0  0  0  0  1  0 -1  0  1  0 -1  0] (Indices: [4, 6, 7, 13, 14, 17, 18]), Candidate: [ 2  1  1  1  0  2  1 -1  1  1  0  1  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1  0  0 -1  0  0  1 -1  1 -1  0  0  0] (Indices: [4, 6, 8, 9, 10, 14, 16]), Candidate: [ 2  1  1  1  0  2  0  1  1  1 -1  1  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1  0 -1  0  1 -1  1 -1  0  1 -1  0  0] (Indices: [4, 6, 8, 9, 12, 14, 17]), Candidate: [ 2  1  1  1  0  2  0  1  1  0  0  2  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1 -1  1  0  0 -1  0  1 -1  0  0  0  0] (Indices: [4, 6, 8, 10, 11, 12, 15]), Candidate: [2 1 1 1 0 2 0 1 0 2 0 1 0 1 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 68750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1 -1  1 -1  0  1  0 -1  0  0  1 -1  0] (Indices: [4, 6, 8, 10, 13, 14, 18]), Candidate: [ 2  1  1  1  0  2  0  1  0  2 -1  1  2  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1 -1  0  1  0 -1  0  0  0  1  0 -1  0] (Indices: [4, 6, 8, 11, 12, 17, 18]), Candidate: [2 1 1 1 0 2 0 1 0 1 1 1 0 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 68850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1 -1  0  0  1  0 -1  0  0  1  0 -1  0] (Indices: [4, 6, 8, 12, 13, 17, 18]), Candidate: [2 1 1 1 0 2 0 1 0 1 0 2 1 0 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 68900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1 -1  0  0  0  0  1 -1  1  0 -1  1 -1] (Indices: [4, 6, 8, 14, 16, 17, 19]), Candidate: [ 2  1  1  1  0  2  0  1  0  1  0  1  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  1  0 -1  1 -1  0  1 -1  0  0  1 -1] (Indices: [4, 6, 9, 10, 12, 15, 19]), Candidate: [ 2  1  1  1  0  2  0  0  2  1 -1  2  0  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  1 -1  1  0 -1  1 -1  0  1 -1  0  0] (Indices: [4, 6, 9, 11, 12, 14, 17]), Candidate: [ 2  1  1  1  0  2  0  0  2  0  1  1  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  1 -1  0  1  0  0 -1  0  1 -1  0  0] (Indices: [4, 6, 9, 12, 13, 14, 17]), Candidate: [ 2  1  1  1  0  2  0  0  2  0  0  2  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  1 -1  0  0  1 -1  0  1  0 -1  1 -1] (Indices: [4, 6, 9, 13, 16, 17, 19]), Candidate: [2 1 1 1 0 2 0 0 2 0 0 1 2 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 69150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  0  1  0 -1  1 -1  0  1 -1  0  1 -1] (Indices: [4, 6, 10, 11, 13, 16, 19]), Candidate: [2 1 1 1 0 2 0 0 1 2 0 0 2 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 69200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  0  1 -1  1 -1  0  1  0 -1  1 -1  0] (Indices: [4, 6, 10, 12, 15, 16, 18]), Candidate: [ 2  1  1  1  0  2  0  0  1  2 -1  2  0  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  0  0  1  0  0 -1  1 -1  1 -1  0  0] (Indices: [4, 6, 11, 12, 13, 15, 17]), Candidate: [2 1 1 1 0 2 0 0 1 1 1 1 1 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 69300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  0  0  1 -1  0  1  0  0 -1  1 -1  0] (Indices: [4, 6, 11, 14, 15, 16, 18]), Candidate: [2 1 1 1 0 2 0 0 1 1 1 0 1 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 69350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  0  0  0  0  1  0  0  0 -1  1 -1  0] (Indices: [4, 6, 13, 14, 15, 16, 18]), Candidate: [2 1 1 1 0 2 0 0 1 1 0 1 2 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 69400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0  0  0 -1  0  0  0  0  1  0 -1  0  0] (Indices: [4, 7, 8, 9, 10, 16, 17]), Candidate: [ 2  1  1  1  0  1  2  0  1  1 -1  1  1  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0  0 -1  0  1 -1  0  0  1 -1  1 -1  0] (Indices: [4, 7, 8, 9, 12, 16, 18]), Candidate: [2 1 1 1 0 1 2 0 1 0 0 2 0 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 69500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0 -1  1  0 -1  1 -1  0  0  1 -1  0  0] (Indices: [4, 7, 8, 10, 11, 13, 17]), Candidate: [2 1 1 1 0 1 2 0 0 2 0 0 2 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 69550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0 -1  1 -1  0  1 -1  0  1 -1  0  1 -1] (Indices: [4, 7, 8, 10, 13, 16, 19]), Candidate: [ 2  1  1  1  0  1  2  0  0  2 -1  1  2  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0 -1  0  1 -1  1 -1  1  0 -1  0  0  0] (Indices: [4, 7, 8, 11, 13, 15, 16]), Candidate: [2 1 1 1 0 1 2 0 0 1 1 0 2 0 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 69650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0 -1  0  0  1 -1  1 -1  1 -1  1 -1  0] (Indices: [4, 7, 8, 12, 14, 16, 18]), Candidate: [ 2  1  1  1  0  1  2  0  0  1  0  2  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  1  0  0  0  0 -1  0  0  0  0  0  0] (Indices: [4, 7, 9, 10, 11, 12, 13]), Candidate: [ 2  1  1  1  0  1  2 -1  2  1  0  1  1  0  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  1  0 -1  0  1  0 -1  1 -1  0  0  0] (Indices: [4, 7, 9, 10, 13, 14, 16]), Candidate: [ 2  1  1  1  0  1  2 -1  2  1 -1  1  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 69800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  1 -1  1  0 -1  0  0  1 -1  1 -1  0] (Indices: [4, 7, 9, 11, 12, 16, 18]), Candidate: [ 2  1  1  1  0  1  2 -1  2  0  1  1  0  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  1 -1  0  1  0 -1  0  1 -1  1 -1  0] (Indices: [4, 7, 9, 12, 13, 16, 18]), Candidate: [ 2  1  1  1  0  1  2 -1  2  0  0  2  1  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  1 -1  0  0  0  1  0 -1  0  1  0 -1] (Indices: [4, 7, 9, 14, 15, 18, 19]), Candidate: [ 2  1  1  1  0  1  2 -1  2  0  0  1  1  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  0  1  0 -1  0  1 -1  1  0 -1  0  0] (Indices: [4, 7, 10, 11, 14, 16, 17]), Candidate: [ 2  1  1  1  0  1  2 -1  1  2  0  0  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 70000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  0  1 -1  1 -1  0  0  0  1  0  0 -1] (Indices: [4, 7, 10, 12, 17, 18, 19]), Candidate: [ 2  1  1  1  0  1  2 -1  1  2 -1  2  0  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 70050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  0  0  1  0  0 -1  0  0  0  1  0 -1] (Indices: [4, 7, 11, 12, 13, 18, 19]), Candidate: [ 2  1  1  1  0  1  2 -1  1  1  1  1  1  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  0  0  1 -1  0  1 -1  0  1  0  0 -1] (Indices: [4, 7, 11, 14, 17, 18, 19]), Candidate: [ 2  1  1  1  0  1  2 -1  1  1  1  0  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 70150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  0  0  0  0  1  0 -1  0  1  0  0 -1] (Indices: [4, 7, 13, 14, 17, 18, 19]), Candidate: [ 2  1  1  1  0  1  2 -1  1  1  0  1  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 70200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1  0  0 -1  1 -1  1 -1  0  0  0  1 -1] (Indices: [4, 8, 9, 10, 12, 14, 19]), Candidate: [ 2  1  1  1  0  1  1  1  1  1 -1  2  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 70250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1  0 -1  1  0  0 -1  0  0  0  1 -1  0] (Indices: [4, 8, 9, 11, 12, 13, 18]), Candidate: [2 1 1 1 0 1 1 1 1 0 1 1 1 0 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 70300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1  0 -1  1 -1  0  0  0  1 -1  1  0 -1] (Indices: [4, 8, 9, 11, 16, 18, 19]), Candidate: [2 1 1 1 0 1 1 1 1 0 1 0 1 1 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 70350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1  0 -1  0  0  1 -1  1 -1  1  0 -1  0] (Indices: [4, 8, 9, 13, 15, 17, 18]), Candidate: [2 1 1 1 0 1 1 1 1 0 0 1 2 0 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 70400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1 -1  1  0 -1  1 -1  1 -1  0  1 -1  0] (Indices: [4, 8, 10, 11, 13, 15, 18]), Candidate: [2 1 1 1 0 1 1 1 0 2 0 0 2 0 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 70450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1 -1  1 -1  1 -1  1 -1  0  1  0 -1  0] (Indices: [4, 8, 10, 12, 14, 17, 18]), Candidate: [ 2  1  1  1  0  1  1  1  0  2 -1  2  0  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 70500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1 -1  0  1  0  0  0 -1  0  1 -1  0  0] (Indices: [4, 8, 11, 12, 13, 14, 17]), Candidate: [ 2  1  1  1  0  1  1  1  0  1  1  1  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1 -1  0  1 -1  1 -1  0  1  0 -1  1 -1] (Indices: [4, 8, 11, 13, 16, 17, 19]), Candidate: [2 1 1 1 0 1 1 1 0 1 1 0 2 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 70600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1 -1  0  0  1 -1  0  1  0 -1  1  0 -1] (Indices: [4, 8, 12, 15, 16, 18, 19]), Candidate: [2 1 1 1 0 1 1 1 0 1 0 2 0 1 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 70650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  1  0  0 -1  1 -1  1  0 -1  0  0  0] (Indices: [4, 9, 10, 11, 13, 15, 16]), Candidate: [2 1 1 1 0 1 1 0 2 1 0 0 2 0 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 70700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  1  0 -1  1 -1  1 -1  1 -1  1 -1  0] (Indices: [4, 9, 10, 12, 14, 16, 18]), Candidate: [ 2  1  1  1  0  1  1  0  2  1 -1  2  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 70750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  1 -1  1  0  0  0  0 -1  0  0  0  0] (Indices: [4, 9, 11, 12, 13, 14, 15]), Candidate: [2 1 1 1 0 1 1 0 2 0 1 1 1 1 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 70800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  1 -1  1 -1  1 -1  1 -1  0  1  0 -1] (Indices: [4, 9, 11, 13, 15, 18, 19]), Candidate: [2 1 1 1 0 1 1 0 2 0 1 0 2 0 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 70850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  1 -1  0  1 -1  0  1  0  0  0 -1  0] (Indices: [4, 9, 12, 15, 16, 17, 18]), Candidate: [2 1 1 1 0 1 1 0 2 0 0 2 0 1 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 70900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  0  1  0  0 -1  1 -1  0  0  1  0 -1] (Indices: [4, 10, 11, 12, 14, 18, 19]), Candidate: [ 2  1  1  1  0  1  1  0  1  2  0  1  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  0  1 -1  1  0  0 -1  1  0 -1  0  0] (Indices: [4, 10, 12, 13, 14, 16, 17]), Candidate: [ 2  1  1  1  0  1  1  0  1  2 -1  2  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 71000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  0  1 -1  0  0  1 -1  1  0  0  0 -1] (Indices: [4, 10, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  1  0  1  1  0  1  2 -1  1  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 71050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  0  0  1 -1  1 -1  1 -1  1  0  0 -1] (Indices: [4, 11, 13, 15, 17, 18, 19]), Candidate: [2 1 1 1 0 1 1 0 1 1 1 0 2 0 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 71100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0  0 -1  1 -1  0  0  0  0  1 -1  0  0] (Indices: [5, 6, 7, 8, 9, 11, 17]), Candidate: [2 1 1 0 2 1 1 0 1 0 1 0 1 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 71150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0 -1  1 -1  0  1 -1  0  0  0  1 -1  0] (Indices: [5, 6, 7, 8, 10, 13, 18]), Candidate: [ 2  1  1  0  2  1  1  0  0  2 -1  1  2  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0 -1  0  0  1  0 -1  0  0  0  0  1 -1] (Indices: [5, 6, 7, 8, 12, 13, 19]), Candidate: [2 1 1 0 2 1 1 0 0 1 0 2 1 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 71250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0 -1  0  0  0  0  0  0  0  1  0  0 -1] (Indices: [5, 6, 7, 8, 17, 18, 19]), Candidate: [2 1 1 0 2 1 1 0 0 1 0 1 1 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 71300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  1 -1  1 -1  0  1  0 -1  0  0  0  0] (Indices: [5, 6, 7, 9, 11, 14, 15]), Candidate: [ 2  1  1  0  2  1  1 -1  2  0  1  0  1  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  1 -1  0  0  1 -1  0  0  0  1  0 -1] (Indices: [5, 6, 7, 9, 13, 18, 19]), Candidate: [ 2  1  1  0  2  1  1 -1  2  0  0  1  2  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  0  1 -1  1  0 -1  1 -1  0  0  0  0] (Indices: [5, 6, 7, 10, 12, 13, 15]), Candidate: [ 2  1  1  0  2  1  1 -1  1  2 -1  2  1  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 71450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  0  1 -1  0  0  0  1 -1  0  1  0 -1] (Indices: [5, 6, 7, 10, 15, 18, 19]), Candidate: [ 2  1  1  0  2  1  1 -1  1  2 -1  1  1  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 71500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  0  0  1 -1  0  1 -1  0  0  1  0 -1] (Indices: [5, 6, 7, 11, 14, 18, 19]), Candidate: [ 2  1  1  0  2  1  1 -1  1  1  1  0  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 71550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  0  0  0  0  1  0 -1  1  0 -1  0  0] (Indices: [5, 6, 7, 13, 14, 16, 17]), Candidate: [ 2  1  1  0  2  1  1 -1  1  1  0  1  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 71600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1  0  0 -1  0  1 -1  0  0  0  1 -1  0] (Indices: [5, 6, 8, 9, 10, 13, 18]), Candidate: [ 2  1  1  0  2  1  0  1  1  1 -1  1  2  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1  0 -1  0  1  0 -1  0  0  0  0  1 -1] (Indices: [5, 6, 8, 9, 12, 13, 19]), Candidate: [2 1 1 0 2 1 0 1 1 0 0 2 1 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 71700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1  0 -1  0  0  0  0  0  0  1  0  0 -1] (Indices: [5, 6, 8, 9, 17, 18, 19]), Candidate: [2 1 1 0 2 1 0 1 1 0 0 1 1 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 71750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1 -1  1 -1  0  1  0  0 -1  0  0  0  0] (Indices: [5, 6, 8, 10, 13, 14, 15]), Candidate: [ 2  1  1  0  2  1  0  1  0  2 -1  1  2  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1 -1  0  1  0 -1  0  0  1  0 -1  0  0] (Indices: [5, 6, 8, 11, 12, 16, 17]), Candidate: [2 1 1 0 2 1 0 1 0 1 1 1 0 1 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 71850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1 -1  0  0  1  0 -1  0  1  0 -1  0  0] (Indices: [5, 6, 8, 12, 13, 16, 17]), Candidate: [2 1 1 0 2 1 0 1 0 1 0 2 1 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 71900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1 -1  0  0  0  0  1  0 -1  1 -1  1 -1] (Indices: [5, 6, 8, 14, 15, 17, 19]), Candidate: [2 1 1 0 2 1 0 1 0 1 0 1 1 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 71950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  1  0 -1  1 -1  0  1  0 -1  0  0  0] (Indices: [5, 6, 9, 10, 12, 15, 16]), Candidate: [ 2  1  1  0  2  1  0  0  2  1 -1  2  0  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  1 -1  1  0  0 -1  0  0  0  0  1 -1] (Indices: [5, 6, 9, 11, 12, 13, 19]), Candidate: [2 1 1 0 2 1 0 0 2 0 1 1 1 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 72050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  1 -1  1 -1  0  0  0  0  1  0  0 -1] (Indices: [5, 6, 9, 11, 17, 18, 19]), Candidate: [2 1 1 0 2 1 0 0 2 0 1 0 1 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 72100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  1 -1  0  0  1 -1  1 -1  1 -1  1 -1] (Indices: [5, 6, 9, 13, 15, 17, 19]), Candidate: [2 1 1 0 2 1 0 0 2 0 0 1 2 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 72150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  0  1  0 -1  1 -1  1 -1  0  0  1 -1] (Indices: [5, 6, 10, 11, 13, 15, 19]), Candidate: [2 1 1 0 2 1 0 0 1 2 0 0 2 0 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 72200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  0  1 -1  1 -1  1 -1  0  1 -1  1 -1] (Indices: [5, 6, 10, 12, 14, 17, 19]), Candidate: [ 2  1  1  0  2  1  0  0  1  2 -1  2  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 72250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  0  0  1  0  0  0 -1  0  0  1 -1  0] (Indices: [5, 6, 11, 12, 13, 14, 18]), Candidate: [ 2  1  1  0  2  1  0  0  1  1  1  1  1  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  0  0  1 -1  1 -1  0  1 -1  1  0 -1] (Indices: [5, 6, 11, 13, 16, 18, 19]), Candidate: [2 1 1 0 2 1 0 0 1 1 1 0 2 0 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 72350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  0  0  0  1 -1  0  1 -1  1  0  0 -1] (Indices: [5, 6, 12, 15, 17, 18, 19]), Candidate: [2 1 1 0 2 1 0 0 1 1 0 2 0 1 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 72400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0  0  0 -1  0  0  0  1 -1  1 -1  0  0] (Indices: [5, 7, 8, 9, 10, 15, 17]), Candidate: [ 2  1  1  0  2  0  2  0  1  1 -1  1  1  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0  0 -1  0  1 -1  0  1 -1  0  1 -1  0] (Indices: [5, 7, 8, 9, 12, 15, 18]), Candidate: [2 1 1 0 2 0 2 0 1 0 0 2 0 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 72500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0 -1  1  0 -1  1  0 -1  0  0  0  0  0] (Indices: [5, 7, 8, 10, 11, 13, 14]), Candidate: [ 2  1  1  0  2  0  2  0  0  2  0  0  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0 -1  1 -1  0  1 -1  1 -1  0  0  1 -1] (Indices: [5, 7, 8, 10, 13, 15, 19]), Candidate: [ 2  1  1  0  2  0  2  0  0  2 -1  1  2  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0 -1  0  1 -1  1  0 -1  0  1 -1  0  0] (Indices: [5, 7, 8, 11, 13, 14, 17]), Candidate: [ 2  1  1  0  2  0  2  0  0  1  1  0  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0 -1  0  0  1 -1  1  0 -1  0  1 -1  0] (Indices: [5, 7, 8, 12, 14, 15, 18]), Candidate: [2 1 1 0 2 0 2 0 0 1 0 2 0 2 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 72700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0 -1  0  0  0  0  0  1  0 -1  1  0 -1] (Indices: [5, 7, 8, 15, 16, 18, 19]), Candidate: [2 1 1 0 2 0 2 0 0 1 0 1 1 1 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 72750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  1  0 -1  1 -1  0  0  0  1 -1  1 -1] (Indices: [5, 7, 9, 10, 12, 17, 19]), Candidate: [ 2  1  1  0  2  0  2 -1  2  1 -1  2  0  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 72800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  1 -1  1  0 -1  0  1 -1  0  1 -1  0] (Indices: [5, 7, 9, 11, 12, 15, 18]), Candidate: [ 2  1  1  0  2  0  2 -1  2  0  1  1  0  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  1 -1  0  1  0 -1  1 -1  0  1 -1  0] (Indices: [5, 7, 9, 12, 13, 15, 18]), Candidate: [ 2  1  1  0  2  0  2 -1  2  0  0  2  1  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  1 -1  0  0  0  1  0  0 -1  0  1 -1] (Indices: [5, 7, 9, 14, 15, 16, 19]), Candidate: [ 2  1  1  0  2  0  2 -1  2  0  0  1  1  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  0  1  0 -1  0  1  0 -1  1 -1  0  0] (Indices: [5, 7, 10, 11, 14, 15, 17]), Candidate: [ 2  1  1  0  2  0  2 -1  1  2  0  0  1  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  0  1 -1  1 -1  0  0  1  0  0 -1  0] (Indices: [5, 7, 10, 12, 16, 17, 18]), Candidate: [ 2  1  1  0  2  0  2 -1  1  2 -1  2  0  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 73050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  0  0  1  0  0 -1  0  1 -1  0  1 -1] (Indices: [5, 7, 11, 12, 13, 16, 19]), Candidate: [ 2  1  1  0  2  0  2 -1  1  1  1  1  1  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  0  0  1 -1  0  1 -1  1  0  0 -1  0] (Indices: [5, 7, 11, 14, 16, 17, 18]), Candidate: [ 2  1  1  0  2  0  2 -1  1  1  1  0  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 73150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  0  0  0  0  1  0 -1  1  0  0 -1  0] (Indices: [5, 7, 13, 14, 16, 17, 18]), Candidate: [ 2  1  1  0  2  0  2 -1  1  1  0  1  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 73200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1  0  0 -1  1 -1  1 -1  1 -1  0  0  0] (Indices: [5, 8, 9, 10, 12, 14, 16]), Candidate: [ 2  1  1  0  2  0  1  1  1  1 -1  2  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 73250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1  0 -1  1  0  0 -1  1 -1  0  0  0  0] (Indices: [5, 8, 9, 11, 12, 13, 15]), Candidate: [2 1 1 0 2 0 1 1 1 0 1 1 1 0 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 73300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1  0 -1  1 -1  0  0  1 -1  0  1  0 -1] (Indices: [5, 8, 9, 11, 15, 18, 19]), Candidate: [2 1 1 0 2 0 1 1 1 0 1 0 1 1 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 73350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1  0 -1  0  0  1 -1  1  0  0 -1  0  0] (Indices: [5, 8, 9, 13, 15, 16, 17]), Candidate: [2 1 1 0 2 0 1 1 1 0 0 1 2 0 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 73400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1 -1  1  0 -1  1  0 -1  0  0  0  1 -1] (Indices: [5, 8, 10, 11, 13, 14, 19]), Candidate: [ 2  1  1  0  2  0  1  1  0  2  0  0  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1 -1  1 -1  1 -1  1 -1  1  0 -1  0  0] (Indices: [5, 8, 10, 12, 14, 16, 17]), Candidate: [ 2  1  1  0  2  0  1  1  0  2 -1  2  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 73500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1 -1  1 -1  0  0  0  0  1  0  0  0 -1] (Indices: [5, 8, 10, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  2  0  1  1  0  2 -1  1  1  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1 -1  0  1 -1  1 -1  1 -1  1 -1  1 -1] (Indices: [5, 8, 11, 13, 15, 17, 19]), Candidate: [2 1 1 0 2 0 1 1 0 1 1 0 2 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 73600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1 -1  0  0  1 -1  1 -1  0  1  0  0 -1] (Indices: [5, 8, 12, 14, 17, 18, 19]), Candidate: [ 2  1  1  0  2  0  1  1  0  1  0  2  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  1  0  0 -1  1  0 -1  0  1 -1  0  0] (Indices: [5, 9, 10, 11, 13, 14, 17]), Candidate: [ 2  1  1  0  2  0  1  0  2  1  0  0  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  1  0 -1  1 -1  1  0 -1  0  1 -1  0] (Indices: [5, 9, 10, 12, 14, 15, 18]), Candidate: [ 2  1  1  0  2  0  1  0  2  1 -1  2  0  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  1  0 -1  0  0  0  1  0 -1  1  0 -1] (Indices: [5, 9, 10, 15, 16, 18, 19]), Candidate: [ 2  1  1  0  2  0  1  0  2  1 -1  1  1  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  1 -1  1 -1  1 -1  1  0 -1  0  1 -1] (Indices: [5, 9, 11, 13, 15, 16, 19]), Candidate: [2 1 1 0 2 0 1 0 2 0 1 0 2 0 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 73850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  1 -1  0  1 -1  1 -1  1  0 -1  1 -1] (Indices: [5, 9, 12, 14, 16, 17, 19]), Candidate: [ 2  1  1  0  2  0  1  0  2  0  0  2  0  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  0  1  0  0 -1  1 -1  1 -1  0  1 -1] (Indices: [5, 10, 11, 12, 14, 16, 19]), Candidate: [ 2  1  1  0  2  0  1  0  1  2  0  1  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  0  1 -1  1  0  0  0 -1  1 -1  0  0] (Indices: [5, 10, 12, 13, 14, 15, 17]), Candidate: [ 2  1  1  0  2  0  1  0  1  2 -1  2  1  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  0  1 -1  0  0  1  0  0  0 -1  1 -1] (Indices: [5, 10, 14, 15, 16, 17, 19]), Candidate: [ 2  1  1  0  2  0  1  0  1  2 -1  1  1  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  0  0  1 -1  1 -1  1  0  0  0 -1  0] (Indices: [5, 11, 13, 15, 16, 17, 18]), Candidate: [2 1 1 0 2 0 1 0 1 1 1 0 2 0 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 74100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0  0  0 -1  1 -1  0  0  1 -1  0  0  0] (Indices: [6, 7, 8, 9, 10, 12, 16]), Candidate: [ 2  1  1  0  1  2  1  0  1  1 -1  2  0  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0  0 -1  1 -1  0  0  0  0  1  0 -1  0] (Indices: [6, 7, 8, 9, 11, 17, 18]), Candidate: [2 1 1 0 1 2 1 0 1 0 1 0 1 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 74200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0  0 -1  0  0  0  0  1  0 -1  1 -1  0] (Indices: [6, 7, 8, 9, 15, 16, 18]), Candidate: [2 1 1 0 1 2 1 0 1 0 0 1 1 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 74250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0 -1  1 -1  1 -1  0  1 -1  0  1 -1  0] (Indices: [6, 7, 8, 10, 12, 15, 18]), Candidate: [ 2  1  1  0  1  2  1  0  0  2 -1  2  0  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0 -1  0  1  0 -1  1 -1  1 -1  0  0  0] (Indices: [6, 7, 8, 11, 12, 14, 16]), Candidate: [ 2  1  1  0  1  2  1  0  0  1  1  1  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0 -1  0  0  1  0  0 -1  1 -1  0  0  0] (Indices: [6, 7, 8, 12, 13, 14, 16]), Candidate: [ 2  1  1  0  1  2  1  0  0  1  0  2  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0 -1  0  0  0  1 -1  0  1  0  0 -1  0] (Indices: [6, 7, 8, 13, 16, 17, 18]), Candidate: [2 1 1 0 1 2 1 0 0 1 0 1 2 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 74450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  1  0 -1  1  0 -1  0  0  1 -1  0  0] (Indices: [6, 7, 9, 10, 12, 13, 17]), Candidate: [ 2  1  1  0  1  2  1 -1  2  1 -1  2  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 74500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  1  0 -1  0  0  0  0  1  0 -1  1 -1] (Indices: [6, 7, 9, 10, 16, 17, 19]), Candidate: [ 2  1  1  0  1  2  1 -1  2  1 -1  1  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 74550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  1 -1  1 -1  0  0  1  0 -1  1 -1  0] (Indices: [6, 7, 9, 11, 15, 16, 18]), Candidate: [ 2  1  1  0  1  2  1 -1  2  0  1  0  1  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  1 -1  0  0  1  0 -1  1 -1  0  1 -1] (Indices: [6, 7, 9, 13, 14, 16, 19]), Candidate: [ 2  1  1  0  1  2  1 -1  2  0  0  1  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 74650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  0  1  0 -1  1  0  0 -1  0  0  0  0] (Indices: [6, 7, 10, 11, 13, 14, 15]), Candidate: [ 2  1  1  0  1  2  1 -1  1  2  0  0  2  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  0  1 -1  1 -1  1  0  0 -1  0  0  0] (Indices: [6, 7, 10, 12, 14, 15, 16]), Candidate: [ 2  1  1  0  1  2  1 -1  1  2 -1  2  0  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 74750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  0  1 -1  0  0  0  1  0  0  0 -1  0] (Indices: [6, 7, 10, 15, 16, 17, 18]), Candidate: [ 2  1  1  0  1  2  1 -1  1  2 -1  1  1  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 74800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  0  0  1 -1  1 -1  1  0  0 -1  0  0] (Indices: [6, 7, 11, 13, 15, 16, 17]), Candidate: [ 2  1  1  0  1  2  1 -1  1  1  1  0  2  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  0  0  0  1 -1  1  0 -1  0  1  0 -1] (Indices: [6, 7, 12, 14, 15, 18, 19]), Candidate: [ 2  1  1  0  1  2  1 -1  1  1  0  2  0  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1  0  0  0 -1  0  0  1 -1  1 -1  0  0] (Indices: [6, 8, 9, 10, 11, 15, 17]), Candidate: [2 1 1 0 1 2 0 1 1 1 0 0 1 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 74950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1  0  0 -1  0  0  1 -1  1 -1  1 -1  0] (Indices: [6, 8, 9, 10, 14, 16, 18]), Candidate: [ 2  1  1  0  1  2  0  1  1  1 -1  1  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 75000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1  0 -1  1 -1  1 -1  0  0  0  1  0 -1] (Indices: [6, 8, 9, 11, 13, 18, 19]), Candidate: [2 1 1 0 1 2 0 1 1 0 1 0 2 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 75050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1  0 -1  0  1 -1  0  1 -1  1 -1  1 -1] (Indices: [6, 8, 9, 12, 15, 17, 19]), Candidate: [2 1 1 0 1 2 0 1 1 0 0 2 0 1 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 75100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1 -1  1  0  0 -1  1 -1  0  0  1 -1  0] (Indices: [6, 8, 10, 11, 12, 14, 18]), Candidate: [ 2  1  1  0  1  2  0  1  0  2  0  1  0  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1 -1  1 -1  1  0  0 -1  0  0  1 -1  0] (Indices: [6, 8, 10, 12, 13, 14, 18]), Candidate: [ 2  1  1  0  1  2  0  1  0  2 -1  2  1  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 75200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1 -1  1 -1  0  1 -1  0  1 -1  1  0 -1] (Indices: [6, 8, 10, 13, 16, 18, 19]), Candidate: [ 2  1  1  0  1  2  0  1  0  2 -1  1  2  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1 -1  0  1  0 -1  0  0  1 -1  1  0 -1] (Indices: [6, 8, 11, 12, 16, 18, 19]), Candidate: [2 1 1 0 1 2 0 1 0 1 1 1 0 1 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 75300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1 -1  0  0  1  0 -1  1 -1  1  0 -1  0] (Indices: [6, 8, 12, 13, 15, 17, 18]), Candidate: [2 1 1 0 1 2 0 1 0 1 0 2 1 0 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 75350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  1  0  0  0 -1  1 -1  1 -1  0  0  0] (Indices: [6, 9, 10, 11, 12, 14, 16]), Candidate: [ 2  1  1  0  1  2  0  0  2  1  0  1  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  1  0 -1  1  0  0 -1  1 -1  0  0  0] (Indices: [6, 9, 10, 12, 13, 14, 16]), Candidate: [ 2  1  1  0  1  2  0  0  2  1 -1  2  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 75450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  1  0 -1  0  1 -1  0  1  0  0 -1  0] (Indices: [6, 9, 10, 13, 16, 17, 18]), Candidate: [ 2  1  1  0  1  2  0  0  2  1 -1  1  2  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  1 -1  1  0 -1  0  0  1  0  0 -1  0] (Indices: [6, 9, 11, 12, 16, 17, 18]), Candidate: [2 1 1 0 1 2 0 0 2 0 1 1 0 1 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 75550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  1 -1  0  1  0 -1  1  0 -1  1 -1  0] (Indices: [6, 9, 12, 13, 15, 16, 18]), Candidate: [2 1 1 0 1 2 0 0 2 0 0 2 1 0 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 75600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  0  1  0  0  0 -1  1  0 -1  0  0  0] (Indices: [6, 10, 11, 12, 13, 15, 16]), Candidate: [2 1 1 0 1 2 0 0 1 2 0 1 1 0 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 75650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  0  1  0 -1  0  1  0  0  0 -1  0  0] (Indices: [6, 10, 11, 14, 15, 16, 17]), Candidate: [2 1 1 0 1 2 0 0 1 2 0 0 1 2 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 75700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  0  1 -1  0  1  0  0  0  0 -1  0  0] (Indices: [6, 10, 13, 14, 15, 16, 17]), Candidate: [ 2  1  1  0  1  2  0  0  1  2 -1  1  2  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  0  0  1  0 -1  1 -1  0  1  0  0 -1] (Indices: [6, 11, 12, 14, 17, 18, 19]), Candidate: [ 2  1  1  0  1  2  0  0  1  1  1  1  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  0  0  0  0  1  0  0  0 -1  1  0 -1] (Indices: [6, 13, 14, 15, 16, 18, 19]), Candidate: [2 1 1 0 1 2 0 0 1 1 0 1 2 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 75850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0  0  0 -1  1 -1  0  0  1 -1  0  1 -1] (Indices: [7, 8, 9, 10, 12, 16, 19]), Candidate: [ 2  1  1  0  1  1  2  0  1  1 -1  2  0  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0  0 -1  1  0 -1  0  1  0 -1  0  0  0] (Indices: [7, 8, 9, 11, 12, 15, 16]), Candidate: [2 1 1 0 1 1 2 0 1 0 1 1 0 1 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 75950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0  0 -1  0  1  0 -1  1  0 -1  0  0  0] (Indices: [7, 8, 9, 12, 13, 15, 16]), Candidate: [2 1 1 0 1 1 2 0 1 0 0 2 1 0 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 76000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0  0 -1  0  0  0  1  0  0  0 -1  0  0] (Indices: [7, 8, 9, 14, 15, 16, 17]), Candidate: [2 1 1 0 1 1 2 0 1 0 0 1 1 2 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 76050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0 -1  1  0 -1  1 -1  0  0  0  1  0 -1] (Indices: [7, 8, 10, 11, 13, 18, 19]), Candidate: [2 1 1 0 1 1 2 0 0 2 0 0 2 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 76100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0 -1  1 -1  1 -1  0  1 -1  1 -1  1 -1] (Indices: [7, 8, 10, 12, 15, 17, 19]), Candidate: [ 2  1  1  0  1  1  2  0  0  2 -1  2  0  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0 -1  0  1  0  0 -1  0  1  0 -1  0  0] (Indices: [7, 8, 11, 12, 13, 16, 17]), Candidate: [2 1 1 0 1 1 2 0 0 1 1 1 1 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 76200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0 -1  0  1 -1  0  1  0 -1  1 -1  1 -1] (Indices: [7, 8, 11, 14, 15, 17, 19]), Candidate: [2 1 1 0 1 1 2 0 0 1 1 0 1 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 76250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0 -1  0  0  0  1  0  0 -1  1 -1  1 -1] (Indices: [7, 8, 13, 14, 15, 17, 19]), Candidate: [2 1 1 0 1 1 2 0 0 1 0 1 2 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 76300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  1  0  0 -1  1 -1  0  0  1  0 -1  0] (Indices: [7, 9, 10, 11, 13, 17, 18]), Candidate: [ 2  1  1  0  1  1  2 -1  2  1  0  0  2  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  1  0 -1  1 -1  0  1  0 -1  0  1 -1] (Indices: [7, 9, 10, 12, 15, 16, 19]), Candidate: [ 2  1  1  0  1  1  2 -1  2  1 -1  2  0  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 76400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  1 -1  1  0  0 -1  1 -1  0  1 -1  0] (Indices: [7, 9, 11, 12, 13, 15, 18]), Candidate: [ 2  1  1  0  1  1  2 -1  2  0  1  1  1  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  1 -1  1 -1  0  1  0  0 -1  0  1 -1] (Indices: [7, 9, 11, 14, 15, 16, 19]), Candidate: [ 2  1  1  0  1  1  2 -1  2  0  1  0  1  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  1 -1  0  0  1  0  0  0 -1  0  1 -1] (Indices: [7, 9, 13, 14, 15, 16, 19]), Candidate: [ 2  1  1  0  1  1  2 -1  2  0  0  1  2  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  0  1  0  0 -1  0  0  1  0  0 -1  0] (Indices: [7, 10, 11, 12, 16, 17, 18]), Candidate: [ 2  1  1  0  1  1  2 -1  1  2  0  1  0  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  0  1 -1  1  0 -1  1  0 -1  1 -1  0] (Indices: [7, 10, 12, 13, 15, 16, 18]), Candidate: [ 2  1  1  0  1  1  2 -1  1  2 -1  2  1  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 76650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  0  0  1  0  0  0 -1  1 -1  1 -1  0] (Indices: [7, 11, 12, 13, 14, 16, 18]), Candidate: [ 2  1  1  0  1  1  2 -1  1  1  1  1  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 76700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  0  0  1 -1  0  0  1  0  0  0  0 -1] (Indices: [7, 11, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  1  1  2 -1  1  1  1  0  1  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1  0  0  0 -1  1  0  0 -1  0  0  0  0] (Indices: [8, 9, 10, 11, 13, 14, 15]), Candidate: [2 1 1 0 1 1 1 1 1 1 0 0 2 1 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 76800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1  0  0 -1  1 -1  1  0  0 -1  0  0  0] (Indices: [8, 9, 10, 12, 14, 15, 16]), Candidate: [ 2  1  1  0  1  1  1  1  1  1 -1  2  0  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1  0  0 -1  0  0  0  1  0  0  0 -1  0] (Indices: [8, 9, 10, 15, 16, 17, 18]), Candidate: [ 2  1  1  0  1  1  1  1  1  1 -1  1  1  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1  0 -1  1 -1  1 -1  1  0  0 -1  0  0] (Indices: [8, 9, 11, 13, 15, 16, 17]), Candidate: [2 1 1 0 1 1 1 1 1 0 1 0 2 0 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 76950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1  0 -1  0  1 -1  1  0 -1  0  1  0 -1] (Indices: [8, 9, 12, 14, 15, 18, 19]), Candidate: [2 1 1 0 1 1 1 1 1 0 0 2 0 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 77000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1 -1  1  0  0 -1  1 -1  1  0 -1  0  0] (Indices: [8, 10, 11, 12, 14, 16, 17]), Candidate: [ 2  1  1  0  1  1  1  1  0  2  0  1  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1 -1  1  0 -1  0  0  0  1  0  0  0 -1] (Indices: [8, 10, 11, 16, 17, 18, 19]), Candidate: [2 1 1 0 1 1 1 1 0 2 0 0 1 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 77100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1 -1  1 -1  0  1 -1  0  1  0  0  0 -1] (Indices: [8, 10, 13, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  1  1  1  1  0  2 -1  1  2  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1 -1  0  1 -1  1  0 -1  1 -1  1  0 -1] (Indices: [8, 11, 13, 14, 16, 18, 19]), Candidate: [ 2  1  1  0  1  1  1  1  0  1  1  0  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  1  0  0  0  0 -1  0  1  0 -1  0  0] (Indices: [9, 10, 11, 12, 13, 16, 17]), Candidate: [2 1 1 0 1 1 1 0 2 1 0 1 1 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 77250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  1  0  0 -1  0  1  0 -1  1 -1  1 -1] (Indices: [9, 10, 11, 14, 15, 17, 19]), Candidate: [2 1 1 0 1 1 1 0 2 1 0 0 1 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 77300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  1  0 -1  0  1  0  0 -1  1 -1  1 -1] (Indices: [9, 10, 13, 14, 15, 17, 19]), Candidate: [ 2  1  1  0  1  1  1  0  2  1 -1  1  2  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  1 -1  1  0 -1  0  1 -1  1  0  0 -1] (Indices: [9, 11, 12, 15, 17, 18, 19]), Candidate: [2 1 1 0 1 1 1 0 2 0 1 1 0 1 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 77400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  1 -1  0  0  0  1  0  0  0  0  0 -1] (Indices: [9, 14, 15, 16, 17, 18, 19]), Candidate: [2 1 1 0 1 1 1 0 2 0 0 1 1 2 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 77450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0  1  0 -1  1 -1  0  1  0  0  0 -1] (Indices: [10, 11, 13, 16, 17, 18, 19]), Candidate: [2 1 1 0 1 1 1 0 1 2 0 0 2 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 77500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0  0  1  0 -1  1  0  0  0  0 -1  0] (Indices: [11, 12, 14, 15, 16, 17, 18]), Candidate: [2 1 1 0 1 1 1 0 1 1 1 1 0 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Finished generating neighbors. Total valid neighbors found: 25688
  Size of neighborhood t=7: 25688
  Using 'fork' start method for multiprocessing.
  No improvement found for t=7 after processing 25688 neighbors.
No improving solution found or error occurred for t=7.

Attempting neighborhood t=8 (current best cost: 98.4663)
  Exploring neighborhood t=8 in parallel (current cost: 98.4663)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Attempt 50: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  0  1 -1  0  0  1 -1  0  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 5, 10, 14]), Candidate: [ 2  1  1  0  1  0  1  0  1  2 -1  1  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  0  0  0  0  0  0  0  1 -1  0  0  1] (Indices: [0, 1, 2, 3, 4, 6, 7, 16]), Candidate: [ 2  1  1  0  0  2  1 -1  1  1  0  1  1  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  0  0  0  0  1 -1  1 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 6, 13, 15]), Candidate: [2 1 1 0 0 2 0 0 1 1 0 1 2 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  0  0  1  0 -1  0  0  0  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 7, 11, 12]), Candidate: [ 2  1  1  0  0  1  2 -1  1  1  1  1  0  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1 -1  1 -1  0  0  0  1 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 8, 10, 15]), Candidate: [ 2  1  1  0  0  1  1  1  0  2 -1  1  1  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  1 -1  1  0 -1  0  0  0  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 9, 11, 12]), Candidate: [2 1 1 0 0 1 1 0 2 0 1 1 0 1 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  0  1 -1  1 -1  0  0  0  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 10, 12, 19]), Candidate: [ 2  1  1  0  0  1  1  0  1  2 -1  2  0  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  0  0  0  1  0  0 -1  0  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 12, 13, 14]), Candidate: [ 2  1  1  0  0  1  1  0  1  1  0  2  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  0  0  0  0  0  0  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 15, 17, 19]), Candidate: [2 1 1 0 0 1 1 0 1 1 0 1 1 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  0  0  1 -1  0  1 -1  0  0  0  0  1] (Indices: [0, 1, 2, 3, 5, 6, 11, 14]), Candidate: [ 2  1  1 -1  2  1  0  0  1  1  1  0  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  1 -1  0  0  0  0  1 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 5, 7, 9, 15]), Candidate: [ 2  1  1 -1  2  0  2 -1  2  0  0  1  1  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1  0  0 -1  0  0  0  0  0  0  0  0  1] (Indices: [0, 1, 2, 3, 5, 8, 9, 10]), Candidate: [ 2  1  1 -1  2  0  1  1  1  1 -1  1  1  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1 -1  0  0  0  0  0  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 3, 5, 8, 16, 18]), Candidate: [ 2  1  1 -1  2  0  1  1  0  1  0  1  1  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  0  1  0  0 -1  0  0  0  0  0  0  1] (Indices: [0, 1, 2, 3, 5, 10, 11, 12]), Candidate: [ 2  1  1 -1  2  0  1  0  1  2  0  1  0  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  0  0  1 -1  0  1 -1  1 -1  0  0  1] (Indices: [0, 1, 2, 3, 5, 11, 14, 16]), Candidate: [ 2  1  1 -1  2  0  1  0  1  1  1  0  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  0  0  0  0  0  1  0  0 -1  0  0  1] (Indices: [0, 1, 2, 3, 5, 14, 15, 16]), Candidate: [ 2  1  1 -1  2  0  1  0  1  1  0  1  1  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  0  0  1  0 -1  0  0  0  0  0  0  1] (Indices: [0, 1, 2, 3, 6, 7, 11, 12]), Candidate: [ 2  1  1 -1  1  2  1 -1  1  1  1  1  0  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1 -1  1 -1  0  0  0  1 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 6, 8, 10, 15]), Candidate: [ 2  1  1 -1  1  2  0  1  0  2 -1  1  1  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  1 -1  1  0 -1  0  0  0  0  0  0  1] (Indices: [0, 1, 2, 3, 6, 9, 11, 12]), Candidate: [ 2  1  1 -1  1  2  0  0  2  0  1  1  0  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  0  1 -1  1 -1  0  0  0  0  0  1  0] (Indices: [0, 1, 2, 3, 6, 10, 12, 19]), Candidate: [ 2  1  1 -1  1  2  0  0  1  2 -1  2  0  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  0  0  0  1  0  0 -1  0  0  0  0  1] (Indices: [0, 1, 2, 3, 6, 12, 13, 14]), Candidate: [ 2  1  1 -1  1  2  0  0  1  1  0  2  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  0  0  0  0  0  0  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 6, 15, 17, 19]), Candidate: [ 2  1  1 -1  1  2  0  0  1  1  0  1  1  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0 -1  0  0  0  0  1 -1  0  0  0  1  0] (Indices: [0, 1, 2, 3, 7, 8, 14, 19]), Candidate: [ 2  1  1 -1  1  1  2  0  0  1  0  1  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  1 -1  0  0  0  0  0  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 7, 9, 16, 17]), Candidate: [ 2  1  1 -1  1  1  2 -1  2  0  0  1  1  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  0  0  1 -1  1 -1  1 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 7, 11, 13, 15]), Candidate: [ 2  1  1 -1  1  1  2 -1  1  1  1  0  2  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  0  0  0  0  1 -1  0  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 7, 13, 16, 17]), Candidate: [ 2  1  1 -1  1  1  2 -1  1  1  0  1  2  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1  0 -1  0  0  1  0 -1  0  0  0  0  1] (Indices: [0, 1, 2, 3, 8, 9, 13, 14]), Candidate: [ 2  1  1 -1  1  1  1  1  1  0  0  1  2  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1 -1  1 -1  0  0  0  1 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 8, 10, 15, 19]), Candidate: [ 2  1  1 -1  1  1  1  1  0  2 -1  1  1  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1 -1  0  0  1 -1  0  0  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 8, 12, 16, 17]), Candidate: [ 2  1  1 -1  1  1  1  1  0  1  0  2  0  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  1  0 -1  1 -1  1 -1  0  0  0  0  1] (Indices: [0, 1, 2, 3, 9, 10, 12, 14]), Candidate: [ 2  1  1 -1  1  1  1  0  2  1 -1  2  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 1550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  1 -1  1 -1  0  0  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 3, 9, 11, 16, 18]), Candidate: [ 2  1  1 -1  1  1  1  0  2  0  1  0  1  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  1 -1  0  0  0  1 -1  0  0  1  0  0] (Indices: [0, 1, 2, 3, 9, 14, 18, 19]), Candidate: [ 2  1  1 -1  1  1  1  0  2  0  0  1  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  0  1 -1  1 -1  0  1  0 -1  0  0  1] (Indices: [0, 1, 2, 3, 10, 12, 15, 16]), Candidate: [ 2  1  1 -1  1  1  1  0  1  2 -1  2  0  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  0  0  1  0  0 -1  0  0  0  0  1  0] (Indices: [0, 1, 2, 3, 11, 12, 13, 19]), Candidate: [ 2  1  1 -1  1  1  1  0  1  1  1  1  1  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  0  0  1 -1  0  0  0  0  1  0  0  0] (Indices: [0, 1, 2, 3, 11, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  1  1  0  1  1  1  0  1  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  0  0  0  0  1 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 13, 15, 17, 19]), Candidate: [ 2  1  1 -1  1  1  1  0  1  1  0  1  2  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  1 -1  0  0  0  0  0  1 -1  0  0  1] (Indices: [0, 1, 2, 4, 5, 6, 9, 16]), Candidate: [2 1 0 1 1 1 0 0 2 0 0 1 1 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 1900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0 -1  1 -1  0  0  0  0  0  0  0  0  1] (Indices: [0, 1, 2, 4, 5, 7, 8, 10]), Candidate: [ 2  1  0  1  1  0  2  0  0  2 -1  1  1  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  0  0  0  0  0  1  0 -1  0  0  0  1] (Indices: [0, 1, 2, 4, 5, 7, 14, 15]), Candidate: [ 2  1  0  1  1  0  2 -1  1  1  0  1  1  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1 -1  0  0  0  1 -1  1 -1  0  0  0  1] (Indices: [0, 1, 2, 4, 5, 8, 13, 15]), Candidate: [2 1 0 1 1 0 1 1 0 1 0 1 2 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 2050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  1 -1  0  0  0  1  0 -1  0  0  0  1] (Indices: [0, 1, 2, 4, 5, 9, 14, 15]), Candidate: [2 1 0 1 1 0 1 0 2 0 0 1 1 2 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 2100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  0  1 -1  0  0  0  0  0  0  1  0  0] (Indices: [0, 1, 2, 4, 5, 10, 18, 19]), Candidate: [ 2  1  0  1  1  0  1  0  1  2 -1  1  1  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  0  0  0  0  1  0  0 -1  0  0  0  1] (Indices: [0, 1, 2, 4, 5, 13, 14, 15]), Candidate: [2 1 0 1 1 0 1 0 1 1 0 1 2 1 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 2200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  1 -1  0  0  0  1 -1  0  0  0  0  1] (Indices: [0, 1, 2, 4, 6, 7, 9, 14]), Candidate: [ 2  1  0  1  0  2  1 -1  2  0  0  1  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  0  0  0  0  0  0  0  0  0  1  0  0] (Indices: [0, 1, 2, 4, 6, 7, 18, 19]), Candidate: [ 2  1  0  1  0  2  1 -1  1  1  0  1  1  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1 -1  0  0  0  0  0  0  1  0 -1  0  1] (Indices: [0, 1, 2, 4, 6, 8, 16, 17]), Candidate: [2 1 0 1 0 2 0 1 0 1 0 1 1 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 2350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  1 -1  0  0  0  0  0  0  0  1  0  0] (Indices: [0, 1, 2, 4, 6, 9, 18, 19]), Candidate: [2 1 0 1 0 2 0 0 2 0 0 1 1 1 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 2400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  0  0  1 -1  0  1  0 -1  0  0  0  1] (Indices: [0, 1, 2, 4, 6, 11, 14, 15]), Candidate: [2 1 0 1 0 2 0 0 1 1 1 0 1 2 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 2450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  0  0  0  0  1 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 4, 6, 13, 18, 19]), Candidate: [2 1 0 1 0 2 0 0 1 1 0 1 2 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 2500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0 -1  0  0  1 -1  0  1 -1  0  0  0  1] (Indices: [0, 1, 2, 4, 7, 8, 12, 15]), Candidate: [2 1 0 1 0 1 2 0 0 1 0 2 0 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 2550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  1 -1  0  0  1  0 -1  0  0  0  0  1] (Indices: [0, 1, 2, 4, 7, 9, 13, 14]), Candidate: [ 2  1  0  1  0  1  2 -1  2  0  0  1  2  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  0  1 -1  0  0  0  1 -1  0  0  1  0] (Indices: [0, 1, 2, 4, 7, 10, 15, 19]), Candidate: [ 2  1  0  1  0  1  2 -1  1  2 -1  1  1  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  0  0  0  1 -1  0  0  1  0 -1  0  1] (Indices: [0, 1, 2, 4, 7, 12, 16, 17]), Candidate: [ 2  1  0  1  0  1  2 -1  1  1  0  2  0  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1  0 -1  1  0 -1  0  0  0  0  0  0  1] (Indices: [0, 1, 2, 4, 8, 9, 11, 12]), Candidate: [2 1 0 1 0 1 1 1 1 0 1 1 0 1 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 2750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1 -1  1 -1  1 -1  0  0  0  0  0  1  0] (Indices: [0, 1, 2, 4, 8, 10, 12, 19]), Candidate: [ 2  1  0  1  0  1  1  1  0  2 -1  2  0  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1 -1  0  0  1  0  0 -1  0  0  0  0  1] (Indices: [0, 1, 2, 4, 8, 12, 13, 14]), Candidate: [ 2  1  0  1  0  1  1  1  0  1  0  2  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1 -1  0  0  0  0  0  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 4, 8, 15, 17, 19]), Candidate: [2 1 0 1 0 1 1 1 0 1 0 1 1 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 2900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  1 -1  1 -1  1 -1  1 -1  0  0  0  1] (Indices: [0, 1, 2, 4, 9, 11, 13, 15]), Candidate: [2 1 0 1 0 1 1 0 2 0 1 0 2 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 2950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  1 -1  0  0  1 -1  0  1  0 -1  0  1] (Indices: [0, 1, 2, 4, 9, 13, 16, 17]), Candidate: [2 1 0 1 0 1 1 0 2 0 0 1 2 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 3000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  0  1  0 -1  0  0  0  1 -1  0  1  0] (Indices: [0, 1, 2, 4, 10, 11, 16, 19]), Candidate: [2 1 0 1 0 1 1 0 1 2 0 0 1 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 3050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  0  1 -1  0  0  0  1  0  0 -1  0  1] (Indices: [0, 1, 2, 4, 10, 15, 16, 17]), Candidate: [ 2  1  0  1  0  1  1  0  1  2 -1  1  1  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  0  0  1 -1  0  1 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 4, 11, 14, 16, 17]), Candidate: [ 2  1  0  1  0  1  1  0  1  1  1  0  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  0  0  0  1 -1  0  0  0  1  0  0  0] (Indices: [0, 1, 2, 4, 12, 17, 18, 19]), Candidate: [2 1 0 1 0 1 1 0 1 1 0 2 0 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 3200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  1 -1  0  0  1 -1  0  0  0  0  0  1] (Indices: [0, 1, 2, 5, 6, 7, 9, 13]), Candidate: [ 2  1  0  0  2  1  1 -1  2  0  0  1  2  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  0  0  0  0  0  0  0  0  1 -1  1  0] (Indices: [0, 1, 2, 5, 6, 7, 17, 19]), Candidate: [ 2  1  0  0  2  1  1 -1  1  1  0  1  1  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1 -1  0  0  0  0  0  1 -1  0  0  1  0] (Indices: [0, 1, 2, 5, 6, 8, 15, 19]), Candidate: [2 1 0 0 2 1 0 1 0 1 0 1 1 1 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 3350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  1 -1  0  0  0  0  0  0  1 -1  1  0] (Indices: [0, 1, 2, 5, 6, 9, 17, 19]), Candidate: [2 1 0 0 2 1 0 0 2 0 0 1 1 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 3400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  0  0  1 -1  1 -1  0  0  0  0  1  0] (Indices: [0, 1, 2, 5, 6, 11, 13, 19]), Candidate: [2 1 0 0 2 1 0 0 1 1 1 0 2 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 3450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  0  0  0  0  1 -1  0  0  1 -1  1  0] (Indices: [0, 1, 2, 5, 6, 13, 17, 19]), Candidate: [2 1 0 0 2 1 0 0 1 1 0 1 2 0 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 3500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0 -1  0  0  1 -1  1 -1  0  0  0  0  1] (Indices: [0, 1, 2, 5, 7, 8, 12, 14]), Candidate: [ 2  1  0  0  2  0  2  0  0  1  0  2  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  1 -1  0  1 -1  0  0  0  0  0  1  0] (Indices: [0, 1, 2, 5, 7, 9, 12, 19]), Candidate: [ 2  1  0  0  2  0  2 -1  2  0  0  2  0  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  0  1 -1  0  0  0  1 -1  0  1 -1  1] (Indices: [0, 1, 2, 5, 7, 10, 15, 18]), Candidate: [ 2  1  0  0  2  0  2 -1  1  2 -1  1  1  1  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  0  0  0  1 -1  0  1 -1  0  0  1  0] (Indices: [0, 1, 2, 5, 7, 12, 15, 19]), Candidate: [ 2  1  0  0  2  0  2 -1  1  1  0  2  0  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1  0  0 -1  0  0  0  0  0  0  0  1  0] (Indices: [0, 1, 2, 5, 8, 9, 10, 19]), Candidate: [ 2  1  0  0  2  0  1  1  1  1 -1  1  1  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1 -1  1 -1  1 -1  0  0  0  0  1 -1  1] (Indices: [0, 1, 2, 5, 8, 10, 12, 18]), Candidate: [ 2  1  0  0  2  0  1  1  0  2 -1  2  0  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1 -1  0  1 -1  0  0  0  0  0  1  0  0] (Indices: [0, 1, 2, 5, 8, 11, 18, 19]), Candidate: [2 1 0 0 2 0 1 1 0 1 1 0 1 1 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 3850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1 -1  0  0  0  0  0  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 5, 8, 15, 17, 18]), Candidate: [2 1 0 0 2 0 1 1 0 1 0 1 1 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 3900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  1 -1  1 -1  1  0 -1  0  0  0  0  1] (Indices: [0, 1, 2, 5, 9, 11, 13, 14]), Candidate: [ 2  1  0  0  2  0  1  0  2  0  1  0  2  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  1 -1  0  0  1 -1  1 -1  0  0  1  0] (Indices: [0, 1, 2, 5, 9, 13, 15, 19]), Candidate: [2 1 0 0 2 0 1 0 2 0 0 1 2 0 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 4000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  0  1  0 -1  0  0  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 5, 10, 11, 16, 18]), Candidate: [2 1 0 0 2 0 1 0 1 2 0 0 1 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 4050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  0  1 -1  0  0  1 -1  0  0  1  0  0] (Indices: [0, 1, 2, 5, 10, 14, 18, 19]), Candidate: [ 2  1  0  0  2  0  1  0  1  2 -1  1  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  0  0  1 -1  0  1  0 -1  0  0  1  0] (Indices: [0, 1, 2, 5, 11, 14, 15, 19]), Candidate: [2 1 0 0 2 0 1 0 1 1 1 0 1 2 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 4150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  0  0  0  1 -1  0  0  1 -1  1  0  0] (Indices: [0, 1, 2, 5, 12, 16, 18, 19]), Candidate: [2 1 0 0 2 0 1 0 1 1 0 2 0 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 4200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0 -1  1 -1  0  0  1 -1  0  0  0  0  1] (Indices: [0, 1, 2, 6, 7, 8, 10, 14]), Candidate: [ 2  1  0  0  1  2  1  0  0  2 -1  1  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  1  0 -1  0  0  0  0  0  0  0  1  0] (Indices: [0, 1, 2, 6, 7, 9, 10, 19]), Candidate: [ 2  1  0  0  1  2  1 -1  2  1 -1  1  1  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  0  1 -1  1 -1  0  0  0  0  1 -1  1] (Indices: [0, 1, 2, 6, 7, 10, 12, 18]), Candidate: [ 2  1  0  0  1  2  1 -1  1  2 -1  2  0  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  0  0  1 -1  0  0  0  0  0  1  0  0] (Indices: [0, 1, 2, 6, 7, 11, 18, 19]), Candidate: [ 2  1  0  0  1  2  1 -1  1  1  1  0  1  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  0  0  0  0  0  0  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 6, 7, 15, 17, 18]), Candidate: [ 2  1  0  0  1  2  1 -1  1  1  0  1  1  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1  0 -1  0  0  0  0  0  0  1 -1  1  0] (Indices: [0, 1, 2, 6, 8, 9, 17, 19]), Candidate: [2 1 0 0 1 2 0 1 1 0 0 1 1 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 4500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1 -1  0  1 -1  1 -1  0  0  0  0  1  0] (Indices: [0, 1, 2, 6, 8, 11, 13, 19]), Candidate: [2 1 0 0 1 2 0 1 0 1 1 0 2 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 4550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1 -1  0  0  0  1 -1  0  0  1 -1  1  0] (Indices: [0, 1, 2, 6, 8, 13, 17, 19]), Candidate: [2 1 0 0 1 2 0 1 0 1 0 1 2 0 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 4600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  1  0 -1  0  0  0  1 -1  0  1 -1  1] (Indices: [0, 1, 2, 6, 9, 10, 15, 18]), Candidate: [ 2  1  0  0  1  2  0  0  2  1 -1  1  1  1  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  1 -1  0  1 -1  0  1 -1  0  0  1  0] (Indices: [0, 1, 2, 6, 9, 12, 15, 19]), Candidate: [2 1 0 0 1 2 0 0 2 0 0 2 0 1 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 4700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  0  1  0 -1  1 -1  1 -1  0  0  0  1] (Indices: [0, 1, 2, 6, 10, 11, 13, 15]), Candidate: [2 1 0 0 1 2 0 0 1 2 0 0 2 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 4750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  0  1 -1  0  1 -1  0  1  0 -1  0  1] (Indices: [0, 1, 2, 6, 10, 13, 16, 17]), Candidate: [ 2  1  0  0  1  2  0  0  1  2 -1  1  2  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  0  0  1 -1  1  0 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 6, 11, 13, 14, 18]), Candidate: [ 2  1  0  0  1  2  0  0  1  1  1  0  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  0  0  0  1 -1  1  0 -1  0  0  1  0] (Indices: [0, 1, 2, 6, 12, 14, 15, 19]), Candidate: [2 1 0 0 1 2 0 0 1 1 0 2 0 2 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 4900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  0  0  0  0  0  0  1 -1  1  0  0  0] (Indices: [0, 1, 2, 6, 15, 17, 18, 19]), Candidate: [2 1 0 0 1 2 0 0 1 1 0 1 1 1 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 4950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0 -1  1  0 -1  0  0  1 -1  0  0  0  1] (Indices: [0, 1, 2, 7, 8, 10, 11, 15]), Candidate: [2 1 0 0 1 1 2 0 0 2 0 0 1 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 5000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0 -1  0  1 -1  0  1 -1  0  0  0  1  0] (Indices: [0, 1, 2, 7, 8, 11, 14, 19]), Candidate: [ 2  1  0  0  1  1  2  0  0  1  1  0  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0 -1  0  0  0  0  1  0 -1  0  0  1  0] (Indices: [0, 1, 2, 7, 8, 14, 15, 19]), Candidate: [2 1 0 0 1 1 2 0 0 1 0 1 1 2 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 5100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  1  0 -1  0  0  0  0  0  1  0 -1  1] (Indices: [0, 1, 2, 7, 9, 10, 17, 18]), Candidate: [ 2  1  0  0  1  1  2 -1  2  1 -1  1  1  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  1 -1  0  1 -1  0  0  0  1 -1  1  0] (Indices: [0, 1, 2, 7, 9, 12, 17, 19]), Candidate: [ 2  1  0  0  1  1  2 -1  2  0  0  2  0  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  0  1  0 -1  0  1  0 -1  0  0  0  1] (Indices: [0, 1, 2, 7, 10, 11, 14, 15]), Candidate: [ 2  1  0  0  1  1  2 -1  1  2  0  0  1  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  0  1 -1  0  1 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 7, 10, 13, 18, 19]), Candidate: [ 2  1  0  0  1  1  2 -1  1  2 -1  1  2  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  0  0  1 -1  1 -1  1 -1  0  0  1  0] (Indices: [0, 1, 2, 7, 11, 13, 15, 19]), Candidate: [ 2  1  0  0  1  1  2 -1  1  1  1  0  2  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  0  0  0  1 -1  1 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 7, 12, 14, 17, 19]), Candidate: [ 2  1  0  0  1  1  2 -1  1  1  0  2  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1  0  0  0 -1  0  0  1 -1  0  0  0  1] (Indices: [0, 1, 2, 8, 9, 10, 11, 15]), Candidate: [2 1 0 0 1 1 1 1 1 1 0 0 1 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 5450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1  0 -1  1 -1  0  1 -1  0  0  0  1  0] (Indices: [0, 1, 2, 8, 9, 11, 14, 19]), Candidate: [ 2  1  0  0  1  1  1  1  1  0  1  0  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1  0 -1  0  0  0  1  0 -1  0  0  1  0] (Indices: [0, 1, 2, 8, 9, 14, 15, 19]), Candidate: [2 1 0 0 1 1 1 1 1 0 0 1 1 2 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 5550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1 -1  1 -1  1  0 -1  0  0  0  0  1  0] (Indices: [0, 1, 2, 8, 10, 12, 13, 19]), Candidate: [ 2  1  0  0  1  1  1  1  0  2 -1  2  1  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1 -1  1 -1  0  0  0  0  0  1  0  0  0] (Indices: [0, 1, 2, 8, 10, 17, 18, 19]), Candidate: [ 2  1  0  0  1  1  1  1  0  2 -1  1  1  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1 -1  0  1 -1  0  0  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 8, 11, 15, 17, 18]), Candidate: [2 1 0 0 1 1 1 1 0 1 1 0 1 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 5700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1 -1  0  0  0  1  0 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 8, 13, 14, 17, 19]), Candidate: [ 2  1  0  0  1  1  1  1  0  1  0  1  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  1  0  0 -1  0  0  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 9, 10, 11, 16, 18]), Candidate: [2 1 0 0 1 1 1 0 2 1 0 0 1 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 5800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  1  0 -1  0  0  1 -1  0  0  1  0  0] (Indices: [0, 1, 2, 9, 10, 14, 18, 19]), Candidate: [ 2  1  0  0  1  1  1  0  2  1 -1  1  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  1 -1  1 -1  0  1  0 -1  0  0  1  0] (Indices: [0, 1, 2, 9, 11, 14, 15, 19]), Candidate: [2 1 0 0 1 1 1 0 2 0 1 0 1 2 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 5900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  1 -1  0  1 -1  0  0  1 -1  1  0  0] (Indices: [0, 1, 2, 9, 12, 16, 18, 19]), Candidate: [2 1 0 0 1 1 1 0 2 0 0 2 0 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 5950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  0  1  0  0 -1  0  1 -1  0  1 -1  1] (Indices: [0, 1, 2, 10, 11, 12, 15, 18]), Candidate: [2 1 0 0 1 1 1 0 1 2 0 1 0 1 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 6000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  0  1 -1  1  0 -1  1 -1  0  1 -1  1] (Indices: [0, 1, 2, 10, 12, 13, 15, 18]), Candidate: [ 2  1  0  0  1  1  1  0  1  2 -1  2  1  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  0  1 -1  0  0  1  0  0 -1  0  1  0] (Indices: [0, 1, 2, 10, 14, 15, 16, 19]), Candidate: [ 2  1  0  0  1  1  1  0  1  2 -1  1  1  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  0  0  1 -1  1  0  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 11, 13, 14, 15, 18]), Candidate: [2 1 0 0 1 1 1 0 1 1 1 0 2 1 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 6150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  0  0  0  1  0 -1  0  1  0 -1  1  0] (Indices: [0, 1, 2, 12, 13, 16, 17, 19]), Candidate: [2 1 0 0 1 1 1 0 1 1 0 2 1 0 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 6200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  0  0  0  0  0  0  0  0  0  0  1  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 19]), Candidate: [ 2  0  2  0  1  1  1 -1  1  1  0  1  1  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  0  0  0  0  1 -1  0  0  0  1 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 13, 18]), Candidate: [2 0 2 0 1 1 0 0 1 1 0 1 2 0 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 6300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  0  0  1 -1  0  0  1 -1  0  0  0  1] (Indices: [0, 1, 3, 4, 5, 7, 11, 15]), Candidate: [ 2  0  2  0  1  0  2 -1  1  1  1  0  1  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1 -1  1 -1  0  0  0  0  0  0  1 -1  1] (Indices: [0, 1, 3, 4, 5, 8, 10, 18]), Candidate: [ 2  0  2  0  1  0  1  1  0  2 -1  1  1  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  1 -1  1 -1  0  0  1 -1  0  0  0  1] (Indices: [0, 1, 3, 4, 5, 9, 11, 15]), Candidate: [2 0 2 0 1 0 1 0 2 0 1 0 1 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 6450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  0  1 -1  0  1 -1  0  1 -1  0  0  1] (Indices: [0, 1, 3, 4, 5, 10, 13, 16]), Candidate: [ 2  0  2  0  1  0  1  0  1  2 -1  1  2  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  0  0  0  1  0 -1  0  0  1 -1  0  1] (Indices: [0, 1, 3, 4, 5, 12, 13, 17]), Candidate: [2 0 2 0 1 0 1 0 1 1 0 2 1 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 6550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  0  0  0  0  0  0  0  1  0 -1  1  0] (Indices: [0, 1, 3, 4, 5, 16, 17, 19]), Candidate: [2 0 2 0 1 0 1 0 1 1 0 1 1 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 6600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  0  0  0  0  1 -1  0  1 -1  0  0  1] (Indices: [0, 1, 3, 4, 6, 7, 13, 16]), Candidate: [ 2  0  2  0  0  2  1 -1  1  1  0  1  2  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1 -1  0  0  1 -1  0  0  0  1 -1  0  1] (Indices: [0, 1, 3, 4, 6, 8, 12, 17]), Candidate: [2 0 2 0 0 2 0 1 0 1 0 2 0 1 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 6700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  1 -1  0  0  1 -1  0  1 -1  0  0  1] (Indices: [0, 1, 3, 4, 6, 9, 13, 16]), Candidate: [2 0 2 0 0 2 0 0 2 0 0 1 2 0 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 6750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  0  1 -1  0  0  0  0  1 -1  1 -1  1] (Indices: [0, 1, 3, 4, 6, 10, 16, 18]), Candidate: [ 2  0  2  0  0  2  0  0  1  2 -1  1  1  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  0  0  0  1 -1  0  0  1 -1  0  1  0] (Indices: [0, 1, 3, 4, 6, 12, 16, 19]), Candidate: [2 0 2 0 0 2 0 0 1 1 0 2 0 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 6850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0 -1  1 -1  1 -1  0  0  0  0  0  0  1] (Indices: [0, 1, 3, 4, 7, 8, 10, 12]), Candidate: [ 2  0  2  0  0  1  2  0  0  2 -1  2  0  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  1  0 -1  0  0  0  0  0  1 -1  0  1] (Indices: [0, 1, 3, 4, 7, 9, 10, 17]), Candidate: [ 2  0  2  0  0  1  2 -1  2  1 -1  1  1  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  0  1 -1  1 -1  0  0  1 -1  0  0  1] (Indices: [0, 1, 3, 4, 7, 10, 12, 16]), Candidate: [ 2  0  2  0  0  1  2 -1  1  2 -1  2  0  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  0  0  1 -1  0  0  0  0  1  0 -1  1] (Indices: [0, 1, 3, 4, 7, 11, 17, 18]), Candidate: [ 2  0  2  0  0  1  2 -1  1  1  1  0  1  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  0  0  0  0  0  0  1  0 -1  1 -1  1] (Indices: [0, 1, 3, 4, 7, 15, 16, 18]), Candidate: [ 2  0  2  0  0  1  2 -1  1  1  0  1  1  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1  0 -1  0  0  0  0  0  1 -1  0  1  0] (Indices: [0, 1, 3, 4, 8, 9, 16, 19]), Candidate: [2 0 2 0 0 1 1 1 1 0 0 1 1 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 7150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1 -1  0  1 -1  1 -1  0  0  1 -1  0  1] (Indices: [0, 1, 3, 4, 8, 11, 13, 17]), Candidate: [2 0 2 0 0 1 1 1 0 1 1 0 2 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 7200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1 -1  0  0  0  1 -1  0  1 -1  0  1  0] (Indices: [0, 1, 3, 4, 8, 13, 16, 19]), Candidate: [2 0 2 0 0 1 1 1 0 1 0 1 2 0 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 7250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  1  0 -1  0  0  0  1  0 -1  0  0  1] (Indices: [0, 1, 3, 4, 9, 10, 15, 16]), Candidate: [ 2  0  2  0  0  1  1  0  2  1 -1  1  1  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  1 -1  0  1 -1  0  1 -1  1 -1  0  1] (Indices: [0, 1, 3, 4, 9, 12, 15, 17]), Candidate: [2 0 2 0 0 1 1 0 2 0 0 2 0 1 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 7350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  0  1  0  0 -1  0  0  0  0  0  1  0] (Indices: [0, 1, 3, 4, 10, 11, 12, 19]), Candidate: [2 0 2 0 0 1 1 0 1 2 0 1 0 1 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 7400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  0  1 -1  0  1 -1  1 -1  0  1 -1  1] (Indices: [0, 1, 3, 4, 10, 13, 15, 18]), Candidate: [ 2  0  2  0  0  1  1  0  1  2 -1  1  2  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  0  0  1 -1  1  0 -1  1 -1  0  0  1] (Indices: [0, 1, 3, 4, 11, 13, 14, 16]), Candidate: [ 2  0  2  0  0  1  1  0  1  1  1  0  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  0  0  0  1 -1  1  0 -1  1 -1  0  1] (Indices: [0, 1, 3, 4, 12, 14, 15, 17]), Candidate: [2 0 2 0 0 1 1 0 1 1 0 2 0 2 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 7550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  0  0  0  0  0  0  1  0  0 -1  1  0] (Indices: [0, 1, 3, 4, 15, 16, 17, 19]), Candidate: [2 0 2 0 0 1 1 0 1 1 0 1 1 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 7600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  0  0  0  0  1 -1  1 -1  0  0  0  1] (Indices: [0, 1, 3, 5, 6, 7, 13, 15]), Candidate: [ 2  0  2 -1  2  1  1 -1  1  1  0  1  2  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1 -1  0  0  1 -1  0  0  1 -1  0  0  1] (Indices: [0, 1, 3, 5, 6, 8, 12, 16]), Candidate: [ 2  0  2 -1  2  1  0  1  0  1  0  2  0  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  1 -1  0  0  1 -1  1 -1  0  0  0  1] (Indices: [0, 1, 3, 5, 6, 9, 13, 15]), Candidate: [ 2  0  2 -1  2  1  0  0  2  0  0  1  2  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  0  1 -1  0  0  0  0  1  0 -1  0  1] (Indices: [0, 1, 3, 5, 6, 10, 16, 17]), Candidate: [ 2  0  2 -1  2  1  0  0  1  2 -1  1  1  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  0  0  0  1 -1  0  0  1 -1  1 -1  1] (Indices: [0, 1, 3, 5, 6, 12, 16, 18]), Candidate: [ 2  0  2 -1  2  1  0  0  1  1  0  2  0  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0 -1  1  0 -1  0  0  0  0  0  0  0  1] (Indices: [0, 1, 3, 5, 7, 8, 10, 11]), Candidate: [ 2  0  2 -1  2  0  2  0  0  2  0  0  1  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  1  0 -1  0  0  0  0  1 -1  0  0  1] (Indices: [0, 1, 3, 5, 7, 9, 10, 16]), Candidate: [ 2  0  2 -1  2  0  2 -1  2  1 -1  1  1  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 7950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  0  1 -1  1 -1  0  1 -1  0  0  0  1] (Indices: [0, 1, 3, 5, 7, 10, 12, 15]), Candidate: [ 2  0  2 -1  2  0  2 -1  1  2 -1  2  0  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 8000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  0  0  1 -1  0  0  0  1 -1  0  1  0] (Indices: [0, 1, 3, 5, 7, 11, 16, 19]), Candidate: [ 2  0  2 -1  2  0  2 -1  1  1  1  0  1  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  0  0  0  0  0  0  1  0  0 -1  0  1] (Indices: [0, 1, 3, 5, 7, 15, 16, 17]), Candidate: [ 2  0  2 -1  2  0  2 -1  1  1  0  1  1  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1  0 -1  0  0  0  0  0  1 -1  1 -1  1] (Indices: [0, 1, 3, 5, 8, 9, 16, 18]), Candidate: [ 2  0  2 -1  2  0  1  1  1  0  0  1  1  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1 -1  0  1 -1  1 -1  0  1 -1  0  0  1] (Indices: [0, 1, 3, 5, 8, 11, 13, 16]), Candidate: [ 2  0  2 -1  2  0  1  1  0  1  1  0  2  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1 -1  0  0  0  1 -1  0  1 -1  1 -1  1] (Indices: [0, 1, 3, 5, 8, 13, 16, 18]), Candidate: [ 2  0  2 -1  2  0  1  1  0  1  0  1  2  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  1  0 -1  0  0  1 -1  0  0  0  1  0] (Indices: [0, 1, 3, 5, 9, 10, 14, 19]), Candidate: [ 2  0  2 -1  2  0  1  0  2  1 -1  1  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 8300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  1 -1  0  1 -1  0  1  0 -1  0  0  1] (Indices: [0, 1, 3, 5, 9, 12, 15, 16]), Candidate: [ 2  0  2 -1  2  0  1  0  2  0  0  2  0  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  0  1  0  0 -1  0  0  0  0  1 -1  1] (Indices: [0, 1, 3, 5, 10, 11, 12, 18]), Candidate: [ 2  0  2 -1  2  0  1  0  1  2  0  1  0  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  0  1 -1  0  1 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 3, 5, 10, 13, 15, 17]), Candidate: [ 2  0  2 -1  2  0  1  0  1  2 -1  1  2  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  0  0  1 -1  1  0  0 -1  0  0  0  1] (Indices: [0, 1, 3, 5, 11, 13, 14, 15]), Candidate: [ 2  0  2 -1  2  0  1  0  1  1  1  0  2  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  0  0  0  1 -1  1  0  0 -1  0  0  1] (Indices: [0, 1, 3, 5, 12, 14, 15, 16]), Candidate: [ 2  0  2 -1  2  0  1  0  1  1  0  2  0  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  0  0  0  0  0  0  1  0  0  0 -1  1] (Indices: [0, 1, 3, 5, 15, 16, 17, 18]), Candidate: [ 2  0  2 -1  2  0  1  0  1  1  0  1  1  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0 -1  0  0  0  0  0  1  0 -1  0  0  1] (Indices: [0, 1, 3, 6, 7, 8, 15, 16]), Candidate: [ 2  0  2 -1  1  2  1  0  0  1  0  1  1  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  1 -1  0  0  0  0  0  1 -1  1 -1  1] (Indices: [0, 1, 3, 6, 7, 9, 16, 18]), Candidate: [ 2  0  2 -1  1  2  1 -1  2  0  0  1  1  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  0  0  1 -1  1 -1  0  1 -1  0  0  1] (Indices: [0, 1, 3, 6, 7, 11, 13, 16]), Candidate: [ 2  0  2 -1  1  2  1 -1  1  1  1  0  2  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  0  0  0  0  1 -1  0  1 -1  1 -1  1] (Indices: [0, 1, 3, 6, 7, 13, 16, 18]), Candidate: [ 2  0  2 -1  1  2  1 -1  1  1  0  1  2  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1  0 -1  0  0  1 -1  1 -1  0  0  0  1] (Indices: [0, 1, 3, 6, 8, 9, 13, 15]), Candidate: [ 2  0  2 -1  1  2  0  1  1  0  0  1  2  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1 -1  1 -1  0  0  0  0  1  0 -1  0  1] (Indices: [0, 1, 3, 6, 8, 10, 16, 17]), Candidate: [ 2  0  2 -1  1  2  0  1  0  2 -1  1  1  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1 -1  0  0  1 -1  0  0  1 -1  1 -1  1] (Indices: [0, 1, 3, 6, 8, 12, 16, 18]), Candidate: [ 2  0  2 -1  1  2  0  1  0  1  0  2  0  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  1  0 -1  1 -1  0  1 -1  0  0  0  1] (Indices: [0, 1, 3, 6, 9, 10, 12, 15]), Candidate: [ 2  0  2 -1  1  2  0  0  2  1 -1  2  0  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  1 -1  1 -1  0  0  0  1 -1  0  1  0] (Indices: [0, 1, 3, 6, 9, 11, 16, 19]), Candidate: [ 2  0  2 -1  1  2  0  0  2  0  1  0  1  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  1 -1  0  0  0  0  1  0  0 -1  0  1] (Indices: [0, 1, 3, 6, 9, 15, 16, 17]), Candidate: [ 2  0  2 -1  1  2  0  0  2  0  0  1  1  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  0  1 -1  1 -1  0  1 -1  1 -1  0  1] (Indices: [0, 1, 3, 6, 10, 12, 15, 17]), Candidate: [ 2  0  2 -1  1  2  0  0  1  2 -1  2  0  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  0  0  1  0 -1  1  0 -1  0  0  0  1] (Indices: [0, 1, 3, 6, 11, 12, 14, 15]), Candidate: [ 2  0  2 -1  1  2  0  0  1  1  1  1  0  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  0  0  0  1  0  0  0 -1  0  0  0  1] (Indices: [0, 1, 3, 6, 12, 13, 14, 15]), Candidate: [ 2  0  2 -1  1  2  0  0  1  1  0  2  1  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  0  0  0  0  1 -1  1 -1  0  1  0  0] (Indices: [0, 1, 3, 6, 13, 15, 18, 19]), Candidate: [ 2  0  2 -1  1  2  0  0  1  1  0  1  2  0  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0  0 -1  0  0  0  1  0 -1  0  0  0  1] (Indices: [0, 1, 3, 7, 8, 9, 14, 15]), Candidate: [ 2  0  2 -1  1  1  2  0  1  0  0  1  1  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0 -1  1 -1  0  0  0  0  0  0  1  0  0] (Indices: [0, 1, 3, 7, 8, 10, 18, 19]), Candidate: [ 2  0  2 -1  1  1  2  0  0  2 -1  1  1  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0 -1  0  0  0  1  0  0 -1  0  0  0  1] (Indices: [0, 1, 3, 7, 8, 13, 14, 15]), Candidate: [ 2  0  2 -1  1  1  2  0  0  1  0  1  2  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  1  0 -1  0  1  0 -1  0  0  0  0  1] (Indices: [0, 1, 3, 7, 9, 10, 13, 14]), Candidate: [ 2  0  2 -1  1  1  2 -1  2  1 -1  1  2  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 9500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  1 -1  0  1  0 -1  1 -1  0  0  0  1] (Indices: [0, 1, 3, 7, 9, 12, 13, 15]), Candidate: [ 2  0  2 -1  1  1  2 -1  2  0  0  2  1  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  1 -1  0  0  0  0  1 -1  0  1  0  0] (Indices: [0, 1, 3, 7, 9, 15, 18, 19]), Candidate: [ 2  0  2 -1  1  1  2 -1  2  0  0  1  1  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  0  1 -1  1 -1  0  0  1 -1  0  1  0] (Indices: [0, 1, 3, 7, 10, 12, 16, 19]), Candidate: [ 2  0  2 -1  1  1  2 -1  1  2 -1  2  0  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 9650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  0  0  1  0 -1  0  1  0 -1  0  0  1] (Indices: [0, 1, 3, 7, 11, 12, 15, 16]), Candidate: [ 2  0  2 -1  1  1  2 -1  1  1  1  1  0  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  0  0  0  1  0 -1  1  0 -1  0  0  1] (Indices: [0, 1, 3, 7, 12, 13, 15, 16]), Candidate: [ 2  0  2 -1  1  1  2 -1  1  1  0  2  1  0  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  0  0  0  0  0  1  0  0  0 -1  0  1] (Indices: [0, 1, 3, 7, 14, 15, 16, 17]), Candidate: [ 2  0  2 -1  1  1  2 -1  1  1  0  1  1  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1  0  0 -1  0  0  0  0  0  0  1  0  0] (Indices: [0, 1, 3, 8, 9, 10, 18, 19]), Candidate: [ 2  0  2 -1  1  1  1  1  1  1 -1  1  1  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1  0 -1  0  0  1  0  0 -1  0  0  0  1] (Indices: [0, 1, 3, 8, 9, 13, 14, 15]), Candidate: [ 2  0  2 -1  1  1  1  1  1  0  0  1  2  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1 -1  1  0 -1  0  1 -1  0  1 -1  0  1] (Indices: [0, 1, 3, 8, 10, 11, 14, 17]), Candidate: [ 2  0  2 -1  1  1  1  1  0  2  0  0  1  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1 -1  1 -1  0  0  1  0 -1  1 -1  0  1] (Indices: [0, 1, 3, 8, 10, 14, 15, 17]), Candidate: [ 2  0  2 -1  1  1  1  1  0  2 -1  1  1  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1 -1  0  1 -1  1 -1  0  1 -1  1 -1  1] (Indices: [0, 1, 3, 8, 11, 13, 16, 18]), Candidate: [ 2  0  2 -1  1  1  1  1  0  1  1  0  2  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1 -1  0  0  1 -1  0  1  0  0 -1  0  1] (Indices: [0, 1, 3, 8, 12, 15, 16, 17]), Candidate: [ 2  0  2 -1  1  1  1  1  0  1  0  2  0  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  1  0  0  0 -1  0  0  0  0  1 -1  1] (Indices: [0, 1, 3, 9, 10, 11, 12, 18]), Candidate: [ 2  0  2 -1  1  1  1  0  2  1  0  1  0  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  1  0 -1  0  1 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 3, 9, 10, 13, 15, 17]), Candidate: [ 2  0  2 -1  1  1  1  0  2  1 -1  1  2  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  1 -1  1 -1  1  0  0 -1  0  0  0  1] (Indices: [0, 1, 3, 9, 11, 13, 14, 15]), Candidate: [ 2  0  2 -1  1  1  1  0  2  0  1  0  2  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  1 -1  0  1 -1  1  0  0 -1  0  0  1] (Indices: [0, 1, 3, 9, 12, 14, 15, 16]), Candidate: [ 2  0  2 -1  1  1  1  0  2  0  0  2  0  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  1 -1  0  0  0  0  1  0  0  0 -1  1] (Indices: [0, 1, 3, 9, 15, 16, 17, 18]), Candidate: [ 2  0  2 -1  1  1  1  0  2  0  0  1  1  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  0  1  0 -1  0  1 -1  0  0  1  0  0] (Indices: [0, 1, 3, 10, 11, 14, 18, 19]), Candidate: [ 2  0  2 -1  1  1  1  0  1  2  0  0  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  0  1 -1  0  1  0 -1  1  0 -1  0  1] (Indices: [0, 1, 3, 10, 13, 14, 16, 17]), Candidate: [ 2  0  2 -1  1  1  1  0  1  2 -1  1  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 10450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  0  0  1  0 -1  1 -1  1  0 -1  0  1] (Indices: [0, 1, 3, 11, 12, 14, 16, 17]), Candidate: [ 2  0  2 -1  1  1  1  0  1  1  1  1  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  0  0  1 -1  0  0  0  1  0  0  0  0] (Indices: [0, 1, 3, 11, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  1  0  1  1  1  0  1  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  0  0  0  0  1 -1  0  1  0  0  0  0] (Indices: [0, 1, 3, 13, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  1  0  1  1  0  1  2  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  0  0  0  1 -1  0  0  0  0  1 -1  1] (Indices: [0, 1, 4, 5, 6, 7, 12, 18]), Candidate: [ 2  0  1  1  1  1  1 -1  1  1  0  2  0  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1 -1  0  0  1  0 -1  0  0  0  0  0  1] (Indices: [0, 1, 4, 5, 6, 8, 12, 13]), Candidate: [2 0 1 1 1 1 0 1 0 1 0 2 1 0 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 10700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  1 -1  0  1 -1  0  0  0  0  1 -1  1] (Indices: [0, 1, 4, 5, 6, 9, 12, 18]), Candidate: [2 0 1 1 1 1 0 0 2 0 0 2 0 1 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 10750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  0  1 -1  0  0  0  1 -1  1 -1  0  1] (Indices: [0, 1, 4, 5, 6, 10, 15, 17]), Candidate: [ 2  0  1  1  1  1  0  0  1  2 -1  1  1  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  0  0  0  1 -1  0  1 -1  0  1 -1  1] (Indices: [0, 1, 4, 5, 6, 12, 15, 18]), Candidate: [2 0 1 1 1 1 0 0 1 1 0 2 0 1 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 10850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0  0 -1  0  0  0  0  0  0  1 -1  0  1] (Indices: [0, 1, 4, 5, 7, 8, 9, 17]), Candidate: [2 0 1 1 1 0 2 0 1 0 0 1 1 1 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 10900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  1  0 -1  0  1 -1  0  0  0  0  0  1] (Indices: [0, 1, 4, 5, 7, 9, 10, 13]), Candidate: [ 2  0  1  1  1  0  2 -1  2  1 -1  1  2  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  0  1  0 -1  0  0  0  0  0  0  1  0] (Indices: [0, 1, 4, 5, 7, 10, 11, 19]), Candidate: [ 2  0  1  1  1  0  2 -1  1  2  0  0  1  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  0  0  1 -1  0  0  1 -1  0  0  1  0] (Indices: [0, 1, 4, 5, 7, 11, 15, 19]), Candidate: [ 2  0  1  1  1  0  2 -1  1  1  1  0  1  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  0  0  0  0  0  1 -1  0  1  0 -1  1] (Indices: [0, 1, 4, 5, 7, 14, 17, 18]), Candidate: [ 2  0  1  1  1  0  2 -1  1  1  0  1  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 11100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1  0 -1  0  0  0  0  1 -1  0  1 -1  1] (Indices: [0, 1, 4, 5, 8, 9, 15, 18]), Candidate: [2 0 1 1 1 0 1 1 1 0 0 1 1 1 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 11150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1 -1  0  1  0 -1  0  0  0  0  0  1  0] (Indices: [0, 1, 4, 5, 8, 11, 12, 19]), Candidate: [2 0 1 1 1 0 1 1 0 1 1 1 0 1 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 11200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1 -1  0  0  0  1 -1  1 -1  0  1 -1  1] (Indices: [0, 1, 4, 5, 8, 13, 15, 18]), Candidate: [2 0 1 1 1 0 1 1 0 1 0 1 2 0 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 11250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  1  0 -1  0  0  1 -1  1 -1  0  0  1] (Indices: [0, 1, 4, 5, 9, 10, 14, 16]), Candidate: [ 2  0  1  1  1  0  1  0  2  1 -1  1  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 11300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  1 -1  0  1 -1  1 -1  0  1 -1  0  1] (Indices: [0, 1, 4, 5, 9, 12, 14, 17]), Candidate: [ 2  0  1  1  1  0  1  0  2  0  0  2  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  0  1  0  0 -1  0  1 -1  0  0  0  1] (Indices: [0, 1, 4, 5, 10, 11, 12, 15]), Candidate: [2 0 1 1 1 0 1 0 1 2 0 1 0 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 11400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  0  1 -1  0  1  0 -1  0  0  1 -1  1] (Indices: [0, 1, 4, 5, 10, 13, 14, 18]), Candidate: [ 2  0  1  1  1  0  1  0  1  2 -1  1  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 11450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  0  0  1  0 -1  0  0  0  1  0 -1  1] (Indices: [0, 1, 4, 5, 11, 12, 17, 18]), Candidate: [2 0 1 1 1 0 1 0 1 1 1 1 0 1 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 11500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  0  0  0  1  0 -1  0  0  1  0 -1  1] (Indices: [0, 1, 4, 5, 12, 13, 17, 18]), Candidate: [2 0 1 1 1 0 1 0 1 1 0 2 1 0 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 11550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  0  0  0  0  0  1 -1  1  0 -1  1  0] (Indices: [0, 1, 4, 5, 14, 16, 17, 19]), Candidate: [ 2  0  1  1  1  0  1  0  1  1  0  1  1  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0 -1  0  0  0  0  1 -1  0  1 -1  0  1] (Indices: [0, 1, 4, 6, 7, 8, 14, 17]), Candidate: [ 2  0  1  1  0  2  1  0  0  1  0  1  1  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  1 -1  0  0  0  0  1 -1  0  1 -1  1] (Indices: [0, 1, 4, 6, 7, 9, 15, 18]), Candidate: [ 2  0  1  1  0  2  1 -1  2  0  0  1  1  1  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  0  0  1  0 -1  0  0  0  0  0  1  0] (Indices: [0, 1, 4, 6, 7, 11, 12, 19]), Candidate: [ 2  0  1  1  0  2  1 -1  1  1  1  1  0  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  0  0  0  0  1 -1  1 -1  0  1 -1  1] (Indices: [0, 1, 4, 6, 7, 13, 15, 18]), Candidate: [ 2  0  1  1  0  2  1 -1  1  1  0  1  2  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1  0 -1  0  1 -1  0  0  0  0  1 -1  1] (Indices: [0, 1, 4, 6, 8, 9, 12, 18]), Candidate: [2 0 1 1 0 2 0 1 1 0 0 2 0 1 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 11850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1 -1  1 -1  0  0  0  1 -1  1 -1  0  1] (Indices: [0, 1, 4, 6, 8, 10, 15, 17]), Candidate: [ 2  0  1  1  0  2  0  1  0  2 -1  1  1  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1 -1  0  0  1 -1  0  1 -1  0  1 -1  1] (Indices: [0, 1, 4, 6, 8, 12, 15, 18]), Candidate: [2 0 1 1 0 2 0 1 0 1 0 2 0 1 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 11950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  1  0  0 -1  0  0  0  0  0  0  1  0] (Indices: [0, 1, 4, 6, 9, 10, 11, 19]), Candidate: [2 0 1 1 0 2 0 0 2 1 0 0 1 1 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 12000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  1 -1  1 -1  0  0  1 -1  0  0  1  0] (Indices: [0, 1, 4, 6, 9, 11, 15, 19]), Candidate: [2 0 1 1 0 2 0 0 2 0 1 0 1 1 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 12050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  1 -1  0  0  0  1 -1  0  1  0 -1  1] (Indices: [0, 1, 4, 6, 9, 14, 17, 18]), Candidate: [ 2  0  1  1  0  2  0  0  2  0  0  1  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  0  1 -1  1 -1  1 -1  0  0  1 -1  1] (Indices: [0, 1, 4, 6, 10, 12, 14, 18]), Candidate: [ 2  0  1  1  0  2  0  0  1  2 -1  2  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 12150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  0  0  1  0  0 -1  0  0  1 -1  0  1] (Indices: [0, 1, 4, 6, 11, 12, 13, 17]), Candidate: [2 0 1 1 0 2 0 0 1 1 1 1 1 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 12200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  0  0  1 -1  0  0  0  1  0 -1  1  0] (Indices: [0, 1, 4, 6, 11, 16, 17, 19]), Candidate: [2 0 1 1 0 2 0 0 1 1 1 0 1 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 12250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  0  0  0  0  1 -1  1  0 -1  0  1  0] (Indices: [0, 1, 4, 6, 13, 15, 16, 19]), Candidate: [2 0 1 1 0 2 0 0 1 1 0 1 2 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 12300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0  0 -1  0  0  1 -1  0  0  1 -1  0  1] (Indices: [0, 1, 4, 7, 8, 9, 13, 17]), Candidate: [2 0 1 1 0 1 2 0 1 0 0 1 2 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 12350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0 -1  1 -1  0  0  0  0  1 -1  0  1  0] (Indices: [0, 1, 4, 7, 8, 10, 16, 19]), Candidate: [ 2  0  1  1  0  1  2  0  0  2 -1  1  1  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0 -1  0  0  1 -1  0  0  0  1  0 -1  1] (Indices: [0, 1, 4, 7, 8, 12, 17, 18]), Candidate: [2 0 1 1 0 1 2 0 0 1 0 2 0 1 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 12450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  1  0 -1  1 -1  0  0  0  1 -1  0  1] (Indices: [0, 1, 4, 7, 9, 10, 12, 17]), Candidate: [ 2  0  1  1  0  1  2 -1  2  1 -1  2  0  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 12500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  1 -1  1 -1  0  0  0  0  1 -1  1  0] (Indices: [0, 1, 4, 7, 9, 11, 17, 19]), Candidate: [ 2  0  1  1  0  1  2 -1  2  0  1  0  1  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  1 -1  0  0  0  0  1  0 -1  0  1  0] (Indices: [0, 1, 4, 7, 9, 15, 16, 19]), Candidate: [ 2  0  1  1  0  1  2 -1  2  0  0  1  1  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  0  1 -1  1 -1  0  1 -1  0  0  1  0] (Indices: [0, 1, 4, 7, 10, 12, 15, 19]), Candidate: [ 2  0  1  1  0  1  2 -1  1  2 -1  2  0  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 12650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  0  0  1  0 -1  1 -1  0  1 -1  0  1] (Indices: [0, 1, 4, 7, 11, 12, 14, 17]), Candidate: [ 2  0  1  1  0  1  2 -1  1  1  1  1  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 12700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  0  0  0  1  0  0 -1  0  1 -1  0  1] (Indices: [0, 1, 4, 7, 12, 13, 14, 17]), Candidate: [ 2  0  1  1  0  1  2 -1  1  1  0  2  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 12750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  0  0  0  0  1 -1  0  1  0 -1  1  0] (Indices: [0, 1, 4, 7, 13, 16, 17, 19]), Candidate: [ 2  0  1  1  0  1  2 -1  1  1  0  1  2  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1  0  0 -1  0  0  0  0  1 -1  0  1  0] (Indices: [0, 1, 4, 8, 9, 10, 16, 19]), Candidate: [ 2  0  1  1  0  1  1  1  1  1 -1  1  1  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1  0 -1  0  1 -1  0  0  0  1  0 -1  1] (Indices: [0, 1, 4, 8, 9, 12, 17, 18]), Candidate: [2 0 1 1 0 1 1 1 1 0 0 2 0 1 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 12900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1 -1  1  0 -1  1 -1  0  0  0  0  1  0] (Indices: [0, 1, 4, 8, 10, 11, 13, 19]), Candidate: [2 0 1 1 0 1 1 1 0 2 0 0 2 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 12950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1 -1  1 -1  0  1 -1  0  0  1 -1  1  0] (Indices: [0, 1, 4, 8, 10, 13, 17, 19]), Candidate: [ 2  0  1  1  0  1  1  1  0  2 -1  1  2  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1 -1  0  1 -1  1 -1  1 -1  0  1 -1  1] (Indices: [0, 1, 4, 8, 11, 13, 15, 18]), Candidate: [2 0 1 1 0 1 1 1 0 1 1 0 2 0 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 13050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1 -1  0  0  1 -1  1 -1  0  1  0 -1  1] (Indices: [0, 1, 4, 8, 12, 14, 17, 18]), Candidate: [ 2  0  1  1  0  1  1  1  0  1  0  2  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  1  0  0  0 -1  0  1 -1  0  0  0  1] (Indices: [0, 1, 4, 9, 10, 11, 12, 15]), Candidate: [2 0 1 1 0 1 1 0 2 1 0 1 0 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 13150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  1  0 -1  0  1  0 -1  0  0  1 -1  1] (Indices: [0, 1, 4, 9, 10, 13, 14, 18]), Candidate: [ 2  0  1  1  0  1  1  0  2  1 -1  1  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 13200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  1 -1  1  0 -1  0  0  0  1  0 -1  1] (Indices: [0, 1, 4, 9, 11, 12, 17, 18]), Candidate: [2 0 1 1 0 1 1 0 2 0 1 1 0 1 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 13250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  1 -1  0  1  0 -1  0  0  1  0 -1  1] (Indices: [0, 1, 4, 9, 12, 13, 17, 18]), Candidate: [2 0 1 1 0 1 1 0 2 0 0 2 1 0 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 13300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  1 -1  0  0  0  1 -1  1  0 -1  1  0] (Indices: [0, 1, 4, 9, 14, 16, 17, 19]), Candidate: [ 2  0  1  1  0  1  1  0  2  0  0  1  1  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  0  1  0 -1  0  1 -1  1 -1  0  1  0] (Indices: [0, 1, 4, 10, 11, 14, 16, 19]), Candidate: [ 2  0  1  1  0  1  1  0  1  2  0  0  1  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  0  1 -1  0  1  0  0 -1  1 -1  0  1] (Indices: [0, 1, 4, 10, 13, 14, 15, 17]), Candidate: [ 2  0  1  1  0  1  1  0  1  2 -1  1  2  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  0  0  1  0 -1  1  0 -1  1 -1  0  1] (Indices: [0, 1, 4, 11, 12, 14, 15, 17]), Candidate: [2 0 1 1 0 1 1 0 1 1 1 1 0 2 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 13500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  0  0  1 -1  0  0  1  0  0 -1  1  0] (Indices: [0, 1, 4, 11, 15, 16, 17, 19]), Candidate: [2 0 1 1 0 1 1 0 1 1 1 0 1 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 13550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  0  0  0  0  1 -1  1  0  0 -1  1  0] (Indices: [0, 1, 4, 13, 15, 16, 17, 19]), Candidate: [2 0 1 1 0 1 1 0 1 1 0 1 2 0 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 13600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0 -1  0  0  0  0  1  0 -1  0  0  0  1] (Indices: [0, 1, 5, 6, 7, 8, 14, 15]), Candidate: [2 0 1 0 2 1 1 0 0 1 0 1 1 2 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 13650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  1 -1  0  0  0  0  1  0 -1  0  0  1] (Indices: [0, 1, 5, 6, 7, 9, 15, 16]), Candidate: [ 2  0  1  0  2  1  1 -1  2  0  0  1  1  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  0  0  1  0 -1  0  0  0  1 -1  0  1] (Indices: [0, 1, 5, 6, 7, 11, 12, 17]), Candidate: [ 2  0  1  0  2  1  1 -1  1  1  1  1  0  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  0  0  0  0  1 -1  1  0 -1  0  0  1] (Indices: [0, 1, 5, 6, 7, 13, 15, 16]), Candidate: [ 2  0  1  0  2  1  1 -1  1  1  0  1  2  0  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1  0 -1  0  1 -1  0  0  1 -1  0  0  1] (Indices: [0, 1, 5, 6, 8, 9, 12, 16]), Candidate: [2 0 1 0 2 1 0 1 1 0 0 2 0 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 13850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1 -1  1 -1  0  0  1 -1  0  0  0  1  0] (Indices: [0, 1, 5, 6, 8, 10, 14, 19]), Candidate: [ 2  0  1  0  2  1  0  1  0  2 -1  1  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 13900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1 -1  0  0  1 -1  0  1  0 -1  0  0  1] (Indices: [0, 1, 5, 6, 8, 12, 15, 16]), Candidate: [2 0 1 0 2 1 0 1 0 1 0 2 0 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 13950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  1  0  0 -1  0  0  0  0  1 -1  0  1] (Indices: [0, 1, 5, 6, 9, 10, 11, 17]), Candidate: [2 0 1 0 2 1 0 0 2 1 0 0 1 1 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 14000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  1 -1  1 -1  0  0  1 -1  1 -1  0  1] (Indices: [0, 1, 5, 6, 9, 11, 15, 17]), Candidate: [2 0 1 0 2 1 0 0 2 0 1 0 1 1 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 14050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  1 -1  0  0  0  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 5, 6, 9, 14, 16, 18]), Candidate: [ 2  0  1  0  2  1  0  0  2  0  0  1  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  0  1 -1  1 -1  1 -1  1 -1  0  0  1] (Indices: [0, 1, 5, 6, 10, 12, 14, 16]), Candidate: [ 2  0  1  0  2  1  0  0  1  2 -1  2  0  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 14150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  0  0  1  0  0 -1  1 -1  0  0  0  1] (Indices: [0, 1, 5, 6, 11, 12, 13, 15]), Candidate: [2 0 1 0 2 1 0 0 1 1 1 1 1 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 14200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  0  0  1 -1  0  0  1 -1  0  1  0  0] (Indices: [0, 1, 5, 6, 11, 15, 18, 19]), Candidate: [2 0 1 0 2 1 0 0 1 1 1 0 1 1 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 14250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  0  0  0  0  1 -1  1  0  0 -1  0  1] (Indices: [0, 1, 5, 6, 13, 15, 16, 17]), Candidate: [2 0 1 0 2 1 0 0 1 1 0 1 2 0 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 14300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0  0 -1  0  0  1 -1  1 -1  0  0  0  1] (Indices: [0, 1, 5, 7, 8, 9, 13, 15]), Candidate: [2 0 1 0 2 0 2 0 1 0 0 1 2 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 14350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0 -1  1 -1  0  0  0  0  1  0 -1  0  1] (Indices: [0, 1, 5, 7, 8, 10, 16, 17]), Candidate: [ 2  0  1  0  2  0  2  0  0  2 -1  1  1  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0 -1  0  0  1 -1  0  0  1 -1  1 -1  1] (Indices: [0, 1, 5, 7, 8, 12, 16, 18]), Candidate: [2 0 1 0 2 0 2 0 0 1 0 2 0 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 14450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  1  0 -1  1 -1  0  1 -1  0  0  0  1] (Indices: [0, 1, 5, 7, 9, 10, 12, 15]), Candidate: [ 2  0  1  0  2  0  2 -1  2  1 -1  2  0  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 14500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  1 -1  1 -1  0  0  0  1 -1  0  1  0] (Indices: [0, 1, 5, 7, 9, 11, 16, 19]), Candidate: [ 2  0  1  0  2  0  2 -1  2  0  1  0  1  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  1 -1  0  0  0  0  1  0  0 -1  0  1] (Indices: [0, 1, 5, 7, 9, 15, 16, 17]), Candidate: [ 2  0  1  0  2  0  2 -1  2  0  0  1  1  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  0  1 -1  1 -1  0  1 -1  1 -1  0  1] (Indices: [0, 1, 5, 7, 10, 12, 15, 17]), Candidate: [ 2  0  1  0  2  0  2 -1  1  2 -1  2  0  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 14650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  0  0  1  0 -1  1  0 -1  0  0  0  1] (Indices: [0, 1, 5, 7, 11, 12, 14, 15]), Candidate: [ 2  0  1  0  2  0  2 -1  1  1  1  1  0  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  0  0  0  1  0  0  0 -1  0  0  0  1] (Indices: [0, 1, 5, 7, 12, 13, 14, 15]), Candidate: [ 2  0  1  0  2  0  2 -1  1  1  0  2  1  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  0  0  0  0  1 -1  1 -1  0  1  0  0] (Indices: [0, 1, 5, 7, 13, 15, 18, 19]), Candidate: [ 2  0  1  0  2  0  2 -1  1  1  0  1  2  0  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1  0  0 -1  0  0  0  0  1  0 -1  0  1] (Indices: [0, 1, 5, 8, 9, 10, 16, 17]), Candidate: [ 2  0  1  0  2  0  1  1  1  1 -1  1  1  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1  0 -1  0  1 -1  0  0  1 -1  1 -1  1] (Indices: [0, 1, 5, 8, 9, 12, 16, 18]), Candidate: [2 0 1 0 2 0 1 1 1 0 0 2 0 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 14900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1 -1  1  0 -1  1 -1  0  0  1 -1  0  1] (Indices: [0, 1, 5, 8, 10, 11, 13, 17]), Candidate: [2 0 1 0 2 0 1 1 0 2 0 0 2 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 14950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1 -1  1 -1  0  1 -1  0  1 -1  0  1  0] (Indices: [0, 1, 5, 8, 10, 13, 16, 19]), Candidate: [ 2  0  1  0  2  0  1  1  0  2 -1  1  2  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1 -1  0  1 -1  1 -1  1  0 -1  0  0  1] (Indices: [0, 1, 5, 8, 11, 13, 15, 16]), Candidate: [2 0 1 0 2 0 1 1 0 1 1 0 2 0 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 15050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1 -1  0  0  1 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 5, 8, 12, 14, 16, 18]), Candidate: [ 2  0  1  0  2  0  1  1  0  1  0  2  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  1  0  0  0  0 -1  0  0  0  0  0  1] (Indices: [0, 1, 5, 9, 10, 11, 12, 13]), Candidate: [2 0 1 0 2 0 1 0 2 1 0 1 1 0 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 15150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  1  0 -1  0  1  0 -1  1 -1  0  0  1] (Indices: [0, 1, 5, 9, 10, 13, 14, 16]), Candidate: [ 2  0  1  0  2  0  1  0  2  1 -1  1  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  1 -1  1  0 -1  0  0  1 -1  1 -1  1] (Indices: [0, 1, 5, 9, 11, 12, 16, 18]), Candidate: [2 0 1 0 2 0 1 0 2 0 1 1 0 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 15250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  1 -1  0  1  0 -1  0  1 -1  1 -1  1] (Indices: [0, 1, 5, 9, 12, 13, 16, 18]), Candidate: [2 0 1 0 2 0 1 0 2 0 0 2 1 0 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 15300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  1 -1  0  0  0  1  0 -1  0  1  0  0] (Indices: [0, 1, 5, 9, 14, 15, 18, 19]), Candidate: [2 0 1 0 2 0 1 0 2 0 0 1 1 2 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 15350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  0  1  0 -1  0  1 -1  1  0 -1  0  1] (Indices: [0, 1, 5, 10, 11, 14, 16, 17]), Candidate: [ 2  0  1  0  2  0  1  0  1  2  0  0  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  0  1 -1  1 -1  0  0  0  1  0  0  0] (Indices: [0, 1, 5, 10, 12, 17, 18, 19]), Candidate: [ 2  0  1  0  2  0  1  0  1  2 -1  2  0  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  0  0  1  0  0 -1  0  0  0  1  0  0] (Indices: [0, 1, 5, 11, 12, 13, 18, 19]), Candidate: [2 0 1 0 2 0 1 0 1 1 1 1 1 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 15500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  0  0  1 -1  0  1 -1  0  1  0  0  0] (Indices: [0, 1, 5, 11, 14, 17, 18, 19]), Candidate: [ 2  0  1  0  2  0  1  0  1  1  1  0  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  0  0  0  0  1  0 -1  0  1  0  0  0] (Indices: [0, 1, 5, 13, 14, 17, 18, 19]), Candidate: [ 2  0  1  0  2  0  1  0  1  1  0  1  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0  0 -1  0  0  0  0  1 -1  0  0  1  0] (Indices: [0, 1, 6, 7, 8, 9, 15, 19]), Candidate: [2 0 1 0 1 2 1 0 1 0 0 1 1 1 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 15650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0 -1  0  1 -1  1  0 -1  0  0  0  0  1] (Indices: [0, 1, 6, 7, 8, 11, 13, 14]), Candidate: [ 2  0  1  0  1  2  1  0  0  1  1  0  2  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0 -1  0  0  0  1 -1  1 -1  0  0  1  0] (Indices: [0, 1, 6, 7, 8, 13, 15, 19]), Candidate: [2 0 1 0 1 2 1 0 0 1 0 1 2 0 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 15750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  1  0 -1  0  0  1 -1  0  1 -1  0  1] (Indices: [0, 1, 6, 7, 9, 10, 14, 17]), Candidate: [ 2  0  1  0  1  2  1 -1  2  1 -1  1  1  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 15800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  1 -1  0  1 -1  1 -1  0  0  1 -1  1] (Indices: [0, 1, 6, 7, 9, 12, 14, 18]), Candidate: [ 2  0  1  0  1  2  1 -1  2  0  0  2  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  0  1  0  0 -1  0  0  1 -1  0  0  1] (Indices: [0, 1, 6, 7, 10, 11, 12, 16]), Candidate: [ 2  0  1  0  1  2  1 -1  1  2  0  1  0  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  0  1 -1  0  1  0 -1  0  0  0  1  0] (Indices: [0, 1, 6, 7, 10, 13, 14, 19]), Candidate: [ 2  0  1  0  1  2  1 -1  1  2 -1  1  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 15950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  0  0  1  0 -1  0  0  0  1 -1  1  0] (Indices: [0, 1, 6, 7, 11, 12, 17, 19]), Candidate: [ 2  0  1  0  1  2  1 -1  1  1  1  1  0  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  0  0  0  1  0 -1  0  0  1 -1  1  0] (Indices: [0, 1, 6, 7, 12, 13, 17, 19]), Candidate: [ 2  0  1  0  1  2  1 -1  1  1  0  2  1  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  0  0  0  0  0  1 -1  1 -1  1  0  0] (Indices: [0, 1, 6, 7, 14, 16, 18, 19]), Candidate: [ 2  0  1  0  1  2  1 -1  1  1  0  1  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1  0 -1  1 -1  1  0 -1  0  0  0  0  1] (Indices: [0, 1, 6, 8, 9, 11, 13, 14]), Candidate: [ 2  0  1  0  1  2  0  1  1  0  1  0  2  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1  0 -1  0  0  1 -1  1 -1  0  0  1  0] (Indices: [0, 1, 6, 8, 9, 13, 15, 19]), Candidate: [2 0 1 0 1 2 0 1 1 0 0 1 2 0 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 16200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1 -1  1  0 -1  0  0  0  1 -1  1 -1  1] (Indices: [0, 1, 6, 8, 10, 11, 16, 18]), Candidate: [2 0 1 0 1 2 0 1 0 2 0 0 1 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 16250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1 -1  1 -1  0  0  1 -1  0  0  1  0  0] (Indices: [0, 1, 6, 8, 10, 14, 18, 19]), Candidate: [ 2  0  1  0  1  2  0  1  0  2 -1  1  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1 -1  0  1 -1  0  1  0 -1  0  0  1  0] (Indices: [0, 1, 6, 8, 11, 14, 15, 19]), Candidate: [2 0 1 0 1 2 0 1 0 1 1 0 1 2 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 16350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1 -1  0  0  1 -1  0  0  1 -1  1  0  0] (Indices: [0, 1, 6, 8, 12, 16, 18, 19]), Candidate: [2 0 1 0 1 2 0 1 0 1 0 2 0 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 16400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  1  0  0 -1  0  1  0 -1  0  0  0  1] (Indices: [0, 1, 6, 9, 10, 11, 14, 15]), Candidate: [2 0 1 0 1 2 0 0 2 1 0 0 1 2 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 16450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  1  0 -1  0  1 -1  0  0  0  1  0  0] (Indices: [0, 1, 6, 9, 10, 13, 18, 19]), Candidate: [ 2  0  1  0  1  2  0  0  2  1 -1  1  2  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  1 -1  1 -1  1 -1  1 -1  0  0  1  0] (Indices: [0, 1, 6, 9, 11, 13, 15, 19]), Candidate: [2 0 1 0 1 2 0 0 2 0 1 0 2 0 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 16550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  1 -1  0  1 -1  1 -1  0  1 -1  1  0] (Indices: [0, 1, 6, 9, 12, 14, 17, 19]), Candidate: [ 2  0  1  0  1  2  0  0  2  0  0  2  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  0  1  0  0  0 -1  0  0  1 -1  0  1] (Indices: [0, 1, 6, 10, 11, 12, 13, 17]), Candidate: [2 0 1 0 1 2 0 0 1 2 0 1 1 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 16650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  0  1  0 -1  0  0  0  1  0 -1  1  0] (Indices: [0, 1, 6, 10, 11, 16, 17, 19]), Candidate: [2 0 1 0 1 2 0 0 1 2 0 0 1 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 16700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  0  1 -1  0  1 -1  1  0 -1  0  1  0] (Indices: [0, 1, 6, 10, 13, 15, 16, 19]), Candidate: [ 2  0  1  0  1  2  0  0  1  2 -1  1  2  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  0  0  1  0 -1  0  1  0 -1  0  1  0] (Indices: [0, 1, 6, 11, 12, 15, 16, 19]), Candidate: [2 0 1 0 1 2 0 0 1 1 1 1 0 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 16800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  0  0  0  1  0  0 -1  0  1  0 -1  1] (Indices: [0, 1, 6, 12, 13, 14, 17, 18]), Candidate: [ 2  0  1  0  1  2  0  0  1  1  0  2  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0  0  0  0 -1  1 -1  0  0  0  0  0  1] (Indices: [0, 1, 7, 8, 9, 10, 11, 13]), Candidate: [2 0 1 0 1 1 2 0 1 1 0 0 2 0 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 16900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0  0 -1  1 -1  0  1 -1  0  1 -1  0  1] (Indices: [0, 1, 7, 8, 9, 11, 14, 17]), Candidate: [ 2  0  1  0  1  1  2  0  1  0  1  0  1  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0  0 -1  0  0  0  1  0 -1  1 -1  0  1] (Indices: [0, 1, 7, 8, 9, 14, 15, 17]), Candidate: [2 0 1 0 1 1 2 0 1 0 0 1 1 2 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 17000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0 -1  1 -1  1  0 -1  0  0  1 -1  0  1] (Indices: [0, 1, 7, 8, 10, 12, 13, 17]), Candidate: [ 2  0  1  0  1  1  2  0  0  2 -1  2  1  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0 -1  1 -1  0  0  0  0  1  0 -1  1  0] (Indices: [0, 1, 7, 8, 10, 16, 17, 19]), Candidate: [ 2  0  1  0  1  1  2  0  0  2 -1  1  1  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0 -1  0  1 -1  0  0  1  0 -1  1 -1  1] (Indices: [0, 1, 7, 8, 11, 15, 16, 18]), Candidate: [2 0 1 0 1 1 2 0 0 1 1 0 1 1 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 17150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0 -1  0  0  0  1  0 -1  1 -1  0  1  0] (Indices: [0, 1, 7, 8, 13, 14, 16, 19]), Candidate: [ 2  0  1  0  1  1  2  0  0  1  0  1  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  1  0  0 -1  0  0  1 -1  0  0  1  0] (Indices: [0, 1, 7, 9, 10, 11, 15, 19]), Candidate: [ 2  0  1  0  1  1  2 -1  2  1  0  0  1  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  1  0 -1  0  0  1 -1  0  1  0 -1  1] (Indices: [0, 1, 7, 9, 10, 14, 17, 18]), Candidate: [ 2  0  1  0  1  1  2 -1  2  1 -1  1  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 17300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  1 -1  1 -1  0  1  0 -1  1 -1  0  1] (Indices: [0, 1, 7, 9, 11, 14, 15, 17]), Candidate: [ 2  0  1  0  1  1  2 -1  2  0  1  0  1  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  1 -1  0  1 -1  0  0  1  0  0 -1  1] (Indices: [0, 1, 7, 9, 12, 16, 17, 18]), Candidate: [ 2  0  1  0  1  1  2 -1  2  0  0  2  0  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  0  1  0  0 -1  0  1  0 -1  0  0  1] (Indices: [0, 1, 7, 10, 11, 12, 15, 16]), Candidate: [ 2  0  1  0  1  1  2 -1  1  2  0  1  0  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  0  1 -1  1  0 -1  1  0 -1  0  0  1] (Indices: [0, 1, 7, 10, 12, 13, 15, 16]), Candidate: [ 2  0  1  0  1  1  2 -1  1  2 -1  2  1  0  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 17500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  0  1 -1  0  0  1  0  0  0 -1  0  1] (Indices: [0, 1, 7, 10, 14, 15, 16, 17]), Candidate: [ 2  0  1  0  1  1  2 -1  1  2 -1  1  1  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 17550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  0  0  1 -1  1  0  0  0 -1  0  0  1] (Indices: [0, 1, 7, 11, 13, 14, 15, 16]), Candidate: [ 2  0  1  0  1  1  2 -1  1  1  1  0  2  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  0  0  0  1  0 -1  1 -1  0  1  0  0] (Indices: [0, 1, 7, 12, 13, 15, 18, 19]), Candidate: [ 2  0  1  0  1  1  2 -1  1  1  0  2  1  0  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1  0  0  0 -1  1 -1  0  1 -1  0  0  1] (Indices: [0, 1, 8, 9, 10, 11, 13, 16]), Candidate: [2 0 1 0 1 1 1 1 1 1 0 0 2 0 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 17700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1  0  0 -1  0  1 -1  0  1 -1  1 -1  1] (Indices: [0, 1, 8, 9, 10, 13, 16, 18]), Candidate: [ 2  0  1  0  1  1  1  1  1  1 -1  1  2  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1  0 -1  1 -1  1  0 -1  0  0  0  1  0] (Indices: [0, 1, 8, 9, 11, 13, 14, 19]), Candidate: [ 2  0  1  0  1  1  1  1  1  0  1  0  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1  0 -1  0  1 -1  1 -1  1  0 -1  0  1] (Indices: [0, 1, 8, 9, 12, 14, 16, 17]), Candidate: [ 2  0  1  0  1  1  1  1  1  0  0  2  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1  0 -1  0  0  0  0  0  1  0  0  0  0] (Indices: [0, 1, 8, 9, 16, 17, 18, 19]), Candidate: [2 0 1 0 1 1 1 1 1 0 0 1 1 1 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 17900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1 -1  1  0 -1  0  0  1 -1  1  0 -1  1] (Indices: [0, 1, 8, 10, 11, 15, 17, 18]), Candidate: [2 0 1 0 1 1 1 1 0 2 0 0 1 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 17950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1 -1  1 -1  0  1  0 -1  0  1 -1  1  0] (Indices: [0, 1, 8, 10, 13, 14, 17, 19]), Candidate: [ 2  0  1  0  1  1  1  1  0  2 -1  1  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1 -1  0  1  0 -1  1 -1  0  1 -1  1  0] (Indices: [0, 1, 8, 11, 12, 14, 17, 19]), Candidate: [ 2  0  1  0  1  1  1  1  0  1  1  1  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1 -1  0  0  1  0  0  0 -1  0  0  1  0] (Indices: [0, 1, 8, 12, 13, 14, 15, 19]), Candidate: [2 0 1 0 1 1 1 1 0 1 0 2 1 1 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 18100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1 -1  0  0  0  0  1  0 -1  1  0  0  0] (Indices: [0, 1, 8, 14, 15, 17, 18, 19]), Candidate: [2 0 1 0 1 1 1 1 0 1 0 1 1 2 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 18150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  1  0  0 -1  0  0  1  0 -1  1 -1  1] (Indices: [0, 1, 9, 10, 11, 15, 16, 18]), Candidate: [2 0 1 0 1 1 1 0 2 1 0 0 1 1 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 18200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  1  0 -1  0  1  0 -1  1 -1  0  1  0] (Indices: [0, 1, 9, 10, 13, 14, 16, 19]), Candidate: [ 2  0  1  0  1  1  1  0  2  1 -1  1  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  1 -1  1  0 -1  1 -1  1 -1  0  1  0] (Indices: [0, 1, 9, 11, 12, 14, 16, 19]), Candidate: [ 2  0  1  0  1  1  1  0  2  0  1  1  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  1 -1  0  1  0  0  0 -1  1 -1  0  1] (Indices: [0, 1, 9, 12, 13, 14, 15, 17]), Candidate: [2 0 1 0 1 1 1 0 2 0 0 2 1 1 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 18350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  1 -1  0  0  0  1  0  0  0 -1  1  0] (Indices: [0, 1, 9, 14, 15, 16, 17, 19]), Candidate: [2 0 1 0 1 1 1 0 2 0 0 1 1 2 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 18400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  0  1  0 -1  1 -1  1  0  0 -1  0  1] (Indices: [0, 1, 10, 11, 13, 15, 16, 17]), Candidate: [2 0 1 0 1 1 1 0 1 2 0 0 2 0 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 18450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  0  1 -1  1 -1  1  0 -1  0  1  0  0] (Indices: [0, 1, 10, 12, 14, 15, 18, 19]), Candidate: [ 2  0  1  0  1  1  1  0  1  2 -1  2  0  2  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  0  0  1  0  0 -1  0  0  1  0  0  0] (Indices: [0, 1, 11, 12, 13, 17, 18, 19]), Candidate: [2 0 1 0 1 1 1 0 1 1 1 1 1 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 18550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  0  0  0  1  0 -1  1 -1  1  0  0  0] (Indices: [0, 1, 12, 13, 15, 17, 18, 19]), Candidate: [2 0 1 0 1 1 1 0 1 1 0 2 1 0 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 18600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  0  1 -1  0  1 -1  0  0  0  0  0  1] (Indices: [0, 2, 3, 4, 5, 6, 10, 13]), Candidate: [ 1  2  1  0  1  1  0  0  1  2 -1  1  2  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0 -1  0  0  0  0  0  0  1 -1  0  0  1] (Indices: [0, 2, 3, 4, 5, 7, 8, 16]), Candidate: [1 2 1 0 1 0 2 0 0 1 0 1 1 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 18700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  0  0  0  0  0  0  1 -1  1 -1  0  1] (Indices: [0, 2, 3, 4, 5, 7, 15, 17]), Candidate: [ 1  2  1  0  1  0  2 -1  1  1  0  1  1  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1 -1  0  0  0  0  1 -1  1 -1  0  0  1] (Indices: [0, 2, 3, 4, 5, 8, 14, 16]), Candidate: [ 1  2  1  0  1  0  1  1  0  1  0  1  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  1 -1  0  0  0  0  1 -1  1 -1  0  1] (Indices: [0, 2, 3, 4, 5, 9, 15, 17]), Candidate: [1 2 1 0 1 0 1 0 2 0 0 1 1 1 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 18850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  0  0  1  0 -1  0  0  0  0  1 -1  1] (Indices: [0, 2, 3, 4, 5, 11, 12, 18]), Candidate: [1 2 1 0 1 0 1 0 1 1 1 1 0 1 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 18900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  0  0  0  0  1 -1  1 -1  1 -1  0  1] (Indices: [0, 2, 3, 4, 5, 13, 15, 17]), Candidate: [1 2 1 0 1 0 1 0 1 1 0 1 2 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 18950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  0  1  0 -1  0  0  0  0  0  0  0  1] (Indices: [0, 2, 3, 4, 6, 7, 10, 11]), Candidate: [ 1  2  1  0  0  2  1 -1  1  2  0  0  1  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1  0 -1  0  0  0  0  1 -1  0  0  0  1] (Indices: [0, 2, 3, 4, 6, 8, 9, 15]), Candidate: [1 2 1 0 0 2 0 1 1 0 0 1 1 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 19050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  1  0  0 -1  0  0  0  0  0  0  0  1] (Indices: [0, 2, 3, 4, 6, 9, 10, 11]), Candidate: [1 2 1 0 0 2 0 0 2 1 0 0 1 1 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 19100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  0  1  0 -1  0  0  0  0  1 -1  0  1] (Indices: [0, 2, 3, 4, 6, 10, 11, 17]), Candidate: [1 2 1 0 0 2 0 0 1 2 0 0 1 1 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 19150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  0  0  1 -1  0  0  1 -1  1 -1  0  1] (Indices: [0, 2, 3, 4, 6, 11, 15, 17]), Candidate: [1 2 1 0 0 2 0 0 1 1 1 0 1 1 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 19200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  0  0  0  0  0  1 -1  1 -1  1 -1  1] (Indices: [0, 2, 3, 4, 6, 14, 16, 18]), Candidate: [ 1  2  1  0  0  2  0  0  1  1  0  1  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0 -1  0  0  0  1 -1  1 -1  0  0  0  1] (Indices: [0, 2, 3, 4, 7, 8, 13, 15]), Candidate: [1 2 1 0 0 1 2 0 0 1 0 1 2 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 19300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  1 -1  0  0  0  1  0 -1  0  0  0  1] (Indices: [0, 2, 3, 4, 7, 9, 14, 15]), Candidate: [ 1  2  1  0  0  1  2 -1  2  0  0  1  1  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  0  1 -1  0  0  0  0  0  0  1  0  0] (Indices: [0, 2, 3, 4, 7, 10, 18, 19]), Candidate: [ 1  2  1  0  0  1  2 -1  1  2 -1  1  1  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 19400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  0  0  0  0  1  0  0 -1  0  0  0  1] (Indices: [0, 2, 3, 4, 7, 13, 14, 15]), Candidate: [ 1  2  1  0  0  1  2 -1  1  1  0  1  2  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1  0 -1  1 -1  0  0  0  0  0  1 -1  1] (Indices: [0, 2, 3, 4, 8, 9, 11, 18]), Candidate: [1 2 1 0 0 1 1 1 1 0 1 0 1 1 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 19500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1 -1  1 -1  0  1 -1  0  0  0  0  1  0] (Indices: [0, 2, 3, 4, 8, 10, 13, 19]), Candidate: [ 1  2  1  0  0  1  1  1  0  2 -1  1  2  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1 -1  0  0  1 -1  1  0 -1  0  0  0  1] (Indices: [0, 2, 3, 4, 8, 12, 14, 15]), Candidate: [1 2 1 0 0 1 1 1 0 1 0 2 0 2 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 19600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  1  0  0  0 -1  0  0  0  0  0  0  1] (Indices: [0, 2, 3, 4, 9, 10, 11, 12]), Candidate: [1 2 1 0 0 1 1 0 2 1 0 1 0 1 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 19650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  1 -1  1 -1  0  1 -1  1 -1  0  0  1] (Indices: [0, 2, 3, 4, 9, 11, 14, 16]), Candidate: [ 1  2  1  0  0  1  1  0  2  0  1  0  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  1 -1  0  0  0  1  0  0 -1  0  0  1] (Indices: [0, 2, 3, 4, 9, 14, 15, 16]), Candidate: [1 2 1 0 0 1 1 0 2 0 0 1 1 2 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 19750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  0  1 -1  1  0 -1  0  1 -1  0  0  1] (Indices: [0, 2, 3, 4, 10, 12, 13, 16]), Candidate: [ 1  2  1  0  0  1  1  0  1  2 -1  2  1  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  0  1 -1  0  0  0  0  1  0  0 -1  1] (Indices: [0, 2, 3, 4, 10, 16, 17, 18]), Candidate: [ 1  2  1  0  0  1  1  0  1  2 -1  1  1  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  0  0  1 -1  0  0  1  0  0 -1  0  1] (Indices: [0, 2, 3, 4, 11, 15, 16, 17]), Candidate: [1 2 1 0 0 1 1 0 1 1 1 0 1 1 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 19900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  0  0  0  0  1  0 -1  1 -1  1 -1  1] (Indices: [0, 2, 3, 4, 13, 14, 16, 18]), Candidate: [ 1  2  1  0  0  1  1  0  1  1  0  1  2  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  1 -1  0  0  0  0  0  0  0  0  1  0] (Indices: [0, 2, 3, 5, 6, 7, 9, 19]), Candidate: [ 1  2  1 -1  2  1  1 -1  2  0  0  1  1  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1  0 -1  0  0  0  1 -1  0  0  0  0  1] (Indices: [0, 2, 3, 5, 6, 8, 9, 14]), Candidate: [ 1  2  1 -1  2  1  0  1  1  0  0  1  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1 -1  0  0  0  0  0  0  0  0  1  0  0] (Indices: [0, 2, 3, 5, 6, 8, 18, 19]), Candidate: [ 1  2  1 -1  2  1  0  1  0  1  0  1  1  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  0  1  0 -1  0  0  0  1 -1  0  0  1] (Indices: [0, 2, 3, 5, 6, 10, 11, 16]), Candidate: [ 1  2  1 -1  2  1  0  0  1  2  0  0  1  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  0  0  1 -1  0  0  1  0 -1  0  0  1] (Indices: [0, 2, 3, 5, 6, 11, 15, 16]), Candidate: [ 1  2  1 -1  2  1  0  0  1  1  1  0  1  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  0  0  0  0  0  1 -1  1  0 -1  0  1] (Indices: [0, 2, 3, 5, 6, 14, 16, 17]), Candidate: [ 1  2  1 -1  2  1  0  0  1  1  0  1  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0 -1  0  0  0  1  0 -1  0  0  0  0  1] (Indices: [0, 2, 3, 5, 7, 8, 13, 14]), Candidate: [ 1  2  1 -1  2  0  2  0  0  1  0  1  2  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  1 -1  0  0  1 -1  0  0  0  0  1  0] (Indices: [0, 2, 3, 5, 7, 9, 13, 19]), Candidate: [ 1  2  1 -1  2  0  2 -1  2  0  0  1  2  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  0  1 -1  0  0  0  0  0  1 -1  1  0] (Indices: [0, 2, 3, 5, 7, 10, 17, 19]), Candidate: [ 1  2  1 -1  2  0  2 -1  1  2 -1  1  1  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 20400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  0  0  0  1 -1  0  0  0  0  1  0  0] (Indices: [0, 2, 3, 5, 7, 12, 18, 19]), Candidate: [ 1  2  1 -1  2  0  2 -1  1  1  0  2  0  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1  0 -1  1 -1  0  0  0  0  1 -1  0  1] (Indices: [0, 2, 3, 5, 8, 9, 11, 17]), Candidate: [ 1  2  1 -1  2  0  1  1  1  0  1  0  1  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1 -1  1 -1  0  1 -1  0  0  0  1 -1  1] (Indices: [0, 2, 3, 5, 8, 10, 13, 18]), Candidate: [ 1  2  1 -1  2  0  1  1  0  2 -1  1  2  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1 -1  0  0  1  0 -1  0  0  0  0  1  0] (Indices: [0, 2, 3, 5, 8, 12, 13, 19]), Candidate: [ 1  2  1 -1  2  0  1  1  0  1  0  2  1  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1 -1  0  0  0  0  0  0  0  1  0  0  0] (Indices: [0, 2, 3, 5, 8, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  0  1  1  0  1  0  1  1  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  1 -1  1 -1  0  1  0 -1  0  0  0  1] (Indices: [0, 2, 3, 5, 9, 11, 14, 15]), Candidate: [ 1  2  1 -1  2  0  1  0  2  0  1  0  1  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  1 -1  0  0  1 -1  0  0  0  1  0  0] (Indices: [0, 2, 3, 5, 9, 13, 18, 19]), Candidate: [ 1  2  1 -1  2  0  1  0  2  0  0  1  2  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  0  1 -1  1  0 -1  1 -1  0  0  0  1] (Indices: [0, 2, 3, 5, 10, 12, 13, 15]), Candidate: [ 1  2  1 -1  2  0  1  0  1  2 -1  2  1  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  0  1 -1  0  0  0  1 -1  0  1  0  0] (Indices: [0, 2, 3, 5, 10, 15, 18, 19]), Candidate: [ 1  2  1 -1  2  0  1  0  1  2 -1  1  1  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  0  0  1 -1  0  1 -1  0  0  1  0  0] (Indices: [0, 2, 3, 5, 11, 14, 18, 19]), Candidate: [ 1  2  1 -1  2  0  1  0  1  1  1  0  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  0  0  0  0  1  0 -1  1  0 -1  0  1] (Indices: [0, 2, 3, 5, 13, 14, 16, 17]), Candidate: [ 1  2  1 -1  2  0  1  0  1  1  0  1  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0 -1  0  1  0 -1  0  0  0  0  0  0  1] (Indices: [0, 2, 3, 6, 7, 8, 11, 12]), Candidate: [ 1  2  1 -1  1  2  1  0  0  1  1  1  0  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  1 -1  1 -1  0  0  0  0  1 -1  0  1] (Indices: [0, 2, 3, 6, 7, 9, 11, 17]), Candidate: [ 1  2  1 -1  1  2  1 -1  2  0  1  0  1  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  0  1 -1  0  1 -1  0  0  0  1 -1  1] (Indices: [0, 2, 3, 6, 7, 10, 13, 18]), Candidate: [ 1  2  1 -1  1  2  1 -1  1  2 -1  1  2  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 21100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  0  0  0  1  0 -1  0  0  0  0  1  0] (Indices: [0, 2, 3, 6, 7, 12, 13, 19]), Candidate: [ 1  2  1 -1  1  2  1 -1  1  1  0  2  1  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  0  0  0  0  0  0  0  0  1  0  0  0] (Indices: [0, 2, 3, 6, 7, 17, 18, 19]), Candidate: [ 1  2  1 -1  1  2  1 -1  1  1  0  1  1  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1 -1  1  0 -1  0  0  0  1 -1  0  0  1] (Indices: [0, 2, 3, 6, 8, 10, 11, 16]), Candidate: [ 1  2  1 -1  1  2  0  1  0  2  0  0  1  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1 -1  0  1 -1  0  0  1  0 -1  0  0  1] (Indices: [0, 2, 3, 6, 8, 11, 15, 16]), Candidate: [ 1  2  1 -1  1  2  0  1  0  1  1  0  1  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1 -1  0  0  0  0  1 -1  1  0 -1  0  1] (Indices: [0, 2, 3, 6, 8, 14, 16, 17]), Candidate: [ 1  2  1 -1  1  2  0  1  0  1  0  1  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  1  0 -1  0  0  0  0  0  1 -1  1  0] (Indices: [0, 2, 3, 6, 9, 10, 17, 19]), Candidate: [ 1  2  1 -1  1  2  0  0  2  1 -1  1  1  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  1 -1  0  1 -1  0  0  0  0  1  0  0] (Indices: [0, 2, 3, 6, 9, 12, 18, 19]), Candidate: [ 1  2  1 -1  1  2  0  0  2  0  0  2  0  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  0  1  0 -1  0  1 -1  1 -1  0  0  1] (Indices: [0, 2, 3, 6, 10, 11, 14, 16]), Candidate: [ 1  2  1 -1  1  2  0  0  1  2  0  0  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  0  1 -1  0  0  1  0  0 -1  0  0  1] (Indices: [0, 2, 3, 6, 10, 14, 15, 16]), Candidate: [ 1  2  1 -1  1  2  0  0  1  2 -1  1  1  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  0  0  1 -1  1 -1  0  1  0 -1  0  1] (Indices: [0, 2, 3, 6, 11, 13, 16, 17]), Candidate: [ 1  2  1 -1  1  2  0  0  1  1  1  0  2  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  0  0  0  1 -1  1 -1  0  0  1  0  0] (Indices: [0, 2, 3, 6, 12, 14, 18, 19]), Candidate: [ 1  2  1 -1  1  2  0  0  1  1  0  2  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0  0  0 -1  0  0  0  1 -1  0  0  0  1] (Indices: [0, 2, 3, 7, 8, 9, 10, 15]), Candidate: [ 1  2  1 -1  1  1  2  0  1  1 -1  1  1  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0 -1  1 -1  1 -1  1 -1  0  0  0  0  1] (Indices: [0, 2, 3, 7, 8, 10, 12, 14]), Candidate: [ 1  2  1 -1  1  1  2  0  0  2 -1  2  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 21750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0 -1  0  1 -1  0  0  0  1 -1  1 -1  1] (Indices: [0, 2, 3, 7, 8, 11, 16, 18]), Candidate: [ 1  2  1 -1  1  1  2  0  0  1  1  0  1  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0 -1  0  0  0  0  1 -1  0  0  1  0  0] (Indices: [0, 2, 3, 7, 8, 14, 18, 19]), Candidate: [ 1  2  1 -1  1  1  2  0  0  1  0  1  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  1 -1  1  0 -1  0  0  1 -1  0  0  1] (Indices: [0, 2, 3, 7, 9, 11, 12, 16]), Candidate: [ 1  2  1 -1  1  1  2 -1  2  0  1  1  0  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  1 -1  0  0  1  0 -1  0  0  0  1  0] (Indices: [0, 2, 3, 7, 9, 13, 14, 19]), Candidate: [ 1  2  1 -1  1  1  2 -1  2  0  0  1  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 21950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  0  1  0 -1  0  0  1 -1  1 -1  0  1] (Indices: [0, 2, 3, 7, 10, 11, 15, 17]), Candidate: [ 1  2  1 -1  1  1  2 -1  1  2  0  0  1  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 22000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  0  1 -1  0  0  1 -1  1 -1  1 -1  1] (Indices: [0, 2, 3, 7, 10, 14, 16, 18]), Candidate: [ 1  2  1 -1  1  1  2 -1  1  2 -1  1  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 22050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  0  0  1 -1  1 -1  0  0  0  1  0  0] (Indices: [0, 2, 3, 7, 11, 13, 18, 19]), Candidate: [ 1  2  1 -1  1  1  2 -1  1  1  1  0  2  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 22100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  0  0  0  1 -1  0  1 -1  1 -1  1  0] (Indices: [0, 2, 3, 7, 12, 15, 17, 19]), Candidate: [ 1  2  1 -1  1  1  2 -1  1  1  0  2  0  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 22150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1  0  0 -1  1 -1  1 -1  0  0  0  0  1] (Indices: [0, 2, 3, 8, 9, 10, 12, 14]), Candidate: [ 1  2  1 -1  1  1  1  1  1  1 -1  2  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 22200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1  0 -1  1 -1  0  0  0  1 -1  1 -1  1] (Indices: [0, 2, 3, 8, 9, 11, 16, 18]), Candidate: [ 1  2  1 -1  1  1  1  1  1  0  1  0  1  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1  0 -1  0  0  0  1 -1  0  0  1  0  0] (Indices: [0, 2, 3, 8, 9, 14, 18, 19]), Candidate: [ 1  2  1 -1  1  1  1  1  1  0  0  1  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 22300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1 -1  1 -1  1 -1  0  1  0 -1  0  0  1] (Indices: [0, 2, 3, 8, 10, 12, 15, 16]), Candidate: [ 1  2  1 -1  1  1  1  1  0  2 -1  2  0  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 22350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1 -1  0  1  0  0 -1  0  0  0  0  1  0] (Indices: [0, 2, 3, 8, 11, 12, 13, 19]), Candidate: [ 1  2  1 -1  1  1  1  1  0  1  1  1  1  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1 -1  0  1 -1  0  0  0  0  1  0  0  0] (Indices: [0, 2, 3, 8, 11, 17, 18, 19]), Candidate: [ 1  2  1 -1  1  1  1  1  0  1  1  0  1  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1 -1  0  0  0  1 -1  1 -1  1 -1  1  0] (Indices: [0, 2, 3, 8, 13, 15, 17, 19]), Candidate: [ 1  2  1 -1  1  1  1  1  0  1  0  1  2  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  1  0 -1  1  0 -1  1 -1  0  0  0  1] (Indices: [0, 2, 3, 9, 10, 12, 13, 15]), Candidate: [ 1  2  1 -1  1  1  1  0  2  1 -1  2  1  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 22550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  1  0 -1  0  0  0  1 -1  0  1  0  0] (Indices: [0, 2, 3, 9, 10, 15, 18, 19]), Candidate: [ 1  2  1 -1  1  1  1  0  2  1 -1  1  1  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 22600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  1 -1  1 -1  0  1 -1  0  0  1  0  0] (Indices: [0, 2, 3, 9, 11, 14, 18, 19]), Candidate: [ 1  2  1 -1  1  1  1  0  2  0  1  0  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 22650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  1 -1  0  0  1  0 -1  1  0 -1  0  1] (Indices: [0, 2, 3, 9, 13, 14, 16, 17]), Candidate: [ 1  2  1 -1  1  1  1  0  2  0  0  1  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 22700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  0  1  0  0 -1  0  0  0  1 -1  1  0] (Indices: [0, 2, 3, 10, 11, 12, 17, 19]), Candidate: [ 1  2  1 -1  1  1  1  0  1  2  0  1  0  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  0  1 -1  1  0 -1  0  0  1 -1  1  0] (Indices: [0, 2, 3, 10, 12, 13, 17, 19]), Candidate: [ 1  2  1 -1  1  1  1  0  1  2 -1  2  1  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 22800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  0  1 -1  0  0  1 -1  1 -1  1  0  0] (Indices: [0, 2, 3, 10, 14, 16, 18, 19]), Candidate: [ 1  2  1 -1  1  1  1  0  1  2 -1  1  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 22850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  0  0  1 -1  1  0 -1  0  1 -1  1  0] (Indices: [0, 2, 3, 11, 13, 14, 17, 19]), Candidate: [ 1  2  1 -1  1  1  1  0  1  1  1  0  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 22900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  0  0  0  1 -1  1  0 -1  1  0 -1  1] (Indices: [0, 2, 3, 12, 14, 15, 17, 18]), Candidate: [ 1  2  1 -1  1  1  1  0  1  1  0  2  0  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  1 -1  0  0  0  0  0  1 -1  0  0  1] (Indices: [0, 2, 4, 5, 6, 7, 9, 16]), Candidate: [ 1  2  0  1  1  1  1 -1  2  0  0  1  1  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1  0 -1  1 -1  0  0  0  0  0  0  0  1] (Indices: [0, 2, 4, 5, 6, 8, 9, 11]), Candidate: [1 2 0 1 1 1 0 1 1 0 1 0 1 1 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 23050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1 -1  0  0  0  0  0  0  1 -1  0  1  0] (Indices: [0, 2, 4, 5, 6, 8, 16, 19]), Candidate: [1 2 0 1 1 1 0 1 0 1 0 1 1 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 23100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  0  1  0 -1  1 -1  0  0  0  0  0  1] (Indices: [0, 2, 4, 5, 6, 10, 11, 13]), Candidate: [1 2 0 1 1 1 0 0 1 2 0 0 2 0 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 23150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  0  0  1 -1  0  1 -1  0  1 -1  0  1] (Indices: [0, 2, 4, 5, 6, 11, 14, 17]), Candidate: [ 1  2  0  1  1  1  0  0  1  1  1  0  1  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  0  0  0  0  0  1  0 -1  1 -1  0  1] (Indices: [0, 2, 4, 5, 6, 14, 15, 17]), Candidate: [1 2 0 1 1 1 0 0 1 1 0 1 1 2 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 23250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0 -1  0  0  1 -1  0  0  0  1 -1  0  1] (Indices: [0, 2, 4, 5, 7, 8, 12, 17]), Candidate: [1 2 0 1 1 0 2 0 0 1 0 2 0 1 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 23300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  1 -1  0  0  1 -1  0  1 -1  0  0  1] (Indices: [0, 2, 4, 5, 7, 9, 13, 16]), Candidate: [ 1  2  0  1  1  0  2 -1  2  0  0  1  2  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  0  1 -1  0  0  0  0  1 -1  1 -1  1] (Indices: [0, 2, 4, 5, 7, 10, 16, 18]), Candidate: [ 1  2  0  1  1  0  2 -1  1  2 -1  1  1  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 23400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  0  0  0  1 -1  0  0  1 -1  0  1  0] (Indices: [0, 2, 4, 5, 7, 12, 16, 19]), Candidate: [ 1  2  0  1  1  0  2 -1  1  1  0  2  0  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1  0 -1  1 -1  0  1 -1  0  0  0  0  1] (Indices: [0, 2, 4, 5, 8, 9, 11, 14]), Candidate: [ 1  2  0  1  1  0  1  1  1  0  1  0  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1 -1  1 -1  0  1 -1  1 -1  0  0  0  1] (Indices: [0, 2, 4, 5, 8, 10, 13, 15]), Candidate: [ 1  2  0  1  1  0  1  1  0  2 -1  1  2  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1 -1  0  0  1  0 -1  0  1 -1  0  0  1] (Indices: [0, 2, 4, 5, 8, 12, 13, 16]), Candidate: [1 2 0 1 1 0 1 1 0 1 0 2 1 0 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 23600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1 -1  0  0  0  0  0  0  1  0  0 -1  1] (Indices: [0, 2, 4, 5, 8, 16, 17, 18]), Candidate: [1 2 0 1 1 0 1 1 0 1 0 1 1 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 23650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  1 -1  1 -1  1 -1  0  0  1 -1  0  1] (Indices: [0, 2, 4, 5, 9, 11, 13, 17]), Candidate: [1 2 0 1 1 0 1 0 2 0 1 0 2 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 23700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  1 -1  0  0  1 -1  0  1 -1  0  1  0] (Indices: [0, 2, 4, 5, 9, 13, 16, 19]), Candidate: [1 2 0 1 1 0 1 0 2 0 0 1 2 0 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 23750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  0  1  0 -1  0  0  0  0  1 -1  1  0] (Indices: [0, 2, 4, 5, 10, 11, 17, 19]), Candidate: [1 2 0 1 1 0 1 0 1 2 0 0 1 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 23800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  0  1 -1  0  0  0  1  0 -1  0  1  0] (Indices: [0, 2, 4, 5, 10, 15, 16, 19]), Candidate: [ 1  2  0  1  1  0  1  0  1  2 -1  1  1  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  0  0  1 -1  0  1 -1  1 -1  0  1  0] (Indices: [0, 2, 4, 5, 11, 14, 16, 19]), Candidate: [ 1  2  0  1  1  0  1  0  1  1  1  0  1  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  0  0  0  0  1  0  0 -1  1 -1  0  1] (Indices: [0, 2, 4, 5, 13, 14, 15, 17]), Candidate: [1 2 0 1 1 0 1 0 1 1 0 1 2 1 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 23950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0 -1  1 -1  0  0  0  0  0  1 -1  0  1] (Indices: [0, 2, 4, 6, 7, 8, 10, 17]), Candidate: [ 1  2  0  1  0  2  1  0  0  2 -1  1  1  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  1 -1  1 -1  0  1 -1  0  0  0  0  1] (Indices: [0, 2, 4, 6, 7, 9, 11, 14]), Candidate: [ 1  2  0  1  0  2  1 -1  2  0  1  0  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 24050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  0  1 -1  0  1 -1  1 -1  0  0  0  1] (Indices: [0, 2, 4, 6, 7, 10, 13, 15]), Candidate: [ 1  2  0  1  0  2  1 -1  1  2 -1  1  2  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 24100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  0  0  0  1  0 -1  0  1 -1  0  0  1] (Indices: [0, 2, 4, 6, 7, 12, 13, 16]), Candidate: [ 1  2  0  1  0  2  1 -1  1  1  0  2  1  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  0  0  0  0  0  0  0  1  0  0 -1  1] (Indices: [0, 2, 4, 6, 7, 16, 17, 18]), Candidate: [ 1  2  0  1  0  2  1 -1  1  1  0  1  1  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1 -1  1  0 -1  1 -1  0  0  0  0  0  1] (Indices: [0, 2, 4, 6, 8, 10, 11, 13]), Candidate: [1 2 0 1 0 2 0 1 0 2 0 0 2 0 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 24250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1 -1  0  1 -1  0  1 -1  0  1 -1  0  1] (Indices: [0, 2, 4, 6, 8, 11, 14, 17]), Candidate: [ 1  2  0  1  0  2  0  1  0  1  1  0  1  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1 -1  0  0  0  0  1  0 -1  1 -1  0  1] (Indices: [0, 2, 4, 6, 8, 14, 15, 17]), Candidate: [1 2 0 1 0 2 0 1 0 1 0 1 1 2 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 24350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  1  0 -1  0  0  0  0  1 -1  1 -1  1] (Indices: [0, 2, 4, 6, 9, 10, 16, 18]), Candidate: [ 1  2  0  1  0  2  0  0  2  1 -1  1  1  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  1 -1  0  1 -1  0  0  1 -1  0  1  0] (Indices: [0, 2, 4, 6, 9, 12, 16, 19]), Candidate: [1 2 0 1 0 2 0 0 2 0 0 2 0 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 24450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  0  1  0 -1  1 -1  0  0  0  1 -1  1] (Indices: [0, 2, 4, 6, 10, 11, 13, 18]), Candidate: [1 2 0 1 0 2 0 0 1 2 0 0 2 0 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 24500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  0  1 -1  0  1 -1  0  0  1  0 -1  1] (Indices: [0, 2, 4, 6, 10, 13, 17, 18]), Candidate: [ 1  2  0  1  0  2  0  0  1  2 -1  1  2  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  0  0  1 -1  1 -1  1 -1  1 -1  0  1] (Indices: [0, 2, 4, 6, 11, 13, 15, 17]), Candidate: [1 2 0 1 0 2 0 0 1 1 1 0 2 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 24600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  0  0  0  1 -1  1 -1  1 -1  0  1  0] (Indices: [0, 2, 4, 6, 12, 14, 16, 19]), Candidate: [ 1  2  0  1  0  2  0  0  1  1  0  2  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0  0  0 -1  1 -1  0  0  0  0  0  0  1] (Indices: [0, 2, 4, 7, 8, 9, 10, 12]), Candidate: [ 1  2  0  1  0  1  2  0  1  1 -1  2  0  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0 -1  1  0 -1  0  0  0  0  0  1 -1  1] (Indices: [0, 2, 4, 7, 8, 10, 11, 18]), Candidate: [1 2 0 1 0 1 2 0 0 2 0 0 1 1 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 24750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0 -1  0  1 -1  0  0  1 -1  0  1 -1  1] (Indices: [0, 2, 4, 7, 8, 11, 15, 18]), Candidate: [1 2 0 1 0 1 2 0 0 1 1 0 1 1 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 24800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0 -1  0  0  0  0  1 -1  1 -1  0  1  0] (Indices: [0, 2, 4, 7, 8, 14, 16, 19]), Candidate: [ 1  2  0  1  0  1  2  0  0  1  0  1  1  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  1 -1  1  0  0 -1  0  0  0  0  0  1] (Indices: [0, 2, 4, 7, 9, 11, 12, 13]), Candidate: [ 1  2  0  1  0  1  2 -1  2  0  1  1  1  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  1 -1  0  0  1  0 -1  1 -1  0  0  1] (Indices: [0, 2, 4, 7, 9, 13, 14, 16]), Candidate: [ 1  2  0  1  0  1  2 -1  2  0  0  1  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 24950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  0  1  0 -1  0  1 -1  0  0  1 -1  1] (Indices: [0, 2, 4, 7, 10, 11, 14, 18]), Candidate: [ 1  2  0  1  0  1  2 -1  1  2  0  0  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 25000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  0  1 -1  0  0  1  0 -1  0  1 -1  1] (Indices: [0, 2, 4, 7, 10, 14, 15, 18]), Candidate: [ 1  2  0  1  0  1  2 -1  1  2 -1  1  1  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 25050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  0  0  1 -1  1 -1  0  1 -1  0  1  0] (Indices: [0, 2, 4, 7, 11, 13, 16, 19]), Candidate: [ 1  2  0  1  0  1  2 -1  1  1  1  0  2  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  0  0  0  1 -1  0  1  0 -1  1 -1  1] (Indices: [0, 2, 4, 7, 12, 15, 16, 18]), Candidate: [ 1  2  0  1  0  1  2 -1  1  1  0  2  0  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1  0  0  0 -1  0  0  0  0  0  1 -1  1] (Indices: [0, 2, 4, 8, 9, 10, 11, 18]), Candidate: [1 2 0 1 0 1 1 1 1 1 0 0 1 1 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 25200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1  0 -1  1 -1  0  0  1 -1  0  1 -1  1] (Indices: [0, 2, 4, 8, 9, 11, 15, 18]), Candidate: [1 2 0 1 0 1 1 1 1 0 1 0 1 1 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 25250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1  0 -1  0  0  0  1 -1  1 -1  0  1  0] (Indices: [0, 2, 4, 8, 9, 14, 16, 19]), Candidate: [ 1  2  0  1  0  1  1  1  1  0  0  1  1  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1 -1  1 -1  1 -1  1 -1  0  1 -1  0  1] (Indices: [0, 2, 4, 8, 10, 12, 14, 17]), Candidate: [ 1  2  0  1  0  1  1  1  0  2 -1  2  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 25350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1 -1  0  1  0  0 -1  0  1 -1  0  0  1] (Indices: [0, 2, 4, 8, 11, 12, 13, 16]), Candidate: [1 2 0 1 0 1 1 1 0 1 1 1 1 0 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 25400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1 -1  0  1 -1  0  0  0  1  0  0 -1  1] (Indices: [0, 2, 4, 8, 11, 16, 17, 18]), Candidate: [1 2 0 1 0 1 1 1 0 1 1 0 1 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 25450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1 -1  0  0  0  1 -1  1  0 -1  1 -1  1] (Indices: [0, 2, 4, 8, 13, 15, 16, 18]), Candidate: [1 2 0 1 0 1 1 1 0 1 0 1 2 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 25500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  1  0  0 -1  0  0  0  0  1 -1  1  0] (Indices: [0, 2, 4, 9, 10, 11, 17, 19]), Candidate: [1 2 0 1 0 1 1 0 2 1 0 0 1 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 25550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  1  0 -1  0  0  0  1  0 -1  0  1  0] (Indices: [0, 2, 4, 9, 10, 15, 16, 19]), Candidate: [ 1  2  0  1  0  1  1  0  2  1 -1  1  1  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  1 -1  1 -1  0  1 -1  1 -1  0  1  0] (Indices: [0, 2, 4, 9, 11, 14, 16, 19]), Candidate: [ 1  2  0  1  0  1  1  0  2  0  1  0  1  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  1 -1  0  0  1  0  0 -1  1 -1  0  1] (Indices: [0, 2, 4, 9, 13, 14, 15, 17]), Candidate: [1 2 0 1 0 1 1 0 2 0 0 1 2 1 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 25700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  0  1  0  0 -1  0  0  1 -1  1 -1  1] (Indices: [0, 2, 4, 10, 11, 12, 16, 18]), Candidate: [1 2 0 1 0 1 1 0 1 2 0 1 0 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 25750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  0  1 -1  1  0 -1  0  1 -1  1 -1  1] (Indices: [0, 2, 4, 10, 12, 13, 16, 18]), Candidate: [ 1  2  0  1  0  1  1  0  1  2 -1  2  1  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  0  1 -1  0  0  1  0 -1  0  1  0  0] (Indices: [0, 2, 4, 10, 14, 15, 18, 19]), Candidate: [ 1  2  0  1  0  1  1  0  1  2 -1  1  1  2  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  0  0  1 -1  1  0 -1  1 -1  1 -1  1] (Indices: [0, 2, 4, 11, 13, 14, 16, 18]), Candidate: [ 1  2  0  1  0  1  1  0  1  1  1  0  2  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  0  0  0  1 -1  1  0  0  0 -1  0  1] (Indices: [0, 2, 4, 12, 14, 15, 16, 17]), Candidate: [1 2 0 1 0 1 1 0 1 1 0 2 0 2 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 25950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0 -1  1 -1  0  0  0  1 -1  0  0  0  1] (Indices: [0, 2, 5, 6, 7, 8, 10, 15]), Candidate: [ 1  2  0  0  2  1  1  0  0  2 -1  1  1  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  1 -1  1  0 -1  0  0  0  0  0  0  1] (Indices: [0, 2, 5, 6, 7, 9, 11, 12]), Candidate: [ 1  2  0  0  2  1  1 -1  2  0  1  1  0  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  0  1 -1  1 -1  0  0  0  0  0  1  0] (Indices: [0, 2, 5, 6, 7, 10, 12, 19]), Candidate: [ 1  2  0  0  2  1  1 -1  1  2 -1  2  0  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 26100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  0  0  0  1  0  0 -1  0  0  0  0  1] (Indices: [0, 2, 5, 6, 7, 12, 13, 14]), Candidate: [ 1  2  0  0  2  1  1 -1  1  1  0  2  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 26150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  0  0  0  0  0  0  1 -1  1 -1  1  0] (Indices: [0, 2, 5, 6, 7, 15, 17, 19]), Candidate: [ 1  2  0  0  2  1  1 -1  1  1  0  1  1  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1  0 -1  0  0  0  0  0  0  0  1  0  0] (Indices: [0, 2, 5, 6, 8, 9, 18, 19]), Candidate: [1 2 0 0 2 1 0 1 1 0 0 1 1 1 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 26250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1 -1  0  1 -1  0  1  0 -1  0  0  0  1] (Indices: [0, 2, 5, 6, 8, 11, 14, 15]), Candidate: [1 2 0 0 2 1 0 1 0 1 1 0 1 2 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 26300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1 -1  0  0  0  1 -1  0  0  0  1  0  0] (Indices: [0, 2, 5, 6, 8, 13, 18, 19]), Candidate: [1 2 0 0 2 1 0 1 0 1 0 1 2 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 26350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  1  0 -1  0  0  0  1 -1  0  0  1  0] (Indices: [0, 2, 5, 6, 9, 10, 15, 19]), Candidate: [ 1  2  0  0  2  1  0  0  2  1 -1  1  1  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  1 -1  0  1 -1  0  0  1  0 -1  0  1] (Indices: [0, 2, 5, 6, 9, 12, 16, 17]), Candidate: [1 2 0 0 2 1 0 0 2 0 0 2 0 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 26450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  0  1  0 -1  1 -1  0  1 -1  0  0  1] (Indices: [0, 2, 5, 6, 10, 11, 13, 16]), Candidate: [1 2 0 0 2 1 0 0 1 2 0 0 2 0 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 26500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  0  1 -1  0  1 -1  0  1 -1  1 -1  1] (Indices: [0, 2, 5, 6, 10, 13, 16, 18]), Candidate: [ 1  2  0  0  2  1  0  0  1  2 -1  1  2  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  0  0  1 -1  1  0 -1  0  0  0  1  0] (Indices: [0, 2, 5, 6, 11, 13, 14, 19]), Candidate: [ 1  2  0  0  2  1  0  0  1  1  1  0  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  0  0  0  1 -1  1 -1  1  0 -1  0  1] (Indices: [0, 2, 5, 6, 12, 14, 16, 17]), Candidate: [ 1  2  0  0  2  1  0  0  1  1  0  2  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  0  0  0  0  0  0  0  1  0  0  0  0] (Indices: [0, 2, 5, 6, 16, 17, 18, 19]), Candidate: [1 2 0 0 2 1 0 0 1 1 0 1 1 1 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 26700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0 -1  1  0 -1  0  0  0  1 -1  0  0  1] (Indices: [0, 2, 5, 7, 8, 10, 11, 16]), Candidate: [1 2 0 0 2 0 2 0 0 2 0 0 1 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 26750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0 -1  0  1 -1  0  0  1  0 -1  0  0  1] (Indices: [0, 2, 5, 7, 8, 11, 15, 16]), Candidate: [1 2 0 0 2 0 2 0 0 1 1 0 1 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 26800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0 -1  0  0  0  0  1 -1  1  0 -1  0  1] (Indices: [0, 2, 5, 7, 8, 14, 16, 17]), Candidate: [ 1  2  0  0  2  0  2  0  0  1  0  1  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  1  0 -1  0  0  0  0  0  1 -1  1  0] (Indices: [0, 2, 5, 7, 9, 10, 17, 19]), Candidate: [ 1  2  0  0  2  0  2 -1  2  1 -1  1  1  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 26900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  1 -1  0  1 -1  0  0  0  0  1  0  0] (Indices: [0, 2, 5, 7, 9, 12, 18, 19]), Candidate: [ 1  2  0  0  2  0  2 -1  2  0  0  2  0  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  0  1  0 -1  0  1 -1  1 -1  0  0  1] (Indices: [0, 2, 5, 7, 10, 11, 14, 16]), Candidate: [ 1  2  0  0  2  0  2 -1  1  2  0  0  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  0  1 -1  0  0  1  0  0 -1  0  0  1] (Indices: [0, 2, 5, 7, 10, 14, 15, 16]), Candidate: [ 1  2  0  0  2  0  2 -1  1  2 -1  1  1  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  0  0  1 -1  1 -1  0  1  0 -1  0  1] (Indices: [0, 2, 5, 7, 11, 13, 16, 17]), Candidate: [ 1  2  0  0  2  0  2 -1  1  1  1  0  2  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  0  0  0  1 -1  1 -1  0  0  1  0  0] (Indices: [0, 2, 5, 7, 12, 14, 18, 19]), Candidate: [ 1  2  0  0  2  0  2 -1  1  1  0  2  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1  0  0  0 -1  0  0  0  1 -1  0  0  1] (Indices: [0, 2, 5, 8, 9, 10, 11, 16]), Candidate: [1 2 0 0 2 0 1 1 1 1 0 0 1 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 27200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1  0 -1  1 -1  0  0  1  0 -1  0  0  1] (Indices: [0, 2, 5, 8, 9, 11, 15, 16]), Candidate: [1 2 0 0 2 0 1 1 1 0 1 0 1 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 27250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1  0 -1  0  0  0  1 -1  1  0 -1  0  1] (Indices: [0, 2, 5, 8, 9, 14, 16, 17]), Candidate: [ 1  2  0  0  2  0  1  1  1  0  0  1  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1 -1  1 -1  1 -1  1  0 -1  0  0  0  1] (Indices: [0, 2, 5, 8, 10, 12, 14, 15]), Candidate: [ 1  2  0  0  2  0  1  1  0  2 -1  2  0  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1 -1  0  1  0  0  0 -1  0  0  0  0  1] (Indices: [0, 2, 5, 8, 11, 12, 13, 14]), Candidate: [ 1  2  0  0  2  0  1  1  0  1  1  1  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1 -1  0  1 -1  0  0  1 -1  1 -1  1  0] (Indices: [0, 2, 5, 8, 11, 15, 17, 19]), Candidate: [1 2 0 0 2 0 1 1 0 1 1 0 1 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 27450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1 -1  0  0  0  1  0 -1  0  0  1  0  0] (Indices: [0, 2, 5, 8, 13, 14, 18, 19]), Candidate: [ 1  2  0  0  2  0  1  1  0  1  0  1  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  1  0  0 -1  0  0  0  1 -1  0  1  0] (Indices: [0, 2, 5, 9, 10, 11, 16, 19]), Candidate: [1 2 0 0 2 0 1 0 2 1 0 0 1 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 27550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  1  0 -1  0  0  0  1  0  0 -1  0  1] (Indices: [0, 2, 5, 9, 10, 15, 16, 17]), Candidate: [ 1  2  0  0  2  0  1  0  2  1 -1  1  1  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  1 -1  1 -1  0  1 -1  1  0 -1  0  1] (Indices: [0, 2, 5, 9, 11, 14, 16, 17]), Candidate: [ 1  2  0  0  2  0  1  0  2  0  1  0  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  1 -1  0  1 -1  0  0  0  1  0  0  0] (Indices: [0, 2, 5, 9, 12, 17, 18, 19]), Candidate: [1 2 0 0 2 0 1 0 2 0 0 2 0 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 27700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  0  1  0  0 -1  0  1 -1  0  0  1  0] (Indices: [0, 2, 5, 10, 11, 12, 15, 19]), Candidate: [1 2 0 0 2 0 1 0 1 2 0 1 0 1 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 27750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  0  1 -1  1  0 -1  1 -1  0  0  1  0] (Indices: [0, 2, 5, 10, 12, 13, 15, 19]), Candidate: [ 1  2  0  0  2  0  1  0  1  2 -1  2  1  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  0  1 -1  0  0  1  0 -1  1  0 -1  1] (Indices: [0, 2, 5, 10, 14, 15, 17, 18]), Candidate: [ 1  2  0  0  2  0  1  0  1  2 -1  1  1  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  0  0  1 -1  1  0  0 -1  0  0  1  0] (Indices: [0, 2, 5, 11, 13, 14, 15, 19]), Candidate: [1 2 0 0 2 0 1 0 1 1 1 0 2 1 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 27900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  0  0  0  1  0 -1  0  1 -1  1  0  0] (Indices: [0, 2, 5, 12, 13, 16, 18, 19]), Candidate: [1 2 0 0 2 0 1 0 1 1 0 2 1 0 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 27950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0  0 -1  1 -1  0  0  1 -1  0  0  0  1] (Indices: [0, 2, 6, 7, 8, 9, 11, 15]), Candidate: [1 2 0 0 1 2 1 0 1 0 1 0 1 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 28000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0 -1  1 -1  0  1 -1  0  1 -1  0  0  1] (Indices: [0, 2, 6, 7, 8, 10, 13, 16]), Candidate: [ 1  2  0  0  1  2  1  0  0  2 -1  1  2  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0 -1  0  0  1  0 -1  0  0  1 -1  0  1] (Indices: [0, 2, 6, 7, 8, 12, 13, 17]), Candidate: [1 2 0 0 1 2 1 0 0 1 0 2 1 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 28100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0 -1  0  0  0  0  0  0  1  0 -1  1  0] (Indices: [0, 2, 6, 7, 8, 16, 17, 19]), Candidate: [1 2 0 0 1 2 1 0 0 1 0 1 1 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 28150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  1 -1  1 -1  1 -1  0  0  0  1 -1  1] (Indices: [0, 2, 6, 7, 9, 11, 13, 18]), Candidate: [ 1  2  0  0  1  2  1 -1  2  0  1  0  2  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  1 -1  0  0  1 -1  0  0  1  0 -1  1] (Indices: [0, 2, 6, 7, 9, 13, 17, 18]), Candidate: [ 1  2  0  0  1  2  1 -1  2  0  0  1  2  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  0  1  0 -1  0  0  0  0  0  1  0  0] (Indices: [0, 2, 6, 7, 10, 11, 18, 19]), Candidate: [ 1  2  0  0  1  2  1 -1  1  2  0  0  1  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  0  1 -1  0  0  0  1 -1  1  0 -1  1] (Indices: [0, 2, 6, 7, 10, 15, 17, 18]), Candidate: [ 1  2  0  0  1  2  1 -1  1  2 -1  1  1  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  0  0  1 -1  0  1 -1  0  1  0 -1  1] (Indices: [0, 2, 6, 7, 11, 14, 17, 18]), Candidate: [ 1  2  0  0  1  2  1 -1  1  1  1  0  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  0  0  0  0  1  0  0 -1  0  1 -1  1] (Indices: [0, 2, 6, 7, 13, 14, 15, 18]), Candidate: [ 1  2  0  0  1  2  1 -1  1  1  0  1  2  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1  0  0 -1  0  1 -1  0  1 -1  0  0  1] (Indices: [0, 2, 6, 8, 9, 10, 13, 16]), Candidate: [ 1  2  0  0  1  2  0  1  1  1 -1  1  2  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1  0 -1  0  1  0 -1  0  0  1 -1  0  1] (Indices: [0, 2, 6, 8, 9, 12, 13, 17]), Candidate: [1 2 0 0 1 2 0 1 1 0 0 2 1 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 28550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1  0 -1  0  0  0  0  0  1  0 -1  1  0] (Indices: [0, 2, 6, 8, 9, 16, 17, 19]), Candidate: [1 2 0 0 1 2 0 1 1 0 0 1 1 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 28600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1 -1  1 -1  1 -1  0  0  0  1 -1  1  0] (Indices: [0, 2, 6, 8, 10, 12, 17, 19]), Candidate: [ 1  2  0  0  1  2  0  1  0  2 -1  2  0  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1 -1  0  1  0 -1  0  1 -1  0  1 -1  1] (Indices: [0, 2, 6, 8, 11, 12, 15, 18]), Candidate: [1 2 0 0 1 2 0 1 0 1 1 1 0 1 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 28700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1 -1  0  0  1  0 -1  1 -1  0  1 -1  1] (Indices: [0, 2, 6, 8, 12, 13, 15, 18]), Candidate: [1 2 0 0 1 2 0 1 0 1 0 2 1 0 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 28750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1 -1  0  0  0  0  1  0  0 -1  0  1  0] (Indices: [0, 2, 6, 8, 14, 15, 16, 19]), Candidate: [1 2 0 0 1 2 0 1 0 1 0 1 1 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 28800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  1  0 -1  1 -1  1 -1  0  0  1 -1  1] (Indices: [0, 2, 6, 9, 10, 12, 14, 18]), Candidate: [ 1  2  0  0  1  2  0  0  2  1 -1  2  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  1 -1  1  0  0 -1  0  0  1 -1  0  1] (Indices: [0, 2, 6, 9, 11, 12, 13, 17]), Candidate: [1 2 0 0 1 2 0 0 2 0 1 1 1 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 28900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  1 -1  1 -1  0  0  0  1  0 -1  1  0] (Indices: [0, 2, 6, 9, 11, 16, 17, 19]), Candidate: [1 2 0 0 1 2 0 0 2 0 1 0 1 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 28950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  1 -1  0  0  1 -1  1  0 -1  0  1  0] (Indices: [0, 2, 6, 9, 13, 15, 16, 19]), Candidate: [1 2 0 0 1 2 0 0 2 0 0 1 2 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 29000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  0  1  0 -1  1 -1  1 -1  1 -1  0  1] (Indices: [0, 2, 6, 10, 11, 13, 15, 17]), Candidate: [1 2 0 0 1 2 0 0 1 2 0 0 2 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 29050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  0  1 -1  1 -1  1 -1  1 -1  0  1  0] (Indices: [0, 2, 6, 10, 12, 14, 16, 19]), Candidate: [ 1  2  0  0  1  2  0  0  1  2 -1  2  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  0  0  1  0  0  0 -1  1 -1  0  0  1] (Indices: [0, 2, 6, 11, 12, 13, 14, 16]), Candidate: [ 1  2  0  0  1  2  0  0  1  1  1  1  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  0  0  1 -1  1 -1  0  1  0  0 -1  1] (Indices: [0, 2, 6, 11, 13, 16, 17, 18]), Candidate: [1 2 0 0 1 2 0 0 1 1 1 0 2 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 29200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  0  0  0  1 -1  0  1  0  0 -1  1  0] (Indices: [0, 2, 6, 12, 15, 16, 17, 19]), Candidate: [1 2 0 0 1 2 0 0 1 1 0 2 0 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 29250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0  0  0 -1  0  0  1 -1  0  0  0  1  0] (Indices: [0, 2, 7, 8, 9, 10, 14, 19]), Candidate: [ 1  2  0  0  1  1  2  0  1  1 -1  1  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0  0 -1  0  1 -1  0  1  0 -1  0  0  1] (Indices: [0, 2, 7, 8, 9, 12, 15, 16]), Candidate: [1 2 0 0 1 1 2 0 1 0 0 2 0 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 29350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0 -1  1  0  0 -1  0  0  0  0  1 -1  1] (Indices: [0, 2, 7, 8, 10, 11, 12, 18]), Candidate: [1 2 0 0 1 1 2 0 0 2 0 1 0 1 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 29400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0 -1  1 -1  0  1 -1  1 -1  1 -1  0  1] (Indices: [0, 2, 7, 8, 10, 13, 15, 17]), Candidate: [ 1  2  0  0  1  1  2  0  0  2 -1  1  2  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0 -1  0  1 -1  1  0  0 -1  0  0  0  1] (Indices: [0, 2, 7, 8, 11, 13, 14, 15]), Candidate: [1 2 0 0 1 1 2 0 0 1 1 0 2 1 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 29500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0 -1  0  0  1 -1  1  0  0 -1  0  0  1] (Indices: [0, 2, 7, 8, 12, 14, 15, 16]), Candidate: [1 2 0 0 1 1 2 0 0 1 0 2 0 2 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 29550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0 -1  0  0  0  0  0  1  0  0  0 -1  1] (Indices: [0, 2, 7, 8, 15, 16, 17, 18]), Candidate: [1 2 0 0 1 1 2 0 0 1 0 1 1 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 29600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  1  0 -1  1 -1  0  0  1 -1  0  1  0] (Indices: [0, 2, 7, 9, 10, 12, 16, 19]), Candidate: [ 1  2  0  0  1  1  2 -1  2  1 -1  2  0  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  1 -1  1  0 -1  0  1  0 -1  0  0  1] (Indices: [0, 2, 7, 9, 11, 12, 15, 16]), Candidate: [ 1  2  0  0  1  1  2 -1  2  0  1  1  0  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  1 -1  0  1  0 -1  1  0 -1  0  0  1] (Indices: [0, 2, 7, 9, 12, 13, 15, 16]), Candidate: [ 1  2  0  0  1  1  2 -1  2  0  0  2  1  0  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  1 -1  0  0  0  1  0  0  0 -1  0  1] (Indices: [0, 2, 7, 9, 14, 15, 16, 17]), Candidate: [ 1  2  0  0  1  1  2 -1  2  0  0  1  1  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  0  1  0 -1  1 -1  0  0  0  1  0  0] (Indices: [0, 2, 7, 10, 11, 13, 18, 19]), Candidate: [ 1  2  0  0  1  1  2 -1  1  2  0  0  2  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  0  1 -1  1 -1  0  1 -1  1 -1  1  0] (Indices: [0, 2, 7, 10, 12, 15, 17, 19]), Candidate: [ 1  2  0  0  1  1  2 -1  1  2 -1  2  0  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  0  0  1  0  0 -1  0  1  0 -1  0  1] (Indices: [0, 2, 7, 11, 12, 13, 16, 17]), Candidate: [ 1  2  0  0  1  1  2 -1  1  1  1  1  1  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  0  0  1 -1  0  1  0 -1  1 -1  1  0] (Indices: [0, 2, 7, 11, 14, 15, 17, 19]), Candidate: [ 1  2  0  0  1  1  2 -1  1  1  1  0  1  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  0  0  0  0  1  0  0 -1  1 -1  1  0] (Indices: [0, 2, 7, 13, 14, 15, 17, 19]), Candidate: [ 1  2  0  0  1  1  2 -1  1  1  0  1  2  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1  0  0 -1  1  0 -1  0  0  0  0  1  0] (Indices: [0, 2, 8, 9, 10, 12, 13, 19]), Candidate: [ 1  2  0  0  1  1  1  1  1  1 -1  2  1  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1  0  0 -1  0  0  0  0  0  1  0  0  0] (Indices: [0, 2, 8, 9, 10, 17, 18, 19]), Candidate: [ 1  2  0  0  1  1  1  1  1  1 -1  1  1  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1  0 -1  1 -1  0  0  1 -1  1  0 -1  1] (Indices: [0, 2, 8, 9, 11, 15, 17, 18]), Candidate: [1 2 0 0 1 1 1 1 1 0 1 0 1 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 30200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1  0 -1  0  0  1  0 -1  0  1 -1  1  0] (Indices: [0, 2, 8, 9, 13, 14, 17, 19]), Candidate: [ 1  2  0  0  1  1  1  1  1  0  0  1  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1 -1  1  0 -1  1  0 -1  0  1 -1  0  1] (Indices: [0, 2, 8, 10, 11, 13, 14, 17]), Candidate: [ 1  2  0  0  1  1  1  1  0  2  0  0  2  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1 -1  1 -1  1 -1  1  0 -1  0  1 -1  1] (Indices: [0, 2, 8, 10, 12, 14, 15, 18]), Candidate: [ 1  2  0  0  1  1  1  1  0  2 -1  2  0  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1 -1  1 -1  0  0  0  1  0 -1  1  0  0] (Indices: [0, 2, 8, 10, 15, 16, 18, 19]), Candidate: [ 1  2  0  0  1  1  1  1  0  2 -1  1  1  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1 -1  0  1 -1  1 -1  1  0 -1  0  1  0] (Indices: [0, 2, 8, 11, 13, 15, 16, 19]), Candidate: [1 2 0 0 1 1 1 1 0 1 1 0 2 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 30450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1 -1  0  0  1 -1  1 -1  1  0 -1  1  0] (Indices: [0, 2, 8, 12, 14, 16, 17, 19]), Candidate: [ 1  2  0  0  1  1  1  1  0  1  0  2  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  1  0  0 -1  1  0  0 -1  0  0  0  1] (Indices: [0, 2, 9, 10, 11, 13, 14, 15]), Candidate: [1 2 0 0 1 1 1 0 2 1 0 0 2 1 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 30550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  1  0 -1  1 -1  1  0  0 -1  0  0  1] (Indices: [0, 2, 9, 10, 12, 14, 15, 16]), Candidate: [ 1  2  0  0  1  1  1  0  2  1 -1  2  0  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  1  0 -1  0  0  0  1  0  0  0 -1  1] (Indices: [0, 2, 9, 10, 15, 16, 17, 18]), Candidate: [ 1  2  0  0  1  1  1  0  2  1 -1  1  1  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  1 -1  1 -1  1 -1  1  0  0 -1  0  1] (Indices: [0, 2, 9, 11, 13, 15, 16, 17]), Candidate: [1 2 0 0 1 1 1 0 2 0 1 0 2 0 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 30700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  1 -1  0  1 -1  1  0 -1  0  1  0  0] (Indices: [0, 2, 9, 12, 14, 15, 18, 19]), Candidate: [1 2 0 0 1 1 1 0 2 0 0 2 0 2 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 30750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  0  1  0  0 -1  1 -1  1  0 -1  0  1] (Indices: [0, 2, 10, 11, 12, 14, 16, 17]), Candidate: [ 1  2  0  0  1  1  1  0  1  2  0  1  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  0  1  0 -1  0  0  0  1  0  0  0  0] (Indices: [0, 2, 10, 11, 16, 17, 18, 19]), Candidate: [1 2 0 0 1 1 1 0 1 2 0 0 1 1 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 30850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  0  1 -1  0  1 -1  0  1  0  0  0  0] (Indices: [0, 2, 10, 13, 16, 17, 18, 19]), Candidate: [ 1  2  0  0  1  1  1  0  1  2 -1  1  2  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  0  0  1 -1  1  0 -1  1 -1  1  0  0] (Indices: [0, 2, 11, 13, 14, 16, 18, 19]), Candidate: [ 1  2  0  0  1  1  1  0  1  1  1  0  2  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0 -1  0  0  0  0  0  0  0  0  1 -1  1] (Indices: [0, 3, 4, 5, 6, 7, 8, 18]), Candidate: [1 1 2 0 1 1 1 0 0 1 0 1 1 1 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 31000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  0  0  0  0  0  0  1 -1  0  0  1  0] (Indices: [0, 3, 4, 5, 6, 7, 15, 19]), Candidate: [ 1  1  2  0  1  1  1 -1  1  1  0  1  1  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1 -1  0  0  0  0  1 -1  0  0  1 -1  1] (Indices: [0, 3, 4, 5, 6, 8, 14, 18]), Candidate: [ 1  1  2  0  1  1  0  1  0  1  0  1  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  1 -1  0  0  0  0  1 -1  0  0  1  0] (Indices: [0, 3, 4, 5, 6, 9, 15, 19]), Candidate: [1 1 2 0 1 1 0 0 2 0 0 1 1 1 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 31150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  0  0  1 -1  1  0 -1  0  0  0  0  1] (Indices: [0, 3, 4, 5, 6, 11, 13, 14]), Candidate: [ 1  1  2  0  1  1  0  0  1  1  1  0  2  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  0  0  0  0  1 -1  1 -1  0  0  1  0] (Indices: [0, 3, 4, 5, 6, 13, 15, 19]), Candidate: [1 1 2 0 1 1 0 0 1 1 0 1 2 0 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 31250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0 -1  0  1 -1  0  0  0  1 -1  0  0  1] (Indices: [0, 3, 4, 5, 7, 8, 11, 16]), Candidate: [1 1 2 0 1 0 2 0 0 1 1 0 1 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 31300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  1 -1  0  1 -1  1 -1  0  0  0  0  1] (Indices: [0, 3, 4, 5, 7, 9, 12, 14]), Candidate: [ 1  1  2  0  1  0  2 -1  2  0  0  2  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  0  1 -1  0  0  1 -1  0  1 -1  0  1] (Indices: [0, 3, 4, 5, 7, 10, 14, 17]), Candidate: [ 1  1  2  0  1  0  2 -1  1  2 -1  1  1  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 31400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  0  0  0  1 -1  1 -1  0  0  1 -1  1] (Indices: [0, 3, 4, 5, 7, 12, 14, 18]), Candidate: [ 1  1  2  0  1  0  2 -1  1  1  0  2  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1  0  0 -1  0  0  1 -1  0  0  0  0  1] (Indices: [0, 3, 4, 5, 8, 9, 10, 14]), Candidate: [ 1  1  2  0  1  0  1  1  1  1 -1  1  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1 -1  1 -1  1  0 -1  0  0  0  0  0  1] (Indices: [0, 3, 4, 5, 8, 10, 12, 13]), Candidate: [ 1  1  2  0  1  0  1  1  0  2 -1  2  1  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1 -1  0  1 -1  0  0  0  1  0 -1  0  1] (Indices: [0, 3, 4, 5, 8, 11, 16, 17]), Candidate: [1 1 2 0 1 0 1 1 0 1 1 0 1 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 31600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1 -1  0  0  0  0  1 -1  0  1 -1  1  0] (Indices: [0, 3, 4, 5, 8, 14, 17, 19]), Candidate: [ 1  1  2  0  1  0  1  1  0  1  0  1  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  1 -1  1  0 -1  0  1 -1  0  0  0  1] (Indices: [0, 3, 4, 5, 9, 11, 12, 15]), Candidate: [1 1 2 0 1 0 1 0 2 0 1 1 0 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 31700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  1 -1  0  0  1  0 -1  0  0  1 -1  1] (Indices: [0, 3, 4, 5, 9, 13, 14, 18]), Candidate: [ 1  1  2  0  1  0  1  0  2  0  0  1  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  0  1  0 -1  0  0  1  0 -1  0  0  1] (Indices: [0, 3, 4, 5, 10, 11, 15, 16]), Candidate: [1 1 2 0 1 0 1 0 1 2 0 0 1 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 31800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  0  1 -1  0  0  1 -1  1  0 -1  0  1] (Indices: [0, 3, 4, 5, 10, 14, 16, 17]), Candidate: [ 1  1  2  0  1  0  1  0  1  2 -1  1  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  0  0  1 -1  1 -1  0  0  1 -1  1  0] (Indices: [0, 3, 4, 5, 11, 13, 17, 19]), Candidate: [1 1 2 0 1 0 1 0 1 1 1 0 2 0 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 31900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  0  0  0  1 -1  0  1 -1  1  0 -1  1] (Indices: [0, 3, 4, 5, 12, 15, 17, 18]), Candidate: [1 1 2 0 1 0 1 0 1 1 0 2 0 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 31950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0  0 -1  0  0  0  0  0  0  0  1 -1  1] (Indices: [0, 3, 4, 6, 7, 8, 9, 18]), Candidate: [1 1 2 0 0 2 1 0 1 0 0 1 1 1 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 32000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  1  0 -1  0  0  1 -1  0  0  0  0  1] (Indices: [0, 3, 4, 6, 7, 9, 10, 14]), Candidate: [ 1  1  2  0  0  2  1 -1  2  1 -1  1  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 32050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  0  1 -1  1  0 -1  0  0  0  0  0  1] (Indices: [0, 3, 4, 6, 7, 10, 12, 13]), Candidate: [ 1  1  2  0  0  2  1 -1  1  2 -1  2  1  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  0  0  1 -1  0  0  0  1  0 -1  0  1] (Indices: [0, 3, 4, 6, 7, 11, 16, 17]), Candidate: [ 1  1  2  0  0  2  1 -1  1  1  1  0  1  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  0  0  0  0  0  1 -1  0  1 -1  1  0] (Indices: [0, 3, 4, 6, 7, 14, 17, 19]), Candidate: [ 1  1  2  0  0  2  1 -1  1  1  0  1  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1  0 -1  0  0  0  0  1 -1  0  0  1  0] (Indices: [0, 3, 4, 6, 8, 9, 15, 19]), Candidate: [1 1 2 0 0 2 0 1 1 0 0 1 1 1 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 32250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1 -1  0  1 -1  1  0 -1  0  0  0  0  1] (Indices: [0, 3, 4, 6, 8, 11, 13, 14]), Candidate: [ 1  1  2  0  0  2  0  1  0  1  1  0  2  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1 -1  0  0  0  1 -1  1 -1  0  0  1  0] (Indices: [0, 3, 4, 6, 8, 13, 15, 19]), Candidate: [1 1 2 0 0 2 0 1 0 1 0 1 2 0 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 32350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  1  0 -1  0  0  1 -1  0  1 -1  0  1] (Indices: [0, 3, 4, 6, 9, 10, 14, 17]), Candidate: [ 1  1  2  0  0  2  0  0  2  1 -1  1  1  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  1 -1  0  1 -1  1 -1  0  0  1 -1  1] (Indices: [0, 3, 4, 6, 9, 12, 14, 18]), Candidate: [ 1  1  2  0  0  2  0  0  2  0  0  2  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  0  1  0  0 -1  0  0  1 -1  0  0  1] (Indices: [0, 3, 4, 6, 10, 11, 12, 16]), Candidate: [1 1 2 0 0 2 0 0 1 2 0 1 0 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 32500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  0  1 -1  0  1  0 -1  0  0  0  1  0] (Indices: [0, 3, 4, 6, 10, 13, 14, 19]), Candidate: [ 1  1  2  0  0  2  0  0  1  2 -1  1  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  0  0  1  0 -1  0  0  0  1 -1  1  0] (Indices: [0, 3, 4, 6, 11, 12, 17, 19]), Candidate: [1 1 2 0 0 2 0 0 1 1 1 1 0 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 32600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  0  0  0  1  0 -1  0  0  1 -1  1  0] (Indices: [0, 3, 4, 6, 12, 13, 17, 19]), Candidate: [1 1 2 0 0 2 0 0 1 1 0 2 1 0 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 32650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  0  0  0  0  0  1 -1  1 -1  1  0  0] (Indices: [0, 3, 4, 6, 14, 16, 18, 19]), Candidate: [ 1  1  2  0  0  2  0  0  1  1  0  1  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0  0 -1  0  0  0  0  0  0  1 -1  1  0] (Indices: [0, 3, 4, 7, 8, 9, 17, 19]), Candidate: [1 1 2 0 0 1 2 0 1 0 0 1 1 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 32750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0 -1  0  1 -1  1 -1  0  0  0  0  1  0] (Indices: [0, 3, 4, 7, 8, 11, 13, 19]), Candidate: [1 1 2 0 0 1 2 0 0 1 1 0 2 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 32800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0 -1  0  0  0  1 -1  0  0  1 -1  1  0] (Indices: [0, 3, 4, 7, 8, 13, 17, 19]), Candidate: [1 1 2 0 0 1 2 0 0 1 0 1 2 0 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 32850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  1  0 -1  0  0  0  1 -1  0  1 -1  1] (Indices: [0, 3, 4, 7, 9, 10, 15, 18]), Candidate: [ 1  1  2  0  0  1  2 -1  2  1 -1  1  1  1  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  1 -1  0  1 -1  0  1 -1  0  0  1  0] (Indices: [0, 3, 4, 7, 9, 12, 15, 19]), Candidate: [ 1  1  2  0  0  1  2 -1  2  0  0  2  0  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  0  1  0 -1  1 -1  1 -1  0  0  0  1] (Indices: [0, 3, 4, 7, 10, 11, 13, 15]), Candidate: [ 1  1  2  0  0  1  2 -1  1  2  0  0  2  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  0  1 -1  0  1 -1  0  1  0 -1  0  1] (Indices: [0, 3, 4, 7, 10, 13, 16, 17]), Candidate: [ 1  1  2  0  0  1  2 -1  1  2 -1  1  2  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 33050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  0  0  1 -1  1  0 -1  0  0  1 -1  1] (Indices: [0, 3, 4, 7, 11, 13, 14, 18]), Candidate: [ 1  1  2  0  0  1  2 -1  1  1  1  0  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 33100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  0  0  0  1 -1  1  0 -1  0  0  1  0] (Indices: [0, 3, 4, 7, 12, 14, 15, 19]), Candidate: [ 1  1  2  0  0  1  2 -1  1  1  0  2  0  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  0  0  0  0  0  0  1 -1  1  0  0  0] (Indices: [0, 3, 4, 7, 15, 17, 18, 19]), Candidate: [ 1  1  2  0  0  1  2 -1  1  1  0  1  1  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1  0 -1  1 -1  1 -1  0  0  0  0  1  0] (Indices: [0, 3, 4, 8, 9, 11, 13, 19]), Candidate: [1 1 2 0 0 1 1 1 1 0 1 0 2 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 33250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1  0 -1  0  0  1 -1  0  0  1 -1  1  0] (Indices: [0, 3, 4, 8, 9, 13, 17, 19]), Candidate: [1 1 2 0 0 1 1 1 1 0 0 1 2 0 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 33300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1 -1  1 -1  1  0  0 -1  0  0  0  0  1] (Indices: [0, 3, 4, 8, 10, 12, 13, 14]), Candidate: [ 1  1  2  0  0  1  1  1  0  2 -1  2  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 33350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1 -1  1 -1  0  0  0  1 -1  1 -1  1  0] (Indices: [0, 3, 4, 8, 10, 15, 17, 19]), Candidate: [ 1  1  2  0  0  1  1  1  0  2 -1  1  1  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1 -1  0  1 -1  0  1 -1  0  1 -1  1  0] (Indices: [0, 3, 4, 8, 11, 14, 17, 19]), Candidate: [ 1  1  2  0  0  1  1  1  0  1  1  0  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1 -1  0  0  0  1  0  0 -1  0  0  1  0] (Indices: [0, 3, 4, 8, 13, 14, 15, 19]), Candidate: [1 1 2 0 0 1 1 1 0 1 0 1 2 1 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 33500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  1  0  0 -1  0  0  1  0 -1  0  0  1] (Indices: [0, 3, 4, 9, 10, 11, 15, 16]), Candidate: [1 1 2 0 0 1 1 0 2 1 0 0 1 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 33550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  1  0 -1  0  0  1 -1  1  0 -1  0  1] (Indices: [0, 3, 4, 9, 10, 14, 16, 17]), Candidate: [ 1  1  2  0  0  1  1  0  2  1 -1  1  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 33600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  1 -1  1 -1  1 -1  0  0  1 -1  1  0] (Indices: [0, 3, 4, 9, 11, 13, 17, 19]), Candidate: [1 1 2 0 0 1 1 0 2 0 1 0 2 0 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 33650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  1 -1  0  1 -1  0  1 -1  1  0 -1  1] (Indices: [0, 3, 4, 9, 12, 15, 17, 18]), Candidate: [1 1 2 0 0 1 1 0 2 0 0 2 0 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 33700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  0  1  0  0 -1  1 -1  0  1 -1  0  1] (Indices: [0, 3, 4, 10, 11, 12, 14, 17]), Candidate: [ 1  1  2  0  0  1  1  0  1  2  0  1  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  0  1 -1  1  0  0 -1  0  1 -1  0  1] (Indices: [0, 3, 4, 10, 12, 13, 14, 17]), Candidate: [ 1  1  2  0  0  1  1  0  1  2 -1  2  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 33800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  0  1 -1  0  1 -1  0  1  0 -1  1  0] (Indices: [0, 3, 4, 10, 13, 16, 17, 19]), Candidate: [ 1  1  2  0  0  1  1  0  1  2 -1  1  2  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  0  0  1  0 -1  0  0  1  0 -1  1  0] (Indices: [0, 3, 4, 11, 12, 16, 17, 19]), Candidate: [1 1 2 0 0 1 1 0 1 1 1 1 0 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 33900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  0  0  0  1  0 -1  1  0 -1  0  1  0] (Indices: [0, 3, 4, 12, 13, 15, 16, 19]), Candidate: [1 1 2 0 0 1 1 0 1 1 0 2 1 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 33950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0  0 -1  0  0  0  0  0  1 -1  0  0  1] (Indices: [0, 3, 5, 6, 7, 8, 9, 16]), Candidate: [ 1  1  2 -1  2  1  1  0  1  0  0  1  1  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  1  0 -1  1 -1  0  0  0  0  0  0  1] (Indices: [0, 3, 5, 6, 7, 9, 10, 12]), Candidate: [ 1  1  2 -1  2  1  1 -1  2  1 -1  2  0  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 34050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  0  1  0 -1  0  0  0  0  0  1 -1  1] (Indices: [0, 3, 5, 6, 7, 10, 11, 18]), Candidate: [ 1  1  2 -1  2  1  1 -1  1  2  0  0  1  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  0  0  1 -1  0  0  1 -1  0  1 -1  1] (Indices: [0, 3, 5, 6, 7, 11, 15, 18]), Candidate: [ 1  1  2 -1  2  1  1 -1  1  1  1  0  1  1  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  0  0  0  0  0  1 -1  1 -1  0  1  0] (Indices: [0, 3, 5, 6, 7, 14, 16, 19]), Candidate: [ 1  1  2 -1  2  1  1 -1  1  1  0  1  1  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 34200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1  0 -1  0  0  0  0  1 -1  1 -1  0  1] (Indices: [0, 3, 5, 6, 8, 9, 15, 17]), Candidate: [ 1  1  2 -1  2  1  0  1  1  0  0  1  1  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1 -1  0  1  0 -1  0  0  0  0  1 -1  1] (Indices: [0, 3, 5, 6, 8, 11, 12, 18]), Candidate: [ 1  1  2 -1  2  1  0  1  0  1  1  1  0  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1 -1  0  0  0  1 -1  1 -1  1 -1  0  1] (Indices: [0, 3, 5, 6, 8, 13, 15, 17]), Candidate: [ 1  1  2 -1  2  1  0  1  0  1  0  1  2  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  1  0 -1  0  0  1  0 -1  0  0  0  1] (Indices: [0, 3, 5, 6, 9, 10, 14, 15]), Candidate: [ 1  1  2 -1  2  1  0  0  2  1 -1  1  1  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  1 -1  0  1 -1  1 -1  1 -1  0  0  1] (Indices: [0, 3, 5, 6, 9, 12, 14, 16]), Candidate: [ 1  1  2 -1  2  1  0  0  2  0  0  2  0  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  0  1  0  0 -1  1 -1  0  0  0  0  1] (Indices: [0, 3, 5, 6, 10, 11, 12, 14]), Candidate: [ 1  1  2 -1  2  1  0  0  1  2  0  1  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  0  1 -1  0  1  0 -1  0  1 -1  0  1] (Indices: [0, 3, 5, 6, 10, 13, 14, 17]), Candidate: [ 1  1  2 -1  2  1  0  0  1  2 -1  1  2  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 34550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  0  0  1  0 -1  0  0  1 -1  0  1  0] (Indices: [0, 3, 5, 6, 11, 12, 16, 19]), Candidate: [ 1  1  2 -1  2  1  0  0  1  1  1  1  0  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  0  0  0  1  0 -1  0  1 -1  0  1  0] (Indices: [0, 3, 5, 6, 12, 13, 16, 19]), Candidate: [ 1  1  2 -1  2  1  0  0  1  1  0  2  1  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  0  0  0  0  0  1 -1  1  0  0 -1  1] (Indices: [0, 3, 5, 6, 14, 16, 17, 18]), Candidate: [ 1  1  2 -1  2  1  0  0  1  1  0  1  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0  0 -1  0  0  0  0  0  1 -1  0  1  0] (Indices: [0, 3, 5, 7, 8, 9, 16, 19]), Candidate: [ 1  1  2 -1  2  0  2  0  1  0  0  1  1  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0 -1  0  1 -1  1 -1  0  0  1 -1  0  1] (Indices: [0, 3, 5, 7, 8, 11, 13, 17]), Candidate: [ 1  1  2 -1  2  0  2  0  0  1  1  0  2  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0 -1  0  0  0  1 -1  0  1 -1  0  1  0] (Indices: [0, 3, 5, 7, 8, 13, 16, 19]), Candidate: [ 1  1  2 -1  2  0  2  0  0  1  0  1  2  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  1  0 -1  0  0  0  1  0 -1  0  0  1] (Indices: [0, 3, 5, 7, 9, 10, 15, 16]), Candidate: [ 1  1  2 -1  2  0  2 -1  2  1 -1  1  1  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 34900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  1 -1  0  1 -1  0  1 -1  1 -1  0  1] (Indices: [0, 3, 5, 7, 9, 12, 15, 17]), Candidate: [ 1  1  2 -1  2  0  2 -1  2  0  0  2  0  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  0  1  0  0 -1  0  0  0  0  0  1  0] (Indices: [0, 3, 5, 7, 10, 11, 12, 19]), Candidate: [ 1  1  2 -1  2  0  2 -1  1  2  0  1  0  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  0  1 -1  0  1 -1  1 -1  0  1 -1  1] (Indices: [0, 3, 5, 7, 10, 13, 15, 18]), Candidate: [ 1  1  2 -1  2  0  2 -1  1  2 -1  1  2  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 35050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  0  0  1 -1  1  0 -1  1 -1  0  0  1] (Indices: [0, 3, 5, 7, 11, 13, 14, 16]), Candidate: [ 1  1  2 -1  2  0  2 -1  1  1  1  0  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 35100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  0  0  0  1 -1  1  0 -1  1 -1  0  1] (Indices: [0, 3, 5, 7, 12, 14, 15, 17]), Candidate: [ 1  1  2 -1  2  0  2 -1  1  1  0  2  0  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  0  0  0  0  0  0  1  0  0 -1  1  0] (Indices: [0, 3, 5, 7, 15, 16, 17, 19]), Candidate: [ 1  1  2 -1  2  0  2 -1  1  1  0  1  1  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1  0 -1  1 -1  1 -1  0  0  1 -1  0  1] (Indices: [0, 3, 5, 8, 9, 11, 13, 17]), Candidate: [ 1  1  2 -1  2  0  1  1  1  0  1  0  2  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1  0 -1  0  0  1 -1  0  1 -1  0  1  0] (Indices: [0, 3, 5, 8, 9, 13, 16, 19]), Candidate: [ 1  1  2 -1  2  0  1  1  1  0  0  1  2  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1 -1  1  0 -1  0  0  0  0  1 -1  1  0] (Indices: [0, 3, 5, 8, 10, 11, 17, 19]), Candidate: [ 1  1  2 -1  2  0  1  1  0  2  0  0  1  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1 -1  1 -1  0  0  0  1  0 -1  0  1  0] (Indices: [0, 3, 5, 8, 10, 15, 16, 19]), Candidate: [ 1  1  2 -1  2  0  1  1  0  2 -1  1  1  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1 -1  0  1 -1  0  1 -1  1 -1  0  1  0] (Indices: [0, 3, 5, 8, 11, 14, 16, 19]), Candidate: [ 1  1  2 -1  2  0  1  1  0  1  1  0  1  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1 -1  0  0  0  1  0  0 -1  1 -1  0  1] (Indices: [0, 3, 5, 8, 13, 14, 15, 17]), Candidate: [ 1  1  2 -1  2  0  1  1  0  1  0  1  2  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  1  0  0 -1  0  1 -1  0  0  1 -1  1] (Indices: [0, 3, 5, 9, 10, 11, 14, 18]), Candidate: [ 1  1  2 -1  2  0  1  0  2  1  0  0  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  1  0 -1  0  0  1  0 -1  0  1 -1  1] (Indices: [0, 3, 5, 9, 10, 14, 15, 18]), Candidate: [ 1  1  2 -1  2  0  1  0  2  1 -1  1  1  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  1 -1  1 -1  1 -1  0  1 -1  0  1  0] (Indices: [0, 3, 5, 9, 11, 13, 16, 19]), Candidate: [ 1  1  2 -1  2  0  1  0  2  0  1  0  2  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  1 -1  0  1 -1  0  1  0 -1  1 -1  1] (Indices: [0, 3, 5, 9, 12, 15, 16, 18]), Candidate: [ 1  1  2 -1  2  0  1  0  2  0  0  2  0  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  0  1  0  0 -1  1  0 -1  0  0  0  1] (Indices: [0, 3, 5, 10, 11, 12, 14, 15]), Candidate: [ 1  1  2 -1  2  0  1  0  1  2  0  1  0  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  0  1 -1  1  0  0  0 -1  0  0  0  1] (Indices: [0, 3, 5, 10, 12, 13, 14, 15]), Candidate: [ 1  1  2 -1  2  0  1  0  1  2 -1  2  1  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  0  1 -1  0  1 -1  1 -1  0  1  0  0] (Indices: [0, 3, 5, 10, 13, 15, 18, 19]), Candidate: [ 1  1  2 -1  2  0  1  0  1  2 -1  1  2  0  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  0  0  1  0 -1  0  1 -1  0  1  0  0] (Indices: [0, 3, 5, 11, 12, 15, 18, 19]), Candidate: [ 1  1  2 -1  2  0  1  0  1  1  1  1  0  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  0  0  0  1  0 -1  1  0  0 -1  0  1] (Indices: [0, 3, 5, 12, 13, 15, 16, 17]), Candidate: [ 1  1  2 -1  2  0  1  0  1  1  0  2  1  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0  0  0 -1  0  0  0  1 -1  0  0  0  1] (Indices: [0, 3, 6, 7, 8, 9, 10, 15]), Candidate: [ 1  1  2 -1  1  2  1  0  1  1 -1  1  1  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0 -1  1 -1  1 -1  1 -1  0  0  0  0  1] (Indices: [0, 3, 6, 7, 8, 10, 12, 14]), Candidate: [ 1  1  2 -1  1  2  1  0  0  2 -1  2  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 36050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0 -1  0  1 -1  0  0  0  1 -1  1 -1  1] (Indices: [0, 3, 6, 7, 8, 11, 16, 18]), Candidate: [ 1  1  2 -1  1  2  1  0  0  1  1  0  1  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0 -1  0  0  0  0  1 -1  0  0  1  0  0] (Indices: [0, 3, 6, 7, 8, 14, 18, 19]), Candidate: [ 1  1  2 -1  1  2  1  0  0  1  0  1  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  1 -1  1  0 -1  0  0  1 -1  0  0  1] (Indices: [0, 3, 6, 7, 9, 11, 12, 16]), Candidate: [ 1  1  2 -1  1  2  1 -1  2  0  1  1  0  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  1 -1  0  0  1  0 -1  0  0  0  1  0] (Indices: [0, 3, 6, 7, 9, 13, 14, 19]), Candidate: [ 1  1  2 -1  1  2  1 -1  2  0  0  1  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 36250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  0  1  0 -1  0  0  1 -1  1 -1  0  1] (Indices: [0, 3, 6, 7, 10, 11, 15, 17]), Candidate: [ 1  1  2 -1  1  2  1 -1  1  2  0  0  1  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  0  1 -1  0  0  1 -1  1 -1  1 -1  1] (Indices: [0, 3, 6, 7, 10, 14, 16, 18]), Candidate: [ 1  1  2 -1  1  2  1 -1  1  2 -1  1  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 36350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  0  0  1 -1  1 -1  0  0  0  1  0  0] (Indices: [0, 3, 6, 7, 11, 13, 18, 19]), Candidate: [ 1  1  2 -1  1  2  1 -1  1  1  1  0  2  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  0  0  0  1 -1  0  1 -1  1 -1  1  0] (Indices: [0, 3, 6, 7, 12, 15, 17, 19]), Candidate: [ 1  1  2 -1  1  2  1 -1  1  1  0  2  0  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1  0  0 -1  1 -1  1 -1  0  0  0  0  1] (Indices: [0, 3, 6, 8, 9, 10, 12, 14]), Candidate: [ 1  1  2 -1  1  2  0  1  1  1 -1  2  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 36500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1  0 -1  1 -1  0  0  0  1 -1  1 -1  1] (Indices: [0, 3, 6, 8, 9, 11, 16, 18]), Candidate: [ 1  1  2 -1  1  2  0  1  1  0  1  0  1  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1  0 -1  0  0  0  1 -1  0  0  1  0  0] (Indices: [0, 3, 6, 8, 9, 14, 18, 19]), Candidate: [ 1  1  2 -1  1  2  0  1  1  0  0  1  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1 -1  1 -1  1 -1  0  1  0 -1  0  0  1] (Indices: [0, 3, 6, 8, 10, 12, 15, 16]), Candidate: [ 1  1  2 -1  1  2  0  1  0  2 -1  2  0  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1 -1  0  1  0  0 -1  0  0  0  0  1  0] (Indices: [0, 3, 6, 8, 11, 12, 13, 19]), Candidate: [ 1  1  2 -1  1  2  0  1  0  1  1  1  1  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1 -1  0  1 -1  0  0  0  0  1  0  0  0] (Indices: [0, 3, 6, 8, 11, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  2  0  1  0  1  1  0  1  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1 -1  0  0  0  1 -1  1 -1  1 -1  1  0] (Indices: [0, 3, 6, 8, 13, 15, 17, 19]), Candidate: [ 1  1  2 -1  1  2  0  1  0  1  0  1  2  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  1  0 -1  1  0 -1  1 -1  0  0  0  1] (Indices: [0, 3, 6, 9, 10, 12, 13, 15]), Candidate: [ 1  1  2 -1  1  2  0  0  2  1 -1  2  1  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  1  0 -1  0  0  0  1 -1  0  1  0  0] (Indices: [0, 3, 6, 9, 10, 15, 18, 19]), Candidate: [ 1  1  2 -1  1  2  0  0  2  1 -1  1  1  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  1 -1  1 -1  0  1 -1  0  0  1  0  0] (Indices: [0, 3, 6, 9, 11, 14, 18, 19]), Candidate: [ 1  1  2 -1  1  2  0  0  2  0  1  0  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  1 -1  0  0  1  0 -1  1  0 -1  0  1] (Indices: [0, 3, 6, 9, 13, 14, 16, 17]), Candidate: [ 1  1  2 -1  1  2  0  0  2  0  0  1  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  0  1  0  0 -1  0  0  0  1 -1  1  0] (Indices: [0, 3, 6, 10, 11, 12, 17, 19]), Candidate: [ 1  1  2 -1  1  2  0  0  1  2  0  1  0  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  0  1 -1  1  0 -1  0  0  1 -1  1  0] (Indices: [0, 3, 6, 10, 12, 13, 17, 19]), Candidate: [ 1  1  2 -1  1  2  0  0  1  2 -1  2  1  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  0  1 -1  0  0  1 -1  1 -1  1  0  0] (Indices: [0, 3, 6, 10, 14, 16, 18, 19]), Candidate: [ 1  1  2 -1  1  2  0  0  1  2 -1  1  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 37150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  0  0  1 -1  1  0 -1  0  1 -1  1  0] (Indices: [0, 3, 6, 11, 13, 14, 17, 19]), Candidate: [ 1  1  2 -1  1  2  0  0  1  1  1  0  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  0  0  0  1 -1  1  0 -1  1  0 -1  1] (Indices: [0, 3, 6, 12, 14, 15, 17, 18]), Candidate: [ 1  1  2 -1  1  2  0  0  1  1  0  2  0  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0  0  0 -1  0  1 -1  0  1 -1  0  0  1] (Indices: [0, 3, 7, 8, 9, 10, 13, 16]), Candidate: [ 1  1  2 -1  1  1  2  0  1  1 -1  1  2  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0  0 -1  0  1  0 -1  0  0  1 -1  0  1] (Indices: [0, 3, 7, 8, 9, 12, 13, 17]), Candidate: [ 1  1  2 -1  1  1  2  0  1  0  0  2  1  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0  0 -1  0  0  0  0  0  1  0 -1  1  0] (Indices: [0, 3, 7, 8, 9, 16, 17, 19]), Candidate: [ 1  1  2 -1  1  1  2  0  1  0  0  1  1  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0 -1  1 -1  1 -1  0  0  0  1 -1  1  0] (Indices: [0, 3, 7, 8, 10, 12, 17, 19]), Candidate: [ 1  1  2 -1  1  1  2  0  0  2 -1  2  0  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0 -1  0  1  0 -1  0  1 -1  0  1 -1  1] (Indices: [0, 3, 7, 8, 11, 12, 15, 18]), Candidate: [ 1  1  2 -1  1  1  2  0  0  1  1  1  0  1  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0 -1  0  0  1  0 -1  1 -1  0  1 -1  1] (Indices: [0, 3, 7, 8, 12, 13, 15, 18]), Candidate: [ 1  1  2 -1  1  1  2  0  0  1  0  2  1  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0 -1  0  0  0  0  1  0  0 -1  0  1  0] (Indices: [0, 3, 7, 8, 14, 15, 16, 19]), Candidate: [ 1  1  2 -1  1  1  2  0  0  1  0  1  1  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  1  0 -1  1 -1  1 -1  0  0  1 -1  1] (Indices: [0, 3, 7, 9, 10, 12, 14, 18]), Candidate: [ 1  1  2 -1  1  1  2 -1  2  1 -1  2  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 37650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  1 -1  1  0  0 -1  0  0  1 -1  0  1] (Indices: [0, 3, 7, 9, 11, 12, 13, 17]), Candidate: [ 1  1  2 -1  1  1  2 -1  2  0  1  1  1  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  1 -1  1 -1  0  0  0  1  0 -1  1  0] (Indices: [0, 3, 7, 9, 11, 16, 17, 19]), Candidate: [ 1  1  2 -1  1  1  2 -1  2  0  1  0  1  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  1 -1  0  0  1 -1  1  0 -1  0  1  0] (Indices: [0, 3, 7, 9, 13, 15, 16, 19]), Candidate: [ 1  1  2 -1  1  1  2 -1  2  0  0  1  2  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  0  1  0 -1  1 -1  1 -1  1 -1  0  1] (Indices: [0, 3, 7, 10, 11, 13, 15, 17]), Candidate: [ 1  1  2 -1  1  1  2 -1  1  2  0  0  2  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  0  1 -1  1 -1  1 -1  1 -1  0  1  0] (Indices: [0, 3, 7, 10, 12, 14, 16, 19]), Candidate: [ 1  1  2 -1  1  1  2 -1  1  2 -1  2  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 37900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  0  0  1  0  0  0 -1  1 -1  0  0  1] (Indices: [0, 3, 7, 11, 12, 13, 14, 16]), Candidate: [ 1  1  2 -1  1  1  2 -1  1  1  1  1  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 37950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  0  0  1 -1  1 -1  0  1  0  0 -1  1] (Indices: [0, 3, 7, 11, 13, 16, 17, 18]), Candidate: [ 1  1  2 -1  1  1  2 -1  1  1  1  0  2  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  0  0  0  1 -1  0  1  0  0 -1  1  0] (Indices: [0, 3, 7, 12, 15, 16, 17, 19]), Candidate: [ 1  1  2 -1  1  1  2 -1  1  1  0  2  0  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1  0  0  0 -1  0  0  0  0  1  0 -1  1] (Indices: [0, 3, 8, 9, 10, 11, 17, 18]), Candidate: [ 1  1  2 -1  1  1  1  1  1  1  0  0  1  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1  0  0 -1  0  0  0  1  0 -1  1 -1  1] (Indices: [0, 3, 8, 9, 10, 15, 16, 18]), Candidate: [ 1  1  2 -1  1  1  1  1  1  1 -1  1  1  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1  0 -1  1 -1  0  1 -1  1 -1  1 -1  1] (Indices: [0, 3, 8, 9, 11, 14, 16, 18]), Candidate: [ 1  1  2 -1  1  1  1  1  1  0  1  0  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1  0 -1  0  0  1  0  0  0 -1  0  0  1] (Indices: [0, 3, 8, 9, 13, 14, 15, 16]), Candidate: [ 1  1  2 -1  1  1  1  1  1  0  0  1  2  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1 -1  1  0  0 -1  0  0  1  0 -1  0  1] (Indices: [0, 3, 8, 10, 11, 12, 16, 17]), Candidate: [ 1  1  2 -1  1  1  1  1  0  2  0  1  0  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1 -1  1 -1  1  0 -1  0  1  0 -1  0  1] (Indices: [0, 3, 8, 10, 12, 13, 16, 17]), Candidate: [ 1  1  2 -1  1  1  1  1  0  2 -1  2  1  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1 -1  1 -1  0  0  1  0 -1  1 -1  1  0] (Indices: [0, 3, 8, 10, 14, 15, 17, 19]), Candidate: [ 1  1  2 -1  1  1  1  1  0  2 -1  1  1  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1 -1  0  1 -1  1  0 -1  1  0 -1  0  1] (Indices: [0, 3, 8, 11, 13, 14, 16, 17]), Candidate: [ 1  1  2 -1  1  1  1  1  0  1  1  0  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1 -1  0  0  1  0 -1  0  0  1  0  0  0] (Indices: [0, 3, 8, 12, 13, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  1  1  1  0  1  0  2  1  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  1  0  0  0 -1  0  1 -1  0  1 -1  1] (Indices: [0, 3, 9, 10, 11, 12, 15, 18]), Candidate: [ 1  1  2 -1  1  1  1  0  2  1  0  1  0  1  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  1  0 -1  1  0 -1  1 -1  0  1 -1  1] (Indices: [0, 3, 9, 10, 12, 13, 15, 18]), Candidate: [ 1  1  2 -1  1  1  1  0  2  1 -1  2  1  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  1  0 -1  0  0  1  0  0 -1  0  1  0] (Indices: [0, 3, 9, 10, 14, 15, 16, 19]), Candidate: [ 1  1  2 -1  1  1  1  0  2  1 -1  1  1  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  1 -1  1 -1  1  0  0 -1  0  1 -1  1] (Indices: [0, 3, 9, 11, 13, 14, 15, 18]), Candidate: [ 1  1  2 -1  1  1  1  0  2  0  1  0  2  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  1 -1  0  1  0 -1  0  1  0 -1  1  0] (Indices: [0, 3, 9, 12, 13, 16, 17, 19]), Candidate: [ 1  1  2 -1  1  1  1  0  2  0  0  2  1  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  0  1  0  0  0 -1  0  1 -1  0  1  0] (Indices: [0, 3, 10, 11, 12, 13, 16, 19]), Candidate: [ 1  1  2 -1  1  1  1  0  1  2  0  1  1  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  0  1  0 -1  0  1 -1  1  0  0 -1  1] (Indices: [0, 3, 10, 11, 14, 16, 17, 18]), Candidate: [ 1  1  2 -1  1  1  1  0  1  2  0  0  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  0  1 -1  0  1  0 -1  1  0  0 -1  1] (Indices: [0, 3, 10, 13, 14, 16, 17, 18]), Candidate: [ 1  1  2 -1  1  1  1  0  1  2 -1  1  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 38900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  0  0  1 -1  1  0  0  0  0 -1  0  1] (Indices: [0, 3, 11, 13, 14, 15, 16, 17]), Candidate: [ 1  1  2 -1  1  1  1  0  1  1  1  0  2  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0  0 -1  1 -1  0  0  0  0  0  0  0  1] (Indices: [0, 4, 5, 6, 7, 8, 9, 11]), Candidate: [1 1 1 1 1 1 1 0 1 0 1 0 1 1 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 39000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0 -1  0  0  0  0  0  0  1 -1  0  1  0] (Indices: [0, 4, 5, 6, 7, 8, 16, 19]), Candidate: [1 1 1 1 1 1 1 0 0 1 0 1 1 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 39050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  0  1  0 -1  1 -1  0  0  0  0  0  1] (Indices: [0, 4, 5, 6, 7, 10, 11, 13]), Candidate: [ 1  1  1  1  1  1  1 -1  1  2  0  0  2  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  0  0  1 -1  0  1 -1  0  1 -1  0  1] (Indices: [0, 4, 5, 6, 7, 11, 14, 17]), Candidate: [ 1  1  1  1  1  1  1 -1  1  1  1  0  1  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  0  0  0  0  0  1  0 -1  1 -1  0  1] (Indices: [0, 4, 5, 6, 7, 14, 15, 17]), Candidate: [ 1  1  1  1  1  1  1 -1  1  1  0  1  1  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1  0 -1  0  0  0  1 -1  1 -1  0  0  1] (Indices: [0, 4, 5, 6, 8, 9, 14, 16]), Candidate: [ 1  1  1  1  1  1  0  1  1  0  0  1  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1 -1  0  1  0  0 -1  0  0  0  0  0  1] (Indices: [0, 4, 5, 6, 8, 11, 12, 13]), Candidate: [1 1 1 1 1 1 0 1 0 1 1 1 1 0 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 39300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1 -1  0  0  0  1  0 -1  1 -1  0  0  1] (Indices: [0, 4, 5, 6, 8, 13, 14, 16]), Candidate: [ 1  1  1  1  1  1  0  1  0  1  0  1  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  1  0 -1  0  1 -1  1 -1  0  0  0  1] (Indices: [0, 4, 5, 6, 9, 10, 13, 15]), Candidate: [ 1  1  1  1  1  1  0  0  2  1 -1  1  2  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  1 -1  0  1  0 -1  0  1 -1  0  0  1] (Indices: [0, 4, 5, 6, 9, 12, 13, 16]), Candidate: [1 1 1 1 1 1 0 0 2 0 0 2 1 0 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 39450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  1 -1  0  0  0  0  0  1  0  0 -1  1] (Indices: [0, 4, 5, 6, 9, 16, 17, 18]), Candidate: [1 1 1 1 1 1 0 0 2 0 0 1 1 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 39500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  0  1 -1  1 -1  0  0  0  1  0 -1  1] (Indices: [0, 4, 5, 6, 10, 12, 17, 18]), Candidate: [ 1  1  1  1  1  1  0  0  1  2 -1  2  0  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  0  0  1  0 -1  0  1 -1  1 -1  0  1] (Indices: [0, 4, 5, 6, 11, 12, 15, 17]), Candidate: [1 1 1 1 1 1 0 0 1 1 1 1 0 1 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 39600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  0  0  0  1  0 -1  1 -1  1 -1  0  1] (Indices: [0, 4, 5, 6, 12, 13, 15, 17]), Candidate: [1 1 1 1 1 1 0 0 1 1 0 2 1 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 39650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  0  0  0  0  0  1  0  0 -1  1 -1  1] (Indices: [0, 4, 5, 6, 14, 15, 16, 18]), Candidate: [1 1 1 1 1 1 0 0 1 1 0 1 1 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 39700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0  0 -1  0  0  0  0  1 -1  1 -1  0  1] (Indices: [0, 4, 5, 7, 8, 9, 15, 17]), Candidate: [1 1 1 1 1 0 2 0 1 0 0 1 1 1 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 39750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0 -1  0  1  0 -1  0  0  0  0  1 -1  1] (Indices: [0, 4, 5, 7, 8, 11, 12, 18]), Candidate: [1 1 1 1 1 0 2 0 0 1 1 1 0 1 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 39800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0 -1  0  0  0  1 -1  1 -1  1 -1  0  1] (Indices: [0, 4, 5, 7, 8, 13, 15, 17]), Candidate: [1 1 1 1 1 0 2 0 0 1 0 1 2 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 39850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  1  0 -1  0  0  1  0 -1  0  0  0  1] (Indices: [0, 4, 5, 7, 9, 10, 14, 15]), Candidate: [ 1  1  1  1  1  0  2 -1  2  1 -1  1  1  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  1 -1  0  1 -1  1 -1  1 -1  0  0  1] (Indices: [0, 4, 5, 7, 9, 12, 14, 16]), Candidate: [ 1  1  1  1  1  0  2 -1  2  0  0  2  0  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  0  1  0  0 -1  1 -1  0  0  0  0  1] (Indices: [0, 4, 5, 7, 10, 11, 12, 14]), Candidate: [ 1  1  1  1  1  0  2 -1  1  2  0  1  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 40000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  0  1 -1  0  1  0 -1  0  1 -1  0  1] (Indices: [0, 4, 5, 7, 10, 13, 14, 17]), Candidate: [ 1  1  1  1  1  0  2 -1  1  2 -1  1  2  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 40050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  0  0  1  0 -1  0  0  1 -1  0  1  0] (Indices: [0, 4, 5, 7, 11, 12, 16, 19]), Candidate: [ 1  1  1  1  1  0  2 -1  1  1  1  1  0  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  0  0  0  1  0 -1  0  1 -1  0  1  0] (Indices: [0, 4, 5, 7, 12, 13, 16, 19]), Candidate: [ 1  1  1  1  1  0  2 -1  1  1  0  2  1  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  0  0  0  0  0  1 -1  1  0  0 -1  1] (Indices: [0, 4, 5, 7, 14, 16, 17, 18]), Candidate: [ 1  1  1  1  1  0  2 -1  1  1  0  1  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 40200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1  0 -1  1  0 -1  0  0  0  0  1 -1  1] (Indices: [0, 4, 5, 8, 9, 11, 12, 18]), Candidate: [1 1 1 1 1 0 1 1 1 0 1 1 0 1 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 40250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1  0 -1  0  0  1 -1  1 -1  1 -1  0  1] (Indices: [0, 4, 5, 8, 9, 13, 15, 17]), Candidate: [1 1 1 1 1 0 1 1 1 0 0 1 2 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 40300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1 -1  1  0 -1  0  0  1 -1  0  0  1  0] (Indices: [0, 4, 5, 8, 10, 11, 15, 19]), Candidate: [1 1 1 1 1 0 1 1 0 2 0 0 1 1 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 40350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1 -1  1 -1  0  0  1 -1  0  1  0 -1  1] (Indices: [0, 4, 5, 8, 10, 14, 17, 18]), Candidate: [ 1  1  1  1  1  0  1  1  0  2 -1  1  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 40400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1 -1  0  1 -1  0  1  0 -1  1 -1  0  1] (Indices: [0, 4, 5, 8, 11, 14, 15, 17]), Candidate: [1 1 1 1 1 0 1 1 0 1 1 0 1 2 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 40450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1 -1  0  0  1 -1  0  0  1  0  0 -1  1] (Indices: [0, 4, 5, 8, 12, 16, 17, 18]), Candidate: [1 1 1 1 1 0 1 1 0 1 0 2 0 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 40500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  1  0  0 -1  1 -1  0  0  0  1 -1  1] (Indices: [0, 4, 5, 9, 10, 11, 13, 18]), Candidate: [1 1 1 1 1 0 1 0 2 1 0 0 2 0 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 40550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  1  0 -1  0  1 -1  0  0  1  0 -1  1] (Indices: [0, 4, 5, 9, 10, 13, 17, 18]), Candidate: [ 1  1  1  1  1  0  1  0  2  1 -1  1  2  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  1 -1  1 -1  1 -1  1 -1  1 -1  0  1] (Indices: [0, 4, 5, 9, 11, 13, 15, 17]), Candidate: [1 1 1 1 1 0 1 0 2 0 1 0 2 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 40650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  1 -1  0  1 -1  1 -1  1 -1  0  1  0] (Indices: [0, 4, 5, 9, 12, 14, 16, 19]), Candidate: [ 1  1  1  1  1  0  1  0  2  0  0  2  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  0  1  0  0  0 -1  1 -1  0  0  0  1] (Indices: [0, 4, 5, 10, 11, 12, 13, 15]), Candidate: [1 1 1 1 1 0 1 0 1 2 0 1 1 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 40750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  0  1  0 -1  0  0  1 -1  0  1  0  0] (Indices: [0, 4, 5, 10, 11, 15, 18, 19]), Candidate: [1 1 1 1 1 0 1 0 1 2 0 0 1 1 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 40800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  0  1 -1  0  1 -1  1  0  0 -1  0  1] (Indices: [0, 4, 5, 10, 13, 15, 16, 17]), Candidate: [ 1  1  1  1  1  0  1  0  1  2 -1  1  2  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  0  0  1  0 -1  0  1  0  0 -1  0  1] (Indices: [0, 4, 5, 11, 12, 15, 16, 17]), Candidate: [1 1 1 1 1 0 1 0 1 1 1 1 0 1 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 40900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  0  0  0  1  0  0 -1  1 -1  1 -1  1] (Indices: [0, 4, 5, 12, 13, 14, 16, 18]), Candidate: [ 1  1  1  1  1  0  1  0  1  1  0  2  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  0  0  0  0  0  0  1  0  0  0  0  0] (Indices: [0, 4, 5, 15, 16, 17, 18, 19]), Candidate: [1 1 1 1 1 0 1 0 1 1 0 1 1 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 41000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0 -1  1  0 -1  0  0  0  1 -1  0  0  1] (Indices: [0, 4, 6, 7, 8, 10, 11, 16]), Candidate: [1 1 1 1 0 2 1 0 0 2 0 0 1 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 41050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0 -1  0  1 -1  0  0  1  0 -1  0  0  1] (Indices: [0, 4, 6, 7, 8, 11, 15, 16]), Candidate: [1 1 1 1 0 2 1 0 0 1 1 0 1 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 41100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0 -1  0  0  0  0  1 -1  1  0 -1  0  1] (Indices: [0, 4, 6, 7, 8, 14, 16, 17]), Candidate: [ 1  1  1  1  0  2  1  0  0  1  0  1  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  1  0 -1  0  0  0  0  0  1 -1  1  0] (Indices: [0, 4, 6, 7, 9, 10, 17, 19]), Candidate: [ 1  1  1  1  0  2  1 -1  2  1 -1  1  1  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 41200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  1 -1  0  1 -1  0  0  0  0  1  0  0] (Indices: [0, 4, 6, 7, 9, 12, 18, 19]), Candidate: [ 1  1  1  1  0  2  1 -1  2  0  0  2  0  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  0  1  0 -1  0  1 -1  1 -1  0  0  1] (Indices: [0, 4, 6, 7, 10, 11, 14, 16]), Candidate: [ 1  1  1  1  0  2  1 -1  1  2  0  0  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 41300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  0  1 -1  0  0  1  0  0 -1  0  0  1] (Indices: [0, 4, 6, 7, 10, 14, 15, 16]), Candidate: [ 1  1  1  1  0  2  1 -1  1  2 -1  1  1  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 41350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  0  0  1 -1  1 -1  0  1  0 -1  0  1] (Indices: [0, 4, 6, 7, 11, 13, 16, 17]), Candidate: [ 1  1  1  1  0  2  1 -1  1  1  1  0  2  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  0  0  0  1 -1  1 -1  0  0  1  0  0] (Indices: [0, 4, 6, 7, 12, 14, 18, 19]), Candidate: [ 1  1  1  1  0  2  1 -1  1  1  0  2  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 41450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1  0  0  0 -1  0  0  0  1 -1  0  0  1] (Indices: [0, 4, 6, 8, 9, 10, 11, 16]), Candidate: [1 1 1 1 0 2 0 1 1 1 0 0 1 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 41500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1  0 -1  1 -1  0  0  1  0 -1  0  0  1] (Indices: [0, 4, 6, 8, 9, 11, 15, 16]), Candidate: [1 1 1 1 0 2 0 1 1 0 1 0 1 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 41550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1  0 -1  0  0  0  1 -1  1  0 -1  0  1] (Indices: [0, 4, 6, 8, 9, 14, 16, 17]), Candidate: [ 1  1  1  1  0  2  0  1  1  0  0  1  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1 -1  1 -1  1 -1  1  0 -1  0  0  0  1] (Indices: [0, 4, 6, 8, 10, 12, 14, 15]), Candidate: [ 1  1  1  1  0  2  0  1  0  2 -1  2  0  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1 -1  0  1  0  0  0 -1  0  0  0  0  1] (Indices: [0, 4, 6, 8, 11, 12, 13, 14]), Candidate: [ 1  1  1  1  0  2  0  1  0  1  1  1  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1 -1  0  1 -1  0  0  1 -1  1 -1  1  0] (Indices: [0, 4, 6, 8, 11, 15, 17, 19]), Candidate: [1 1 1 1 0 2 0 1 0 1 1 0 1 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 41750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1 -1  0  0  0  1  0 -1  0  0  1  0  0] (Indices: [0, 4, 6, 8, 13, 14, 18, 19]), Candidate: [ 1  1  1  1  0  2  0  1  0  1  0  1  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  1  0  0 -1  0  0  0  1 -1  0  1  0] (Indices: [0, 4, 6, 9, 10, 11, 16, 19]), Candidate: [1 1 1 1 0 2 0 0 2 1 0 0 1 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 41850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  1  0 -1  0  0  0  1  0  0 -1  0  1] (Indices: [0, 4, 6, 9, 10, 15, 16, 17]), Candidate: [ 1  1  1  1  0  2  0  0  2  1 -1  1  1  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  1 -1  1 -1  0  1 -1  1  0 -1  0  1] (Indices: [0, 4, 6, 9, 11, 14, 16, 17]), Candidate: [ 1  1  1  1  0  2  0  0  2  0  1  0  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  1 -1  0  1 -1  0  0  0  1  0  0  0] (Indices: [0, 4, 6, 9, 12, 17, 18, 19]), Candidate: [1 1 1 1 0 2 0 0 2 0 0 2 0 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 42000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  0  1  0  0 -1  0  1 -1  0  0  1  0] (Indices: [0, 4, 6, 10, 11, 12, 15, 19]), Candidate: [1 1 1 1 0 2 0 0 1 2 0 1 0 1 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 42050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  0  1 -1  1  0 -1  1 -1  0  0  1  0] (Indices: [0, 4, 6, 10, 12, 13, 15, 19]), Candidate: [ 1  1  1  1  0  2  0  0  1  2 -1  2  1  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  0  1 -1  0  0  1  0 -1  1  0 -1  1] (Indices: [0, 4, 6, 10, 14, 15, 17, 18]), Candidate: [ 1  1  1  1  0  2  0  0  1  2 -1  1  1  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  0  0  1 -1  1  0  0 -1  0  0  1  0] (Indices: [0, 4, 6, 11, 13, 14, 15, 19]), Candidate: [1 1 1 1 0 2 0 0 1 1 1 0 2 1 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 42200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  0  0  0  1  0 -1  0  1 -1  1  0  0] (Indices: [0, 4, 6, 12, 13, 16, 18, 19]), Candidate: [1 1 1 1 0 2 0 0 1 1 0 2 1 0 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 42250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0  0  0 -1  1 -1  0  0  0  1 -1  0  1] (Indices: [0, 4, 7, 8, 9, 10, 12, 17]), Candidate: [ 1  1  1  1  0  1  2  0  1  1 -1  2  0  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0  0 -1  1 -1  0  0  0  0  1 -1  1  0] (Indices: [0, 4, 7, 8, 9, 11, 17, 19]), Candidate: [1 1 1 1 0 1 2 0 1 0 1 0 1 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 42350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0  0 -1  0  0  0  0  1  0 -1  0  1  0] (Indices: [0, 4, 7, 8, 9, 15, 16, 19]), Candidate: [1 1 1 1 0 1 2 0 1 0 0 1 1 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 42400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0 -1  1 -1  1 -1  0  1 -1  0  0  1  0] (Indices: [0, 4, 7, 8, 10, 12, 15, 19]), Candidate: [ 1  1  1  1  0  1  2  0  0  2 -1  2  0  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0 -1  0  1  0 -1  1 -1  0  1 -1  0  1] (Indices: [0, 4, 7, 8, 11, 12, 14, 17]), Candidate: [ 1  1  1  1  0  1  2  0  0  1  1  1  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0 -1  0  0  1  0  0 -1  0  1 -1  0  1] (Indices: [0, 4, 7, 8, 12, 13, 14, 17]), Candidate: [ 1  1  1  1  0  1  2  0  0  1  0  2  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0 -1  0  0  0  1 -1  0  1  0 -1  1  0] (Indices: [0, 4, 7, 8, 13, 16, 17, 19]), Candidate: [1 1 1 1 0 1 2 0 0 1 0 1 2 0 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 42600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  1  0 -1  1  0 -1  0  0  0  1 -1  1] (Indices: [0, 4, 7, 9, 10, 12, 13, 18]), Candidate: [ 1  1  1  1  0  1  2 -1  2  1 -1  2  1  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 42650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  1  0 -1  0  0  0  0  1 -1  1  0  0] (Indices: [0, 4, 7, 9, 10, 16, 18, 19]), Candidate: [ 1  1  1  1  0  1  2 -1  2  1 -1  1  1  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 42700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  1 -1  1 -1  0  0  1  0 -1  0  1  0] (Indices: [0, 4, 7, 9, 11, 15, 16, 19]), Candidate: [ 1  1  1  1  0  1  2 -1  2  0  1  0  1  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  1 -1  0  0  1  0 -1  0  1  0 -1  1] (Indices: [0, 4, 7, 9, 13, 14, 17, 18]), Candidate: [ 1  1  1  1  0  1  2 -1  2  0  0  1  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 42800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  0  1  0 -1  1  0 -1  1 -1  0  0  1] (Indices: [0, 4, 7, 10, 11, 13, 14, 16]), Candidate: [ 1  1  1  1  0  1  2 -1  1  2  0  0  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 42850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  0  1 -1  1 -1  1  0 -1  1 -1  0  1] (Indices: [0, 4, 7, 10, 12, 14, 15, 17]), Candidate: [ 1  1  1  1  0  1  2 -1  1  2 -1  2  0  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 42900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  0  1 -1  0  0  0  1  0  0 -1  1  0] (Indices: [0, 4, 7, 10, 15, 16, 17, 19]), Candidate: [ 1  1  1  1  0  1  2 -1  1  2 -1  1  1  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 42950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  0  0  1 -1  1 -1  1  0 -1  1 -1  1] (Indices: [0, 4, 7, 11, 13, 15, 16, 18]), Candidate: [ 1  1  1  1  0  1  2 -1  1  1  1  0  2  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  0  0  0  1 -1  1 -1  1  0  0 -1  1] (Indices: [0, 4, 7, 12, 14, 16, 17, 18]), Candidate: [ 1  1  1  1  0  1  2 -1  1  1  0  2  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 43050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1  0  0  0 -1  0  0  1 -1  0  1 -1  1] (Indices: [0, 4, 8, 9, 10, 11, 15, 18]), Candidate: [1 1 1 1 0 1 1 1 1 1 0 0 1 1 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 43100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1  0  0 -1  0  0  1 -1  1 -1  0  1  0] (Indices: [0, 4, 8, 9, 10, 14, 16, 19]), Candidate: [ 1  1  1  1  0  1  1  1  1  1 -1  1  1  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 43150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1  0 -1  1 -1  0  1  0  0 -1  0  0  1] (Indices: [0, 4, 8, 9, 11, 14, 15, 16]), Candidate: [1 1 1 1 0 1 1 1 1 0 1 0 1 2 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 43200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1  0 -1  0  1 -1  0  1 -1  0  1  0  0] (Indices: [0, 4, 8, 9, 12, 15, 18, 19]), Candidate: [1 1 1 1 0 1 1 1 1 0 0 2 0 1 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 43250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1 -1  1  0  0 -1  1 -1  0  0  0  1  0] (Indices: [0, 4, 8, 10, 11, 12, 14, 19]), Candidate: [ 1  1  1  1  0  1  1  1  0  2  0  1  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1 -1  1 -1  1  0  0 -1  0  0  0  1  0] (Indices: [0, 4, 8, 10, 12, 13, 14, 19]), Candidate: [ 1  1  1  1  0  1  1  1  0  2 -1  2  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 43350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1 -1  1 -1  0  1 -1  0  0  1  0  0  0] (Indices: [0, 4, 8, 10, 13, 17, 18, 19]), Candidate: [ 1  1  1  1  0  1  1  1  0  2 -1  1  2  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1 -1  0  1  0 -1  0  0  0  1  0  0  0] (Indices: [0, 4, 8, 11, 12, 17, 18, 19]), Candidate: [1 1 1 1 0 1 1 1 0 1 1 1 0 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 43450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1 -1  0  0  1  0 -1  1 -1  1 -1  1  0] (Indices: [0, 4, 8, 12, 13, 15, 17, 19]), Candidate: [1 1 1 1 0 1 1 1 0 1 0 2 1 0 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 43500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  1  0  0  0 -1  1 -1  0  1 -1  0  1] (Indices: [0, 4, 9, 10, 11, 12, 14, 17]), Candidate: [ 1  1  1  1  0  1  1  0  2  1  0  1  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  1  0 -1  1  0  0 -1  0  1 -1  0  1] (Indices: [0, 4, 9, 10, 12, 13, 14, 17]), Candidate: [ 1  1  1  1  0  1  1  0  2  1 -1  2  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 43600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  1  0 -1  0  1 -1  0  1  0 -1  1  0] (Indices: [0, 4, 9, 10, 13, 16, 17, 19]), Candidate: [ 1  1  1  1  0  1  1  0  2  1 -1  1  2  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  1 -1  1  0 -1  0  0  1  0 -1  1  0] (Indices: [0, 4, 9, 11, 12, 16, 17, 19]), Candidate: [1 1 1 1 0 1 1 0 2 0 1 1 0 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 43700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  1 -1  0  1  0 -1  1  0 -1  0  1  0] (Indices: [0, 4, 9, 12, 13, 15, 16, 19]), Candidate: [1 1 1 1 0 1 1 0 2 0 0 2 1 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 43750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  0  1  0  0  0 -1  1 -1  1 -1  0  1] (Indices: [0, 4, 10, 11, 12, 13, 15, 17]), Candidate: [1 1 1 1 0 1 1 0 1 2 0 1 1 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 43800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  0  1  0 -1  0  1  0  0 -1  1 -1  1] (Indices: [0, 4, 10, 11, 14, 15, 16, 18]), Candidate: [1 1 1 1 0 1 1 0 1 2 0 0 1 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 43850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  0  1 -1  0  1  0  0  0 -1  1 -1  1] (Indices: [0, 4, 10, 13, 14, 15, 16, 18]), Candidate: [ 1  1  1  1  0  1  1  0  1  2 -1  1  2  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  0  0  1  0 -1  0  1  0  0  0 -1  1] (Indices: [0, 4, 11, 12, 15, 16, 17, 18]), Candidate: [1 1 1 1 0 1 1 0 1 1 1 1 0 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 43950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  0  0  0  0  1  0  0 -1  1  0  0  0] (Indices: [0, 4, 13, 14, 15, 17, 18, 19]), Candidate: [1 1 1 1 0 1 1 0 1 1 0 1 2 1 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 44000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0 -1  1  0 -1  1 -1  0  0  0  0  0  1] (Indices: [0, 5, 6, 7, 8, 10, 11, 13]), Candidate: [1 1 1 0 2 1 1 0 0 2 0 0 2 0 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 44050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0 -1  0  1 -1  0  1 -1  0  1 -1  0  1] (Indices: [0, 5, 6, 7, 8, 11, 14, 17]), Candidate: [ 1  1  1  0  2  1  1  0  0  1  1  0  1  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0 -1  0  0  0  0  1  0 -1  1 -1  0  1] (Indices: [0, 5, 6, 7, 8, 14, 15, 17]), Candidate: [1 1 1 0 2 1 1 0 0 1 0 1 1 2 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 44150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  1  0 -1  0  0  0  0  1 -1  1 -1  1] (Indices: [0, 5, 6, 7, 9, 10, 16, 18]), Candidate: [ 1  1  1  0  2  1  1 -1  2  1 -1  1  1  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 44200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  1 -1  0  1 -1  0  0  1 -1  0  1  0] (Indices: [0, 5, 6, 7, 9, 12, 16, 19]), Candidate: [ 1  1  1  0  2  1  1 -1  2  0  0  2  0  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  0  1  0 -1  1 -1  0  0  0  1 -1  1] (Indices: [0, 5, 6, 7, 10, 11, 13, 18]), Candidate: [ 1  1  1  0  2  1  1 -1  1  2  0  0  2  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  0  1 -1  0  1 -1  0  0  1  0 -1  1] (Indices: [0, 5, 6, 7, 10, 13, 17, 18]), Candidate: [ 1  1  1  0  2  1  1 -1  1  2 -1  1  2  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 44350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  0  0  1 -1  1 -1  1 -1  1 -1  0  1] (Indices: [0, 5, 6, 7, 11, 13, 15, 17]), Candidate: [ 1  1  1  0  2  1  1 -1  1  1  1  0  2  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  0  0  0  1 -1  1 -1  1 -1  0  1  0] (Indices: [0, 5, 6, 7, 12, 14, 16, 19]), Candidate: [ 1  1  1  0  2  1  1 -1  1  1  0  2  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 44450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1  0  0  0 -1  1 -1  0  0  0  0  0  1] (Indices: [0, 5, 6, 8, 9, 10, 11, 13]), Candidate: [1 1 1 0 2 1 0 1 1 1 0 0 2 0 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 44500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1  0 -1  1 -1  0  1 -1  0  1 -1  0  1] (Indices: [0, 5, 6, 8, 9, 11, 14, 17]), Candidate: [ 1  1  1  0  2  1  0  1  1  0  1  0  1  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1  0 -1  0  0  0  1  0 -1  1 -1  0  1] (Indices: [0, 5, 6, 8, 9, 14, 15, 17]), Candidate: [1 1 1 0 2 1 0 1 1 0 0 1 1 2 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 44600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1 -1  1 -1  1  0 -1  0  0  1 -1  0  1] (Indices: [0, 5, 6, 8, 10, 12, 13, 17]), Candidate: [ 1  1  1  0  2  1  0  1  0  2 -1  2  1  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1 -1  1 -1  0  0  0  0  1  0 -1  1  0] (Indices: [0, 5, 6, 8, 10, 16, 17, 19]), Candidate: [ 1  1  1  0  2  1  0  1  0  2 -1  1  1  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1 -1  0  1 -1  0  0  1  0 -1  1 -1  1] (Indices: [0, 5, 6, 8, 11, 15, 16, 18]), Candidate: [1 1 1 0 2 1 0 1 0 1 1 0 1 1 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 44750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1 -1  0  0  0  1  0 -1  1 -1  0  1  0] (Indices: [0, 5, 6, 8, 13, 14, 16, 19]), Candidate: [ 1  1  1  0  2  1  0  1  0  1  0  1  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  1  0  0 -1  0  0  1 -1  0  0  1  0] (Indices: [0, 5, 6, 9, 10, 11, 15, 19]), Candidate: [1 1 1 0 2 1 0 0 2 1 0 0 1 1 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 44850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  1  0 -1  0  0  1 -1  0  1  0 -1  1] (Indices: [0, 5, 6, 9, 10, 14, 17, 18]), Candidate: [ 1  1  1  0  2  1  0  0  2  1 -1  1  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 44900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  1 -1  1 -1  0  1  0 -1  1 -1  0  1] (Indices: [0, 5, 6, 9, 11, 14, 15, 17]), Candidate: [1 1 1 0 2 1 0 0 2 0 1 0 1 2 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 44950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  1 -1  0  1 -1  0  0  1  0  0 -1  1] (Indices: [0, 5, 6, 9, 12, 16, 17, 18]), Candidate: [1 1 1 0 2 1 0 0 2 0 0 2 0 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 45000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  0  1  0  0 -1  0  1  0 -1  0  0  1] (Indices: [0, 5, 6, 10, 11, 12, 15, 16]), Candidate: [1 1 1 0 2 1 0 0 1 2 0 1 0 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 45050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  0  1 -1  1  0 -1  1  0 -1  0  0  1] (Indices: [0, 5, 6, 10, 12, 13, 15, 16]), Candidate: [ 1  1  1  0  2  1  0  0  1  2 -1  2  1  0  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  0  1 -1  0  0  1  0  0  0 -1  0  1] (Indices: [0, 5, 6, 10, 14, 15, 16, 17]), Candidate: [ 1  1  1  0  2  1  0  0  1  2 -1  1  1  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  0  0  1 -1  1  0  0  0 -1  0  0  1] (Indices: [0, 5, 6, 11, 13, 14, 15, 16]), Candidate: [1 1 1 0 2 1 0 0 1 1 1 0 2 1 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 45200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  0  0  0  1  0 -1  1 -1  0  1  0  0] (Indices: [0, 5, 6, 12, 13, 15, 18, 19]), Candidate: [1 1 1 0 2 1 0 0 1 1 0 2 1 0 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 45250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0  0  0 -1  1 -1  1 -1  0  0  0  0  1] (Indices: [0, 5, 7, 8, 9, 10, 12, 14]), Candidate: [ 1  1  1  0  2  0  2  0  1  1 -1  2  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 45300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0  0 -1  1 -1  0  0  0  1 -1  1 -1  1] (Indices: [0, 5, 7, 8, 9, 11, 16, 18]), Candidate: [1 1 1 0 2 0 2 0 1 0 1 0 1 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 45350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0  0 -1  0  0  0  1 -1  0  0  1  0  0] (Indices: [0, 5, 7, 8, 9, 14, 18, 19]), Candidate: [ 1  1  1  0  2  0  2  0  1  0  0  1  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0 -1  1 -1  1 -1  0  1  0 -1  0  0  1] (Indices: [0, 5, 7, 8, 10, 12, 15, 16]), Candidate: [ 1  1  1  0  2  0  2  0  0  2 -1  2  0  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0 -1  0  1  0  0 -1  0  0  0  0  1  0] (Indices: [0, 5, 7, 8, 11, 12, 13, 19]), Candidate: [1 1 1 0 2 0 2 0 0 1 1 1 1 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 45500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0 -1  0  1 -1  0  0  0  0  1  0  0  0] (Indices: [0, 5, 7, 8, 11, 17, 18, 19]), Candidate: [1 1 1 0 2 0 2 0 0 1 1 0 1 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 45550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0 -1  0  0  0  1 -1  1 -1  1 -1  1  0] (Indices: [0, 5, 7, 8, 13, 15, 17, 19]), Candidate: [1 1 1 0 2 0 2 0 0 1 0 1 2 0 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 45600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  1  0 -1  1  0 -1  1 -1  0  0  0  1] (Indices: [0, 5, 7, 9, 10, 12, 13, 15]), Candidate: [ 1  1  1  0  2  0  2 -1  2  1 -1  2  1  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 45650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  1  0 -1  0  0  0  1 -1  0  1  0  0] (Indices: [0, 5, 7, 9, 10, 15, 18, 19]), Candidate: [ 1  1  1  0  2  0  2 -1  2  1 -1  1  1  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 45700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  1 -1  1 -1  0  1 -1  0  0  1  0  0] (Indices: [0, 5, 7, 9, 11, 14, 18, 19]), Candidate: [ 1  1  1  0  2  0  2 -1  2  0  1  0  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 45750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  1 -1  0  0  1  0 -1  1  0 -1  0  1] (Indices: [0, 5, 7, 9, 13, 14, 16, 17]), Candidate: [ 1  1  1  0  2  0  2 -1  2  0  0  1  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 45800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  0  1  0  0 -1  0  0  0  1 -1  1  0] (Indices: [0, 5, 7, 10, 11, 12, 17, 19]), Candidate: [ 1  1  1  0  2  0  2 -1  1  2  0  1  0  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  0  1 -1  1  0 -1  0  0  1 -1  1  0] (Indices: [0, 5, 7, 10, 12, 13, 17, 19]), Candidate: [ 1  1  1  0  2  0  2 -1  1  2 -1  2  1  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 45900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  0  1 -1  0  0  1 -1  1 -1  1  0  0] (Indices: [0, 5, 7, 10, 14, 16, 18, 19]), Candidate: [ 1  1  1  0  2  0  2 -1  1  2 -1  1  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 45950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  0  0  1 -1  1  0 -1  0  1 -1  1  0] (Indices: [0, 5, 7, 11, 13, 14, 17, 19]), Candidate: [ 1  1  1  0  2  0  2 -1  1  1  1  0  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 46000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  0  0  0  1 -1  1  0 -1  1  0 -1  1] (Indices: [0, 5, 7, 12, 14, 15, 17, 18]), Candidate: [ 1  1  1  0  2  0  2 -1  1  1  0  2  0  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1  0  0  0 -1  0  1 -1  0  0  0  1  0] (Indices: [0, 5, 8, 9, 10, 11, 14, 19]), Candidate: [ 1  1  1  0  2  0  1  1  1  1  0  0  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1  0  0 -1  0  0  1  0 -1  0  0  1  0] (Indices: [0, 5, 8, 9, 10, 14, 15, 19]), Candidate: [ 1  1  1  0  2  0  1  1  1  1 -1  1  1  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1  0 -1  1 -1  1 -1  0  0  1  0 -1  1] (Indices: [0, 5, 8, 9, 11, 13, 17, 18]), Candidate: [1 1 1 0 2 0 1 1 1 0 1 0 2 0 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 46200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1  0 -1  0  1 -1  0  1  0 -1  0  1  0] (Indices: [0, 5, 8, 9, 12, 15, 16, 19]), Candidate: [1 1 1 0 2 0 1 1 1 0 0 2 0 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 46250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1 -1  1  0  0 -1  1 -1  1 -1  0  0  1] (Indices: [0, 5, 8, 10, 11, 12, 14, 16]), Candidate: [ 1  1  1  0  2  0  1  1  0  2  0  1  0  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1 -1  1 -1  1  0  0 -1  1 -1  0  0  1] (Indices: [0, 5, 8, 10, 12, 13, 14, 16]), Candidate: [ 1  1  1  0  2  0  1  1  0  2 -1  2  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 46350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1 -1  1 -1  0  1 -1  0  1  0  0 -1  1] (Indices: [0, 5, 8, 10, 13, 16, 17, 18]), Candidate: [ 1  1  1  0  2  0  1  1  0  2 -1  1  2  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1 -1  0  1  0 -1  0  0  1  0  0 -1  1] (Indices: [0, 5, 8, 11, 12, 16, 17, 18]), Candidate: [1 1 1 0 2 0 1 1 0 1 1 1 0 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 46450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1 -1  0  0  1  0 -1  1  0 -1  1 -1  1] (Indices: [0, 5, 8, 12, 13, 15, 16, 18]), Candidate: [1 1 1 0 2 0 1 1 0 1 0 2 1 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 46500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  1  0  0  0  0 -1  0  0  0  0  1  0] (Indices: [0, 5, 9, 10, 11, 12, 13, 19]), Candidate: [1 1 1 0 2 0 1 0 2 1 0 1 1 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 46550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  1  0  0 -1  0  0  0  0  1  0  0  0] (Indices: [0, 5, 9, 10, 11, 17, 18, 19]), Candidate: [1 1 1 0 2 0 1 0 2 1 0 0 1 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 46600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  1  0 -1  0  1 -1  1 -1  1 -1  1  0] (Indices: [0, 5, 9, 10, 13, 15, 17, 19]), Candidate: [ 1  1  1  0  2  0  1  0  2  1 -1  1  2  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  1 -1  1  0 -1  0  1 -1  1 -1  1  0] (Indices: [0, 5, 9, 11, 12, 15, 17, 19]), Candidate: [1 1 1 0 2 0 1 0 2 0 1 1 0 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 46700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  1 -1  0  1  0  0 -1  0  0  1  0  0] (Indices: [0, 5, 9, 12, 13, 14, 18, 19]), Candidate: [ 1  1  1  0  2  0  1  0  2  0  0  2  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  0  1  0  0  0  0 -1  0  0  1 -1  1] (Indices: [0, 5, 10, 11, 12, 13, 14, 18]), Candidate: [ 1  1  1  0  2  0  1  0  1  2  0  1  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  0  1  0 -1  1 -1  0  1 -1  1  0  0] (Indices: [0, 5, 10, 11, 13, 16, 18, 19]), Candidate: [1 1 1 0 2 0 1 0 1 2 0 0 2 0 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 46850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  0  1 -1  1 -1  0  1 -1  1  0  0  0] (Indices: [0, 5, 10, 12, 15, 17, 18, 19]), Candidate: [ 1  1  1  0  2  0  1  0  1  2 -1  2  0  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  0  0  1  0 -1  1 -1  1  0 -1  1  0] (Indices: [0, 5, 11, 12, 14, 16, 17, 19]), Candidate: [ 1  1  1  0  2  0  1  0  1  1  1  1  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  0  0  0  0  1  0  0  0  0  0 -1  1] (Indices: [0, 5, 13, 14, 15, 16, 17, 18]), Candidate: [1 1 1 0 2 0 1 0 1 1 0 1 2 1 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 47000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0  0 -1  1 -1  1  0 -1  0  0  0  0  1] (Indices: [0, 6, 7, 8, 9, 11, 13, 14]), Candidate: [ 1  1  1  0  1  2  1  0  1  0  1  0  2  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0  0 -1  0  0  1 -1  1 -1  0  0  1  0] (Indices: [0, 6, 7, 8, 9, 13, 15, 19]), Candidate: [1 1 1 0 1 2 1 0 1 0 0 1 2 0 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 47100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0 -1  1  0 -1  0  0  0  1 -1  1 -1  1] (Indices: [0, 6, 7, 8, 10, 11, 16, 18]), Candidate: [1 1 1 0 1 2 1 0 0 2 0 0 1 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 47150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0 -1  1 -1  0  0  1 -1  0  0  1  0  0] (Indices: [0, 6, 7, 8, 10, 14, 18, 19]), Candidate: [ 1  1  1  0  1  2  1  0  0  2 -1  1  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 47200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0 -1  0  1 -1  0  1  0 -1  0  0  1  0] (Indices: [0, 6, 7, 8, 11, 14, 15, 19]), Candidate: [1 1 1 0 1 2 1 0 0 1 1 0 1 2 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 47250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0 -1  0  0  1 -1  0  0  1 -1  1  0  0] (Indices: [0, 6, 7, 8, 12, 16, 18, 19]), Candidate: [1 1 1 0 1 2 1 0 0 1 0 2 0 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 47300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  1  0  0 -1  0  1  0 -1  0  0  0  1] (Indices: [0, 6, 7, 9, 10, 11, 14, 15]), Candidate: [ 1  1  1  0  1  2  1 -1  2  1  0  0  1  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  1  0 -1  0  1 -1  0  0  0  1  0  0] (Indices: [0, 6, 7, 9, 10, 13, 18, 19]), Candidate: [ 1  1  1  0  1  2  1 -1  2  1 -1  1  2  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 47400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  1 -1  1 -1  1 -1  1 -1  0  0  1  0] (Indices: [0, 6, 7, 9, 11, 13, 15, 19]), Candidate: [ 1  1  1  0  1  2  1 -1  2  0  1  0  2  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  1 -1  0  1 -1  1 -1  0  1 -1  1  0] (Indices: [0, 6, 7, 9, 12, 14, 17, 19]), Candidate: [ 1  1  1  0  1  2  1 -1  2  0  0  2  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 47500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  0  1  0  0  0 -1  0  0  1 -1  0  1] (Indices: [0, 6, 7, 10, 11, 12, 13, 17]), Candidate: [ 1  1  1  0  1  2  1 -1  1  2  0  1  1  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  0  1  0 -1  0  0  0  1  0 -1  1  0] (Indices: [0, 6, 7, 10, 11, 16, 17, 19]), Candidate: [ 1  1  1  0  1  2  1 -1  1  2  0  0  1  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  0  1 -1  0  1 -1  1  0 -1  0  1  0] (Indices: [0, 6, 7, 10, 13, 15, 16, 19]), Candidate: [ 1  1  1  0  1  2  1 -1  1  2 -1  1  2  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 47650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  0  0  1  0 -1  0  1  0 -1  0  1  0] (Indices: [0, 6, 7, 11, 12, 15, 16, 19]), Candidate: [ 1  1  1  0  1  2  1 -1  1  1  1  1  0  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  0  0  0  1  0  0 -1  0  1  0 -1  1] (Indices: [0, 6, 7, 12, 13, 14, 17, 18]), Candidate: [ 1  1  1  0  1  2  1 -1  1  1  0  2  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 47750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1  0  0  0  0 -1  1 -1  0  0  0  0  1] (Indices: [0, 6, 8, 9, 10, 11, 12, 14]), Candidate: [ 1  1  1  0  1  2  0  1  1  1  0  1  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1  0  0 -1  0  1  0 -1  0  1 -1  0  1] (Indices: [0, 6, 8, 9, 10, 13, 14, 17]), Candidate: [ 1  1  1  0  1  2  0  1  1  1 -1  1  2  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 47850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1  0 -1  1  0 -1  0  0  1 -1  0  1  0] (Indices: [0, 6, 8, 9, 11, 12, 16, 19]), Candidate: [1 1 1 0 1 2 0 1 1 0 1 1 0 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 47900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1  0 -1  0  1  0 -1  0  1 -1  0  1  0] (Indices: [0, 6, 8, 9, 12, 13, 16, 19]), Candidate: [1 1 1 0 1 2 0 1 1 0 0 2 1 0 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 47950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1  0 -1  0  0  0  1 -1  1  0  0 -1  1] (Indices: [0, 6, 8, 9, 14, 16, 17, 18]), Candidate: [ 1  1  1  0  1  2  0  1  1  0  0  1  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1 -1  1  0 -1  0  1 -1  1 -1  1 -1  1] (Indices: [0, 6, 8, 10, 11, 14, 16, 18]), Candidate: [ 1  1  1  0  1  2  0  1  0  2  0  0  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1 -1  1 -1  0  1  0  0  0 -1  0  0  1] (Indices: [0, 6, 8, 10, 13, 14, 15, 16]), Candidate: [ 1  1  1  0  1  2  0  1  0  2 -1  1  2  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1 -1  0  1  0 -1  1  0  0 -1  0  0  1] (Indices: [0, 6, 8, 11, 12, 14, 15, 16]), Candidate: [1 1 1 0 1 2 0 1 0 1 1 1 0 2 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 48150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1 -1  0  1 -1  0  0  1  0  0  0 -1  1] (Indices: [0, 6, 8, 11, 15, 16, 17, 18]), Candidate: [1 1 1 0 1 2 0 1 0 1 1 0 1 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 48200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1 -1  0  0  0  1 -1  1  0  0  0 -1  1] (Indices: [0, 6, 8, 13, 15, 16, 17, 18]), Candidate: [1 1 1 0 1 2 0 1 0 1 0 1 2 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 48250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  1  0  0 -1  0  1  0 -1  0  0  1  0] (Indices: [0, 6, 9, 10, 11, 14, 15, 19]), Candidate: [1 1 1 0 1 2 0 0 2 1 0 0 1 2 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 48300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  1  0 -1  1 -1  0  0  1 -1  1  0  0] (Indices: [0, 6, 9, 10, 12, 16, 18, 19]), Candidate: [ 1  1  1  0  1  2  0  0  2  1 -1  2  0  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  1 -1  1  0  0 -1  0  0  1 -1  1  0] (Indices: [0, 6, 9, 11, 12, 13, 17, 19]), Candidate: [1 1 1 0 1 2 0 0 2 0 1 1 1 0 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 48400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  1 -1  1 -1  0  1 -1  1 -1  1  0  0] (Indices: [0, 6, 9, 11, 14, 16, 18, 19]), Candidate: [ 1  1  1  0  1  2  0  0  2  0  1  0  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  1 -1  0  0  1  0 -1  1 -1  1  0  0] (Indices: [0, 6, 9, 13, 14, 16, 18, 19]), Candidate: [ 1  1  1  0  1  2  0  0  2  0  0  1  2  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  0  1  0 -1  1  0  0 -1  0  1 -1  1] (Indices: [0, 6, 10, 11, 13, 14, 15, 18]), Candidate: [1 1 1 0 1 2 0 0 1 2 0 0 2 1 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 48550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  0  1 -1  1  0 -1  0  1  0 -1  1  0] (Indices: [0, 6, 10, 12, 13, 16, 17, 19]), Candidate: [ 1  1  1  0  1  2  0  0  1  2 -1  2  1  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  0  0  1  0  0 -1  1  0 -1  1 -1  1] (Indices: [0, 6, 11, 12, 13, 15, 16, 18]), Candidate: [1 1 1 0 1 2 0 0 1 1 1 1 1 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 48650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  0  0  0  1  0  0  0 -1  0  1  0  0] (Indices: [0, 6, 12, 13, 14, 15, 18, 19]), Candidate: [1 1 1 0 1 2 0 0 1 1 0 2 1 1 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 48700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0  0  0  0 -1  0  0  0  0  0  1  0  0] (Indices: [0, 7, 8, 9, 10, 11, 18, 19]), Candidate: [1 1 1 0 1 1 2 0 1 1 0 0 1 1 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 48750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0  0  0 -1  0  0  0  1 -1  1  0 -1  1] (Indices: [0, 7, 8, 9, 10, 15, 17, 18]), Candidate: [ 1  1  1  0  1  1  2  0  1  1 -1  1  1  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0  0 -1  1 -1  0  1 -1  0  1  0 -1  1] (Indices: [0, 7, 8, 9, 11, 14, 17, 18]), Candidate: [ 1  1  1  0  1  1  2  0  1  0  1  0  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0  0 -1  0  0  1  0  0 -1  0  1 -1  1] (Indices: [0, 7, 8, 9, 13, 14, 15, 18]), Candidate: [1 1 1 0 1 1 2 0 1 0 0 1 2 1 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 48900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0 -1  1  0  0 -1  0  0  1 -1  0  1  0] (Indices: [0, 7, 8, 10, 11, 12, 16, 19]), Candidate: [1 1 1 0 1 1 2 0 0 2 0 1 0 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 48950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0 -1  1 -1  1  0 -1  0  1 -1  0  1  0] (Indices: [0, 7, 8, 10, 12, 13, 16, 19]), Candidate: [ 1  1  1  0  1  1  2  0  0  2 -1  2  1  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0 -1  1 -1  0  0  1 -1  1  0  0 -1  1] (Indices: [0, 7, 8, 10, 14, 16, 17, 18]), Candidate: [ 1  1  1  0  1  1  2  0  0  2 -1  1  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 49050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0 -1  0  1 -1  1  0 -1  1 -1  0  1  0] (Indices: [0, 7, 8, 11, 13, 14, 16, 19]), Candidate: [ 1  1  1  0  1  1  2  0  0  1  1  0  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0 -1  0  0  1 -1  1  0  0 -1  1 -1  1] (Indices: [0, 7, 8, 12, 14, 15, 16, 18]), Candidate: [1 1 1 0 1 1 2 0 0 1 0 2 0 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 49150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  1  0  0  0 -1  0  0  1  0 -1  0  1] (Indices: [0, 7, 9, 10, 11, 12, 16, 17]), Candidate: [ 1  1  1  0  1  1  2 -1  2  1  0  1  0  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  1  0 -1  1  0 -1  0  1  0 -1  0  1] (Indices: [0, 7, 9, 10, 12, 13, 16, 17]), Candidate: [ 1  1  1  0  1  1  2 -1  2  1 -1  2  1  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 49250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  1  0 -1  0  0  1  0 -1  1 -1  1  0] (Indices: [0, 7, 9, 10, 14, 15, 17, 19]), Candidate: [ 1  1  1  0  1  1  2 -1  2  1 -1  1  1  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 49300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  1 -1  1 -1  1  0 -1  1  0 -1  0  1] (Indices: [0, 7, 9, 11, 13, 14, 16, 17]), Candidate: [ 1  1  1  0  1  1  2 -1  2  0  1  0  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 49350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  1 -1  0  1  0 -1  0  0  1  0  0  0] (Indices: [0, 7, 9, 12, 13, 17, 18, 19]), Candidate: [ 1  1  1  0  1  1  2 -1  2  0  0  2  1  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  0  1  0  0  0 -1  0  0  1 -1  1  0] (Indices: [0, 7, 10, 11, 12, 13, 17, 19]), Candidate: [ 1  1  1  0  1  1  2 -1  1  2  0  1  1  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  0  1  0 -1  0  1 -1  1 -1  1  0  0] (Indices: [0, 7, 10, 11, 14, 16, 18, 19]), Candidate: [ 1  1  1  0  1  1  2 -1  1  2  0  0  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 49500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  0  1 -1  0  1  0 -1  1 -1  1  0  0] (Indices: [0, 7, 10, 13, 14, 16, 18, 19]), Candidate: [ 1  1  1  0  1  1  2 -1  1  2 -1  1  2  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 49550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  0  0  1 -1  1  0  0  0 -1  0  1  0] (Indices: [0, 7, 11, 13, 14, 15, 16, 19]), Candidate: [ 1  1  1  0  1  1  2 -1  1  1  1  0  2  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1  0  0  0  0  0 -1  0  0  1 -1  0  1] (Indices: [0, 8, 9, 10, 11, 12, 13, 17]), Candidate: [1 1 1 0 1 1 1 1 1 1 0 1 1 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 49650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1  0  0  0 -1  0  0  0  1  0 -1  1  0] (Indices: [0, 8, 9, 10, 11, 16, 17, 19]), Candidate: [1 1 1 0 1 1 1 1 1 1 0 0 1 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 49700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1  0  0 -1  0  1 -1  1  0 -1  0  1  0] (Indices: [0, 8, 9, 10, 13, 15, 16, 19]), Candidate: [ 1  1  1  0  1  1  1  1  1  1 -1  1  2  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1  0 -1  1  0 -1  0  1  0 -1  0  1  0] (Indices: [0, 8, 9, 11, 12, 15, 16, 19]), Candidate: [1 1 1 0 1 1 1 1 1 0 1 1 0 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 49800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1  0 -1  0  1  0  0 -1  0  1  0 -1  1] (Indices: [0, 8, 9, 12, 13, 14, 17, 18]), Candidate: [ 1  1  1  0  1  1  1  1  1  0  0  2  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1 -1  1  0  0  0  0 -1  1 -1  0  0  1] (Indices: [0, 8, 10, 11, 12, 13, 14, 16]), Candidate: [ 1  1  1  0  1  1  1  1  0  2  0  1  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1 -1  1  0 -1  1 -1  0  1  0  0 -1  1] (Indices: [0, 8, 10, 11, 13, 16, 17, 18]), Candidate: [1 1 1 0 1 1 1 1 0 2 0 0 2 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 49950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1 -1  1 -1  1 -1  0  1  0  0 -1  1  0] (Indices: [0, 8, 10, 12, 15, 16, 17, 19]), Candidate: [ 1  1  1  0  1  1  1  1  0  2 -1  2  0  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1 -1  0  1  0 -1  1  0 -1  0  1  0  0] (Indices: [0, 8, 11, 12, 14, 15, 18, 19]), Candidate: [1 1 1 0 1 1 1 1 0 1 1 1 0 2 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 50050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1 -1  0  0  1 -1  1 -1  1  0  0  0  0] (Indices: [0, 8, 12, 14, 16, 17, 18, 19]), Candidate: [ 1  1  1  0  1  1  1  1  0  1  0  2  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  1  0  0 -1  1  0 -1  1 -1  0  1  0] (Indices: [0, 9, 10, 11, 13, 14, 16, 19]), Candidate: [ 1  1  1  0  1  1  1  0  2  1  0  0  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  1  0 -1  1 -1  1  0  0 -1  1 -1  1] (Indices: [0, 9, 10, 12, 14, 15, 16, 18]), Candidate: [ 1  1  1  0  1  1  1  0  2  1 -1  2  0  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  1 -1  1  0  0 -1  1 -1  0  1  0  0] (Indices: [0, 9, 11, 12, 13, 15, 18, 19]), Candidate: [1 1 1 0 1 1 1 0 2 0 1 1 1 0 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 50250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  1 -1  0  1  0  0 -1  0  1  0  0  0] (Indices: [0, 9, 12, 13, 14, 17, 18, 19]), Candidate: [ 1  1  1  0  1  1  1  0  2  0  0  2  1  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  0  1  0  0 -1  0  1  0  0 -1  1  0] (Indices: [0, 10, 11, 12, 15, 16, 17, 19]), Candidate: [1 1 1 0 1 1 1 0 1 2 0 1 0 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 50350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  0  1 -1  0  1  0 -1  1  0  0  0  0] (Indices: [0, 10, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  1  1  0  1  1  1  0  1  2 -1  1  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 50400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  0  0  0  0  0  0  0  0  0  0  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 7, 19]), Candidate: [ 3  1  1  0  1  1  1 -1  1  1  0  1  1  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  0  0  0  0  1 -1  0  0  0  1 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 13, 18]), Candidate: [3 1 1 0 1 1 0 0 1 1 0 1 2 0 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 50500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  0  0  1 -1  0  0  1 -1  0  0  0  0] (Indices: [1, 2, 3, 4, 5, 7, 11, 15]), Candidate: [ 3  1  1  0  1  0  2 -1  1  1  1  0  1  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1 -1  1 -1  0  0  0  0  0  0  1 -1  0] (Indices: [1, 2, 3, 4, 5, 8, 10, 18]), Candidate: [ 3  1  1  0  1  0  1  1  0  2 -1  1  1  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  1 -1  1 -1  0  0  1 -1  0  0  0  0] (Indices: [1, 2, 3, 4, 5, 9, 11, 15]), Candidate: [3 1 1 0 1 0 1 0 2 0 1 0 1 1 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 50650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  0  1 -1  0  1 -1  0  1 -1  0  0  0] (Indices: [1, 2, 3, 4, 5, 10, 13, 16]), Candidate: [ 3  1  1  0  1  0  1  0  1  2 -1  1  2  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  0  0  0  1  0 -1  0  0  1 -1  0  0] (Indices: [1, 2, 3, 4, 5, 12, 13, 17]), Candidate: [3 1 1 0 1 0 1 0 1 1 0 2 1 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 50750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  0  0  0  0  0  0  0  1  0 -1  1 -1] (Indices: [1, 2, 3, 4, 5, 16, 17, 19]), Candidate: [3 1 1 0 1 0 1 0 1 1 0 1 1 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 50800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  0  0  0  0  1 -1  0  1 -1  0  0  0] (Indices: [1, 2, 3, 4, 6, 7, 13, 16]), Candidate: [ 3  1  1  0  0  2  1 -1  1  1  0  1  2  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1 -1  0  0  1 -1  0  0  0  1 -1  0  0] (Indices: [1, 2, 3, 4, 6, 8, 12, 17]), Candidate: [3 1 1 0 0 2 0 1 0 1 0 2 0 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 50900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  1 -1  0  0  1 -1  0  1 -1  0  0  0] (Indices: [1, 2, 3, 4, 6, 9, 13, 16]), Candidate: [3 1 1 0 0 2 0 0 2 0 0 1 2 0 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 50950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  0  1 -1  0  0  0  0  1 -1  1 -1  0] (Indices: [1, 2, 3, 4, 6, 10, 16, 18]), Candidate: [ 3  1  1  0  0  2  0  0  1  2 -1  1  1  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  0  0  0  1 -1  0  0  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 6, 12, 16, 19]), Candidate: [3 1 1 0 0 2 0 0 1 1 0 2 0 1 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 51050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0 -1  1 -1  1 -1  0  0  0  0  0  0  0] (Indices: [1, 2, 3, 4, 7, 8, 10, 12]), Candidate: [ 3  1  1  0  0  1  2  0  0  2 -1  2  0  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  1  0 -1  0  0  0  0  0  1 -1  0  0] (Indices: [1, 2, 3, 4, 7, 9, 10, 17]), Candidate: [ 3  1  1  0  0  1  2 -1  2  1 -1  1  1  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 51150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  0  1 -1  1 -1  0  0  1 -1  0  0  0] (Indices: [1, 2, 3, 4, 7, 10, 12, 16]), Candidate: [ 3  1  1  0  0  1  2 -1  1  2 -1  2  0  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 51200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  0  0  1 -1  0  0  0  0  1  0 -1  0] (Indices: [1, 2, 3, 4, 7, 11, 17, 18]), Candidate: [ 3  1  1  0  0  1  2 -1  1  1  1  0  1  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  0  0  0  0  0  0  1  0 -1  1 -1  0] (Indices: [1, 2, 3, 4, 7, 15, 16, 18]), Candidate: [ 3  1  1  0  0  1  2 -1  1  1  0  1  1  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1  0 -1  0  0  0  0  0  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 8, 9, 16, 19]), Candidate: [3 1 1 0 0 1 1 1 1 0 0 1 1 1 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 51350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1 -1  0  1 -1  1 -1  0  0  1 -1  0  0] (Indices: [1, 2, 3, 4, 8, 11, 13, 17]), Candidate: [3 1 1 0 0 1 1 1 0 1 1 0 2 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 51400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1 -1  0  0  0  1 -1  0  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 8, 13, 16, 19]), Candidate: [3 1 1 0 0 1 1 1 0 1 0 1 2 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 51450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  1  0 -1  0  0  0  1  0 -1  0  0  0] (Indices: [1, 2, 3, 4, 9, 10, 15, 16]), Candidate: [ 3  1  1  0  0  1  1  0  2  1 -1  1  1  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  1 -1  0  1 -1  0  1 -1  1 -1  0  0] (Indices: [1, 2, 3, 4, 9, 12, 15, 17]), Candidate: [3 1 1 0 0 1 1 0 2 0 0 2 0 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 51550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  0  1  0  0 -1  0  0  0  0  0  1 -1] (Indices: [1, 2, 3, 4, 10, 11, 12, 19]), Candidate: [3 1 1 0 0 1 1 0 1 2 0 1 0 1 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 51600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  0  1 -1  0  1 -1  1 -1  0  1 -1  0] (Indices: [1, 2, 3, 4, 10, 13, 15, 18]), Candidate: [ 3  1  1  0  0  1  1  0  1  2 -1  1  2  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  0  0  1 -1  1  0 -1  1 -1  0  0  0] (Indices: [1, 2, 3, 4, 11, 13, 14, 16]), Candidate: [ 3  1  1  0  0  1  1  0  1  1  1  0  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  0  0  0  1 -1  1  0 -1  1 -1  0  0] (Indices: [1, 2, 3, 4, 12, 14, 15, 17]), Candidate: [3 1 1 0 0 1 1 0 1 1 0 2 0 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 51750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  0  0  0  0  0  0  1  0  0 -1  1 -1] (Indices: [1, 2, 3, 4, 15, 16, 17, 19]), Candidate: [3 1 1 0 0 1 1 0 1 1 0 1 1 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 51800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  0  0  0  0  1 -1  1 -1  0  0  0  0] (Indices: [1, 2, 3, 5, 6, 7, 13, 15]), Candidate: [ 3  1  1 -1  2  1  1 -1  1  1  0  1  2  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 51850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1 -1  0  0  1 -1  0  0  1 -1  0  0  0] (Indices: [1, 2, 3, 5, 6, 8, 12, 16]), Candidate: [ 3  1  1 -1  2  1  0  1  0  1  0  2  0  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  1 -1  0  0  1 -1  1 -1  0  0  0  0] (Indices: [1, 2, 3, 5, 6, 9, 13, 15]), Candidate: [ 3  1  1 -1  2  1  0  0  2  0  0  1  2  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  0  1 -1  0  0  0  0  1  0 -1  0  0] (Indices: [1, 2, 3, 5, 6, 10, 16, 17]), Candidate: [ 3  1  1 -1  2  1  0  0  1  2 -1  1  1  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  0  0  0  1 -1  0  0  1 -1  1 -1  0] (Indices: [1, 2, 3, 5, 6, 12, 16, 18]), Candidate: [ 3  1  1 -1  2  1  0  0  1  1  0  2  0  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0 -1  1  0 -1  0  0  0  0  0  0  0  0] (Indices: [1, 2, 3, 5, 7, 8, 10, 11]), Candidate: [ 3  1  1 -1  2  0  2  0  0  2  0  0  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  1  0 -1  0  0  0  0  1 -1  0  0  0] (Indices: [1, 2, 3, 5, 7, 9, 10, 16]), Candidate: [ 3  1  1 -1  2  0  2 -1  2  1 -1  1  1  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 52150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  0  1 -1  1 -1  0  1 -1  0  0  0  0] (Indices: [1, 2, 3, 5, 7, 10, 12, 15]), Candidate: [ 3  1  1 -1  2  0  2 -1  1  2 -1  2  0  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 52200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  0  0  1 -1  0  0  0  1 -1  0  1 -1] (Indices: [1, 2, 3, 5, 7, 11, 16, 19]), Candidate: [ 3  1  1 -1  2  0  2 -1  1  1  1  0  1  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  0  0  0  0  0  0  1  0  0 -1  0  0] (Indices: [1, 2, 3, 5, 7, 15, 16, 17]), Candidate: [ 3  1  1 -1  2  0  2 -1  1  1  0  1  1  1  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1  0 -1  0  0  0  0  0  1 -1  1 -1  0] (Indices: [1, 2, 3, 5, 8, 9, 16, 18]), Candidate: [ 3  1  1 -1  2  0  1  1  1  0  0  1  1  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1 -1  0  1 -1  1 -1  0  1 -1  0  0  0] (Indices: [1, 2, 3, 5, 8, 11, 13, 16]), Candidate: [ 3  1  1 -1  2  0  1  1  0  1  1  0  2  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1 -1  0  0  0  1 -1  0  1 -1  1 -1  0] (Indices: [1, 2, 3, 5, 8, 13, 16, 18]), Candidate: [ 3  1  1 -1  2  0  1  1  0  1  0  1  2  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  1  0 -1  0  0  1 -1  0  0  0  1 -1] (Indices: [1, 2, 3, 5, 9, 10, 14, 19]), Candidate: [ 3  1  1 -1  2  0  1  0  2  1 -1  1  1  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 52500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  1 -1  0  1 -1  0  1  0 -1  0  0  0] (Indices: [1, 2, 3, 5, 9, 12, 15, 16]), Candidate: [ 3  1  1 -1  2  0  1  0  2  0  0  2  0  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  0  1  0  0 -1  0  0  0  0  1 -1  0] (Indices: [1, 2, 3, 5, 10, 11, 12, 18]), Candidate: [ 3  1  1 -1  2  0  1  0  1  2  0  1  0  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  0  1 -1  0  1 -1  1 -1  1 -1  0  0] (Indices: [1, 2, 3, 5, 10, 13, 15, 17]), Candidate: [ 3  1  1 -1  2  0  1  0  1  2 -1  1  2  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  0  0  1 -1  1  0  0 -1  0  0  0  0] (Indices: [1, 2, 3, 5, 11, 13, 14, 15]), Candidate: [ 3  1  1 -1  2  0  1  0  1  1  1  0  2  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  0  0  0  1 -1  1  0  0 -1  0  0  0] (Indices: [1, 2, 3, 5, 12, 14, 15, 16]), Candidate: [ 3  1  1 -1  2  0  1  0  1  1  0  2  0  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  0  0  0  0  0  0  1  0  0  0 -1  0] (Indices: [1, 2, 3, 5, 15, 16, 17, 18]), Candidate: [ 3  1  1 -1  2  0  1  0  1  1  0  1  1  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0 -1  0  0  0  0  0  1  0 -1  0  0  0] (Indices: [1, 2, 3, 6, 7, 8, 15, 16]), Candidate: [ 3  1  1 -1  1  2  1  0  0  1  0  1  1  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  1 -1  0  0  0  0  0  1 -1  1 -1  0] (Indices: [1, 2, 3, 6, 7, 9, 16, 18]), Candidate: [ 3  1  1 -1  1  2  1 -1  2  0  0  1  1  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  0  0  1 -1  1 -1  0  1 -1  0  0  0] (Indices: [1, 2, 3, 6, 7, 11, 13, 16]), Candidate: [ 3  1  1 -1  1  2  1 -1  1  1  1  0  2  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  0  0  0  0  1 -1  0  1 -1  1 -1  0] (Indices: [1, 2, 3, 6, 7, 13, 16, 18]), Candidate: [ 3  1  1 -1  1  2  1 -1  1  1  0  1  2  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 53000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1  0 -1  0  0  1 -1  1 -1  0  0  0  0] (Indices: [1, 2, 3, 6, 8, 9, 13, 15]), Candidate: [ 3  1  1 -1  1  2  0  1  1  0  0  1  2  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1 -1  1 -1  0  0  0  0  1  0 -1  0  0] (Indices: [1, 2, 3, 6, 8, 10, 16, 17]), Candidate: [ 3  1  1 -1  1  2  0  1  0  2 -1  1  1  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 53100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1 -1  0  0  1 -1  0  0  1 -1  1 -1  0] (Indices: [1, 2, 3, 6, 8, 12, 16, 18]), Candidate: [ 3  1  1 -1  1  2  0  1  0  1  0  2  0  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  1  0 -1  1 -1  0  1 -1  0  0  0  0] (Indices: [1, 2, 3, 6, 9, 10, 12, 15]), Candidate: [ 3  1  1 -1  1  2  0  0  2  1 -1  2  0  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 53200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  1 -1  1 -1  0  0  0  1 -1  0  1 -1] (Indices: [1, 2, 3, 6, 9, 11, 16, 19]), Candidate: [ 3  1  1 -1  1  2  0  0  2  0  1  0  1  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  1 -1  0  0  0  0  1  0  0 -1  0  0] (Indices: [1, 2, 3, 6, 9, 15, 16, 17]), Candidate: [ 3  1  1 -1  1  2  0  0  2  0  0  1  1  1  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  0  1 -1  1 -1  0  1 -1  1 -1  0  0] (Indices: [1, 2, 3, 6, 10, 12, 15, 17]), Candidate: [ 3  1  1 -1  1  2  0  0  1  2 -1  2  0  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 53350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  0  0  1  0 -1  1  0 -1  0  0  0  0] (Indices: [1, 2, 3, 6, 11, 12, 14, 15]), Candidate: [ 3  1  1 -1  1  2  0  0  1  1  1  1  0  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  0  0  0  1  0  0  0 -1  0  0  0  0] (Indices: [1, 2, 3, 6, 12, 13, 14, 15]), Candidate: [ 3  1  1 -1  1  2  0  0  1  1  0  2  1  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  0  0  0  0  1 -1  1 -1  0  1  0 -1] (Indices: [1, 2, 3, 6, 13, 15, 18, 19]), Candidate: [ 3  1  1 -1  1  2  0  0  1  1  0  1  2  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0  0 -1  0  0  0  1  0 -1  0  0  0  0] (Indices: [1, 2, 3, 7, 8, 9, 14, 15]), Candidate: [ 3  1  1 -1  1  1  2  0  1  0  0  1  1  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0 -1  1 -1  0  0  0  0  0  0  1  0 -1] (Indices: [1, 2, 3, 7, 8, 10, 18, 19]), Candidate: [ 3  1  1 -1  1  1  2  0  0  2 -1  1  1  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 53600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0 -1  0  0  0  1  0  0 -1  0  0  0  0] (Indices: [1, 2, 3, 7, 8, 13, 14, 15]), Candidate: [ 3  1  1 -1  1  1  2  0  0  1  0  1  2  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  1  0 -1  0  1  0 -1  0  0  0  0  0] (Indices: [1, 2, 3, 7, 9, 10, 13, 14]), Candidate: [ 3  1  1 -1  1  1  2 -1  2  1 -1  1  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 53700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  1 -1  0  1  0 -1  1 -1  0  0  0  0] (Indices: [1, 2, 3, 7, 9, 12, 13, 15]), Candidate: [ 3  1  1 -1  1  1  2 -1  2  0  0  2  1  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 53750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  1 -1  0  0  0  0  1 -1  0  1  0 -1] (Indices: [1, 2, 3, 7, 9, 15, 18, 19]), Candidate: [ 3  1  1 -1  1  1  2 -1  2  0  0  1  1  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 53800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  0  1 -1  1 -1  0  0  1 -1  0  1 -1] (Indices: [1, 2, 3, 7, 10, 12, 16, 19]), Candidate: [ 3  1  1 -1  1  1  2 -1  1  2 -1  2  0  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 53850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  0  0  1  0 -1  0  1  0 -1  0  0  0] (Indices: [1, 2, 3, 7, 11, 12, 15, 16]), Candidate: [ 3  1  1 -1  1  1  2 -1  1  1  1  1  0  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 53900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  0  0  0  1  0 -1  1  0 -1  0  0  0] (Indices: [1, 2, 3, 7, 12, 13, 15, 16]), Candidate: [ 3  1  1 -1  1  1  2 -1  1  1  0  2  1  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 53950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  0  0  0  0  0  1  0  0  0 -1  0  0] (Indices: [1, 2, 3, 7, 14, 15, 16, 17]), Candidate: [ 3  1  1 -1  1  1  2 -1  1  1  0  1  1  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 54000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1  0  0 -1  0  0  0  0  0  0  1  0 -1] (Indices: [1, 2, 3, 8, 9, 10, 18, 19]), Candidate: [ 3  1  1 -1  1  1  1  1  1  1 -1  1  1  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 54050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1  0 -1  0  0  1  0  0 -1  0  0  0  0] (Indices: [1, 2, 3, 8, 9, 13, 14, 15]), Candidate: [ 3  1  1 -1  1  1  1  1  1  0  0  1  2  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1 -1  1  0 -1  0  1 -1  0  1 -1  0  0] (Indices: [1, 2, 3, 8, 10, 11, 14, 17]), Candidate: [ 3  1  1 -1  1  1  1  1  0  2  0  0  1  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 54150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1 -1  1 -1  0  0  1  0 -1  1 -1  0  0] (Indices: [1, 2, 3, 8, 10, 14, 15, 17]), Candidate: [ 3  1  1 -1  1  1  1  1  0  2 -1  1  1  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 54200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1 -1  0  1 -1  1 -1  0  1 -1  1 -1  0] (Indices: [1, 2, 3, 8, 11, 13, 16, 18]), Candidate: [ 3  1  1 -1  1  1  1  1  0  1  1  0  2  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1 -1  0  0  1 -1  0  1  0  0 -1  0  0] (Indices: [1, 2, 3, 8, 12, 15, 16, 17]), Candidate: [ 3  1  1 -1  1  1  1  1  0  1  0  2  0  1  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  1  0  0  0 -1  0  0  0  0  1 -1  0] (Indices: [1, 2, 3, 9, 10, 11, 12, 18]), Candidate: [ 3  1  1 -1  1  1  1  0  2  1  0  1  0  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  1  0 -1  0  1 -1  1 -1  1 -1  0  0] (Indices: [1, 2, 3, 9, 10, 13, 15, 17]), Candidate: [ 3  1  1 -1  1  1  1  0  2  1 -1  1  2  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 54400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  1 -1  1 -1  1  0  0 -1  0  0  0  0] (Indices: [1, 2, 3, 9, 11, 13, 14, 15]), Candidate: [ 3  1  1 -1  1  1  1  0  2  0  1  0  2  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  1 -1  0  1 -1  1  0  0 -1  0  0  0] (Indices: [1, 2, 3, 9, 12, 14, 15, 16]), Candidate: [ 3  1  1 -1  1  1  1  0  2  0  0  2  0  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  1 -1  0  0  0  0  1  0  0  0 -1  0] (Indices: [1, 2, 3, 9, 15, 16, 17, 18]), Candidate: [ 3  1  1 -1  1  1  1  0  2  0  0  1  1  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  0  1  0 -1  0  1 -1  0  0  1  0 -1] (Indices: [1, 2, 3, 10, 11, 14, 18, 19]), Candidate: [ 3  1  1 -1  1  1  1  0  1  2  0  0  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 54600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  0  1 -1  0  1  0 -1  1  0 -1  0  0] (Indices: [1, 2, 3, 10, 13, 14, 16, 17]), Candidate: [ 3  1  1 -1  1  1  1  0  1  2 -1  1  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 54650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  0  0  1  0 -1  1 -1  1  0 -1  0  0] (Indices: [1, 2, 3, 11, 12, 14, 16, 17]), Candidate: [ 3  1  1 -1  1  1  1  0  1  1  1  1  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 54700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  0  0  1 -1  0  0  0  1  0  0  0 -1] (Indices: [1, 2, 3, 11, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  1  1  0  1  1  1  0  1  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  0  0  0  0  1 -1  0  1  0  0  0 -1] (Indices: [1, 2, 3, 13, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  1  1  0  1  1  0  1  2  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  0  0  0  1 -1  0  0  0  0  1 -1  0] (Indices: [1, 2, 4, 5, 6, 7, 12, 18]), Candidate: [ 3  1  0  1  1  1  1 -1  1  1  0  2  0  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1 -1  0  0  1  0 -1  0  0  0  0  0  0] (Indices: [1, 2, 4, 5, 6, 8, 12, 13]), Candidate: [3 1 0 1 1 1 0 1 0 1 0 2 1 0 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 54900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  1 -1  0  1 -1  0  0  0  0  1 -1  0] (Indices: [1, 2, 4, 5, 6, 9, 12, 18]), Candidate: [3 1 0 1 1 1 0 0 2 0 0 2 0 1 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 54950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  0  1 -1  0  0  0  1 -1  1 -1  0  0] (Indices: [1, 2, 4, 5, 6, 10, 15, 17]), Candidate: [ 3  1  0  1  1  1  0  0  1  2 -1  1  1  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  0  0  0  1 -1  0  1 -1  0  1 -1  0] (Indices: [1, 2, 4, 5, 6, 12, 15, 18]), Candidate: [3 1 0 1 1 1 0 0 1 1 0 2 0 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 55050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0  0 -1  0  0  0  0  0  0  1 -1  0  0] (Indices: [1, 2, 4, 5, 7, 8, 9, 17]), Candidate: [3 1 0 1 1 0 2 0 1 0 0 1 1 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 55100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  1  0 -1  0  1 -1  0  0  0  0  0  0] (Indices: [1, 2, 4, 5, 7, 9, 10, 13]), Candidate: [ 3  1  0  1  1  0  2 -1  2  1 -1  1  2  0  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  0  1  0 -1  0  0  0  0  0  0  1 -1] (Indices: [1, 2, 4, 5, 7, 10, 11, 19]), Candidate: [ 3  1  0  1  1  0  2 -1  1  2  0  0  1  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  0  0  1 -1  0  0  1 -1  0  0  1 -1] (Indices: [1, 2, 4, 5, 7, 11, 15, 19]), Candidate: [ 3  1  0  1  1  0  2 -1  1  1  1  0  1  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  0  0  0  0  0  1 -1  0  1  0 -1  0] (Indices: [1, 2, 4, 5, 7, 14, 17, 18]), Candidate: [ 3  1  0  1  1  0  2 -1  1  1  0  1  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1  0 -1  0  0  0  0  1 -1  0  1 -1  0] (Indices: [1, 2, 4, 5, 8, 9, 15, 18]), Candidate: [3 1 0 1 1 0 1 1 1 0 0 1 1 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 55350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1 -1  0  1  0 -1  0  0  0  0  0  1 -1] (Indices: [1, 2, 4, 5, 8, 11, 12, 19]), Candidate: [3 1 0 1 1 0 1 1 0 1 1 1 0 1 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 55400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1 -1  0  0  0  1 -1  1 -1  0  1 -1  0] (Indices: [1, 2, 4, 5, 8, 13, 15, 18]), Candidate: [3 1 0 1 1 0 1 1 0 1 0 1 2 0 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 55450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  1  0 -1  0  0  1 -1  1 -1  0  0  0] (Indices: [1, 2, 4, 5, 9, 10, 14, 16]), Candidate: [ 3  1  0  1  1  0  1  0  2  1 -1  1  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  1 -1  0  1 -1  1 -1  0  1 -1  0  0] (Indices: [1, 2, 4, 5, 9, 12, 14, 17]), Candidate: [ 3  1  0  1  1  0  1  0  2  0  0  2  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  0  1  0  0 -1  0  1 -1  0  0  0  0] (Indices: [1, 2, 4, 5, 10, 11, 12, 15]), Candidate: [3 1 0 1 1 0 1 0 1 2 0 1 0 1 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 55600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  0  1 -1  0  1  0 -1  0  0  1 -1  0] (Indices: [1, 2, 4, 5, 10, 13, 14, 18]), Candidate: [ 3  1  0  1  1  0  1  0  1  2 -1  1  2  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  0  0  1  0 -1  0  0  0  1  0 -1  0] (Indices: [1, 2, 4, 5, 11, 12, 17, 18]), Candidate: [3 1 0 1 1 0 1 0 1 1 1 1 0 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 55700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  0  0  0  1  0 -1  0  0  1  0 -1  0] (Indices: [1, 2, 4, 5, 12, 13, 17, 18]), Candidate: [3 1 0 1 1 0 1 0 1 1 0 2 1 0 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 55750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  0  0  0  0  0  1 -1  1  0 -1  1 -1] (Indices: [1, 2, 4, 5, 14, 16, 17, 19]), Candidate: [ 3  1  0  1  1  0  1  0  1  1  0  1  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0 -1  0  0  0  0  1 -1  0  1 -1  0  0] (Indices: [1, 2, 4, 6, 7, 8, 14, 17]), Candidate: [ 3  1  0  1  0  2  1  0  0  1  0  1  1  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  1 -1  0  0  0  0  1 -1  0  1 -1  0] (Indices: [1, 2, 4, 6, 7, 9, 15, 18]), Candidate: [ 3  1  0  1  0  2  1 -1  2  0  0  1  1  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  0  0  1  0 -1  0  0  0  0  0  1 -1] (Indices: [1, 2, 4, 6, 7, 11, 12, 19]), Candidate: [ 3  1  0  1  0  2  1 -1  1  1  1  1  0  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  0  0  0  0  1 -1  1 -1  0  1 -1  0] (Indices: [1, 2, 4, 6, 7, 13, 15, 18]), Candidate: [ 3  1  0  1  0  2  1 -1  1  1  0  1  2  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1  0 -1  0  1 -1  0  0  0  0  1 -1  0] (Indices: [1, 2, 4, 6, 8, 9, 12, 18]), Candidate: [3 1 0 1 0 2 0 1 1 0 0 2 0 1 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 56050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1 -1  1 -1  0  0  0  1 -1  1 -1  0  0] (Indices: [1, 2, 4, 6, 8, 10, 15, 17]), Candidate: [ 3  1  0  1  0  2  0  1  0  2 -1  1  1  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1 -1  0  0  1 -1  0  1 -1  0  1 -1  0] (Indices: [1, 2, 4, 6, 8, 12, 15, 18]), Candidate: [3 1 0 1 0 2 0 1 0 1 0 2 0 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 56150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  1  0  0 -1  0  0  0  0  0  0  1 -1] (Indices: [1, 2, 4, 6, 9, 10, 11, 19]), Candidate: [3 1 0 1 0 2 0 0 2 1 0 0 1 1 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 56200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  1 -1  1 -1  0  0  1 -1  0  0  1 -1] (Indices: [1, 2, 4, 6, 9, 11, 15, 19]), Candidate: [3 1 0 1 0 2 0 0 2 0 1 0 1 1 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 56250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  1 -1  0  0  0  1 -1  0  1  0 -1  0] (Indices: [1, 2, 4, 6, 9, 14, 17, 18]), Candidate: [ 3  1  0  1  0  2  0  0  2  0  0  1  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  0  1 -1  1 -1  1 -1  0  0  1 -1  0] (Indices: [1, 2, 4, 6, 10, 12, 14, 18]), Candidate: [ 3  1  0  1  0  2  0  0  1  2 -1  2  0  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  0  0  1  0  0 -1  0  0  1 -1  0  0] (Indices: [1, 2, 4, 6, 11, 12, 13, 17]), Candidate: [3 1 0 1 0 2 0 0 1 1 1 1 1 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 56400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  0  0  1 -1  0  0  0  1  0 -1  1 -1] (Indices: [1, 2, 4, 6, 11, 16, 17, 19]), Candidate: [3 1 0 1 0 2 0 0 1 1 1 0 1 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 56450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  0  0  0  0  1 -1  1  0 -1  0  1 -1] (Indices: [1, 2, 4, 6, 13, 15, 16, 19]), Candidate: [3 1 0 1 0 2 0 0 1 1 0 1 2 0 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 56500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0  0 -1  0  0  1 -1  0  0  1 -1  0  0] (Indices: [1, 2, 4, 7, 8, 9, 13, 17]), Candidate: [3 1 0 1 0 1 2 0 1 0 0 1 2 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 56550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0 -1  1 -1  0  0  0  0  1 -1  0  1 -1] (Indices: [1, 2, 4, 7, 8, 10, 16, 19]), Candidate: [ 3  1  0  1  0  1  2  0  0  2 -1  1  1  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0 -1  0  0  1 -1  0  0  0  1  0 -1  0] (Indices: [1, 2, 4, 7, 8, 12, 17, 18]), Candidate: [3 1 0 1 0 1 2 0 0 1 0 2 0 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 56650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  1  0 -1  1 -1  0  0  0  1 -1  0  0] (Indices: [1, 2, 4, 7, 9, 10, 12, 17]), Candidate: [ 3  1  0  1  0  1  2 -1  2  1 -1  2  0  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  1 -1  1 -1  0  0  0  0  1 -1  1 -1] (Indices: [1, 2, 4, 7, 9, 11, 17, 19]), Candidate: [ 3  1  0  1  0  1  2 -1  2  0  1  0  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  1 -1  0  0  0  0  1  0 -1  0  1 -1] (Indices: [1, 2, 4, 7, 9, 15, 16, 19]), Candidate: [ 3  1  0  1  0  1  2 -1  2  0  0  1  1  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  0  1 -1  1 -1  0  1 -1  0  0  1 -1] (Indices: [1, 2, 4, 7, 10, 12, 15, 19]), Candidate: [ 3  1  0  1  0  1  2 -1  1  2 -1  2  0  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  0  0  1  0 -1  1 -1  0  1 -1  0  0] (Indices: [1, 2, 4, 7, 11, 12, 14, 17]), Candidate: [ 3  1  0  1  0  1  2 -1  1  1  1  1  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  0  0  0  1  0  0 -1  0  1 -1  0  0] (Indices: [1, 2, 4, 7, 12, 13, 14, 17]), Candidate: [ 3  1  0  1  0  1  2 -1  1  1  0  2  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  0  0  0  0  1 -1  0  1  0 -1  1 -1] (Indices: [1, 2, 4, 7, 13, 16, 17, 19]), Candidate: [ 3  1  0  1  0  1  2 -1  1  1  0  1  2  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1  0  0 -1  0  0  0  0  1 -1  0  1 -1] (Indices: [1, 2, 4, 8, 9, 10, 16, 19]), Candidate: [ 3  1  0  1  0  1  1  1  1  1 -1  1  1  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1  0 -1  0  1 -1  0  0  0  1  0 -1  0] (Indices: [1, 2, 4, 8, 9, 12, 17, 18]), Candidate: [3 1 0 1 0 1 1 1 1 0 0 2 0 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 57100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1 -1  1  0 -1  1 -1  0  0  0  0  1 -1] (Indices: [1, 2, 4, 8, 10, 11, 13, 19]), Candidate: [3 1 0 1 0 1 1 1 0 2 0 0 2 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 57150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1 -1  1 -1  0  1 -1  0  0  1 -1  1 -1] (Indices: [1, 2, 4, 8, 10, 13, 17, 19]), Candidate: [ 3  1  0  1  0  1  1  1  0  2 -1  1  2  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1 -1  0  1 -1  1 -1  1 -1  0  1 -1  0] (Indices: [1, 2, 4, 8, 11, 13, 15, 18]), Candidate: [3 1 0 1 0 1 1 1 0 1 1 0 2 0 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 57250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1 -1  0  0  1 -1  1 -1  0  1  0 -1  0] (Indices: [1, 2, 4, 8, 12, 14, 17, 18]), Candidate: [ 3  1  0  1  0  1  1  1  0  1  0  2  0  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  1  0  0  0 -1  0  1 -1  0  0  0  0] (Indices: [1, 2, 4, 9, 10, 11, 12, 15]), Candidate: [3 1 0 1 0 1 1 0 2 1 0 1 0 1 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 57350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  1  0 -1  0  1  0 -1  0  0  1 -1  0] (Indices: [1, 2, 4, 9, 10, 13, 14, 18]), Candidate: [ 3  1  0  1  0  1  1  0  2  1 -1  1  2  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  1 -1  1  0 -1  0  0  0  1  0 -1  0] (Indices: [1, 2, 4, 9, 11, 12, 17, 18]), Candidate: [3 1 0 1 0 1 1 0 2 0 1 1 0 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 57450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  1 -1  0  1  0 -1  0  0  1  0 -1  0] (Indices: [1, 2, 4, 9, 12, 13, 17, 18]), Candidate: [3 1 0 1 0 1 1 0 2 0 0 2 1 0 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 57500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  1 -1  0  0  0  1 -1  1  0 -1  1 -1] (Indices: [1, 2, 4, 9, 14, 16, 17, 19]), Candidate: [ 3  1  0  1  0  1  1  0  2  0  0  1  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  0  1  0 -1  0  1 -1  1 -1  0  1 -1] (Indices: [1, 2, 4, 10, 11, 14, 16, 19]), Candidate: [ 3  1  0  1  0  1  1  0  1  2  0  0  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  0  1 -1  0  1  0  0 -1  1 -1  0  0] (Indices: [1, 2, 4, 10, 13, 14, 15, 17]), Candidate: [ 3  1  0  1  0  1  1  0  1  2 -1  1  2  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  0  0  1  0 -1  1  0 -1  1 -1  0  0] (Indices: [1, 2, 4, 11, 12, 14, 15, 17]), Candidate: [3 1 0 1 0 1 1 0 1 1 1 1 0 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 57700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  0  0  1 -1  0  0  1  0  0 -1  1 -1] (Indices: [1, 2, 4, 11, 15, 16, 17, 19]), Candidate: [3 1 0 1 0 1 1 0 1 1 1 0 1 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 57750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  0  0  0  0  1 -1  1  0  0 -1  1 -1] (Indices: [1, 2, 4, 13, 15, 16, 17, 19]), Candidate: [3 1 0 1 0 1 1 0 1 1 0 1 2 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 57800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0 -1  0  0  0  0  1  0 -1  0  0  0  0] (Indices: [1, 2, 5, 6, 7, 8, 14, 15]), Candidate: [3 1 0 0 2 1 1 0 0 1 0 1 1 2 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 57850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  1 -1  0  0  0  0  1  0 -1  0  0  0] (Indices: [1, 2, 5, 6, 7, 9, 15, 16]), Candidate: [ 3  1  0  0  2  1  1 -1  2  0  0  1  1  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  0  0  1  0 -1  0  0  0  1 -1  0  0] (Indices: [1, 2, 5, 6, 7, 11, 12, 17]), Candidate: [ 3  1  0  0  2  1  1 -1  1  1  1  1  0  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  0  0  0  0  1 -1  1  0 -1  0  0  0] (Indices: [1, 2, 5, 6, 7, 13, 15, 16]), Candidate: [ 3  1  0  0  2  1  1 -1  1  1  0  1  2  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1  0 -1  0  1 -1  0  0  1 -1  0  0  0] (Indices: [1, 2, 5, 6, 8, 9, 12, 16]), Candidate: [3 1 0 0 2 1 0 1 1 0 0 2 0 1 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 58050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1 -1  1 -1  0  0  1 -1  0  0  0  1 -1] (Indices: [1, 2, 5, 6, 8, 10, 14, 19]), Candidate: [ 3  1  0  0  2  1  0  1  0  2 -1  1  1  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1 -1  0  0  1 -1  0  1  0 -1  0  0  0] (Indices: [1, 2, 5, 6, 8, 12, 15, 16]), Candidate: [3 1 0 0 2 1 0 1 0 1 0 2 0 1 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 58150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  1  0  0 -1  0  0  0  0  1 -1  0  0] (Indices: [1, 2, 5, 6, 9, 10, 11, 17]), Candidate: [3 1 0 0 2 1 0 0 2 1 0 0 1 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 58200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  1 -1  1 -1  0  0  1 -1  1 -1  0  0] (Indices: [1, 2, 5, 6, 9, 11, 15, 17]), Candidate: [3 1 0 0 2 1 0 0 2 0 1 0 1 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 58250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  1 -1  0  0  0  1 -1  1 -1  1 -1  0] (Indices: [1, 2, 5, 6, 9, 14, 16, 18]), Candidate: [ 3  1  0  0  2  1  0  0  2  0  0  1  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  0  1 -1  1 -1  1 -1  1 -1  0  0  0] (Indices: [1, 2, 5, 6, 10, 12, 14, 16]), Candidate: [ 3  1  0  0  2  1  0  0  1  2 -1  2  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  0  0  1  0  0 -1  1 -1  0  0  0  0] (Indices: [1, 2, 5, 6, 11, 12, 13, 15]), Candidate: [3 1 0 0 2 1 0 0 1 1 1 1 1 0 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 58400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  0  0  1 -1  0  0  1 -1  0  1  0 -1] (Indices: [1, 2, 5, 6, 11, 15, 18, 19]), Candidate: [3 1 0 0 2 1 0 0 1 1 1 0 1 1 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 58450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  0  0  0  0  1 -1  1  0  0 -1  0  0] (Indices: [1, 2, 5, 6, 13, 15, 16, 17]), Candidate: [3 1 0 0 2 1 0 0 1 1 0 1 2 0 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 58500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0  0 -1  0  0  1 -1  1 -1  0  0  0  0] (Indices: [1, 2, 5, 7, 8, 9, 13, 15]), Candidate: [3 1 0 0 2 0 2 0 1 0 0 1 2 0 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 58550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0 -1  1 -1  0  0  0  0  1  0 -1  0  0] (Indices: [1, 2, 5, 7, 8, 10, 16, 17]), Candidate: [ 3  1  0  0  2  0  2  0  0  2 -1  1  1  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0 -1  0  0  1 -1  0  0  1 -1  1 -1  0] (Indices: [1, 2, 5, 7, 8, 12, 16, 18]), Candidate: [3 1 0 0 2 0 2 0 0 1 0 2 0 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 58650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  1  0 -1  1 -1  0  1 -1  0  0  0  0] (Indices: [1, 2, 5, 7, 9, 10, 12, 15]), Candidate: [ 3  1  0  0  2  0  2 -1  2  1 -1  2  0  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  1 -1  1 -1  0  0  0  1 -1  0  1 -1] (Indices: [1, 2, 5, 7, 9, 11, 16, 19]), Candidate: [ 3  1  0  0  2  0  2 -1  2  0  1  0  1  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  1 -1  0  0  0  0  1  0  0 -1  0  0] (Indices: [1, 2, 5, 7, 9, 15, 16, 17]), Candidate: [ 3  1  0  0  2  0  2 -1  2  0  0  1  1  1  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  0  1 -1  1 -1  0  1 -1  1 -1  0  0] (Indices: [1, 2, 5, 7, 10, 12, 15, 17]), Candidate: [ 3  1  0  0  2  0  2 -1  1  2 -1  2  0  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  0  0  1  0 -1  1  0 -1  0  0  0  0] (Indices: [1, 2, 5, 7, 11, 12, 14, 15]), Candidate: [ 3  1  0  0  2  0  2 -1  1  1  1  1  0  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  0  0  0  1  0  0  0 -1  0  0  0  0] (Indices: [1, 2, 5, 7, 12, 13, 14, 15]), Candidate: [ 3  1  0  0  2  0  2 -1  1  1  0  2  1  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  0  0  0  0  1 -1  1 -1  0  1  0 -1] (Indices: [1, 2, 5, 7, 13, 15, 18, 19]), Candidate: [ 3  1  0  0  2  0  2 -1  1  1  0  1  2  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1  0  0 -1  0  0  0  0  1  0 -1  0  0] (Indices: [1, 2, 5, 8, 9, 10, 16, 17]), Candidate: [ 3  1  0  0  2  0  1  1  1  1 -1  1  1  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1  0 -1  0  1 -1  0  0  1 -1  1 -1  0] (Indices: [1, 2, 5, 8, 9, 12, 16, 18]), Candidate: [3 1 0 0 2 0 1 1 1 0 0 2 0 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 59100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1 -1  1  0 -1  1 -1  0  0  1 -1  0  0] (Indices: [1, 2, 5, 8, 10, 11, 13, 17]), Candidate: [3 1 0 0 2 0 1 1 0 2 0 0 2 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 59150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1 -1  1 -1  0  1 -1  0  1 -1  0  1 -1] (Indices: [1, 2, 5, 8, 10, 13, 16, 19]), Candidate: [ 3  1  0  0  2  0  1  1  0  2 -1  1  2  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1 -1  0  1 -1  1 -1  1  0 -1  0  0  0] (Indices: [1, 2, 5, 8, 11, 13, 15, 16]), Candidate: [3 1 0 0 2 0 1 1 0 1 1 0 2 0 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 59250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1 -1  0  0  1 -1  1 -1  1 -1  1 -1  0] (Indices: [1, 2, 5, 8, 12, 14, 16, 18]), Candidate: [ 3  1  0  0  2  0  1  1  0  1  0  2  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  1  0  0  0  0 -1  0  0  0  0  0  0] (Indices: [1, 2, 5, 9, 10, 11, 12, 13]), Candidate: [3 1 0 0 2 0 1 0 2 1 0 1 1 0 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 59350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  1  0 -1  0  1  0 -1  1 -1  0  0  0] (Indices: [1, 2, 5, 9, 10, 13, 14, 16]), Candidate: [ 3  1  0  0  2  0  1  0  2  1 -1  1  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 59400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  1 -1  1  0 -1  0  0  1 -1  1 -1  0] (Indices: [1, 2, 5, 9, 11, 12, 16, 18]), Candidate: [3 1 0 0 2 0 1 0 2 0 1 1 0 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 59450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  1 -1  0  1  0 -1  0  1 -1  1 -1  0] (Indices: [1, 2, 5, 9, 12, 13, 16, 18]), Candidate: [3 1 0 0 2 0 1 0 2 0 0 2 1 0 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 59500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  1 -1  0  0  0  1  0 -1  0  1  0 -1] (Indices: [1, 2, 5, 9, 14, 15, 18, 19]), Candidate: [3 1 0 0 2 0 1 0 2 0 0 1 1 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 59550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  0  1  0 -1  0  1 -1  1  0 -1  0  0] (Indices: [1, 2, 5, 10, 11, 14, 16, 17]), Candidate: [ 3  1  0  0  2  0  1  0  1  2  0  0  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  0  1 -1  1 -1  0  0  0  1  0  0 -1] (Indices: [1, 2, 5, 10, 12, 17, 18, 19]), Candidate: [ 3  1  0  0  2  0  1  0  1  2 -1  2  0  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  0  0  1  0  0 -1  0  0  0  1  0 -1] (Indices: [1, 2, 5, 11, 12, 13, 18, 19]), Candidate: [3 1 0 0 2 0 1 0 1 1 1 1 1 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 59700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  0  0  1 -1  0  1 -1  0  1  0  0 -1] (Indices: [1, 2, 5, 11, 14, 17, 18, 19]), Candidate: [ 3  1  0  0  2  0  1  0  1  1  1  0  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  0  0  0  0  1  0 -1  0  1  0  0 -1] (Indices: [1, 2, 5, 13, 14, 17, 18, 19]), Candidate: [ 3  1  0  0  2  0  1  0  1  1  0  1  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0  0 -1  0  0  0  0  1 -1  0  0  1 -1] (Indices: [1, 2, 6, 7, 8, 9, 15, 19]), Candidate: [3 1 0 0 1 2 1 0 1 0 0 1 1 1 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 59850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0 -1  0  1 -1  1  0 -1  0  0  0  0  0] (Indices: [1, 2, 6, 7, 8, 11, 13, 14]), Candidate: [ 3  1  0  0  1  2  1  0  0  1  1  0  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0 -1  0  0  0  1 -1  1 -1  0  0  1 -1] (Indices: [1, 2, 6, 7, 8, 13, 15, 19]), Candidate: [3 1 0 0 1 2 1 0 0 1 0 1 2 0 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 59950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  1  0 -1  0  0  1 -1  0  1 -1  0  0] (Indices: [1, 2, 6, 7, 9, 10, 14, 17]), Candidate: [ 3  1  0  0  1  2  1 -1  2  1 -1  1  1  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 60000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  1 -1  0  1 -1  1 -1  0  0  1 -1  0] (Indices: [1, 2, 6, 7, 9, 12, 14, 18]), Candidate: [ 3  1  0  0  1  2  1 -1  2  0  0  2  0  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 60050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  0  1  0  0 -1  0  0  1 -1  0  0  0] (Indices: [1, 2, 6, 7, 10, 11, 12, 16]), Candidate: [ 3  1  0  0  1  2  1 -1  1  2  0  1  0  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  0  1 -1  0  1  0 -1  0  0  0  1 -1] (Indices: [1, 2, 6, 7, 10, 13, 14, 19]), Candidate: [ 3  1  0  0  1  2  1 -1  1  2 -1  1  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 60150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  0  0  1  0 -1  0  0  0  1 -1  1 -1] (Indices: [1, 2, 6, 7, 11, 12, 17, 19]), Candidate: [ 3  1  0  0  1  2  1 -1  1  1  1  1  0  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  0  0  0  1  0 -1  0  0  1 -1  1 -1] (Indices: [1, 2, 6, 7, 12, 13, 17, 19]), Candidate: [ 3  1  0  0  1  2  1 -1  1  1  0  2  1  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  0  0  0  0  0  1 -1  1 -1  1  0 -1] (Indices: [1, 2, 6, 7, 14, 16, 18, 19]), Candidate: [ 3  1  0  0  1  2  1 -1  1  1  0  1  1  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 60300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1  0 -1  1 -1  1  0 -1  0  0  0  0  0] (Indices: [1, 2, 6, 8, 9, 11, 13, 14]), Candidate: [ 3  1  0  0  1  2  0  1  1  0  1  0  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1  0 -1  0  0  1 -1  1 -1  0  0  1 -1] (Indices: [1, 2, 6, 8, 9, 13, 15, 19]), Candidate: [3 1 0 0 1 2 0 1 1 0 0 1 2 0 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 60400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1 -1  1  0 -1  0  0  0  1 -1  1 -1  0] (Indices: [1, 2, 6, 8, 10, 11, 16, 18]), Candidate: [3 1 0 0 1 2 0 1 0 2 0 0 1 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 60450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1 -1  1 -1  0  0  1 -1  0  0  1  0 -1] (Indices: [1, 2, 6, 8, 10, 14, 18, 19]), Candidate: [ 3  1  0  0  1  2  0  1  0  2 -1  1  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 60500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1 -1  0  1 -1  0  1  0 -1  0  0  1 -1] (Indices: [1, 2, 6, 8, 11, 14, 15, 19]), Candidate: [3 1 0 0 1 2 0 1 0 1 1 0 1 2 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 60550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1 -1  0  0  1 -1  0  0  1 -1  1  0 -1] (Indices: [1, 2, 6, 8, 12, 16, 18, 19]), Candidate: [3 1 0 0 1 2 0 1 0 1 0 2 0 1 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 60600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  1  0  0 -1  0  1  0 -1  0  0  0  0] (Indices: [1, 2, 6, 9, 10, 11, 14, 15]), Candidate: [3 1 0 0 1 2 0 0 2 1 0 0 1 2 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 60650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  1  0 -1  0  1 -1  0  0  0  1  0 -1] (Indices: [1, 2, 6, 9, 10, 13, 18, 19]), Candidate: [ 3  1  0  0  1  2  0  0  2  1 -1  1  2  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  1 -1  1 -1  1 -1  1 -1  0  0  1 -1] (Indices: [1, 2, 6, 9, 11, 13, 15, 19]), Candidate: [3 1 0 0 1 2 0 0 2 0 1 0 2 0 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 60750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  1 -1  0  1 -1  1 -1  0  1 -1  1 -1] (Indices: [1, 2, 6, 9, 12, 14, 17, 19]), Candidate: [ 3  1  0  0  1  2  0  0  2  0  0  2  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  0  1  0  0  0 -1  0  0  1 -1  0  0] (Indices: [1, 2, 6, 10, 11, 12, 13, 17]), Candidate: [3 1 0 0 1 2 0 0 1 2 0 1 1 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 60850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  0  1  0 -1  0  0  0  1  0 -1  1 -1] (Indices: [1, 2, 6, 10, 11, 16, 17, 19]), Candidate: [3 1 0 0 1 2 0 0 1 2 0 0 1 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 60900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  0  1 -1  0  1 -1  1  0 -1  0  1 -1] (Indices: [1, 2, 6, 10, 13, 15, 16, 19]), Candidate: [ 3  1  0  0  1  2  0  0  1  2 -1  1  2  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  0  0  1  0 -1  0  1  0 -1  0  1 -1] (Indices: [1, 2, 6, 11, 12, 15, 16, 19]), Candidate: [3 1 0 0 1 2 0 0 1 1 1 1 0 1 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 61000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  0  0  0  1  0  0 -1  0  1  0 -1  0] (Indices: [1, 2, 6, 12, 13, 14, 17, 18]), Candidate: [ 3  1  0  0  1  2  0  0  1  1  0  2  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0  0  0  0 -1  1 -1  0  0  0  0  0  0] (Indices: [1, 2, 7, 8, 9, 10, 11, 13]), Candidate: [3 1 0 0 1 1 2 0 1 1 0 0 2 0 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 61100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0  0 -1  1 -1  0  1 -1  0  1 -1  0  0] (Indices: [1, 2, 7, 8, 9, 11, 14, 17]), Candidate: [ 3  1  0  0  1  1  2  0  1  0  1  0  1  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0  0 -1  0  0  0  1  0 -1  1 -1  0  0] (Indices: [1, 2, 7, 8, 9, 14, 15, 17]), Candidate: [3 1 0 0 1 1 2 0 1 0 0 1 1 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 61200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0 -1  1 -1  1  0 -1  0  0  1 -1  0  0] (Indices: [1, 2, 7, 8, 10, 12, 13, 17]), Candidate: [ 3  1  0  0  1  1  2  0  0  2 -1  2  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0 -1  1 -1  0  0  0  0  1  0 -1  1 -1] (Indices: [1, 2, 7, 8, 10, 16, 17, 19]), Candidate: [ 3  1  0  0  1  1  2  0  0  2 -1  1  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0 -1  0  1 -1  0  0  1  0 -1  1 -1  0] (Indices: [1, 2, 7, 8, 11, 15, 16, 18]), Candidate: [3 1 0 0 1 1 2 0 0 1 1 0 1 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 61350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0 -1  0  0  0  1  0 -1  1 -1  0  1 -1] (Indices: [1, 2, 7, 8, 13, 14, 16, 19]), Candidate: [ 3  1  0  0  1  1  2  0  0  1  0  1  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  1  0  0 -1  0  0  1 -1  0  0  1 -1] (Indices: [1, 2, 7, 9, 10, 11, 15, 19]), Candidate: [ 3  1  0  0  1  1  2 -1  2  1  0  0  1  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  1  0 -1  0  0  1 -1  0  1  0 -1  0] (Indices: [1, 2, 7, 9, 10, 14, 17, 18]), Candidate: [ 3  1  0  0  1  1  2 -1  2  1 -1  1  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 61500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  1 -1  1 -1  0  1  0 -1  1 -1  0  0] (Indices: [1, 2, 7, 9, 11, 14, 15, 17]), Candidate: [ 3  1  0  0  1  1  2 -1  2  0  1  0  1  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  1 -1  0  1 -1  0  0  1  0  0 -1  0] (Indices: [1, 2, 7, 9, 12, 16, 17, 18]), Candidate: [ 3  1  0  0  1  1  2 -1  2  0  0  2  0  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  0  1  0  0 -1  0  1  0 -1  0  0  0] (Indices: [1, 2, 7, 10, 11, 12, 15, 16]), Candidate: [ 3  1  0  0  1  1  2 -1  1  2  0  1  0  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  0  1 -1  1  0 -1  1  0 -1  0  0  0] (Indices: [1, 2, 7, 10, 12, 13, 15, 16]), Candidate: [ 3  1  0  0  1  1  2 -1  1  2 -1  2  1  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 61700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  0  1 -1  0  0  1  0  0  0 -1  0  0] (Indices: [1, 2, 7, 10, 14, 15, 16, 17]), Candidate: [ 3  1  0  0  1  1  2 -1  1  2 -1  1  1  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 61750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  0  0  1 -1  1  0  0  0 -1  0  0  0] (Indices: [1, 2, 7, 11, 13, 14, 15, 16]), Candidate: [ 3  1  0  0  1  1  2 -1  1  1  1  0  2  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  0  0  0  1  0 -1  1 -1  0  1  0 -1] (Indices: [1, 2, 7, 12, 13, 15, 18, 19]), Candidate: [ 3  1  0  0  1  1  2 -1  1  1  0  2  1  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1  0  0  0 -1  1 -1  0  1 -1  0  0  0] (Indices: [1, 2, 8, 9, 10, 11, 13, 16]), Candidate: [3 1 0 0 1 1 1 1 1 1 0 0 2 0 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 61900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1  0  0 -1  0  1 -1  0  1 -1  1 -1  0] (Indices: [1, 2, 8, 9, 10, 13, 16, 18]), Candidate: [ 3  1  0  0  1  1  1  1  1  1 -1  1  2  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1  0 -1  1 -1  1  0 -1  0  0  0  1 -1] (Indices: [1, 2, 8, 9, 11, 13, 14, 19]), Candidate: [ 3  1  0  0  1  1  1  1  1  0  1  0  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1  0 -1  0  1 -1  1 -1  1  0 -1  0  0] (Indices: [1, 2, 8, 9, 12, 14, 16, 17]), Candidate: [ 3  1  0  0  1  1  1  1  1  0  0  2  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1  0 -1  0  0  0  0  0  1  0  0  0 -1] (Indices: [1, 2, 8, 9, 16, 17, 18, 19]), Candidate: [3 1 0 0 1 1 1 1 1 0 0 1 1 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 62100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1 -1  1  0 -1  0  0  1 -1  1  0 -1  0] (Indices: [1, 2, 8, 10, 11, 15, 17, 18]), Candidate: [3 1 0 0 1 1 1 1 0 2 0 0 1 1 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 62150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1 -1  1 -1  0  1  0 -1  0  1 -1  1 -1] (Indices: [1, 2, 8, 10, 13, 14, 17, 19]), Candidate: [ 3  1  0  0  1  1  1  1  0  2 -1  1  2  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 62200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1 -1  0  1  0 -1  1 -1  0  1 -1  1 -1] (Indices: [1, 2, 8, 11, 12, 14, 17, 19]), Candidate: [ 3  1  0  0  1  1  1  1  0  1  1  1  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1 -1  0  0  1  0  0  0 -1  0  0  1 -1] (Indices: [1, 2, 8, 12, 13, 14, 15, 19]), Candidate: [3 1 0 0 1 1 1 1 0 1 0 2 1 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 62300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1 -1  0  0  0  0  1  0 -1  1  0  0 -1] (Indices: [1, 2, 8, 14, 15, 17, 18, 19]), Candidate: [3 1 0 0 1 1 1 1 0 1 0 1 1 2 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 62350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  1  0  0 -1  0  0  1  0 -1  1 -1  0] (Indices: [1, 2, 9, 10, 11, 15, 16, 18]), Candidate: [3 1 0 0 1 1 1 0 2 1 0 0 1 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 62400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  1  0 -1  0  1  0 -1  1 -1  0  1 -1] (Indices: [1, 2, 9, 10, 13, 14, 16, 19]), Candidate: [ 3  1  0  0  1  1  1  0  2  1 -1  1  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 62450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  1 -1  1  0 -1  1 -1  1 -1  0  1 -1] (Indices: [1, 2, 9, 11, 12, 14, 16, 19]), Candidate: [ 3  1  0  0  1  1  1  0  2  0  1  1  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  1 -1  0  1  0  0  0 -1  1 -1  0  0] (Indices: [1, 2, 9, 12, 13, 14, 15, 17]), Candidate: [3 1 0 0 1 1 1 0 2 0 0 2 1 1 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 62550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  1 -1  0  0  0  1  0  0  0 -1  1 -1] (Indices: [1, 2, 9, 14, 15, 16, 17, 19]), Candidate: [3 1 0 0 1 1 1 0 2 0 0 1 1 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 62600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  0  1  0 -1  1 -1  1  0  0 -1  0  0] (Indices: [1, 2, 10, 11, 13, 15, 16, 17]), Candidate: [3 1 0 0 1 1 1 0 1 2 0 0 2 0 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 62650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  0  1 -1  1 -1  1  0 -1  0  1  0 -1] (Indices: [1, 2, 10, 12, 14, 15, 18, 19]), Candidate: [ 3  1  0  0  1  1  1  0  1  2 -1  2  0  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  0  0  1  0  0 -1  0  0  1  0  0 -1] (Indices: [1, 2, 11, 12, 13, 17, 18, 19]), Candidate: [3 1 0 0 1 1 1 0 1 1 1 1 1 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 62750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  0  0  0  1  0 -1  1 -1  1  0  0 -1] (Indices: [1, 2, 12, 13, 15, 17, 18, 19]), Candidate: [3 1 0 0 1 1 1 0 1 1 0 2 1 0 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 62800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  0  0  1 -1  0  0  0  0  1 -1  0  0] (Indices: [1, 3, 4, 5, 6, 7, 11, 17]), Candidate: [ 3  0  2  0  1  1  1 -1  1  1  1  0  1  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1 -1  0  1  0 -1  0  0  0  0  0  0  0] (Indices: [1, 3, 4, 5, 6, 8, 11, 12]), Candidate: [3 0 2 0 1 1 0 1 0 1 1 1 0 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 62900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  1 -1  1 -1  0  0  0  0  1 -1  0  0] (Indices: [1, 3, 4, 5, 6, 9, 11, 17]), Candidate: [3 0 2 0 1 1 0 0 2 0 1 0 1 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 62950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  0  1 -1  0  1 -1  0  0  0  1 -1  0] (Indices: [1, 3, 4, 5, 6, 10, 13, 18]), Candidate: [ 3  0  2  0  1  1  0  0  1  2 -1  1  2  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  0  0  0  1  0 -1  0  0  0  0  1 -1] (Indices: [1, 3, 4, 5, 6, 12, 13, 19]), Candidate: [3 0 2 0 1 1 0 0 1 1 0 2 1 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 63050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  0  0  0  0  0  0  0  0  1  0  0 -1] (Indices: [1, 3, 4, 5, 6, 17, 18, 19]), Candidate: [3 0 2 0 1 1 0 0 1 1 0 1 1 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 63100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0 -1  0  0  0  0  0  0  1  0 -1  0  0] (Indices: [1, 3, 4, 5, 7, 8, 16, 17]), Candidate: [3 0 2 0 1 0 2 0 0 1 0 1 1 1 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 63150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  1 -1  0  0  0  0  0  0  0  1  0 -1] (Indices: [1, 3, 4, 5, 7, 9, 18, 19]), Candidate: [ 3  0  2  0  1  0  2 -1  2  0  0  1  1  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  0  0  1 -1  0  1  0 -1  0  0  0  0] (Indices: [1, 3, 4, 5, 7, 11, 14, 15]), Candidate: [ 3  0  2  0  1  0  2 -1  1  1  1  0  1  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  0  0  0  0  1 -1  0  0  0  1  0 -1] (Indices: [1, 3, 4, 5, 7, 13, 18, 19]), Candidate: [ 3  0  2  0  1  0  2 -1  1  1  0  1  2  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1  0 -1  0  0  1 -1  0  0  0  0  1 -1] (Indices: [1, 3, 4, 5, 8, 9, 13, 19]), Candidate: [3 0 2 0 1 0 1 1 1 0 0 1 2 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 63350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1 -1  1 -1  0  0  0  0  0  1 -1  1 -1] (Indices: [1, 3, 4, 5, 8, 10, 17, 19]), Candidate: [ 3  0  2  0  1  0  1  1  0  2 -1  1  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1 -1  0  0  1 -1  0  0  0  0  1  0 -1] (Indices: [1, 3, 4, 5, 8, 12, 18, 19]), Candidate: [3 0 2 0 1 0 1 1 0 1 0 2 0 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 63450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  1  0 -1  1 -1  0  0  0  0  0  1 -1] (Indices: [1, 3, 4, 5, 9, 10, 12, 19]), Candidate: [ 3  0  2  0  1  0  1  0  2  1 -1  2  0  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  1 -1  0  1  0  0 -1  0  0  0  0  0] (Indices: [1, 3, 4, 5, 9, 12, 13, 14]), Candidate: [ 3  0  2  0  1  0  1  0  2  0  0  2  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  1 -1  0  0  0  0  1 -1  1 -1  1 -1] (Indices: [1, 3, 4, 5, 9, 15, 17, 19]), Candidate: [3 0 2 0 1 0 1 0 2 0 0 1 1 1 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 63600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  0  1 -1  1 -1  0  0  1 -1  1 -1  0] (Indices: [1, 3, 4, 5, 10, 12, 16, 18]), Candidate: [ 3  0  2  0  1  0  1  0  1  2 -1  2  0  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  0  0  1  0 -1  1 -1  0  0  0  1 -1] (Indices: [1, 3, 4, 5, 11, 12, 14, 19]), Candidate: [ 3  0  2  0  1  0  1  0  1  1  1  1  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  0  0  0  1  0  0 -1  0  0  0  1 -1] (Indices: [1, 3, 4, 5, 12, 13, 14, 19]), Candidate: [ 3  0  2  0  1  0  1  0  1  1  0  2  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  0  0  0  0  1 -1  0  0  1  0  0 -1] (Indices: [1, 3, 4, 5, 13, 17, 18, 19]), Candidate: [3 0 2 0 1 0 1 0 1 1 0 1 2 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 63800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0 -1  0  0  0  1  0 -1  0  0  0  0  0] (Indices: [1, 3, 4, 6, 7, 8, 13, 14]), Candidate: [ 3  0  2  0  0  2  1  0  0  1  0  1  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  1 -1  0  0  1 -1  0  0  0  0  1 -1] (Indices: [1, 3, 4, 6, 7, 9, 13, 19]), Candidate: [ 3  0  2  0  0  2  1 -1  2  0  0  1  2  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  0  1 -1  0  0  0  0  0  1 -1  1 -1] (Indices: [1, 3, 4, 6, 7, 10, 17, 19]), Candidate: [ 3  0  2  0  0  2  1 -1  1  2 -1  1  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 63950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  0  0  0  1 -1  0  0  0  0  1  0 -1] (Indices: [1, 3, 4, 6, 7, 12, 18, 19]), Candidate: [ 3  0  2  0  0  2  1 -1  1  1  0  2  0  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1  0 -1  1 -1  0  0  0  0  1 -1  0  0] (Indices: [1, 3, 4, 6, 8, 9, 11, 17]), Candidate: [3 0 2 0 0 2 0 1 1 0 1 0 1 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 64050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1 -1  1 -1  0  1 -1  0  0  0  1 -1  0] (Indices: [1, 3, 4, 6, 8, 10, 13, 18]), Candidate: [ 3  0  2  0  0  2  0  1  0  2 -1  1  2  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1 -1  0  0  1  0 -1  0  0  0  0  1 -1] (Indices: [1, 3, 4, 6, 8, 12, 13, 19]), Candidate: [3 0 2 0 0 2 0 1 0 1 0 2 1 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 64150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1 -1  0  0  0  0  0  0  0  1  0  0 -1] (Indices: [1, 3, 4, 6, 8, 17, 18, 19]), Candidate: [3 0 2 0 0 2 0 1 0 1 0 1 1 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 64200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  1 -1  1 -1  0  1  0 -1  0  0  0  0] (Indices: [1, 3, 4, 6, 9, 11, 14, 15]), Candidate: [3 0 2 0 0 2 0 0 2 0 1 0 1 2 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 64250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  1 -1  0  0  1 -1  0  0  0  1  0 -1] (Indices: [1, 3, 4, 6, 9, 13, 18, 19]), Candidate: [3 0 2 0 0 2 0 0 2 0 0 1 2 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 64300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  0  1 -1  1  0 -1  1 -1  0  0  0  0] (Indices: [1, 3, 4, 6, 10, 12, 13, 15]), Candidate: [ 3  0  2  0  0  2  0  0  1  2 -1  2  1  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  0  1 -1  0  0  0  1 -1  0  1  0 -1] (Indices: [1, 3, 4, 6, 10, 15, 18, 19]), Candidate: [ 3  0  2  0  0  2  0  0  1  2 -1  1  1  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  0  0  1 -1  0  1 -1  0  0  1  0 -1] (Indices: [1, 3, 4, 6, 11, 14, 18, 19]), Candidate: [ 3  0  2  0  0  2  0  0  1  1  1  0  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  0  0  0  0  1  0 -1  1  0 -1  0  0] (Indices: [1, 3, 4, 6, 13, 14, 16, 17]), Candidate: [ 3  0  2  0  0  2  0  0  1  1  0  1  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0  0 -1  0  1 -1  0  1 -1  0  0  0  0] (Indices: [1, 3, 4, 7, 8, 9, 12, 15]), Candidate: [3 0 2 0 0 1 2 0 1 0 0 2 0 1 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 64550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0 -1  1 -1  0  0  1 -1  0  0  1 -1  0] (Indices: [1, 3, 4, 7, 8, 10, 14, 18]), Candidate: [ 3  0  2  0  0  1  2  0  0  2 -1  1  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 64600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0 -1  0  0  1 -1  1 -1  0  0  0  1 -1] (Indices: [1, 3, 4, 7, 8, 12, 14, 19]), Candidate: [ 3  0  2  0  0  1  2  0  0  1  0  2  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  1  0  0 -1  0  0  0  1 -1  0  0  0] (Indices: [1, 3, 4, 7, 9, 10, 11, 16]), Candidate: [ 3  0  2  0  0  1  2 -1  2  1  0  0  1  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  1 -1  1 -1  0  0  1  0 -1  0  0  0] (Indices: [1, 3, 4, 7, 9, 11, 15, 16]), Candidate: [ 3  0  2  0  0  1  2 -1  2  0  1  0  1  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  1 -1  0  0  0  1 -1  1  0 -1  0  0] (Indices: [1, 3, 4, 7, 9, 14, 16, 17]), Candidate: [ 3  0  2  0  0  1  2 -1  2  0  0  1  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 64800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  0  1 -1  1 -1  1  0 -1  0  0  0  0] (Indices: [1, 3, 4, 7, 10, 12, 14, 15]), Candidate: [ 3  0  2  0  0  1  2 -1  1  2 -1  2  0  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 64850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  0  0  1  0  0  0 -1  0  0  0  0  0] (Indices: [1, 3, 4, 7, 11, 12, 13, 14]), Candidate: [ 3  0  2  0  0  1  2 -1  1  1  1  1  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 64900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  0  0  1 -1  0  0  1 -1  1 -1  1 -1] (Indices: [1, 3, 4, 7, 11, 15, 17, 19]), Candidate: [ 3  0  2  0  0  1  2 -1  1  1  1  0  1  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  0  0  0  0  1  0 -1  0  0  1  0 -1] (Indices: [1, 3, 4, 7, 13, 14, 18, 19]), Candidate: [ 3  0  2  0  0  1  2 -1  1  1  0  1  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 65000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1  0  0 -1  0  0  1 -1  0  0  1 -1  0] (Indices: [1, 3, 4, 8, 9, 10, 14, 18]), Candidate: [ 3  0  2  0  0  1  1  1  1  1 -1  1  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 65050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1  0 -1  0  1 -1  1 -1  0  0  0  1 -1] (Indices: [1, 3, 4, 8, 9, 12, 14, 19]), Candidate: [ 3  0  2  0  0  1  1  1  1  0  0  2  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1 -1  1  0  0 -1  0  0  0  1 -1  0  0] (Indices: [1, 3, 4, 8, 10, 11, 12, 17]), Candidate: [3 0 2 0 0 1 1 1 0 2 0 1 0 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 65150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1 -1  1 -1  0  1 -1  1  0 -1  0  0  0] (Indices: [1, 3, 4, 8, 10, 13, 15, 16]), Candidate: [ 3  0  2  0  0  1  1  1  0  2 -1  1  2  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1 -1  0  1  0 -1  0  0  0  0  1  0 -1] (Indices: [1, 3, 4, 8, 11, 12, 18, 19]), Candidate: [3 0 2 0 0 1 1 1 0 1 1 1 0 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 65250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1 -1  0  0  1  0 -1  0  0  0  1  0 -1] (Indices: [1, 3, 4, 8, 12, 13, 18, 19]), Candidate: [3 0 2 0 0 1 1 1 0 1 0 2 1 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 65300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1 -1  0  0  0  0  1 -1  0  1  0  0 -1] (Indices: [1, 3, 4, 8, 14, 17, 18, 19]), Candidate: [ 3  0  2  0  0  1  1  1  0  1  0  1  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  1  0 -1  1 -1  0  0  1 -1  1 -1  0] (Indices: [1, 3, 4, 9, 10, 12, 16, 18]), Candidate: [ 3  0  2  0  0  1  1  0  2  1 -1  2  0  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  1 -1  1  0 -1  1 -1  0  0  0  1 -1] (Indices: [1, 3, 4, 9, 11, 12, 14, 19]), Candidate: [ 3  0  2  0  0  1  1  0  2  0  1  1  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  1 -1  0  1  0  0 -1  0  0  0  1 -1] (Indices: [1, 3, 4, 9, 12, 13, 14, 19]), Candidate: [ 3  0  2  0  0  1  1  0  2  0  0  2  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  1 -1  0  0  1 -1  0  0  1  0  0 -1] (Indices: [1, 3, 4, 9, 13, 17, 18, 19]), Candidate: [3 0 2 0 0 1 1 0 2 0 0 1 2 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 65550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  0  1  0 -1  1 -1  0  0  1 -1  1 -1] (Indices: [1, 3, 4, 10, 11, 13, 17, 19]), Candidate: [3 0 2 0 0 1 1 0 1 2 0 0 2 0 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 65600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  0  1 -1  1 -1  0  1 -1  1  0 -1  0] (Indices: [1, 3, 4, 10, 12, 15, 17, 18]), Candidate: [ 3  0  2  0  0  1  1  0  1  2 -1  2  0  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  0  0  1  0  0 -1  1 -1  0  0  1 -1] (Indices: [1, 3, 4, 11, 12, 13, 15, 19]), Candidate: [3 0 2 0 0 1 1 0 1 1 1 1 1 0 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 65700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  0  0  1 -1  0  1  0 -1  1  0 -1  0] (Indices: [1, 3, 4, 11, 14, 15, 17, 18]), Candidate: [3 0 2 0 0 1 1 0 1 1 1 0 1 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 65750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  0  0  0  0  1  0  0 -1  1  0 -1  0] (Indices: [1, 3, 4, 13, 14, 15, 17, 18]), Candidate: [3 0 2 0 0 1 1 0 1 1 0 1 2 1 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 65800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0 -1  0  0  1 -1  0  0  0  0  1 -1  0] (Indices: [1, 3, 5, 6, 7, 8, 12, 18]), Candidate: [ 3  0  2 -1  2  1  1  0  0  1  0  2  0  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  1 -1  0  0  1 -1  0  0  1 -1  0  0] (Indices: [1, 3, 5, 6, 7, 9, 13, 17]), Candidate: [ 3  0  2 -1  2  1  1 -1  2  0  0  1  2  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 65900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  0  1 -1  0  0  0  0  1 -1  0  1 -1] (Indices: [1, 3, 5, 6, 7, 10, 16, 19]), Candidate: [ 3  0  2 -1  2  1  1 -1  1  2 -1  1  1  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 65950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  0  0  0  1 -1  0  0  0  1  0 -1  0] (Indices: [1, 3, 5, 6, 7, 12, 17, 18]), Candidate: [ 3  0  2 -1  2  1  1 -1  1  1  0  2  0  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 66000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1  0 -1  1 -1  0  0  1 -1  0  0  0  0] (Indices: [1, 3, 5, 6, 8, 9, 11, 15]), Candidate: [ 3  0  2 -1  2  1  0  1  1  0  1  0  1  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1 -1  1 -1  0  1 -1  0  1 -1  0  0  0] (Indices: [1, 3, 5, 6, 8, 10, 13, 16]), Candidate: [ 3  0  2 -1  2  1  0  1  0  2 -1  1  2  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 66100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1 -1  0  0  1  0 -1  0  0  1 -1  0  0] (Indices: [1, 3, 5, 6, 8, 12, 13, 17]), Candidate: [ 3  0  2 -1  2  1  0  1  0  1  0  2  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1 -1  0  0  0  0  0  0  1  0 -1  1 -1] (Indices: [1, 3, 5, 6, 8, 16, 17, 19]), Candidate: [ 3  0  2 -1  2  1  0  1  0  1  0  1  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  1 -1  1 -1  1 -1  0  0  0  1 -1  0] (Indices: [1, 3, 5, 6, 9, 11, 13, 18]), Candidate: [ 3  0  2 -1  2  1  0  0  2  0  1  0  2  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  1 -1  0  0  1 -1  0  0  1  0 -1  0] (Indices: [1, 3, 5, 6, 9, 13, 17, 18]), Candidate: [ 3  0  2 -1  2  1  0  0  2  0  0  1  2  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  0  1  0 -1  0  0  0  0  0  1  0 -1] (Indices: [1, 3, 5, 6, 10, 11, 18, 19]), Candidate: [ 3  0  2 -1  2  1  0  0  1  2  0  0  1  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  0  1 -1  0  0  0  1 -1  1  0 -1  0] (Indices: [1, 3, 5, 6, 10, 15, 17, 18]), Candidate: [ 3  0  2 -1  2  1  0  0  1  2 -1  1  1  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 66400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  0  0  1 -1  0  1 -1  0  1  0 -1  0] (Indices: [1, 3, 5, 6, 11, 14, 17, 18]), Candidate: [ 3  0  2 -1  2  1  0  0  1  1  1  0  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 66450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  0  0  0  0  1  0  0 -1  0  1 -1  0] (Indices: [1, 3, 5, 6, 13, 14, 15, 18]), Candidate: [ 3  0  2 -1  2  1  0  0  1  1  0  1  2  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0  0 -1  0  1  0 -1  0  0  0  0  0  0] (Indices: [1, 3, 5, 7, 8, 9, 12, 13]), Candidate: [ 3  0  2 -1  2  0  2  0  1  0  0  2  1  0  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0 -1  1 -1  0  0  1 -1  1 -1  0  0  0] (Indices: [1, 3, 5, 7, 8, 10, 14, 16]), Candidate: [ 3  0  2 -1  2  0  2  0  0  2 -1  1  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 66600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0 -1  0  0  1 -1  1 -1  0  1 -1  0  0] (Indices: [1, 3, 5, 7, 8, 12, 14, 17]), Candidate: [ 3  0  2 -1  2  0  2  0  0  1  0  2  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 66650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  1  0  0 -1  0  1 -1  0  0  0  0  0] (Indices: [1, 3, 5, 7, 9, 10, 11, 14]), Candidate: [ 3  0  2 -1  2  0  2 -1  2  1  0  0  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 66700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  1 -1  1 -1  0  1 -1  0  0  1 -1  0] (Indices: [1, 3, 5, 7, 9, 11, 14, 18]), Candidate: [ 3  0  2 -1  2  0  2 -1  2  0  1  0  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 66750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  1 -1  0  0  0  1  0 -1  0  1 -1  0] (Indices: [1, 3, 5, 7, 9, 14, 15, 18]), Candidate: [ 3  0  2 -1  2  0  2 -1  2  0  0  1  1  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 66800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  0  1 -1  1  0 -1  0  0  0  1 -1  0] (Indices: [1, 3, 5, 7, 10, 12, 13, 18]), Candidate: [ 3  0  2 -1  2  0  2 -1  1  2 -1  2  1  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 66850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  0  1 -1  0  0  0  0  1 -1  1  0 -1] (Indices: [1, 3, 5, 7, 10, 16, 18, 19]), Candidate: [ 3  0  2 -1  2  0  2 -1  1  2 -1  1  1  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 66900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  0  0  1 -1  0  0  1  0 -1  0  1 -1] (Indices: [1, 3, 5, 7, 11, 15, 16, 19]), Candidate: [ 3  0  2 -1  2  0  2 -1  1  1  1  0  1  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 66950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  0  0  0  0  1  0 -1  0  1  0 -1  0] (Indices: [1, 3, 5, 7, 13, 14, 17, 18]), Candidate: [ 3  0  2 -1  2  0  2 -1  1  1  0  1  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 67000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1  0  0 -1  0  0  1 -1  1 -1  0  0  0] (Indices: [1, 3, 5, 8, 9, 10, 14, 16]), Candidate: [ 3  0  2 -1  2  0  1  1  1  1 -1  1  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 67050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1  0 -1  0  1 -1  1 -1  0  1 -1  0  0] (Indices: [1, 3, 5, 8, 9, 12, 14, 17]), Candidate: [ 3  0  2 -1  2  0  1  1  1  0  0  2  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 67100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1 -1  1  0  0 -1  0  1 -1  0  0  0  0] (Indices: [1, 3, 5, 8, 10, 11, 12, 15]), Candidate: [ 3  0  2 -1  2  0  1  1  0  2  0  1  0  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1 -1  1 -1  0  1  0 -1  0  0  1 -1  0] (Indices: [1, 3, 5, 8, 10, 13, 14, 18]), Candidate: [ 3  0  2 -1  2  0  1  1  0  2 -1  1  2  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 67200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1 -1  0  1  0 -1  0  0  0  1  0 -1  0] (Indices: [1, 3, 5, 8, 11, 12, 17, 18]), Candidate: [ 3  0  2 -1  2  0  1  1  0  1  1  1  0  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1 -1  0  0  1  0 -1  0  0  1  0 -1  0] (Indices: [1, 3, 5, 8, 12, 13, 17, 18]), Candidate: [ 3  0  2 -1  2  0  1  1  0  1  0  2  1  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1 -1  0  0  0  0  1 -1  1  0 -1  1 -1] (Indices: [1, 3, 5, 8, 14, 16, 17, 19]), Candidate: [ 3  0  2 -1  2  0  1  1  0  1  0  1  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 67350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  1  0 -1  1 -1  0  1 -1  0  0  1 -1] (Indices: [1, 3, 5, 9, 10, 12, 15, 19]), Candidate: [ 3  0  2 -1  2  0  1  0  2  1 -1  2  0  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 67400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  1 -1  1  0 -1  1 -1  0  1 -1  0  0] (Indices: [1, 3, 5, 9, 11, 12, 14, 17]), Candidate: [ 3  0  2 -1  2  0  1  0  2  0  1  1  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 67450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  1 -1  0  1  0  0 -1  0  1 -1  0  0] (Indices: [1, 3, 5, 9, 12, 13, 14, 17]), Candidate: [ 3  0  2 -1  2  0  1  0  2  0  0  2  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 67500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  1 -1  0  0  1 -1  0  1  0 -1  1 -1] (Indices: [1, 3, 5, 9, 13, 16, 17, 19]), Candidate: [ 3  0  2 -1  2  0  1  0  2  0  0  1  2  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  0  1  0 -1  1 -1  0  1 -1  0  1 -1] (Indices: [1, 3, 5, 10, 11, 13, 16, 19]), Candidate: [ 3  0  2 -1  2  0  1  0  1  2  0  0  2  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  0  1 -1  1 -1  0  1  0 -1  1 -1  0] (Indices: [1, 3, 5, 10, 12, 15, 16, 18]), Candidate: [ 3  0  2 -1  2  0  1  0  1  2 -1  2  0  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 67650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  0  0  1  0  0 -1  1 -1  1 -1  0  0] (Indices: [1, 3, 5, 11, 12, 13, 15, 17]), Candidate: [ 3  0  2 -1  2  0  1  0  1  1  1  1  1  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  0  0  1 -1  0  1  0  0 -1  1 -1  0] (Indices: [1, 3, 5, 11, 14, 15, 16, 18]), Candidate: [ 3  0  2 -1  2  0  1  0  1  1  1  0  1  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  0  0  0  0  1  0  0  0 -1  1 -1  0] (Indices: [1, 3, 5, 13, 14, 15, 16, 18]), Candidate: [ 3  0  2 -1  2  0  1  0  1  1  0  1  2  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0  0 -1  0  0  0  1  0 -1  0  0  0  0] (Indices: [1, 3, 6, 7, 8, 9, 14, 15]), Candidate: [ 3  0  2 -1  1  2  1  0  1  0  0  1  1  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0 -1  1 -1  0  0  0  0  0  0  1  0 -1] (Indices: [1, 3, 6, 7, 8, 10, 18, 19]), Candidate: [ 3  0  2 -1  1  2  1  0  0  2 -1  1  1  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 67900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0 -1  0  0  0  1  0  0 -1  0  0  0  0] (Indices: [1, 3, 6, 7, 8, 13, 14, 15]), Candidate: [ 3  0  2 -1  1  2  1  0  0  1  0  1  2  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  1  0 -1  0  1  0 -1  0  0  0  0  0] (Indices: [1, 3, 6, 7, 9, 10, 13, 14]), Candidate: [ 3  0  2 -1  1  2  1 -1  2  1 -1  1  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 68000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  1 -1  0  1  0 -1  1 -1  0  0  0  0] (Indices: [1, 3, 6, 7, 9, 12, 13, 15]), Candidate: [ 3  0  2 -1  1  2  1 -1  2  0  0  2  1  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  1 -1  0  0  0  0  1 -1  0  1  0 -1] (Indices: [1, 3, 6, 7, 9, 15, 18, 19]), Candidate: [ 3  0  2 -1  1  2  1 -1  2  0  0  1  1  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  0  1 -1  1 -1  0  0  1 -1  0  1 -1] (Indices: [1, 3, 6, 7, 10, 12, 16, 19]), Candidate: [ 3  0  2 -1  1  2  1 -1  1  2 -1  2  0  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 68150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  0  0  1  0 -1  0  1  0 -1  0  0  0] (Indices: [1, 3, 6, 7, 11, 12, 15, 16]), Candidate: [ 3  0  2 -1  1  2  1 -1  1  1  1  1  0  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  0  0  0  1  0 -1  1  0 -1  0  0  0] (Indices: [1, 3, 6, 7, 12, 13, 15, 16]), Candidate: [ 3  0  2 -1  1  2  1 -1  1  1  0  2  1  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  0  0  0  0  0  1  0  0  0 -1  0  0] (Indices: [1, 3, 6, 7, 14, 15, 16, 17]), Candidate: [ 3  0  2 -1  1  2  1 -1  1  1  0  1  1  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1  0  0 -1  0  0  0  0  0  0  1  0 -1] (Indices: [1, 3, 6, 8, 9, 10, 18, 19]), Candidate: [ 3  0  2 -1  1  2  0  1  1  1 -1  1  1  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1  0 -1  0  0  1  0  0 -1  0  0  0  0] (Indices: [1, 3, 6, 8, 9, 13, 14, 15]), Candidate: [ 3  0  2 -1  1  2  0  1  1  0  0  1  2  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1 -1  1  0 -1  0  1 -1  0  1 -1  0  0] (Indices: [1, 3, 6, 8, 10, 11, 14, 17]), Candidate: [ 3  0  2 -1  1  2  0  1  0  2  0  0  1  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1 -1  1 -1  0  0  1  0 -1  1 -1  0  0] (Indices: [1, 3, 6, 8, 10, 14, 15, 17]), Candidate: [ 3  0  2 -1  1  2  0  1  0  2 -1  1  1  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1 -1  0  1 -1  1 -1  0  1 -1  1 -1  0] (Indices: [1, 3, 6, 8, 11, 13, 16, 18]), Candidate: [ 3  0  2 -1  1  2  0  1  0  1  1  0  2  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1 -1  0  0  1 -1  0  1  0  0 -1  0  0] (Indices: [1, 3, 6, 8, 12, 15, 16, 17]), Candidate: [ 3  0  2 -1  1  2  0  1  0  1  0  2  0  1  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  1  0  0  0 -1  0  0  0  0  1 -1  0] (Indices: [1, 3, 6, 9, 10, 11, 12, 18]), Candidate: [ 3  0  2 -1  1  2  0  0  2  1  0  1  0  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  1  0 -1  0  1 -1  1 -1  1 -1  0  0] (Indices: [1, 3, 6, 9, 10, 13, 15, 17]), Candidate: [ 3  0  2 -1  1  2  0  0  2  1 -1  1  2  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  1 -1  1 -1  1  0  0 -1  0  0  0  0] (Indices: [1, 3, 6, 9, 11, 13, 14, 15]), Candidate: [ 3  0  2 -1  1  2  0  0  2  0  1  0  2  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  1 -1  0  1 -1  1  0  0 -1  0  0  0] (Indices: [1, 3, 6, 9, 12, 14, 15, 16]), Candidate: [ 3  0  2 -1  1  2  0  0  2  0  0  2  0  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  1 -1  0  0  0  0  1  0  0  0 -1  0] (Indices: [1, 3, 6, 9, 15, 16, 17, 18]), Candidate: [ 3  0  2 -1  1  2  0  0  2  0  0  1  1  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  0  1  0 -1  0  1 -1  0  0  1  0 -1] (Indices: [1, 3, 6, 10, 11, 14, 18, 19]), Candidate: [ 3  0  2 -1  1  2  0  0  1  2  0  0  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  0  1 -1  0  1  0 -1  1  0 -1  0  0] (Indices: [1, 3, 6, 10, 13, 14, 16, 17]), Candidate: [ 3  0  2 -1  1  2  0  0  1  2 -1  1  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 68950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  0  0  1  0 -1  1 -1  1  0 -1  0  0] (Indices: [1, 3, 6, 11, 12, 14, 16, 17]), Candidate: [ 3  0  2 -1  1  2  0  0  1  1  1  1  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 69000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  0  0  1 -1  0  0  0  1  0  0  0 -1] (Indices: [1, 3, 6, 11, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  1  2  0  0  1  1  1  0  1  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  0  0  0  0  1 -1  0  1  0  0  0 -1] (Indices: [1, 3, 6, 13, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  1  2  0  0  1  1  0  1  2  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0  0 -1  1 -1  1  0 -1  0  0  0  0  0] (Indices: [1, 3, 7, 8, 9, 11, 13, 14]), Candidate: [ 3  0  2 -1  1  1  2  0  1  0  1  0  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 69150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0  0 -1  0  0  1 -1  1 -1  0  0  1 -1] (Indices: [1, 3, 7, 8, 9, 13, 15, 19]), Candidate: [ 3  0  2 -1  1  1  2  0  1  0  0  1  2  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0 -1  1  0 -1  0  0  0  1 -1  1 -1  0] (Indices: [1, 3, 7, 8, 10, 11, 16, 18]), Candidate: [ 3  0  2 -1  1  1  2  0  0  2  0  0  1  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0 -1  1 -1  0  0  1 -1  0  0  1  0 -1] (Indices: [1, 3, 7, 8, 10, 14, 18, 19]), Candidate: [ 3  0  2 -1  1  1  2  0  0  2 -1  1  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 69300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0 -1  0  1 -1  0  1  0 -1  0  0  1 -1] (Indices: [1, 3, 7, 8, 11, 14, 15, 19]), Candidate: [ 3  0  2 -1  1  1  2  0  0  1  1  0  1  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0 -1  0  0  1 -1  0  0  1 -1  1  0 -1] (Indices: [1, 3, 7, 8, 12, 16, 18, 19]), Candidate: [ 3  0  2 -1  1  1  2  0  0  1  0  2  0  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  1  0  0 -1  0  1  0 -1  0  0  0  0] (Indices: [1, 3, 7, 9, 10, 11, 14, 15]), Candidate: [ 3  0  2 -1  1  1  2 -1  2  1  0  0  1  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 69450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  1  0 -1  0  1 -1  0  0  0  1  0 -1] (Indices: [1, 3, 7, 9, 10, 13, 18, 19]), Candidate: [ 3  0  2 -1  1  1  2 -1  2  1 -1  1  2  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 69500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  1 -1  1 -1  1 -1  1 -1  0  0  1 -1] (Indices: [1, 3, 7, 9, 11, 13, 15, 19]), Candidate: [ 3  0  2 -1  1  1  2 -1  2  0  1  0  2  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 69550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  1 -1  0  1 -1  1 -1  0  1 -1  1 -1] (Indices: [1, 3, 7, 9, 12, 14, 17, 19]), Candidate: [ 3  0  2 -1  1  1  2 -1  2  0  0  2  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 69600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  0  1  0  0  0 -1  0  0  1 -1  0  0] (Indices: [1, 3, 7, 10, 11, 12, 13, 17]), Candidate: [ 3  0  2 -1  1  1  2 -1  1  2  0  1  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 69650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  0  1  0 -1  0  0  0  1  0 -1  1 -1] (Indices: [1, 3, 7, 10, 11, 16, 17, 19]), Candidate: [ 3  0  2 -1  1  1  2 -1  1  2  0  0  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 69700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  0  1 -1  0  1 -1  1  0 -1  0  1 -1] (Indices: [1, 3, 7, 10, 13, 15, 16, 19]), Candidate: [ 3  0  2 -1  1  1  2 -1  1  2 -1  1  2  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 69750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  0  0  1  0 -1  0  1  0 -1  0  1 -1] (Indices: [1, 3, 7, 11, 12, 15, 16, 19]), Candidate: [ 3  0  2 -1  1  1  2 -1  1  1  1  1  0  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 69800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  0  0  0  1  0  0 -1  0  1  0 -1  0] (Indices: [1, 3, 7, 12, 13, 14, 17, 18]), Candidate: [ 3  0  2 -1  1  1  2 -1  1  1  0  2  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 69850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1  0  0  0  0 -1  1 -1  0  0  0  0  0] (Indices: [1, 3, 8, 9, 10, 11, 12, 14]), Candidate: [ 3  0  2 -1  1  1  1  1  1  1  0  1  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 69900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1  0  0 -1  0  1  0 -1  0  1 -1  0  0] (Indices: [1, 3, 8, 9, 10, 13, 14, 17]), Candidate: [ 3  0  2 -1  1  1  1  1  1  1 -1  1  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 69950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1  0 -1  1  0 -1  0  0  1 -1  0  1 -1] (Indices: [1, 3, 8, 9, 11, 12, 16, 19]), Candidate: [ 3  0  2 -1  1  1  1  1  1  0  1  1  0  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1  0 -1  0  1  0 -1  0  1 -1  0  1 -1] (Indices: [1, 3, 8, 9, 12, 13, 16, 19]), Candidate: [ 3  0  2 -1  1  1  1  1  1  0  0  2  1  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1  0 -1  0  0  0  1 -1  1  0  0 -1  0] (Indices: [1, 3, 8, 9, 14, 16, 17, 18]), Candidate: [ 3  0  2 -1  1  1  1  1  1  0  0  1  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 70100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1 -1  1  0 -1  0  1 -1  1 -1  1 -1  0] (Indices: [1, 3, 8, 10, 11, 14, 16, 18]), Candidate: [ 3  0  2 -1  1  1  1  1  0  2  0  0  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 70150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1 -1  1 -1  0  1  0  0  0 -1  0  0  0] (Indices: [1, 3, 8, 10, 13, 14, 15, 16]), Candidate: [ 3  0  2 -1  1  1  1  1  0  2 -1  1  2  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 70200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1 -1  0  1  0 -1  1  0  0 -1  0  0  0] (Indices: [1, 3, 8, 11, 12, 14, 15, 16]), Candidate: [ 3  0  2 -1  1  1  1  1  0  1  1  1  0  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1 -1  0  1 -1  0  0  1  0  0  0 -1  0] (Indices: [1, 3, 8, 11, 15, 16, 17, 18]), Candidate: [ 3  0  2 -1  1  1  1  1  0  1  1  0  1  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1 -1  0  0  0  1 -1  1  0  0  0 -1  0] (Indices: [1, 3, 8, 13, 15, 16, 17, 18]), Candidate: [ 3  0  2 -1  1  1  1  1  0  1  0  1  2  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  1  0  0 -1  0  1  0 -1  0  0  1 -1] (Indices: [1, 3, 9, 10, 11, 14, 15, 19]), Candidate: [ 3  0  2 -1  1  1  1  0  2  1  0  0  1  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  1  0 -1  1 -1  0  0  1 -1  1  0 -1] (Indices: [1, 3, 9, 10, 12, 16, 18, 19]), Candidate: [ 3  0  2 -1  1  1  1  0  2  1 -1  2  0  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 70450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  1 -1  1  0  0 -1  0  0  1 -1  1 -1] (Indices: [1, 3, 9, 11, 12, 13, 17, 19]), Candidate: [ 3  0  2 -1  1  1  1  0  2  0  1  1  1  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  1 -1  1 -1  0  1 -1  1 -1  1  0 -1] (Indices: [1, 3, 9, 11, 14, 16, 18, 19]), Candidate: [ 3  0  2 -1  1  1  1  0  2  0  1  0  1  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 70550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  1 -1  0  0  1  0 -1  1 -1  1  0 -1] (Indices: [1, 3, 9, 13, 14, 16, 18, 19]), Candidate: [ 3  0  2 -1  1  1  1  0  2  0  0  1  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 70600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  0  1  0 -1  1  0  0 -1  0  1 -1  0] (Indices: [1, 3, 10, 11, 13, 14, 15, 18]), Candidate: [ 3  0  2 -1  1  1  1  0  1  2  0  0  2  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  0  1 -1  1  0 -1  0  1  0 -1  1 -1] (Indices: [1, 3, 10, 12, 13, 16, 17, 19]), Candidate: [ 3  0  2 -1  1  1  1  0  1  2 -1  2  1  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 70700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  0  0  1  0  0 -1  1  0 -1  1 -1  0] (Indices: [1, 3, 11, 12, 13, 15, 16, 18]), Candidate: [ 3  0  2 -1  1  1  1  0  1  1  1  1  1  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  0  0  0  1  0  0  0 -1  0  1  0 -1] (Indices: [1, 3, 12, 13, 14, 15, 18, 19]), Candidate: [ 3  0  2 -1  1  1  1  0  1  1  0  2  1  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0 -1  0  0  1  0 -1  0  0  0  0  0  0] (Indices: [1, 4, 5, 6, 7, 8, 12, 13]), Candidate: [3 0 1 1 1 1 1 0 0 1 0 2 1 0 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 70850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  1 -1  0  1 -1  0  0  0  0  1 -1  0] (Indices: [1, 4, 5, 6, 7, 9, 12, 18]), Candidate: [ 3  0  1  1  1  1  1 -1  2  0  0  2  0  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  0  1 -1  0  0  0  1 -1  1 -1  0  0] (Indices: [1, 4, 5, 6, 7, 10, 15, 17]), Candidate: [ 3  0  1  1  1  1  1 -1  1  2 -1  1  1  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 70950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  0  0  0  1 -1  0  1 -1  0  1 -1  0] (Indices: [1, 4, 5, 6, 7, 12, 15, 18]), Candidate: [ 3  0  1  1  1  1  1 -1  1  1  0  2  0  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1  0  0 -1  0  0  0  0  0  0  1 -1  0] (Indices: [1, 4, 5, 6, 8, 9, 10, 18]), Candidate: [ 3  0  1  1  1  1  0  1  1  1 -1  1  1  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1 -1  1 -1  1 -1  0  0  0  1 -1  0  0] (Indices: [1, 4, 5, 6, 8, 10, 12, 17]), Candidate: [ 3  0  1  1  1  1  0  1  0  2 -1  2  0  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1 -1  0  1 -1  0  0  0  0  1 -1  1 -1] (Indices: [1, 4, 5, 6, 8, 11, 17, 19]), Candidate: [3 0 1 1 1 1 0 1 0 1 1 0 1 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 71150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1 -1  0  0  0  0  0  1  0 -1  0  1 -1] (Indices: [1, 4, 5, 6, 8, 15, 16, 19]), Candidate: [3 0 1 1 1 1 0 1 0 1 0 1 1 1 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 71200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  1 -1  1  0 -1  0  0  0  0  0  1 -1] (Indices: [1, 4, 5, 6, 9, 11, 12, 19]), Candidate: [3 0 1 1 1 1 0 0 2 0 1 1 0 1 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 71250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  1 -1  0  0  1 -1  1 -1  0  1 -1  0] (Indices: [1, 4, 5, 6, 9, 13, 15, 18]), Candidate: [3 0 1 1 1 1 0 0 2 0 0 1 2 0 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 71300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  0  1  0 -1  0  0  0  1  0 -1  0  0] (Indices: [1, 4, 5, 6, 10, 11, 16, 17]), Candidate: [3 0 1 1 1 1 0 0 1 2 0 0 1 1 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 71350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  0  1 -1  0  0  1 -1  0  1 -1  1 -1] (Indices: [1, 4, 5, 6, 10, 14, 17, 19]), Candidate: [ 3  0  1  1  1  1  0  0  1  2 -1  1  1  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 71400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  0  0  1 -1  0  1  0 -1  0  1 -1  0] (Indices: [1, 4, 5, 6, 11, 14, 15, 18]), Candidate: [3 0 1 1 1 1 0 0 1 1 1 0 1 2 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 71450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  0  0  0  1 -1  0  0  1  0 -1  1 -1] (Indices: [1, 4, 5, 6, 12, 16, 17, 19]), Candidate: [3 0 1 1 1 1 0 0 1 1 0 2 0 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 71500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0  0 -1  1 -1  0  0  1 -1  0  0  0  0] (Indices: [1, 4, 5, 7, 8, 9, 11, 15]), Candidate: [3 0 1 1 1 0 2 0 1 0 1 0 1 1 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 71550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0 -1  1 -1  0  1 -1  0  1 -1  0  0  0] (Indices: [1, 4, 5, 7, 8, 10, 13, 16]), Candidate: [ 3  0  1  1  1  0  2  0  0  2 -1  1  2  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0 -1  0  0  1  0 -1  0  0  1 -1  0  0] (Indices: [1, 4, 5, 7, 8, 12, 13, 17]), Candidate: [3 0 1 1 1 0 2 0 0 1 0 2 1 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 71650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0 -1  0  0  0  0  0  0  1  0 -1  1 -1] (Indices: [1, 4, 5, 7, 8, 16, 17, 19]), Candidate: [3 0 1 1 1 0 2 0 0 1 0 1 1 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 71700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  1 -1  1 -1  1 -1  0  0  0  1 -1  0] (Indices: [1, 4, 5, 7, 9, 11, 13, 18]), Candidate: [ 3  0  1  1  1  0  2 -1  2  0  1  0  2  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  1 -1  0  0  1 -1  0  0  1  0 -1  0] (Indices: [1, 4, 5, 7, 9, 13, 17, 18]), Candidate: [ 3  0  1  1  1  0  2 -1  2  0  0  1  2  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  0  1  0 -1  0  0  0  0  0  1  0 -1] (Indices: [1, 4, 5, 7, 10, 11, 18, 19]), Candidate: [ 3  0  1  1  1  0  2 -1  1  2  0  0  1  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  0  1 -1  0  0  0  1 -1  1  0 -1  0] (Indices: [1, 4, 5, 7, 10, 15, 17, 18]), Candidate: [ 3  0  1  1  1  0  2 -1  1  2 -1  1  1  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 71900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  0  0  1 -1  0  1 -1  0  1  0 -1  0] (Indices: [1, 4, 5, 7, 11, 14, 17, 18]), Candidate: [ 3  0  1  1  1  0  2 -1  1  1  1  0  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 71950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  0  0  0  0  1  0  0 -1  0  1 -1  0] (Indices: [1, 4, 5, 7, 13, 14, 15, 18]), Candidate: [ 3  0  1  1  1  0  2 -1  1  1  0  1  2  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1  0  0 -1  0  1 -1  0  1 -1  0  0  0] (Indices: [1, 4, 5, 8, 9, 10, 13, 16]), Candidate: [ 3  0  1  1  1  0  1  1  1  1 -1  1  2  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1  0 -1  0  1  0 -1  0  0  1 -1  0  0] (Indices: [1, 4, 5, 8, 9, 12, 13, 17]), Candidate: [3 0 1 1 1 0 1 1 1 0 0 2 1 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 72100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1  0 -1  0  0  0  0  0  1  0 -1  1 -1] (Indices: [1, 4, 5, 8, 9, 16, 17, 19]), Candidate: [3 0 1 1 1 0 1 1 1 0 0 1 1 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 72150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1 -1  1 -1  1 -1  0  0  0  1 -1  1 -1] (Indices: [1, 4, 5, 8, 10, 12, 17, 19]), Candidate: [ 3  0  1  1  1  0  1  1  0  2 -1  2  0  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1 -1  0  1  0 -1  0  1 -1  0  1 -1  0] (Indices: [1, 4, 5, 8, 11, 12, 15, 18]), Candidate: [3 0 1 1 1 0 1 1 0 1 1 1 0 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 72250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1 -1  0  0  1  0 -1  1 -1  0  1 -1  0] (Indices: [1, 4, 5, 8, 12, 13, 15, 18]), Candidate: [3 0 1 1 1 0 1 1 0 1 0 2 1 0 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 72300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1 -1  0  0  0  0  1  0  0 -1  0  1 -1] (Indices: [1, 4, 5, 8, 14, 15, 16, 19]), Candidate: [3 0 1 1 1 0 1 1 0 1 0 1 1 2 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 72350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  1  0 -1  1 -1  1 -1  0  0  1 -1  0] (Indices: [1, 4, 5, 9, 10, 12, 14, 18]), Candidate: [ 3  0  1  1  1  0  1  0  2  1 -1  2  0  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 72400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  1 -1  1  0  0 -1  0  0  1 -1  0  0] (Indices: [1, 4, 5, 9, 11, 12, 13, 17]), Candidate: [3 0 1 1 1 0 1 0 2 0 1 1 1 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 72450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  1 -1  1 -1  0  0  0  1  0 -1  1 -1] (Indices: [1, 4, 5, 9, 11, 16, 17, 19]), Candidate: [3 0 1 1 1 0 1 0 2 0 1 0 1 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 72500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  1 -1  0  0  1 -1  1  0 -1  0  1 -1] (Indices: [1, 4, 5, 9, 13, 15, 16, 19]), Candidate: [3 0 1 1 1 0 1 0 2 0 0 1 2 0 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 72550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  0  1  0 -1  1 -1  1 -1  1 -1  0  0] (Indices: [1, 4, 5, 10, 11, 13, 15, 17]), Candidate: [3 0 1 1 1 0 1 0 1 2 0 0 2 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 72600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  0  1 -1  1 -1  1 -1  1 -1  0  1 -1] (Indices: [1, 4, 5, 10, 12, 14, 16, 19]), Candidate: [ 3  0  1  1  1  0  1  0  1  2 -1  2  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 72650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  0  0  1  0  0  0 -1  1 -1  0  0  0] (Indices: [1, 4, 5, 11, 12, 13, 14, 16]), Candidate: [ 3  0  1  1  1  0  1  0  1  1  1  1  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  0  0  1 -1  1 -1  0  1  0  0 -1  0] (Indices: [1, 4, 5, 11, 13, 16, 17, 18]), Candidate: [3 0 1 1 1 0 1 0 1 1 1 0 2 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 72750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  0  0  0  1 -1  0  1  0  0 -1  1 -1] (Indices: [1, 4, 5, 12, 15, 16, 17, 19]), Candidate: [3 0 1 1 1 0 1 0 1 1 0 2 0 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 72800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0  0 -1  0  0  1 -1  1 -1  0  0  0  0] (Indices: [1, 4, 6, 7, 8, 9, 13, 15]), Candidate: [3 0 1 1 0 2 1 0 1 0 0 1 2 0 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 72850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0 -1  1 -1  0  0  0  0  1  0 -1  0  0] (Indices: [1, 4, 6, 7, 8, 10, 16, 17]), Candidate: [ 3  0  1  1  0  2  1  0  0  2 -1  1  1  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0 -1  0  0  1 -1  0  0  1 -1  1 -1  0] (Indices: [1, 4, 6, 7, 8, 12, 16, 18]), Candidate: [3 0 1 1 0 2 1 0 0 1 0 2 0 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 72950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  1  0 -1  1 -1  0  1 -1  0  0  0  0] (Indices: [1, 4, 6, 7, 9, 10, 12, 15]), Candidate: [ 3  0  1  1  0  2  1 -1  2  1 -1  2  0  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 73000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  1 -1  1 -1  0  0  0  1 -1  0  1 -1] (Indices: [1, 4, 6, 7, 9, 11, 16, 19]), Candidate: [ 3  0  1  1  0  2  1 -1  2  0  1  0  1  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  1 -1  0  0  0  0  1  0  0 -1  0  0] (Indices: [1, 4, 6, 7, 9, 15, 16, 17]), Candidate: [ 3  0  1  1  0  2  1 -1  2  0  0  1  1  1  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  0  1 -1  1 -1  0  1 -1  1 -1  0  0] (Indices: [1, 4, 6, 7, 10, 12, 15, 17]), Candidate: [ 3  0  1  1  0  2  1 -1  1  2 -1  2  0  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 73150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  0  0  1  0 -1  1  0 -1  0  0  0  0] (Indices: [1, 4, 6, 7, 11, 12, 14, 15]), Candidate: [ 3  0  1  1  0  2  1 -1  1  1  1  1  0  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  0  0  0  1  0  0  0 -1  0  0  0  0] (Indices: [1, 4, 6, 7, 12, 13, 14, 15]), Candidate: [ 3  0  1  1  0  2  1 -1  1  1  0  2  1  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  0  0  0  0  1 -1  1 -1  0  1  0 -1] (Indices: [1, 4, 6, 7, 13, 15, 18, 19]), Candidate: [ 3  0  1  1  0  2  1 -1  1  1  0  1  2  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1  0  0 -1  0  0  0  0  1  0 -1  0  0] (Indices: [1, 4, 6, 8, 9, 10, 16, 17]), Candidate: [ 3  0  1  1  0  2  0  1  1  1 -1  1  1  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1  0 -1  0  1 -1  0  0  1 -1  1 -1  0] (Indices: [1, 4, 6, 8, 9, 12, 16, 18]), Candidate: [3 0 1 1 0 2 0 1 1 0 0 2 0 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 73400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1 -1  1  0 -1  1 -1  0  0  1 -1  0  0] (Indices: [1, 4, 6, 8, 10, 11, 13, 17]), Candidate: [3 0 1 1 0 2 0 1 0 2 0 0 2 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 73450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1 -1  1 -1  0  1 -1  0  1 -1  0  1 -1] (Indices: [1, 4, 6, 8, 10, 13, 16, 19]), Candidate: [ 3  0  1  1  0  2  0  1  0  2 -1  1  2  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1 -1  0  1 -1  1 -1  1  0 -1  0  0  0] (Indices: [1, 4, 6, 8, 11, 13, 15, 16]), Candidate: [3 0 1 1 0 2 0 1 0 1 1 0 2 0 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 73550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1 -1  0  0  1 -1  1 -1  1 -1  1 -1  0] (Indices: [1, 4, 6, 8, 12, 14, 16, 18]), Candidate: [ 3  0  1  1  0  2  0  1  0  1  0  2  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  1  0  0  0  0 -1  0  0  0  0  0  0] (Indices: [1, 4, 6, 9, 10, 11, 12, 13]), Candidate: [3 0 1 1 0 2 0 0 2 1 0 1 1 0 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 73650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  1  0 -1  0  1  0 -1  1 -1  0  0  0] (Indices: [1, 4, 6, 9, 10, 13, 14, 16]), Candidate: [ 3  0  1  1  0  2  0  0  2  1 -1  1  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 73700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  1 -1  1  0 -1  0  0  1 -1  1 -1  0] (Indices: [1, 4, 6, 9, 11, 12, 16, 18]), Candidate: [3 0 1 1 0 2 0 0 2 0 1 1 0 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 73750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  1 -1  0  1  0 -1  0  1 -1  1 -1  0] (Indices: [1, 4, 6, 9, 12, 13, 16, 18]), Candidate: [3 0 1 1 0 2 0 0 2 0 0 2 1 0 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 73800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  1 -1  0  0  0  1  0 -1  0  1  0 -1] (Indices: [1, 4, 6, 9, 14, 15, 18, 19]), Candidate: [3 0 1 1 0 2 0 0 2 0 0 1 1 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 73850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  0  1  0 -1  0  1 -1  1  0 -1  0  0] (Indices: [1, 4, 6, 10, 11, 14, 16, 17]), Candidate: [ 3  0  1  1  0  2  0  0  1  2  0  0  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  0  1 -1  1 -1  0  0  0  1  0  0 -1] (Indices: [1, 4, 6, 10, 12, 17, 18, 19]), Candidate: [ 3  0  1  1  0  2  0  0  1  2 -1  2  0  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  0  0  1  0  0 -1  0  0  0  1  0 -1] (Indices: [1, 4, 6, 11, 12, 13, 18, 19]), Candidate: [3 0 1 1 0 2 0 0 1 1 1 1 1 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 74000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  0  0  1 -1  0  1 -1  0  1  0  0 -1] (Indices: [1, 4, 6, 11, 14, 17, 18, 19]), Candidate: [ 3  0  1  1  0  2  0  0  1  1  1  0  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  0  0  0  0  1  0 -1  0  1  0  0 -1] (Indices: [1, 4, 6, 13, 14, 17, 18, 19]), Candidate: [ 3  0  1  1  0  2  0  0  1  1  0  1  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0  0 -1  1  0 -1  0  1 -1  0  0  0  0] (Indices: [1, 4, 7, 8, 9, 11, 12, 15]), Candidate: [3 0 1 1 0 1 2 0 1 0 1 1 0 1 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 74150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0  0 -1  0  0  1  0 -1  0  0  1 -1  0] (Indices: [1, 4, 7, 8, 9, 13, 14, 18]), Candidate: [ 3  0  1  1  0  1  2  0  1  0  0  1  2  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0 -1  1  0 -1  0  0  1  0 -1  0  0  0] (Indices: [1, 4, 7, 8, 10, 11, 15, 16]), Candidate: [3 0 1 1 0 1 2 0 0 2 0 0 1 1 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 74250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0 -1  1 -1  0  0  1 -1  1  0 -1  0  0] (Indices: [1, 4, 7, 8, 10, 14, 16, 17]), Candidate: [ 3  0  1  1  0  1  2  0  0  2 -1  1  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 74300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0 -1  0  1 -1  1 -1  0  0  1 -1  1 -1] (Indices: [1, 4, 7, 8, 11, 13, 17, 19]), Candidate: [3 0 1 1 0 1 2 0 0 1 1 0 2 0 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 74350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0 -1  0  0  1 -1  0  1 -1  1  0 -1  0] (Indices: [1, 4, 7, 8, 12, 15, 17, 18]), Candidate: [3 0 1 1 0 1 2 0 0 1 0 2 0 1 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 74400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  1  0  0 -1  1 -1  1 -1  0  0  0  0] (Indices: [1, 4, 7, 9, 10, 11, 13, 15]), Candidate: [ 3  0  1  1  0  1  2 -1  2  1  0  0  2  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  1  0 -1  0  1 -1  0  1  0 -1  0  0] (Indices: [1, 4, 7, 9, 10, 13, 16, 17]), Candidate: [ 3  0  1  1  0  1  2 -1  2  1 -1  1  2  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 74500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  1 -1  1 -1  1  0 -1  0  0  1 -1  0] (Indices: [1, 4, 7, 9, 11, 13, 14, 18]), Candidate: [ 3  0  1  1  0  1  2 -1  2  0  1  0  2  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 74550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  1 -1  0  1 -1  1  0 -1  0  0  1 -1] (Indices: [1, 4, 7, 9, 12, 14, 15, 19]), Candidate: [ 3  0  1  1  0  1  2 -1  2  0  0  2  0  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  1 -1  0  0  0  0  1 -1  1  0  0 -1] (Indices: [1, 4, 7, 9, 15, 17, 18, 19]), Candidate: [ 3  0  1  1  0  1  2 -1  2  0  0  1  1  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  0  1  0 -1  0  0  1  0 -1  0  1 -1] (Indices: [1, 4, 7, 10, 11, 15, 16, 19]), Candidate: [ 3  0  1  1  0  1  2 -1  1  2  0  0  1  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  0  1 -1  0  1  0 -1  0  1  0 -1  0] (Indices: [1, 4, 7, 10, 13, 14, 17, 18]), Candidate: [ 3  0  1  1  0  1  2 -1  1  2 -1  1  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 74750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  0  0  1  0 -1  1 -1  0  1  0 -1  0] (Indices: [1, 4, 7, 11, 12, 14, 17, 18]), Candidate: [ 3  0  1  1  0  1  2 -1  1  1  1  1  0  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 74800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  0  0  0  1  0  0  0 -1  0  1 -1  0] (Indices: [1, 4, 7, 12, 13, 14, 15, 18]), Candidate: [ 3  0  1  1  0  1  2 -1  1  1  0  2  1  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  0  0  0  0  0  1  0  0 -1  1  0 -1] (Indices: [1, 4, 7, 14, 15, 16, 18, 19]), Candidate: [ 3  0  1  1  0  1  2 -1  1  1  0  1  1  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1  0  0 -1  1 -1  0  0  0  1  0 -1  0] (Indices: [1, 4, 8, 9, 10, 12, 17, 18]), Candidate: [ 3  0  1  1  0  1  1  1  1  1 -1  2  0  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1  0 -1  1  0 -1  0  1 -1  1 -1  0  0] (Indices: [1, 4, 8, 9, 11, 12, 15, 17]), Candidate: [3 0 1 1 0 1 1 1 1 0 1 1 0 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 75000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1  0 -1  0  1  0 -1  1 -1  1 -1  0  0] (Indices: [1, 4, 8, 9, 12, 13, 15, 17]), Candidate: [3 0 1 1 0 1 1 1 1 0 0 2 1 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 75050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1  0 -1  0  0  0  1  0  0 -1  1 -1  0] (Indices: [1, 4, 8, 9, 14, 15, 16, 18]), Candidate: [3 0 1 1 0 1 1 1 1 0 0 1 1 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 75100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1 -1  1  0 -1  0  1  0  0 -1  0  0  0] (Indices: [1, 4, 8, 10, 11, 14, 15, 16]), Candidate: [3 0 1 1 0 1 1 1 0 2 0 0 1 2 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 75150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1 -1  1 -1  1 -1  0  1 -1  0  1  0 -1] (Indices: [1, 4, 8, 10, 12, 15, 18, 19]), Candidate: [ 3  0  1  1  0  1  1  1  0  2 -1  2  0  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1 -1  0  1  0  0 -1  0  1 -1  1 -1  0] (Indices: [1, 4, 8, 11, 12, 13, 16, 18]), Candidate: [3 0 1 1 0 1 1 1 0 1 1 1 1 0 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 75250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1 -1  0  1 -1  0  1  0 -1  0  1  0 -1] (Indices: [1, 4, 8, 11, 14, 15, 18, 19]), Candidate: [3 0 1 1 0 1 1 1 0 1 1 0 1 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 75300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1 -1  0  0  0  1  0  0 -1  0  1  0 -1] (Indices: [1, 4, 8, 13, 14, 15, 18, 19]), Candidate: [3 0 1 1 0 1 1 1 0 1 0 1 2 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 75350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  1  0  0 -1  1 -1  0  0  1 -1  1 -1] (Indices: [1, 4, 9, 10, 11, 13, 17, 19]), Candidate: [3 0 1 1 0 1 1 0 2 1 0 0 2 0 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 75400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  1  0 -1  1 -1  0  1 -1  1  0 -1  0] (Indices: [1, 4, 9, 10, 12, 15, 17, 18]), Candidate: [ 3  0  1  1  0  1  1  0  2  1 -1  2  0  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  1 -1  1  0  0 -1  1 -1  0  0  1 -1] (Indices: [1, 4, 9, 11, 12, 13, 15, 19]), Candidate: [3 0 1 1 0 1 1 0 2 0 1 1 1 0 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 75500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  1 -1  1 -1  0  1  0 -1  1  0 -1  0] (Indices: [1, 4, 9, 11, 14, 15, 17, 18]), Candidate: [3 0 1 1 0 1 1 0 2 0 1 0 1 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 75550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  1 -1  0  0  1  0  0 -1  1  0 -1  0] (Indices: [1, 4, 9, 13, 14, 15, 17, 18]), Candidate: [3 0 1 1 0 1 1 0 2 0 0 1 2 1 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 75600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  0  1  0  0 -1  0  0  1  0 -1  1 -1] (Indices: [1, 4, 10, 11, 12, 16, 17, 19]), Candidate: [3 0 1 1 0 1 1 0 1 2 0 1 0 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 75650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  0  1 -1  1  0 -1  1  0 -1  0  1 -1] (Indices: [1, 4, 10, 12, 13, 15, 16, 19]), Candidate: [ 3  0  1  1  0  1  1  0  1  2 -1  2  1  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  0  0  1  0  0  0 -1  1 -1  0  1 -1] (Indices: [1, 4, 11, 12, 13, 14, 16, 19]), Candidate: [ 3  0  1  1  0  1  1  0  1  1  1  1  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  0  0  0  1  0  0  0  0  0 -1  0  0] (Indices: [1, 4, 12, 13, 14, 15, 16, 17]), Candidate: [3 0 1 1 0 1 1 0 1 1 0 2 1 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 75800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0  0 -1  0  1 -1  0  0  0  0  1 -1  0] (Indices: [1, 5, 6, 7, 8, 9, 12, 18]), Candidate: [3 0 1 0 2 1 1 0 1 0 0 2 0 1 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 75850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0 -1  1 -1  0  0  0  1 -1  1 -1  0  0] (Indices: [1, 5, 6, 7, 8, 10, 15, 17]), Candidate: [ 3  0  1  0  2  1  1  0  0  2 -1  1  1  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0 -1  0  0  1 -1  0  1 -1  0  1 -1  0] (Indices: [1, 5, 6, 7, 8, 12, 15, 18]), Candidate: [3 0 1 0 2 1 1 0 0 1 0 2 0 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 75950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  1  0  0 -1  0  0  0  0  0  0  1 -1] (Indices: [1, 5, 6, 7, 9, 10, 11, 19]), Candidate: [ 3  0  1  0  2  1  1 -1  2  1  0  0  1  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  1 -1  1 -1  0  0  1 -1  0  0  1 -1] (Indices: [1, 5, 6, 7, 9, 11, 15, 19]), Candidate: [ 3  0  1  0  2  1  1 -1  2  0  1  0  1  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  1 -1  0  0  0  1 -1  0  1  0 -1  0] (Indices: [1, 5, 6, 7, 9, 14, 17, 18]), Candidate: [ 3  0  1  0  2  1  1 -1  2  0  0  1  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 76100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  0  1 -1  1 -1  1 -1  0  0  1 -1  0] (Indices: [1, 5, 6, 7, 10, 12, 14, 18]), Candidate: [ 3  0  1  0  2  1  1 -1  1  2 -1  2  0  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 76150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  0  0  1  0  0 -1  0  0  1 -1  0  0] (Indices: [1, 5, 6, 7, 11, 12, 13, 17]), Candidate: [ 3  0  1  0  2  1  1 -1  1  1  1  1  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  0  0  1 -1  0  0  0  1  0 -1  1 -1] (Indices: [1, 5, 6, 7, 11, 16, 17, 19]), Candidate: [ 3  0  1  0  2  1  1 -1  1  1  1  0  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  0  0  0  0  1 -1  1  0 -1  0  1 -1] (Indices: [1, 5, 6, 7, 13, 15, 16, 19]), Candidate: [ 3  0  1  0  2  1  1 -1  1  1  0  1  2  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1  0  0 -1  0  0  0  1 -1  1 -1  0  0] (Indices: [1, 5, 6, 8, 9, 10, 15, 17]), Candidate: [ 3  0  1  0  2  1  0  1  1  1 -1  1  1  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1  0 -1  0  1 -1  0  1 -1  0  1 -1  0] (Indices: [1, 5, 6, 8, 9, 12, 15, 18]), Candidate: [3 0 1 0 2 1 0 1 1 0 0 2 0 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 76400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1 -1  1  0 -1  1  0 -1  0  0  0  0  0] (Indices: [1, 5, 6, 8, 10, 11, 13, 14]), Candidate: [ 3  0  1  0  2  1  0  1  0  2  0  0  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1 -1  1 -1  0  1 -1  1 -1  0  0  1 -1] (Indices: [1, 5, 6, 8, 10, 13, 15, 19]), Candidate: [ 3  0  1  0  2  1  0  1  0  2 -1  1  2  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1 -1  0  1 -1  1  0 -1  0  1 -1  0  0] (Indices: [1, 5, 6, 8, 11, 13, 14, 17]), Candidate: [ 3  0  1  0  2  1  0  1  0  1  1  0  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1 -1  0  0  1 -1  1  0 -1  0  1 -1  0] (Indices: [1, 5, 6, 8, 12, 14, 15, 18]), Candidate: [3 0 1 0 2 1 0 1 0 1 0 2 0 2 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 76600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1 -1  0  0  0  0  0  1  0 -1  1  0 -1] (Indices: [1, 5, 6, 8, 15, 16, 18, 19]), Candidate: [3 0 1 0 2 1 0 1 0 1 0 1 1 1 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 76650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  1  0 -1  1 -1  0  0  0  1 -1  1 -1] (Indices: [1, 5, 6, 9, 10, 12, 17, 19]), Candidate: [ 3  0  1  0  2  1  0  0  2  1 -1  2  0  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  1 -1  1  0 -1  0  1 -1  0  1 -1  0] (Indices: [1, 5, 6, 9, 11, 12, 15, 18]), Candidate: [3 0 1 0 2 1 0 0 2 0 1 1 0 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 76750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  1 -1  0  1  0 -1  1 -1  0  1 -1  0] (Indices: [1, 5, 6, 9, 12, 13, 15, 18]), Candidate: [3 0 1 0 2 1 0 0 2 0 0 2 1 0 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 76800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  1 -1  0  0  0  1  0  0 -1  0  1 -1] (Indices: [1, 5, 6, 9, 14, 15, 16, 19]), Candidate: [3 0 1 0 2 1 0 0 2 0 0 1 1 2 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 76850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  0  1  0 -1  0  1  0 -1  1 -1  0  0] (Indices: [1, 5, 6, 10, 11, 14, 15, 17]), Candidate: [3 0 1 0 2 1 0 0 1 2 0 0 1 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 76900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  0  1 -1  1 -1  0  0  1  0  0 -1  0] (Indices: [1, 5, 6, 10, 12, 16, 17, 18]), Candidate: [ 3  0  1  0  2  1  0  0  1  2 -1  2  0  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  0  0  1  0  0 -1  0  1 -1  0  1 -1] (Indices: [1, 5, 6, 11, 12, 13, 16, 19]), Candidate: [3 0 1 0 2 1 0 0 1 1 1 1 1 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 77000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  0  0  1 -1  0  1 -1  1  0  0 -1  0] (Indices: [1, 5, 6, 11, 14, 16, 17, 18]), Candidate: [ 3  0  1  0  2  1  0  0  1  1  1  0  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  0  0  0  0  1  0 -1  1  0  0 -1  0] (Indices: [1, 5, 6, 13, 14, 16, 17, 18]), Candidate: [ 3  0  1  0  2  1  0  0  1  1  0  1  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0  0  0 -1  0  0  0  0  0  0  1  0 -1] (Indices: [1, 5, 7, 8, 9, 10, 18, 19]), Candidate: [ 3  0  1  0  2  0  2  0  1  1 -1  1  1  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0  0 -1  0  0  1  0  0 -1  0  0  0  0] (Indices: [1, 5, 7, 8, 9, 13, 14, 15]), Candidate: [3 0 1 0 2 0 2 0 1 0 0 1 2 1 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 77200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0 -1  1  0 -1  0  1 -1  0  1 -1  0  0] (Indices: [1, 5, 7, 8, 10, 11, 14, 17]), Candidate: [ 3  0  1  0  2  0  2  0  0  2  0  0  1  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0 -1  1 -1  0  0  1  0 -1  1 -1  0  0] (Indices: [1, 5, 7, 8, 10, 14, 15, 17]), Candidate: [ 3  0  1  0  2  0  2  0  0  2 -1  1  1  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0 -1  0  1 -1  1 -1  0  1 -1  1 -1  0] (Indices: [1, 5, 7, 8, 11, 13, 16, 18]), Candidate: [3 0 1 0 2 0 2 0 0 1 1 0 2 0 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 77350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0 -1  0  0  1 -1  0  1  0  0 -1  0  0] (Indices: [1, 5, 7, 8, 12, 15, 16, 17]), Candidate: [3 0 1 0 2 0 2 0 0 1 0 2 0 1 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 77400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  1  0  0  0 -1  0  0  0  0  1 -1  0] (Indices: [1, 5, 7, 9, 10, 11, 12, 18]), Candidate: [ 3  0  1  0  2  0  2 -1  2  1  0  1  0  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  1  0 -1  0  1 -1  1 -1  1 -1  0  0] (Indices: [1, 5, 7, 9, 10, 13, 15, 17]), Candidate: [ 3  0  1  0  2  0  2 -1  2  1 -1  1  2  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 77500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  1 -1  1 -1  1  0  0 -1  0  0  0  0] (Indices: [1, 5, 7, 9, 11, 13, 14, 15]), Candidate: [ 3  0  1  0  2  0  2 -1  2  0  1  0  2  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  1 -1  0  1 -1  1  0  0 -1  0  0  0] (Indices: [1, 5, 7, 9, 12, 14, 15, 16]), Candidate: [ 3  0  1  0  2  0  2 -1  2  0  0  2  0  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  1 -1  0  0  0  0  1  0  0  0 -1  0] (Indices: [1, 5, 7, 9, 15, 16, 17, 18]), Candidate: [ 3  0  1  0  2  0  2 -1  2  0  0  1  1  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  0  1  0 -1  0  1 -1  0  0  1  0 -1] (Indices: [1, 5, 7, 10, 11, 14, 18, 19]), Candidate: [ 3  0  1  0  2  0  2 -1  1  2  0  0  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 77700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  0  1 -1  0  1  0 -1  1  0 -1  0  0] (Indices: [1, 5, 7, 10, 13, 14, 16, 17]), Candidate: [ 3  0  1  0  2  0  2 -1  1  2 -1  1  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 77750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  0  0  1  0 -1  1 -1  1  0 -1  0  0] (Indices: [1, 5, 7, 11, 12, 14, 16, 17]), Candidate: [ 3  0  1  0  2  0  2 -1  1  1  1  1  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 77800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  0  0  1 -1  0  0  0  1  0  0  0 -1] (Indices: [1, 5, 7, 11, 16, 17, 18, 19]), Candidate: [ 3  0  1  0  2  0  2 -1  1  1  1  0  1  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  0  0  0  0  1 -1  0  1  0  0  0 -1] (Indices: [1, 5, 7, 13, 16, 17, 18, 19]), Candidate: [ 3  0  1  0  2  0  2 -1  1  1  0  1  2  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1  0  0 -1  1 -1  0  0  1  0 -1  0  0] (Indices: [1, 5, 8, 9, 10, 12, 16, 17]), Candidate: [ 3  0  1  0  2  0  1  1  1  1 -1  2  0  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1  0 -1  1  0 -1  1 -1  0  0  1 -1  0] (Indices: [1, 5, 8, 9, 11, 12, 14, 18]), Candidate: [ 3  0  1  0  2  0  1  1  1  0  1  1  0  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1  0 -1  0  1  0  0 -1  0  0  1 -1  0] (Indices: [1, 5, 8, 9, 12, 13, 14, 18]), Candidate: [ 3  0  1  0  2  0  1  1  1  0  0  2  1  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1  0 -1  0  0  1 -1  0  1 -1  1  0 -1] (Indices: [1, 5, 8, 9, 13, 16, 18, 19]), Candidate: [3 0 1 0 2 0 1 1 1 0 0 1 2 0 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 78100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1 -1  1  0 -1  1 -1  0  0  1  0 -1  0] (Indices: [1, 5, 8, 10, 11, 13, 17, 18]), Candidate: [3 0 1 0 2 0 1 1 0 2 0 0 2 0 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 78150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1 -1  1 -1  1 -1  0  1  0 -1  0  1 -1] (Indices: [1, 5, 8, 10, 12, 15, 16, 19]), Candidate: [ 3  0  1  0  2  0  1  1  0  2 -1  2  0  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1 -1  0  1  0  0 -1  1 -1  0  1 -1  0] (Indices: [1, 5, 8, 11, 12, 13, 15, 18]), Candidate: [3 0 1 0 2 0 1 1 0 1 1 1 1 0 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 78250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1 -1  0  1 -1  0  1  0  0 -1  0  1 -1] (Indices: [1, 5, 8, 11, 14, 15, 16, 19]), Candidate: [3 0 1 0 2 0 1 1 0 1 1 0 1 2 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 78300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1 -1  0  0  0  1  0  0  0 -1  0  1 -1] (Indices: [1, 5, 8, 13, 14, 15, 16, 19]), Candidate: [3 0 1 0 2 0 1 1 0 1 0 1 2 1 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 78350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  1  0  0 -1  1 -1  0  1 -1  1 -1  0] (Indices: [1, 5, 9, 10, 11, 13, 16, 18]), Candidate: [3 0 1 0 2 0 1 0 2 1 0 0 2 0 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 78400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  1  0 -1  1 -1  0  1  0  0 -1  0  0] (Indices: [1, 5, 9, 10, 12, 15, 16, 17]), Candidate: [ 3  0  1  0  2  0  1  0  2  1 -1  2  0  1  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  1 -1  1  0  0 -1  1  0 -1  0  0  0] (Indices: [1, 5, 9, 11, 12, 13, 15, 16]), Candidate: [3 0 1 0 2 0 1 0 2 0 1 1 1 0 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 78500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  1 -1  1 -1  0  1  0  0  0 -1  0  0] (Indices: [1, 5, 9, 11, 14, 15, 16, 17]), Candidate: [3 0 1 0 2 0 1 0 2 0 1 0 1 2 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 78550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  1 -1  0  0  1  0  0  0  0 -1  0  0] (Indices: [1, 5, 9, 13, 14, 15, 16, 17]), Candidate: [3 0 1 0 2 0 1 0 2 0 0 1 2 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 78600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  0  1  0  0 -1  0  1 -1  1 -1  1 -1] (Indices: [1, 5, 10, 11, 12, 15, 17, 19]), Candidate: [3 0 1 0 2 0 1 0 1 2 0 1 0 1 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 78650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  0  1 -1  1  0  0 -1  0  0  1  0 -1] (Indices: [1, 5, 10, 12, 13, 14, 18, 19]), Candidate: [ 3  0  1  0  2  0  1  0  1  2 -1  2  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 78700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  0  0  1  0  0  0  0 -1  0  0  1 -1] (Indices: [1, 5, 11, 12, 13, 14, 15, 19]), Candidate: [3 0 1 0 2 0 1 0 1 1 1 1 1 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 78750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  0  0  1 -1  0  1  0 -1  1  0  0 -1] (Indices: [1, 5, 11, 14, 15, 17, 18, 19]), Candidate: [3 0 1 0 2 0 1 0 1 1 1 0 1 2 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 78800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0  0  0 -1  0  1 -1  0  0  0  1 -1  0] (Indices: [1, 6, 7, 8, 9, 10, 13, 18]), Candidate: [ 3  0  1  0  1  2  1  0  1  1 -1  1  2  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0  0 -1  0  1  0 -1  0  0  0  0  1 -1] (Indices: [1, 6, 7, 8, 9, 12, 13, 19]), Candidate: [3 0 1 0 1 2 1 0 1 0 0 2 1 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 78900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0  0 -1  0  0  0  0  0  0  1  0  0 -1] (Indices: [1, 6, 7, 8, 9, 17, 18, 19]), Candidate: [3 0 1 0 1 2 1 0 1 0 0 1 1 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 78950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0 -1  1 -1  0  1  0  0 -1  0  0  0  0] (Indices: [1, 6, 7, 8, 10, 13, 14, 15]), Candidate: [ 3  0  1  0  1  2  1  0  0  2 -1  1  2  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0 -1  0  1  0 -1  0  0  1  0 -1  0  0] (Indices: [1, 6, 7, 8, 11, 12, 16, 17]), Candidate: [3 0 1 0 1 2 1 0 0 1 1 1 0 1 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 79050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0 -1  0  0  1  0 -1  0  1  0 -1  0  0] (Indices: [1, 6, 7, 8, 12, 13, 16, 17]), Candidate: [3 0 1 0 1 2 1 0 0 1 0 2 1 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 79100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0 -1  0  0  0  0  1  0 -1  1 -1  1 -1] (Indices: [1, 6, 7, 8, 14, 15, 17, 19]), Candidate: [3 0 1 0 1 2 1 0 0 1 0 1 1 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 79150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  1  0 -1  1 -1  0  1  0 -1  0  0  0] (Indices: [1, 6, 7, 9, 10, 12, 15, 16]), Candidate: [ 3  0  1  0  1  2  1 -1  2  1 -1  2  0  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 79200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  1 -1  1  0  0 -1  0  0  0  0  1 -1] (Indices: [1, 6, 7, 9, 11, 12, 13, 19]), Candidate: [ 3  0  1  0  1  2  1 -1  2  0  1  1  1  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  1 -1  1 -1  0  0  0  0  1  0  0 -1] (Indices: [1, 6, 7, 9, 11, 17, 18, 19]), Candidate: [ 3  0  1  0  1  2  1 -1  2  0  1  0  1  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  1 -1  0  0  1 -1  1 -1  1 -1  1 -1] (Indices: [1, 6, 7, 9, 13, 15, 17, 19]), Candidate: [ 3  0  1  0  1  2  1 -1  2  0  0  1  2  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  0  1  0 -1  1 -1  1 -1  0  0  1 -1] (Indices: [1, 6, 7, 10, 11, 13, 15, 19]), Candidate: [ 3  0  1  0  1  2  1 -1  1  2  0  0  2  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  0  1 -1  1 -1  1 -1  0  1 -1  1 -1] (Indices: [1, 6, 7, 10, 12, 14, 17, 19]), Candidate: [ 3  0  1  0  1  2  1 -1  1  2 -1  2  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 79450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  0  0  1  0  0  0 -1  0  0  1 -1  0] (Indices: [1, 6, 7, 11, 12, 13, 14, 18]), Candidate: [ 3  0  1  0  1  2  1 -1  1  1  1  1  1  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 79500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  0  0  1 -1  1 -1  0  1 -1  1  0 -1] (Indices: [1, 6, 7, 11, 13, 16, 18, 19]), Candidate: [ 3  0  1  0  1  2  1 -1  1  1  1  0  2  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  0  0  0  1 -1  0  1 -1  1  0  0 -1] (Indices: [1, 6, 7, 12, 15, 17, 18, 19]), Candidate: [ 3  0  1  0  1  2  1 -1  1  1  0  2  0  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1  0  0  0 -1  0  0  0  0  0  1  0 -1] (Indices: [1, 6, 8, 9, 10, 11, 18, 19]), Candidate: [3 0 1 0 1 2 0 1 1 1 0 0 1 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 79650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1  0  0 -1  0  0  0  1 -1  1  0 -1  0] (Indices: [1, 6, 8, 9, 10, 15, 17, 18]), Candidate: [ 3  0  1  0  1  2  0  1  1  1 -1  1  1  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1  0 -1  1 -1  0  1 -1  0  1  0 -1  0] (Indices: [1, 6, 8, 9, 11, 14, 17, 18]), Candidate: [ 3  0  1  0  1  2  0  1  1  0  1  0  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1  0 -1  0  0  1  0  0 -1  0  1 -1  0] (Indices: [1, 6, 8, 9, 13, 14, 15, 18]), Candidate: [3 0 1 0 1 2 0 1 1 0 0 1 2 1 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 79800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1 -1  1  0  0 -1  0  0  1 -1  0  1 -1] (Indices: [1, 6, 8, 10, 11, 12, 16, 19]), Candidate: [3 0 1 0 1 2 0 1 0 2 0 1 0 1 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 79850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1 -1  1 -1  1  0 -1  0  1 -1  0  1 -1] (Indices: [1, 6, 8, 10, 12, 13, 16, 19]), Candidate: [ 3  0  1  0  1  2  0  1  0  2 -1  2  1  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1 -1  1 -1  0  0  1 -1  1  0  0 -1  0] (Indices: [1, 6, 8, 10, 14, 16, 17, 18]), Candidate: [ 3  0  1  0  1  2  0  1  0  2 -1  1  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 79950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1 -1  0  1 -1  1  0 -1  1 -1  0  1 -1] (Indices: [1, 6, 8, 11, 13, 14, 16, 19]), Candidate: [ 3  0  1  0  1  2  0  1  0  1  1  0  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1 -1  0  0  1 -1  1  0  0 -1  1 -1  0] (Indices: [1, 6, 8, 12, 14, 15, 16, 18]), Candidate: [3 0 1 0 1 2 0 1 0 1 0 2 0 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 80050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  1  0  0  0 -1  0  0  1  0 -1  0  0] (Indices: [1, 6, 9, 10, 11, 12, 16, 17]), Candidate: [3 0 1 0 1 2 0 0 2 1 0 1 0 1 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 80100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  1  0 -1  1  0 -1  0  1  0 -1  0  0] (Indices: [1, 6, 9, 10, 12, 13, 16, 17]), Candidate: [ 3  0  1  0  1  2  0  0  2  1 -1  2  1  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  1  0 -1  0  0  1  0 -1  1 -1  1 -1] (Indices: [1, 6, 9, 10, 14, 15, 17, 19]), Candidate: [ 3  0  1  0  1  2  0  0  2  1 -1  1  1  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  1 -1  1 -1  1  0 -1  1  0 -1  0  0] (Indices: [1, 6, 9, 11, 13, 14, 16, 17]), Candidate: [ 3  0  1  0  1  2  0  0  2  0  1  0  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  1 -1  0  1  0 -1  0  0  1  0  0 -1] (Indices: [1, 6, 9, 12, 13, 17, 18, 19]), Candidate: [3 0 1 0 1 2 0 0 2 0 0 2 1 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 80300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  0  1  0  0  0 -1  0  0  1 -1  1 -1] (Indices: [1, 6, 10, 11, 12, 13, 17, 19]), Candidate: [3 0 1 0 1 2 0 0 1 2 0 1 1 0 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 80350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  0  1  0 -1  0  1 -1  1 -1  1  0 -1] (Indices: [1, 6, 10, 11, 14, 16, 18, 19]), Candidate: [ 3  0  1  0  1  2  0  0  1  2  0  0  1  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  0  1 -1  0  1  0 -1  1 -1  1  0 -1] (Indices: [1, 6, 10, 13, 14, 16, 18, 19]), Candidate: [ 3  0  1  0  1  2  0  0  1  2 -1  1  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 80450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  0  0  1 -1  1  0  0  0 -1  0  1 -1] (Indices: [1, 6, 11, 13, 14, 15, 16, 19]), Candidate: [3 0 1 0 1 2 0 0 1 1 1 0 2 1 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 80500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0  0  0  0  0 -1  0  0  1 -1  0  0  0] (Indices: [1, 7, 8, 9, 10, 11, 12, 16]), Candidate: [3 0 1 0 1 1 2 0 1 1 0 1 0 1 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 80550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0  0  0 -1  0  1  0 -1  0  0  0  1 -1] (Indices: [1, 7, 8, 9, 10, 13, 14, 19]), Candidate: [ 3  0  1  0  1  1  2  0  1  1 -1  1  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 80600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0  0 -1  1  0 -1  0  0  0  1 -1  1 -1] (Indices: [1, 7, 8, 9, 11, 12, 17, 19]), Candidate: [3 0 1 0 1 1 2 0 1 0 1 1 0 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 80650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0  0 -1  0  1  0 -1  0  0  1 -1  1 -1] (Indices: [1, 7, 8, 9, 12, 13, 17, 19]), Candidate: [3 0 1 0 1 1 2 0 1 0 0 2 1 0 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 80700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0  0 -1  0  0  0  1 -1  1 -1  1  0 -1] (Indices: [1, 7, 8, 9, 14, 16, 18, 19]), Candidate: [ 3  0  1  0  1  1  2  0  1  0  0  1  1  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0 -1  1  0 -1  0  1 -1  0  1  0 -1  0] (Indices: [1, 7, 8, 10, 11, 14, 17, 18]), Candidate: [ 3  0  1  0  1  1  2  0  0  2  0  0  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0 -1  1 -1  0  1  0  0 -1  0  1 -1  0] (Indices: [1, 7, 8, 10, 13, 14, 15, 18]), Candidate: [ 3  0  1  0  1  1  2  0  0  2 -1  1  2  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0 -1  0  1  0 -1  1  0 -1  0  1 -1  0] (Indices: [1, 7, 8, 11, 12, 14, 15, 18]), Candidate: [3 0 1 0 1 1 2 0 0 1 1 1 0 2 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 80900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0 -1  0  1 -1  0  0  1  0 -1  1  0 -1] (Indices: [1, 7, 8, 11, 15, 16, 18, 19]), Candidate: [3 0 1 0 1 1 2 0 0 1 1 0 1 1 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 80950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0 -1  0  0  0  1 -1  1  0 -1  1  0 -1] (Indices: [1, 7, 8, 13, 15, 16, 18, 19]), Candidate: [3 0 1 0 1 1 2 0 0 1 0 1 2 0 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 81000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  1  0  0 -1  0  1 -1  1 -1  1 -1  0] (Indices: [1, 7, 9, 10, 11, 14, 16, 18]), Candidate: [ 3  0  1  0  1  1  2 -1  2  1  0  0  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 81050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  1  0 -1  0  1  0  0  0 -1  0  0  0] (Indices: [1, 7, 9, 10, 13, 14, 15, 16]), Candidate: [ 3  0  1  0  1  1  2 -1  2  1 -1  1  2  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 81100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  1 -1  1  0 -1  1  0  0 -1  0  0  0] (Indices: [1, 7, 9, 11, 12, 14, 15, 16]), Candidate: [ 3  0  1  0  1  1  2 -1  2  0  1  1  0  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  1 -1  1 -1  0  0  1  0  0  0 -1  0] (Indices: [1, 7, 9, 11, 15, 16, 17, 18]), Candidate: [ 3  0  1  0  1  1  2 -1  2  0  1  0  1  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  1 -1  0  0  1 -1  1  0  0  0 -1  0] (Indices: [1, 7, 9, 13, 15, 16, 17, 18]), Candidate: [ 3  0  1  0  1  1  2 -1  2  0  0  1  2  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  0  1  0 -1  1  0 -1  1  0 -1  0  0] (Indices: [1, 7, 10, 11, 13, 14, 16, 17]), Candidate: [ 3  0  1  0  1  1  2 -1  1  2  0  0  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 81300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  0  1 -1  1  0 -1  0  0  1  0  0 -1] (Indices: [1, 7, 10, 12, 13, 17, 18, 19]), Candidate: [ 3  0  1  0  1  1  2 -1  1  2 -1  2  1  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 81350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  0  0  1  0  0 -1  1 -1  1  0 -1  0] (Indices: [1, 7, 11, 12, 13, 15, 17, 18]), Candidate: [ 3  0  1  0  1  1  2 -1  1  1  1  1  1  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  0  0  0  1  0  0 -1  1  0 -1  1 -1] (Indices: [1, 7, 12, 13, 14, 16, 17, 19]), Candidate: [ 3  0  1  0  1  1  2 -1  1  1  0  2  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 81450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1  0  0  0 -1  1 -1  1 -1  0  0  1 -1] (Indices: [1, 8, 9, 10, 11, 13, 15, 19]), Candidate: [3 0 1 0 1 1 1 1 1 1 0 0 2 0 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 81500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1  0  0 -1  1 -1  1 -1  0  1 -1  1 -1] (Indices: [1, 8, 9, 10, 12, 14, 17, 19]), Candidate: [ 3  0  1  0  1  1  1  1  1  1 -1  2  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 81550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1  0 -1  1  0  0  0 -1  0  0  1 -1  0] (Indices: [1, 8, 9, 11, 12, 13, 14, 18]), Candidate: [ 3  0  1  0  1  1  1  1  1  0  1  1  1  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1  0 -1  1 -1  1 -1  0  1 -1  1  0 -1] (Indices: [1, 8, 9, 11, 13, 16, 18, 19]), Candidate: [3 0 1 0 1 1 1 1 1 0 1 0 2 0 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 81650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1  0 -1  0  1 -1  0  1 -1  1  0  0 -1] (Indices: [1, 8, 9, 12, 15, 17, 18, 19]), Candidate: [3 0 1 0 1 1 1 1 1 0 0 2 0 1 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 81700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1 -1  1  0  0 -1  0  1  0 -1  0  1 -1] (Indices: [1, 8, 10, 11, 12, 15, 16, 19]), Candidate: [3 0 1 0 1 1 1 1 0 2 0 1 0 1 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 81750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1 -1  1 -1  1  0  0 -1  0  1  0 -1  0] (Indices: [1, 8, 10, 12, 13, 14, 17, 18]), Candidate: [ 3  0  1  0  1  1  1  1  0  2 -1  2  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 81800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1 -1  0  1  0  0  0  0 -1  1 -1  0  0] (Indices: [1, 8, 11, 12, 13, 14, 15, 17]), Candidate: [3 0 1 0 1 1 1 1 0 1 1 1 1 1 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 81850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1 -1  0  1 -1  0  1  0  0  0 -1  1 -1] (Indices: [1, 8, 11, 14, 15, 16, 17, 19]), Candidate: [3 0 1 0 1 1 1 1 0 1 1 0 1 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 81900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  1  0  0  0 -1  1  0 -1  0  1 -1  0] (Indices: [1, 9, 10, 11, 12, 14, 15, 18]), Candidate: [3 0 1 0 1 1 1 0 2 1 0 1 0 2 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 81950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  1  0  0 -1  0  0  1  0 -1  1  0 -1] (Indices: [1, 9, 10, 11, 15, 16, 18, 19]), Candidate: [3 0 1 0 1 1 1 0 2 1 0 0 1 1 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 82000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  1  0 -1  0  1 -1  1  0 -1  1  0 -1] (Indices: [1, 9, 10, 13, 15, 16, 18, 19]), Candidate: [ 3  0  1  0  1  1  1  0  2  1 -1  1  2  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  1 -1  1 -1  1  0 -1  1  0  0 -1  0] (Indices: [1, 9, 11, 13, 14, 16, 17, 18]), Candidate: [ 3  0  1  0  1  1  1  0  2  0  1  0  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  0  1  0  0  0  0 -1  0  1  0 -1  0] (Indices: [1, 10, 11, 12, 13, 14, 17, 18]), Candidate: [ 3  0  1  0  1  1  1  0  1  2  0  1  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  0  1 -1  1  0  0  0  0 -1  1 -1  0] (Indices: [1, 10, 12, 13, 14, 15, 16, 18]), Candidate: [ 3  0  1  0  1  1  1  0  1  2 -1  2  1  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  0  0  1 -1  1  0  0  0 -1  1  0 -1] (Indices: [1, 11, 13, 14, 15, 16, 18, 19]), Candidate: [3 0 1 0 1 1 1 0 1 1 1 0 2 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 82250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  0  0  1 -1  0  0  0  0  0  0  1 -1] (Indices: [2, 3, 4, 5, 6, 7, 11, 19]), Candidate: [ 2  2  1  0  1  1  1 -1  1  1  1  0  1  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1 -1  0  1 -1  0  1 -1  0  0  0  0  0] (Indices: [2, 3, 4, 5, 6, 8, 11, 14]), Candidate: [ 2  2  1  0  1  1  0  1  0  1  1  0  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  1 -1  1 -1  0  0  0  0  0  0  1 -1] (Indices: [2, 3, 4, 5, 6, 9, 11, 19]), Candidate: [2 2 1 0 1 1 0 0 2 0 1 0 1 1 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 82400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  0  1 -1  0  0  1  0 -1  0  0  0  0] (Indices: [2, 3, 4, 5, 6, 10, 14, 15]), Candidate: [ 2  2  1  0  1  1  0  0  1  2 -1  1  1  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  0  0  0  1 -1  1 -1  1 -1  0  0  0] (Indices: [2, 3, 4, 5, 6, 12, 14, 16]), Candidate: [ 2  2  1  0  1  1  0  0  1  1  0  2  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0  0 -1  1 -1  0  0  0  0  0  0  0  0] (Indices: [2, 3, 4, 5, 7, 8, 9, 11]), Candidate: [2 2 1 0 1 0 2 0 1 0 1 0 1 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 82550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0 -1  0  0  0  0  0  0  1 -1  0  1 -1] (Indices: [2, 3, 4, 5, 7, 8, 16, 19]), Candidate: [2 2 1 0 1 0 2 0 0 1 0 1 1 1 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 82600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  0  1  0 -1  1 -1  0  0  0  0  0  0] (Indices: [2, 3, 4, 5, 7, 10, 11, 13]), Candidate: [ 2  2  1  0  1  0  2 -1  1  2  0  0  2  0  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  0  0  1 -1  0  1 -1  0  1 -1  0  0] (Indices: [2, 3, 4, 5, 7, 11, 14, 17]), Candidate: [ 2  2  1  0  1  0  2 -1  1  1  1  0  1  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 82700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  0  0  0  0  0  1  0 -1  1 -1  0  0] (Indices: [2, 3, 4, 5, 7, 14, 15, 17]), Candidate: [ 2  2  1  0  1  0  2 -1  1  1  0  1  1  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1  0 -1  0  0  0  1 -1  1 -1  0  0  0] (Indices: [2, 3, 4, 5, 8, 9, 14, 16]), Candidate: [ 2  2  1  0  1  0  1  1  1  0  0  1  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1 -1  0  1  0  0 -1  0  0  0  0  0  0] (Indices: [2, 3, 4, 5, 8, 11, 12, 13]), Candidate: [2 2 1 0 1 0 1 1 0 1 1 1 1 0 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 82850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1 -1  0  0  0  1  0 -1  1 -1  0  0  0] (Indices: [2, 3, 4, 5, 8, 13, 14, 16]), Candidate: [ 2  2  1  0  1  0  1  1  0  1  0  1  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  1  0 -1  0  1 -1  1 -1  0  0  0  0] (Indices: [2, 3, 4, 5, 9, 10, 13, 15]), Candidate: [ 2  2  1  0  1  0  1  0  2  1 -1  1  2  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  1 -1  0  1  0 -1  0  1 -1  0  0  0] (Indices: [2, 3, 4, 5, 9, 12, 13, 16]), Candidate: [2 2 1 0 1 0 1 0 2 0 0 2 1 0 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 83000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  1 -1  0  0  0  0  0  1  0  0 -1  0] (Indices: [2, 3, 4, 5, 9, 16, 17, 18]), Candidate: [2 2 1 0 1 0 1 0 2 0 0 1 1 1 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 83050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  0  1 -1  1 -1  0  0  0  1  0 -1  0] (Indices: [2, 3, 4, 5, 10, 12, 17, 18]), Candidate: [ 2  2  1  0  1  0  1  0  1  2 -1  2  0  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  0  0  1  0 -1  0  1 -1  1 -1  0  0] (Indices: [2, 3, 4, 5, 11, 12, 15, 17]), Candidate: [2 2 1 0 1 0 1 0 1 1 1 1 0 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 83150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  0  0  0  1  0 -1  1 -1  1 -1  0  0] (Indices: [2, 3, 4, 5, 12, 13, 15, 17]), Candidate: [2 2 1 0 1 0 1 0 1 1 0 2 1 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 83200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  0  0  0  0  0  1  0  0 -1  1 -1  0] (Indices: [2, 3, 4, 5, 14, 15, 16, 18]), Candidate: [2 2 1 0 1 0 1 0 1 1 0 1 1 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 83250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0 -1  0  0  0  1 -1  0  1 -1  0  0  0] (Indices: [2, 3, 4, 6, 7, 8, 13, 16]), Candidate: [2 2 1 0 0 2 1 0 0 1 0 1 2 0 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 83300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  1 -1  0  0  0  1 -1  1 -1  0  0  0] (Indices: [2, 3, 4, 6, 7, 9, 14, 16]), Candidate: [ 2  2  1  0  0  2  1 -1  2  0  0  1  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 83350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  0  0  1  0  0 -1  0  0  0  0  0  0] (Indices: [2, 3, 4, 6, 7, 11, 12, 13]), Candidate: [ 2  2  1  0  0  2  1 -1  1  1  1  1  1  0  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  0  0  0  0  1  0 -1  1 -1  0  0  0] (Indices: [2, 3, 4, 6, 7, 13, 14, 16]), Candidate: [ 2  2  1  0  0  2  1 -1  1  1  0  1  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 83450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1  0 -1  1 -1  0  0  0  0  0  0  1 -1] (Indices: [2, 3, 4, 6, 8, 9, 11, 19]), Candidate: [2 2 1 0 0 2 0 1 1 0 1 0 1 1 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 83500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1 -1  1 -1  0  0  1  0 -1  0  0  0  0] (Indices: [2, 3, 4, 6, 8, 10, 14, 15]), Candidate: [ 2  2  1  0  0  2  0  1  0  2 -1  1  1  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1 -1  0  0  1 -1  1 -1  1 -1  0  0  0] (Indices: [2, 3, 4, 6, 8, 12, 14, 16]), Candidate: [ 2  2  1  0  0  2  0  1  0  1  0  2  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  1  0  0 -1  1 -1  0  0  0  0  0  0] (Indices: [2, 3, 4, 6, 9, 10, 11, 13]), Candidate: [2 2 1 0 0 2 0 0 2 1 0 0 2 0 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 83650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  1 -1  1 -1  0  1 -1  0  1 -1  0  0] (Indices: [2, 3, 4, 6, 9, 11, 14, 17]), Candidate: [ 2  2  1  0  0  2  0  0  2  0  1  0  1  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  1 -1  0  0  0  1  0 -1  1 -1  0  0] (Indices: [2, 3, 4, 6, 9, 14, 15, 17]), Candidate: [2 2 1 0 0 2 0 0 2 0 0 1 1 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 83750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  0  1 -1  1  0 -1  0  0  1 -1  0  0] (Indices: [2, 3, 4, 6, 10, 12, 13, 17]), Candidate: [ 2  2  1  0  0  2  0  0  1  2 -1  2  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  0  1 -1  0  0  0  0  1  0 -1  1 -1] (Indices: [2, 3, 4, 6, 10, 16, 17, 19]), Candidate: [ 2  2  1  0  0  2  0  0  1  2 -1  1  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  0  0  1 -1  0  0  1  0 -1  1 -1  0] (Indices: [2, 3, 4, 6, 11, 15, 16, 18]), Candidate: [2 2 1 0 0 2 0 0 1 1 1 0 1 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 83900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  0  0  0  0  1  0 -1  1 -1  0  1 -1] (Indices: [2, 3, 4, 6, 13, 14, 16, 19]), Candidate: [ 2  2  1  0  0  2  0  0  1  1  0  1  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0  0 -1  0  1 -1  0  0  0  1 -1  0  0] (Indices: [2, 3, 4, 7, 8, 9, 12, 17]), Candidate: [2 2 1 0 0 1 2 0 1 0 0 2 0 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 84000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0 -1  1 -1  0  0  0  1  0 -1  0  0  0] (Indices: [2, 3, 4, 7, 8, 10, 15, 16]), Candidate: [ 2  2  1  0  0  1  2  0  0  2 -1  1  1  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0 -1  0  0  1 -1  0  1 -1  1 -1  0  0] (Indices: [2, 3, 4, 7, 8, 12, 15, 17]), Candidate: [2 2 1 0 0 1 2 0 0 1 0 2 0 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 84100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  1  0  0 -1  0  0  0  0  0  1 -1  0] (Indices: [2, 3, 4, 7, 9, 10, 11, 18]), Candidate: [ 2  2  1  0  0  1  2 -1  2  1  0  0  1  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  1 -1  1 -1  0  0  1 -1  0  1 -1  0] (Indices: [2, 3, 4, 7, 9, 11, 15, 18]), Candidate: [ 2  2  1  0  0  1  2 -1  2  0  1  0  1  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  1 -1  0  0  0  1 -1  1 -1  0  1 -1] (Indices: [2, 3, 4, 7, 9, 14, 16, 19]), Candidate: [ 2  2  1  0  0  1  2 -1  2  0  0  1  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 84250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  0  1 -1  1 -1  1 -1  0  1 -1  0  0] (Indices: [2, 3, 4, 7, 10, 12, 14, 17]), Candidate: [ 2  2  1  0  0  1  2 -1  1  2 -1  2  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 84300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  0  0  1  0  0 -1  0  1 -1  0  0  0] (Indices: [2, 3, 4, 7, 11, 12, 13, 16]), Candidate: [ 2  2  1  0  0  1  2 -1  1  1  1  1  1  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  0  0  1 -1  0  0  0  1  0  0 -1  0] (Indices: [2, 3, 4, 7, 11, 16, 17, 18]), Candidate: [ 2  2  1  0  0  1  2 -1  1  1  1  0  1  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  0  0  0  0  1 -1  1  0 -1  1 -1  0] (Indices: [2, 3, 4, 7, 13, 15, 16, 18]), Candidate: [ 2  2  1  0  0  1  2 -1  1  1  0  1  2  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1  0  0 -1  0  0  0  1  0 -1  0  0  0] (Indices: [2, 3, 4, 8, 9, 10, 15, 16]), Candidate: [ 2  2  1  0  0  1  1  1  1  1 -1  1  1  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1  0 -1  0  1 -1  0  1 -1  1 -1  0  0] (Indices: [2, 3, 4, 8, 9, 12, 15, 17]), Candidate: [2 2 1 0 0 1 1 1 1 0 0 2 0 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 84550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1 -1  1  0  0 -1  0  0  0  0  0  1 -1] (Indices: [2, 3, 4, 8, 10, 11, 12, 19]), Candidate: [2 2 1 0 0 1 1 1 0 2 0 1 0 1 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 84600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1 -1  1 -1  0  1 -1  1 -1  0  1 -1  0] (Indices: [2, 3, 4, 8, 10, 13, 15, 18]), Candidate: [ 2  2  1  0  0  1  1  1  0  2 -1  1  2  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1 -1  0  1 -1  1  0 -1  1 -1  0  0  0] (Indices: [2, 3, 4, 8, 11, 13, 14, 16]), Candidate: [ 2  2  1  0  0  1  1  1  0  1  1  0  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1 -1  0  0  1 -1  1  0 -1  1 -1  0  0] (Indices: [2, 3, 4, 8, 12, 14, 15, 17]), Candidate: [2 2 1 0 0 1 1 1 0 1 0 2 0 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 84750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1 -1  0  0  0  0  0  1  0  0 -1  1 -1] (Indices: [2, 3, 4, 8, 15, 16, 17, 19]), Candidate: [2 2 1 0 0 1 1 1 0 1 0 1 1 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 84800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  1  0 -1  1 -1  0  0  0  1  0 -1  0] (Indices: [2, 3, 4, 9, 10, 12, 17, 18]), Candidate: [ 2  2  1  0  0  1  1  0  2  1 -1  2  0  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  1 -1  1  0 -1  0  1 -1  1 -1  0  0] (Indices: [2, 3, 4, 9, 11, 12, 15, 17]), Candidate: [2 2 1 0 0 1 1 0 2 0 1 1 0 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 84900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  1 -1  0  1  0 -1  1 -1  1 -1  0  0] (Indices: [2, 3, 4, 9, 12, 13, 15, 17]), Candidate: [2 2 1 0 0 1 1 0 2 0 0 2 1 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 84950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  1 -1  0  0  0  1  0  0 -1  1 -1  0] (Indices: [2, 3, 4, 9, 14, 15, 16, 18]), Candidate: [2 2 1 0 0 1 1 0 2 0 0 1 1 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 85000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  0  1  0 -1  0  1  0  0 -1  0  0  0] (Indices: [2, 3, 4, 10, 11, 14, 15, 16]), Candidate: [2 2 1 0 0 1 1 0 1 2 0 0 1 2 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 85050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  0  1 -1  1 -1  0  1 -1  0  1  0 -1] (Indices: [2, 3, 4, 10, 12, 15, 18, 19]), Candidate: [ 2  2  1  0  0  1  1  0  1  2 -1  2  0  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  0  0  1  0  0 -1  0  1 -1  1 -1  0] (Indices: [2, 3, 4, 11, 12, 13, 16, 18]), Candidate: [2 2 1 0 0 1 1 0 1 1 1 1 1 0 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 85150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  0  0  1 -1  0  1  0 -1  0  1  0 -1] (Indices: [2, 3, 4, 11, 14, 15, 18, 19]), Candidate: [2 2 1 0 0 1 1 0 1 1 1 0 1 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 85200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  0  0  0  0  1  0  0 -1  0  1  0 -1] (Indices: [2, 3, 4, 13, 14, 15, 18, 19]), Candidate: [2 2 1 0 0 1 1 0 1 1 0 1 2 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 85250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0 -1  0  0  0  1  0 -1  0  0  0  0  0] (Indices: [2, 3, 5, 6, 7, 8, 13, 14]), Candidate: [ 2  2  1 -1  2  1  1  0  0  1  0  1  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 85300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  1 -1  0  0  1 -1  0  0  0  0  1 -1] (Indices: [2, 3, 5, 6, 7, 9, 13, 19]), Candidate: [ 2  2  1 -1  2  1  1 -1  2  0  0  1  2  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 85350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  0  1 -1  0  0  0  0  0  1 -1  1 -1] (Indices: [2, 3, 5, 6, 7, 10, 17, 19]), Candidate: [ 2  2  1 -1  2  1  1 -1  1  2 -1  1  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 85400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  0  0  0  1 -1  0  0  0  0  1  0 -1] (Indices: [2, 3, 5, 6, 7, 12, 18, 19]), Candidate: [ 2  2  1 -1  2  1  1 -1  1  1  0  2  0  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 85450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1  0 -1  1 -1  0  0  0  0  1 -1  0  0] (Indices: [2, 3, 5, 6, 8, 9, 11, 17]), Candidate: [ 2  2  1 -1  2  1  0  1  1  0  1  0  1  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1 -1  1 -1  0  1 -1  0  0  0  1 -1  0] (Indices: [2, 3, 5, 6, 8, 10, 13, 18]), Candidate: [ 2  2  1 -1  2  1  0  1  0  2 -1  1  2  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 85550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1 -1  0  0  1  0 -1  0  0  0  0  1 -1] (Indices: [2, 3, 5, 6, 8, 12, 13, 19]), Candidate: [ 2  2  1 -1  2  1  0  1  0  1  0  2  1  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1 -1  0  0  0  0  0  0  0  1  0  0 -1] (Indices: [2, 3, 5, 6, 8, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  1  0  1  0  1  0  1  1  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  1 -1  1 -1  0  1  0 -1  0  0  0  0] (Indices: [2, 3, 5, 6, 9, 11, 14, 15]), Candidate: [ 2  2  1 -1  2  1  0  0  2  0  1  0  1  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  1 -1  0  0  1 -1  0  0  0  1  0 -1] (Indices: [2, 3, 5, 6, 9, 13, 18, 19]), Candidate: [ 2  2  1 -1  2  1  0  0  2  0  0  1  2  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  0  1 -1  1  0 -1  1 -1  0  0  0  0] (Indices: [2, 3, 5, 6, 10, 12, 13, 15]), Candidate: [ 2  2  1 -1  2  1  0  0  1  2 -1  2  1  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 85800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  0  1 -1  0  0  0  1 -1  0  1  0 -1] (Indices: [2, 3, 5, 6, 10, 15, 18, 19]), Candidate: [ 2  2  1 -1  2  1  0  0  1  2 -1  1  1  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 85850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  0  0  1 -1  0  1 -1  0  0  1  0 -1] (Indices: [2, 3, 5, 6, 11, 14, 18, 19]), Candidate: [ 2  2  1 -1  2  1  0  0  1  1  1  0  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 85900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  0  0  0  0  1  0 -1  1  0 -1  0  0] (Indices: [2, 3, 5, 6, 13, 14, 16, 17]), Candidate: [ 2  2  1 -1  2  1  0  0  1  1  0  1  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 85950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0  0 -1  0  1 -1  0  1 -1  0  0  0  0] (Indices: [2, 3, 5, 7, 8, 9, 12, 15]), Candidate: [ 2  2  1 -1  2  0  2  0  1  0  0  2  0  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0 -1  1 -1  0  0  1 -1  0  0  1 -1  0] (Indices: [2, 3, 5, 7, 8, 10, 14, 18]), Candidate: [ 2  2  1 -1  2  0  2  0  0  2 -1  1  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 86050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0 -1  0  0  1 -1  1 -1  0  0  0  1 -1] (Indices: [2, 3, 5, 7, 8, 12, 14, 19]), Candidate: [ 2  2  1 -1  2  0  2  0  0  1  0  2  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 86100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  1  0  0 -1  0  0  0  1 -1  0  0  0] (Indices: [2, 3, 5, 7, 9, 10, 11, 16]), Candidate: [ 2  2  1 -1  2  0  2 -1  2  1  0  0  1  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 86150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  1 -1  1 -1  0  0  1  0 -1  0  0  0] (Indices: [2, 3, 5, 7, 9, 11, 15, 16]), Candidate: [ 2  2  1 -1  2  0  2 -1  2  0  1  0  1  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 86200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  1 -1  0  0  0  1 -1  1  0 -1  0  0] (Indices: [2, 3, 5, 7, 9, 14, 16, 17]), Candidate: [ 2  2  1 -1  2  0  2 -1  2  0  0  1  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 86250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  0  1 -1  1 -1  1  0 -1  0  0  0  0] (Indices: [2, 3, 5, 7, 10, 12, 14, 15]), Candidate: [ 2  2  1 -1  2  0  2 -1  1  2 -1  2  0  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 86300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  0  0  1  0  0  0 -1  0  0  0  0  0] (Indices: [2, 3, 5, 7, 11, 12, 13, 14]), Candidate: [ 2  2  1 -1  2  0  2 -1  1  1  1  1  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 86350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  0  0  1 -1  0  0  1 -1  1 -1  1 -1] (Indices: [2, 3, 5, 7, 11, 15, 17, 19]), Candidate: [ 2  2  1 -1  2  0  2 -1  1  1  1  0  1  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 86400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  0  0  0  0  1  0 -1  0  0  1  0 -1] (Indices: [2, 3, 5, 7, 13, 14, 18, 19]), Candidate: [ 2  2  1 -1  2  0  2 -1  1  1  0  1  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 86450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1  0  0 -1  0  0  1 -1  0  0  1 -1  0] (Indices: [2, 3, 5, 8, 9, 10, 14, 18]), Candidate: [ 2  2  1 -1  2  0  1  1  1  1 -1  1  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 86500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1  0 -1  0  1 -1  1 -1  0  0  0  1 -1] (Indices: [2, 3, 5, 8, 9, 12, 14, 19]), Candidate: [ 2  2  1 -1  2  0  1  1  1  0  0  2  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 86550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1 -1  1  0  0 -1  0  0  0  1 -1  0  0] (Indices: [2, 3, 5, 8, 10, 11, 12, 17]), Candidate: [ 2  2  1 -1  2  0  1  1  0  2  0  1  0  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1 -1  1 -1  0  1 -1  1  0 -1  0  0  0] (Indices: [2, 3, 5, 8, 10, 13, 15, 16]), Candidate: [ 2  2  1 -1  2  0  1  1  0  2 -1  1  2  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 86650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1 -1  0  1  0 -1  0  0  0  0  1  0 -1] (Indices: [2, 3, 5, 8, 11, 12, 18, 19]), Candidate: [ 2  2  1 -1  2  0  1  1  0  1  1  1  0  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1 -1  0  0  1  0 -1  0  0  0  1  0 -1] (Indices: [2, 3, 5, 8, 12, 13, 18, 19]), Candidate: [ 2  2  1 -1  2  0  1  1  0  1  0  2  1  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1 -1  0  0  0  0  1 -1  0  1  0  0 -1] (Indices: [2, 3, 5, 8, 14, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  0  1  1  0  1  0  1  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 86800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  1  0 -1  1 -1  0  0  1 -1  1 -1  0] (Indices: [2, 3, 5, 9, 10, 12, 16, 18]), Candidate: [ 2  2  1 -1  2  0  1  0  2  1 -1  2  0  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 86850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  1 -1  1  0 -1  1 -1  0  0  0  1 -1] (Indices: [2, 3, 5, 9, 11, 12, 14, 19]), Candidate: [ 2  2  1 -1  2  0  1  0  2  0  1  1  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 86900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  1 -1  0  1  0  0 -1  0  0  0  1 -1] (Indices: [2, 3, 5, 9, 12, 13, 14, 19]), Candidate: [ 2  2  1 -1  2  0  1  0  2  0  0  2  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 86950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  1 -1  0  0  1 -1  0  0  1  0  0 -1] (Indices: [2, 3, 5, 9, 13, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  0  1  0  2  0  0  1  2  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  0  1  0 -1  1 -1  0  0  1 -1  1 -1] (Indices: [2, 3, 5, 10, 11, 13, 17, 19]), Candidate: [ 2  2  1 -1  2  0  1  0  1  2  0  0  2  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  0  1 -1  1 -1  0  1 -1  1  0 -1  0] (Indices: [2, 3, 5, 10, 12, 15, 17, 18]), Candidate: [ 2  2  1 -1  2  0  1  0  1  2 -1  2  0  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 87100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  0  0  1  0  0 -1  1 -1  0  0  1 -1] (Indices: [2, 3, 5, 11, 12, 13, 15, 19]), Candidate: [ 2  2  1 -1  2  0  1  0  1  1  1  1  1  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  0  0  1 -1  0  1  0 -1  1  0 -1  0] (Indices: [2, 3, 5, 11, 14, 15, 17, 18]), Candidate: [ 2  2  1 -1  2  0  1  0  1  1  1  0  1  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  0  0  0  0  1  0  0 -1  1  0 -1  0] (Indices: [2, 3, 5, 13, 14, 15, 17, 18]), Candidate: [ 2  2  1 -1  2  0  1  0  1  1  0  1  2  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0  0 -1  0  0  0  1 -1  0  1 -1  0  0] (Indices: [2, 3, 6, 7, 8, 9, 14, 17]), Candidate: [ 2  2  1 -1  1  2  1  0  1  0  0  1  1  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 87300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0 -1  0  1  0 -1  1 -1  0  0  0  0  0] (Indices: [2, 3, 6, 7, 8, 11, 12, 14]), Candidate: [ 2  2  1 -1  1  2  1  0  0  1  1  1  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 87350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0 -1  0  0  0  1  0 -1  0  1 -1  0  0] (Indices: [2, 3, 6, 7, 8, 13, 14, 17]), Candidate: [ 2  2  1 -1  1  2  1  0  0  1  0  1  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 87400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  1  0 -1  0  1 -1  0  1 -1  0  0  0] (Indices: [2, 3, 6, 7, 9, 10, 13, 16]), Candidate: [ 2  2  1 -1  1  2  1 -1  2  1 -1  1  2  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 87450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  1 -1  0  1  0 -1  0  0  1 -1  0  0] (Indices: [2, 3, 6, 7, 9, 12, 13, 17]), Candidate: [ 2  2  1 -1  1  2  1 -1  2  0  0  2  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 87500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  1 -1  0  0  0  0  0  1  0 -1  1 -1] (Indices: [2, 3, 6, 7, 9, 16, 17, 19]), Candidate: [ 2  2  1 -1  1  2  1 -1  2  0  0  1  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 87550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  0  1 -1  1 -1  0  0  0  1 -1  1 -1] (Indices: [2, 3, 6, 7, 10, 12, 17, 19]), Candidate: [ 2  2  1 -1  1  2  1 -1  1  2 -1  2  0  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 87600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  0  0  1  0 -1  0  1 -1  0  1 -1  0] (Indices: [2, 3, 6, 7, 11, 12, 15, 18]), Candidate: [ 2  2  1 -1  1  2  1 -1  1  1  1  1  0  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 87650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  0  0  0  1  0 -1  1 -1  0  1 -1  0] (Indices: [2, 3, 6, 7, 12, 13, 15, 18]), Candidate: [ 2  2  1 -1  1  2  1 -1  1  1  0  2  1  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 87700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  0  0  0  0  0  1  0  0 -1  0  1 -1] (Indices: [2, 3, 6, 7, 14, 15, 16, 19]), Candidate: [ 2  2  1 -1  1  2  1 -1  1  1  0  1  1  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 87750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1  0 -1  1  0 -1  1 -1  0  0  0  0  0] (Indices: [2, 3, 6, 8, 9, 11, 12, 14]), Candidate: [ 2  2  1 -1  1  2  0  1  1  0  1  1  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 87800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1  0 -1  0  0  1  0 -1  0  1 -1  0  0] (Indices: [2, 3, 6, 8, 9, 13, 14, 17]), Candidate: [ 2  2  1 -1  1  2  0  1  1  0  0  1  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 87850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1 -1  1  0 -1  0  1 -1  0  0  0  1 -1] (Indices: [2, 3, 6, 8, 10, 11, 14, 19]), Candidate: [ 2  2  1 -1  1  2  0  1  0  2  0  0  1  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 87900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1 -1  1 -1  0  0  1  0 -1  0  0  1 -1] (Indices: [2, 3, 6, 8, 10, 14, 15, 19]), Candidate: [ 2  2  1 -1  1  2  0  1  0  2 -1  1  1  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 87950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1 -1  0  1 -1  1 -1  0  0  1  0 -1  0] (Indices: [2, 3, 6, 8, 11, 13, 17, 18]), Candidate: [ 2  2  1 -1  1  2  0  1  0  1  1  0  2  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1 -1  0  0  1 -1  0  1  0 -1  0  1 -1] (Indices: [2, 3, 6, 8, 12, 15, 16, 19]), Candidate: [ 2  2  1 -1  1  2  0  1  0  1  0  2  0  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  1  0  0 -1  1  0 -1  0  0  0  0  0] (Indices: [2, 3, 6, 9, 10, 11, 13, 14]), Candidate: [ 2  2  1 -1  1  2  0  0  2  1  0  0  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 88100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  1  0 -1  0  1 -1  1 -1  0  0  1 -1] (Indices: [2, 3, 6, 9, 10, 13, 15, 19]), Candidate: [ 2  2  1 -1  1  2  0  0  2  1 -1  1  2  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 88150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  1 -1  1 -1  1  0 -1  0  1 -1  0  0] (Indices: [2, 3, 6, 9, 11, 13, 14, 17]), Candidate: [ 2  2  1 -1  1  2  0  0  2  0  1  0  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 88200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  1 -1  0  1 -1  1  0 -1  0  1 -1  0] (Indices: [2, 3, 6, 9, 12, 14, 15, 18]), Candidate: [ 2  2  1 -1  1  2  0  0  2  0  0  2  0  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  1 -1  0  0  0  0  1  0 -1  1  0 -1] (Indices: [2, 3, 6, 9, 15, 16, 18, 19]), Candidate: [ 2  2  1 -1  1  2  0  0  2  0  0  1  1  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  0  1  0 -1  0  0  1  0 -1  1 -1  0] (Indices: [2, 3, 6, 10, 11, 15, 16, 18]), Candidate: [ 2  2  1 -1  1  2  0  0  1  2  0  0  1  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  0  1 -1  0  1  0 -1  1 -1  0  1 -1] (Indices: [2, 3, 6, 10, 13, 14, 16, 19]), Candidate: [ 2  2  1 -1  1  2  0  0  1  2 -1  1  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 88400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  0  0  1  0 -1  1 -1  1 -1  0  1 -1] (Indices: [2, 3, 6, 11, 12, 14, 16, 19]), Candidate: [ 2  2  1 -1  1  2  0  0  1  1  1  1  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 88450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  0  0  0  1  0  0  0 -1  1 -1  0  0] (Indices: [2, 3, 6, 12, 13, 14, 15, 17]), Candidate: [ 2  2  1 -1  1  2  0  0  1  1  0  2  1  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  0  0  0  0  0  1  0  0  0 -1  1 -1] (Indices: [2, 3, 6, 14, 15, 16, 17, 19]), Candidate: [ 2  2  1 -1  1  2  0  0  1  1  0  1  1  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0  0 -1  1 -1  1 -1  0  1 -1  0  0  0] (Indices: [2, 3, 7, 8, 9, 11, 13, 16]), Candidate: [ 2  2  1 -1  1  1  2  0  1  0  1  0  2  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0  0 -1  0  0  1 -1  0  1 -1  1 -1  0] (Indices: [2, 3, 7, 8, 9, 13, 16, 18]), Candidate: [ 2  2  1 -1  1  1  2  0  1  0  0  1  2  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0 -1  1  0 -1  0  0  0  0  1  0 -1  0] (Indices: [2, 3, 7, 8, 10, 11, 17, 18]), Candidate: [ 2  2  1 -1  1  1  2  0  0  2  0  0  1  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0 -1  1 -1  0  0  0  1  0 -1  1 -1  0] (Indices: [2, 3, 7, 8, 10, 15, 16, 18]), Candidate: [ 2  2  1 -1  1  1  2  0  0  2 -1  1  1  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 88750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0 -1  0  1 -1  0  1 -1  1 -1  1 -1  0] (Indices: [2, 3, 7, 8, 11, 14, 16, 18]), Candidate: [ 2  2  1 -1  1  1  2  0  0  1  1  0  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 88800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0 -1  0  0  0  1  0  0  0 -1  0  0  0] (Indices: [2, 3, 7, 8, 13, 14, 15, 16]), Candidate: [ 2  2  1 -1  1  1  2  0  0  1  0  1  2  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  1  0  0 -1  0  1 -1  0  1 -1  0  0] (Indices: [2, 3, 7, 9, 10, 11, 14, 17]), Candidate: [ 2  2  1 -1  1  1  2 -1  2  1  0  0  1  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 88900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  1  0 -1  0  0  1  0 -1  1 -1  0  0] (Indices: [2, 3, 7, 9, 10, 14, 15, 17]), Candidate: [ 2  2  1 -1  1  1  2 -1  2  1 -1  1  1  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 88950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  1 -1  1 -1  1 -1  0  1 -1  1 -1  0] (Indices: [2, 3, 7, 9, 11, 13, 16, 18]), Candidate: [ 2  2  1 -1  1  1  2 -1  2  0  1  0  2  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 89000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  1 -1  0  1 -1  0  1  0  0 -1  0  0] (Indices: [2, 3, 7, 9, 12, 15, 16, 17]), Candidate: [ 2  2  1 -1  1  1  2 -1  2  0  0  2  0  1  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 89050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  0  1  0  0  0 -1  0  0  0  0  1 -1] (Indices: [2, 3, 7, 10, 11, 12, 13, 19]), Candidate: [ 2  2  1 -1  1  1  2 -1  1  2  0  1  1  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 89100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  0  1  0 -1  0  0  0  0  1  0  0 -1] (Indices: [2, 3, 7, 10, 11, 17, 18, 19]), Candidate: [ 2  2  1 -1  1  1  2 -1  1  2  0  0  1  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 89150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  0  1 -1  0  1 -1  1 -1  1 -1  1 -1] (Indices: [2, 3, 7, 10, 13, 15, 17, 19]), Candidate: [ 2  2  1 -1  1  1  2 -1  1  2 -1  1  2  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 89200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  0  0  1  0 -1  0  1 -1  1 -1  1 -1] (Indices: [2, 3, 7, 11, 12, 15, 17, 19]), Candidate: [ 2  2  1 -1  1  1  2 -1  1  1  1  1  0  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 89250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  0  0  0  1  0  0 -1  0  0  1  0 -1] (Indices: [2, 3, 7, 12, 13, 14, 18, 19]), Candidate: [ 2  2  1 -1  1  1  2 -1  1  1  0  2  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 89300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1  0  0  0  0 -1  0  0  1 -1  0  0  0] (Indices: [2, 3, 8, 9, 10, 11, 12, 16]), Candidate: [ 2  2  1 -1  1  1  1  1  1  1  0  1  0  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1  0  0 -1  0  1  0 -1  0  0  0  1 -1] (Indices: [2, 3, 8, 9, 10, 13, 14, 19]), Candidate: [ 2  2  1 -1  1  1  1  1  1  1 -1  1  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 89400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1  0 -1  1  0 -1  0  0  0  1 -1  1 -1] (Indices: [2, 3, 8, 9, 11, 12, 17, 19]), Candidate: [ 2  2  1 -1  1  1  1  1  1  0  1  1  0  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1  0 -1  0  1  0 -1  0  0  1 -1  1 -1] (Indices: [2, 3, 8, 9, 12, 13, 17, 19]), Candidate: [ 2  2  1 -1  1  1  1  1  1  0  0  2  1  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1  0 -1  0  0  0  1 -1  1 -1  1  0 -1] (Indices: [2, 3, 8, 9, 14, 16, 18, 19]), Candidate: [ 2  2  1 -1  1  1  1  1  1  0  0  1  1  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 89550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1 -1  1  0 -1  0  1 -1  0  1  0 -1  0] (Indices: [2, 3, 8, 10, 11, 14, 17, 18]), Candidate: [ 2  2  1 -1  1  1  1  1  0  2  0  0  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 89600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1 -1  1 -1  0  1  0  0 -1  0  1 -1  0] (Indices: [2, 3, 8, 10, 13, 14, 15, 18]), Candidate: [ 2  2  1 -1  1  1  1  1  0  2 -1  1  2  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 89650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1 -1  0  1  0 -1  1  0 -1  0  1 -1  0] (Indices: [2, 3, 8, 11, 12, 14, 15, 18]), Candidate: [ 2  2  1 -1  1  1  1  1  0  1  1  1  0  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1 -1  0  1 -1  0  0  1  0 -1  1  0 -1] (Indices: [2, 3, 8, 11, 15, 16, 18, 19]), Candidate: [ 2  2  1 -1  1  1  1  1  0  1  1  0  1  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1 -1  0  0  0  1 -1  1  0 -1  1  0 -1] (Indices: [2, 3, 8, 13, 15, 16, 18, 19]), Candidate: [ 2  2  1 -1  1  1  1  1  0  1  0  1  2  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  1  0  0 -1  0  1 -1  1 -1  1 -1  0] (Indices: [2, 3, 9, 10, 11, 14, 16, 18]), Candidate: [ 2  2  1 -1  1  1  1  0  2  1  0  0  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 89850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  1  0 -1  0  1  0  0  0 -1  0  0  0] (Indices: [2, 3, 9, 10, 13, 14, 15, 16]), Candidate: [ 2  2  1 -1  1  1  1  0  2  1 -1  1  2  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 89900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  1 -1  1  0 -1  1  0  0 -1  0  0  0] (Indices: [2, 3, 9, 11, 12, 14, 15, 16]), Candidate: [ 2  2  1 -1  1  1  1  0  2  0  1  1  0  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  1 -1  1 -1  0  0  1  0  0  0 -1  0] (Indices: [2, 3, 9, 11, 15, 16, 17, 18]), Candidate: [ 2  2  1 -1  1  1  1  0  2  0  1  0  1  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  1 -1  0  0  1 -1  1  0  0  0 -1  0] (Indices: [2, 3, 9, 13, 15, 16, 17, 18]), Candidate: [ 2  2  1 -1  1  1  1  0  2  0  0  1  2  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  0  1  0 -1  1  0 -1  1  0 -1  0  0] (Indices: [2, 3, 10, 11, 13, 14, 16, 17]), Candidate: [ 2  2  1 -1  1  1  1  0  1  2  0  0  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 90100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  0  1 -1  1  0 -1  0  0  1  0  0 -1] (Indices: [2, 3, 10, 12, 13, 17, 18, 19]), Candidate: [ 2  2  1 -1  1  1  1  0  1  2 -1  2  1  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 90150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  0  0  1  0  0 -1  1 -1  1  0 -1  0] (Indices: [2, 3, 11, 12, 13, 15, 17, 18]), Candidate: [ 2  2  1 -1  1  1  1  0  1  1  1  1  1  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  0  0  0  1  0  0 -1  1  0 -1  1 -1] (Indices: [2, 3, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  2  1 -1  1  1  1  0  1  1  0  2  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 90250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0 -1  0  0  1 -1  0  1 -1  0  0  0  0] (Indices: [2, 4, 5, 6, 7, 8, 12, 15]), Candidate: [2 2 0 1 1 1 1 0 0 1 0 2 0 1 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 90300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  1 -1  0  0  1  0 -1  0  0  0  0  0] (Indices: [2, 4, 5, 6, 7, 9, 13, 14]), Candidate: [ 2  2  0  1  1  1  1 -1  2  0  0  1  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 90350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  0  1 -1  0  0  0  1 -1  0  0  1 -1] (Indices: [2, 4, 5, 6, 7, 10, 15, 19]), Candidate: [ 2  2  0  1  1  1  1 -1  1  2 -1  1  1  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 90400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  0  0  0  1 -1  0  0  1  0 -1  0  0] (Indices: [2, 4, 5, 6, 7, 12, 16, 17]), Candidate: [ 2  2  0  1  1  1  1 -1  1  1  0  2  0  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1  0 -1  1  0 -1  0  0  0  0  0  0  0] (Indices: [2, 4, 5, 6, 8, 9, 11, 12]), Candidate: [2 2 0 1 1 1 0 1 1 0 1 1 0 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 90500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1 -1  1 -1  1 -1  0  0  0  0  0  1 -1] (Indices: [2, 4, 5, 6, 8, 10, 12, 19]), Candidate: [ 2  2  0  1  1  1  0  1  0  2 -1  2  0  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1 -1  0  0  1  0  0 -1  0  0  0  0  0] (Indices: [2, 4, 5, 6, 8, 12, 13, 14]), Candidate: [ 2  2  0  1  1  1  0  1  0  1  0  2  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1 -1  0  0  0  0  0  1 -1  1 -1  1 -1] (Indices: [2, 4, 5, 6, 8, 15, 17, 19]), Candidate: [2 2 0 1 1 1 0 1 0 1 0 1 1 1 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 90650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  1 -1  1 -1  1 -1  1 -1  0  0  0  0] (Indices: [2, 4, 5, 6, 9, 11, 13, 15]), Candidate: [2 2 0 1 1 1 0 0 2 0 1 0 2 0 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 90700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  1 -1  0  0  1 -1  0  1  0 -1  0  0] (Indices: [2, 4, 5, 6, 9, 13, 16, 17]), Candidate: [2 2 0 1 1 1 0 0 2 0 0 1 2 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 90750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  0  1  0 -1  0  0  0  1 -1  0  1 -1] (Indices: [2, 4, 5, 6, 10, 11, 16, 19]), Candidate: [2 2 0 1 1 1 0 0 1 2 0 0 1 1 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 90800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  0  1 -1  0  0  0  1  0  0 -1  0  0] (Indices: [2, 4, 5, 6, 10, 15, 16, 17]), Candidate: [ 2  2  0  1  1  1  0  0  1  2 -1  1  1  1  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  0  0  1 -1  0  1 -1  1  0 -1  0  0] (Indices: [2, 4, 5, 6, 11, 14, 16, 17]), Candidate: [ 2  2  0  1  1  1  0  0  1  1  1  0  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  0  0  0  1 -1  0  0  0  1  0  0 -1] (Indices: [2, 4, 5, 6, 12, 17, 18, 19]), Candidate: [2 2 0 1 1 1 0 0 1 1 0 2 0 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 90950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0  0 -1  1 -1  0  0  0  0  1 -1  0  0] (Indices: [2, 4, 5, 7, 8, 9, 11, 17]), Candidate: [2 2 0 1 1 0 2 0 1 0 1 0 1 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 91000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0 -1  1 -1  0  1 -1  0  0  0  1 -1  0] (Indices: [2, 4, 5, 7, 8, 10, 13, 18]), Candidate: [ 2  2  0  1  1  0  2  0  0  2 -1  1  2  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0 -1  0  0  1  0 -1  0  0  0  0  1 -1] (Indices: [2, 4, 5, 7, 8, 12, 13, 19]), Candidate: [2 2 0 1 1 0 2 0 0 1 0 2 1 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 91100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0 -1  0  0  0  0  0  0  0  1  0  0 -1] (Indices: [2, 4, 5, 7, 8, 17, 18, 19]), Candidate: [2 2 0 1 1 0 2 0 0 1 0 1 1 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 91150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  1 -1  1 -1  0  1  0 -1  0  0  0  0] (Indices: [2, 4, 5, 7, 9, 11, 14, 15]), Candidate: [ 2  2  0  1  1  0  2 -1  2  0  1  0  1  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  1 -1  0  0  1 -1  0  0  0  1  0 -1] (Indices: [2, 4, 5, 7, 9, 13, 18, 19]), Candidate: [ 2  2  0  1  1  0  2 -1  2  0  0  1  2  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  0  1 -1  1  0 -1  1 -1  0  0  0  0] (Indices: [2, 4, 5, 7, 10, 12, 13, 15]), Candidate: [ 2  2  0  1  1  0  2 -1  1  2 -1  2  1  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 91300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  0  1 -1  0  0  0  1 -1  0  1  0 -1] (Indices: [2, 4, 5, 7, 10, 15, 18, 19]), Candidate: [ 2  2  0  1  1  0  2 -1  1  2 -1  1  1  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 91350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  0  0  1 -1  0  1 -1  0  0  1  0 -1] (Indices: [2, 4, 5, 7, 11, 14, 18, 19]), Candidate: [ 2  2  0  1  1  0  2 -1  1  1  1  0  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 91400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  0  0  0  0  1  0 -1  1  0 -1  0  0] (Indices: [2, 4, 5, 7, 13, 14, 16, 17]), Candidate: [ 2  2  0  1  1  0  2 -1  1  1  0  1  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 91450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1  0  0 -1  0  1 -1  0  0  0  1 -1  0] (Indices: [2, 4, 5, 8, 9, 10, 13, 18]), Candidate: [ 2  2  0  1  1  0  1  1  1  1 -1  1  2  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1  0 -1  0  1  0 -1  0  0  0  0  1 -1] (Indices: [2, 4, 5, 8, 9, 12, 13, 19]), Candidate: [2 2 0 1 1 0 1 1 1 0 0 2 1 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 91550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1  0 -1  0  0  0  0  0  0  1  0  0 -1] (Indices: [2, 4, 5, 8, 9, 17, 18, 19]), Candidate: [2 2 0 1 1 0 1 1 1 0 0 1 1 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 91600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1 -1  1 -1  0  1  0  0 -1  0  0  0  0] (Indices: [2, 4, 5, 8, 10, 13, 14, 15]), Candidate: [ 2  2  0  1  1  0  1  1  0  2 -1  1  2  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1 -1  0  1  0 -1  0  0  1  0 -1  0  0] (Indices: [2, 4, 5, 8, 11, 12, 16, 17]), Candidate: [2 2 0 1 1 0 1 1 0 1 1 1 0 1 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 91700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1 -1  0  0  1  0 -1  0  1  0 -1  0  0] (Indices: [2, 4, 5, 8, 12, 13, 16, 17]), Candidate: [2 2 0 1 1 0 1 1 0 1 0 2 1 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 91750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1 -1  0  0  0  0  1  0 -1  1 -1  1 -1] (Indices: [2, 4, 5, 8, 14, 15, 17, 19]), Candidate: [2 2 0 1 1 0 1 1 0 1 0 1 1 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 91800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  1  0 -1  1 -1  0  1  0 -1  0  0  0] (Indices: [2, 4, 5, 9, 10, 12, 15, 16]), Candidate: [ 2  2  0  1  1  0  1  0  2  1 -1  2  0  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  1 -1  1  0  0 -1  0  0  0  0  1 -1] (Indices: [2, 4, 5, 9, 11, 12, 13, 19]), Candidate: [2 2 0 1 1 0 1 0 2 0 1 1 1 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 91900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  1 -1  1 -1  0  0  0  0  1  0  0 -1] (Indices: [2, 4, 5, 9, 11, 17, 18, 19]), Candidate: [2 2 0 1 1 0 1 0 2 0 1 0 1 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 91950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  1 -1  0  0  1 -1  1 -1  1 -1  1 -1] (Indices: [2, 4, 5, 9, 13, 15, 17, 19]), Candidate: [2 2 0 1 1 0 1 0 2 0 0 1 2 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 92000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  0  1  0 -1  1 -1  1 -1  0  0  1 -1] (Indices: [2, 4, 5, 10, 11, 13, 15, 19]), Candidate: [2 2 0 1 1 0 1 0 1 2 0 0 2 0 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 92050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  0  1 -1  1 -1  1 -1  0  1 -1  1 -1] (Indices: [2, 4, 5, 10, 12, 14, 17, 19]), Candidate: [ 2  2  0  1  1  0  1  0  1  2 -1  2  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 92100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  0  0  1  0  0  0 -1  0  0  1 -1  0] (Indices: [2, 4, 5, 11, 12, 13, 14, 18]), Candidate: [ 2  2  0  1  1  0  1  0  1  1  1  1  1  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  0  0  1 -1  1 -1  0  1 -1  1  0 -1] (Indices: [2, 4, 5, 11, 13, 16, 18, 19]), Candidate: [2 2 0 1 1 0 1 0 1 1 1 0 2 0 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 92200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  0  0  0  1 -1  0  1 -1  1  0  0 -1] (Indices: [2, 4, 5, 12, 15, 17, 18, 19]), Candidate: [2 2 0 1 1 0 1 0 1 1 0 2 0 1 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 92250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0  0 -1  0  0  1 -1  0  0  1 -1  0  0] (Indices: [2, 4, 6, 7, 8, 9, 13, 17]), Candidate: [2 2 0 1 0 2 1 0 1 0 0 1 2 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 92300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0 -1  1 -1  0  0  0  0  1 -1  0  1 -1] (Indices: [2, 4, 6, 7, 8, 10, 16, 19]), Candidate: [ 2  2  0  1  0  2  1  0  0  2 -1  1  1  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0 -1  0  0  1 -1  0  0  0  1  0 -1  0] (Indices: [2, 4, 6, 7, 8, 12, 17, 18]), Candidate: [2 2 0 1 0 2 1 0 0 1 0 2 0 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 92400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  1  0 -1  1 -1  0  0  0  1 -1  0  0] (Indices: [2, 4, 6, 7, 9, 10, 12, 17]), Candidate: [ 2  2  0  1  0  2  1 -1  2  1 -1  2  0  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 92450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  1 -1  1 -1  0  0  0  0  1 -1  1 -1] (Indices: [2, 4, 6, 7, 9, 11, 17, 19]), Candidate: [ 2  2  0  1  0  2  1 -1  2  0  1  0  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  1 -1  0  0  0  0  1  0 -1  0  1 -1] (Indices: [2, 4, 6, 7, 9, 15, 16, 19]), Candidate: [ 2  2  0  1  0  2  1 -1  2  0  0  1  1  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  0  1 -1  1 -1  0  1 -1  0  0  1 -1] (Indices: [2, 4, 6, 7, 10, 12, 15, 19]), Candidate: [ 2  2  0  1  0  2  1 -1  1  2 -1  2  0  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 92600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  0  0  1  0 -1  1 -1  0  1 -1  0  0] (Indices: [2, 4, 6, 7, 11, 12, 14, 17]), Candidate: [ 2  2  0  1  0  2  1 -1  1  1  1  1  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 92650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  0  0  0  1  0  0 -1  0  1 -1  0  0] (Indices: [2, 4, 6, 7, 12, 13, 14, 17]), Candidate: [ 2  2  0  1  0  2  1 -1  1  1  0  2  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 92700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  0  0  0  0  1 -1  0  1  0 -1  1 -1] (Indices: [2, 4, 6, 7, 13, 16, 17, 19]), Candidate: [ 2  2  0  1  0  2  1 -1  1  1  0  1  2  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1  0  0 -1  0  0  0  0  1 -1  0  1 -1] (Indices: [2, 4, 6, 8, 9, 10, 16, 19]), Candidate: [ 2  2  0  1  0  2  0  1  1  1 -1  1  1  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1  0 -1  0  1 -1  0  0  0  1  0 -1  0] (Indices: [2, 4, 6, 8, 9, 12, 17, 18]), Candidate: [2 2 0 1 0 2 0 1 1 0 0 2 0 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 92850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1 -1  1  0 -1  1 -1  0  0  0  0  1 -1] (Indices: [2, 4, 6, 8, 10, 11, 13, 19]), Candidate: [2 2 0 1 0 2 0 1 0 2 0 0 2 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 92900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1 -1  1 -1  0  1 -1  0  0  1 -1  1 -1] (Indices: [2, 4, 6, 8, 10, 13, 17, 19]), Candidate: [ 2  2  0  1  0  2  0  1  0  2 -1  1  2  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1 -1  0  1 -1  1 -1  1 -1  0  1 -1  0] (Indices: [2, 4, 6, 8, 11, 13, 15, 18]), Candidate: [2 2 0 1 0 2 0 1 0 1 1 0 2 0 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 93000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1 -1  0  0  1 -1  1 -1  0  1  0 -1  0] (Indices: [2, 4, 6, 8, 12, 14, 17, 18]), Candidate: [ 2  2  0  1  0  2  0  1  0  1  0  2  0  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  1  0  0  0 -1  0  1 -1  0  0  0  0] (Indices: [2, 4, 6, 9, 10, 11, 12, 15]), Candidate: [2 2 0 1 0 2 0 0 2 1 0 1 0 1 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 93100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  1  0 -1  0  1  0 -1  0  0  1 -1  0] (Indices: [2, 4, 6, 9, 10, 13, 14, 18]), Candidate: [ 2  2  0  1  0  2  0  0  2  1 -1  1  2  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 93150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  1 -1  1  0 -1  0  0  0  1  0 -1  0] (Indices: [2, 4, 6, 9, 11, 12, 17, 18]), Candidate: [2 2 0 1 0 2 0 0 2 0 1 1 0 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 93200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  1 -1  0  1  0 -1  0  0  1  0 -1  0] (Indices: [2, 4, 6, 9, 12, 13, 17, 18]), Candidate: [2 2 0 1 0 2 0 0 2 0 0 2 1 0 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 93250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  1 -1  0  0  0  1 -1  1  0 -1  1 -1] (Indices: [2, 4, 6, 9, 14, 16, 17, 19]), Candidate: [ 2  2  0  1  0  2  0  0  2  0  0  1  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  0  1  0 -1  0  1 -1  1 -1  0  1 -1] (Indices: [2, 4, 6, 10, 11, 14, 16, 19]), Candidate: [ 2  2  0  1  0  2  0  0  1  2  0  0  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  0  1 -1  0  1  0  0 -1  1 -1  0  0] (Indices: [2, 4, 6, 10, 13, 14, 15, 17]), Candidate: [ 2  2  0  1  0  2  0  0  1  2 -1  1  2  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  0  0  1  0 -1  1  0 -1  1 -1  0  0] (Indices: [2, 4, 6, 11, 12, 14, 15, 17]), Candidate: [2 2 0 1 0 2 0 0 1 1 1 1 0 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 93450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  0  0  1 -1  0  0  1  0  0 -1  1 -1] (Indices: [2, 4, 6, 11, 15, 16, 17, 19]), Candidate: [2 2 0 1 0 2 0 0 1 1 1 0 1 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 93500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  0  0  0  0  1 -1  1  0  0 -1  1 -1] (Indices: [2, 4, 6, 13, 15, 16, 17, 19]), Candidate: [2 2 0 1 0 2 0 0 1 1 0 1 2 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 93550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0  0 -1  1  0 -1  0  0  0  1 -1  0  0] (Indices: [2, 4, 7, 8, 9, 11, 12, 17]), Candidate: [2 2 0 1 0 1 2 0 1 0 1 1 0 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 93600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0  0 -1  0  0  1 -1  1  0 -1  0  0  0] (Indices: [2, 4, 7, 8, 9, 13, 15, 16]), Candidate: [2 2 0 1 0 1 2 0 1 0 0 1 2 0 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 93650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0 -1  1  0 -1  0  0  1 -1  0  1 -1  0] (Indices: [2, 4, 7, 8, 10, 11, 15, 18]), Candidate: [2 2 0 1 0 1 2 0 0 2 0 0 1 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 93700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0 -1  1 -1  0  0  1 -1  1 -1  0  1 -1] (Indices: [2, 4, 7, 8, 10, 14, 16, 19]), Candidate: [ 2  2  0  1  0  1  2  0  0  2 -1  1  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 93750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0 -1  0  1 -1  0  1  0  0 -1  0  0  0] (Indices: [2, 4, 7, 8, 11, 14, 15, 16]), Candidate: [2 2 0 1 0 1 2 0 0 1 1 0 1 2 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 93800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0 -1  0  0  1 -1  0  1 -1  0  1  0 -1] (Indices: [2, 4, 7, 8, 12, 15, 18, 19]), Candidate: [2 2 0 1 0 1 2 0 0 1 0 2 0 1 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 93850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  1  0  0 -1  1 -1  0  0  1 -1  0  0] (Indices: [2, 4, 7, 9, 10, 11, 13, 17]), Candidate: [ 2  2  0  1  0  1  2 -1  2  1  0  0  2  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  1  0 -1  0  1 -1  0  1 -1  0  1 -1] (Indices: [2, 4, 7, 9, 10, 13, 16, 19]), Candidate: [ 2  2  0  1  0  1  2 -1  2  1 -1  1  2  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 93950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  1 -1  1 -1  1 -1  1  0 -1  0  0  0] (Indices: [2, 4, 7, 9, 11, 13, 15, 16]), Candidate: [ 2  2  0  1  0  1  2 -1  2  0  1  0  2  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  1 -1  0  1 -1  1 -1  1 -1  1 -1  0] (Indices: [2, 4, 7, 9, 12, 14, 16, 18]), Candidate: [ 2  2  0  1  0  1  2 -1  2  0  0  2  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 94050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  0  1  0  0  0  0 -1  0  0  0  0  0] (Indices: [2, 4, 7, 10, 11, 12, 13, 14]), Candidate: [ 2  2  0  1  0  1  2 -1  1  2  0  1  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 94100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  0  1  0 -1  0  0  1 -1  1 -1  1 -1] (Indices: [2, 4, 7, 10, 11, 15, 17, 19]), Candidate: [ 2  2  0  1  0  1  2 -1  1  2  0  0  1  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  0  1 -1  0  1  0 -1  0  0  1  0 -1] (Indices: [2, 4, 7, 10, 13, 14, 18, 19]), Candidate: [ 2  2  0  1  0  1  2 -1  1  2 -1  1  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 94200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  0  0  1  0 -1  1 -1  0  0  1  0 -1] (Indices: [2, 4, 7, 11, 12, 14, 18, 19]), Candidate: [ 2  2  0  1  0  1  2 -1  1  1  1  1  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 94250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  0  0  0  1  0  0 -1  1  0 -1  0  0] (Indices: [2, 4, 7, 12, 13, 14, 16, 17]), Candidate: [ 2  2  0  1  0  1  2 -1  1  1  0  2  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 94300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  0  0  0  0  0  1 -1  1  0  0  0 -1] (Indices: [2, 4, 7, 14, 16, 17, 18, 19]), Candidate: [ 2  2  0  1  0  1  2 -1  1  1  0  1  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 94350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1  0  0 -1  1 -1  0  0  0  0  1  0 -1] (Indices: [2, 4, 8, 9, 10, 12, 18, 19]), Candidate: [ 2  2  0  1  0  1  1  1  1  1 -1  2  0  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1  0 -1  1  0 -1  0  1 -1  0  0  1 -1] (Indices: [2, 4, 8, 9, 11, 12, 15, 19]), Candidate: [2 2 0 1 0 1 1 1 1 0 1 1 0 1 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 94450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1  0 -1  0  1  0 -1  1 -1  0  0  1 -1] (Indices: [2, 4, 8, 9, 12, 13, 15, 19]), Candidate: [2 2 0 1 0 1 1 1 1 0 0 2 1 0 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 94500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1  0 -1  0  0  0  1  0 -1  1  0 -1  0] (Indices: [2, 4, 8, 9, 14, 15, 17, 18]), Candidate: [2 2 0 1 0 1 1 1 1 0 0 1 1 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 94550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1 -1  1  0 -1  0  1  0 -1  0  1 -1  0] (Indices: [2, 4, 8, 10, 11, 14, 15, 18]), Candidate: [2 2 0 1 0 1 1 1 0 2 0 0 1 2 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 94600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1 -1  1 -1  1 -1  0  0  1  0 -1  1 -1] (Indices: [2, 4, 8, 10, 12, 16, 17, 19]), Candidate: [ 2  2  0  1  0  1  1  1  0  2 -1  2  0  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1 -1  0  1  0  0 -1  0  0  1  0 -1  0] (Indices: [2, 4, 8, 11, 12, 13, 17, 18]), Candidate: [2 2 0 1 0 1 1 1 0 1 1 1 1 0 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 94700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1 -1  0  1 -1  0  1 -1  1  0 -1  1 -1] (Indices: [2, 4, 8, 11, 14, 16, 17, 19]), Candidate: [ 2  2  0  1  0  1  1  1  0  1  1  0  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1 -1  0  0  0  1  0 -1  1  0 -1  1 -1] (Indices: [2, 4, 8, 13, 14, 16, 17, 19]), Candidate: [ 2  2  0  1  0  1  1  1  0  1  0  1  2  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  1  0  0 -1  0  1  0  0 -1  0  0  0] (Indices: [2, 4, 9, 10, 11, 14, 15, 16]), Candidate: [2 2 0 1 0 1 1 0 2 1 0 0 1 2 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 94850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  1  0 -1  1 -1  0  1 -1  0  1  0 -1] (Indices: [2, 4, 9, 10, 12, 15, 18, 19]), Candidate: [ 2  2  0  1  0  1  1  0  2  1 -1  2  0  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  1 -1  1  0  0 -1  0  1 -1  1 -1  0] (Indices: [2, 4, 9, 11, 12, 13, 16, 18]), Candidate: [2 2 0 1 0 1 1 0 2 0 1 1 1 0 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 94950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  1 -1  1 -1  0  1  0 -1  0  1  0 -1] (Indices: [2, 4, 9, 11, 14, 15, 18, 19]), Candidate: [2 2 0 1 0 1 1 0 2 0 1 0 1 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 95000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  1 -1  0  0  1  0  0 -1  0  1  0 -1] (Indices: [2, 4, 9, 13, 14, 15, 18, 19]), Candidate: [2 2 0 1 0 1 1 0 2 0 0 1 2 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 95050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  0  1  0  0 -1  0  0  0  1  0  0 -1] (Indices: [2, 4, 10, 11, 12, 17, 18, 19]), Candidate: [2 2 0 1 0 1 1 0 1 2 0 1 0 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 95100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  0  1 -1  1  0 -1  1 -1  1 -1  1 -1] (Indices: [2, 4, 10, 12, 13, 15, 17, 19]), Candidate: [ 2  2  0  1  0  1  1  0  1  2 -1  2  1  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  0  0  1  0  0  0 -1  0  1 -1  1 -1] (Indices: [2, 4, 11, 12, 13, 14, 17, 19]), Candidate: [ 2  2  0  1  0  1  1  0  1  1  1  1  1  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  0  0  0  1  0  0  0  0 -1  0  1 -1] (Indices: [2, 4, 12, 13, 14, 15, 16, 19]), Candidate: [2 2 0 1 0 1 1 0 1 1 0 2 1 1 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 95250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0  0 -1  0  0  1  0 -1  0  0  0  0  0] (Indices: [2, 5, 6, 7, 8, 9, 13, 14]), Candidate: [ 2  2  0  0  2  1  1  0  1  0  0  1  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0 -1  1 -1  0  0  0  1 -1  0  0  1 -1] (Indices: [2, 5, 6, 7, 8, 10, 15, 19]), Candidate: [ 2  2  0  0  2  1  1  0  0  2 -1  1  1  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0 -1  0  0  1 -1  0  0  1  0 -1  0  0] (Indices: [2, 5, 6, 7, 8, 12, 16, 17]), Candidate: [2 2 0 0 2 1 1 0 0 1 0 2 0 1 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 95400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  1  0 -1  1 -1  1 -1  0  0  0  0  0] (Indices: [2, 5, 6, 7, 9, 10, 12, 14]), Candidate: [ 2  2  0  0  2  1  1 -1  2  1 -1  2  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 95450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  1 -1  1 -1  0  0  0  1 -1  1 -1  0] (Indices: [2, 5, 6, 7, 9, 11, 16, 18]), Candidate: [ 2  2  0  0  2  1  1 -1  2  0  1  0  1  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  1 -1  0  0  0  1 -1  0  0  1  0 -1] (Indices: [2, 5, 6, 7, 9, 14, 18, 19]), Candidate: [ 2  2  0  0  2  1  1 -1  2  0  0  1  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 95550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  0  1 -1  1 -1  0  1  0 -1  0  0  0] (Indices: [2, 5, 6, 7, 10, 12, 15, 16]), Candidate: [ 2  2  0  0  2  1  1 -1  1  2 -1  2  0  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 95600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  0  0  1  0  0 -1  0  0  0  0  1 -1] (Indices: [2, 5, 6, 7, 11, 12, 13, 19]), Candidate: [ 2  2  0  0  2  1  1 -1  1  1  1  1  1  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  0  0  1 -1  0  0  0  0  1  0  0 -1] (Indices: [2, 5, 6, 7, 11, 17, 18, 19]), Candidate: [ 2  2  0  0  2  1  1 -1  1  1  1  0  1  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  0  0  0  0  1 -1  1 -1  1 -1  1 -1] (Indices: [2, 5, 6, 7, 13, 15, 17, 19]), Candidate: [ 2  2  0  0  2  1  1 -1  1  1  0  1  2  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1  0  0 -1  0  0  0  1 -1  0  0  1 -1] (Indices: [2, 5, 6, 8, 9, 10, 15, 19]), Candidate: [ 2  2  0  0  2  1  0  1  1  1 -1  1  1  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1  0 -1  0  1 -1  0  0  1  0 -1  0  0] (Indices: [2, 5, 6, 8, 9, 12, 16, 17]), Candidate: [2 2 0 0 2 1 0 1 1 0 0 2 0 1 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 95850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1 -1  1  0 -1  1 -1  0  1 -1  0  0  0] (Indices: [2, 5, 6, 8, 10, 11, 13, 16]), Candidate: [2 2 0 0 2 1 0 1 0 2 0 0 2 0 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 95900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1 -1  1 -1  0  1 -1  0  1 -1  1 -1  0] (Indices: [2, 5, 6, 8, 10, 13, 16, 18]), Candidate: [ 2  2  0  0  2  1  0  1  0  2 -1  1  2  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1 -1  0  1 -1  1  0 -1  0  0  0  1 -1] (Indices: [2, 5, 6, 8, 11, 13, 14, 19]), Candidate: [ 2  2  0  0  2  1  0  1  0  1  1  0  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1 -1  0  0  1 -1  1 -1  1  0 -1  0  0] (Indices: [2, 5, 6, 8, 12, 14, 16, 17]), Candidate: [ 2  2  0  0  2  1  0  1  0  1  0  2  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1 -1  0  0  0  0  0  0  1  0  0  0 -1] (Indices: [2, 5, 6, 8, 16, 17, 18, 19]), Candidate: [2 2 0 0 2 1 0 1 0 1 0 1 1 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 96100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  1  0 -1  0  1  0  0 -1  0  0  0  0] (Indices: [2, 5, 6, 9, 10, 13, 14, 15]), Candidate: [ 2  2  0  0  2  1  0  0  2  1 -1  1  2  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  1 -1  1  0 -1  0  0  1  0 -1  0  0] (Indices: [2, 5, 6, 9, 11, 12, 16, 17]), Candidate: [2 2 0 0 2 1 0 0 2 0 1 1 0 1 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 96200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  1 -1  0  1  0 -1  0  1  0 -1  0  0] (Indices: [2, 5, 6, 9, 12, 13, 16, 17]), Candidate: [2 2 0 0 2 1 0 0 2 0 0 2 1 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 96250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  1 -1  0  0  0  1  0 -1  1 -1  1 -1] (Indices: [2, 5, 6, 9, 14, 15, 17, 19]), Candidate: [2 2 0 0 2 1 0 0 2 0 0 1 1 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 96300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  0  1  0 -1  0  1  0 -1  0  0  1 -1] (Indices: [2, 5, 6, 10, 11, 14, 15, 19]), Candidate: [2 2 0 0 2 1 0 0 1 2 0 0 1 2 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 96350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  0  1 -1  1 -1  0  0  1 -1  1  0 -1] (Indices: [2, 5, 6, 10, 12, 16, 18, 19]), Candidate: [ 2  2  0  0  2  1  0  0  1  2 -1  2  0  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  0  0  1  0  0 -1  0  0  1 -1  1 -1] (Indices: [2, 5, 6, 11, 12, 13, 17, 19]), Candidate: [2 2 0 0 2 1 0 0 1 1 1 1 1 0 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 96450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  0  0  1 -1  0  1 -1  1 -1  1  0 -1] (Indices: [2, 5, 6, 11, 14, 16, 18, 19]), Candidate: [ 2  2  0  0  2  1  0  0  1  1  1  0  1  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  0  0  0  0  1  0 -1  1 -1  1  0 -1] (Indices: [2, 5, 6, 13, 14, 16, 18, 19]), Candidate: [ 2  2  0  0  2  1  0  0  1  1  0  1  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0  0 -1  1  0 -1  1 -1  0  0  0  0  0] (Indices: [2, 5, 7, 8, 9, 11, 12, 14]), Candidate: [ 2  2  0  0  2  0  2  0  1  0  1  1  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0  0 -1  0  0  1  0 -1  0  1 -1  0  0] (Indices: [2, 5, 7, 8, 9, 13, 14, 17]), Candidate: [ 2  2  0  0  2  0  2  0  1  0  0  1  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0 -1  1  0 -1  0  1 -1  0  0  0  1 -1] (Indices: [2, 5, 7, 8, 10, 11, 14, 19]), Candidate: [ 2  2  0  0  2  0  2  0  0  2  0  0  1  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0 -1  1 -1  0  0  1  0 -1  0  0  1 -1] (Indices: [2, 5, 7, 8, 10, 14, 15, 19]), Candidate: [ 2  2  0  0  2  0  2  0  0  2 -1  1  1  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0 -1  0  1 -1  1 -1  0  0  1  0 -1  0] (Indices: [2, 5, 7, 8, 11, 13, 17, 18]), Candidate: [2 2 0 0 2 0 2 0 0 1 1 0 2 0 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 96800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0 -1  0  0  1 -1  0  1  0 -1  0  1 -1] (Indices: [2, 5, 7, 8, 12, 15, 16, 19]), Candidate: [2 2 0 0 2 0 2 0 0 1 0 2 0 1 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 96850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  1  0  0 -1  1  0 -1  0  0  0  0  0] (Indices: [2, 5, 7, 9, 10, 11, 13, 14]), Candidate: [ 2  2  0  0  2  0  2 -1  2  1  0  0  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 96900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  1  0 -1  0  1 -1  1 -1  0  0  1 -1] (Indices: [2, 5, 7, 9, 10, 13, 15, 19]), Candidate: [ 2  2  0  0  2  0  2 -1  2  1 -1  1  2  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 96950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  1 -1  1 -1  1  0 -1  0  1 -1  0  0] (Indices: [2, 5, 7, 9, 11, 13, 14, 17]), Candidate: [ 2  2  0  0  2  0  2 -1  2  0  1  0  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 97000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  1 -1  0  1 -1  1  0 -1  0  1 -1  0] (Indices: [2, 5, 7, 9, 12, 14, 15, 18]), Candidate: [ 2  2  0  0  2  0  2 -1  2  0  0  2  0  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 97050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  1 -1  0  0  0  0  1  0 -1  1  0 -1] (Indices: [2, 5, 7, 9, 15, 16, 18, 19]), Candidate: [ 2  2  0  0  2  0  2 -1  2  0  0  1  1  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 97100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  0  1  0 -1  0  0  1  0 -1  1 -1  0] (Indices: [2, 5, 7, 10, 11, 15, 16, 18]), Candidate: [ 2  2  0  0  2  0  2 -1  1  2  0  0  1  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 97150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  0  1 -1  0  1  0 -1  1 -1  0  1 -1] (Indices: [2, 5, 7, 10, 13, 14, 16, 19]), Candidate: [ 2  2  0  0  2  0  2 -1  1  2 -1  1  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 97200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  0  0  1  0 -1  1 -1  1 -1  0  1 -1] (Indices: [2, 5, 7, 11, 12, 14, 16, 19]), Candidate: [ 2  2  0  0  2  0  2 -1  1  1  1  1  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 97250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  0  0  0  1  0  0  0 -1  1 -1  0  0] (Indices: [2, 5, 7, 12, 13, 14, 15, 17]), Candidate: [ 2  2  0  0  2  0  2 -1  1  1  0  2  1  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 97300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  0  0  0  0  0  1  0  0  0 -1  1 -1] (Indices: [2, 5, 7, 14, 15, 16, 17, 19]), Candidate: [ 2  2  0  0  2  0  2 -1  1  1  0  1  1  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 97350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1  0  0 -1  1 -1  0  0  1 -1  0  1 -1] (Indices: [2, 5, 8, 9, 10, 12, 16, 19]), Candidate: [ 2  2  0  0  2  0  1  1  1  1 -1  2  0  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 97400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1  0 -1  1  0 -1  0  1  0 -1  0  0  0] (Indices: [2, 5, 8, 9, 11, 12, 15, 16]), Candidate: [2 2 0 0 2 0 1 1 1 0 1 1 0 1 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 97450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1  0 -1  0  1  0 -1  1  0 -1  0  0  0] (Indices: [2, 5, 8, 9, 12, 13, 15, 16]), Candidate: [2 2 0 0 2 0 1 1 1 0 0 2 1 0 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 97500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1  0 -1  0  0  0  1  0  0  0 -1  0  0] (Indices: [2, 5, 8, 9, 14, 15, 16, 17]), Candidate: [2 2 0 0 2 0 1 1 1 0 0 1 1 2 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 97550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1 -1  1  0 -1  1 -1  0  0  0  1  0 -1] (Indices: [2, 5, 8, 10, 11, 13, 18, 19]), Candidate: [2 2 0 0 2 0 1 1 0 2 0 0 2 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 97600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1 -1  1 -1  1 -1  0  1 -1  1 -1  1 -1] (Indices: [2, 5, 8, 10, 12, 15, 17, 19]), Candidate: [ 2  2  0  0  2  0  1  1  0  2 -1  2  0  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 97650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1 -1  0  1  0  0 -1  0  1  0 -1  0  0] (Indices: [2, 5, 8, 11, 12, 13, 16, 17]), Candidate: [2 2 0 0 2 0 1 1 0 1 1 1 1 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 97700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1 -1  0  1 -1  0  1  0 -1  1 -1  1 -1] (Indices: [2, 5, 8, 11, 14, 15, 17, 19]), Candidate: [2 2 0 0 2 0 1 1 0 1 1 0 1 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 97750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1 -1  0  0  0  1  0  0 -1  1 -1  1 -1] (Indices: [2, 5, 8, 13, 14, 15, 17, 19]), Candidate: [2 2 0 0 2 0 1 1 0 1 0 1 2 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 97800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  1  0  0 -1  1 -1  0  0  1  0 -1  0] (Indices: [2, 5, 9, 10, 11, 13, 17, 18]), Candidate: [2 2 0 0 2 0 1 0 2 1 0 0 2 0 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 97850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  1  0 -1  1 -1  0  1  0 -1  0  1 -1] (Indices: [2, 5, 9, 10, 12, 15, 16, 19]), Candidate: [ 2  2  0  0  2  0  1  0  2  1 -1  2  0  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 97900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  1 -1  1  0  0 -1  1 -1  0  1 -1  0] (Indices: [2, 5, 9, 11, 12, 13, 15, 18]), Candidate: [2 2 0 0 2 0 1 0 2 0 1 1 1 0 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 97950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  1 -1  1 -1  0  1  0  0 -1  0  1 -1] (Indices: [2, 5, 9, 11, 14, 15, 16, 19]), Candidate: [2 2 0 0 2 0 1 0 2 0 1 0 1 2 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 98000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  1 -1  0  0  1  0  0  0 -1  0  1 -1] (Indices: [2, 5, 9, 13, 14, 15, 16, 19]), Candidate: [2 2 0 0 2 0 1 0 2 0 0 1 2 1 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 98050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  0  1  0  0 -1  0  0  1  0  0 -1  0] (Indices: [2, 5, 10, 11, 12, 16, 17, 18]), Candidate: [2 2 0 0 2 0 1 0 1 2 0 1 0 1 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 98100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  0  1 -1  1  0 -1  1  0 -1  1 -1  0] (Indices: [2, 5, 10, 12, 13, 15, 16, 18]), Candidate: [ 2  2  0  0  2  0  1  0  1  2 -1  2  1  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  0  0  1  0  0  0 -1  1 -1  1 -1  0] (Indices: [2, 5, 11, 12, 13, 14, 16, 18]), Candidate: [ 2  2  0  0  2  0  1  0  1  1  1  1  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  0  0  1 -1  0  0  1  0  0  0  0 -1] (Indices: [2, 5, 11, 15, 16, 17, 18, 19]), Candidate: [2 2 0 0 2 0 1 0 1 1 1 0 1 1 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 98250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0  0  0 -1  0  0  1  0 -1  0  0  0  0] (Indices: [2, 6, 7, 8, 9, 10, 14, 15]), Candidate: [ 2  2  0  0  1  2  1  0  1  1 -1  1  1  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0  0 -1  0  1 -1  1 -1  1 -1  0  0  0] (Indices: [2, 6, 7, 8, 9, 12, 14, 16]), Candidate: [ 2  2  0  0  1  2  1  0  1  0  0  2  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0 -1  1  0  0 -1  1 -1  0  0  0  0  0] (Indices: [2, 6, 7, 8, 10, 11, 12, 14]), Candidate: [ 2  2  0  0  1  2  1  0  0  2  0  1  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0 -1  1 -1  0  1  0 -1  0  1 -1  0  0] (Indices: [2, 6, 7, 8, 10, 13, 14, 17]), Candidate: [ 2  2  0  0  1  2  1  0  0  2 -1  1  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 98450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0 -1  0  1  0 -1  0  0  1 -1  0  1 -1] (Indices: [2, 6, 7, 8, 11, 12, 16, 19]), Candidate: [2 2 0 0 1 2 1 0 0 1 1 1 0 1 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 98500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0 -1  0  0  1  0 -1  0  1 -1  0  1 -1] (Indices: [2, 6, 7, 8, 12, 13, 16, 19]), Candidate: [2 2 0 0 1 2 1 0 0 1 0 2 1 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 98550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0 -1  0  0  0  0  1 -1  1  0  0 -1  0] (Indices: [2, 6, 7, 8, 14, 16, 17, 18]), Candidate: [ 2  2  0  0  1  2  1  0  0  1  0  1  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  1  0 -1  1 -1  0  1 -1  0  1 -1  0] (Indices: [2, 6, 7, 9, 10, 12, 15, 18]), Candidate: [ 2  2  0  0  1  2  1 -1  2  1 -1  2  0  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 98650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  1 -1  1  0 -1  1 -1  1 -1  0  0  0] (Indices: [2, 6, 7, 9, 11, 12, 14, 16]), Candidate: [ 2  2  0  0  1  2  1 -1  2  0  1  1  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 98700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  1 -1  0  1  0  0 -1  1 -1  0  0  0] (Indices: [2, 6, 7, 9, 12, 13, 14, 16]), Candidate: [ 2  2  0  0  1  2  1 -1  2  0  0  2  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 98750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  1 -1  0  0  1 -1  0  1  0  0 -1  0] (Indices: [2, 6, 7, 9, 13, 16, 17, 18]), Candidate: [ 2  2  0  0  1  2  1 -1  2  0  0  1  2  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  0  1  0 -1  1 -1  0  1 -1  1 -1  0] (Indices: [2, 6, 7, 10, 11, 13, 16, 18]), Candidate: [ 2  2  0  0  1  2  1 -1  1  2  0  0  2  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  0  1 -1  1 -1  0  1  0  0 -1  0  0] (Indices: [2, 6, 7, 10, 12, 15, 16, 17]), Candidate: [ 2  2  0  0  1  2  1 -1  1  2 -1  2  0  1  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 98900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  0  0  1  0  0 -1  1  0 -1  0  0  0] (Indices: [2, 6, 7, 11, 12, 13, 15, 16]), Candidate: [ 2  2  0  0  1  2  1 -1  1  1  1  1  1  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  0  0  1 -1  0  1  0  0  0 -1  0  0] (Indices: [2, 6, 7, 11, 14, 15, 16, 17]), Candidate: [ 2  2  0  0  1  2  1 -1  1  1  1  0  1  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 99000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  0  0  0  0  1  0  0  0  0 -1  0  0] (Indices: [2, 6, 7, 13, 14, 15, 16, 17]), Candidate: [ 2  2  0  0  1  2  1 -1  1  1  0  1  2  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 99050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1  0  0 -1  1  0 -1  1 -1  0  0  0  0] (Indices: [2, 6, 8, 9, 10, 12, 13, 15]), Candidate: [ 2  2  0  0  1  2  0  1  1  1 -1  2  1  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 99100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1  0  0 -1  0  0  0  1 -1  0  1  0 -1] (Indices: [2, 6, 8, 9, 10, 15, 18, 19]), Candidate: [ 2  2  0  0  1  2  0  1  1  1 -1  1  1  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 99150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1  0 -1  1 -1  0  1 -1  0  0  1  0 -1] (Indices: [2, 6, 8, 9, 11, 14, 18, 19]), Candidate: [ 2  2  0  0  1  2  0  1  1  0  1  0  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 99200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1  0 -1  0  0  1  0 -1  1  0 -1  0  0] (Indices: [2, 6, 8, 9, 13, 14, 16, 17]), Candidate: [ 2  2  0  0  1  2  0  1  1  0  0  1  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 99250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1 -1  1  0  0 -1  0  0  0  1 -1  1 -1] (Indices: [2, 6, 8, 10, 11, 12, 17, 19]), Candidate: [2 2 0 0 1 2 0 1 0 2 0 1 0 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 99300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1 -1  1 -1  1  0 -1  0  0  1 -1  1 -1] (Indices: [2, 6, 8, 10, 12, 13, 17, 19]), Candidate: [ 2  2  0  0  1  2  0  1  0  2 -1  2  1  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 99350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1 -1  1 -1  0  0  1 -1  1 -1  1  0 -1] (Indices: [2, 6, 8, 10, 14, 16, 18, 19]), Candidate: [ 2  2  0  0  1  2  0  1  0  2 -1  1  1  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 99400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1 -1  0  1 -1  1  0 -1  0  1 -1  1 -1] (Indices: [2, 6, 8, 11, 13, 14, 17, 19]), Candidate: [ 2  2  0  0  1  2  0  1  0  1  1  0  2  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 99450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1 -1  0  0  1 -1  1  0 -1  1  0 -1  0] (Indices: [2, 6, 8, 12, 14, 15, 17, 18]), Candidate: [2 2 0 0 1 2 0 1 0 1 0 2 0 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 99500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  1  0  0  0 -1  0  0  1 -1  0  1 -1] (Indices: [2, 6, 9, 10, 11, 12, 16, 19]), Candidate: [2 2 0 0 1 2 0 0 2 1 0 1 0 1 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 99550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  1  0 -1  1  0 -1  0  1 -1  0  1 -1] (Indices: [2, 6, 9, 10, 12, 13, 16, 19]), Candidate: [ 2  2  0  0  1  2  0  0  2  1 -1  2  1  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 99600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  1  0 -1  0  0  1 -1  1  0  0 -1  0] (Indices: [2, 6, 9, 10, 14, 16, 17, 18]), Candidate: [ 2  2  0  0  1  2  0  0  2  1 -1  1  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 99650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  1 -1  1 -1  1  0 -1  1 -1  0  1 -1] (Indices: [2, 6, 9, 11, 13, 14, 16, 19]), Candidate: [ 2  2  0  0  1  2  0  0  2  0  1  0  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 99700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  1 -1  0  1 -1  1  0  0 -1  1 -1  0] (Indices: [2, 6, 9, 12, 14, 15, 16, 18]), Candidate: [2 2 0 0 1 2 0 0 2 0 0 2 0 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 99750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  0  1  0  0 -1  1  0  0 -1  0  0  0] (Indices: [2, 6, 10, 11, 12, 14, 15, 16]), Candidate: [2 2 0 0 1 2 0 0 1 2 0 1 0 2 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 99800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  0  1  0 -1  0  0  1  0  0  0 -1  0] (Indices: [2, 6, 10, 11, 15, 16, 17, 18]), Candidate: [2 2 0 0 1 2 0 0 1 2 0 0 1 1 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 99850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  0  1 -1  0  1 -1  1  0  0  0 -1  0] (Indices: [2, 6, 10, 13, 15, 16, 17, 18]), Candidate: [ 2  2  0  0  1  2  0  0  1  2 -1  1  2  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 99900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  0  0  1 -1  1  0  0 -1  1 -1  1 -1] (Indices: [2, 6, 11, 13, 14, 15, 17, 19]), Candidate: [2 2 0 0 1 2 0 0 1 1 1 0 2 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 99950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0  0  0  0  0 -1  0  0  0  0  1 -1  0] (Indices: [2, 7, 8, 9, 10, 11, 12, 18]), Candidate: [2 2 0 0 1 1 2 0 1 1 0 1 0 1 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 100000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0  0  0 -1  0  1 -1  1 -1  1 -1  0  0] (Indices: [2, 7, 8, 9, 10, 13, 15, 17]), Candidate: [ 2  2  0  0  1  1  2  0  1  1 -1  1  2  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0  0 -1  1 -1  1  0  0 -1  0  0  0  0] (Indices: [2, 7, 8, 9, 11, 13, 14, 15]), Candidate: [2 2 0 0 1 1 2 0 1 0 1 0 2 1 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 100100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0  0 -1  0  1 -1  1  0  0 -1  0  0  0] (Indices: [2, 7, 8, 9, 12, 14, 15, 16]), Candidate: [2 2 0 0 1 1 2 0 1 0 0 2 0 2 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 100150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0  0 -1  0  0  0  0  1  0  0  0 -1  0] (Indices: [2, 7, 8, 9, 15, 16, 17, 18]), Candidate: [2 2 0 0 1 1 2 0 1 0 0 1 1 1 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 100200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0 -1  1  0 -1  0  1 -1  0  0  1  0 -1] (Indices: [2, 7, 8, 10, 11, 14, 18, 19]), Candidate: [ 2  2  0  0  1  1  2  0  0  2  0  0  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0 -1  1 -1  0  1  0 -1  1  0 -1  0  0] (Indices: [2, 7, 8, 10, 13, 14, 16, 17]), Candidate: [ 2  2  0  0  1  1  2  0  0  2 -1  1  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0 -1  0  1  0 -1  1 -1  1  0 -1  0  0] (Indices: [2, 7, 8, 11, 12, 14, 16, 17]), Candidate: [ 2  2  0  0  1  1  2  0  0  1  1  1  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0 -1  0  1 -1  0  0  0  1  0  0  0 -1] (Indices: [2, 7, 8, 11, 16, 17, 18, 19]), Candidate: [2 2 0 0 1 1 2 0 0 1 1 0 1 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 100400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0 -1  0  0  0  1 -1  0  1  0  0  0 -1] (Indices: [2, 7, 8, 13, 16, 17, 18, 19]), Candidate: [2 2 0 0 1 1 2 0 0 1 0 1 2 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 100450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  1  0  0 -1  0  1 -1  0  1  0 -1  0] (Indices: [2, 7, 9, 10, 11, 14, 17, 18]), Candidate: [ 2  2  0  0  1  1  2 -1  2  1  0  0  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  1  0 -1  0  1  0  0 -1  0  1 -1  0] (Indices: [2, 7, 9, 10, 13, 14, 15, 18]), Candidate: [ 2  2  0  0  1  1  2 -1  2  1 -1  1  2  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  1 -1  1  0 -1  1  0 -1  0  1 -1  0] (Indices: [2, 7, 9, 11, 12, 14, 15, 18]), Candidate: [ 2  2  0  0  1  1  2 -1  2  0  1  1  0  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  1 -1  1 -1  0  0  1  0 -1  1  0 -1] (Indices: [2, 7, 9, 11, 15, 16, 18, 19]), Candidate: [ 2  2  0  0  1  1  2 -1  2  0  1  0  1  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  1 -1  0  0  1 -1  1  0 -1  1  0 -1] (Indices: [2, 7, 9, 13, 15, 16, 18, 19]), Candidate: [ 2  2  0  0  1  1  2 -1  2  0  0  1  2  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  0  1  0 -1  1  0 -1  1 -1  0  1 -1] (Indices: [2, 7, 10, 11, 13, 14, 16, 19]), Candidate: [ 2  2  0  0  1  1  2 -1  1  2  0  0  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  0  1 -1  1 -1  1  0  0 -1  1 -1  0] (Indices: [2, 7, 10, 12, 14, 15, 16, 18]), Candidate: [ 2  2  0  0  1  1  2 -1  1  2 -1  2  0  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  0  0  1  0  0 -1  1 -1  0  1  0 -1] (Indices: [2, 7, 11, 12, 13, 15, 18, 19]), Candidate: [ 2  2  0  0  1  1  2 -1  1  1  1  1  1  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  0  0  0  1  0  0 -1  0  1  0  0 -1] (Indices: [2, 7, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  2  0  0  1  1  2 -1  1  1  0  2  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1  0  0  0 -1  1 -1  0  1 -1  1 -1  0] (Indices: [2, 8, 9, 10, 11, 13, 16, 18]), Candidate: [2 2 0 0 1 1 1 1 1 1 0 0 2 0 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 100950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1  0  0 -1  1 -1  0  1  0  0 -1  0  0] (Indices: [2, 8, 9, 10, 12, 15, 16, 17]), Candidate: [ 2  2  0  0  1  1  1  1  1  1 -1  2  0  1  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1  0 -1  1  0  0 -1  1  0 -1  0  0  0] (Indices: [2, 8, 9, 11, 12, 13, 15, 16]), Candidate: [2 2 0 0 1 1 1 1 1 0 1 1 1 0 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 101050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1  0 -1  1 -1  0  1  0  0  0 -1  0  0] (Indices: [2, 8, 9, 11, 14, 15, 16, 17]), Candidate: [2 2 0 0 1 1 1 1 1 0 1 0 1 2 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 101100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1  0 -1  0  0  1  0  0  0  0 -1  0  0] (Indices: [2, 8, 9, 13, 14, 15, 16, 17]), Candidate: [2 2 0 0 1 1 1 1 1 0 0 1 2 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 101150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1 -1  1  0  0 -1  0  1 -1  1 -1  1 -1] (Indices: [2, 8, 10, 11, 12, 15, 17, 19]), Candidate: [2 2 0 0 1 1 1 1 0 2 0 1 0 1 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 101200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1 -1  1 -1  1  0  0 -1  0  0  1  0 -1] (Indices: [2, 8, 10, 12, 13, 14, 18, 19]), Candidate: [ 2  2  0  0  1  1  1  1  0  2 -1  2  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 101250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1 -1  0  1  0  0  0  0 -1  0  0  1 -1] (Indices: [2, 8, 11, 12, 13, 14, 15, 19]), Candidate: [2 2 0 0 1 1 1 1 0 1 1 1 1 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 101300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1 -1  0  1 -1  0  1  0 -1  1  0  0 -1] (Indices: [2, 8, 11, 14, 15, 17, 18, 19]), Candidate: [2 2 0 0 1 1 1 1 0 1 1 0 1 2 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 101350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  1  0  0  0 -1  1 -1  1  0 -1  0  0] (Indices: [2, 9, 10, 11, 12, 14, 16, 17]), Candidate: [ 2  2  0  0  1  1  1  0  2  1  0  1  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  1  0  0 -1  0  0  0  1  0  0  0 -1] (Indices: [2, 9, 10, 11, 16, 17, 18, 19]), Candidate: [2 2 0 0 1 1 1 0 2 1 0 0 1 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 101450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  1  0 -1  0  1 -1  0  1  0  0  0 -1] (Indices: [2, 9, 10, 13, 16, 17, 18, 19]), Candidate: [ 2  2  0  0  1  1  1  0  2  1 -1  1  2  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  1 -1  1 -1  1  0 -1  1 -1  1  0 -1] (Indices: [2, 9, 11, 13, 14, 16, 18, 19]), Candidate: [ 2  2  0  0  1  1  1  0  2  0  1  0  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  0  1  0  0  0  0 -1  0  0  1  0 -1] (Indices: [2, 10, 11, 12, 13, 14, 18, 19]), Candidate: [ 2  2  0  0  1  1  1  0  1  2  0  1  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  0  1 -1  1  0  0  0 -1  1  0 -1  0] (Indices: [2, 10, 12, 13, 14, 15, 17, 18]), Candidate: [ 2  2  0  0  1  1  1  0  1  2 -1  2  1  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  0  0  1 -1  1  0 -1  1  0  0  0 -1] (Indices: [2, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  2  0  0  1  1  1  0  1  1  1  0  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0 -1  0  0  0  1 -1  0  0  0  0  1 -1] (Indices: [3, 4, 5, 6, 7, 8, 13, 19]), Candidate: [2 1 2 0 1 1 1 0 0 1 0 1 2 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 101750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  1 -1  0  0  0  1 -1  0  0  0  1 -1] (Indices: [3, 4, 5, 6, 7, 9, 14, 19]), Candidate: [ 2  1  2  0  1  1  1 -1  2  0  0  1  1  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 101800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  0  0  1  0 -1  0  0  1 -1  0  0  0] (Indices: [3, 4, 5, 6, 7, 11, 12, 16]), Candidate: [ 2  1  2  0  1  1  1 -1  1  1  1  1  0  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  0  0  0  0  1  0 -1  0  0  0  1 -1] (Indices: [3, 4, 5, 6, 7, 13, 14, 19]), Candidate: [ 2  1  2  0  1  1  1 -1  1  1  0  1  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 101900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1  0 -1  0  1 -1  0  1 -1  0  0  0  0] (Indices: [3, 4, 5, 6, 8, 9, 12, 15]), Candidate: [2 1 2 0 1 1 0 1 1 0 0 2 0 1 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 101950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1 -1  1 -1  0  0  1 -1  0  0  1 -1  0] (Indices: [3, 4, 5, 6, 8, 10, 14, 18]), Candidate: [ 2  1  2  0  1  1  0  1  0  2 -1  1  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1 -1  0  0  1 -1  1 -1  0  0  0  1 -1] (Indices: [3, 4, 5, 6, 8, 12, 14, 19]), Candidate: [ 2  1  2  0  1  1  0  1  0  1  0  2  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  1  0  0 -1  0  0  0  1 -1  0  0  0] (Indices: [3, 4, 5, 6, 9, 10, 11, 16]), Candidate: [2 1 2 0 1 1 0 0 2 1 0 0 1 1 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 102100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  1 -1  1 -1  0  0  1  0 -1  0  0  0] (Indices: [3, 4, 5, 6, 9, 11, 15, 16]), Candidate: [2 1 2 0 1 1 0 0 2 0 1 0 1 1 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 102150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  1 -1  0  0  0  1 -1  1  0 -1  0  0] (Indices: [3, 4, 5, 6, 9, 14, 16, 17]), Candidate: [ 2  1  2  0  1  1  0  0  2  0  0  1  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  0  1 -1  1 -1  1  0 -1  0  0  0  0] (Indices: [3, 4, 5, 6, 10, 12, 14, 15]), Candidate: [ 2  1  2  0  1  1  0  0  1  2 -1  2  0  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  0  0  1  0  0  0 -1  0  0  0  0  0] (Indices: [3, 4, 5, 6, 11, 12, 13, 14]), Candidate: [ 2  1  2  0  1  1  0  0  1  1  1  1  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  0  0  1 -1  0  0  1 -1  1 -1  1 -1] (Indices: [3, 4, 5, 6, 11, 15, 17, 19]), Candidate: [2 1 2 0 1 1 0 0 1 1 1 0 1 1 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 102350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  0  0  0  0  1  0 -1  0  0  1  0 -1] (Indices: [3, 4, 5, 6, 13, 14, 18, 19]), Candidate: [ 2  1  2  0  1  1  0  0  1  1  0  1  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0  0 -1  0  0  1  0 -1  0  0  0  0  0] (Indices: [3, 4, 5, 7, 8, 9, 13, 14]), Candidate: [ 2  1  2  0  1  0  2  0  1  0  0  1  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0 -1  1 -1  0  0  0  1 -1  0  0  1 -1] (Indices: [3, 4, 5, 7, 8, 10, 15, 19]), Candidate: [ 2  1  2  0  1  0  2  0  0  2 -1  1  1  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0 -1  0  0  1 -1  0  0  1  0 -1  0  0] (Indices: [3, 4, 5, 7, 8, 12, 16, 17]), Candidate: [2 1 2 0 1 0 2 0 0 1 0 2 0 1 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 102550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  1  0 -1  1 -1  1 -1  0  0  0  0  0] (Indices: [3, 4, 5, 7, 9, 10, 12, 14]), Candidate: [ 2  1  2  0  1  0  2 -1  2  1 -1  2  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 102600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  1 -1  1 -1  0  0  0  1 -1  1 -1  0] (Indices: [3, 4, 5, 7, 9, 11, 16, 18]), Candidate: [ 2  1  2  0  1  0  2 -1  2  0  1  0  1  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  1 -1  0  0  0  1 -1  0  0  1  0 -1] (Indices: [3, 4, 5, 7, 9, 14, 18, 19]), Candidate: [ 2  1  2  0  1  0  2 -1  2  0  0  1  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  0  1 -1  1 -1  0  1  0 -1  0  0  0] (Indices: [3, 4, 5, 7, 10, 12, 15, 16]), Candidate: [ 2  1  2  0  1  0  2 -1  1  2 -1  2  0  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  0  0  1  0  0 -1  0  0  0  0  1 -1] (Indices: [3, 4, 5, 7, 11, 12, 13, 19]), Candidate: [ 2  1  2  0  1  0  2 -1  1  1  1  1  1  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  0  0  1 -1  0  0  0  0  1  0  0 -1] (Indices: [3, 4, 5, 7, 11, 17, 18, 19]), Candidate: [ 2  1  2  0  1  0  2 -1  1  1  1  0  1  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  0  0  0  0  1 -1  1 -1  1 -1  1 -1] (Indices: [3, 4, 5, 7, 13, 15, 17, 19]), Candidate: [ 2  1  2  0  1  0  2 -1  1  1  0  1  2  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1  0  0 -1  0  0  0  1 -1  0  0  1 -1] (Indices: [3, 4, 5, 8, 9, 10, 15, 19]), Candidate: [ 2  1  2  0  1  0  1  1  1  1 -1  1  1  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1  0 -1  0  1 -1  0  0  1  0 -1  0  0] (Indices: [3, 4, 5, 8, 9, 12, 16, 17]), Candidate: [2 1 2 0 1 0 1 1 1 0 0 2 0 1 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 103000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1 -1  1  0 -1  1 -1  0  1 -1  0  0  0] (Indices: [3, 4, 5, 8, 10, 11, 13, 16]), Candidate: [2 1 2 0 1 0 1 1 0 2 0 0 2 0 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 103050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1 -1  1 -1  0  1 -1  0  1 -1  1 -1  0] (Indices: [3, 4, 5, 8, 10, 13, 16, 18]), Candidate: [ 2  1  2  0  1  0  1  1  0  2 -1  1  2  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1 -1  0  1 -1  1  0 -1  0  0  0  1 -1] (Indices: [3, 4, 5, 8, 11, 13, 14, 19]), Candidate: [ 2  1  2  0  1  0  1  1  0  1  1  0  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1 -1  0  0  1 -1  1 -1  1  0 -1  0  0] (Indices: [3, 4, 5, 8, 12, 14, 16, 17]), Candidate: [ 2  1  2  0  1  0  1  1  0  1  0  2  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1 -1  0  0  0  0  0  0  1  0  0  0 -1] (Indices: [3, 4, 5, 8, 16, 17, 18, 19]), Candidate: [2 1 2 0 1 0 1 1 0 1 0 1 1 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 103250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  1  0 -1  0  1  0  0 -1  0  0  0  0] (Indices: [3, 4, 5, 9, 10, 13, 14, 15]), Candidate: [ 2  1  2  0  1  0  1  0  2  1 -1  1  2  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  1 -1  1  0 -1  0  0  1  0 -1  0  0] (Indices: [3, 4, 5, 9, 11, 12, 16, 17]), Candidate: [2 1 2 0 1 0 1 0 2 0 1 1 0 1 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 103350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  1 -1  0  1  0 -1  0  1  0 -1  0  0] (Indices: [3, 4, 5, 9, 12, 13, 16, 17]), Candidate: [2 1 2 0 1 0 1 0 2 0 0 2 1 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 103400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  1 -1  0  0  0  1  0 -1  1 -1  1 -1] (Indices: [3, 4, 5, 9, 14, 15, 17, 19]), Candidate: [2 1 2 0 1 0 1 0 2 0 0 1 1 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 103450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  0  1  0 -1  0  1  0 -1  0  0  1 -1] (Indices: [3, 4, 5, 10, 11, 14, 15, 19]), Candidate: [2 1 2 0 1 0 1 0 1 2 0 0 1 2 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 103500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  0  1 -1  1 -1  0  0  1 -1  1  0 -1] (Indices: [3, 4, 5, 10, 12, 16, 18, 19]), Candidate: [ 2  1  2  0  1  0  1  0  1  2 -1  2  0  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  0  0  1  0  0 -1  0  0  1 -1  1 -1] (Indices: [3, 4, 5, 11, 12, 13, 17, 19]), Candidate: [2 1 2 0 1 0 1 0 1 1 1 1 1 0 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 103600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  0  0  1 -1  0  1 -1  1 -1  1  0 -1] (Indices: [3, 4, 5, 11, 14, 16, 18, 19]), Candidate: [ 2  1  2  0  1  0  1  0  1  1  1  0  1  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  0  0  0  0  1  0 -1  1 -1  1  0 -1] (Indices: [3, 4, 5, 13, 14, 16, 18, 19]), Candidate: [ 2  1  2  0  1  0  1  0  1  1  0  1  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0  0 -1  0  0  0  0  1 -1  0  1 -1  0] (Indices: [3, 4, 6, 7, 8, 9, 15, 18]), Candidate: [2 1 2 0 0 2 1 0 1 0 0 1 1 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 103750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0 -1  0  1  0 -1  0  0  0  0  0  1 -1] (Indices: [3, 4, 6, 7, 8, 11, 12, 19]), Candidate: [2 1 2 0 0 2 1 0 0 1 1 1 0 1 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 103800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0 -1  0  0  0  1 -1  1 -1  0  1 -1  0] (Indices: [3, 4, 6, 7, 8, 13, 15, 18]), Candidate: [2 1 2 0 0 2 1 0 0 1 0 1 2 0 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 103850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  1  0 -1  0  0  1 -1  1 -1  0  0  0] (Indices: [3, 4, 6, 7, 9, 10, 14, 16]), Candidate: [ 2  1  2  0  0  2  1 -1  2  1 -1  1  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 103900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  1 -1  0  1 -1  1 -1  0  1 -1  0  0] (Indices: [3, 4, 6, 7, 9, 12, 14, 17]), Candidate: [ 2  1  2  0  0  2  1 -1  2  0  0  2  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 103950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  0  1  0  0 -1  0  1 -1  0  0  0  0] (Indices: [3, 4, 6, 7, 10, 11, 12, 15]), Candidate: [ 2  1  2  0  0  2  1 -1  1  2  0  1  0  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  0  1 -1  0  1  0 -1  0  0  1 -1  0] (Indices: [3, 4, 6, 7, 10, 13, 14, 18]), Candidate: [ 2  1  2  0  0  2  1 -1  1  2 -1  1  2  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 104050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  0  0  1  0 -1  0  0  0  1  0 -1  0] (Indices: [3, 4, 6, 7, 11, 12, 17, 18]), Candidate: [ 2  1  2  0  0  2  1 -1  1  1  1  1  0  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  0  0  0  1  0 -1  0  0  1  0 -1  0] (Indices: [3, 4, 6, 7, 12, 13, 17, 18]), Candidate: [ 2  1  2  0  0  2  1 -1  1  1  0  2  1  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  0  0  0  0  0  1 -1  1  0 -1  1 -1] (Indices: [3, 4, 6, 7, 14, 16, 17, 19]), Candidate: [ 2  1  2  0  0  2  1 -1  1  1  0  1  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 104200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1  0 -1  1  0 -1  0  0  0  0  0  1 -1] (Indices: [3, 4, 6, 8, 9, 11, 12, 19]), Candidate: [2 1 2 0 0 2 0 1 1 0 1 1 0 1 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 104250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1  0 -1  0  0  1 -1  1 -1  0  1 -1  0] (Indices: [3, 4, 6, 8, 9, 13, 15, 18]), Candidate: [2 1 2 0 0 2 0 1 1 0 0 1 2 0 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 104300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1 -1  1  0 -1  0  0  0  1  0 -1  0  0] (Indices: [3, 4, 6, 8, 10, 11, 16, 17]), Candidate: [2 1 2 0 0 2 0 1 0 2 0 0 1 1 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 104350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1 -1  1 -1  0  0  1 -1  0  1 -1  1 -1] (Indices: [3, 4, 6, 8, 10, 14, 17, 19]), Candidate: [ 2  1  2  0  0  2  0  1  0  2 -1  1  1  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 104400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1 -1  0  1 -1  0  1  0 -1  0  1 -1  0] (Indices: [3, 4, 6, 8, 11, 14, 15, 18]), Candidate: [2 1 2 0 0 2 0 1 0 1 1 0 1 2 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 104450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1 -1  0  0  1 -1  0  0  1  0 -1  1 -1] (Indices: [3, 4, 6, 8, 12, 16, 17, 19]), Candidate: [2 1 2 0 0 2 0 1 0 1 0 2 0 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 104500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  1  0  0 -1  1 -1  0  0  0  0  1 -1] (Indices: [3, 4, 6, 9, 10, 11, 13, 19]), Candidate: [2 1 2 0 0 2 0 0 2 1 0 0 2 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 104550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  1  0 -1  0  1 -1  0  0  1 -1  1 -1] (Indices: [3, 4, 6, 9, 10, 13, 17, 19]), Candidate: [ 2  1  2  0  0  2  0  0  2  1 -1  1  2  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  1 -1  1 -1  1 -1  1 -1  0  1 -1  0] (Indices: [3, 4, 6, 9, 11, 13, 15, 18]), Candidate: [2 1 2 0 0 2 0 0 2 0 1 0 2 0 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 104650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  1 -1  0  1 -1  1 -1  0  1  0 -1  0] (Indices: [3, 4, 6, 9, 12, 14, 17, 18]), Candidate: [ 2  1  2  0  0  2  0  0  2  0  0  2  0  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  0  1  0  0  0 -1  0  1 -1  0  0  0] (Indices: [3, 4, 6, 10, 11, 12, 13, 16]), Candidate: [2 1 2 0 0 2 0 0 1 2 0 1 1 0 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 104750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  0  1  0 -1  0  0  0  1  0  0 -1  0] (Indices: [3, 4, 6, 10, 11, 16, 17, 18]), Candidate: [2 1 2 0 0 2 0 0 1 2 0 0 1 1 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 104800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  0  1 -1  0  1 -1  1  0 -1  1 -1  0] (Indices: [3, 4, 6, 10, 13, 15, 16, 18]), Candidate: [ 2  1  2  0  0  2  0  0  1  2 -1  1  2  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  0  0  1  0 -1  0  1  0 -1  1 -1  0] (Indices: [3, 4, 6, 11, 12, 15, 16, 18]), Candidate: [2 1 2 0 0 2 0 0 1 1 1 1 0 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 104900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  0  0  0  1  0  0 -1  1 -1  0  1 -1] (Indices: [3, 4, 6, 12, 13, 14, 16, 19]), Candidate: [ 2  1  2  0  0  2  0  0  1  1  0  2  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0  0  0  0  0 -1  0  0  0  0  0  0  0] (Indices: [3, 4, 7, 8, 9, 10, 11, 12]), Candidate: [2 1 2 0 0 1 2 0 1 1 0 1 0 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 105000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0  0 -1  1 -1  0  1 -1  1 -1  0  0  0] (Indices: [3, 4, 7, 8, 9, 11, 14, 16]), Candidate: [ 2  1  2  0  0  1  2  0  1  0  1  0  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0  0 -1  0  0  0  1  0  0 -1  0  0  0] (Indices: [3, 4, 7, 8, 9, 14, 15, 16]), Candidate: [2 1 2 0 0 1 2 0 1 0 0 1 1 2 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 105100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0 -1  1 -1  1  0 -1  0  1 -1  0  0  0] (Indices: [3, 4, 7, 8, 10, 12, 13, 16]), Candidate: [ 2  1  2  0  0  1  2  0  0  2 -1  2  1  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0 -1  1 -1  0  0  0  0  1  0  0 -1  0] (Indices: [3, 4, 7, 8, 10, 16, 17, 18]), Candidate: [ 2  1  2  0  0  1  2  0  0  2 -1  1  1  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0 -1  0  1 -1  0  0  1  0  0 -1  0  0] (Indices: [3, 4, 7, 8, 11, 15, 16, 17]), Candidate: [2 1 2 0 0 1 2 0 0 1 1 0 1 1 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 105250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0 -1  0  0  0  1  0 -1  1 -1  1 -1  0] (Indices: [3, 4, 7, 8, 13, 14, 16, 18]), Candidate: [ 2  1  2  0  0  1  2  0  0  1  0  1  2  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  1  0  0 -1  0  0  1 -1  0  1 -1  0] (Indices: [3, 4, 7, 9, 10, 11, 15, 18]), Candidate: [ 2  1  2  0  0  1  2 -1  2  1  0  0  1  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  1  0 -1  0  0  1 -1  1 -1  0  1 -1] (Indices: [3, 4, 7, 9, 10, 14, 16, 19]), Candidate: [ 2  1  2  0  0  1  2 -1  2  1 -1  1  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 105400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  1 -1  1 -1  0  1  0  0 -1  0  0  0] (Indices: [3, 4, 7, 9, 11, 14, 15, 16]), Candidate: [ 2  1  2  0  0  1  2 -1  2  0  1  0  1  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  1 -1  0  1 -1  0  1 -1  0  1  0 -1] (Indices: [3, 4, 7, 9, 12, 15, 18, 19]), Candidate: [ 2  1  2  0  0  1  2 -1  2  0  0  2  0  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  0  1  0  0 -1  1 -1  0  0  0  1 -1] (Indices: [3, 4, 7, 10, 11, 12, 14, 19]), Candidate: [ 2  1  2  0  0  1  2 -1  1  2  0  1  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 105550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  0  1 -1  1  0  0 -1  0  0  0  1 -1] (Indices: [3, 4, 7, 10, 12, 13, 14, 19]), Candidate: [ 2  1  2  0  0  1  2 -1  1  2 -1  2  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 105600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  0  1 -1  0  1 -1  0  0  1  0  0 -1] (Indices: [3, 4, 7, 10, 13, 17, 18, 19]), Candidate: [ 2  1  2  0  0  1  2 -1  1  2 -1  1  2  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 105650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  0  0  1  0 -1  0  0  0  1  0  0 -1] (Indices: [3, 4, 7, 11, 12, 17, 18, 19]), Candidate: [ 2  1  2  0  0  1  2 -1  1  1  1  1  0  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  0  0  0  1  0 -1  1 -1  1 -1  1 -1] (Indices: [3, 4, 7, 12, 13, 15, 17, 19]), Candidate: [ 2  1  2  0  0  1  2 -1  1  1  0  2  1  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1  0  0  0 -1  1 -1  1 -1  0  0  0  0] (Indices: [3, 4, 8, 9, 10, 11, 13, 15]), Candidate: [2 1 2 0 0 1 1 1 1 1 0 0 2 0 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 105800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1  0  0 -1  0  1 -1  0  1  0 -1  0  0] (Indices: [3, 4, 8, 9, 10, 13, 16, 17]), Candidate: [ 2  1  2  0  0  1  1  1  1  1 -1  1  2  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1  0 -1  1 -1  1  0 -1  0  0  1 -1  0] (Indices: [3, 4, 8, 9, 11, 13, 14, 18]), Candidate: [ 2  1  2  0  0  1  1  1  1  0  1  0  2  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1  0 -1  0  1 -1  1  0 -1  0  0  1 -1] (Indices: [3, 4, 8, 9, 12, 14, 15, 19]), Candidate: [2 1 2 0 0 1 1 1 1 0 0 2 0 2 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 105950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1  0 -1  0  0  0  0  1 -1  1  0  0 -1] (Indices: [3, 4, 8, 9, 15, 17, 18, 19]), Candidate: [2 1 2 0 0 1 1 1 1 0 0 1 1 1 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 106000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1 -1  1  0 -1  0  0  1  0 -1  0  1 -1] (Indices: [3, 4, 8, 10, 11, 15, 16, 19]), Candidate: [2 1 2 0 0 1 1 1 0 2 0 0 1 1 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 106050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1 -1  1 -1  0  1  0 -1  0  1  0 -1  0] (Indices: [3, 4, 8, 10, 13, 14, 17, 18]), Candidate: [ 2  1  2  0  0  1  1  1  0  2 -1  1  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 106100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1 -1  0  1  0 -1  1 -1  0  1  0 -1  0] (Indices: [3, 4, 8, 11, 12, 14, 17, 18]), Candidate: [ 2  1  2  0  0  1  1  1  0  1  1  1  0  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 106150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1 -1  0  0  1  0  0  0 -1  0  1 -1  0] (Indices: [3, 4, 8, 12, 13, 14, 15, 18]), Candidate: [2 1 2 0 0 1 1 1 0 1 0 2 1 1 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 106200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1 -1  0  0  0  0  1  0  0 -1  1  0 -1] (Indices: [3, 4, 8, 14, 15, 16, 18, 19]), Candidate: [2 1 2 0 0 1 1 1 0 1 0 1 1 2 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 106250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  1  0  0 -1  0  0  1  0  0 -1  0  0] (Indices: [3, 4, 9, 10, 11, 15, 16, 17]), Candidate: [2 1 2 0 0 1 1 0 2 1 0 0 1 1 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 106300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  1  0 -1  0  1  0 -1  1 -1  1 -1  0] (Indices: [3, 4, 9, 10, 13, 14, 16, 18]), Candidate: [ 2  1  2  0  0  1  1  0  2  1 -1  1  2  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 106350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  1 -1  1  0 -1  1 -1  1 -1  1 -1  0] (Indices: [3, 4, 9, 11, 12, 14, 16, 18]), Candidate: [ 2  1  2  0  0  1  1  0  2  0  1  1  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 106400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  1 -1  0  1  0  0  0  0 -1  0  0  0] (Indices: [3, 4, 9, 12, 13, 14, 15, 16]), Candidate: [2 1 2 0 0 1 1 0 2 0 0 2 1 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 106450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  1 -1  0  0  0  1  0  0  0  0 -1  0] (Indices: [3, 4, 9, 14, 15, 16, 17, 18]), Candidate: [2 1 2 0 0 1 1 0 2 0 0 1 1 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 106500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  0  1  0 -1  1  0 -1  0  0  1  0 -1] (Indices: [3, 4, 10, 11, 13, 14, 18, 19]), Candidate: [ 2  1  2  0  0  1  1  0  1  2  0  0  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 106550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  0  1 -1  1 -1  1  0 -1  1 -1  1 -1] (Indices: [3, 4, 10, 12, 14, 15, 17, 19]), Candidate: [ 2  1  2  0  0  1  1  0  1  2 -1  2  0  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 106600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  0  0  1  0  0 -1  0  1 -1  1  0 -1] (Indices: [3, 4, 11, 12, 13, 16, 18, 19]), Candidate: [2 1 2 0 0 1 1 0 1 1 1 1 1 0 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 106650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  0  0  0  1  0 -1  1  0 -1  1  0 -1] (Indices: [3, 4, 12, 13, 15, 16, 18, 19]), Candidate: [2 1 2 0 0 1 1 0 1 1 0 2 1 0 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 106700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0  0 -1  0  0  0  1 -1  0  0  0  1 -1] (Indices: [3, 5, 6, 7, 8, 9, 14, 19]), Candidate: [ 2  1  2 -1  2  1  1  0  1  0  0  1  1  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 106750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0 -1  0  1  0 -1  0  0  1 -1  0  0  0] (Indices: [3, 5, 6, 7, 8, 11, 12, 16]), Candidate: [ 2  1  2 -1  2  1  1  0  0  1  1  1  0  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 106800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0 -1  0  0  0  1  0 -1  0  0  0  1 -1] (Indices: [3, 5, 6, 7, 8, 13, 14, 19]), Candidate: [ 2  1  2 -1  2  1  1  0  0  1  0  1  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 106850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  1  0 -1  0  1 -1  0  0  0  1 -1  0] (Indices: [3, 5, 6, 7, 9, 10, 13, 18]), Candidate: [ 2  1  2 -1  2  1  1 -1  2  1 -1  1  2  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 106900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  1 -1  0  1  0 -1  0  0  0  0  1 -1] (Indices: [3, 5, 6, 7, 9, 12, 13, 19]), Candidate: [ 2  1  2 -1  2  1  1 -1  2  0  0  2  1  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 106950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  1 -1  0  0  0  0  0  0  1  0  0 -1] (Indices: [3, 5, 6, 7, 9, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  1  1 -1  2  0  0  1  1  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 107000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  0  1 -1  0  1  0  0 -1  0  0  0  0] (Indices: [3, 5, 6, 7, 10, 13, 14, 15]), Candidate: [ 2  1  2 -1  2  1  1 -1  1  2 -1  1  2  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 107050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  0  0  1  0 -1  0  0  1  0 -1  0  0] (Indices: [3, 5, 6, 7, 11, 12, 16, 17]), Candidate: [ 2  1  2 -1  2  1  1 -1  1  1  1  1  0  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 107100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  0  0  0  1  0 -1  0  1  0 -1  0  0] (Indices: [3, 5, 6, 7, 12, 13, 16, 17]), Candidate: [ 2  1  2 -1  2  1  1 -1  1  1  0  2  1  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 107150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  0  0  0  0  0  1  0 -1  1 -1  1 -1] (Indices: [3, 5, 6, 7, 14, 15, 17, 19]), Candidate: [ 2  1  2 -1  2  1  1 -1  1  1  0  1  1  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 107200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1  0 -1  1  0 -1  0  0  1 -1  0  0  0] (Indices: [3, 5, 6, 8, 9, 11, 12, 16]), Candidate: [ 2  1  2 -1  2  1  0  1  1  0  1  1  0  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1  0 -1  0  0  1  0 -1  0  0  0  1 -1] (Indices: [3, 5, 6, 8, 9, 13, 14, 19]), Candidate: [ 2  1  2 -1  2  1  0  1  1  0  0  1  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 107300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1 -1  1  0 -1  0  0  1 -1  1 -1  0  0] (Indices: [3, 5, 6, 8, 10, 11, 15, 17]), Candidate: [ 2  1  2 -1  2  1  0  1  0  2  0  0  1  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1 -1  1 -1  0  0  1 -1  1 -1  1 -1  0] (Indices: [3, 5, 6, 8, 10, 14, 16, 18]), Candidate: [ 2  1  2 -1  2  1  0  1  0  2 -1  1  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 107400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1 -1  0  1 -1  1 -1  0  0  0  1  0 -1] (Indices: [3, 5, 6, 8, 11, 13, 18, 19]), Candidate: [ 2  1  2 -1  2  1  0  1  0  1  1  0  2  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1 -1  0  0  1 -1  0  1 -1  1 -1  1 -1] (Indices: [3, 5, 6, 8, 12, 15, 17, 19]), Candidate: [ 2  1  2 -1  2  1  0  1  0  1  0  2  0  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  1  0  0 -1  1 -1  0  1 -1  0  0  0] (Indices: [3, 5, 6, 9, 10, 11, 13, 16]), Candidate: [ 2  1  2 -1  2  1  0  0  2  1  0  0  2  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  1  0 -1  0  1 -1  0  1 -1  1 -1  0] (Indices: [3, 5, 6, 9, 10, 13, 16, 18]), Candidate: [ 2  1  2 -1  2  1  0  0  2  1 -1  1  2  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 107600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  1 -1  1 -1  1  0 -1  0  0  0  1 -1] (Indices: [3, 5, 6, 9, 11, 13, 14, 19]), Candidate: [ 2  1  2 -1  2  1  0  0  2  0  1  0  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 107650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  1 -1  0  1 -1  1 -1  1  0 -1  0  0] (Indices: [3, 5, 6, 9, 12, 14, 16, 17]), Candidate: [ 2  1  2 -1  2  1  0  0  2  0  0  2  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 107700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  1 -1  0  0  0  0  0  1  0  0  0 -1] (Indices: [3, 5, 6, 9, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  1  0  0  2  0  0  1  1  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  0  1  0 -1  0  0  1 -1  1  0 -1  0] (Indices: [3, 5, 6, 10, 11, 15, 17, 18]), Candidate: [ 2  1  2 -1  2  1  0  0  1  2  0  0  1  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  0  1 -1  0  1  0 -1  0  1 -1  1 -1] (Indices: [3, 5, 6, 10, 13, 14, 17, 19]), Candidate: [ 2  1  2 -1  2  1  0  0  1  2 -1  1  2  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 107850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  0  0  1  0 -1  1 -1  0  1 -1  1 -1] (Indices: [3, 5, 6, 11, 12, 14, 17, 19]), Candidate: [ 2  1  2 -1  2  1  0  0  1  1  1  1  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 107900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  0  0  0  1  0  0  0 -1  0  0  1 -1] (Indices: [3, 5, 6, 12, 13, 14, 15, 19]), Candidate: [ 2  1  2 -1  2  1  0  0  1  1  0  2  1  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  0  0  0  0  0  1  0 -1  1  0  0 -1] (Indices: [3, 5, 6, 14, 15, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  1  0  0  1  1  0  1  1  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0  0 -1  1 -1  1 -1  0  0  0  1 -1  0] (Indices: [3, 5, 7, 8, 9, 11, 13, 18]), Candidate: [ 2  1  2 -1  2  0  2  0  1  0  1  0  2  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0  0 -1  0  0  1 -1  0  0  1  0 -1  0] (Indices: [3, 5, 7, 8, 9, 13, 17, 18]), Candidate: [ 2  1  2 -1  2  0  2  0  1  0  0  1  2  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0 -1  1  0 -1  0  0  0  0  0  1  0 -1] (Indices: [3, 5, 7, 8, 10, 11, 18, 19]), Candidate: [ 2  1  2 -1  2  0  2  0  0  2  0  0  1  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0 -1  1 -1  0  0  0  1 -1  1  0 -1  0] (Indices: [3, 5, 7, 8, 10, 15, 17, 18]), Candidate: [ 2  1  2 -1  2  0  2  0  0  2 -1  1  1  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 108200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0 -1  0  1 -1  0  1 -1  0  1  0 -1  0] (Indices: [3, 5, 7, 8, 11, 14, 17, 18]), Candidate: [ 2  1  2 -1  2  0  2  0  0  1  1  0  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 108250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0 -1  0  0  0  1  0  0 -1  0  1 -1  0] (Indices: [3, 5, 7, 8, 13, 14, 15, 18]), Candidate: [ 2  1  2 -1  2  0  2  0  0  1  0  1  2  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  1  0  0 -1  0  1 -1  0  0  0  1 -1] (Indices: [3, 5, 7, 9, 10, 11, 14, 19]), Candidate: [ 2  1  2 -1  2  0  2 -1  2  1  0  0  1  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 108350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  1  0 -1  0  0  1  0 -1  0  0  1 -1] (Indices: [3, 5, 7, 9, 10, 14, 15, 19]), Candidate: [ 2  1  2 -1  2  0  2 -1  2  1 -1  1  1  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 108400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  1 -1  1 -1  1 -1  0  0  1  0 -1  0] (Indices: [3, 5, 7, 9, 11, 13, 17, 18]), Candidate: [ 2  1  2 -1  2  0  2 -1  2  0  1  0  2  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 108450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  1 -1  0  1 -1  0  1  0 -1  0  1 -1] (Indices: [3, 5, 7, 9, 12, 15, 16, 19]), Candidate: [ 2  1  2 -1  2  0  2 -1  2  0  0  2  0  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 108500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  0  1  0  0 -1  1 -1  1 -1  0  0  0] (Indices: [3, 5, 7, 10, 11, 12, 14, 16]), Candidate: [ 2  1  2 -1  2  0  2 -1  1  2  0  1  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 108550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  0  1 -1  1  0  0 -1  1 -1  0  0  0] (Indices: [3, 5, 7, 10, 12, 13, 14, 16]), Candidate: [ 2  1  2 -1  2  0  2 -1  1  2 -1  2  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 108600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  0  1 -1  0  1 -1  0  1  0  0 -1  0] (Indices: [3, 5, 7, 10, 13, 16, 17, 18]), Candidate: [ 2  1  2 -1  2  0  2 -1  1  2 -1  1  2  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 108650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  0  0  1  0 -1  0  0  1  0  0 -1  0] (Indices: [3, 5, 7, 11, 12, 16, 17, 18]), Candidate: [ 2  1  2 -1  2  0  2 -1  1  1  1  1  0  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 108700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  0  0  0  1  0 -1  1  0 -1  1 -1  0] (Indices: [3, 5, 7, 12, 13, 15, 16, 18]), Candidate: [ 2  1  2 -1  2  0  2 -1  1  1  0  2  1  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 108750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1  0  0  0  0 -1  0  0  0  0  1 -1  0] (Indices: [3, 5, 8, 9, 10, 11, 12, 18]), Candidate: [ 2  1  2 -1  2  0  1  1  1  1  0  1  0  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1  0  0 -1  0  1 -1  1 -1  1 -1  0  0] (Indices: [3, 5, 8, 9, 10, 13, 15, 17]), Candidate: [ 2  1  2 -1  2  0  1  1  1  1 -1  1  2  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 108850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1  0 -1  1 -1  1  0  0 -1  0  0  0  0] (Indices: [3, 5, 8, 9, 11, 13, 14, 15]), Candidate: [ 2  1  2 -1  2  0  1  1  1  0  1  0  2  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1  0 -1  0  1 -1  1  0  0 -1  0  0  0] (Indices: [3, 5, 8, 9, 12, 14, 15, 16]), Candidate: [ 2  1  2 -1  2  0  1  1  1  0  0  2  0  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1  0 -1  0  0  0  0  1  0  0  0 -1  0] (Indices: [3, 5, 8, 9, 15, 16, 17, 18]), Candidate: [ 2  1  2 -1  2  0  1  1  1  0  0  1  1  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1 -1  1  0 -1  0  1 -1  0  0  1  0 -1] (Indices: [3, 5, 8, 10, 11, 14, 18, 19]), Candidate: [ 2  1  2 -1  2  0  1  1  0  2  0  0  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 109050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1 -1  1 -1  0  1  0 -1  1  0 -1  0  0] (Indices: [3, 5, 8, 10, 13, 14, 16, 17]), Candidate: [ 2  1  2 -1  2  0  1  1  0  2 -1  1  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 109100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1 -1  0  1  0 -1  1 -1  1  0 -1  0  0] (Indices: [3, 5, 8, 11, 12, 14, 16, 17]), Candidate: [ 2  1  2 -1  2  0  1  1  0  1  1  1  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 109150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1 -1  0  1 -1  0  0  0  1  0  0  0 -1] (Indices: [3, 5, 8, 11, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  0  1  1  0  1  1  0  1  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1 -1  0  0  0  1 -1  0  1  0  0  0 -1] (Indices: [3, 5, 8, 13, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  0  1  1  0  1  0  1  2  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  1  0  0 -1  0  1 -1  0  1  0 -1  0] (Indices: [3, 5, 9, 10, 11, 14, 17, 18]), Candidate: [ 2  1  2 -1  2  0  1  0  2  1  0  0  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 109300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  1  0 -1  0  1  0  0 -1  0  1 -1  0] (Indices: [3, 5, 9, 10, 13, 14, 15, 18]), Candidate: [ 2  1  2 -1  2  0  1  0  2  1 -1  1  2  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 109350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  1 -1  1  0 -1  1  0 -1  0  1 -1  0] (Indices: [3, 5, 9, 11, 12, 14, 15, 18]), Candidate: [ 2  1  2 -1  2  0  1  0  2  0  1  1  0  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  1 -1  1 -1  0  0  1  0 -1  1  0 -1] (Indices: [3, 5, 9, 11, 15, 16, 18, 19]), Candidate: [ 2  1  2 -1  2  0  1  0  2  0  1  0  1  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  1 -1  0  0  1 -1  1  0 -1  1  0 -1] (Indices: [3, 5, 9, 13, 15, 16, 18, 19]), Candidate: [ 2  1  2 -1  2  0  1  0  2  0  0  1  2  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  0  1  0 -1  1  0 -1  1 -1  0  1 -1] (Indices: [3, 5, 10, 11, 13, 14, 16, 19]), Candidate: [ 2  1  2 -1  2  0  1  0  1  2  0  0  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 109550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  0  1 -1  1 -1  1  0  0 -1  1 -1  0] (Indices: [3, 5, 10, 12, 14, 15, 16, 18]), Candidate: [ 2  1  2 -1  2  0  1  0  1  2 -1  2  0  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 109600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  0  0  1  0  0 -1  1 -1  0  1  0 -1] (Indices: [3, 5, 11, 12, 13, 15, 18, 19]), Candidate: [ 2  1  2 -1  2  0  1  0  1  1  1  1  1  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  0  0  0  1  0  0 -1  0  1  0  0 -1] (Indices: [3, 5, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  0  1  0  1  1  0  2  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 109700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0  0  0 -1  0  0  0  0  1 -1  1 -1  0] (Indices: [3, 6, 7, 8, 9, 10, 16, 18]), Candidate: [ 2  1  2 -1  1  2  1  0  1  1 -1  1  1  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 109750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0  0 -1  0  1 -1  0  0  1 -1  0  1 -1] (Indices: [3, 6, 7, 8, 9, 12, 16, 19]), Candidate: [ 2  1  2 -1  1  2  1  0  1  0  0  2  0  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0 -1  1  0 -1  1 -1  0  0  0  1 -1  0] (Indices: [3, 6, 7, 8, 10, 11, 13, 18]), Candidate: [ 2  1  2 -1  1  2  1  0  0  2  0  0  2  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0 -1  1 -1  0  1 -1  0  0  1  0 -1  0] (Indices: [3, 6, 7, 8, 10, 13, 17, 18]), Candidate: [ 2  1  2 -1  1  2  1  0  0  2 -1  1  2  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 109900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0 -1  0  1 -1  1 -1  1 -1  1 -1  0  0] (Indices: [3, 6, 7, 8, 11, 13, 15, 17]), Candidate: [ 2  1  2 -1  1  2  1  0  0  1  1  0  2  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0 -1  0  0  1 -1  1 -1  1 -1  0  1 -1] (Indices: [3, 6, 7, 8, 12, 14, 16, 19]), Candidate: [ 2  1  2 -1  1  2  1  0  0  1  0  2  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 110000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  1  0  0  0 -1  1 -1  0  0  0  0  0] (Indices: [3, 6, 7, 9, 10, 11, 12, 14]), Candidate: [ 2  1  2 -1  1  2  1 -1  2  1  0  1  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 110050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  1  0 -1  0  1  0 -1  0  1 -1  0  0] (Indices: [3, 6, 7, 9, 10, 13, 14, 17]), Candidate: [ 2  1  2 -1  1  2  1 -1  2  1 -1  1  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 110100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  1 -1  1  0 -1  0  0  1 -1  0  1 -1] (Indices: [3, 6, 7, 9, 11, 12, 16, 19]), Candidate: [ 2  1  2 -1  1  2  1 -1  2  0  1  1  0  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 110150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  1 -1  0  1  0 -1  0  1 -1  0  1 -1] (Indices: [3, 6, 7, 9, 12, 13, 16, 19]), Candidate: [ 2  1  2 -1  1  2  1 -1  2  0  0  2  1  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 110200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  1 -1  0  0  0  1 -1  1  0  0 -1  0] (Indices: [3, 6, 7, 9, 14, 16, 17, 18]), Candidate: [ 2  1  2 -1  1  2  1 -1  2  0  0  1  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 110250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  0  1  0 -1  0  1 -1  1 -1  1 -1  0] (Indices: [3, 6, 7, 10, 11, 14, 16, 18]), Candidate: [ 2  1  2 -1  1  2  1 -1  1  2  0  0  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 110300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  0  1 -1  0  1  0  0  0 -1  0  0  0] (Indices: [3, 6, 7, 10, 13, 14, 15, 16]), Candidate: [ 2  1  2 -1  1  2  1 -1  1  2 -1  1  2  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 110350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  0  0  1  0 -1  1  0  0 -1  0  0  0] (Indices: [3, 6, 7, 11, 12, 14, 15, 16]), Candidate: [ 2  1  2 -1  1  2  1 -1  1  1  1  1  0  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 110400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  0  0  1 -1  0  0  1  0  0  0 -1  0] (Indices: [3, 6, 7, 11, 15, 16, 17, 18]), Candidate: [ 2  1  2 -1  1  2  1 -1  1  1  1  0  1  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 110450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  0  0  0  0  1 -1  1  0  0  0 -1  0] (Indices: [3, 6, 7, 13, 15, 16, 17, 18]), Candidate: [ 2  1  2 -1  1  2  1 -1  1  1  0  1  2  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 110500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1  0  0 -1  1 -1  0  1  0 -1  0  0  0] (Indices: [3, 6, 8, 9, 10, 12, 15, 16]), Candidate: [ 2  1  2 -1  1  2  0  1  1  1 -1  2  0  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 110550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1  0 -1  1  0  0 -1  0  0  0  0  1 -1] (Indices: [3, 6, 8, 9, 11, 12, 13, 19]), Candidate: [ 2  1  2 -1  1  2  0  1  1  0  1  1  1  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1  0 -1  1 -1  0  0  0  0  1  0  0 -1] (Indices: [3, 6, 8, 9, 11, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  2  0  1  1  0  1  0  1  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1  0 -1  0  0  1 -1  1 -1  1 -1  1 -1] (Indices: [3, 6, 8, 9, 13, 15, 17, 19]), Candidate: [ 2  1  2 -1  1  2  0  1  1  0  0  1  2  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1 -1  1  0 -1  1 -1  1 -1  0  0  1 -1] (Indices: [3, 6, 8, 10, 11, 13, 15, 19]), Candidate: [ 2  1  2 -1  1  2  0  1  0  2  0  0  2  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1 -1  1 -1  1 -1  1 -1  0  1 -1  1 -1] (Indices: [3, 6, 8, 10, 12, 14, 17, 19]), Candidate: [ 2  1  2 -1  1  2  0  1  0  2 -1  2  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 110800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1 -1  0  1  0  0  0 -1  0  0  1 -1  0] (Indices: [3, 6, 8, 11, 12, 13, 14, 18]), Candidate: [ 2  1  2 -1  1  2  0  1  0  1  1  1  1  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 110850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1 -1  0  1 -1  1 -1  0  1 -1  1  0 -1] (Indices: [3, 6, 8, 11, 13, 16, 18, 19]), Candidate: [ 2  1  2 -1  1  2  0  1  0  1  1  0  2  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1 -1  0  0  1 -1  0  1 -1  1  0  0 -1] (Indices: [3, 6, 8, 12, 15, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  2  0  1  0  1  0  2  0  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  1  0  0 -1  1 -1  1 -1  1 -1  0  0] (Indices: [3, 6, 9, 10, 11, 13, 15, 17]), Candidate: [ 2  1  2 -1  1  2  0  0  2  1  0  0  2  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  1  0 -1  1 -1  1 -1  1 -1  0  1 -1] (Indices: [3, 6, 9, 10, 12, 14, 16, 19]), Candidate: [ 2  1  2 -1  1  2  0  0  2  1 -1  2  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 111050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  1 -1  1  0  0  0 -1  1 -1  0  0  0] (Indices: [3, 6, 9, 11, 12, 13, 14, 16]), Candidate: [ 2  1  2 -1  1  2  0  0  2  0  1  1  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 111100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  1 -1  1 -1  1 -1  0  1  0  0 -1  0] (Indices: [3, 6, 9, 11, 13, 16, 17, 18]), Candidate: [ 2  1  2 -1  1  2  0  0  2  0  1  0  2  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  1 -1  0  1 -1  0  1  0  0 -1  1 -1] (Indices: [3, 6, 9, 12, 15, 16, 17, 19]), Candidate: [ 2  1  2 -1  1  2  0  0  2  0  0  2  0  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  0  1  0  0 -1  0  1  0  0 -1  0  0] (Indices: [3, 6, 10, 11, 12, 15, 16, 17]), Candidate: [ 2  1  2 -1  1  2  0  0  1  2  0  1  0  1  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  0  1 -1  1  0  0 -1  1 -1  1 -1  0] (Indices: [3, 6, 10, 12, 13, 14, 16, 18]), Candidate: [ 2  1  2 -1  1  2  0  0  1  2 -1  2  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 111300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  0  1 -1  0  0  0  1  0  0  0  0 -1] (Indices: [3, 6, 10, 15, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  2  0  0  1  2 -1  1  1  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 111350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  0  0  1 -1  1 -1  0  1  0  0  0 -1] (Indices: [3, 6, 11, 13, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  2  0  0  1  1  1  0  2  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0  0  0  0 -1  0  1 -1  0  1 -1  0  0] (Indices: [3, 7, 8, 9, 10, 11, 14, 17]), Candidate: [ 2  1  2 -1  1  1  2  0  1  1  0  0  1  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 111450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0  0  0 -1  0  0  1  0 -1  1 -1  0  0] (Indices: [3, 7, 8, 9, 10, 14, 15, 17]), Candidate: [ 2  1  2 -1  1  1  2  0  1  1 -1  1  1  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 111500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0  0 -1  1 -1  1 -1  0  1 -1  1 -1  0] (Indices: [3, 7, 8, 9, 11, 13, 16, 18]), Candidate: [ 2  1  2 -1  1  1  2  0  1  0  1  0  2  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0  0 -1  0  1 -1  0  1  0  0 -1  0  0] (Indices: [3, 7, 8, 9, 12, 15, 16, 17]), Candidate: [ 2  1  2 -1  1  1  2  0  1  0  0  2  0  1  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0 -1  1  0  0  0 -1  0  0  0  0  1 -1] (Indices: [3, 7, 8, 10, 11, 12, 13, 19]), Candidate: [ 2  1  2 -1  1  1  2  0  0  2  0  1  1  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0 -1  1  0 -1  0  0  0  0  1  0  0 -1] (Indices: [3, 7, 8, 10, 11, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  1  2  0  0  2  0  0  1  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0 -1  1 -1  0  1 -1  1 -1  1 -1  1 -1] (Indices: [3, 7, 8, 10, 13, 15, 17, 19]), Candidate: [ 2  1  2 -1  1  1  2  0  0  2 -1  1  2  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 111750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0 -1  0  1  0 -1  0  1 -1  1 -1  1 -1] (Indices: [3, 7, 8, 11, 12, 15, 17, 19]), Candidate: [ 2  1  2 -1  1  1  2  0  0  1  1  1  0  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0 -1  0  0  1  0  0 -1  0  0  1  0 -1] (Indices: [3, 7, 8, 12, 13, 14, 18, 19]), Candidate: [ 2  1  2 -1  1  1  2  0  0  1  0  2  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 111850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  1  0  0  0  0 -1  0  0  1 -1  0  0] (Indices: [3, 7, 9, 10, 11, 12, 13, 17]), Candidate: [ 2  1  2 -1  1  1  2 -1  2  1  0  1  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 111900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  1  0  0 -1  0  0  0  1  0 -1  1 -1] (Indices: [3, 7, 9, 10, 11, 16, 17, 19]), Candidate: [ 2  1  2 -1  1  1  2 -1  2  1  0  0  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 111950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  1  0 -1  0  1 -1  1  0 -1  0  1 -1] (Indices: [3, 7, 9, 10, 13, 15, 16, 19]), Candidate: [ 2  1  2 -1  1  1  2 -1  2  1 -1  1  2  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 112000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  1 -1  1  0 -1  0  1  0 -1  0  1 -1] (Indices: [3, 7, 9, 11, 12, 15, 16, 19]), Candidate: [ 2  1  2 -1  1  1  2 -1  2  0  1  1  0  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 112050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  1 -1  0  1  0  0 -1  0  1  0 -1  0] (Indices: [3, 7, 9, 12, 13, 14, 17, 18]), Candidate: [ 2  1  2 -1  1  1  2 -1  2  0  0  2  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 112100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  0  1  0  0  0  0 -1  1 -1  0  0  0] (Indices: [3, 7, 10, 11, 12, 13, 14, 16]), Candidate: [ 2  1  2 -1  1  1  2 -1  1  2  0  1  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 112150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  0  1  0 -1  1 -1  0  1  0  0 -1  0] (Indices: [3, 7, 10, 11, 13, 16, 17, 18]), Candidate: [ 2  1  2 -1  1  1  2 -1  1  2  0  0  2  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 112200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  0  1 -1  1 -1  0  1  0  0 -1  1 -1] (Indices: [3, 7, 10, 12, 15, 16, 17, 19]), Candidate: [ 2  1  2 -1  1  1  2 -1  1  2 -1  2  0  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 112250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  0  0  1  0 -1  1  0 -1  0  1  0 -1] (Indices: [3, 7, 11, 12, 14, 15, 18, 19]), Candidate: [ 2  1  2 -1  1  1  2 -1  1  1  1  1  0  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 112300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  0  0  0  1 -1  1 -1  1  0  0  0 -1] (Indices: [3, 7, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  1  2 -1  1  1  0  2  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 112350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1  0  0  0 -1  0  1 -1  1 -1  1 -1  0] (Indices: [3, 8, 9, 10, 11, 14, 16, 18]), Candidate: [ 2  1  2 -1  1  1  1  1  1  1  0  0  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 112400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1  0  0 -1  0  1  0  0  0 -1  0  0  0] (Indices: [3, 8, 9, 10, 13, 14, 15, 16]), Candidate: [ 2  1  2 -1  1  1  1  1  1  1 -1  1  2  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 112450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1  0 -1  1  0 -1  1  0  0 -1  0  0  0] (Indices: [3, 8, 9, 11, 12, 14, 15, 16]), Candidate: [ 2  1  2 -1  1  1  1  1  1  0  1  1  0  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1  0 -1  1 -1  0  0  1  0  0  0 -1  0] (Indices: [3, 8, 9, 11, 15, 16, 17, 18]), Candidate: [ 2  1  2 -1  1  1  1  1  1  0  1  0  1  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1  0 -1  0  0  1 -1  1  0  0  0 -1  0] (Indices: [3, 8, 9, 13, 15, 16, 17, 18]), Candidate: [ 2  1  2 -1  1  1  1  1  1  0  0  1  2  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1 -1  1  0 -1  1  0 -1  1  0 -1  0  0] (Indices: [3, 8, 10, 11, 13, 14, 16, 17]), Candidate: [ 2  1  2 -1  1  1  1  1  0  2  0  0  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 112650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1 -1  1 -1  1  0 -1  0  0  1  0  0 -1] (Indices: [3, 8, 10, 12, 13, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  1  1  1  0  2 -1  2  1  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 112700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1 -1  0  1  0  0 -1  1 -1  1  0 -1  0] (Indices: [3, 8, 11, 12, 13, 15, 17, 18]), Candidate: [ 2  1  2 -1  1  1  1  1  0  1  1  1  1  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1 -1  0  0  1  0  0 -1  1  0 -1  1 -1] (Indices: [3, 8, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  1  2 -1  1  1  1  1  0  1  0  2  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 112800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  1  0  0  0 -1  0  1 -1  1 -1  1 -1] (Indices: [3, 9, 10, 11, 12, 15, 17, 19]), Candidate: [ 2  1  2 -1  1  1  1  0  2  1  0  1  0  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  1  0 -1  1  0  0 -1  0  0  1  0 -1] (Indices: [3, 9, 10, 12, 13, 14, 18, 19]), Candidate: [ 2  1  2 -1  1  1  1  0  2  1 -1  2  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 112900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  1 -1  1  0  0  0  0 -1  0  0  1 -1] (Indices: [3, 9, 11, 12, 13, 14, 15, 19]), Candidate: [ 2  1  2 -1  1  1  1  0  2  0  1  1  1  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  1 -1  1 -1  0  1  0 -1  1  0  0 -1] (Indices: [3, 9, 11, 14, 15, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  1  1  0  2  0  1  0  1  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  0  1  0  0  0 -1  0  0  1  0  0 -1] (Indices: [3, 10, 11, 12, 13, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  1  1  0  1  2  0  1  1  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  0  1 -1  1  0 -1  1 -1  1  0  0 -1] (Indices: [3, 10, 12, 13, 15, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  1  1  0  1  2 -1  2  1  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 113100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 -1] (Indices: [3, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  1  1  0  1  1  0  1  2  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0 -1  1  0 -1  0  0  0  1 -1  0  0  0] (Indices: [4, 5, 6, 7, 8, 10, 11, 16]), Candidate: [2 1 1 1 1 1 1 0 0 2 0 0 1 1 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 113200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0 -1  0  1 -1  0  0  1  0 -1  0  0  0] (Indices: [4, 5, 6, 7, 8, 11, 15, 16]), Candidate: [2 1 1 1 1 1 1 0 0 1 1 0 1 1 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 113250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0 -1  0  0  0  0  1 -1  1  0 -1  0  0] (Indices: [4, 5, 6, 7, 8, 14, 16, 17]), Candidate: [ 2  1  1  1  1  1  1  0  0  1  0  1  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  1  0 -1  0  0  0  0  0  1 -1  1 -1] (Indices: [4, 5, 6, 7, 9, 10, 17, 19]), Candidate: [ 2  1  1  1  1  1  1 -1  2  1 -1  1  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 113350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  1 -1  0  1 -1  0  0  0  0  1  0 -1] (Indices: [4, 5, 6, 7, 9, 12, 18, 19]), Candidate: [ 2  1  1  1  1  1  1 -1  2  0  0  2  0  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  0  1  0 -1  0  1 -1  1 -1  0  0  0] (Indices: [4, 5, 6, 7, 10, 11, 14, 16]), Candidate: [ 2  1  1  1  1  1  1 -1  1  2  0  0  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 113450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  0  1 -1  0  0  1  0  0 -1  0  0  0] (Indices: [4, 5, 6, 7, 10, 14, 15, 16]), Candidate: [ 2  1  1  1  1  1  1 -1  1  2 -1  1  1  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 113500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  0  0  1 -1  1 -1  0  1  0 -1  0  0] (Indices: [4, 5, 6, 7, 11, 13, 16, 17]), Candidate: [ 2  1  1  1  1  1  1 -1  1  1  1  0  2  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  0  0  0  1 -1  1 -1  0  0  1  0 -1] (Indices: [4, 5, 6, 7, 12, 14, 18, 19]), Candidate: [ 2  1  1  1  1  1  1 -1  1  1  0  2  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 113600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1  0  0  0 -1  0  0  0  1 -1  0  0  0] (Indices: [4, 5, 6, 8, 9, 10, 11, 16]), Candidate: [2 1 1 1 1 1 0 1 1 1 0 0 1 1 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 113650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1  0 -1  1 -1  0  0  1  0 -1  0  0  0] (Indices: [4, 5, 6, 8, 9, 11, 15, 16]), Candidate: [2 1 1 1 1 1 0 1 1 0 1 0 1 1 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 113700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1  0 -1  0  0  0  1 -1  1  0 -1  0  0] (Indices: [4, 5, 6, 8, 9, 14, 16, 17]), Candidate: [ 2  1  1  1  1  1  0  1  1  0  0  1  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1 -1  1 -1  1 -1  1  0 -1  0  0  0  0] (Indices: [4, 5, 6, 8, 10, 12, 14, 15]), Candidate: [ 2  1  1  1  1  1  0  1  0  2 -1  2  0  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1 -1  0  1  0  0  0 -1  0  0  0  0  0] (Indices: [4, 5, 6, 8, 11, 12, 13, 14]), Candidate: [ 2  1  1  1  1  1  0  1  0  1  1  1  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1 -1  0  1 -1  0  0  1 -1  1 -1  1 -1] (Indices: [4, 5, 6, 8, 11, 15, 17, 19]), Candidate: [2 1 1 1 1 1 0 1 0 1 1 0 1 1 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 113900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1 -1  0  0  0  1  0 -1  0  0  1  0 -1] (Indices: [4, 5, 6, 8, 13, 14, 18, 19]), Candidate: [ 2  1  1  1  1  1  0  1  0  1  0  1  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  1  0  0 -1  0  0  0  1 -1  0  1 -1] (Indices: [4, 5, 6, 9, 10, 11, 16, 19]), Candidate: [2 1 1 1 1 1 0 0 2 1 0 0 1 1 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 114000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  1  0 -1  0  0  0  1  0  0 -1  0  0] (Indices: [4, 5, 6, 9, 10, 15, 16, 17]), Candidate: [ 2  1  1  1  1  1  0  0  2  1 -1  1  1  1  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  1 -1  1 -1  0  1 -1  1  0 -1  0  0] (Indices: [4, 5, 6, 9, 11, 14, 16, 17]), Candidate: [ 2  1  1  1  1  1  0  0  2  0  1  0  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  1 -1  0  1 -1  0  0  0  1  0  0 -1] (Indices: [4, 5, 6, 9, 12, 17, 18, 19]), Candidate: [2 1 1 1 1 1 0 0 2 0 0 2 0 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 114150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  0  1  0  0 -1  0  1 -1  0  0  1 -1] (Indices: [4, 5, 6, 10, 11, 12, 15, 19]), Candidate: [2 1 1 1 1 1 0 0 1 2 0 1 0 1 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 114200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  0  1 -1  1  0 -1  1 -1  0  0  1 -1] (Indices: [4, 5, 6, 10, 12, 13, 15, 19]), Candidate: [ 2  1  1  1  1  1  0  0  1  2 -1  2  1  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  0  1 -1  0  0  1  0 -1  1  0 -1  0] (Indices: [4, 5, 6, 10, 14, 15, 17, 18]), Candidate: [ 2  1  1  1  1  1  0  0  1  2 -1  1  1  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  0  0  1 -1  1  0  0 -1  0  0  1 -1] (Indices: [4, 5, 6, 11, 13, 14, 15, 19]), Candidate: [2 1 1 1 1 1 0 0 1 1 1 0 2 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 114350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  0  0  0  1  0 -1  0  1 -1  1  0 -1] (Indices: [4, 5, 6, 12, 13, 16, 18, 19]), Candidate: [2 1 1 1 1 1 0 0 1 1 0 2 1 0 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 114400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0  0  0 -1  1 -1  0  0  0  1 -1  0  0] (Indices: [4, 5, 7, 8, 9, 10, 12, 17]), Candidate: [ 2  1  1  1  1  0  2  0  1  1 -1  2  0  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0  0 -1  1 -1  0  0  0  0  1 -1  1 -1] (Indices: [4, 5, 7, 8, 9, 11, 17, 19]), Candidate: [2 1 1 1 1 0 2 0 1 0 1 0 1 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 114500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0  0 -1  0  0  0  0  1  0 -1  0  1 -1] (Indices: [4, 5, 7, 8, 9, 15, 16, 19]), Candidate: [2 1 1 1 1 0 2 0 1 0 0 1 1 1 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 114550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0 -1  1 -1  1 -1  0  1 -1  0  0  1 -1] (Indices: [4, 5, 7, 8, 10, 12, 15, 19]), Candidate: [ 2  1  1  1  1  0  2  0  0  2 -1  2  0  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0 -1  0  1  0 -1  1 -1  0  1 -1  0  0] (Indices: [4, 5, 7, 8, 11, 12, 14, 17]), Candidate: [ 2  1  1  1  1  0  2  0  0  1  1  1  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0 -1  0  0  1  0  0 -1  0  1 -1  0  0] (Indices: [4, 5, 7, 8, 12, 13, 14, 17]), Candidate: [ 2  1  1  1  1  0  2  0  0  1  0  2  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0 -1  0  0  0  1 -1  0  1  0 -1  1 -1] (Indices: [4, 5, 7, 8, 13, 16, 17, 19]), Candidate: [2 1 1 1 1 0 2 0 0 1 0 1 2 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 114750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  1  0 -1  1  0 -1  0  0  0  1 -1  0] (Indices: [4, 5, 7, 9, 10, 12, 13, 18]), Candidate: [ 2  1  1  1  1  0  2 -1  2  1 -1  2  1  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 114800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  1  0 -1  0  0  0  0  1 -1  1  0 -1] (Indices: [4, 5, 7, 9, 10, 16, 18, 19]), Candidate: [ 2  1  1  1  1  0  2 -1  2  1 -1  1  1  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 114850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  1 -1  1 -1  0  0  1  0 -1  0  1 -1] (Indices: [4, 5, 7, 9, 11, 15, 16, 19]), Candidate: [ 2  1  1  1  1  0  2 -1  2  0  1  0  1  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  1 -1  0  0  1  0 -1  0  1  0 -1  0] (Indices: [4, 5, 7, 9, 13, 14, 17, 18]), Candidate: [ 2  1  1  1  1  0  2 -1  2  0  0  1  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 114950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  0  1  0 -1  1  0 -1  1 -1  0  0  0] (Indices: [4, 5, 7, 10, 11, 13, 14, 16]), Candidate: [ 2  1  1  1  1  0  2 -1  1  2  0  0  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 115000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  0  1 -1  1 -1  1  0 -1  1 -1  0  0] (Indices: [4, 5, 7, 10, 12, 14, 15, 17]), Candidate: [ 2  1  1  1  1  0  2 -1  1  2 -1  2  0  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 115050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  0  1 -1  0  0  0  1  0  0 -1  1 -1] (Indices: [4, 5, 7, 10, 15, 16, 17, 19]), Candidate: [ 2  1  1  1  1  0  2 -1  1  2 -1  1  1  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 115100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  0  0  1 -1  1 -1  1  0 -1  1 -1  0] (Indices: [4, 5, 7, 11, 13, 15, 16, 18]), Candidate: [ 2  1  1  1  1  0  2 -1  1  1  1  0  2  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  0  0  0  1 -1  1 -1  1  0  0 -1  0] (Indices: [4, 5, 7, 12, 14, 16, 17, 18]), Candidate: [ 2  1  1  1  1  0  2 -1  1  1  0  2  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 115200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1  0  0  0 -1  0  0  1 -1  0  1 -1  0] (Indices: [4, 5, 8, 9, 10, 11, 15, 18]), Candidate: [2 1 1 1 1 0 1 1 1 1 0 0 1 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 115250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1  0  0 -1  0  0  1 -1  1 -1  0  1 -1] (Indices: [4, 5, 8, 9, 10, 14, 16, 19]), Candidate: [ 2  1  1  1  1  0  1  1  1  1 -1  1  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 115300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1  0 -1  1 -1  0  1  0  0 -1  0  0  0] (Indices: [4, 5, 8, 9, 11, 14, 15, 16]), Candidate: [2 1 1 1 1 0 1 1 1 0 1 0 1 2 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 115350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1  0 -1  0  1 -1  0  1 -1  0  1  0 -1] (Indices: [4, 5, 8, 9, 12, 15, 18, 19]), Candidate: [2 1 1 1 1 0 1 1 1 0 0 2 0 1 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 115400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1 -1  1  0  0 -1  1 -1  0  0  0  1 -1] (Indices: [4, 5, 8, 10, 11, 12, 14, 19]), Candidate: [ 2  1  1  1  1  0  1  1  0  2  0  1  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1 -1  1 -1  1  0  0 -1  0  0  0  1 -1] (Indices: [4, 5, 8, 10, 12, 13, 14, 19]), Candidate: [ 2  1  1  1  1  0  1  1  0  2 -1  2  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 115500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1 -1  1 -1  0  1 -1  0  0  1  0  0 -1] (Indices: [4, 5, 8, 10, 13, 17, 18, 19]), Candidate: [ 2  1  1  1  1  0  1  1  0  2 -1  1  2  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1 -1  0  1  0 -1  0  0  0  1  0  0 -1] (Indices: [4, 5, 8, 11, 12, 17, 18, 19]), Candidate: [2 1 1 1 1 0 1 1 0 1 1 1 0 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 115600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1 -1  0  0  1  0 -1  1 -1  1 -1  1 -1] (Indices: [4, 5, 8, 12, 13, 15, 17, 19]), Candidate: [2 1 1 1 1 0 1 1 0 1 0 2 1 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 115650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  1  0  0  0 -1  1 -1  0  1 -1  0  0] (Indices: [4, 5, 9, 10, 11, 12, 14, 17]), Candidate: [ 2  1  1  1  1  0  1  0  2  1  0  1  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  1  0 -1  1  0  0 -1  0  1 -1  0  0] (Indices: [4, 5, 9, 10, 12, 13, 14, 17]), Candidate: [ 2  1  1  1  1  0  1  0  2  1 -1  2  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 115750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  1  0 -1  0  1 -1  0  1  0 -1  1 -1] (Indices: [4, 5, 9, 10, 13, 16, 17, 19]), Candidate: [ 2  1  1  1  1  0  1  0  2  1 -1  1  2  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  1 -1  1  0 -1  0  0  1  0 -1  1 -1] (Indices: [4, 5, 9, 11, 12, 16, 17, 19]), Candidate: [2 1 1 1 1 0 1 0 2 0 1 1 0 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 115850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  1 -1  0  1  0 -1  1  0 -1  0  1 -1] (Indices: [4, 5, 9, 12, 13, 15, 16, 19]), Candidate: [2 1 1 1 1 0 1 0 2 0 0 2 1 0 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 115900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  0  1  0  0  0 -1  1 -1  1 -1  0  0] (Indices: [4, 5, 10, 11, 12, 13, 15, 17]), Candidate: [2 1 1 1 1 0 1 0 1 2 0 1 1 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 115950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  0  1  0 -1  0  1  0  0 -1  1 -1  0] (Indices: [4, 5, 10, 11, 14, 15, 16, 18]), Candidate: [2 1 1 1 1 0 1 0 1 2 0 0 1 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 116000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  0  1 -1  0  1  0  0  0 -1  1 -1  0] (Indices: [4, 5, 10, 13, 14, 15, 16, 18]), Candidate: [ 2  1  1  1  1  0  1  0  1  2 -1  1  2  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  0  0  1  0 -1  0  1  0  0  0 -1  0] (Indices: [4, 5, 11, 12, 15, 16, 17, 18]), Candidate: [2 1 1 1 1 0 1 0 1 1 1 1 0 1 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 116100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  0  0  0  0  1  0  0 -1  1  0  0 -1] (Indices: [4, 5, 13, 14, 15, 17, 18, 19]), Candidate: [2 1 1 1 1 0 1 0 1 1 0 1 2 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 116150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0  0 -1  1 -1  1 -1  0  0  1 -1  0  0] (Indices: [4, 6, 7, 8, 9, 11, 13, 17]), Candidate: [2 1 1 1 0 2 1 0 1 0 1 0 2 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 116200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0  0 -1  0  0  1 -1  0  1 -1  0  1 -1] (Indices: [4, 6, 7, 8, 9, 13, 16, 19]), Candidate: [2 1 1 1 0 2 1 0 1 0 0 1 2 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 116250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0 -1  1  0 -1  0  0  0  0  1 -1  1 -1] (Indices: [4, 6, 7, 8, 10, 11, 17, 19]), Candidate: [2 1 1 1 0 2 1 0 0 2 0 0 1 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 116300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0 -1  1 -1  0  0  0  1  0 -1  0  1 -1] (Indices: [4, 6, 7, 8, 10, 15, 16, 19]), Candidate: [ 2  1  1  1  0  2  1  0  0  2 -1  1  1  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0 -1  0  1 -1  0  1 -1  1 -1  0  1 -1] (Indices: [4, 6, 7, 8, 11, 14, 16, 19]), Candidate: [ 2  1  1  1  0  2  1  0  0  1  1  0  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0 -1  0  0  0  1  0  0 -1  1 -1  0  0] (Indices: [4, 6, 7, 8, 13, 14, 15, 17]), Candidate: [2 1 1 1 0 2 1 0 0 1 0 1 2 1 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 116450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  1  0  0 -1  0  1 -1  0  0  1 -1  0] (Indices: [4, 6, 7, 9, 10, 11, 14, 18]), Candidate: [ 2  1  1  1  0  2  1 -1  2  1  0  0  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 116500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  1  0 -1  0  0  1  0 -1  0  1 -1  0] (Indices: [4, 6, 7, 9, 10, 14, 15, 18]), Candidate: [ 2  1  1  1  0  2  1 -1  2  1 -1  1  1  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 116550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  1 -1  1 -1  1 -1  0  1 -1  0  1 -1] (Indices: [4, 6, 7, 9, 11, 13, 16, 19]), Candidate: [ 2  1  1  1  0  2  1 -1  2  0  1  0  2  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  1 -1  0  1 -1  0  1  0 -1  1 -1  0] (Indices: [4, 6, 7, 9, 12, 15, 16, 18]), Candidate: [ 2  1  1  1  0  2  1 -1  2  0  0  2  0  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  0  1  0  0 -1  1  0 -1  0  0  0  0] (Indices: [4, 6, 7, 10, 11, 12, 14, 15]), Candidate: [ 2  1  1  1  0  2  1 -1  1  2  0  1  0  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  0  1 -1  1  0  0  0 -1  0  0  0  0] (Indices: [4, 6, 7, 10, 12, 13, 14, 15]), Candidate: [ 2  1  1  1  0  2  1 -1  1  2 -1  2  1  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 116750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  0  1 -1  0  1 -1  1 -1  0  1  0 -1] (Indices: [4, 6, 7, 10, 13, 15, 18, 19]), Candidate: [ 2  1  1  1  0  2  1 -1  1  2 -1  1  2  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 116800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  0  0  1  0 -1  0  1 -1  0  1  0 -1] (Indices: [4, 6, 7, 11, 12, 15, 18, 19]), Candidate: [ 2  1  1  1  0  2  1 -1  1  1  1  1  0  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  0  0  0  1  0 -1  1  0  0 -1  0  0] (Indices: [4, 6, 7, 12, 13, 15, 16, 17]), Candidate: [ 2  1  1  1  0  2  1 -1  1  1  0  2  1  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1  0  0  0  0 -1  0  0  0  1 -1  0  0] (Indices: [4, 6, 8, 9, 10, 11, 12, 17]), Candidate: [2 1 1 1 0 2 0 1 1 1 0 1 0 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 116950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1  0  0 -1  0  1 -1  1  0 -1  0  0  0] (Indices: [4, 6, 8, 9, 10, 13, 15, 16]), Candidate: [ 2  1  1  1  0  2  0  1  1  1 -1  1  2  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1  0 -1  1  0 -1  0  0  0  0  1  0 -1] (Indices: [4, 6, 8, 9, 11, 12, 18, 19]), Candidate: [2 1 1 1 0 2 0 1 1 0 1 1 0 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 117050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1  0 -1  0  1  0 -1  0  0  0  1  0 -1] (Indices: [4, 6, 8, 9, 12, 13, 18, 19]), Candidate: [2 1 1 1 0 2 0 1 1 0 0 2 1 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 117100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1  0 -1  0  0  0  1 -1  0  1  0  0 -1] (Indices: [4, 6, 8, 9, 14, 17, 18, 19]), Candidate: [ 2  1  1  1  0  2  0  1  1  0  0  1  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1 -1  1  0 -1  0  1 -1  0  1 -1  1 -1] (Indices: [4, 6, 8, 10, 11, 14, 17, 19]), Candidate: [ 2  1  1  1  0  2  0  1  0  2  0  0  1  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1 -1  1 -1  0  1  0  0 -1  0  0  1 -1] (Indices: [4, 6, 8, 10, 13, 14, 15, 19]), Candidate: [ 2  1  1  1  0  2  0  1  0  2 -1  1  2  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1 -1  0  1  0 -1  1  0 -1  0  0  1 -1] (Indices: [4, 6, 8, 11, 12, 14, 15, 19]), Candidate: [2 1 1 1 0 2 0 1 0 1 1 1 0 2 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 117300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1 -1  0  1 -1  0  0  1 -1  1  0  0 -1] (Indices: [4, 6, 8, 11, 15, 17, 18, 19]), Candidate: [2 1 1 1 0 2 0 1 0 1 1 0 1 1 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 117350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1 -1  0  0  0  1 -1  1 -1  1  0  0 -1] (Indices: [4, 6, 8, 13, 15, 17, 18, 19]), Candidate: [2 1 1 1 0 2 0 1 0 1 0 1 2 0 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 117400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  1  0  0 -1  0  1 -1  1 -1  0  1 -1] (Indices: [4, 6, 9, 10, 11, 14, 16, 19]), Candidate: [ 2  1  1  1  0  2  0  0  2  1  0  0  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  1  0 -1  0  1  0  0 -1  1 -1  0  0] (Indices: [4, 6, 9, 10, 13, 14, 15, 17]), Candidate: [ 2  1  1  1  0  2  0  0  2  1 -1  1  2  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  1 -1  1  0 -1  1  0 -1  1 -1  0  0] (Indices: [4, 6, 9, 11, 12, 14, 15, 17]), Candidate: [2 1 1 1 0 2 0 0 2 0 1 1 0 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 117550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  1 -1  1 -1  0  0  1  0  0 -1  1 -1] (Indices: [4, 6, 9, 11, 15, 16, 17, 19]), Candidate: [2 1 1 1 0 2 0 0 2 0 1 0 1 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 117600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  1 -1  0  0  1 -1  1  0  0 -1  1 -1] (Indices: [4, 6, 9, 13, 15, 16, 17, 19]), Candidate: [2 1 1 1 0 2 0 0 2 0 0 1 2 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 117650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  0  1  0 -1  1  0 -1  1 -1  1 -1  0] (Indices: [4, 6, 10, 11, 13, 14, 16, 18]), Candidate: [ 2  1  1  1  0  2  0  0  1  2  0  0  2  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  0  1 -1  1 -1  1  0  0  0 -1  0  0] (Indices: [4, 6, 10, 12, 14, 15, 16, 17]), Candidate: [ 2  1  1  1  0  2  0  0  1  2 -1  2  0  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  0  0  1  0  0 -1  1 -1  1 -1  1 -1] (Indices: [4, 6, 11, 12, 13, 15, 17, 19]), Candidate: [2 1 1 1 0 2 0 0 1 1 1 1 1 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 117800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  0  0  0  1  0  0 -1  1 -1  1  0 -1] (Indices: [4, 6, 12, 13, 14, 16, 18, 19]), Candidate: [ 2  1  1  1  0  2  0  0  1  1  0  2  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0  0  0 -1  1  0 -1  0  1 -1  0  0  0] (Indices: [4, 7, 8, 9, 10, 12, 13, 16]), Candidate: [ 2  1  1  1  0  1  2  0  1  1 -1  2  1  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0  0  0 -1  0  0  0  0  1  0  0 -1  0] (Indices: [4, 7, 8, 9, 10, 16, 17, 18]), Candidate: [ 2  1  1  1  0  1  2  0  1  1 -1  1  1  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0  0 -1  1 -1  0  0  1  0  0 -1  0  0] (Indices: [4, 7, 8, 9, 11, 15, 16, 17]), Candidate: [2 1 1 1 0 1 2 0 1 0 1 0 1 1 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 118000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0  0 -1  0  0  1  0 -1  1 -1  1 -1  0] (Indices: [4, 7, 8, 9, 13, 14, 16, 18]), Candidate: [ 2  1  1  1  0  1  2  0  1  0  0  1  2  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0 -1  1  0  0 -1  0  0  0  0  1  0 -1] (Indices: [4, 7, 8, 10, 11, 12, 18, 19]), Candidate: [2 1 1 1 0 1 2 0 0 2 0 1 0 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 118100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0 -1  1 -1  1  0 -1  0  0  0  1  0 -1] (Indices: [4, 7, 8, 10, 12, 13, 18, 19]), Candidate: [ 2  1  1  1  0  1  2  0  0  2 -1  2  1  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0 -1  1 -1  0  0  1 -1  0  1  0  0 -1] (Indices: [4, 7, 8, 10, 14, 17, 18, 19]), Candidate: [ 2  1  1  1  0  1  2  0  0  2 -1  1  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 118200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0 -1  0  1 -1  1  0 -1  0  0  1  0 -1] (Indices: [4, 7, 8, 11, 13, 14, 18, 19]), Candidate: [ 2  1  1  1  0  1  2  0  0  1  1  0  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0 -1  0  0  1 -1  1  0 -1  1 -1  1 -1] (Indices: [4, 7, 8, 12, 14, 15, 17, 19]), Candidate: [2 1 1 1 0 1 2 0 0 1 0 2 0 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 118300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  1  0  0  0 -1  0  0  0  1  0 -1  0] (Indices: [4, 7, 9, 10, 11, 12, 17, 18]), Candidate: [ 2  1  1  1  0  1  2 -1  2  1  0  1  0  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  1  0 -1  1  0 -1  0  0  1  0 -1  0] (Indices: [4, 7, 9, 10, 12, 13, 17, 18]), Candidate: [ 2  1  1  1  0  1  2 -1  2  1 -1  2  1  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 118400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  1  0 -1  0  0  1 -1  1  0 -1  1 -1] (Indices: [4, 7, 9, 10, 14, 16, 17, 19]), Candidate: [ 2  1  1  1  0  1  2 -1  2  1 -1  1  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 118450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  1 -1  1 -1  1  0 -1  0  1  0 -1  0] (Indices: [4, 7, 9, 11, 13, 14, 17, 18]), Candidate: [ 2  1  1  1  0  1  2 -1  2  0  1  0  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 118500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  1 -1  0  1 -1  1  0  0 -1  0  1 -1] (Indices: [4, 7, 9, 12, 14, 15, 16, 19]), Candidate: [ 2  1  1  1  0  1  2 -1  2  0  0  2  0  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  0  1  0  0 -1  1  0 -1  1 -1  0  0] (Indices: [4, 7, 10, 11, 12, 14, 15, 17]), Candidate: [ 2  1  1  1  0  1  2 -1  1  2  0  1  0  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  0  1  0 -1  0  0  1  0  0 -1  1 -1] (Indices: [4, 7, 10, 11, 15, 16, 17, 19]), Candidate: [ 2  1  1  1  0  1  2 -1  1  2  0  0  1  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  0  1 -1  0  1 -1  1  0  0 -1  1 -1] (Indices: [4, 7, 10, 13, 15, 16, 17, 19]), Candidate: [ 2  1  1  1  0  1  2 -1  1  2 -1  1  2  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 118700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  0  0  1 -1  1  0  0 -1  0  1  0 -1] (Indices: [4, 7, 11, 13, 14, 15, 18, 19]), Candidate: [ 2  1  1  1  0  1  2 -1  1  1  1  0  2  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1  0  0  0  0 -1  1  0 -1  0  0  0  0] (Indices: [4, 8, 9, 10, 11, 12, 14, 15]), Candidate: [2 1 1 1 0 1 1 1 1 1 0 1 0 2 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 118800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1  0  0 -1  1  0  0  0 -1  0  0  0  0] (Indices: [4, 8, 9, 10, 12, 13, 14, 15]), Candidate: [ 2  1  1  1  0  1  1  1  1  1 -1  2  1  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1  0  0 -1  0  1 -1  1 -1  0  1  0 -1] (Indices: [4, 8, 9, 10, 13, 15, 18, 19]), Candidate: [ 2  1  1  1  0  1  1  1  1  1 -1  1  2  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1  0 -1  1  0 -1  0  1 -1  0  1  0 -1] (Indices: [4, 8, 9, 11, 12, 15, 18, 19]), Candidate: [2 1 1 1 0 1 1 1 1 0 1 1 0 1 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 118950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1  0 -1  0  1  0 -1  1  0  0 -1  0  0] (Indices: [4, 8, 9, 12, 13, 15, 16, 17]), Candidate: [2 1 1 1 0 1 1 1 1 0 0 2 1 0 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 119000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1 -1  1  0  0  0  0 -1  0  0  0  1 -1] (Indices: [4, 8, 10, 11, 12, 13, 14, 19]), Candidate: [ 2  1  1  1  0  1  1  1  0  2  0  1  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1 -1  1  0 -1  1 -1  0  0  1  0  0 -1] (Indices: [4, 8, 10, 11, 13, 17, 18, 19]), Candidate: [2 1 1 1 0 1 1 1 0 2 0 0 2 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 119100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1 -1  1 -1  1 -1  0  0  1  0  0  0 -1] (Indices: [4, 8, 10, 12, 16, 17, 18, 19]), Candidate: [ 2  1  1  1  0  1  1  1  0  2 -1  2  0  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1 -1  0  1  0 -1  1 -1  1 -1  1  0 -1] (Indices: [4, 8, 11, 12, 14, 16, 18, 19]), Candidate: [ 2  1  1  1  0  1  1  1  0  1  1  1  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1 -1  0  0  0  1  0  0  0  0 -1  1 -1] (Indices: [4, 8, 13, 14, 15, 16, 17, 19]), Candidate: [2 1 1 1 0 1 1 1 0 1 0 1 2 1 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 119250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  1  0  0 -1  1  0 -1  0  0  1  0 -1] (Indices: [4, 9, 10, 11, 13, 14, 18, 19]), Candidate: [ 2  1  1  1  0  1  1  0  2  1  0  0  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  1  0 -1  1 -1  1  0 -1  1 -1  1 -1] (Indices: [4, 9, 10, 12, 14, 15, 17, 19]), Candidate: [ 2  1  1  1  0  1  1  0  2  1 -1  2  0  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  1 -1  1  0  0 -1  0  1 -1  1  0 -1] (Indices: [4, 9, 11, 12, 13, 16, 18, 19]), Candidate: [2 1 1 1 0 1 1 0 2 0 1 1 1 0 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 119400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  1 -1  0  1  0 -1  1  0 -1  1  0 -1] (Indices: [4, 9, 12, 13, 15, 16, 18, 19]), Candidate: [2 1 1 1 0 1 1 0 2 0 0 2 1 0 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 119450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  0  1  0  0 -1  0  0  1  0  0  0 -1] (Indices: [4, 10, 11, 12, 16, 17, 18, 19]), Candidate: [2 1 1 1 0 1 1 0 1 2 0 1 0 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 119500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  0  0  1  0  0  0  0  0  0 -1  0  0] (Indices: [4, 11, 12, 13, 14, 15, 16, 17]), Candidate: [2 1 1 1 0 1 1 0 1 1 1 1 1 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 119550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0  0  0 -1  1 -1  0  0  0  0  0  1 -1] (Indices: [5, 6, 7, 8, 9, 10, 12, 19]), Candidate: [ 2  1  1  0  2  1  1  0  1  1 -1  2  0  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0  0 -1  0  1  0  0 -1  0  0  0  0  0] (Indices: [5, 6, 7, 8, 9, 12, 13, 14]), Candidate: [ 2  1  1  0  2  1  1  0  1  0  0  2  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0  0 -1  0  0  0  0  1 -1  1 -1  1 -1] (Indices: [5, 6, 7, 8, 9, 15, 17, 19]), Candidate: [2 1 1 0 2 1 1 0 1 0 0 1 1 1 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 119700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0 -1  1 -1  1 -1  0  0  1 -1  1 -1  0] (Indices: [5, 6, 7, 8, 10, 12, 16, 18]), Candidate: [ 2  1  1  0  2  1  1  0  0  2 -1  2  0  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0 -1  0  1  0 -1  1 -1  0  0  0  1 -1] (Indices: [5, 6, 7, 8, 11, 12, 14, 19]), Candidate: [ 2  1  1  0  2  1  1  0  0  1  1  1  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0 -1  0  0  1  0  0 -1  0  0  0  1 -1] (Indices: [5, 6, 7, 8, 12, 13, 14, 19]), Candidate: [ 2  1  1  0  2  1  1  0  0  1  0  2  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0 -1  0  0  0  1 -1  0  0  1  0  0 -1] (Indices: [5, 6, 7, 8, 13, 17, 18, 19]), Candidate: [2 1 1 0 2 1 1 0 0 1 0 1 2 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 119900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  1  0 -1  1 -1  1  0 -1  0  0  0  0] (Indices: [5, 6, 7, 9, 10, 12, 14, 15]), Candidate: [ 2  1  1  0  2  1  1 -1  2  1 -1  2  0  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 119950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  1 -1  1  0  0  0 -1  0  0  0  0  0] (Indices: [5, 6, 7, 9, 11, 12, 13, 14]), Candidate: [ 2  1  1  0  2  1  1 -1  2  0  1  1  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 120000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  1 -1  1 -1  0  0  1 -1  1 -1  1 -1] (Indices: [5, 6, 7, 9, 11, 15, 17, 19]), Candidate: [ 2  1  1  0  2  1  1 -1  2  0  1  0  1  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  1 -1  0  0  1  0 -1  0  0  1  0 -1] (Indices: [5, 6, 7, 9, 13, 14, 18, 19]), Candidate: [ 2  1  1  0  2  1  1 -1  2  0  0  1  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 120100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  0  1  0 -1  1  0 -1  0  0  1 -1  0] (Indices: [5, 6, 7, 10, 11, 13, 14, 18]), Candidate: [ 2  1  1  0  2  1  1 -1  1  2  0  0  2  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 120150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  0  1 -1  1 -1  1  0 -1  0  0  1 -1] (Indices: [5, 6, 7, 10, 12, 14, 15, 19]), Candidate: [ 2  1  1  0  2  1  1 -1  1  2 -1  2  0  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 120200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  0  1 -1  0  0  0  1 -1  1  0  0 -1] (Indices: [5, 6, 7, 10, 15, 17, 18, 19]), Candidate: [ 2  1  1  0  2  1  1 -1  1  2 -1  1  1  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 120250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  0  0  1 -1  1 -1  1 -1  1  0 -1  0] (Indices: [5, 6, 7, 11, 13, 15, 17, 18]), Candidate: [ 2  1  1  0  2  1  1 -1  1  1  1  0  2  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  0  0  0  1 -1  1 -1  1 -1  1  0 -1] (Indices: [5, 6, 7, 12, 14, 16, 18, 19]), Candidate: [ 2  1  1  0  2  1  1 -1  1  1  0  2  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 120350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1  0  0  0 -1  0  0  0  1  0 -1  0  0] (Indices: [5, 6, 8, 9, 10, 11, 16, 17]), Candidate: [2 1 1 0 2 1 0 1 1 1 0 0 1 1 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 120400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1  0  0 -1  0  0  1 -1  0  1 -1  1 -1] (Indices: [5, 6, 8, 9, 10, 14, 17, 19]), Candidate: [ 2  1  1  0  2  1  0  1  1  1 -1  1  1  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 120450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1  0 -1  1 -1  0  1  0 -1  0  1 -1  0] (Indices: [5, 6, 8, 9, 11, 14, 15, 18]), Candidate: [2 1 1 0 2 1 0 1 1 0 1 0 1 2 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 120500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1  0 -1  0  1 -1  0  0  1  0 -1  1 -1] (Indices: [5, 6, 8, 9, 12, 16, 17, 19]), Candidate: [2 1 1 0 2 1 0 1 1 0 0 2 0 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 120550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1 -1  1  0  0 -1  0  1 -1  1 -1  0  0] (Indices: [5, 6, 8, 10, 11, 12, 15, 17]), Candidate: [2 1 1 0 2 1 0 1 0 2 0 1 0 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 120600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1 -1  1 -1  1  0 -1  1 -1  1 -1  0  0] (Indices: [5, 6, 8, 10, 12, 13, 15, 17]), Candidate: [ 2  1  1  0  2  1  0  1  0  2 -1  2  1  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1 -1  1 -1  0  0  1  0  0 -1  1 -1  0] (Indices: [5, 6, 8, 10, 14, 15, 16, 18]), Candidate: [ 2  1  1  0  2  1  0  1  0  2 -1  1  1  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1 -1  0  1 -1  1  0  0 -1  1 -1  0  0] (Indices: [5, 6, 8, 11, 13, 14, 15, 17]), Candidate: [2 1 1 0 2 1 0 1 0 1 1 0 2 1 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 120750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1 -1  0  0  1  0 -1  0  1  0  0 -1  0] (Indices: [5, 6, 8, 12, 13, 16, 17, 18]), Candidate: [2 1 1 0 2 1 0 1 0 1 0 2 1 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 120800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  1  0  0  0 -1  1 -1  0  0  0  1 -1] (Indices: [5, 6, 9, 10, 11, 12, 14, 19]), Candidate: [ 2  1  1  0  2  1  0  0  2  1  0  1  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  1  0 -1  1  0  0 -1  0  0  0  1 -1] (Indices: [5, 6, 9, 10, 12, 13, 14, 19]), Candidate: [ 2  1  1  0  2  1  0  0  2  1 -1  2  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 120900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  1  0 -1  0  1 -1  0  0  1  0  0 -1] (Indices: [5, 6, 9, 10, 13, 17, 18, 19]), Candidate: [ 2  1  1  0  2  1  0  0  2  1 -1  1  2  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  1 -1  1  0 -1  0  0  0  1  0  0 -1] (Indices: [5, 6, 9, 11, 12, 17, 18, 19]), Candidate: [2 1 1 0 2 1 0 0 2 0 1 1 0 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 121000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  1 -1  0  1  0 -1  1 -1  1 -1  1 -1] (Indices: [5, 6, 9, 12, 13, 15, 17, 19]), Candidate: [2 1 1 0 2 1 0 0 2 0 0 2 1 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 121050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  0  1  0  0  0 -1  1 -1  0  0  1 -1] (Indices: [5, 6, 10, 11, 12, 13, 15, 19]), Candidate: [2 1 1 0 2 1 0 0 1 2 0 1 1 0 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 121100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  0  1  0 -1  0  1  0 -1  1  0 -1  0] (Indices: [5, 6, 10, 11, 14, 15, 17, 18]), Candidate: [2 1 1 0 2 1 0 0 1 2 0 0 1 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 121150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  0  1 -1  0  1  0  0 -1  1  0 -1  0] (Indices: [5, 6, 10, 13, 14, 15, 17, 18]), Candidate: [ 2  1  1  0  2  1  0  0  1  2 -1  1  2  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  0  0  1  0 -1  0  1  0 -1  1  0 -1] (Indices: [5, 6, 11, 12, 15, 16, 18, 19]), Candidate: [2 1 1 0 2 1 0 0 1 1 1 1 0 1 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 121250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  0  0  0  0  1 -1  1  0  0  0  0 -1] (Indices: [5, 6, 13, 15, 16, 17, 18, 19]), Candidate: [2 1 1 0 2 1 0 0 1 1 0 1 2 0 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 121300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0  0  0 -1  1 -1  0  0  0  0  1  0 -1] (Indices: [5, 7, 8, 9, 10, 12, 18, 19]), Candidate: [ 2  1  1  0  2  0  2  0  1  1 -1  2  0  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0  0 -1  1  0 -1  0  1 -1  0  0  1 -1] (Indices: [5, 7, 8, 9, 11, 12, 15, 19]), Candidate: [2 1 1 0 2 0 2 0 1 0 1 1 0 1 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 121400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0  0 -1  0  1  0 -1  1 -1  0  0  1 -1] (Indices: [5, 7, 8, 9, 12, 13, 15, 19]), Candidate: [2 1 1 0 2 0 2 0 1 0 0 2 1 0 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 121450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0  0 -1  0  0  0  1  0 -1  1  0 -1  0] (Indices: [5, 7, 8, 9, 14, 15, 17, 18]), Candidate: [2 1 1 0 2 0 2 0 1 0 0 1 1 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 121500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0 -1  1  0 -1  0  1  0 -1  0  1 -1  0] (Indices: [5, 7, 8, 10, 11, 14, 15, 18]), Candidate: [2 1 1 0 2 0 2 0 0 2 0 0 1 2 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 121550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0 -1  1 -1  1 -1  0  0  1  0 -1  1 -1] (Indices: [5, 7, 8, 10, 12, 16, 17, 19]), Candidate: [ 2  1  1  0  2  0  2  0  0  2 -1  2  0  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0 -1  0  1  0  0 -1  0  0  1  0 -1  0] (Indices: [5, 7, 8, 11, 12, 13, 17, 18]), Candidate: [2 1 1 0 2 0 2 0 0 1 1 1 1 0 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 121650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0 -1  0  1 -1  0  1 -1  1  0 -1  1 -1] (Indices: [5, 7, 8, 11, 14, 16, 17, 19]), Candidate: [ 2  1  1  0  2  0  2  0  0  1  1  0  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0 -1  0  0  0  1  0 -1  1  0 -1  1 -1] (Indices: [5, 7, 8, 13, 14, 16, 17, 19]), Candidate: [ 2  1  1  0  2  0  2  0  0  1  0  1  2  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  1  0  0 -1  0  1  0  0 -1  0  0  0] (Indices: [5, 7, 9, 10, 11, 14, 15, 16]), Candidate: [ 2  1  1  0  2  0  2 -1  2  1  0  0  1  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  1  0 -1  1 -1  0  1 -1  0  1  0 -1] (Indices: [5, 7, 9, 10, 12, 15, 18, 19]), Candidate: [ 2  1  1  0  2  0  2 -1  2  1 -1  2  0  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 121850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  1 -1  1  0  0 -1  0  1 -1  1 -1  0] (Indices: [5, 7, 9, 11, 12, 13, 16, 18]), Candidate: [ 2  1  1  0  2  0  2 -1  2  0  1  1  1  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  1 -1  1 -1  0  1  0 -1  0  1  0 -1] (Indices: [5, 7, 9, 11, 14, 15, 18, 19]), Candidate: [ 2  1  1  0  2  0  2 -1  2  0  1  0  1  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  1 -1  0  0  1  0  0 -1  0  1  0 -1] (Indices: [5, 7, 9, 13, 14, 15, 18, 19]), Candidate: [ 2  1  1  0  2  0  2 -1  2  0  0  1  2  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  0  1  0  0 -1  0  0  0  1  0  0 -1] (Indices: [5, 7, 10, 11, 12, 17, 18, 19]), Candidate: [ 2  1  1  0  2  0  2 -1  1  2  0  1  0  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  0  1 -1  1  0 -1  1 -1  1 -1  1 -1] (Indices: [5, 7, 10, 12, 13, 15, 17, 19]), Candidate: [ 2  1  1  0  2  0  2 -1  1  2 -1  2  1  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 122100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  0  0  1  0  0  0 -1  0  1 -1  1 -1] (Indices: [5, 7, 11, 12, 13, 14, 17, 19]), Candidate: [ 2  1  1  0  2  0  2 -1  1  1  1  1  1  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 122150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  0  0  0  1  0  0  0  0 -1  0  1 -1] (Indices: [5, 7, 12, 13, 14, 15, 16, 19]), Candidate: [ 2  1  1  0  2  0  2 -1  1  1  0  2  1  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1  0  0  0 -1  1  0 -1  0  0  1 -1  0] (Indices: [5, 8, 9, 10, 11, 13, 14, 18]), Candidate: [ 2  1  1  0  2  0  1  1  1  1  0  0  2  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1  0  0 -1  1 -1  1  0 -1  0  0  1 -1] (Indices: [5, 8, 9, 10, 12, 14, 15, 19]), Candidate: [ 2  1  1  0  2  0  1  1  1  1 -1  2  0  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1  0  0 -1  0  0  0  1 -1  1  0  0 -1] (Indices: [5, 8, 9, 10, 15, 17, 18, 19]), Candidate: [ 2  1  1  0  2  0  1  1  1  1 -1  1  1  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1  0 -1  1 -1  1 -1  1 -1  1  0 -1  0] (Indices: [5, 8, 9, 11, 13, 15, 17, 18]), Candidate: [2 1 1 0 2 0 1 1 1 0 1 0 2 0 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 122400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1  0 -1  0  1 -1  1 -1  1 -1  1  0 -1] (Indices: [5, 8, 9, 12, 14, 16, 18, 19]), Candidate: [ 2  1  1  0  2  0  1  1  1  0  0  2  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1 -1  1  0  0 -1  1 -1  0  1  0 -1  0] (Indices: [5, 8, 10, 11, 12, 14, 17, 18]), Candidate: [ 2  1  1  0  2  0  1  1  0  2  0  1  0  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1 -1  1 -1  1  0  0  0 -1  0  1 -1  0] (Indices: [5, 8, 10, 12, 13, 14, 15, 18]), Candidate: [ 2  1  1  0  2  0  1  1  0  2 -1  2  1  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1 -1  1 -1  0  0  1  0  0 -1  1  0 -1] (Indices: [5, 8, 10, 14, 15, 16, 18, 19]), Candidate: [ 2  1  1  0  2  0  1  1  0  2 -1  1  1  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1 -1  0  1 -1  1 -1  1  0  0 -1  1 -1] (Indices: [5, 8, 11, 13, 15, 16, 17, 19]), Candidate: [2 1 1 0 2 0 1 1 0 1 1 0 2 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 122650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  1  0  0  0  0 -1  0  0  1  0 -1  0] (Indices: [5, 9, 10, 11, 12, 13, 17, 18]), Candidate: [2 1 1 0 2 0 1 0 2 1 0 1 1 0 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 122700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  1  0  0 -1  0  1 -1  1  0 -1  1 -1] (Indices: [5, 9, 10, 11, 14, 16, 17, 19]), Candidate: [ 2  1  1  0  2  0  1  0  2  1  0  0  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  1  0 -1  0  1  0 -1  1  0 -1  1 -1] (Indices: [5, 9, 10, 13, 14, 16, 17, 19]), Candidate: [ 2  1  1  0  2  0  1  0  2  1 -1  1  2  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 122800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  1 -1  1 -1  1  0  0  0 -1  1 -1  0] (Indices: [5, 9, 11, 13, 14, 15, 16, 18]), Candidate: [2 1 1 0 2 0 1 0 2 0 1 0 2 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 122850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  0  1  0  0  0  0  0 -1  0  1 -1  0] (Indices: [5, 10, 11, 12, 13, 14, 15, 18]), Candidate: [2 1 1 0 2 0 1 0 1 2 0 1 1 1 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 122900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  0  1  0 -1  0  1  0  0 -1  1  0 -1] (Indices: [5, 10, 11, 14, 15, 16, 18, 19]), Candidate: [2 1 1 0 2 0 1 0 1 2 0 0 1 2 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 122950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  0  0  1  0 -1  1  0 -1  1  0  0 -1] (Indices: [5, 11, 12, 14, 15, 17, 18, 19]), Candidate: [2 1 1 0 2 0 1 0 1 1 1 1 0 2 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 123000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0  0  0 -1  1  0 -1  0  0  0  1 -1  0] (Indices: [6, 7, 8, 9, 10, 12, 13, 18]), Candidate: [ 2  1  1  0  1  2  1  0  1  1 -1  2  1  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0  0  0 -1  0  0  0  0  1 -1  1  0 -1] (Indices: [6, 7, 8, 9, 10, 16, 18, 19]), Candidate: [ 2  1  1  0  1  2  1  0  1  1 -1  1  1  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0  0 -1  1 -1  0  0  1  0 -1  0  1 -1] (Indices: [6, 7, 8, 9, 11, 15, 16, 19]), Candidate: [2 1 1 0 1 2 1 0 1 0 1 0 1 1 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 123150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0  0 -1  0  0  1  0 -1  0  1  0 -1  0] (Indices: [6, 7, 8, 9, 13, 14, 17, 18]), Candidate: [ 2  1  1  0  1  2  1  0  1  0  0  1  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0 -1  1  0 -1  1  0 -1  1 -1  0  0  0] (Indices: [6, 7, 8, 10, 11, 13, 14, 16]), Candidate: [ 2  1  1  0  1  2  1  0  0  2  0  0  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0 -1  1 -1  1 -1  1  0 -1  1 -1  0  0] (Indices: [6, 7, 8, 10, 12, 14, 15, 17]), Candidate: [ 2  1  1  0  1  2  1  0  0  2 -1  2  0  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0 -1  1 -1  0  0  0  1  0  0 -1  1 -1] (Indices: [6, 7, 8, 10, 15, 16, 17, 19]), Candidate: [ 2  1  1  0  1  2  1  0  0  2 -1  1  1  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0 -1  0  1 -1  1 -1  1  0 -1  1 -1  0] (Indices: [6, 7, 8, 11, 13, 15, 16, 18]), Candidate: [2 1 1 0 1 2 1 0 0 1 1 0 2 0 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 123400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0 -1  0  0  1 -1  1 -1  1  0  0 -1  0] (Indices: [6, 7, 8, 12, 14, 16, 17, 18]), Candidate: [ 2  1  1  0  1  2  1  0  0  1  0  2  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  1  0  0  0 -1  0  0  0  0  1  0 -1] (Indices: [6, 7, 9, 10, 11, 12, 18, 19]), Candidate: [ 2  1  1  0  1  2  1 -1  2  1  0  1  0  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  1  0 -1  1  0 -1  0  0  0  1  0 -1] (Indices: [6, 7, 9, 10, 12, 13, 18, 19]), Candidate: [ 2  1  1  0  1  2  1 -1  2  1 -1  2  1  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 123550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  1  0 -1  0  0  1 -1  0  1  0  0 -1] (Indices: [6, 7, 9, 10, 14, 17, 18, 19]), Candidate: [ 2  1  1  0  1  2  1 -1  2  1 -1  1  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 123600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  1 -1  1 -1  1  0 -1  0  0  1  0 -1] (Indices: [6, 7, 9, 11, 13, 14, 18, 19]), Candidate: [ 2  1  1  0  1  2  1 -1  2  0  1  0  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 123650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  1 -1  0  1 -1  1  0 -1  1 -1  1 -1] (Indices: [6, 7, 9, 12, 14, 15, 17, 19]), Candidate: [ 2  1  1  0  1  2  1 -1  2  0  0  2  0  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  0  1  0  0 -1  1  0 -1  0  0  1 -1] (Indices: [6, 7, 10, 11, 12, 14, 15, 19]), Candidate: [ 2  1  1  0  1  2  1 -1  1  2  0  1  0  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  0  1  0 -1  0  0  1 -1  1  0  0 -1] (Indices: [6, 7, 10, 11, 15, 17, 18, 19]), Candidate: [ 2  1  1  0  1  2  1 -1  1  2  0  0  1  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  0  1 -1  0  1 -1  1 -1  1  0  0 -1] (Indices: [6, 7, 10, 13, 15, 17, 18, 19]), Candidate: [ 2  1  1  0  1  2  1 -1  1  2 -1  1  2  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 123850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  0  0  1 -1  1  0 -1  1  0 -1  1 -1] (Indices: [6, 7, 11, 13, 14, 16, 17, 19]), Candidate: [ 2  1  1  0  1  2  1 -1  1  1  1  0  2  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 123900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1  0  0  0  0 -1  1 -1  0  1 -1  0  0] (Indices: [6, 8, 9, 10, 11, 12, 14, 17]), Candidate: [ 2  1  1  0  1  2  0  1  1  1  0  1  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1  0  0 -1  1  0  0 -1  0  1 -1  0  0] (Indices: [6, 8, 9, 10, 12, 13, 14, 17]), Candidate: [ 2  1  1  0  1  2  0  1  1  1 -1  2  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1  0  0 -1  0  1 -1  0  1  0 -1  1 -1] (Indices: [6, 8, 9, 10, 13, 16, 17, 19]), Candidate: [ 2  1  1  0  1  2  0  1  1  1 -1  1  2  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 124050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1  0 -1  1  0 -1  0  0  1  0 -1  1 -1] (Indices: [6, 8, 9, 11, 12, 16, 17, 19]), Candidate: [2 1 1 0 1 2 0 1 1 0 1 1 0 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 124100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1  0 -1  0  1  0 -1  1  0 -1  0  1 -1] (Indices: [6, 8, 9, 12, 13, 15, 16, 19]), Candidate: [2 1 1 0 1 2 0 1 1 0 0 2 1 0 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 124150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1 -1  1  0  0  0 -1  1 -1  1 -1  0  0] (Indices: [6, 8, 10, 11, 12, 13, 15, 17]), Candidate: [2 1 1 0 1 2 0 1 0 2 0 1 1 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 124200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1 -1  1  0 -1  0  1  0  0 -1  1 -1  0] (Indices: [6, 8, 10, 11, 14, 15, 16, 18]), Candidate: [2 1 1 0 1 2 0 1 0 2 0 0 1 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 124250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1 -1  1 -1  0  1  0  0  0 -1  1 -1  0] (Indices: [6, 8, 10, 13, 14, 15, 16, 18]), Candidate: [ 2  1  1  0  1  2  0  1  0  2 -1  1  2  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 124300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1 -1  0  1  0 -1  0  1  0  0  0 -1  0] (Indices: [6, 8, 11, 12, 15, 16, 17, 18]), Candidate: [2 1 1 0 1 2 0 1 0 1 1 1 0 1 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 124350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1 -1  0  0  0  1  0  0 -1  1  0  0 -1] (Indices: [6, 8, 13, 14, 15, 17, 18, 19]), Candidate: [2 1 1 0 1 2 0 1 0 1 0 1 2 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 124400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  1  0  0 -1  1 -1  1  0 -1  1 -1  0] (Indices: [6, 9, 10, 11, 13, 15, 16, 18]), Candidate: [2 1 1 0 1 2 0 0 2 1 0 0 2 0 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 124450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  1  0 -1  1 -1  1 -1  1  0  0 -1  0] (Indices: [6, 9, 10, 12, 14, 16, 17, 18]), Candidate: [ 2  1  1  0  1  2  0  0  2  1 -1  2  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  1 -1  1  0 -1  1  0  0  0 -1  0  0] (Indices: [6, 9, 11, 12, 14, 15, 16, 17]), Candidate: [2 1 1 0 1 2 0 0 2 0 1 1 0 2 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 124550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  1 -1  0  1  0 -1  0  1  0  0  0 -1] (Indices: [6, 9, 12, 13, 16, 17, 18, 19]), Candidate: [2 1 1 0 1 2 0 0 2 0 0 2 1 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 124600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  0  1  0 -1  1  0  0  0 -1  1 -1  0] (Indices: [6, 10, 11, 13, 14, 15, 16, 18]), Candidate: [2 1 1 0 1 2 0 0 1 2 0 0 2 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 124650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  0  0  1  0  0  0  0  0 -1  0  1 -1] (Indices: [6, 11, 12, 13, 14, 15, 16, 19]), Candidate: [2 1 1 0 1 2 0 0 1 1 1 1 1 1 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 124700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0  0  0  0  0 -1  0  0  1 -1  1 -1  0] (Indices: [7, 8, 9, 10, 11, 12, 16, 18]), Candidate: [2 1 1 0 1 1 2 0 1 1 0 1 0 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 124750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0  0  0 -1  1  0 -1  0  1 -1  1 -1  0] (Indices: [7, 8, 9, 10, 12, 13, 16, 18]), Candidate: [ 2  1  1  0  1  1  2  0  1  1 -1  2  1  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 124800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0  0  0 -1  0  0  1  0 -1  0  1  0 -1] (Indices: [7, 8, 9, 10, 14, 15, 18, 19]), Candidate: [ 2  1  1  0  1  1  2  0  1  1 -1  1  1  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 124850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0  0 -1  1 -1  1  0 -1  1 -1  1 -1  0] (Indices: [7, 8, 9, 11, 13, 14, 16, 18]), Candidate: [ 2  1  1  0  1  1  2  0  1  0  1  0  2  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 124900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0  0 -1  0  1 -1  1  0  0  0 -1  0  0] (Indices: [7, 8, 9, 12, 14, 15, 16, 17]), Candidate: [2 1 1 0 1 1 2 0 1 0 0 2 0 2 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 124950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0 -1  1  0  0  0 -1  0  0  0  1  0 -1] (Indices: [7, 8, 10, 11, 12, 13, 18, 19]), Candidate: [2 1 1 0 1 1 2 0 0 2 0 1 1 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 125000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0 -1  1  0 -1  0  1 -1  0  1  0  0 -1] (Indices: [7, 8, 10, 11, 14, 17, 18, 19]), Candidate: [ 2  1  1  0  1  1  2  0  0  2  0  0  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 125050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0 -1  1 -1  0  1  0 -1  0  1  0  0 -1] (Indices: [7, 8, 10, 13, 14, 17, 18, 19]), Candidate: [ 2  1  1  0  1  1  2  0  0  2 -1  1  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0 -1  0  1 -1  1  0  0 -1  1  0 -1  0] (Indices: [7, 8, 11, 13, 14, 15, 17, 18]), Candidate: [2 1 1 0 1 1 2 0 0 1 1 0 2 1 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 125150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  1  0  0  0  0  0 -1  0  0  0  1 -1] (Indices: [7, 9, 10, 11, 12, 13, 14, 19]), Candidate: [ 2  1  1  0  1  1  2 -1  2  1  0  1  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  1  0  0 -1  1 -1  0  0  1  0  0 -1] (Indices: [7, 9, 10, 11, 13, 17, 18, 19]), Candidate: [ 2  1  1  0  1  1  2 -1  2  1  0  0  2  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 125250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  1  0 -1  1 -1  0  0  1  0  0  0 -1] (Indices: [7, 9, 10, 12, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  1  1  2 -1  2  1 -1  2  0  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  1 -1  1  0 -1  1 -1  1 -1  1  0 -1] (Indices: [7, 9, 11, 12, 14, 16, 18, 19]), Candidate: [ 2  1  1  0  1  1  2 -1  2  0  1  1  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  1 -1  0  0  1  0  0  0  0 -1  1 -1] (Indices: [7, 9, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  1  1  0  1  1  2 -1  2  0  0  1  2  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 125400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  0  1  0 -1  1  0 -1  0  1  0  0 -1] (Indices: [7, 10, 11, 13, 14, 17, 18, 19]), Candidate: [ 2  1  1  0  1  1  2 -1  1  2  0  0  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  0  0  1  0  0 -1  1  0  0  0 -1  0] (Indices: [7, 11, 12, 13, 15, 16, 17, 18]), Candidate: [ 2  1  1  0  1  1  2 -1  1  1  1  1  1  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 125500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1  0  0  0  0 -1  1 -1  0  0  1  0 -1] (Indices: [8, 9, 10, 11, 12, 14, 18, 19]), Candidate: [ 2  1  1  0  1  1  1  1  1  1  0  1  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 125550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1  0  0 -1  1  0  0 -1  1  0 -1  0  0] (Indices: [8, 9, 10, 12, 13, 14, 16, 17]), Candidate: [ 2  1  1  0  1  1  1  1  1  1 -1  2  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1  0  0 -1  0  0  1 -1  1  0  0  0 -1] (Indices: [8, 9, 10, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  1  1  1  1  1  1 -1  1  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1  0 -1  1 -1  1 -1  1 -1  1  0  0 -1] (Indices: [8, 9, 11, 13, 15, 17, 18, 19]), Candidate: [2 1 1 0 1 1 1 1 1 0 1 0 2 0 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 125700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1 -1  1  0  0  0 -1  1 -1  1 -1  1 -1] (Indices: [8, 10, 11, 12, 13, 15, 17, 19]), Candidate: [2 1 1 0 1 1 1 1 0 2 0 1 1 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 125750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1 -1  1 -1  1  0  0 -1  1 -1  1  0 -1] (Indices: [8, 10, 12, 13, 14, 16, 18, 19]), Candidate: [ 2  1  1  0  1  1  1  1  0  2 -1  2  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1 -1  0  0  1  0  0  0  0 -1  1  0 -1] (Indices: [8, 12, 13, 14, 15, 16, 18, 19]), Candidate: [2 1 1 0 1 1 1 1 0 1 0 2 1 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 125850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  1  0  0 -1  1  0 -1  0  1  0  0 -1] (Indices: [9, 10, 11, 13, 14, 17, 18, 19]), Candidate: [ 2  1  1  0  1  1  1  0  2  1  0  0  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 125900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  1 -1  1  0  0 -1  1  0  0  0 -1  0] (Indices: [9, 11, 12, 13, 15, 16, 17, 18]), Candidate: [2 1 1 0 1 1 1 0 2 0 1 1 1 0 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 125950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0  1  0 -1  1  0  0 -1  1  0  0 -1] (Indices: [10, 11, 13, 14, 15, 17, 18, 19]), Candidate: [2 1 1 0 1 1 1 0 1 2 0 0 2 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Finished generating neighbors. Total valid neighbors found: 39209
  Size of neighborhood t=8: 39209
  Using 'fork' start method for multiprocessing.
  No improvement found for t=8 after processing 39209 neighbors.
No improving solution found or error occurred for t=8.

Attempting neighborhood t=9 (current best cost: 98.4663)
  Exploring neighborhood t=9 in parallel (current cost: 98.4663)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Attempt 50: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  0  0  1 -1  0  0  0  0  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 11, 19]), Candidate: [2 1 1 0 1 1 0 0 1 1 1 0 1 1 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  0  1  0 -1  0  0  0  0  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 10, 11]), Candidate: [ 2  1  1  0  1  0  2 -1  1  2  0  0  1  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1  0 -1  0  0  0  0  1 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 5, 8, 9, 15]), Candidate: [2 1 1 0 1 0 1 1 1 0 0 1 1 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  1  0  0 -1  0  0  0  0  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 5, 9, 10, 11]), Candidate: [2 1 1 0 1 0 1 0 2 1 0 0 1 1 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  0  1  0 -1  0  0  0  0  1 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 10, 11, 17]), Candidate: [2 1 1 0 1 0 1 0 1 2 0 0 1 1 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  0  0  1 -1  0  0  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 11, 15, 17]), Candidate: [2 1 1 0 1 0 1 0 1 1 1 0 1 1 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  0  0  0  0  0  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 14, 16, 18]), Candidate: [ 2  1  1  0  1  0  1  0  1  1  0  1  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  0  0  1 -1  0  0  0  0  1 -1  0  1] (Indices: [0, 1, 2, 3, 4, 6, 7, 11, 17]), Candidate: [ 2  1  1  0  0  2  1 -1  1  1  1  0  1  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1 -1  0  1  0 -1  0  0  0  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 6, 8, 11, 12]), Candidate: [2 1 1 0 0 2 0 1 0 1 1 1 0 1 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  1 -1  1 -1  0  0  0  0  1 -1  0  1] (Indices: [0, 1, 2, 3, 4, 6, 9, 11, 17]), Candidate: [2 1 1 0 0 2 0 0 2 0 1 0 1 1 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  0  1 -1  0  1 -1  0  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 10, 13, 18]), Candidate: [ 2  1  1  0  0  2  0  0  1  2 -1  1  2  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  0  0  0  1  0 -1  0  0  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 6, 12, 13, 19]), Candidate: [2 1 1 0 0 2 0 0 1 1 0 2 1 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  0  0  0  0  0  0  0  0  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 6, 17, 18, 19]), Candidate: [2 1 1 0 0 2 0 0 1 1 0 1 1 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0 -1  0  0  0  0  0  0  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 7, 8, 16, 17]), Candidate: [2 1 1 0 0 1 2 0 0 1 0 1 1 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  1 -1  0  0  0  0  0  0  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 7, 9, 18, 19]), Candidate: [ 2  1  1  0  0  1  2 -1  2  0  0  1  1  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  0  0  1 -1  0  1  0 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 7, 11, 14, 15]), Candidate: [ 2  1  1  0  0  1  2 -1  1  1  1  0  1  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  0  0  0  0  1 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 7, 13, 18, 19]), Candidate: [ 2  1  1  0  0  1  2 -1  1  1  0  1  2  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1  0 -1  0  0  1 -1  0  0  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 8, 9, 13, 19]), Candidate: [2 1 1 0 0 1 1 1 1 0 0 1 2 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1 -1  1 -1  0  0  0  0  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 8, 10, 17, 19]), Candidate: [ 2  1  1  0  0  1  1  1  0  2 -1  1  1  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1 -1  0  0  1 -1  0  0  0  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 8, 12, 18, 19]), Candidate: [2 1 1 0 0 1 1 1 0 1 0 2 0 1 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 1050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  1  0 -1  1 -1  0  0  0  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 9, 10, 12, 19]), Candidate: [ 2  1  1  0  0  1  1  0  2  1 -1  2  0  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  1 -1  0  1  0  0 -1  0  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 9, 12, 13, 14]), Candidate: [ 2  1  1  0  0  1  1  0  2  0  0  2  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  1 -1  0  0  0  0  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 9, 15, 17, 19]), Candidate: [2 1 1 0 0 1 1 0 2 0 0 1 1 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 1200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  0  1 -1  1 -1  0  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 3, 4, 10, 12, 16, 18]), Candidate: [ 2  1  1  0  0  1  1  0  1  2 -1  2  0  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  0  0  1  0 -1  1 -1  0  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 11, 12, 14, 19]), Candidate: [ 2  1  1  0  0  1  1  0  1  1  1  1  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  0  0  0  1  0  0 -1  0  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 12, 13, 14, 19]), Candidate: [ 2  1  1  0  0  1  1  0  1  1  0  2  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  0  0  0  0  1 -1  0  0  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 13, 17, 18, 19]), Candidate: [2 1 1 0 0 1 1 0 1 1 0 1 2 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 1400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  0  0  1 -1  0  0  0  1 -1  0  0  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 11, 16]), Candidate: [ 2  1  1 -1  2  1  1 -1  1  1  1  0  1  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1 -1  1 -1  0  0  0  0  0  0  0  1  0] (Indices: [0, 1, 2, 3, 5, 6, 8, 10, 19]), Candidate: [ 2  1  1 -1  2  1  0  1  0  2 -1  1  1  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  1 -1  1 -1  0  0  0  1 -1  0  0  1] (Indices: [0, 1, 2, 3, 5, 6, 9, 11, 16]), Candidate: [ 2  1  1 -1  2  1  0  0  2  0  1  0  1  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  0  1 -1  0  1 -1  0  0  1 -1  0  1] (Indices: [0, 1, 2, 3, 5, 6, 10, 13, 17]), Candidate: [ 2  1  1 -1  2  1  0  0  1  2 -1  1  2  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  0  0  0  1  0 -1  0  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 12, 13, 18]), Candidate: [ 2  1  1 -1  2  1  0  0  1  1  0  2  1  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  0  0  0  0  0  0  0  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 5, 6, 16, 18, 19]), Candidate: [ 2  1  1 -1  2  1  0  0  1  1  0  1  1  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0 -1  0  0  0  0  0  1 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 5, 7, 8, 15, 19]), Candidate: [ 2  1  1 -1  2  0  2  0  0  1  0  1  1  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  1 -1  0  0  0  0  0  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 5, 7, 9, 17, 19]), Candidate: [ 2  1  1 -1  2  0  2 -1  2  0  0  1  1  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  0  0  1 -1  1 -1  0  0  0  0  1  0] (Indices: [0, 1, 2, 3, 5, 7, 11, 13, 19]), Candidate: [ 2  1  1 -1  2  0  2 -1  1  1  1  0  2  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  0  0  0  0  1 -1  0  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 5, 7, 13, 17, 19]), Candidate: [ 2  1  1 -1  2  0  2 -1  1  1  0  1  2  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1  0 -1  0  0  1 -1  0  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 5, 8, 9, 13, 18]), Candidate: [ 2  1  1 -1  2  0  1  1  1  0  0  1  2  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1 -1  1 -1  0  0  0  0  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 5, 8, 10, 17, 18]), Candidate: [ 2  1  1 -1  2  0  1  1  0  2 -1  1  1  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1 -1  0  0  1 -1  0  0  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 5, 8, 12, 17, 19]), Candidate: [ 2  1  1 -1  2  0  1  1  0  1  0  2  0  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  1  0 -1  1 -1  0  0  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 5, 9, 10, 12, 18]), Candidate: [ 2  1  1 -1  2  0  1  0  2  1 -1  2  0  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  1 -1  1 -1  0  0  0  0  0  1  0  0] (Indices: [0, 1, 2, 3, 5, 9, 11, 18, 19]), Candidate: [ 2  1  1 -1  2  0  1  0  2  0  1  0  1  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  1 -1  0  0  0  0  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 5, 9, 15, 17, 18]), Candidate: [ 2  1  1 -1  2  0  1  0  2  0  0  1  1  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  0  1 -1  1 -1  0  0  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 5, 10, 12, 16, 17]), Candidate: [ 2  1  1 -1  2  0  1  0  1  2 -1  2  0  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  0  0  1  0 -1  1 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 5, 11, 12, 14, 18]), Candidate: [ 2  1  1 -1  2  0  1  0  1  1  1  1  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  0  0  0  1  0  0 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 5, 12, 13, 14, 18]), Candidate: [ 2  1  1 -1  2  0  1  0  1  1  0  2  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  0  0  0  0  1 -1  0  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 5, 13, 16, 18, 19]), Candidate: [ 2  1  1 -1  2  0  1  0  1  1  0  1  2  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0 -1  0  0  1 -1  0  0  0  0  0  1  0] (Indices: [0, 1, 2, 3, 6, 7, 8, 12, 19]), Candidate: [ 2  1  1 -1  1  2  1  0  0  1  0  2  0  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  1 -1  0  0  1 -1  0  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 6, 7, 9, 13, 18]), Candidate: [ 2  1  1 -1  1  2  1 -1  2  0  0  1  2  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  0  1 -1  0  0  0  0  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 6, 7, 10, 17, 18]), Candidate: [ 2  1  1 -1  1  2  1 -1  1  2 -1  1  1  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 2550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  0  0  0  1 -1  0  0  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 6, 7, 12, 17, 19]), Candidate: [ 2  1  1 -1  1  2  1 -1  1  1  0  2  0  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1  0 -1  1 -1  0  0  0  1 -1  0  0  1] (Indices: [0, 1, 2, 3, 6, 8, 9, 11, 16]), Candidate: [ 2  1  1 -1  1  2  0  1  1  0  1  0  1  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1 -1  1 -1  0  1 -1  0  0  1 -1  0  1] (Indices: [0, 1, 2, 3, 6, 8, 10, 13, 17]), Candidate: [ 2  1  1 -1  1  2  0  1  0  2 -1  1  2  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1 -1  0  0  1  0 -1  0  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 6, 8, 12, 13, 18]), Candidate: [ 2  1  1 -1  1  2  0  1  0  1  0  2  1  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1 -1  0  0  0  0  0  0  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 6, 8, 16, 18, 19]), Candidate: [ 2  1  1 -1  1  2  0  1  0  1  0  1  1  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  1 -1  1 -1  1 -1  0  0  0  0  1  0] (Indices: [0, 1, 2, 3, 6, 9, 11, 13, 19]), Candidate: [ 2  1  1 -1  1  2  0  0  2  0  1  0  2  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  1 -1  0  0  1 -1  0  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 6, 9, 13, 17, 19]), Candidate: [ 2  1  1 -1  1  2  0  0  2  0  0  1  2  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  0  1 -1  1  0  0 -1  0  0  0  0  1] (Indices: [0, 1, 2, 3, 6, 10, 12, 13, 14]), Candidate: [ 2  1  1 -1  1  2  0  0  1  2 -1  2  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 2950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  0  1 -1  0  0  0  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 6, 10, 15, 17, 19]), Candidate: [ 2  1  1 -1  1  2  0  0  1  2 -1  1  1  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  0  0  1 -1  0  1 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 6, 11, 14, 17, 19]), Candidate: [ 2  1  1 -1  1  2  0  0  1  1  1  0  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  0  0  0  0  1  0  0 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 6, 13, 14, 15, 19]), Candidate: [ 2  1  1 -1  1  2  0  0  1  1  0  1  2  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0  0 -1  0  1 -1  1 -1  0  0  0  0  1] (Indices: [0, 1, 2, 3, 7, 8, 9, 12, 14]), Candidate: [ 2  1  1 -1  1  1  2  0  1  0  0  2  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0 -1  1 -1  0  0  1 -1  0  1 -1  0  1] (Indices: [0, 1, 2, 3, 7, 8, 10, 14, 17]), Candidate: [ 2  1  1 -1  1  1  2  0  0  2 -1  1  1  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 3200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0 -1  0  0  1 -1  1 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 7, 8, 12, 14, 18]), Candidate: [ 2  1  1 -1  1  1  2  0  0  1  0  2  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  1  0  0 -1  0  0  1 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 7, 9, 10, 11, 15]), Candidate: [ 2  1  1 -1  1  1  2 -1  2  1  0  0  1  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  1 -1  1 -1  0  1 -1  0  0  0  1  0] (Indices: [0, 1, 2, 3, 7, 9, 11, 14, 19]), Candidate: [ 2  1  1 -1  1  1  2 -1  2  0  1  0  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 3350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  1 -1  0  0  0  1  0 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 7, 9, 14, 15, 19]), Candidate: [ 2  1  1 -1  1  1  2 -1  2  0  0  1  1  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  0  1 -1  1  0 -1  0  0  0  0  1  0] (Indices: [0, 1, 2, 3, 7, 10, 12, 13, 19]), Candidate: [ 2  1  1 -1  1  1  2 -1  1  2 -1  2  1  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 3450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  0  1 -1  0  0  0  0  0  1  0  0  0] (Indices: [0, 1, 2, 3, 7, 10, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  1  2 -1  1  2 -1  1  1  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 3500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  0  0  1 -1  0  0  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 7, 11, 15, 17, 18]), Candidate: [ 2  1  1 -1  1  1  2 -1  1  1  1  0  1  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  0  0  0  0  1  0 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 7, 13, 14, 17, 19]), Candidate: [ 2  1  1 -1  1  1  2 -1  1  1  0  1  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 3600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1  0  0 -1  0  0  1 -1  0  1 -1  0  1] (Indices: [0, 1, 2, 3, 8, 9, 10, 14, 17]), Candidate: [ 2  1  1 -1  1  1  1  1  1  1 -1  1  1  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 3650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1  0 -1  0  1 -1  1 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 8, 9, 12, 14, 18]), Candidate: [ 2  1  1 -1  1  1  1  1  1  0  0  2  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1 -1  1  0  0 -1  0  0  1 -1  0  0  1] (Indices: [0, 1, 2, 3, 8, 10, 11, 12, 16]), Candidate: [ 2  1  1 -1  1  1  1  1  0  2  0  1  0  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1 -1  1 -1  0  1  0 -1  0  0  0  1  0] (Indices: [0, 1, 2, 3, 8, 10, 13, 14, 19]), Candidate: [ 2  1  1 -1  1  1  1  1  0  2 -1  1  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 3800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1 -1  0  1  0 -1  0  0  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 8, 11, 12, 17, 19]), Candidate: [ 2  1  1 -1  1  1  1  1  0  1  1  1  0  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1 -1  0  0  1  0 -1  0  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 8, 12, 13, 17, 19]), Candidate: [ 2  1  1 -1  1  1  1  1  0  1  0  2  1  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1 -1  0  0  0  0  1 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 8, 14, 16, 18, 19]), Candidate: [ 2  1  1 -1  1  1  1  1  0  1  0  1  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  1  0 -1  1 -1  0  0  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 9, 10, 12, 16, 17]), Candidate: [ 2  1  1 -1  1  1  1  0  2  1 -1  2  0  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  1 -1  1  0 -1  1 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 9, 11, 12, 14, 18]), Candidate: [ 2  1  1 -1  1  1  1  0  2  0  1  1  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  1 -1  0  1  0  0 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 9, 12, 13, 14, 18]), Candidate: [ 2  1  1 -1  1  1  1  0  2  0  0  2  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  1 -1  0  0  1 -1  0  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 9, 13, 16, 18, 19]), Candidate: [ 2  1  1 -1  1  1  1  0  2  0  0  1  2  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  0  1  0 -1  1 -1  0  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 10, 11, 13, 17, 18]), Candidate: [ 2  1  1 -1  1  1  1  0  1  2  0  0  2  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  0  1 -1  1 -1  0  1  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 10, 12, 15, 16, 19]), Candidate: [ 2  1  1 -1  1  1  1  0  1  2 -1  2  0  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  0  0  1  0  0 -1  1 -1  0  1 -1  1] (Indices: [0, 1, 2, 3, 11, 12, 13, 15, 18]), Candidate: [ 2  1  1 -1  1  1  1  0  1  1  1  1  1  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  0  0  1 -1  0  1  0  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 11, 14, 15, 16, 19]), Candidate: [ 2  1  1 -1  1  1  1  0  1  1  1  0  1  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  0  0  0  0  1  0  0  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 13, 14, 15, 16, 19]), Candidate: [ 2  1  1 -1  1  1  1  0  1  1  0  1  2  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  0  0  1 -1  1 -1  0  0  0  0  0  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 11, 13]), Candidate: [ 2  1  0  1  1  1  1 -1  1  1  1  0  2  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1 -1  1 -1  0  0  0  0  1 -1  0  0  1] (Indices: [0, 1, 2, 4, 5, 6, 8, 10, 16]), Candidate: [ 2  1  0  1  1  1  0  1  0  2 -1  1  1  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  1 -1  1 -1  1 -1  0  0  0  0  0  1] (Indices: [0, 1, 2, 4, 5, 6, 9, 11, 13]), Candidate: [2 1 0 1 1 1 0 0 2 0 1 0 2 0 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 4550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  0  1 -1  0  1  0 -1  0  0  0  0  1] (Indices: [0, 1, 2, 4, 5, 6, 10, 13, 14]), Candidate: [ 2  1  0  1  1  1  0  0  1  2 -1  1  2  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  0  0  0  1  0 -1  1 -1  0  0  0  1] (Indices: [0, 1, 2, 4, 5, 6, 12, 13, 15]), Candidate: [2 1 0 1 1 1 0 0 1 1 0 2 1 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 4650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  0  0  0  0  0  0  1 -1  0  1  0  0] (Indices: [0, 1, 2, 4, 5, 6, 15, 18, 19]), Candidate: [2 1 0 1 1 1 0 0 1 1 0 1 1 1 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 4700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0 -1  0  0  0  0  0  1  0 -1  0  0  1] (Indices: [0, 1, 2, 4, 5, 7, 8, 15, 16]), Candidate: [2 1 0 1 1 0 2 0 0 1 0 1 1 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 4750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  1 -1  0  0  0  0  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 4, 5, 7, 9, 16, 18]), Candidate: [ 2  1  0  1  1  0  2 -1  2  0  0  1  1  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  0  0  1 -1  1 -1  0  1 -1  0  0  1] (Indices: [0, 1, 2, 4, 5, 7, 11, 13, 16]), Candidate: [ 2  1  0  1  1  0  2 -1  1  1  1  0  2  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  0  0  0  0  1 -1  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 4, 5, 7, 13, 16, 18]), Candidate: [ 2  1  0  1  1  0  2 -1  1  1  0  1  2  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1  0 -1  0  0  1 -1  1 -1  0  0  0  1] (Indices: [0, 1, 2, 4, 5, 8, 9, 13, 15]), Candidate: [2 1 0 1 1 0 1 1 1 0 0 1 2 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 4950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1 -1  1 -1  0  0  0  0  1  0 -1  0  1] (Indices: [0, 1, 2, 4, 5, 8, 10, 16, 17]), Candidate: [ 2  1  0  1  1  0  1  1  0  2 -1  1  1  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1 -1  0  0  1 -1  0  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 4, 5, 8, 12, 16, 18]), Candidate: [2 1 0 1 1 0 1 1 0 1 0 2 0 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 5050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  1  0 -1  1 -1  0  1 -1  0  0  0  1] (Indices: [0, 1, 2, 4, 5, 9, 10, 12, 15]), Candidate: [ 2  1  0  1  1  0  1  0  2  1 -1  2  0  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  1 -1  1 -1  0  0  0  1 -1  0  1  0] (Indices: [0, 1, 2, 4, 5, 9, 11, 16, 19]), Candidate: [2 1 0 1 1 0 1 0 2 0 1 0 1 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 5150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  1 -1  0  0  0  0  1  0  0 -1  0  1] (Indices: [0, 1, 2, 4, 5, 9, 15, 16, 17]), Candidate: [2 1 0 1 1 0 1 0 2 0 0 1 1 1 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 5200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  0  1 -1  1 -1  0  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 4, 5, 10, 12, 15, 17]), Candidate: [ 2  1  0  1  1  0  1  0  1  2 -1  2  0  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  0  0  1  0 -1  1  0 -1  0  0  0  1] (Indices: [0, 1, 2, 4, 5, 11, 12, 14, 15]), Candidate: [2 1 0 1 1 0 1 0 1 1 1 1 0 2 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 5300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  0  0  0  1  0  0  0 -1  0  0  0  1] (Indices: [0, 1, 2, 4, 5, 12, 13, 14, 15]), Candidate: [2 1 0 1 1 0 1 0 1 1 0 2 1 1 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 5350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  0  0  0  0  1 -1  1 -1  0  1  0  0] (Indices: [0, 1, 2, 4, 5, 13, 15, 18, 19]), Candidate: [2 1 0 1 1 0 1 0 1 1 0 1 2 0 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 5400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0 -1  0  0  1 -1  0  0  1 -1  0  0  1] (Indices: [0, 1, 2, 4, 6, 7, 8, 12, 16]), Candidate: [2 1 0 1 0 2 1 0 0 1 0 2 0 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 5450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  1 -1  0  0  1 -1  1 -1  0  0  0  1] (Indices: [0, 1, 2, 4, 6, 7, 9, 13, 15]), Candidate: [ 2  1  0  1  0  2  1 -1  2  0  0  1  2  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  0  1 -1  0  0  0  0  1  0 -1  0  1] (Indices: [0, 1, 2, 4, 6, 7, 10, 16, 17]), Candidate: [ 2  1  0  1  0  2  1 -1  1  2 -1  1  1  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  0  0  0  1 -1  0  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 4, 6, 7, 12, 16, 18]), Candidate: [ 2  1  0  1  0  2  1 -1  1  1  0  2  0  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1  0 -1  1 -1  1 -1  0  0  0  0  0  1] (Indices: [0, 1, 2, 4, 6, 8, 9, 11, 13]), Candidate: [2 1 0 1 0 2 0 1 1 0 1 0 2 0 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 5650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1 -1  1 -1  0  1  0 -1  0  0  0  0  1] (Indices: [0, 1, 2, 4, 6, 8, 10, 13, 14]), Candidate: [ 2  1  0  1  0  2  0  1  0  2 -1  1  2  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1 -1  0  0  1  0 -1  1 -1  0  0  0  1] (Indices: [0, 1, 2, 4, 6, 8, 12, 13, 15]), Candidate: [2 1 0 1 0 2 0 1 0 1 0 2 1 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 5750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1 -1  0  0  0  0  0  1 -1  0  1  0  0] (Indices: [0, 1, 2, 4, 6, 8, 15, 18, 19]), Candidate: [2 1 0 1 0 2 0 1 0 1 0 1 1 1 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 5800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  1 -1  1 -1  1 -1  0  1 -1  0  0  1] (Indices: [0, 1, 2, 4, 6, 9, 11, 13, 16]), Candidate: [2 1 0 1 0 2 0 0 2 0 1 0 2 0 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 5850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  1 -1  0  0  1 -1  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 4, 6, 9, 13, 16, 18]), Candidate: [2 1 0 1 0 2 0 0 2 0 0 1 2 0 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 5900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  0  1  0 -1  0  0  0  0  1  0 -1  1] (Indices: [0, 1, 2, 4, 6, 10, 11, 17, 18]), Candidate: [2 1 0 1 0 2 0 0 1 2 0 0 1 1 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 5950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  0  1 -1  0  0  0  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 4, 6, 10, 15, 16, 18]), Candidate: [ 2  1  0  1  0  2  0  0  1  2 -1  1  1  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  0  0  1 -1  0  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 4, 6, 11, 14, 16, 18]), Candidate: [ 2  1  0  1  0  2  0  0  1  1  1  0  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  0  0  0  0  1  0  0  0 -1  0  0  1] (Indices: [0, 1, 2, 4, 6, 13, 14, 15, 16]), Candidate: [2 1 0 1 0 2 0 0 1 1 0 1 2 1 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 6100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0  0 -1  1 -1  0  0  0  0  0  1 -1  1] (Indices: [0, 1, 2, 4, 7, 8, 9, 11, 18]), Candidate: [2 1 0 1 0 1 2 0 1 0 1 0 1 1 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 6150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0 -1  1 -1  0  1 -1  0  0  0  0  1  0] (Indices: [0, 1, 2, 4, 7, 8, 10, 13, 19]), Candidate: [ 2  1  0  1  0  1  2  0  0  2 -1  1  2  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0 -1  0  0  1 -1  1  0 -1  0  0  0  1] (Indices: [0, 1, 2, 4, 7, 8, 12, 14, 15]), Candidate: [2 1 0 1 0 1 2 0 0 1 0 2 0 2 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 6250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  1  0  0  0 -1  0  0  0  0  0  0  1] (Indices: [0, 1, 2, 4, 7, 9, 10, 11, 12]), Candidate: [ 2  1  0  1  0  1  2 -1  2  1  0  1  0  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  1 -1  1 -1  0  1 -1  1 -1  0  0  1] (Indices: [0, 1, 2, 4, 7, 9, 11, 14, 16]), Candidate: [ 2  1  0  1  0  1  2 -1  2  0  1  0  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  1 -1  0  0  0  1  0  0 -1  0  0  1] (Indices: [0, 1, 2, 4, 7, 9, 14, 15, 16]), Candidate: [ 2  1  0  1  0  1  2 -1  2  0  0  1  1  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  0  1 -1  1  0 -1  0  1 -1  0  0  1] (Indices: [0, 1, 2, 4, 7, 10, 12, 13, 16]), Candidate: [ 2  1  0  1  0  1  2 -1  1  2 -1  2  1  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  0  1 -1  0  0  0  0  1  0  0 -1  1] (Indices: [0, 1, 2, 4, 7, 10, 16, 17, 18]), Candidate: [ 2  1  0  1  0  1  2 -1  1  2 -1  1  1  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  0  0  1 -1  0  0  1  0  0 -1  0  1] (Indices: [0, 1, 2, 4, 7, 11, 15, 16, 17]), Candidate: [ 2  1  0  1  0  1  2 -1  1  1  1  0  1  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  0  0  0  0  1  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 4, 7, 13, 14, 16, 18]), Candidate: [ 2  1  0  1  0  1  2 -1  1  1  0  1  2  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1  0  0 -1  0  1 -1  0  0  0  0  1  0] (Indices: [0, 1, 2, 4, 8, 9, 10, 13, 19]), Candidate: [ 2  1  0  1  0  1  1  1  1  1 -1  1  2  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1  0 -1  0  1 -1  1  0 -1  0  0  0  1] (Indices: [0, 1, 2, 4, 8, 9, 12, 14, 15]), Candidate: [2 1 0 1 0 1 1 1 1 0 0 2 0 2 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 6700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1 -1  1  0  0  0 -1  0  0  0  0  0  1] (Indices: [0, 1, 2, 4, 8, 10, 11, 12, 13]), Candidate: [2 1 0 1 0 1 1 1 0 2 0 1 1 0 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 6750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1 -1  1 -1  0  1  0 -1  1 -1  0  0  1] (Indices: [0, 1, 2, 4, 8, 10, 13, 14, 16]), Candidate: [ 2  1  0  1  0  1  1  1  0  2 -1  1  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1 -1  0  1  0 -1  0  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 4, 8, 11, 12, 16, 18]), Candidate: [2 1 0 1 0 1 1 1 0 1 1 1 0 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 6850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1 -1  0  0  1  0 -1  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 4, 8, 12, 13, 16, 18]), Candidate: [2 1 0 1 0 1 1 1 0 1 0 2 1 0 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 6900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1 -1  0  0  0  0  1  0 -1  0  1  0  0] (Indices: [0, 1, 2, 4, 8, 14, 15, 18, 19]), Candidate: [2 1 0 1 0 1 1 1 0 1 0 1 1 2 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 6950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  1  0 -1  1 -1  0  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 4, 9, 10, 12, 15, 17]), Candidate: [ 2  1  0  1  0  1  1  0  2  1 -1  2  0  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  1 -1  1  0 -1  1  0 -1  0  0  0  1] (Indices: [0, 1, 2, 4, 9, 11, 12, 14, 15]), Candidate: [2 1 0 1 0 1 1 0 2 0 1 1 0 2 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 7050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  1 -1  0  1  0  0  0 -1  0  0  0  1] (Indices: [0, 1, 2, 4, 9, 12, 13, 14, 15]), Candidate: [2 1 0 1 0 1 1 0 2 0 0 2 1 1 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 7100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  1 -1  0  0  1 -1  1 -1  0  1  0  0] (Indices: [0, 1, 2, 4, 9, 13, 15, 18, 19]), Candidate: [2 1 0 1 0 1 1 0 2 0 0 1 2 0 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 7150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  0  1  0 -1  1 -1  0  1  0 -1  0  1] (Indices: [0, 1, 2, 4, 10, 11, 13, 16, 17]), Candidate: [2 1 0 1 0 1 1 0 1 2 0 0 2 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 7200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  0  1 -1  1 -1  1 -1  0  0  1  0  0] (Indices: [0, 1, 2, 4, 10, 12, 14, 18, 19]), Candidate: [ 2  1  0  1  0  1  1  0  1  2 -1  2  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  0  0  1  0  0  0 -1  0  0  0  1  0] (Indices: [0, 1, 2, 4, 11, 12, 13, 14, 19]), Candidate: [ 2  1  0  1  0  1  1  0  1  1  1  1  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  0  0  1 -1  1 -1  0  0  1  0  0  0] (Indices: [0, 1, 2, 4, 11, 13, 17, 18, 19]), Candidate: [2 1 0 1 0 1 1 0 1 1 1 0 2 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 7350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  0  0  0  1 -1  0  0  1  0  0  0  0] (Indices: [0, 1, 2, 4, 12, 16, 17, 18, 19]), Candidate: [2 1 0 1 0 1 1 0 1 1 0 2 0 1 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 7400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0 -1  0  0  1 -1  1 -1  0  0  0  0  1] (Indices: [0, 1, 2, 5, 6, 7, 8, 12, 14]), Candidate: [ 2  1  0  0  2  1  1  0  0  1  0  2  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  1 -1  0  1 -1  0  0  0  0  0  1  0] (Indices: [0, 1, 2, 5, 6, 7, 9, 12, 19]), Candidate: [ 2  1  0  0  2  1  1 -1  2  0  0  2  0  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  0  1 -1  0  0  0  1 -1  0  1 -1  1] (Indices: [0, 1, 2, 5, 6, 7, 10, 15, 18]), Candidate: [ 2  1  0  0  2  1  1 -1  1  2 -1  1  1  1  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  0  0  0  1 -1  0  1 -1  0  0  1  0] (Indices: [0, 1, 2, 5, 6, 7, 12, 15, 19]), Candidate: [ 2  1  0  0  2  1  1 -1  1  1  0  2  0  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1  0  0 -1  0  0  0  0  0  0  0  1  0] (Indices: [0, 1, 2, 5, 6, 8, 9, 10, 19]), Candidate: [ 2  1  0  0  2  1  0  1  1  1 -1  1  1  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1 -1  1 -1  1 -1  0  0  0  0  1 -1  1] (Indices: [0, 1, 2, 5, 6, 8, 10, 12, 18]), Candidate: [ 2  1  0  0  2  1  0  1  0  2 -1  2  0  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1 -1  0  1 -1  0  0  0  0  0  1  0  0] (Indices: [0, 1, 2, 5, 6, 8, 11, 18, 19]), Candidate: [2 1 0 0 2 1 0 1 0 1 1 0 1 1 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 7750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1 -1  0  0  0  0  0  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 5, 6, 8, 15, 17, 18]), Candidate: [2 1 0 0 2 1 0 1 0 1 0 1 1 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 7800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  1 -1  1 -1  1  0 -1  0  0  0  0  1] (Indices: [0, 1, 2, 5, 6, 9, 11, 13, 14]), Candidate: [ 2  1  0  0  2  1  0  0  2  0  1  0  2  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  1 -1  0  0  1 -1  1 -1  0  0  1  0] (Indices: [0, 1, 2, 5, 6, 9, 13, 15, 19]), Candidate: [2 1 0 0 2 1 0 0 2 0 0 1 2 0 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 7900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  0  1  0 -1  0  0  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 5, 6, 10, 11, 16, 18]), Candidate: [2 1 0 0 2 1 0 0 1 2 0 0 1 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 7950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  0  1 -1  0  0  1 -1  0  0  1  0  0] (Indices: [0, 1, 2, 5, 6, 10, 14, 18, 19]), Candidate: [ 2  1  0  0  2  1  0  0  1  2 -1  1  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  0  0  1 -1  0  1  0 -1  0  0  1  0] (Indices: [0, 1, 2, 5, 6, 11, 14, 15, 19]), Candidate: [2 1 0 0 2 1 0 0 1 1 1 0 1 2 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 8050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  0  0  0  1 -1  0  0  1 -1  1  0  0] (Indices: [0, 1, 2, 5, 6, 12, 16, 18, 19]), Candidate: [2 1 0 0 2 1 0 0 1 1 0 2 0 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 8100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0  0 -1  1 -1  0  0  0  1 -1  0  0  1] (Indices: [0, 1, 2, 5, 7, 8, 9, 11, 16]), Candidate: [2 1 0 0 2 0 2 0 1 0 1 0 1 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 8150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0 -1  1 -1  0  1 -1  0  0  1 -1  0  1] (Indices: [0, 1, 2, 5, 7, 8, 10, 13, 17]), Candidate: [ 2  1  0  0  2  0  2  0  0  2 -1  1  2  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0 -1  0  0  1  0 -1  0  0  0  1 -1  1] (Indices: [0, 1, 2, 5, 7, 8, 12, 13, 18]), Candidate: [2 1 0 0 2 0 2 0 0 1 0 2 1 0 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 8250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0 -1  0  0  0  0  0  0  1 -1  1  0  0] (Indices: [0, 1, 2, 5, 7, 8, 16, 18, 19]), Candidate: [2 1 0 0 2 0 2 0 0 1 0 1 1 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 8300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  1 -1  1 -1  1 -1  0  0  0  0  1  0] (Indices: [0, 1, 2, 5, 7, 9, 11, 13, 19]), Candidate: [ 2  1  0  0  2  0  2 -1  2  0  1  0  2  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  1 -1  0  0  1 -1  0  0  1 -1  1  0] (Indices: [0, 1, 2, 5, 7, 9, 13, 17, 19]), Candidate: [ 2  1  0  0  2  0  2 -1  2  0  0  1  2  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  0  1 -1  1  0  0 -1  0  0  0  0  1] (Indices: [0, 1, 2, 5, 7, 10, 12, 13, 14]), Candidate: [ 2  1  0  0  2  0  2 -1  1  2 -1  2  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 8450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  0  1 -1  0  0  0  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 5, 7, 10, 15, 17, 19]), Candidate: [ 2  1  0  0  2  0  2 -1  1  2 -1  1  1  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  0  0  1 -1  0  1 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 5, 7, 11, 14, 17, 19]), Candidate: [ 2  1  0  0  2  0  2 -1  1  1  1  0  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  0  0  0  0  1  0  0 -1  0  0  1  0] (Indices: [0, 1, 2, 5, 7, 13, 14, 15, 19]), Candidate: [ 2  1  0  0  2  0  2 -1  1  1  0  1  2  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1  0  0 -1  0  1 -1  0  0  1 -1  0  1] (Indices: [0, 1, 2, 5, 8, 9, 10, 13, 17]), Candidate: [ 2  1  0  0  2  0  1  1  1  1 -1  1  2  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1  0 -1  0  1  0 -1  0  0  0  1 -1  1] (Indices: [0, 1, 2, 5, 8, 9, 12, 13, 18]), Candidate: [2 1 0 0 2 0 1 1 1 0 0 2 1 0 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 8700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1  0 -1  0  0  0  0  0  1 -1  1  0  0] (Indices: [0, 1, 2, 5, 8, 9, 16, 18, 19]), Candidate: [2 1 0 0 2 0 1 1 1 0 0 1 1 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 8750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1 -1  1 -1  1 -1  0  0  0  0  1  0  0] (Indices: [0, 1, 2, 5, 8, 10, 12, 18, 19]), Candidate: [ 2  1  0  0  2  0  1  1  0  2 -1  2  0  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1 -1  0  1  0 -1  0  1 -1  0  0  1  0] (Indices: [0, 1, 2, 5, 8, 11, 12, 15, 19]), Candidate: [2 1 0 0 2 0 1 1 0 1 1 1 0 1 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 8850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1 -1  0  0  1  0 -1  1 -1  0  0  1  0] (Indices: [0, 1, 2, 5, 8, 12, 13, 15, 19]), Candidate: [2 1 0 0 2 0 1 1 0 1 0 2 1 0 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 8900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1 -1  0  0  0  0  1  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 5, 8, 14, 15, 17, 18]), Candidate: [2 1 0 0 2 0 1 1 0 1 0 1 1 2 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 8950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  1  0 -1  1 -1  1 -1  0  0  0  1  0] (Indices: [0, 1, 2, 5, 9, 10, 12, 14, 19]), Candidate: [ 2  1  0  0  2  0  1  0  2  1 -1  2  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  1 -1  1  0  0 -1  0  0  0  1 -1  1] (Indices: [0, 1, 2, 5, 9, 11, 12, 13, 18]), Candidate: [2 1 0 0 2 0 1 0 2 0 1 1 1 0 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 9050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  1 -1  1 -1  0  0  0  1 -1  1  0  0] (Indices: [0, 1, 2, 5, 9, 11, 16, 18, 19]), Candidate: [2 1 0 0 2 0 1 0 2 0 1 0 1 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 9100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  1 -1  0  0  1 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 5, 9, 13, 15, 17, 18]), Candidate: [2 1 0 0 2 0 1 0 2 0 0 1 2 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 9150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  0  1  0 -1  1 -1  1 -1  0  1 -1  1] (Indices: [0, 1, 2, 5, 10, 11, 13, 15, 18]), Candidate: [2 1 0 0 2 0 1 0 1 2 0 0 2 0 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 9200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  0  1 -1  1 -1  1 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 5, 10, 12, 14, 17, 18]), Candidate: [ 2  1  0  0  2  0  1  0  1  2 -1  2  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  0  0  1  0  0  0 -1  0  1 -1  0  1] (Indices: [0, 1, 2, 5, 11, 12, 13, 14, 17]), Candidate: [ 2  1  0  0  2  0  1  0  1  1  1  1  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  0  0  1 -1  1 -1  0  1  0 -1  1  0] (Indices: [0, 1, 2, 5, 11, 13, 16, 17, 19]), Candidate: [2 1 0 0 2 0 1 0 1 1 1 0 2 0 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 9350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  0  0  0  1 -1  0  1  0 -1  1  0  0] (Indices: [0, 1, 2, 5, 12, 15, 16, 18, 19]), Candidate: [2 1 0 0 2 0 1 0 1 1 0 2 0 1 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 9400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0  0 -1  0  0  1 -1  0  1 -1  0  0  1] (Indices: [0, 1, 2, 6, 7, 8, 9, 13, 16]), Candidate: [2 1 0 0 1 2 1 0 1 0 0 1 2 0 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 9450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0 -1  1 -1  0  0  0  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 6, 7, 8, 10, 16, 18]), Candidate: [ 2  1  0  0  1  2  1  0  0  2 -1  1  1  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0 -1  0  0  1 -1  0  0  1 -1  0  1  0] (Indices: [0, 1, 2, 6, 7, 8, 12, 16, 19]), Candidate: [2 1 0 0 1 2 1 0 0 1 0 2 0 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 9550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  1  0 -1  1 -1  0  0  1 -1  0  0  1] (Indices: [0, 1, 2, 6, 7, 9, 10, 12, 16]), Candidate: [ 2  1  0  0  1  2  1 -1  2  1 -1  2  0  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  1 -1  1 -1  0  0  0  0  1  0 -1  1] (Indices: [0, 1, 2, 6, 7, 9, 11, 17, 18]), Candidate: [ 2  1  0  0  1  2  1 -1  2  0  1  0  1  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  1 -1  0  0  0  0  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 6, 7, 9, 15, 16, 18]), Candidate: [ 2  1  0  0  1  2  1 -1  2  0  0  1  1  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  0  1 -1  1 -1  0  1 -1  0  1 -1  1] (Indices: [0, 1, 2, 6, 7, 10, 12, 15, 18]), Candidate: [ 2  1  0  0  1  2  1 -1  1  2 -1  2  0  1  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  0  0  1  0 -1  1 -1  1 -1  0  0  1] (Indices: [0, 1, 2, 6, 7, 11, 12, 14, 16]), Candidate: [ 2  1  0  0  1  2  1 -1  1  1  1  1  0  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  0  0  0  1  0  0 -1  1 -1  0  0  1] (Indices: [0, 1, 2, 6, 7, 12, 13, 14, 16]), Candidate: [ 2  1  0  0  1  2  1 -1  1  1  0  2  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  0  0  0  0  1 -1  0  1  0  0 -1  1] (Indices: [0, 1, 2, 6, 7, 13, 16, 17, 18]), Candidate: [ 2  1  0  0  1  2  1 -1  1  1  0  1  2  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1  0  0 -1  0  0  0  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 6, 8, 9, 10, 16, 18]), Candidate: [ 2  1  0  0  1  2  0  1  1  1 -1  1  1  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1  0 -1  0  1 -1  0  0  1 -1  0  1  0] (Indices: [0, 1, 2, 6, 8, 9, 12, 16, 19]), Candidate: [2 1 0 0 1 2 0 1 1 0 0 2 0 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 10000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1 -1  1  0 -1  1 -1  0  0  0  1 -1  1] (Indices: [0, 1, 2, 6, 8, 10, 11, 13, 18]), Candidate: [2 1 0 0 1 2 0 1 0 2 0 0 2 0 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 10050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1 -1  1 -1  0  1 -1  0  0  1  0 -1  1] (Indices: [0, 1, 2, 6, 8, 10, 13, 17, 18]), Candidate: [ 2  1  0  0  1  2  0  1  0  2 -1  1  2  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1 -1  0  1 -1  1 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 6, 8, 11, 13, 15, 17]), Candidate: [2 1 0 0 1 2 0 1 0 1 1 0 2 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 10150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1 -1  0  0  1 -1  1 -1  1 -1  0  1  0] (Indices: [0, 1, 2, 6, 8, 12, 14, 16, 19]), Candidate: [ 2  1  0  0  1  2  0  1  0  1  0  2  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  1  0  0  0 -1  1 -1  0  0  0  0  1] (Indices: [0, 1, 2, 6, 9, 10, 11, 12, 14]), Candidate: [ 2  1  0  0  1  2  0  0  2  1  0  1  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  1  0 -1  0  1  0 -1  0  1 -1  0  1] (Indices: [0, 1, 2, 6, 9, 10, 13, 14, 17]), Candidate: [ 2  1  0  0  1  2  0  0  2  1 -1  1  2  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  1 -1  1  0 -1  0  0  1 -1  0  1  0] (Indices: [0, 1, 2, 6, 9, 11, 12, 16, 19]), Candidate: [2 1 0 0 1 2 0 0 2 0 1 1 0 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 10350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  1 -1  0  1  0 -1  0  1 -1  0  1  0] (Indices: [0, 1, 2, 6, 9, 12, 13, 16, 19]), Candidate: [2 1 0 0 1 2 0 0 2 0 0 2 1 0 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 10400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  1 -1  0  0  0  1 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 6, 9, 14, 16, 17, 18]), Candidate: [ 2  1  0  0  1  2  0  0  2  0  0  1  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  0  1  0 -1  0  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 6, 10, 11, 14, 16, 18]), Candidate: [ 2  1  0  0  1  2  0  0  1  2  0  0  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  0  1 -1  0  1  0  0  0 -1  0  0  1] (Indices: [0, 1, 2, 6, 10, 13, 14, 15, 16]), Candidate: [ 2  1  0  0  1  2  0  0  1  2 -1  1  2  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  0  0  1  0 -1  1  0  0 -1  0  0  1] (Indices: [0, 1, 2, 6, 11, 12, 14, 15, 16]), Candidate: [2 1 0 0 1 2 0 0 1 1 1 1 0 2 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 10600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  0  0  1 -1  0  0  1  0  0  0 -1  1] (Indices: [0, 1, 2, 6, 11, 15, 16, 17, 18]), Candidate: [2 1 0 0 1 2 0 0 1 1 1 0 1 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 10650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  0  0  0  0  1 -1  1  0  0  0 -1  1] (Indices: [0, 1, 2, 6, 13, 15, 16, 17, 18]), Candidate: [2 1 0 0 1 2 0 0 1 1 0 1 2 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 10700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0  0 -1  1  0 -1  0  0  1 -1  0  0  1] (Indices: [0, 1, 2, 7, 8, 9, 11, 12, 16]), Candidate: [2 1 0 0 1 1 2 0 1 0 1 1 0 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 10750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0  0 -1  0  0  1  0 -1  0  0  0  1  0] (Indices: [0, 1, 2, 7, 8, 9, 13, 14, 19]), Candidate: [ 2  1  0  0  1  1  2  0  1  0  0  1  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0 -1  1  0 -1  0  0  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 7, 8, 10, 11, 15, 17]), Candidate: [2 1 0 0 1 1 2 0 0 2 0 0 1 1 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 10850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0 -1  1 -1  0  0  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 7, 8, 10, 14, 16, 18]), Candidate: [ 2  1  0  0  1  1  2  0  0  2 -1  1  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0 -1  0  1 -1  1 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 7, 8, 11, 13, 18, 19]), Candidate: [2 1 0 0 1 1 2 0 0 1 1 0 2 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 10950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0 -1  0  0  1 -1  0  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 7, 8, 12, 15, 17, 19]), Candidate: [2 1 0 0 1 1 2 0 0 1 0 2 0 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 11000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  1  0  0 -1  1 -1  0  1 -1  0  0  1] (Indices: [0, 1, 2, 7, 9, 10, 11, 13, 16]), Candidate: [ 2  1  0  0  1  1  2 -1  2  1  0  0  2  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  1  0 -1  0  1 -1  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 7, 9, 10, 13, 16, 18]), Candidate: [ 2  1  0  0  1  1  2 -1  2  1 -1  1  2  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 11100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  1 -1  1 -1  1  0 -1  0  0  0  1  0] (Indices: [0, 1, 2, 7, 9, 11, 13, 14, 19]), Candidate: [ 2  1  0  0  1  1  2 -1  2  0  1  0  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 11150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  1 -1  0  1 -1  1 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 7, 9, 12, 14, 16, 17]), Candidate: [ 2  1  0  0  1  1  2 -1  2  0  0  2  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 11200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  1 -1  0  0  0  0  0  1  0  0  0  0] (Indices: [0, 1, 2, 7, 9, 16, 17, 18, 19]), Candidate: [ 2  1  0  0  1  1  2 -1  2  0  0  1  1  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  0  1  0 -1  0  0  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 7, 10, 11, 15, 17, 18]), Candidate: [ 2  1  0  0  1  1  2 -1  1  2  0  0  1  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  0  1 -1  0  1  0 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 7, 10, 13, 14, 17, 19]), Candidate: [ 2  1  0  0  1  1  2 -1  1  2 -1  1  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 11350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  0  0  1  0 -1  1 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 7, 11, 12, 14, 17, 19]), Candidate: [ 2  1  0  0  1  1  2 -1  1  1  1  1  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 11400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  0  0  0  1  0  0  0 -1  0  0  1  0] (Indices: [0, 1, 2, 7, 12, 13, 14, 15, 19]), Candidate: [ 2  1  0  0  1  1  2 -1  1  1  0  2  1  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  0  0  0  0  0  1  0 -1  1  0  0  0] (Indices: [0, 1, 2, 7, 14, 15, 17, 18, 19]), Candidate: [ 2  1  0  0  1  1  2 -1  1  1  0  1  1  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1  0  0 -1  1 -1  0  0  0  1 -1  1  0] (Indices: [0, 1, 2, 8, 9, 10, 12, 17, 19]), Candidate: [ 2  1  0  0  1  1  1  1  1  1 -1  2  0  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1  0 -1  1  0 -1  0  1 -1  0  1 -1  1] (Indices: [0, 1, 2, 8, 9, 11, 12, 15, 18]), Candidate: [2 1 0 0 1 1 1 1 1 0 1 1 0 1 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 11600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1  0 -1  0  1  0 -1  1 -1  0  1 -1  1] (Indices: [0, 1, 2, 8, 9, 12, 13, 15, 18]), Candidate: [2 1 0 0 1 1 1 1 1 0 0 2 1 0 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 11650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1  0 -1  0  0  0  1  0  0 -1  0  1  0] (Indices: [0, 1, 2, 8, 9, 14, 15, 16, 19]), Candidate: [2 1 0 0 1 1 1 1 1 0 0 1 1 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 11700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1 -1  1  0 -1  0  1  0 -1  1 -1  0  1] (Indices: [0, 1, 2, 8, 10, 11, 14, 15, 17]), Candidate: [2 1 0 0 1 1 1 1 0 2 0 0 1 2 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 11750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1 -1  1 -1  1 -1  0  0  1  0  0 -1  1] (Indices: [0, 1, 2, 8, 10, 12, 16, 17, 18]), Candidate: [ 2  1  0  0  1  1  1  1  0  2 -1  2  0  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1 -1  0  1  0  0 -1  0  1 -1  0  1  0] (Indices: [0, 1, 2, 8, 11, 12, 13, 16, 19]), Candidate: [2 1 0 0 1 1 1 1 0 1 1 1 1 0 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 11850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1 -1  0  1 -1  0  1 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 8, 11, 14, 16, 17, 18]), Candidate: [ 2  1  0  0  1  1  1  1  0  1  1  0  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1 -1  0  0  0  1  0 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 8, 13, 14, 16, 17, 18]), Candidate: [ 2  1  0  0  1  1  1  1  0  1  0  1  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  1  0  0 -1  1 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 9, 10, 11, 13, 18, 19]), Candidate: [2 1 0 0 1 1 1 0 2 1 0 0 2 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 12000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  1  0 -1  1 -1  0  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 9, 10, 12, 15, 17, 19]), Candidate: [ 2  1  0  0  1  1  1  0  2  1 -1  2  0  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  1 -1  1  0  0 -1  0  1  0 -1  0  1] (Indices: [0, 1, 2, 9, 11, 12, 13, 16, 17]), Candidate: [2 1 0 0 1 1 1 0 2 0 1 1 1 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 12100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  1 -1  1 -1  0  1  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 9, 11, 14, 15, 17, 19]), Candidate: [2 1 0 0 1 1 1 0 2 0 1 0 1 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 12150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  1 -1  0  0  1  0  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 9, 13, 14, 15, 17, 19]), Candidate: [2 1 0 0 1 1 1 0 2 0 0 1 2 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 12200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  0  1  0  0 -1  0  0  1 -1  1  0  0] (Indices: [0, 1, 2, 10, 11, 12, 16, 18, 19]), Candidate: [2 1 0 0 1 1 1 0 1 2 0 1 0 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 12250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  0  1 -1  1  0 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 10, 12, 13, 15, 17, 18]), Candidate: [ 2  1  0  0  1  1  1  0  1  2 -1  2  1  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  0  0  1  0  0  0 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 11, 12, 13, 14, 17, 18]), Candidate: [ 2  1  0  0  1  1  1  0  1  1  1  1  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  0  0  0  1  0  0  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 12, 13, 14, 15, 16, 18]), Candidate: [2 1 0 0 1 1 1 0 1 1 0 2 1 1 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 12400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  0  1 -1  0  1 -1  0  0  0  0  0  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 10, 13]), Candidate: [ 2  0  2  0  1  1  1 -1  1  2 -1  1  2  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 12450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1  0 -1  0  0  0  0  0  0  1 -1  0  1] (Indices: [0, 1, 3, 4, 5, 6, 8, 9, 17]), Candidate: [2 0 2 0 1 1 0 1 1 0 0 1 1 1 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 12500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  1  0 -1  0  1 -1  0  0  0  0  0  1] (Indices: [0, 1, 3, 4, 5, 6, 9, 10, 13]), Candidate: [ 2  0  2  0  1  1  0  0  2  1 -1  1  2  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  0  1  0 -1  0  0  0  0  0  0  1  0] (Indices: [0, 1, 3, 4, 5, 6, 10, 11, 19]), Candidate: [2 0 2 0 1 1 0 0 1 2 0 0 1 1 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 12600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  0  0  1 -1  0  0  1 -1  0  0  1  0] (Indices: [0, 1, 3, 4, 5, 6, 11, 15, 19]), Candidate: [2 0 2 0 1 1 0 0 1 1 1 0 1 1 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 12650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  0  0  0  0  0  1 -1  0  1  0 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 14, 17, 18]), Candidate: [ 2  0  2  0  1  1  0  0  1  1  0  1  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0 -1  0  0  0  1 -1  0  0  1 -1  0  1] (Indices: [0, 1, 3, 4, 5, 7, 8, 13, 17]), Candidate: [2 0 2 0 1 0 2 0 0 1 0 1 2 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 12750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  1 -1  0  0  0  1 -1  0  1 -1  0  1] (Indices: [0, 1, 3, 4, 5, 7, 9, 14, 17]), Candidate: [ 2  0  2  0  1  0  2 -1  2  0  0  1  1  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 12800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  0  0  1  0 -1  1 -1  0  0  0  0  1] (Indices: [0, 1, 3, 4, 5, 7, 11, 12, 14]), Candidate: [ 2  0  2  0  1  0  2 -1  1  1  1  1  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 12850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  0  0  0  0  1  0 -1  0  1 -1  0  1] (Indices: [0, 1, 3, 4, 5, 7, 13, 14, 17]), Candidate: [ 2  0  2  0  1  0  2 -1  1  1  0  1  2  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 12900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1  0 -1  0  1  0 -1  0  0  0  0  0  1] (Indices: [0, 1, 3, 4, 5, 8, 9, 12, 13]), Candidate: [2 0 2 0 1 0 1 1 1 0 0 2 1 0 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 12950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1 -1  1 -1  0  0  1 -1  1 -1  0  0  1] (Indices: [0, 1, 3, 4, 5, 8, 10, 14, 16]), Candidate: [ 2  0  2  0  1  0  1  1  0  2 -1  1  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 13000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1 -1  0  0  1 -1  1 -1  0  1 -1  0  1] (Indices: [0, 1, 3, 4, 5, 8, 12, 14, 17]), Candidate: [ 2  0  2  0  1  0  1  1  0  1  0  2  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  1  0  0 -1  0  1 -1  0  0  0  0  1] (Indices: [0, 1, 3, 4, 5, 9, 10, 11, 14]), Candidate: [ 2  0  2  0  1  0  1  0  2  1  0  0  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  1 -1  1 -1  0  1 -1  0  0  1 -1  1] (Indices: [0, 1, 3, 4, 5, 9, 11, 14, 18]), Candidate: [ 2  0  2  0  1  0  1  0  2  0  1  0  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  1 -1  0  0  0  1  0 -1  0  1 -1  1] (Indices: [0, 1, 3, 4, 5, 9, 14, 15, 18]), Candidate: [2 0 2 0 1 0 1 0 2 0 0 1 1 2 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 13200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  0  1 -1  1  0 -1  0  0  0  1 -1  1] (Indices: [0, 1, 3, 4, 5, 10, 12, 13, 18]), Candidate: [ 2  0  2  0  1  0  1  0  1  2 -1  2  1  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  0  1 -1  0  0  0  0  1 -1  1  0  0] (Indices: [0, 1, 3, 4, 5, 10, 16, 18, 19]), Candidate: [ 2  0  2  0  1  0  1  0  1  2 -1  1  1  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  0  0  1 -1  0  0  1  0 -1  0  1  0] (Indices: [0, 1, 3, 4, 5, 11, 15, 16, 19]), Candidate: [2 0 2 0 1 0 1 0 1 1 1 0 1 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 13350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  0  0  0  0  1  0 -1  0  1  0 -1  1] (Indices: [0, 1, 3, 4, 5, 13, 14, 17, 18]), Candidate: [ 2  0  2  0  1  0  1  0  1  1  0  1  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0 -1  0  1 -1  0  0  1 -1  0  0  0  1] (Indices: [0, 1, 3, 4, 6, 7, 8, 11, 15]), Candidate: [2 0 2 0 0 2 1 0 0 1 1 0 1 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 13450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  1 -1  0  1  0 -1  0  0  0  0  0  1] (Indices: [0, 1, 3, 4, 6, 7, 9, 12, 13]), Candidate: [ 2  0  2  0  0  2  1 -1  2  0  0  2  1  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  0  1 -1  0  0  1 -1  1 -1  0  0  1] (Indices: [0, 1, 3, 4, 6, 7, 10, 14, 16]), Candidate: [ 2  0  2  0  0  2  1 -1  1  2 -1  1  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 13550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  0  0  0  1 -1  1 -1  0  1 -1  0  1] (Indices: [0, 1, 3, 4, 6, 7, 12, 14, 17]), Candidate: [ 2  0  2  0  0  2  1 -1  1  1  0  2  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 13600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1  0  0 -1  0  1 -1  0  0  0  0  0  1] (Indices: [0, 1, 3, 4, 6, 8, 9, 10, 13]), Candidate: [ 2  0  2  0  0  2  0  1  1  1 -1  1  2  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1 -1  1  0 -1  0  0  0  0  0  0  1  0] (Indices: [0, 1, 3, 4, 6, 8, 10, 11, 19]), Candidate: [2 0 2 0 0 2 0 1 0 2 0 0 1 1 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 13700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1 -1  0  1 -1  0  0  1 -1  0  0  1  0] (Indices: [0, 1, 3, 4, 6, 8, 11, 15, 19]), Candidate: [2 0 2 0 0 2 0 1 0 1 1 0 1 1 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 13750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1 -1  0  0  0  0  1 -1  0  1  0 -1  1] (Indices: [0, 1, 3, 4, 6, 8, 14, 17, 18]), Candidate: [ 2  0  2  0  0  2  0  1  0  1  0  1  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  1 -1  1  0 -1  1 -1  0  0  0  0  1] (Indices: [0, 1, 3, 4, 6, 9, 11, 12, 14]), Candidate: [ 2  0  2  0  0  2  0  0  2  0  1  1  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  1 -1  0  0  1  0 -1  0  1 -1  0  1] (Indices: [0, 1, 3, 4, 6, 9, 13, 14, 17]), Candidate: [ 2  0  2  0  0  2  0  0  2  0  0  1  2  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  0  1  0 -1  0  1 -1  0  0  0  1  0] (Indices: [0, 1, 3, 4, 6, 10, 11, 14, 19]), Candidate: [ 2  0  2  0  0  2  0  0  1  2  0  0  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  0  1 -1  0  0  1  0 -1  0  0  1  0] (Indices: [0, 1, 3, 4, 6, 10, 14, 15, 19]), Candidate: [ 2  0  2  0  0  2  0  0  1  2 -1  1  1  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  0  0  1 -1  1 -1  0  0  1  0 -1  1] (Indices: [0, 1, 3, 4, 6, 11, 13, 17, 18]), Candidate: [2 0 2 0 0 2 0 0 1 1 1 0 2 0 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 14050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  0  0  0  1 -1  0  1  0 -1  0  1  0] (Indices: [0, 1, 3, 4, 6, 12, 15, 16, 19]), Candidate: [2 0 2 0 0 2 0 0 1 1 0 2 0 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 14100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0  0  0 -1  0  0  0  0  0  0  1 -1  1] (Indices: [0, 1, 3, 4, 7, 8, 9, 10, 18]), Candidate: [ 2  0  2  0  0  1  2  0  1  1 -1  1  1  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0 -1  1 -1  1 -1  0  0  0  1 -1  0  1] (Indices: [0, 1, 3, 4, 7, 8, 10, 12, 17]), Candidate: [ 2  0  2  0  0  1  2  0  0  2 -1  2  0  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0 -1  0  1 -1  0  0  0  0  1 -1  1  0] (Indices: [0, 1, 3, 4, 7, 8, 11, 17, 19]), Candidate: [2 0 2 0 0 1 2 0 0 1 1 0 1 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 14250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0 -1  0  0  0  0  0  1  0 -1  0  1  0] (Indices: [0, 1, 3, 4, 7, 8, 15, 16, 19]), Candidate: [2 0 2 0 0 1 2 0 0 1 0 1 1 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 14300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  1 -1  1  0 -1  0  0  0  0  0  1  0] (Indices: [0, 1, 3, 4, 7, 9, 11, 12, 19]), Candidate: [ 2  0  2  0  0  1  2 -1  2  0  1  1  0  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  1 -1  0  0  1 -1  1 -1  0  1 -1  1] (Indices: [0, 1, 3, 4, 7, 9, 13, 15, 18]), Candidate: [ 2  0  2  0  0  1  2 -1  2  0  0  1  2  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  0  1  0 -1  0  0  0  1  0 -1  0  1] (Indices: [0, 1, 3, 4, 7, 10, 11, 16, 17]), Candidate: [ 2  0  2  0  0  1  2 -1  1  2  0  0  1  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  0  1 -1  0  0  1 -1  0  1 -1  1  0] (Indices: [0, 1, 3, 4, 7, 10, 14, 17, 19]), Candidate: [ 2  0  2  0  0  1  2 -1  1  2 -1  1  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 14500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  0  0  1 -1  0  1  0 -1  0  1 -1  1] (Indices: [0, 1, 3, 4, 7, 11, 14, 15, 18]), Candidate: [ 2  0  2  0  0  1  2 -1  1  1  1  0  1  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  0  0  0  1 -1  0  0  1  0 -1  1  0] (Indices: [0, 1, 3, 4, 7, 12, 16, 17, 19]), Candidate: [ 2  0  2  0  0  1  2 -1  1  1  0  2  0  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1  0  0 -1  1 -1  0  0  0  1 -1  0  1] (Indices: [0, 1, 3, 4, 8, 9, 10, 12, 17]), Candidate: [ 2  0  2  0  0  1  1  1  1  1 -1  2  0  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1  0 -1  1 -1  0  0  0  0  1 -1  1  0] (Indices: [0, 1, 3, 4, 8, 9, 11, 17, 19]), Candidate: [2 0 2 0 0 1 1 1 1 0 1 0 1 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 14700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1  0 -1  0  0  0  0  1  0 -1  0  1  0] (Indices: [0, 1, 3, 4, 8, 9, 15, 16, 19]), Candidate: [2 0 2 0 0 1 1 1 1 0 0 1 1 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 14750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1 -1  1 -1  1 -1  0  1 -1  0  0  1  0] (Indices: [0, 1, 3, 4, 8, 10, 12, 15, 19]), Candidate: [ 2  0  2  0  0  1  1  1  0  2 -1  2  0  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1 -1  0  1  0 -1  1 -1  0  1 -1  0  1] (Indices: [0, 1, 3, 4, 8, 11, 12, 14, 17]), Candidate: [ 2  0  2  0  0  1  1  1  0  1  1  1  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1 -1  0  0  1  0  0 -1  0  1 -1  0  1] (Indices: [0, 1, 3, 4, 8, 12, 13, 14, 17]), Candidate: [ 2  0  2  0  0  1  1  1  0  1  0  2  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1 -1  0  0  0  1 -1  0  1  0 -1  1  0] (Indices: [0, 1, 3, 4, 8, 13, 16, 17, 19]), Candidate: [2 0 2 0 0 1 1 1 0 1 0 1 2 0 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 14950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  1  0 -1  1  0 -1  0  0  0  1 -1  1] (Indices: [0, 1, 3, 4, 9, 10, 12, 13, 18]), Candidate: [ 2  0  2  0  0  1  1  0  2  1 -1  2  1  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  1  0 -1  0  0  0  0  1 -1  1  0  0] (Indices: [0, 1, 3, 4, 9, 10, 16, 18, 19]), Candidate: [ 2  0  2  0  0  1  1  0  2  1 -1  1  1  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  1 -1  1 -1  0  0  1  0 -1  0  1  0] (Indices: [0, 1, 3, 4, 9, 11, 15, 16, 19]), Candidate: [2 0 2 0 0 1 1 0 2 0 1 0 1 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 15100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  1 -1  0  0  1  0 -1  0  1  0 -1  1] (Indices: [0, 1, 3, 4, 9, 13, 14, 17, 18]), Candidate: [ 2  0  2  0  0  1  1  0  2  0  0  1  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  0  1  0 -1  1  0 -1  1 -1  0  0  1] (Indices: [0, 1, 3, 4, 10, 11, 13, 14, 16]), Candidate: [ 2  0  2  0  0  1  1  0  1  2  0  0  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  0  1 -1  1 -1  1  0 -1  1 -1  0  1] (Indices: [0, 1, 3, 4, 10, 12, 14, 15, 17]), Candidate: [ 2  0  2  0  0  1  1  0  1  2 -1  2  0  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  0  1 -1  0  0  0  1  0  0 -1  1  0] (Indices: [0, 1, 3, 4, 10, 15, 16, 17, 19]), Candidate: [ 2  0  2  0  0  1  1  0  1  2 -1  1  1  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  0  0  1 -1  1 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 3, 4, 11, 13, 15, 16, 18]), Candidate: [2 0 2 0 0 1 1 0 1 1 1 0 2 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 15350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  0  0  0  1 -1  1 -1  1  0  0 -1  1] (Indices: [0, 1, 3, 4, 12, 14, 16, 17, 18]), Candidate: [ 2  0  2  0  0  1  1  0  1  1  0  2  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0 -1  0  1 -1  1 -1  0  0  0  0  0  1] (Indices: [0, 1, 3, 5, 6, 7, 8, 11, 13]), Candidate: [ 2  0  2 -1  2  1  1  0  0  1  1  0  2  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  1 -1  1 -1  0  0  0  0  0  1 -1  1] (Indices: [0, 1, 3, 5, 6, 7, 9, 11, 18]), Candidate: [ 2  0  2 -1  2  1  1 -1  2  0  1  0  1  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  0  1 -1  0  1 -1  0  0  0  0  1  0] (Indices: [0, 1, 3, 5, 6, 7, 10, 13, 19]), Candidate: [ 2  0  2 -1  2  1  1 -1  1  2 -1  1  2  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 15550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  0  0  0  1 -1  1  0 -1  0  0  0  1] (Indices: [0, 1, 3, 5, 6, 7, 12, 14, 15]), Candidate: [ 2  0  2 -1  2  1  1 -1  1  1  0  2  0  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1  0  0  0 -1  0  0  0  0  0  0  0  1] (Indices: [0, 1, 3, 5, 6, 8, 9, 10, 11]), Candidate: [ 2  0  2 -1  2  1  0  1  1  1  0  0  1  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1 -1  1  0 -1  0  0  0  0  1 -1  0  1] (Indices: [0, 1, 3, 5, 6, 8, 10, 11, 17]), Candidate: [ 2  0  2 -1  2  1  0  1  0  2  0  0  1  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1 -1  0  1 -1  0  0  1 -1  1 -1  0  1] (Indices: [0, 1, 3, 5, 6, 8, 11, 15, 17]), Candidate: [ 2  0  2 -1  2  1  0  1  0  1  1  0  1  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1 -1  0  0  0  0  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 3, 5, 6, 8, 14, 16, 18]), Candidate: [ 2  0  2 -1  2  1  0  1  0  1  0  1  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  1  0 -1  0  0  0  0  0  0  1  0  0] (Indices: [0, 1, 3, 5, 6, 9, 10, 18, 19]), Candidate: [ 2  0  2 -1  2  1  0  0  2  1 -1  1  1  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  1 -1  0  0  1  0  0 -1  0  0  0  1] (Indices: [0, 1, 3, 5, 6, 9, 13, 14, 15]), Candidate: [ 2  0  2 -1  2  1  0  0  2  0  0  1  2  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  0  1  0 -1  0  1 -1  0  1 -1  0  1] (Indices: [0, 1, 3, 5, 6, 10, 11, 14, 17]), Candidate: [ 2  0  2 -1  2  1  0  0  1  2  0  0  1  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  0  1 -1  0  0  1  0 -1  1 -1  0  1] (Indices: [0, 1, 3, 5, 6, 10, 14, 15, 17]), Candidate: [ 2  0  2 -1  2  1  0  0  1  2 -1  1  1  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  0  0  1 -1  1 -1  0  1 -1  1 -1  1] (Indices: [0, 1, 3, 5, 6, 11, 13, 16, 18]), Candidate: [ 2  0  2 -1  2  1  0  0  1  1  1  0  2  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  0  0  0  1 -1  0  1  0  0 -1  0  1] (Indices: [0, 1, 3, 5, 6, 12, 15, 16, 17]), Candidate: [ 2  0  2 -1  2  1  0  0  1  1  0  2  0  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0  0  0 -1  0  0  0  0  1 -1  0  0  1] (Indices: [0, 1, 3, 5, 7, 8, 9, 10, 16]), Candidate: [ 2  0  2 -1  2  0  2  0  1  1 -1  1  1  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0 -1  1 -1  1 -1  0  1 -1  0  0  0  1] (Indices: [0, 1, 3, 5, 7, 8, 10, 12, 15]), Candidate: [ 2  0  2 -1  2  0  2  0  0  2 -1  2  0  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0 -1  0  1 -1  0  0  0  1 -1  0  1  0] (Indices: [0, 1, 3, 5, 7, 8, 11, 16, 19]), Candidate: [ 2  0  2 -1  2  0  2  0  0  1  1  0  1  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0 -1  0  0  0  0  0  1  0  0 -1  0  1] (Indices: [0, 1, 3, 5, 7, 8, 15, 16, 17]), Candidate: [ 2  0  2 -1  2  0  2  0  0  1  0  1  1  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  1 -1  1  0 -1  0  0  0  1 -1  0  1] (Indices: [0, 1, 3, 5, 7, 9, 11, 12, 17]), Candidate: [ 2  0  2 -1  2  0  2 -1  2  0  1  1  0  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  1 -1  0  0  1 -1  1  0 -1  0  0  1] (Indices: [0, 1, 3, 5, 7, 9, 13, 15, 16]), Candidate: [ 2  0  2 -1  2  0  2 -1  2  0  0  1  2  0  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  0  1  0 -1  0  0  1 -1  0  1 -1  1] (Indices: [0, 1, 3, 5, 7, 10, 11, 15, 18]), Candidate: [ 2  0  2 -1  2  0  2 -1  1  2  0  0  1  1  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  0  1 -1  0  0  1 -1  1 -1  0  1  0] (Indices: [0, 1, 3, 5, 7, 10, 14, 16, 19]), Candidate: [ 2  0  2 -1  2  0  2 -1  1  2 -1  1  1  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 16500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  0  0  1 -1  0  1  0  0 -1  0  0  1] (Indices: [0, 1, 3, 5, 7, 11, 14, 15, 16]), Candidate: [ 2  0  2 -1  2  0  2 -1  1  1  1  0  1  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  0  0  0  1 -1  0  1 -1  0  1  0  0] (Indices: [0, 1, 3, 5, 7, 12, 15, 18, 19]), Candidate: [ 2  0  2 -1  2  0  2 -1  1  1  0  2  0  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1  0  0 -1  1 -1  0  1 -1  0  0  0  1] (Indices: [0, 1, 3, 5, 8, 9, 10, 12, 15]), Candidate: [ 2  0  2 -1  2  0  1  1  1  1 -1  2  0  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1  0 -1  1 -1  0  0  0  1 -1  0  1  0] (Indices: [0, 1, 3, 5, 8, 9, 11, 16, 19]), Candidate: [ 2  0  2 -1  2  0  1  1  1  0  1  0  1  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1  0 -1  0  0  0  0  1  0  0 -1  0  1] (Indices: [0, 1, 3, 5, 8, 9, 15, 16, 17]), Candidate: [ 2  0  2 -1  2  0  1  1  1  0  0  1  1  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1 -1  1 -1  1 -1  0  1 -1  1 -1  0  1] (Indices: [0, 1, 3, 5, 8, 10, 12, 15, 17]), Candidate: [ 2  0  2 -1  2  0  1  1  0  2 -1  2  0  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1 -1  0  1  0 -1  1  0 -1  0  0  0  1] (Indices: [0, 1, 3, 5, 8, 11, 12, 14, 15]), Candidate: [ 2  0  2 -1  2  0  1  1  0  1  1  1  0  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1 -1  0  0  1  0  0  0 -1  0  0  0  1] (Indices: [0, 1, 3, 5, 8, 12, 13, 14, 15]), Candidate: [ 2  0  2 -1  2  0  1  1  0  1  0  2  1  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1 -1  0  0  0  1 -1  1 -1  0  1  0  0] (Indices: [0, 1, 3, 5, 8, 13, 15, 18, 19]), Candidate: [ 2  0  2 -1  2  0  1  1  0  1  0  1  2  0  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  1  0 -1  1  0 -1  0  1 -1  0  0  1] (Indices: [0, 1, 3, 5, 9, 10, 12, 13, 16]), Candidate: [ 2  0  2 -1  2  0  1  0  2  1 -1  2  1  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 17000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  1  0 -1  0  0  0  0  1  0  0 -1  1] (Indices: [0, 1, 3, 5, 9, 10, 16, 17, 18]), Candidate: [ 2  0  2 -1  2  0  1  0  2  1 -1  1  1  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 17050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  1 -1  1 -1  0  0  1  0  0 -1  0  1] (Indices: [0, 1, 3, 5, 9, 11, 15, 16, 17]), Candidate: [ 2  0  2 -1  2  0  1  0  2  0  1  0  1  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  1 -1  0  0  1  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 3, 5, 9, 13, 14, 16, 18]), Candidate: [ 2  0  2 -1  2  0  1  0  2  0  0  1  2  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 17150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  0  1  0  0 -1  0  0  0  0  1  0  0] (Indices: [0, 1, 3, 5, 10, 11, 12, 18, 19]), Candidate: [ 2  0  2 -1  2  0  1  0  1  2  0  1  0  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  0  1 -1  1  0 -1  0  0  0  1  0  0] (Indices: [0, 1, 3, 5, 10, 12, 13, 18, 19]), Candidate: [ 2  0  2 -1  2  0  1  0  1  2 -1  2  1  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 17250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  0  1 -1  0  0  1 -1  0  1  0  0  0] (Indices: [0, 1, 3, 5, 10, 14, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  0  1  0  1  2 -1  1  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 17300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  0  0  1 -1  1  0 -1  0  0  1  0  0] (Indices: [0, 1, 3, 5, 11, 13, 14, 18, 19]), Candidate: [ 2  0  2 -1  2  0  1  0  1  1  1  0  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 17350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  0  0  0  1 -1  1  0 -1  1 -1  1  0] (Indices: [0, 1, 3, 5, 12, 14, 15, 17, 19]), Candidate: [ 2  0  2 -1  2  0  1  0  1  1  0  2  0  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0  0 -1  0  1 -1  1 -1  0  0  0  0  1] (Indices: [0, 1, 3, 6, 7, 8, 9, 12, 14]), Candidate: [ 2  0  2 -1  1  2  1  0  1  0  0  2  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 17450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0 -1  1 -1  0  0  1 -1  0  1 -1  0  1] (Indices: [0, 1, 3, 6, 7, 8, 10, 14, 17]), Candidate: [ 2  0  2 -1  1  2  1  0  0  2 -1  1  1  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 17500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0 -1  0  0  1 -1  1 -1  0  0  1 -1  1] (Indices: [0, 1, 3, 6, 7, 8, 12, 14, 18]), Candidate: [ 2  0  2 -1  1  2  1  0  0  1  0  2  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 17550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  1  0  0 -1  0  0  1 -1  0  0  0  1] (Indices: [0, 1, 3, 6, 7, 9, 10, 11, 15]), Candidate: [ 2  0  2 -1  1  2  1 -1  2  1  0  0  1  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 17600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  1 -1  1 -1  0  1 -1  0  0  0  1  0] (Indices: [0, 1, 3, 6, 7, 9, 11, 14, 19]), Candidate: [ 2  0  2 -1  1  2  1 -1  2  0  1  0  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 17650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  1 -1  0  0  0  1  0 -1  0  0  1  0] (Indices: [0, 1, 3, 6, 7, 9, 14, 15, 19]), Candidate: [ 2  0  2 -1  1  2  1 -1  2  0  0  1  1  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 17700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  0  1 -1  1  0 -1  0  0  0  0  1  0] (Indices: [0, 1, 3, 6, 7, 10, 12, 13, 19]), Candidate: [ 2  0  2 -1  1  2  1 -1  1  2 -1  2  1  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 17750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  0  1 -1  0  0  0  0  0  1  0  0  0] (Indices: [0, 1, 3, 6, 7, 10, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  2  1 -1  1  2 -1  1  1  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 17800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  0  0  1 -1  0  0  1 -1  1  0 -1  1] (Indices: [0, 1, 3, 6, 7, 11, 15, 17, 18]), Candidate: [ 2  0  2 -1  1  2  1 -1  1  1  1  0  1  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 17850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  0  0  0  0  1  0 -1  0  1 -1  1  0] (Indices: [0, 1, 3, 6, 7, 13, 14, 17, 19]), Candidate: [ 2  0  2 -1  1  2  1 -1  1  1  0  1  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 17900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1  0  0 -1  0  0  1 -1  0  1 -1  0  1] (Indices: [0, 1, 3, 6, 8, 9, 10, 14, 17]), Candidate: [ 2  0  2 -1  1  2  0  1  1  1 -1  1  1  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 17950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1  0 -1  0  1 -1  1 -1  0  0  1 -1  1] (Indices: [0, 1, 3, 6, 8, 9, 12, 14, 18]), Candidate: [ 2  0  2 -1  1  2  0  1  1  0  0  2  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1 -1  1  0  0 -1  0  0  1 -1  0  0  1] (Indices: [0, 1, 3, 6, 8, 10, 11, 12, 16]), Candidate: [ 2  0  2 -1  1  2  0  1  0  2  0  1  0  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1 -1  1 -1  0  1  0 -1  0  0  0  1  0] (Indices: [0, 1, 3, 6, 8, 10, 13, 14, 19]), Candidate: [ 2  0  2 -1  1  2  0  1  0  2 -1  1  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 18100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1 -1  0  1  0 -1  0  0  0  1 -1  1  0] (Indices: [0, 1, 3, 6, 8, 11, 12, 17, 19]), Candidate: [ 2  0  2 -1  1  2  0  1  0  1  1  1  0  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1 -1  0  0  1  0 -1  0  0  1 -1  1  0] (Indices: [0, 1, 3, 6, 8, 12, 13, 17, 19]), Candidate: [ 2  0  2 -1  1  2  0  1  0  1  0  2  1  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1 -1  0  0  0  0  1 -1  1 -1  1  0  0] (Indices: [0, 1, 3, 6, 8, 14, 16, 18, 19]), Candidate: [ 2  0  2 -1  1  2  0  1  0  1  0  1  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  1  0 -1  1 -1  0  0  1  0 -1  0  1] (Indices: [0, 1, 3, 6, 9, 10, 12, 16, 17]), Candidate: [ 2  0  2 -1  1  2  0  0  2  1 -1  2  0  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  1 -1  1  0 -1  1 -1  0  0  1 -1  1] (Indices: [0, 1, 3, 6, 9, 11, 12, 14, 18]), Candidate: [ 2  0  2 -1  1  2  0  0  2  0  1  1  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  1 -1  0  1  0  0 -1  0  0  1 -1  1] (Indices: [0, 1, 3, 6, 9, 12, 13, 14, 18]), Candidate: [ 2  0  2 -1  1  2  0  0  2  0  0  2  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  1 -1  0  0  1 -1  0  1 -1  1  0  0] (Indices: [0, 1, 3, 6, 9, 13, 16, 18, 19]), Candidate: [ 2  0  2 -1  1  2  0  0  2  0  0  1  2  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  0  1  0 -1  1 -1  0  0  1  0 -1  1] (Indices: [0, 1, 3, 6, 10, 11, 13, 17, 18]), Candidate: [ 2  0  2 -1  1  2  0  0  1  2  0  0  2  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  0  1 -1  1 -1  0  1  0 -1  0  1  0] (Indices: [0, 1, 3, 6, 10, 12, 15, 16, 19]), Candidate: [ 2  0  2 -1  1  2  0  0  1  2 -1  2  0  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  0  0  1  0  0 -1  1 -1  0  1 -1  1] (Indices: [0, 1, 3, 6, 11, 12, 13, 15, 18]), Candidate: [ 2  0  2 -1  1  2  0  0  1  1  1  1  1  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  0  0  1 -1  0  1  0  0 -1  0  1  0] (Indices: [0, 1, 3, 6, 11, 14, 15, 16, 19]), Candidate: [ 2  0  2 -1  1  2  0  0  1  1  1  0  1  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  0  0  0  0  1  0  0  0 -1  0  1  0] (Indices: [0, 1, 3, 6, 13, 14, 15, 16, 19]), Candidate: [ 2  0  2 -1  1  2  0  0  1  1  0  1  2  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0  0  0 -1  0  0  0  0  1 -1  1 -1  1] (Indices: [0, 1, 3, 7, 8, 9, 10, 16, 18]), Candidate: [ 2  0  2 -1  1  1  2  0  1  1 -1  1  1  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0  0 -1  0  1 -1  0  0  1 -1  0  1  0] (Indices: [0, 1, 3, 7, 8, 9, 12, 16, 19]), Candidate: [ 2  0  2 -1  1  1  2  0  1  0  0  2  0  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0 -1  1  0 -1  1 -1  0  0  0  1 -1  1] (Indices: [0, 1, 3, 7, 8, 10, 11, 13, 18]), Candidate: [ 2  0  2 -1  1  1  2  0  0  2  0  0  2  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0 -1  1 -1  0  1 -1  0  0  1  0 -1  1] (Indices: [0, 1, 3, 7, 8, 10, 13, 17, 18]), Candidate: [ 2  0  2 -1  1  1  2  0  0  2 -1  1  2  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0 -1  0  1 -1  1 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 3, 7, 8, 11, 13, 15, 17]), Candidate: [ 2  0  2 -1  1  1  2  0  0  1  1  0  2  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0 -1  0  0  1 -1  1 -1  1 -1  0  1  0] (Indices: [0, 1, 3, 7, 8, 12, 14, 16, 19]), Candidate: [ 2  0  2 -1  1  1  2  0  0  1  0  2  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 19000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  1  0  0  0 -1  1 -1  0  0  0  0  1] (Indices: [0, 1, 3, 7, 9, 10, 11, 12, 14]), Candidate: [ 2  0  2 -1  1  1  2 -1  2  1  0  1  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 19050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  1  0 -1  0  1  0 -1  0  1 -1  0  1] (Indices: [0, 1, 3, 7, 9, 10, 13, 14, 17]), Candidate: [ 2  0  2 -1  1  1  2 -1  2  1 -1  1  2  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 19100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  1 -1  1  0 -1  0  0  1 -1  0  1  0] (Indices: [0, 1, 3, 7, 9, 11, 12, 16, 19]), Candidate: [ 2  0  2 -1  1  1  2 -1  2  0  1  1  0  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 19150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  1 -1  0  1  0 -1  0  1 -1  0  1  0] (Indices: [0, 1, 3, 7, 9, 12, 13, 16, 19]), Candidate: [ 2  0  2 -1  1  1  2 -1  2  0  0  2  1  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 19200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  1 -1  0  0  0  1 -1  1  0  0 -1  1] (Indices: [0, 1, 3, 7, 9, 14, 16, 17, 18]), Candidate: [ 2  0  2 -1  1  1  2 -1  2  0  0  1  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 19250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  0  1  0 -1  0  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 3, 7, 10, 11, 14, 16, 18]), Candidate: [ 2  0  2 -1  1  1  2 -1  1  2  0  0  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 19300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  0  1 -1  0  1  0  0  0 -1  0  0  1] (Indices: [0, 1, 3, 7, 10, 13, 14, 15, 16]), Candidate: [ 2  0  2 -1  1  1  2 -1  1  2 -1  1  2  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 19350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  0  0  1  0 -1  1  0  0 -1  0  0  1] (Indices: [0, 1, 3, 7, 11, 12, 14, 15, 16]), Candidate: [ 2  0  2 -1  1  1  2 -1  1  1  1  1  0  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 19400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  0  0  1 -1  0  0  1  0  0  0 -1  1] (Indices: [0, 1, 3, 7, 11, 15, 16, 17, 18]), Candidate: [ 2  0  2 -1  1  1  2 -1  1  1  1  0  1  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 19450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  0  0  0  0  1 -1  1  0  0  0 -1  1] (Indices: [0, 1, 3, 7, 13, 15, 16, 17, 18]), Candidate: [ 2  0  2 -1  1  1  2 -1  1  1  0  1  2  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 19500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1  0  0 -1  1 -1  0  1  0 -1  0  0  1] (Indices: [0, 1, 3, 8, 9, 10, 12, 15, 16]), Candidate: [ 2  0  2 -1  1  1  1  1  1  1 -1  2  0  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 19550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1  0 -1  1  0  0 -1  0  0  0  0  1  0] (Indices: [0, 1, 3, 8, 9, 11, 12, 13, 19]), Candidate: [ 2  0  2 -1  1  1  1  1  1  0  1  1  1  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1  0 -1  1 -1  0  0  0  0  1  0  0  0] (Indices: [0, 1, 3, 8, 9, 11, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  1  1  1  0  1  0  1  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1  0 -1  0  0  1 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 3, 8, 9, 13, 15, 17, 19]), Candidate: [ 2  0  2 -1  1  1  1  1  1  0  0  1  2  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1 -1  1  0 -1  1 -1  1 -1  0  0  1  0] (Indices: [0, 1, 3, 8, 10, 11, 13, 15, 19]), Candidate: [ 2  0  2 -1  1  1  1  1  0  2  0  0  2  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1 -1  1 -1  1 -1  1 -1  0  1 -1  1  0] (Indices: [0, 1, 3, 8, 10, 12, 14, 17, 19]), Candidate: [ 2  0  2 -1  1  1  1  1  0  2 -1  2  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 19800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1 -1  0  1  0  0  0 -1  0  0  1 -1  1] (Indices: [0, 1, 3, 8, 11, 12, 13, 14, 18]), Candidate: [ 2  0  2 -1  1  1  1  1  0  1  1  1  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 19850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1 -1  0  1 -1  1 -1  0  1 -1  1  0  0] (Indices: [0, 1, 3, 8, 11, 13, 16, 18, 19]), Candidate: [ 2  0  2 -1  1  1  1  1  0  1  1  0  2  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1 -1  0  0  1 -1  0  1 -1  1  0  0  0] (Indices: [0, 1, 3, 8, 12, 15, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  1  1  0  1  0  2  0  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  1  0  0 -1  1 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 3, 9, 10, 11, 13, 15, 17]), Candidate: [ 2  0  2 -1  1  1  1  0  2  1  0  0  2  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  1  0 -1  1 -1  1 -1  1 -1  0  1  0] (Indices: [0, 1, 3, 9, 10, 12, 14, 16, 19]), Candidate: [ 2  0  2 -1  1  1  1  0  2  1 -1  2  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 20050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  1 -1  1  0  0  0 -1  1 -1  0  0  1] (Indices: [0, 1, 3, 9, 11, 12, 13, 14, 16]), Candidate: [ 2  0  2 -1  1  1  1  0  2  0  1  1  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  1 -1  1 -1  1 -1  0  1  0  0 -1  1] (Indices: [0, 1, 3, 9, 11, 13, 16, 17, 18]), Candidate: [ 2  0  2 -1  1  1  1  0  2  0  1  0  2  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  1 -1  0  1 -1  0  1  0  0 -1  1  0] (Indices: [0, 1, 3, 9, 12, 15, 16, 17, 19]), Candidate: [ 2  0  2 -1  1  1  1  0  2  0  0  2  0  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  0  1  0  0 -1  0  1  0  0 -1  0  1] (Indices: [0, 1, 3, 10, 11, 12, 15, 16, 17]), Candidate: [ 2  0  2 -1  1  1  1  0  1  2  0  1  0  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  0  1 -1  1  0  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 3, 10, 12, 13, 14, 16, 18]), Candidate: [ 2  0  2 -1  1  1  1  0  1  2 -1  2  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 20300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  0  1 -1  0  0  0  1  0  0  0  0  0] (Indices: [0, 1, 3, 10, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  1  0  1  2 -1  1  1  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  0  0  1 -1  1 -1  0  1  0  0  0  0] (Indices: [0, 1, 3, 11, 13, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  1  0  1  1  1  0  2  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0 -1  1 -1  0  0  0  0  1 -1  0  0  1] (Indices: [0, 1, 4, 5, 6, 7, 8, 10, 16]), Candidate: [ 2  0  1  1  1  1  1  0  0  2 -1  1  1  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  1 -1  1 -1  1 -1  0  0  0  0  0  1] (Indices: [0, 1, 4, 5, 6, 7, 9, 11, 13]), Candidate: [ 2  0  1  1  1  1  1 -1  2  0  1  0  2  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  0  1 -1  0  1  0 -1  0  0  0  0  1] (Indices: [0, 1, 4, 5, 6, 7, 10, 13, 14]), Candidate: [ 2  0  1  1  1  1  1 -1  1  2 -1  1  2  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 20550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  0  0  0  1  0 -1  1 -1  0  0  0  1] (Indices: [0, 1, 4, 5, 6, 7, 12, 13, 15]), Candidate: [ 2  0  1  1  1  1  1 -1  1  1  0  2  1  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  0  0  0  0  0  0  1 -1  0  1  0  0] (Indices: [0, 1, 4, 5, 6, 7, 15, 18, 19]), Candidate: [ 2  0  1  1  1  1  1 -1  1  1  0  1  1  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1 -1  1  0  0 -1  0  0  0  0  0  0  1] (Indices: [0, 1, 4, 5, 6, 8, 10, 11, 12]), Candidate: [2 0 1 1 1 1 0 1 0 2 0 1 0 1 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 20700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1 -1  0  1 -1  0  1 -1  1 -1  0  0  1] (Indices: [0, 1, 4, 5, 6, 8, 11, 14, 16]), Candidate: [ 2  0  1  1  1  1  0  1  0  1  1  0  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1 -1  0  0  0  0  1  0  0 -1  0  0  1] (Indices: [0, 1, 4, 5, 6, 8, 14, 15, 16]), Candidate: [2 0 1 1 1 1 0 1 0 1 0 1 1 2 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 20800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  1  0 -1  0  0  0  0  1  0 -1  0  1] (Indices: [0, 1, 4, 5, 6, 9, 10, 16, 17]), Candidate: [ 2  0  1  1  1  1  0  0  2  1 -1  1  1  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  1 -1  0  1 -1  0  0  1 -1  1 -1  1] (Indices: [0, 1, 4, 5, 6, 9, 12, 16, 18]), Candidate: [2 0 1 1 1 1 0 0 2 0 0 2 0 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 20900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  0  1  0 -1  1 -1  0  0  1 -1  0  1] (Indices: [0, 1, 4, 5, 6, 10, 11, 13, 17]), Candidate: [2 0 1 1 1 1 0 0 1 2 0 0 2 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 20950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  0  1 -1  0  1 -1  0  1 -1  0  1  0] (Indices: [0, 1, 4, 5, 6, 10, 13, 16, 19]), Candidate: [ 2  0  1  1  1  1  0  0  1  2 -1  1  2  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  0  0  1 -1  1 -1  1  0 -1  0  0  1] (Indices: [0, 1, 4, 5, 6, 11, 13, 15, 16]), Candidate: [2 0 1 1 1 1 0 0 1 1 1 0 2 0 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 21050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  0  0  0  1 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 4, 5, 6, 12, 14, 16, 18]), Candidate: [ 2  0  1  1  1  1  0  0  1  1  0  2  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0  0  0  0 -1  0  0  0  0  0  0  0  1] (Indices: [0, 1, 4, 5, 7, 8, 9, 10, 11]), Candidate: [2 0 1 1 1 0 2 0 1 1 0 0 1 1 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 21150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0 -1  1  0 -1  0  0  0  0  1 -1  0  1] (Indices: [0, 1, 4, 5, 7, 8, 10, 11, 17]), Candidate: [2 0 1 1 1 0 2 0 0 2 0 0 1 1 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 21200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0 -1  0  1 -1  0  0  1 -1  1 -1  0  1] (Indices: [0, 1, 4, 5, 7, 8, 11, 15, 17]), Candidate: [2 0 1 1 1 0 2 0 0 1 1 0 1 1 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 21250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0 -1  0  0  0  0  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 4, 5, 7, 8, 14, 16, 18]), Candidate: [ 2  0  1  1  1  0  2  0  0  1  0  1  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  1  0 -1  0  0  0  0  0  0  1  0  0] (Indices: [0, 1, 4, 5, 7, 9, 10, 18, 19]), Candidate: [ 2  0  1  1  1  0  2 -1  2  1 -1  1  1  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  1 -1  0  0  1  0  0 -1  0  0  0  1] (Indices: [0, 1, 4, 5, 7, 9, 13, 14, 15]), Candidate: [ 2  0  1  1  1  0  2 -1  2  0  0  1  2  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  0  1  0 -1  0  1 -1  0  1 -1  0  1] (Indices: [0, 1, 4, 5, 7, 10, 11, 14, 17]), Candidate: [ 2  0  1  1  1  0  2 -1  1  2  0  0  1  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  0  1 -1  0  0  1  0 -1  1 -1  0  1] (Indices: [0, 1, 4, 5, 7, 10, 14, 15, 17]), Candidate: [ 2  0  1  1  1  0  2 -1  1  2 -1  1  1  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  0  0  1 -1  1 -1  0  1 -1  1 -1  1] (Indices: [0, 1, 4, 5, 7, 11, 13, 16, 18]), Candidate: [ 2  0  1  1  1  0  2 -1  1  1  1  0  2  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  0  0  0  1 -1  0  1  0  0 -1  0  1] (Indices: [0, 1, 4, 5, 7, 12, 15, 16, 17]), Candidate: [ 2  0  1  1  1  0  2 -1  1  1  0  2  0  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1  0  0  0 -1  0  0  0  0  1 -1  0  1] (Indices: [0, 1, 4, 5, 8, 9, 10, 11, 17]), Candidate: [2 0 1 1 1 0 1 1 1 1 0 0 1 1 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 21650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1  0 -1  1 -1  0  0  1 -1  1 -1  0  1] (Indices: [0, 1, 4, 5, 8, 9, 11, 15, 17]), Candidate: [2 0 1 1 1 0 1 1 1 0 1 0 1 1 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 21700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1  0 -1  0  0  0  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 4, 5, 8, 9, 14, 16, 18]), Candidate: [ 2  0  1  1  1  0  1  1  1  0  0  1  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1 -1  1 -1  1 -1  1 -1  1 -1  0  0  1] (Indices: [0, 1, 4, 5, 8, 10, 12, 14, 16]), Candidate: [ 2  0  1  1  1  0  1  1  0  2 -1  2  0  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1 -1  0  1  0  0 -1  1 -1  0  0  0  1] (Indices: [0, 1, 4, 5, 8, 11, 12, 13, 15]), Candidate: [2 0 1 1 1 0 1 1 0 1 1 1 1 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 21850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1 -1  0  1 -1  0  0  1 -1  0  1  0  0] (Indices: [0, 1, 4, 5, 8, 11, 15, 18, 19]), Candidate: [2 0 1 1 1 0 1 1 0 1 1 0 1 1 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 21900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1 -1  0  0  0  1 -1  1  0  0 -1  0  1] (Indices: [0, 1, 4, 5, 8, 13, 15, 16, 17]), Candidate: [2 0 1 1 1 0 1 1 0 1 0 1 2 0 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 21950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  1  0  0 -1  0  0  0  0  1  0 -1  1] (Indices: [0, 1, 4, 5, 9, 10, 11, 17, 18]), Candidate: [2 0 1 1 1 0 1 0 2 1 0 0 1 1 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 22000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  1  0 -1  0  0  0  1  0 -1  1 -1  1] (Indices: [0, 1, 4, 5, 9, 10, 15, 16, 18]), Candidate: [ 2  0  1  1  1  0  1  0  2  1 -1  1  1  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  1 -1  1 -1  0  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 4, 5, 9, 11, 14, 16, 18]), Candidate: [ 2  0  1  1  1  0  1  0  2  0  1  0  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  1 -1  0  0  1  0  0  0 -1  0  0  1] (Indices: [0, 1, 4, 5, 9, 13, 14, 15, 16]), Candidate: [2 0 1 1 1 0 1 0 2 0 0 1 2 1 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 22150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  0  1  0  0 -1  0  0  1  0 -1  0  1] (Indices: [0, 1, 4, 5, 10, 11, 12, 16, 17]), Candidate: [2 0 1 1 1 0 1 0 1 2 0 1 0 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 22200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  0  1 -1  1  0 -1  0  1  0 -1  0  1] (Indices: [0, 1, 4, 5, 10, 12, 13, 16, 17]), Candidate: [ 2  0  1  1  1  0  1  0  1  2 -1  2  1  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  0  1 -1  0  0  1  0 -1  1 -1  1  0] (Indices: [0, 1, 4, 5, 10, 14, 15, 17, 19]), Candidate: [ 2  0  1  1  1  0  1  0  1  2 -1  1  1  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  0  0  1 -1  1  0 -1  1  0 -1  0  1] (Indices: [0, 1, 4, 5, 11, 13, 14, 16, 17]), Candidate: [ 2  0  1  1  1  0  1  0  1  1  1  0  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  0  0  0  1  0 -1  0  0  1  0  0  0] (Indices: [0, 1, 4, 5, 12, 13, 17, 18, 19]), Candidate: [2 0 1 1 1 0 1 0 1 1 0 2 1 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 22400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0  0 -1  1 -1  0  0  0  1 -1  0  0  1] (Indices: [0, 1, 4, 6, 7, 8, 9, 11, 16]), Candidate: [2 0 1 1 0 2 1 0 1 0 1 0 1 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 22450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0 -1  1 -1  0  1 -1  0  0  1 -1  0  1] (Indices: [0, 1, 4, 6, 7, 8, 10, 13, 17]), Candidate: [ 2  0  1  1  0  2  1  0  0  2 -1  1  2  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0 -1  0  0  1  0 -1  0  0  0  1 -1  1] (Indices: [0, 1, 4, 6, 7, 8, 12, 13, 18]), Candidate: [2 0 1 1 0 2 1 0 0 1 0 2 1 0 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 22550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0 -1  0  0  0  0  0  0  1 -1  1  0  0] (Indices: [0, 1, 4, 6, 7, 8, 16, 18, 19]), Candidate: [2 0 1 1 0 2 1 0 0 1 0 1 1 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 22600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  1 -1  1 -1  1 -1  0  0  0  0  1  0] (Indices: [0, 1, 4, 6, 7, 9, 11, 13, 19]), Candidate: [ 2  0  1  1  0  2  1 -1  2  0  1  0  2  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  1 -1  0  0  1 -1  0  0  1 -1  1  0] (Indices: [0, 1, 4, 6, 7, 9, 13, 17, 19]), Candidate: [ 2  0  1  1  0  2  1 -1  2  0  0  1  2  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  0  1 -1  1  0  0 -1  0  0  0  0  1] (Indices: [0, 1, 4, 6, 7, 10, 12, 13, 14]), Candidate: [ 2  0  1  1  0  2  1 -1  1  2 -1  2  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 22750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  0  1 -1  0  0  0  1 -1  1 -1  1  0] (Indices: [0, 1, 4, 6, 7, 10, 15, 17, 19]), Candidate: [ 2  0  1  1  0  2  1 -1  1  2 -1  1  1  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 22800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  0  0  1 -1  0  1 -1  0  1 -1  1  0] (Indices: [0, 1, 4, 6, 7, 11, 14, 17, 19]), Candidate: [ 2  0  1  1  0  2  1 -1  1  1  1  0  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 22850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  0  0  0  0  1  0  0 -1  0  0  1  0] (Indices: [0, 1, 4, 6, 7, 13, 14, 15, 19]), Candidate: [ 2  0  1  1  0  2  1 -1  1  1  0  1  2  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1  0  0 -1  0  1 -1  0  0  1 -1  0  1] (Indices: [0, 1, 4, 6, 8, 9, 10, 13, 17]), Candidate: [ 2  0  1  1  0  2  0  1  1  1 -1  1  2  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1  0 -1  0  1  0 -1  0  0  0  1 -1  1] (Indices: [0, 1, 4, 6, 8, 9, 12, 13, 18]), Candidate: [2 0 1 1 0 2 0 1 1 0 0 2 1 0 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 23000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1  0 -1  0  0  0  0  0  1 -1  1  0  0] (Indices: [0, 1, 4, 6, 8, 9, 16, 18, 19]), Candidate: [2 0 1 1 0 2 0 1 1 0 0 1 1 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 23050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1 -1  1 -1  1 -1  0  0  0  0  1  0  0] (Indices: [0, 1, 4, 6, 8, 10, 12, 18, 19]), Candidate: [ 2  0  1  1  0  2  0  1  0  2 -1  2  0  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1 -1  0  1  0 -1  0  1 -1  0  0  1  0] (Indices: [0, 1, 4, 6, 8, 11, 12, 15, 19]), Candidate: [2 0 1 1 0 2 0 1 0 1 1 1 0 1 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 23150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1 -1  0  0  1  0 -1  1 -1  0  0  1  0] (Indices: [0, 1, 4, 6, 8, 12, 13, 15, 19]), Candidate: [2 0 1 1 0 2 0 1 0 1 0 2 1 0 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 23200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1 -1  0  0  0  0  1  0 -1  1  0 -1  1] (Indices: [0, 1, 4, 6, 8, 14, 15, 17, 18]), Candidate: [2 0 1 1 0 2 0 1 0 1 0 1 1 2 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 23250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  1  0 -1  1 -1  1 -1  0  0  0  1  0] (Indices: [0, 1, 4, 6, 9, 10, 12, 14, 19]), Candidate: [ 2  0  1  1  0  2  0  0  2  1 -1  2  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 23300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  1 -1  1  0  0 -1  0  0  0  1 -1  1] (Indices: [0, 1, 4, 6, 9, 11, 12, 13, 18]), Candidate: [2 0 1 1 0 2 0 0 2 0 1 1 1 0 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 23350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  1 -1  1 -1  0  0  0  1 -1  1  0  0] (Indices: [0, 1, 4, 6, 9, 11, 16, 18, 19]), Candidate: [2 0 1 1 0 2 0 0 2 0 1 0 1 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 23400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  1 -1  0  0  1 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 4, 6, 9, 13, 15, 17, 18]), Candidate: [2 0 1 1 0 2 0 0 2 0 0 1 2 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 23450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  0  1  0 -1  1 -1  1 -1  0  1 -1  1] (Indices: [0, 1, 4, 6, 10, 11, 13, 15, 18]), Candidate: [2 0 1 1 0 2 0 0 1 2 0 0 2 0 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 23500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  0  1 -1  1 -1  1 -1  0  1  0 -1  1] (Indices: [0, 1, 4, 6, 10, 12, 14, 17, 18]), Candidate: [ 2  0  1  1  0  2  0  0  1  2 -1  2  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 23550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  0  0  1  0  0  0 -1  0  1 -1  0  1] (Indices: [0, 1, 4, 6, 11, 12, 13, 14, 17]), Candidate: [ 2  0  1  1  0  2  0  0  1  1  1  1  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  0  0  1 -1  1 -1  0  1  0 -1  1  0] (Indices: [0, 1, 4, 6, 11, 13, 16, 17, 19]), Candidate: [2 0 1 1 0 2 0 0 1 1 1 0 2 0 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 23650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  0  0  0  1 -1  0  1  0 -1  1  0  0] (Indices: [0, 1, 4, 6, 12, 15, 16, 18, 19]), Candidate: [2 0 1 1 0 2 0 0 1 1 0 2 0 1 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 23700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0  0  0 -1  0  0  0  1  0 -1  0  0  1] (Indices: [0, 1, 4, 7, 8, 9, 10, 15, 16]), Candidate: [ 2  0  1  1  0  1  2  0  1  1 -1  1  1  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0  0 -1  0  1 -1  0  1 -1  1 -1  0  1] (Indices: [0, 1, 4, 7, 8, 9, 12, 15, 17]), Candidate: [2 0 1 1 0 1 2 0 1 0 0 2 0 1 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 23800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0 -1  1  0  0 -1  0  0  0  0  0  1  0] (Indices: [0, 1, 4, 7, 8, 10, 11, 12, 19]), Candidate: [2 0 1 1 0 1 2 0 0 2 0 1 0 1 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 23850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0 -1  1 -1  0  1 -1  1 -1  0  1 -1  1] (Indices: [0, 1, 4, 7, 8, 10, 13, 15, 18]), Candidate: [ 2  0  1  1  0  1  2  0  0  2 -1  1  2  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0 -1  0  1 -1  1  0 -1  1 -1  0  0  1] (Indices: [0, 1, 4, 7, 8, 11, 13, 14, 16]), Candidate: [ 2  0  1  1  0  1  2  0  0  1  1  0  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0 -1  0  0  1 -1  1  0 -1  1 -1  0  1] (Indices: [0, 1, 4, 7, 8, 12, 14, 15, 17]), Candidate: [2 0 1 1 0 1 2 0 0 1 0 2 0 2 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 24000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0 -1  0  0  0  0  0  1  0  0 -1  1  0] (Indices: [0, 1, 4, 7, 8, 15, 16, 17, 19]), Candidate: [2 0 1 1 0 1 2 0 0 1 0 1 1 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 24050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  1  0 -1  1 -1  0  0  0  1  0 -1  1] (Indices: [0, 1, 4, 7, 9, 10, 12, 17, 18]), Candidate: [ 2  0  1  1  0  1  2 -1  2  1 -1  2  0  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 24100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  1 -1  1  0 -1  0  1 -1  1 -1  0  1] (Indices: [0, 1, 4, 7, 9, 11, 12, 15, 17]), Candidate: [ 2  0  1  1  0  1  2 -1  2  0  1  1  0  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  1 -1  0  1  0 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 4, 7, 9, 12, 13, 15, 17]), Candidate: [ 2  0  1  1  0  1  2 -1  2  0  0  2  1  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  1 -1  0  0  0  1  0  0 -1  1 -1  1] (Indices: [0, 1, 4, 7, 9, 14, 15, 16, 18]), Candidate: [ 2  0  1  1  0  1  2 -1  2  0  0  1  1  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  0  1  0 -1  0  1  0  0 -1  0  0  1] (Indices: [0, 1, 4, 7, 10, 11, 14, 15, 16]), Candidate: [ 2  0  1  1  0  1  2 -1  1  2  0  0  1  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  0  1 -1  1 -1  0  1 -1  0  1  0  0] (Indices: [0, 1, 4, 7, 10, 12, 15, 18, 19]), Candidate: [ 2  0  1  1  0  1  2 -1  1  2 -1  2  0  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 24350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  0  0  1  0  0 -1  0  1 -1  1 -1  1] (Indices: [0, 1, 4, 7, 11, 12, 13, 16, 18]), Candidate: [ 2  0  1  1  0  1  2 -1  1  1  1  1  1  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  0  0  1 -1  0  1  0 -1  0  1  0  0] (Indices: [0, 1, 4, 7, 11, 14, 15, 18, 19]), Candidate: [ 2  0  1  1  0  1  2 -1  1  1  1  0  1  2  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  0  0  0  0  1  0  0 -1  0  1  0  0] (Indices: [0, 1, 4, 7, 13, 14, 15, 18, 19]), Candidate: [ 2  0  1  1  0  1  2 -1  1  1  0  1  2  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1  0  0 -1  1 -1  1  0 -1  0  0  0  1] (Indices: [0, 1, 4, 8, 9, 10, 12, 14, 15]), Candidate: [ 2  0  1  1  0  1  1  1  1  1 -1  2  0  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1  0 -1  1  0  0  0 -1  0  0  0  0  1] (Indices: [0, 1, 4, 8, 9, 11, 12, 13, 14]), Candidate: [ 2  0  1  1  0  1  1  1  1  0  1  1  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1  0 -1  1 -1  0  0  1 -1  1 -1  1  0] (Indices: [0, 1, 4, 8, 9, 11, 15, 17, 19]), Candidate: [2 0 1 1 0 1 1 1 1 0 1 0 1 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 24650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1  0 -1  0  0  1  0 -1  0  0  1  0  0] (Indices: [0, 1, 4, 8, 9, 13, 14, 18, 19]), Candidate: [ 2  0  1  1  0  1  1  1  1  0  0  1  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1 -1  1  0 -1  1  0 -1  0  0  1 -1  1] (Indices: [0, 1, 4, 8, 10, 11, 13, 14, 18]), Candidate: [ 2  0  1  1  0  1  1  1  0  2  0  0  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1 -1  1 -1  1 -1  1  0 -1  0  0  1  0] (Indices: [0, 1, 4, 8, 10, 12, 14, 15, 19]), Candidate: [ 2  0  1  1  0  1  1  1  0  2 -1  2  0  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1 -1  1 -1  0  0  0  1 -1  1  0  0  0] (Indices: [0, 1, 4, 8, 10, 15, 17, 18, 19]), Candidate: [ 2  0  1  1  0  1  1  1  0  2 -1  1  1  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1 -1  0  1 -1  1 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 4, 8, 11, 13, 15, 17, 18]), Candidate: [2 0 1 1 0 1 1 1 0 1 1 0 2 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 24900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1 -1  0  0  1 -1  1 -1  1 -1  1  0  0] (Indices: [0, 1, 4, 8, 12, 14, 16, 18, 19]), Candidate: [ 2  0  1  1  0  1  1  1  0  1  0  2  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  1  0  0 -1  1  0 -1  1 -1  0  0  1] (Indices: [0, 1, 4, 9, 10, 11, 13, 14, 16]), Candidate: [ 2  0  1  1  0  1  1  0  2  1  0  0  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  1  0 -1  1 -1  1  0 -1  1 -1  0  1] (Indices: [0, 1, 4, 9, 10, 12, 14, 15, 17]), Candidate: [ 2  0  1  1  0  1  1  0  2  1 -1  2  0  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  1  0 -1  0  0  0  1  0  0 -1  1  0] (Indices: [0, 1, 4, 9, 10, 15, 16, 17, 19]), Candidate: [ 2  0  1  1  0  1  1  0  2  1 -1  1  1  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  1 -1  1 -1  1 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 4, 9, 11, 13, 15, 16, 18]), Candidate: [2 0 1 1 0 1 1 0 2 0 1 0 2 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 25150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  1 -1  0  1 -1  1 -1  1  0  0 -1  1] (Indices: [0, 1, 4, 9, 12, 14, 16, 17, 18]), Candidate: [ 2  0  1  1  0  1  1  0  2  0  0  2  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  0  1  0  0 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 4, 10, 11, 12, 14, 16, 18]), Candidate: [ 2  0  1  1  0  1  1  0  1  2  0  1  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  0  1 -1  1  0  0  0  0 -1  0  0  1] (Indices: [0, 1, 4, 10, 12, 13, 14, 15, 16]), Candidate: [ 2  0  1  1  0  1  1  0  1  2 -1  2  1  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  0  1 -1  0  0  1  0  0  0  0 -1  1] (Indices: [0, 1, 4, 10, 14, 15, 16, 17, 18]), Candidate: [ 2  0  1  1  0  1  1  0  1  2 -1  1  1  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  0  0  1 -1  1  0 -1  0  1  0  0  0] (Indices: [0, 1, 4, 11, 13, 14, 17, 18, 19]), Candidate: [ 2  0  1  1  0  1  1  0  1  1  1  0  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0  0 -1  1 -1  1 -1  0  0  0  0  0  1] (Indices: [0, 1, 5, 6, 7, 8, 9, 11, 13]), Candidate: [2 0 1 0 2 1 1 0 1 0 1 0 2 0 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 25450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0 -1  1 -1  0  1  0 -1  0  0  0  0  1] (Indices: [0, 1, 5, 6, 7, 8, 10, 13, 14]), Candidate: [ 2  0  1  0  2  1  1  0  0  2 -1  1  2  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 25500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0 -1  0  0  1  0 -1  1 -1  0  0  0  1] (Indices: [0, 1, 5, 6, 7, 8, 12, 13, 15]), Candidate: [2 0 1 0 2 1 1 0 0 1 0 2 1 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 25550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0 -1  0  0  0  0  0  1 -1  0  1  0  0] (Indices: [0, 1, 5, 6, 7, 8, 15, 18, 19]), Candidate: [2 0 1 0 2 1 1 0 0 1 0 1 1 1 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 25600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  1 -1  1 -1  1 -1  0  1 -1  0  0  1] (Indices: [0, 1, 5, 6, 7, 9, 11, 13, 16]), Candidate: [ 2  0  1  0  2  1  1 -1  2  0  1  0  2  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  1 -1  0  0  1 -1  0  1 -1  1 -1  1] (Indices: [0, 1, 5, 6, 7, 9, 13, 16, 18]), Candidate: [ 2  0  1  0  2  1  1 -1  2  0  0  1  2  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  0  1  0 -1  0  0  0  0  1  0 -1  1] (Indices: [0, 1, 5, 6, 7, 10, 11, 17, 18]), Candidate: [ 2  0  1  0  2  1  1 -1  1  2  0  0  1  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  0  1 -1  0  0  0  1  0 -1  1 -1  1] (Indices: [0, 1, 5, 6, 7, 10, 15, 16, 18]), Candidate: [ 2  0  1  0  2  1  1 -1  1  2 -1  1  1  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 25800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  0  0  1 -1  0  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 5, 6, 7, 11, 14, 16, 18]), Candidate: [ 2  0  1  0  2  1  1 -1  1  1  1  0  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 25850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  0  0  0  0  1  0  0  0 -1  0  0  1] (Indices: [0, 1, 5, 6, 7, 13, 14, 15, 16]), Candidate: [ 2  0  1  0  2  1  1 -1  1  1  0  1  2  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1  0  0 -1  0  1  0 -1  0  0  0  0  1] (Indices: [0, 1, 5, 6, 8, 9, 10, 13, 14]), Candidate: [ 2  0  1  0  2  1  0  1  1  1 -1  1  2  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 25950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1  0 -1  0  1  0 -1  1 -1  0  0  0  1] (Indices: [0, 1, 5, 6, 8, 9, 12, 13, 15]), Candidate: [2 0 1 0 2 1 0 1 1 0 0 2 1 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 26000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1  0 -1  0  0  0  0  1 -1  0  1  0  0] (Indices: [0, 1, 5, 6, 8, 9, 15, 18, 19]), Candidate: [2 0 1 0 2 1 0 1 1 0 0 1 1 1 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 26050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1 -1  1 -1  1 -1  0  0  1 -1  0  1  0] (Indices: [0, 1, 5, 6, 8, 10, 12, 16, 19]), Candidate: [ 2  0  1  0  2  1  0  1  0  2 -1  2  0  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1 -1  0  1  0 -1  0  1  0 -1  0  0  1] (Indices: [0, 1, 5, 6, 8, 11, 12, 15, 16]), Candidate: [2 0 1 0 2 1 0 1 0 1 1 1 0 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 26150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1 -1  0  0  1  0 -1  1  0 -1  0  0  1] (Indices: [0, 1, 5, 6, 8, 12, 13, 15, 16]), Candidate: [2 0 1 0 2 1 0 1 0 1 0 2 1 0 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 26200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1 -1  0  0  0  0  1  0  0  0 -1  0  1] (Indices: [0, 1, 5, 6, 8, 14, 15, 16, 17]), Candidate: [2 0 1 0 2 1 0 1 0 1 0 1 1 2 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 26250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  1  0 -1  1 -1  1 -1  1 -1  0  0  1] (Indices: [0, 1, 5, 6, 9, 10, 12, 14, 16]), Candidate: [ 2  0  1  0  2  1  0  0  2  1 -1  2  0  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 26300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  1 -1  1  0  0 -1  1 -1  0  0  0  1] (Indices: [0, 1, 5, 6, 9, 11, 12, 13, 15]), Candidate: [2 0 1 0 2 1 0 0 2 0 1 1 1 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 26350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  1 -1  1 -1  0  0  1 -1  0  1  0  0] (Indices: [0, 1, 5, 6, 9, 11, 15, 18, 19]), Candidate: [2 0 1 0 2 1 0 0 2 0 1 0 1 1 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 26400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  1 -1  0  0  1 -1  1  0  0 -1  0  1] (Indices: [0, 1, 5, 6, 9, 13, 15, 16, 17]), Candidate: [2 0 1 0 2 1 0 0 2 0 0 1 2 0 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 26450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  0  1  0 -1  1  0 -1  0  0  0  1  0] (Indices: [0, 1, 5, 6, 10, 11, 13, 14, 19]), Candidate: [ 2  0  1  0  2  1  0  0  1  2  0  0  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  0  1 -1  1 -1  1 -1  1  0 -1  0  1] (Indices: [0, 1, 5, 6, 10, 12, 14, 16, 17]), Candidate: [ 2  0  1  0  2  1  0  0  1  2 -1  2  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 26550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  0  1 -1  0  0  0  0  1  0  0  0  0] (Indices: [0, 1, 5, 6, 10, 16, 17, 18, 19]), Candidate: [ 2  0  1  0  2  1  0  0  1  2 -1  1  1  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  0  0  1 -1  1 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 5, 6, 11, 13, 15, 17, 19]), Candidate: [2 0 1 0 2 1 0 0 1 1 1 0 2 0 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 26650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  0  0  0  1 -1  1 -1  0  1  0  0  0] (Indices: [0, 1, 5, 6, 12, 14, 17, 18, 19]), Candidate: [ 2  0  1  0  2  1  0  0  1  1  0  2  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0  0  0 -1  0  0  1 -1  0  1 -1  0  1] (Indices: [0, 1, 5, 7, 8, 9, 10, 14, 17]), Candidate: [ 2  0  1  0  2  0  2  0  1  1 -1  1  1  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 26750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0  0 -1  0  1 -1  1 -1  0  0  1 -1  1] (Indices: [0, 1, 5, 7, 8, 9, 12, 14, 18]), Candidate: [ 2  0  1  0  2  0  2  0  1  0  0  2  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0 -1  1  0  0 -1  0  0  1 -1  0  0  1] (Indices: [0, 1, 5, 7, 8, 10, 11, 12, 16]), Candidate: [2 0 1 0 2 0 2 0 0 2 0 1 0 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 26850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0 -1  1 -1  0  1  0 -1  0  0  0  1  0] (Indices: [0, 1, 5, 7, 8, 10, 13, 14, 19]), Candidate: [ 2  0  1  0  2  0  2  0  0  2 -1  1  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 26900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0 -1  0  1  0 -1  0  0  0  1 -1  1  0] (Indices: [0, 1, 5, 7, 8, 11, 12, 17, 19]), Candidate: [2 0 1 0 2 0 2 0 0 1 1 1 0 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 26950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0 -1  0  0  1  0 -1  0  0  1 -1  1  0] (Indices: [0, 1, 5, 7, 8, 12, 13, 17, 19]), Candidate: [2 0 1 0 2 0 2 0 0 1 0 2 1 0 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 27000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0 -1  0  0  0  0  1 -1  1 -1  1  0  0] (Indices: [0, 1, 5, 7, 8, 14, 16, 18, 19]), Candidate: [ 2  0  1  0  2  0  2  0  0  1  0  1  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  1  0 -1  1 -1  0  0  1  0 -1  0  1] (Indices: [0, 1, 5, 7, 9, 10, 12, 16, 17]), Candidate: [ 2  0  1  0  2  0  2 -1  2  1 -1  2  0  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  1 -1  1  0 -1  1 -1  0  0  1 -1  1] (Indices: [0, 1, 5, 7, 9, 11, 12, 14, 18]), Candidate: [ 2  0  1  0  2  0  2 -1  2  0  1  1  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  1 -1  0  1  0  0 -1  0  0  1 -1  1] (Indices: [0, 1, 5, 7, 9, 12, 13, 14, 18]), Candidate: [ 2  0  1  0  2  0  2 -1  2  0  0  2  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  1 -1  0  0  1 -1  0  1 -1  1  0  0] (Indices: [0, 1, 5, 7, 9, 13, 16, 18, 19]), Candidate: [ 2  0  1  0  2  0  2 -1  2  0  0  1  2  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  0  1  0 -1  1 -1  0  0  1  0 -1  1] (Indices: [0, 1, 5, 7, 10, 11, 13, 17, 18]), Candidate: [ 2  0  1  0  2  0  2 -1  1  2  0  0  2  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  0  1 -1  1 -1  0  1  0 -1  0  1  0] (Indices: [0, 1, 5, 7, 10, 12, 15, 16, 19]), Candidate: [ 2  0  1  0  2  0  2 -1  1  2 -1  2  0  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  0  0  1  0  0 -1  1 -1  0  1 -1  1] (Indices: [0, 1, 5, 7, 11, 12, 13, 15, 18]), Candidate: [ 2  0  1  0  2  0  2 -1  1  1  1  1  1  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  0  0  1 -1  0  1  0  0 -1  0  1  0] (Indices: [0, 1, 5, 7, 11, 14, 15, 16, 19]), Candidate: [ 2  0  1  0  2  0  2 -1  1  1  1  0  1  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  0  0  0  0  1  0  0  0 -1  0  1  0] (Indices: [0, 1, 5, 7, 13, 14, 15, 16, 19]), Candidate: [ 2  0  1  0  2  0  2 -1  1  1  0  1  2  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1  0  0 -1  1  0 -1  0  0  1 -1  0  1] (Indices: [0, 1, 5, 8, 9, 10, 12, 13, 17]), Candidate: [ 2  0  1  0  2  0  1  1  1  1 -1  2  1  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1  0  0 -1  0  0  0  0  1  0 -1  1  0] (Indices: [0, 1, 5, 8, 9, 10, 16, 17, 19]), Candidate: [ 2  0  1  0  2  0  1  1  1  1 -1  1  1  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1  0 -1  1 -1  0  0  1  0 -1  1 -1  1] (Indices: [0, 1, 5, 8, 9, 11, 15, 16, 18]), Candidate: [2 0 1 0 2 0 1 1 1 0 1 0 1 1 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 27650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1  0 -1  0  0  1  0 -1  1 -1  0  1  0] (Indices: [0, 1, 5, 8, 9, 13, 14, 16, 19]), Candidate: [ 2  0  1  0  2  0  1  1  1  0  0  1  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1 -1  1  0 -1  1  0  0 -1  0  0  0  1] (Indices: [0, 1, 5, 8, 10, 11, 13, 14, 15]), Candidate: [2 0 1 0 2 0 1 1 0 2 0 0 2 1 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 27750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1 -1  1 -1  1 -1  1  0  0 -1  0  0  1] (Indices: [0, 1, 5, 8, 10, 12, 14, 15, 16]), Candidate: [ 2  0  1  0  2  0  1  1  0  2 -1  2  0  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1 -1  1 -1  0  0  0  1  0  0  0 -1  1] (Indices: [0, 1, 5, 8, 10, 15, 16, 17, 18]), Candidate: [ 2  0  1  0  2  0  1  1  0  2 -1  1  1  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1 -1  0  1 -1  1 -1  1  0  0 -1  0  1] (Indices: [0, 1, 5, 8, 11, 13, 15, 16, 17]), Candidate: [2 0 1 0 2 0 1 1 0 1 1 0 2 0 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 27900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1 -1  0  0  1 -1  1  0 -1  0  1  0  0] (Indices: [0, 1, 5, 8, 12, 14, 15, 18, 19]), Candidate: [2 0 1 0 2 0 1 1 0 1 0 2 0 2 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 27950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  1  0  0  0 -1  0  0  0  1 -1  1  0] (Indices: [0, 1, 5, 9, 10, 11, 12, 17, 19]), Candidate: [2 0 1 0 2 0 1 0 2 1 0 1 0 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 28000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  1  0 -1  1  0 -1  0  0  1 -1  1  0] (Indices: [0, 1, 5, 9, 10, 12, 13, 17, 19]), Candidate: [ 2  0  1  0  2  0  1  0  2  1 -1  2  1  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  1  0 -1  0  0  1 -1  1 -1  1  0  0] (Indices: [0, 1, 5, 9, 10, 14, 16, 18, 19]), Candidate: [ 2  0  1  0  2  0  1  0  2  1 -1  1  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  1 -1  1 -1  1  0 -1  0  1 -1  1  0] (Indices: [0, 1, 5, 9, 11, 13, 14, 17, 19]), Candidate: [ 2  0  1  0  2  0  1  0  2  0  1  0  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  1 -1  0  1 -1  1  0 -1  1  0 -1  1] (Indices: [0, 1, 5, 9, 12, 14, 15, 17, 18]), Candidate: [2 0 1 0 2 0 1 0 2 0 0 2 0 2 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 28200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  0  1  0  0 -1  1  0 -1  0  1 -1  1] (Indices: [0, 1, 5, 10, 11, 12, 14, 15, 18]), Candidate: [2 0 1 0 2 0 1 0 1 2 0 1 0 2 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 28250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  0  1  0 -1  0  0  1  0 -1  1  0  0] (Indices: [0, 1, 5, 10, 11, 15, 16, 18, 19]), Candidate: [2 0 1 0 2 0 1 0 1 2 0 0 1 1 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 28300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  0  1 -1  0  1 -1  1  0 -1  1  0  0] (Indices: [0, 1, 5, 10, 13, 15, 16, 18, 19]), Candidate: [ 2  0  1  0  2  0  1  0  1  2 -1  1  2  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  0  0  1 -1  1  0 -1  1  0  0 -1  1] (Indices: [0, 1, 5, 11, 13, 14, 16, 17, 18]), Candidate: [ 2  0  1  0  2  0  1  0  1  1  1  0  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0  0  0  0 -1  0  0  0  0  0  0  1  0] (Indices: [0, 1, 6, 7, 8, 9, 10, 11, 19]), Candidate: [2 0 1 0 1 2 1 0 1 1 0 0 1 1 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 28450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0  0 -1  1 -1  0  0  1 -1  0  0  1  0] (Indices: [0, 1, 6, 7, 8, 9, 11, 15, 19]), Candidate: [2 0 1 0 1 2 1 0 1 0 1 0 1 1 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 28500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0  0 -1  0  0  0  1 -1  0  1  0 -1  1] (Indices: [0, 1, 6, 7, 8, 9, 14, 17, 18]), Candidate: [ 2  0  1  0  1  2  1  0  1  0  0  1  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0 -1  1 -1  1 -1  1 -1  0  0  1 -1  1] (Indices: [0, 1, 6, 7, 8, 10, 12, 14, 18]), Candidate: [ 2  0  1  0  1  2  1  0  0  2 -1  2  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0 -1  0  1  0  0 -1  0  0  1 -1  0  1] (Indices: [0, 1, 6, 7, 8, 11, 12, 13, 17]), Candidate: [2 0 1 0 1 2 1 0 0 1 1 1 1 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 28650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0 -1  0  1 -1  0  0  0  1  0 -1  1  0] (Indices: [0, 1, 6, 7, 8, 11, 16, 17, 19]), Candidate: [2 0 1 0 1 2 1 0 0 1 1 0 1 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 28700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0 -1  0  0  0  1 -1  1  0 -1  0  1  0] (Indices: [0, 1, 6, 7, 8, 13, 15, 16, 19]), Candidate: [2 0 1 0 1 2 1 0 0 1 0 1 2 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 28750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  1  0  0 -1  0  0  0  0  0  1  0  0] (Indices: [0, 1, 6, 7, 9, 10, 11, 18, 19]), Candidate: [ 2  0  1  0  1  2  1 -1  2  1  0  0  1  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  1  0 -1  0  0  0  1 -1  1  0 -1  1] (Indices: [0, 1, 6, 7, 9, 10, 15, 17, 18]), Candidate: [ 2  0  1  0  1  2  1 -1  2  1 -1  1  1  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  1 -1  1 -1  0  1 -1  0  1  0 -1  1] (Indices: [0, 1, 6, 7, 9, 11, 14, 17, 18]), Candidate: [ 2  0  1  0  1  2  1 -1  2  0  1  0  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  1 -1  0  0  1  0  0 -1  0  1 -1  1] (Indices: [0, 1, 6, 7, 9, 13, 14, 15, 18]), Candidate: [ 2  0  1  0  1  2  1 -1  2  0  0  1  2  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  0  1  0  0 -1  0  0  1 -1  0  1  0] (Indices: [0, 1, 6, 7, 10, 11, 12, 16, 19]), Candidate: [ 2  0  1  0  1  2  1 -1  1  2  0  1  0  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  0  1 -1  1  0 -1  0  1 -1  0  1  0] (Indices: [0, 1, 6, 7, 10, 12, 13, 16, 19]), Candidate: [ 2  0  1  0  1  2  1 -1  1  2 -1  2  1  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  0  1 -1  0  0  1 -1  1  0  0 -1  1] (Indices: [0, 1, 6, 7, 10, 14, 16, 17, 18]), Candidate: [ 2  0  1  0  1  2  1 -1  1  2 -1  1  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 29100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  0  0  1 -1  1  0 -1  1 -1  0  1  0] (Indices: [0, 1, 6, 7, 11, 13, 14, 16, 19]), Candidate: [ 2  0  1  0  1  2  1 -1  1  1  1  0  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  0  0  0  1 -1  1  0  0 -1  1 -1  1] (Indices: [0, 1, 6, 7, 12, 14, 15, 16, 18]), Candidate: [ 2  0  1  0  1  2  1 -1  1  1  0  2  0  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1  0  0  0 -1  0  1 -1  0  1 -1  0  1] (Indices: [0, 1, 6, 8, 9, 10, 11, 14, 17]), Candidate: [ 2  0  1  0  1  2  0  1  1  1  0  0  1  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1  0  0 -1  0  0  1  0 -1  1 -1  0  1] (Indices: [0, 1, 6, 8, 9, 10, 14, 15, 17]), Candidate: [ 2  0  1  0  1  2  0  1  1  1 -1  1  1  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1  0 -1  1 -1  1 -1  0  1 -1  1 -1  1] (Indices: [0, 1, 6, 8, 9, 11, 13, 16, 18]), Candidate: [2 0 1 0 1 2 0 1 1 0 1 0 2 0 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 29350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1  0 -1  0  1 -1  0  1  0  0 -1  0  1] (Indices: [0, 1, 6, 8, 9, 12, 15, 16, 17]), Candidate: [2 0 1 0 1 2 0 1 1 0 0 2 0 1 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 29400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1 -1  1  0  0  0 -1  0  0  0  0  1  0] (Indices: [0, 1, 6, 8, 10, 11, 12, 13, 19]), Candidate: [2 0 1 0 1 2 0 1 0 2 0 1 1 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 29450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1 -1  1  0 -1  0  0  0  0  1  0  0  0] (Indices: [0, 1, 6, 8, 10, 11, 17, 18, 19]), Candidate: [2 0 1 0 1 2 0 1 0 2 0 0 1 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 29500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1 -1  1 -1  0  1 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 6, 8, 10, 13, 15, 17, 19]), Candidate: [ 2  0  1  0  1  2  0  1  0  2 -1  1  2  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1 -1  0  1  0 -1  0  1 -1  1 -1  1  0] (Indices: [0, 1, 6, 8, 11, 12, 15, 17, 19]), Candidate: [2 0 1 0 1 2 0 1 0 1 1 1 0 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 29600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1 -1  0  0  1  0  0 -1  0  0  1  0  0] (Indices: [0, 1, 6, 8, 12, 13, 14, 18, 19]), Candidate: [ 2  0  1  0  1  2  0  1  0  1  0  2  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  1  0  0  0  0 -1  0  0  1 -1  0  1] (Indices: [0, 1, 6, 9, 10, 11, 12, 13, 17]), Candidate: [2 0 1 0 1 2 0 0 2 1 0 1 1 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 29700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  1  0  0 -1  0  0  0  1  0 -1  1  0] (Indices: [0, 1, 6, 9, 10, 11, 16, 17, 19]), Candidate: [2 0 1 0 1 2 0 0 2 1 0 0 1 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 29750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  1  0 -1  0  1 -1  1  0 -1  0  1  0] (Indices: [0, 1, 6, 9, 10, 13, 15, 16, 19]), Candidate: [ 2  0  1  0  1  2  0  0  2  1 -1  1  2  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  1 -1  1  0 -1  0  1  0 -1  0  1  0] (Indices: [0, 1, 6, 9, 11, 12, 15, 16, 19]), Candidate: [2 0 1 0 1 2 0 0 2 0 1 1 0 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 29850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  1 -1  0  1  0  0 -1  0  1  0 -1  1] (Indices: [0, 1, 6, 9, 12, 13, 14, 17, 18]), Candidate: [ 2  0  1  0  1  2  0  0  2  0  0  2  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  0  1  0  0  0  0 -1  1 -1  0  0  1] (Indices: [0, 1, 6, 10, 11, 12, 13, 14, 16]), Candidate: [ 2  0  1  0  1  2  0  0  1  2  0  1  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  0  1  0 -1  1 -1  0  1  0  0 -1  1] (Indices: [0, 1, 6, 10, 11, 13, 16, 17, 18]), Candidate: [2 0 1 0 1 2 0 0 1 2 0 0 2 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 30000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  0  1 -1  1 -1  0  1  0  0 -1  1  0] (Indices: [0, 1, 6, 10, 12, 15, 16, 17, 19]), Candidate: [ 2  0  1  0  1  2  0  0  1  2 -1  2  0  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  0  0  1  0 -1  1  0 -1  0  1  0  0] (Indices: [0, 1, 6, 11, 12, 14, 15, 18, 19]), Candidate: [2 0 1 0 1 2 0 0 1 1 1 1 0 2 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 30100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  0  0  0  1 -1  1 -1  1  0  0  0  0] (Indices: [0, 1, 6, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  0  1  0  1  2  0  0  1  1  0  2  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0  0  0 -1  1 -1  0  1 -1  0  1 -1  1] (Indices: [0, 1, 7, 8, 9, 10, 12, 15, 18]), Candidate: [ 2  0  1  0  1  1  2  0  1  1 -1  2  0  1  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0  0 -1  1  0 -1  1 -1  1 -1  0  0  1] (Indices: [0, 1, 7, 8, 9, 11, 12, 14, 16]), Candidate: [ 2  0  1  0  1  1  2  0  1  0  1  1  0  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0  0 -1  0  1  0  0 -1  1 -1  0  0  1] (Indices: [0, 1, 7, 8, 9, 12, 13, 14, 16]), Candidate: [ 2  0  1  0  1  1  2  0  1  0  0  2  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0  0 -1  0  0  1 -1  0  1  0  0 -1  1] (Indices: [0, 1, 7, 8, 9, 13, 16, 17, 18]), Candidate: [2 0 1 0 1 1 2 0 1 0 0 1 2 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 30350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0 -1  1  0 -1  1 -1  0  1 -1  1 -1  1] (Indices: [0, 1, 7, 8, 10, 11, 13, 16, 18]), Candidate: [2 0 1 0 1 1 2 0 0 2 0 0 2 0 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 30400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0 -1  1 -1  1 -1  0  1  0  0 -1  0  1] (Indices: [0, 1, 7, 8, 10, 12, 15, 16, 17]), Candidate: [ 2  0  1  0  1  1  2  0  0  2 -1  2  0  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0 -1  0  1  0  0 -1  1  0 -1  0  0  1] (Indices: [0, 1, 7, 8, 11, 12, 13, 15, 16]), Candidate: [2 0 1 0 1 1 2 0 0 1 1 1 1 0 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 30500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0 -1  0  1 -1  0  1  0  0  0 -1  0  1] (Indices: [0, 1, 7, 8, 11, 14, 15, 16, 17]), Candidate: [2 0 1 0 1 1 2 0 0 1 1 0 1 2 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 30550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0 -1  0  0  0  1  0  0  0  0 -1  0  1] (Indices: [0, 1, 7, 8, 13, 14, 15, 16, 17]), Candidate: [2 0 1 0 1 1 2 0 0 1 0 1 2 1 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 30600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  1  0  0 -1  1 -1  1 -1  0  0  1  0] (Indices: [0, 1, 7, 9, 10, 11, 13, 15, 19]), Candidate: [ 2  0  1  0  1  1  2 -1  2  1  0  0  2  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  1  0 -1  1 -1  1 -1  0  1 -1  1  0] (Indices: [0, 1, 7, 9, 10, 12, 14, 17, 19]), Candidate: [ 2  0  1  0  1  1  2 -1  2  1 -1  2  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 30700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  1 -1  1  0  0  0 -1  0  0  1 -1  1] (Indices: [0, 1, 7, 9, 11, 12, 13, 14, 18]), Candidate: [ 2  0  1  0  1  1  2 -1  2  0  1  1  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 30750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  1 -1  1 -1  1 -1  0  1 -1  1  0  0] (Indices: [0, 1, 7, 9, 11, 13, 16, 18, 19]), Candidate: [ 2  0  1  0  1  1  2 -1  2  0  1  0  2  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  1 -1  0  1 -1  0  1 -1  1  0  0  0] (Indices: [0, 1, 7, 9, 12, 15, 17, 18, 19]), Candidate: [ 2  0  1  0  1  1  2 -1  2  0  0  2  0  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  0  1  0  0 -1  0  1  0 -1  0  1  0] (Indices: [0, 1, 7, 10, 11, 12, 15, 16, 19]), Candidate: [ 2  0  1  0  1  1  2 -1  1  2  0  1  0  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  0  1 -1  1  0  0 -1  0  1  0 -1  1] (Indices: [0, 1, 7, 10, 12, 13, 14, 17, 18]), Candidate: [ 2  0  1  0  1  1  2 -1  1  2 -1  2  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 30950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  0  0  1  0  0  0  0 -1  1 -1  0  1] (Indices: [0, 1, 7, 11, 12, 13, 14, 15, 17]), Candidate: [ 2  0  1  0  1  1  2 -1  1  1  1  1  1  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  0  0  1 -1  0  1  0  0  0 -1  1  0] (Indices: [0, 1, 7, 11, 14, 15, 16, 17, 19]), Candidate: [ 2  0  1  0  1  1  2 -1  1  1  1  0  1  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1  0  0  0  0 -1  0  0  1 -1  0  1  0] (Indices: [0, 1, 8, 9, 10, 11, 12, 16, 19]), Candidate: [2 0 1 0 1 1 1 1 1 1 0 1 0 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 31100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1  0  0 -1  1  0 -1  0  1 -1  0  1  0] (Indices: [0, 1, 8, 9, 10, 12, 13, 16, 19]), Candidate: [ 2  0  1  0  1  1  1  1  1  1 -1  2  1  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1  0  0 -1  0  0  1 -1  1  0  0 -1  1] (Indices: [0, 1, 8, 9, 10, 14, 16, 17, 18]), Candidate: [ 2  0  1  0  1  1  1  1  1  1 -1  1  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1  0 -1  1 -1  1  0 -1  1 -1  0  1  0] (Indices: [0, 1, 8, 9, 11, 13, 14, 16, 19]), Candidate: [ 2  0  1  0  1  1  1  1  1  0  1  0  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1  0 -1  0  1 -1  1  0  0 -1  1 -1  1] (Indices: [0, 1, 8, 9, 12, 14, 15, 16, 18]), Candidate: [2 0 1 0 1 1 1 1 1 0 0 2 0 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 31300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1 -1  1  0  0 -1  1  0  0 -1  0  0  1] (Indices: [0, 1, 8, 10, 11, 12, 14, 15, 16]), Candidate: [2 0 1 0 1 1 1 1 0 2 0 1 0 2 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 31350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1 -1  1  0 -1  0  0  1  0  0  0 -1  1] (Indices: [0, 1, 8, 10, 11, 15, 16, 17, 18]), Candidate: [2 0 1 0 1 1 1 1 0 2 0 0 1 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 31400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1 -1  1 -1  0  1 -1  1  0  0  0 -1  1] (Indices: [0, 1, 8, 10, 13, 15, 16, 17, 18]), Candidate: [ 2  0  1  0  1  1  1  1  0  2 -1  1  2  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1 -1  0  1 -1  1  0  0 -1  1 -1  1  0] (Indices: [0, 1, 8, 11, 13, 14, 15, 17, 19]), Candidate: [2 0 1 0 1 1 1 1 0 1 1 0 2 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 31500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  1  0  0  0  0 -1  1  0 -1  0  0  1] (Indices: [0, 1, 9, 10, 11, 12, 13, 15, 16]), Candidate: [2 0 1 0 1 1 1 0 2 1 0 1 1 0 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 31550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  1  0  0 -1  0  1  0  0  0 -1  0  1] (Indices: [0, 1, 9, 10, 11, 14, 15, 16, 17]), Candidate: [2 0 1 0 1 1 1 0 2 1 0 0 1 2 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 31600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  1  0 -1  0  1  0  0  0  0 -1  0  1] (Indices: [0, 1, 9, 10, 13, 14, 15, 16, 17]), Candidate: [ 2  0  1  0  1  1  1  0  2  1 -1  1  2  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  1 -1  1  0 -1  1 -1  0  1  0  0  0] (Indices: [0, 1, 9, 11, 12, 14, 17, 18, 19]), Candidate: [ 2  0  1  0  1  1  1  0  2  0  1  1  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  1 -1  0  0  1  0  0  0 -1  1  0  0] (Indices: [0, 1, 9, 13, 14, 15, 16, 18, 19]), Candidate: [2 0 1 0 1 1 1 0 2 0 0 1 2 1 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 31750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  0  1  0 -1  1 -1  1  0  0  0 -1  1] (Indices: [0, 1, 10, 11, 13, 15, 16, 17, 18]), Candidate: [2 0 1 0 1 1 1 0 1 2 0 0 2 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 31800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  0  0  1  0  0 -1  1  0  0 -1  1  0] (Indices: [0, 1, 11, 12, 13, 15, 16, 17, 19]), Candidate: [2 0 1 0 1 1 1 0 1 1 1 1 1 0 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 31850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  0  1 -1  0  0  0  1 -1  0  0  0  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 10, 15]), Candidate: [ 1  2  1  0  1  1  1 -1  1  2 -1  1  1  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1  0 -1  0  0  0  0  0  0  0  0  1  0] (Indices: [0, 2, 3, 4, 5, 6, 8, 9, 19]), Candidate: [1 2 1 0 1 1 0 1 1 0 0 1 1 1 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 31950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  1  0 -1  0  0  0  1 -1  0  0  0  1] (Indices: [0, 2, 3, 4, 5, 6, 9, 10, 15]), Candidate: [ 1  2  1  0  1  1  0  0  2  1 -1  1  1  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  0  1 -1  1 -1  1 -1  0  0  0  0  1] (Indices: [0, 2, 3, 4, 5, 6, 10, 12, 14]), Candidate: [ 1  2  1  0  1  1  0  0  1  2 -1  2  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  0  0  1 -1  0  0  0  1 -1  1 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 11, 16, 18]), Candidate: [1 2 1 0 1 1 0 0 1 1 1 0 1 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 32100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  0  0  0  0  0  1 -1  0  0  1  0  0] (Indices: [0, 2, 3, 4, 5, 6, 14, 18, 19]), Candidate: [ 1  2  1  0  1  1  0  0  1  1  0  1  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0 -1  0  0  0  1 -1  0  0  0  0  1  0] (Indices: [0, 2, 3, 4, 5, 7, 8, 13, 19]), Candidate: [1 2 1 0 1 0 2 0 0 1 0 1 2 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 32200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  1 -1  0  0  0  1 -1  0  0  0  1  0] (Indices: [0, 2, 3, 4, 5, 7, 9, 14, 19]), Candidate: [ 1  2  1  0  1  0  2 -1  2  0  0  1  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  0  0  1  0 -1  0  0  1 -1  0  0  1] (Indices: [0, 2, 3, 4, 5, 7, 11, 12, 16]), Candidate: [ 1  2  1  0  1  0  2 -1  1  1  1  1  0  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  0  0  0  0  1  0 -1  0  0  0  1  0] (Indices: [0, 2, 3, 4, 5, 7, 13, 14, 19]), Candidate: [ 1  2  1  0  1  0  2 -1  1  1  0  1  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1  0 -1  0  1 -1  0  1 -1  0  0  0  1] (Indices: [0, 2, 3, 4, 5, 8, 9, 12, 15]), Candidate: [1 2 1 0 1 0 1 1 1 0 0 2 0 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 32400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1 -1  1 -1  0  0  1 -1  0  0  1 -1  1] (Indices: [0, 2, 3, 4, 5, 8, 10, 14, 18]), Candidate: [ 1  2  1  0  1  0  1  1  0  2 -1  1  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1 -1  0  0  1 -1  1 -1  0  0  0  1  0] (Indices: [0, 2, 3, 4, 5, 8, 12, 14, 19]), Candidate: [ 1  2  1  0  1  0  1  1  0  1  0  2  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  1  0  0 -1  0  0  0  1 -1  0  0  1] (Indices: [0, 2, 3, 4, 5, 9, 10, 11, 16]), Candidate: [1 2 1 0 1 0 1 0 2 1 0 0 1 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 32550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  1 -1  1 -1  0  0  1  0 -1  0  0  1] (Indices: [0, 2, 3, 4, 5, 9, 11, 15, 16]), Candidate: [1 2 1 0 1 0 1 0 2 0 1 0 1 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 32600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  1 -1  0  0  0  1 -1  1  0 -1  0  1] (Indices: [0, 2, 3, 4, 5, 9, 14, 16, 17]), Candidate: [ 1  2  1  0  1  0  1  0  2  0  0  1  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  0  1 -1  1 -1  1  0 -1  0  0  0  1] (Indices: [0, 2, 3, 4, 5, 10, 12, 14, 15]), Candidate: [ 1  2  1  0  1  0  1  0  1  2 -1  2  0  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  0  0  1  0  0  0 -1  0  0  0  0  1] (Indices: [0, 2, 3, 4, 5, 11, 12, 13, 14]), Candidate: [ 1  2  1  0  1  0  1  0  1  1  1  1  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  0  0  1 -1  0  0  1 -1  1 -1  1  0] (Indices: [0, 2, 3, 4, 5, 11, 15, 17, 19]), Candidate: [1 2 1 0 1 0 1 0 1 1 1 0 1 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 32800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  0  0  0  0  1  0 -1  0  0  1  0  0] (Indices: [0, 2, 3, 4, 5, 13, 14, 18, 19]), Candidate: [ 1  2  1  0  1  0  1  0  1  1  0  1  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0 -1  0  1 -1  0  0  0  0  1 -1  0  1] (Indices: [0, 2, 3, 4, 6, 7, 8, 11, 17]), Candidate: [1 2 1 0 0 2 1 0 0 1 1 0 1 1 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 32900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  1 -1  0  1 -1  0  1 -1  0  0  0  1] (Indices: [0, 2, 3, 4, 6, 7, 9, 12, 15]), Candidate: [ 1  2  1  0  0  2  1 -1  2  0  0  2  0  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  0  1 -1  0  0  1 -1  0  0  1 -1  1] (Indices: [0, 2, 3, 4, 6, 7, 10, 14, 18]), Candidate: [ 1  2  1  0  0  2  1 -1  1  2 -1  1  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 33000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  0  0  0  1 -1  1 -1  0  0  0  1  0] (Indices: [0, 2, 3, 4, 6, 7, 12, 14, 19]), Candidate: [ 1  2  1  0  0  2  1 -1  1  1  0  2  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 33050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1  0  0 -1  0  0  0  1 -1  0  0  0  1] (Indices: [0, 2, 3, 4, 6, 8, 9, 10, 15]), Candidate: [ 1  2  1  0  0  2  0  1  1  1 -1  1  1  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1 -1  1 -1  1 -1  1 -1  0  0  0  0  1] (Indices: [0, 2, 3, 4, 6, 8, 10, 12, 14]), Candidate: [ 1  2  1  0  0  2  0  1  0  2 -1  2  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 33150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1 -1  0  1 -1  0  0  0  1 -1  1 -1  1] (Indices: [0, 2, 3, 4, 6, 8, 11, 16, 18]), Candidate: [1 2 1 0 0 2 0 1 0 1 1 0 1 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 33200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1 -1  0  0  0  0  1 -1  0  0  1  0  0] (Indices: [0, 2, 3, 4, 6, 8, 14, 18, 19]), Candidate: [ 1  2  1  0  0  2  0  1  0  1  0  1  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  1 -1  1  0 -1  0  0  1 -1  0  0  1] (Indices: [0, 2, 3, 4, 6, 9, 11, 12, 16]), Candidate: [1 2 1 0 0 2 0 0 2 0 1 1 0 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 33300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  1 -1  0  0  1  0 -1  0  0  0  1  0] (Indices: [0, 2, 3, 4, 6, 9, 13, 14, 19]), Candidate: [ 1  2  1  0  0  2  0  0  2  0  0  1  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  0  1  0 -1  0  0  1 -1  1 -1  0  1] (Indices: [0, 2, 3, 4, 6, 10, 11, 15, 17]), Candidate: [1 2 1 0 0 2 0 0 1 2 0 0 1 1 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 33400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  0  1 -1  0  0  1 -1  1 -1  1 -1  1] (Indices: [0, 2, 3, 4, 6, 10, 14, 16, 18]), Candidate: [ 1  2  1  0  0  2  0  0  1  2 -1  1  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 33450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  0  0  1 -1  1 -1  0  0  0  1  0  0] (Indices: [0, 2, 3, 4, 6, 11, 13, 18, 19]), Candidate: [1 2 1 0 0 2 0 0 1 1 1 0 2 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 33500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  0  0  0  1 -1  0  1 -1  1 -1  1  0] (Indices: [0, 2, 3, 4, 6, 12, 15, 17, 19]), Candidate: [1 2 1 0 0 2 0 0 1 1 0 2 0 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 33550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0  0 -1  1  0 -1  0  0  0  0  0  0  1] (Indices: [0, 2, 3, 4, 7, 8, 9, 11, 12]), Candidate: [1 2 1 0 0 1 2 0 1 0 1 1 0 1 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 33600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0 -1  1 -1  1 -1  0  0  0  0  0  1  0] (Indices: [0, 2, 3, 4, 7, 8, 10, 12, 19]), Candidate: [ 1  2  1  0  0  1  2  0  0  2 -1  2  0  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0 -1  0  0  1  0  0 -1  0  0  0  0  1] (Indices: [0, 2, 3, 4, 7, 8, 12, 13, 14]), Candidate: [ 1  2  1  0  0  1  2  0  0  1  0  2  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0 -1  0  0  0  0  0  1 -1  1 -1  1  0] (Indices: [0, 2, 3, 4, 7, 8, 15, 17, 19]), Candidate: [1 2 1 0 0 1 2 0 0 1 0 1 1 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 33750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  1 -1  1 -1  1 -1  1 -1  0  0  0  1] (Indices: [0, 2, 3, 4, 7, 9, 11, 13, 15]), Candidate: [ 1  2  1  0  0  1  2 -1  2  0  1  0  2  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  1 -1  0  0  1 -1  0  1  0 -1  0  1] (Indices: [0, 2, 3, 4, 7, 9, 13, 16, 17]), Candidate: [ 1  2  1  0  0  1  2 -1  2  0  0  1  2  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  0  1  0 -1  0  0  0  1 -1  0  1  0] (Indices: [0, 2, 3, 4, 7, 10, 11, 16, 19]), Candidate: [ 1  2  1  0  0  1  2 -1  1  2  0  0  1  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  0  1 -1  0  0  0  1  0  0 -1  0  1] (Indices: [0, 2, 3, 4, 7, 10, 15, 16, 17]), Candidate: [ 1  2  1  0  0  1  2 -1  1  2 -1  1  1  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 33950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  0  0  1 -1  0  1 -1  1  0 -1  0  1] (Indices: [0, 2, 3, 4, 7, 11, 14, 16, 17]), Candidate: [ 1  2  1  0  0  1  2 -1  1  1  1  0  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  0  0  0  1 -1  0  0  0  1  0  0  0] (Indices: [0, 2, 3, 4, 7, 12, 17, 18, 19]), Candidate: [ 1  2  1  0  0  1  2 -1  1  1  0  2  0  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1  0  0 -1  1 -1  0  0  0  0  0  1  0] (Indices: [0, 2, 3, 4, 8, 9, 10, 12, 19]), Candidate: [ 1  2  1  0  0  1  1  1  1  1 -1  2  0  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1  0 -1  0  1  0  0 -1  0  0  0  0  1] (Indices: [0, 2, 3, 4, 8, 9, 12, 13, 14]), Candidate: [ 1  2  1  0  0  1  1  1  1  0  0  2  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1  0 -1  0  0  0  0  1 -1  1 -1  1  0] (Indices: [0, 2, 3, 4, 8, 9, 15, 17, 19]), Candidate: [1 2 1 0 0 1 1 1 1 0 0 1 1 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 34200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1 -1  1 -1  1 -1  0  0  1 -1  1 -1  1] (Indices: [0, 2, 3, 4, 8, 10, 12, 16, 18]), Candidate: [ 1  2  1  0  0  1  1  1  0  2 -1  2  0  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1 -1  0  1  0 -1  1 -1  0  0  0  1  0] (Indices: [0, 2, 3, 4, 8, 11, 12, 14, 19]), Candidate: [ 1  2  1  0  0  1  1  1  0  1  1  1  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1 -1  0  0  1  0  0 -1  0  0  0  1  0] (Indices: [0, 2, 3, 4, 8, 12, 13, 14, 19]), Candidate: [ 1  2  1  0  0  1  1  1  0  1  0  2  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1 -1  0  0  0  1 -1  0  0  1  0  0  0] (Indices: [0, 2, 3, 4, 8, 13, 17, 18, 19]), Candidate: [1 2 1 0 0 1 1 1 0 1 0 1 2 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 34400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  1  0 -1  1 -1  1  0 -1  0  0  0  1] (Indices: [0, 2, 3, 4, 9, 10, 12, 14, 15]), Candidate: [ 1  2  1  0  0  1  1  0  2  1 -1  2  0  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  1 -1  1  0  0  0 -1  0  0  0  0  1] (Indices: [0, 2, 3, 4, 9, 11, 12, 13, 14]), Candidate: [ 1  2  1  0  0  1  1  0  2  0  1  1  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  1 -1  1 -1  0  0  1 -1  1 -1  1  0] (Indices: [0, 2, 3, 4, 9, 11, 15, 17, 19]), Candidate: [1 2 1 0 0 1 1 0 2 0 1 0 1 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 34550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  1 -1  0  0  1  0 -1  0  0  1  0  0] (Indices: [0, 2, 3, 4, 9, 13, 14, 18, 19]), Candidate: [ 1  2  1  0  0  1  1  0  2  0  0  1  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  0  1  0 -1  1  0 -1  0  0  1 -1  1] (Indices: [0, 2, 3, 4, 10, 11, 13, 14, 18]), Candidate: [ 1  2  1  0  0  1  1  0  1  2  0  0  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  0  1 -1  1 -1  1  0 -1  0  0  1  0] (Indices: [0, 2, 3, 4, 10, 12, 14, 15, 19]), Candidate: [ 1  2  1  0  0  1  1  0  1  2 -1  2  0  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  0  1 -1  0  0  0  1 -1  1  0  0  0] (Indices: [0, 2, 3, 4, 10, 15, 17, 18, 19]), Candidate: [ 1  2  1  0  0  1  1  0  1  2 -1  1  1  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  0  0  1 -1  1 -1  1 -1  1  0 -1  1] (Indices: [0, 2, 3, 4, 11, 13, 15, 17, 18]), Candidate: [1 2 1 0 0 1 1 0 1 1 1 0 2 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 34800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  0  0  0  1 -1  1 -1  1 -1  1  0  0] (Indices: [0, 2, 3, 4, 12, 14, 16, 18, 19]), Candidate: [ 1  2  1  0  0  1  1  0  1  1  0  2  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0 -1  0  1 -1  0  0  1 -1  0  0  0  1] (Indices: [0, 2, 3, 5, 6, 7, 8, 11, 15]), Candidate: [ 1  2  1 -1  2  1  1  0  0  1  1  0  1  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  1 -1  0  1  0 -1  0  0  0  0  0  1] (Indices: [0, 2, 3, 5, 6, 7, 9, 12, 13]), Candidate: [ 1  2  1 -1  2  1  1 -1  2  0  0  2  1  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  0  1 -1  0  0  1 -1  1 -1  0  0  1] (Indices: [0, 2, 3, 5, 6, 7, 10, 14, 16]), Candidate: [ 1  2  1 -1  2  1  1 -1  1  2 -1  1  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 35000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  0  0  0  1 -1  1 -1  0  1 -1  0  1] (Indices: [0, 2, 3, 5, 6, 7, 12, 14, 17]), Candidate: [ 1  2  1 -1  2  1  1 -1  1  1  0  2  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 35050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1  0  0 -1  0  1 -1  0  0  0  0  0  1] (Indices: [0, 2, 3, 5, 6, 8, 9, 10, 13]), Candidate: [ 1  2  1 -1  2  1  0  1  1  1 -1  1  2  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1 -1  1  0 -1  0  0  0  0  0  0  1  0] (Indices: [0, 2, 3, 5, 6, 8, 10, 11, 19]), Candidate: [ 1  2  1 -1  2  1  0  1  0  2  0  0  1  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1 -1  0  1 -1  0  0  1 -1  0  0  1  0] (Indices: [0, 2, 3, 5, 6, 8, 11, 15, 19]), Candidate: [ 1  2  1 -1  2  1  0  1  0  1  1  0  1  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1 -1  0  0  0  0  1 -1  0  1  0 -1  1] (Indices: [0, 2, 3, 5, 6, 8, 14, 17, 18]), Candidate: [ 1  2  1 -1  2  1  0  1  0  1  0  1  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  1 -1  1  0 -1  1 -1  0  0  0  0  1] (Indices: [0, 2, 3, 5, 6, 9, 11, 12, 14]), Candidate: [ 1  2  1 -1  2  1  0  0  2  0  1  1  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  1 -1  0  0  1  0 -1  0  1 -1  0  1] (Indices: [0, 2, 3, 5, 6, 9, 13, 14, 17]), Candidate: [ 1  2  1 -1  2  1  0  0  2  0  0  1  2  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  0  1  0 -1  0  1 -1  0  0  0  1  0] (Indices: [0, 2, 3, 5, 6, 10, 11, 14, 19]), Candidate: [ 1  2  1 -1  2  1  0  0  1  2  0  0  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  0  1 -1  0  0  1  0 -1  0  0  1  0] (Indices: [0, 2, 3, 5, 6, 10, 14, 15, 19]), Candidate: [ 1  2  1 -1  2  1  0  0  1  2 -1  1  1  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  0  0  1 -1  1 -1  0  0  1  0 -1  1] (Indices: [0, 2, 3, 5, 6, 11, 13, 17, 18]), Candidate: [ 1  2  1 -1  2  1  0  0  1  1  1  0  2  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  0  0  0  1 -1  0  1  0 -1  0  1  0] (Indices: [0, 2, 3, 5, 6, 12, 15, 16, 19]), Candidate: [ 1  2  1 -1  2  1  0  0  1  1  0  2  0  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0  0  0 -1  0  0  0  0  0  0  1 -1  1] (Indices: [0, 2, 3, 5, 7, 8, 9, 10, 18]), Candidate: [ 1  2  1 -1  2  0  2  0  1  1 -1  1  1  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0 -1  1 -1  1 -1  0  0  0  1 -1  0  1] (Indices: [0, 2, 3, 5, 7, 8, 10, 12, 17]), Candidate: [ 1  2  1 -1  2  0  2  0  0  2 -1  2  0  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0 -1  0  1 -1  0  0  0  0  1 -1  1  0] (Indices: [0, 2, 3, 5, 7, 8, 11, 17, 19]), Candidate: [ 1  2  1 -1  2  0  2  0  0  1  1  0  1  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0 -1  0  0  0  0  0  1  0 -1  0  1  0] (Indices: [0, 2, 3, 5, 7, 8, 15, 16, 19]), Candidate: [ 1  2  1 -1  2  0  2  0  0  1  0  1  1  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  1 -1  1  0 -1  0  0  0  0  0  1  0] (Indices: [0, 2, 3, 5, 7, 9, 11, 12, 19]), Candidate: [ 1  2  1 -1  2  0  2 -1  2  0  1  1  0  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  1 -1  0  0  1 -1  1 -1  0  1 -1  1] (Indices: [0, 2, 3, 5, 7, 9, 13, 15, 18]), Candidate: [ 1  2  1 -1  2  0  2 -1  2  0  0  1  2  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  0  1  0 -1  0  0  0  1  0 -1  0  1] (Indices: [0, 2, 3, 5, 7, 10, 11, 16, 17]), Candidate: [ 1  2  1 -1  2  0  2 -1  1  2  0  0  1  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  0  1 -1  0  0  1 -1  0  1 -1  1  0] (Indices: [0, 2, 3, 5, 7, 10, 14, 17, 19]), Candidate: [ 1  2  1 -1  2  0  2 -1  1  2 -1  1  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 35950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  0  0  1 -1  0  1  0 -1  0  1 -1  1] (Indices: [0, 2, 3, 5, 7, 11, 14, 15, 18]), Candidate: [ 1  2  1 -1  2  0  2 -1  1  1  1  0  1  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  0  0  0  1 -1  0  0  1  0 -1  1  0] (Indices: [0, 2, 3, 5, 7, 12, 16, 17, 19]), Candidate: [ 1  2  1 -1  2  0  2 -1  1  1  0  2  0  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1  0  0 -1  1 -1  0  0  0  1 -1  0  1] (Indices: [0, 2, 3, 5, 8, 9, 10, 12, 17]), Candidate: [ 1  2  1 -1  2  0  1  1  1  1 -1  2  0  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1  0 -1  1 -1  0  0  0  0  1 -1  1  0] (Indices: [0, 2, 3, 5, 8, 9, 11, 17, 19]), Candidate: [ 1  2  1 -1  2  0  1  1  1  0  1  0  1  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1  0 -1  0  0  0  0  1  0 -1  0  1  0] (Indices: [0, 2, 3, 5, 8, 9, 15, 16, 19]), Candidate: [ 1  2  1 -1  2  0  1  1  1  0  0  1  1  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1 -1  1 -1  1 -1  0  1 -1  0  0  1  0] (Indices: [0, 2, 3, 5, 8, 10, 12, 15, 19]), Candidate: [ 1  2  1 -1  2  0  1  1  0  2 -1  2  0  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1 -1  0  1  0 -1  1 -1  0  1 -1  0  1] (Indices: [0, 2, 3, 5, 8, 11, 12, 14, 17]), Candidate: [ 1  2  1 -1  2  0  1  1  0  1  1  1  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1 -1  0  0  1  0  0 -1  0  1 -1  0  1] (Indices: [0, 2, 3, 5, 8, 12, 13, 14, 17]), Candidate: [ 1  2  1 -1  2  0  1  1  0  1  0  2  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1 -1  0  0  0  1 -1  0  1  0 -1  1  0] (Indices: [0, 2, 3, 5, 8, 13, 16, 17, 19]), Candidate: [ 1  2  1 -1  2  0  1  1  0  1  0  1  2  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  1  0 -1  1  0 -1  0  0  0  1 -1  1] (Indices: [0, 2, 3, 5, 9, 10, 12, 13, 18]), Candidate: [ 1  2  1 -1  2  0  1  0  2  1 -1  2  1  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  1  0 -1  0  0  0  0  1 -1  1  0  0] (Indices: [0, 2, 3, 5, 9, 10, 16, 18, 19]), Candidate: [ 1  2  1 -1  2  0  1  0  2  1 -1  1  1  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  1 -1  1 -1  0  0  1  0 -1  0  1  0] (Indices: [0, 2, 3, 5, 9, 11, 15, 16, 19]), Candidate: [ 1  2  1 -1  2  0  1  0  2  0  1  0  1  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  1 -1  0  0  1  0 -1  0  1  0 -1  1] (Indices: [0, 2, 3, 5, 9, 13, 14, 17, 18]), Candidate: [ 1  2  1 -1  2  0  1  0  2  0  0  1  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  0  1  0 -1  1  0 -1  1 -1  0  0  1] (Indices: [0, 2, 3, 5, 10, 11, 13, 14, 16]), Candidate: [ 1  2  1 -1  2  0  1  0  1  2  0  0  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  0  1 -1  1 -1  1  0 -1  1 -1  0  1] (Indices: [0, 2, 3, 5, 10, 12, 14, 15, 17]), Candidate: [ 1  2  1 -1  2  0  1  0  1  2 -1  2  0  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  0  1 -1  0  0  0  1  0  0 -1  1  0] (Indices: [0, 2, 3, 5, 10, 15, 16, 17, 19]), Candidate: [ 1  2  1 -1  2  0  1  0  1  2 -1  1  1  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  0  0  1 -1  1 -1  1  0 -1  1 -1  1] (Indices: [0, 2, 3, 5, 11, 13, 15, 16, 18]), Candidate: [ 1  2  1 -1  2  0  1  0  1  1  1  0  2  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  0  0  0  1 -1  1 -1  1  0  0 -1  1] (Indices: [0, 2, 3, 5, 12, 14, 16, 17, 18]), Candidate: [ 1  2  1 -1  2  0  1  0  1  1  0  2  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0  0 -1  0  1 -1  0  0  1 -1  0  0  1] (Indices: [0, 2, 3, 6, 7, 8, 9, 12, 16]), Candidate: [ 1  2  1 -1  1  2  1  0  1  0  0  2  0  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0 -1  1 -1  0  0  1 -1  0  0  0  1  0] (Indices: [0, 2, 3, 6, 7, 8, 10, 14, 19]), Candidate: [ 1  2  1 -1  1  2  1  0  0  2 -1  1  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 36950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0 -1  0  0  1 -1  0  1  0 -1  0  0  1] (Indices: [0, 2, 3, 6, 7, 8, 12, 15, 16]), Candidate: [ 1  2  1 -1  1  2  1  0  0  1  0  2  0  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  1  0  0 -1  0  0  0  0  1 -1  0  1] (Indices: [0, 2, 3, 6, 7, 9, 10, 11, 17]), Candidate: [ 1  2  1 -1  1  2  1 -1  2  1  0  0  1  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  1 -1  1 -1  0  0  1 -1  1 -1  0  1] (Indices: [0, 2, 3, 6, 7, 9, 11, 15, 17]), Candidate: [ 1  2  1 -1  1  2  1 -1  2  0  1  0  1  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  1 -1  0  0  0  1 -1  1 -1  1 -1  1] (Indices: [0, 2, 3, 6, 7, 9, 14, 16, 18]), Candidate: [ 1  2  1 -1  1  2  1 -1  2  0  0  1  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 37150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  0  1 -1  1 -1  1 -1  1 -1  0  0  1] (Indices: [0, 2, 3, 6, 7, 10, 12, 14, 16]), Candidate: [ 1  2  1 -1  1  2  1 -1  1  2 -1  2  0  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 37200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  0  0  1  0  0 -1  1 -1  0  0  0  1] (Indices: [0, 2, 3, 6, 7, 11, 12, 13, 15]), Candidate: [ 1  2  1 -1  1  2  1 -1  1  1  1  1  1  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  0  0  1 -1  0  0  1 -1  0  1  0  0] (Indices: [0, 2, 3, 6, 7, 11, 15, 18, 19]), Candidate: [ 1  2  1 -1  1  2  1 -1  1  1  1  0  1  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  0  0  0  0  1 -1  1  0  0 -1  0  1] (Indices: [0, 2, 3, 6, 7, 13, 15, 16, 17]), Candidate: [ 1  2  1 -1  1  2  1 -1  1  1  0  1  2  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1  0  0 -1  0  0  1 -1  0  0  0  1  0] (Indices: [0, 2, 3, 6, 8, 9, 10, 14, 19]), Candidate: [ 1  2  1 -1  1  2  0  1  1  1 -1  1  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 37400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1  0 -1  0  1 -1  0  1  0 -1  0  0  1] (Indices: [0, 2, 3, 6, 8, 9, 12, 15, 16]), Candidate: [ 1  2  1 -1  1  2  0  1  1  0  0  2  0  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1 -1  1  0  0 -1  0  0  0  0  1 -1  1] (Indices: [0, 2, 3, 6, 8, 10, 11, 12, 18]), Candidate: [ 1  2  1 -1  1  2  0  1  0  2  0  1  0  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1 -1  1 -1  0  1 -1  1 -1  1 -1  0  1] (Indices: [0, 2, 3, 6, 8, 10, 13, 15, 17]), Candidate: [ 1  2  1 -1  1  2  0  1  0  2 -1  1  2  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1 -1  0  1 -1  1  0  0 -1  0  0  0  1] (Indices: [0, 2, 3, 6, 8, 11, 13, 14, 15]), Candidate: [ 1  2  1 -1  1  2  0  1  0  1  1  0  2  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1 -1  0  0  1 -1  1  0  0 -1  0  0  1] (Indices: [0, 2, 3, 6, 8, 12, 14, 15, 16]), Candidate: [ 1  2  1 -1  1  2  0  1  0  1  0  2  0  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1 -1  0  0  0  0  0  1  0  0  0 -1  1] (Indices: [0, 2, 3, 6, 8, 15, 16, 17, 18]), Candidate: [ 1  2  1 -1  1  2  0  1  0  1  0  1  1  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  1  0 -1  1 -1  0  0  1 -1  0  1  0] (Indices: [0, 2, 3, 6, 9, 10, 12, 16, 19]), Candidate: [ 1  2  1 -1  1  2  0  0  2  1 -1  2  0  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  1 -1  1  0 -1  0  1  0 -1  0  0  1] (Indices: [0, 2, 3, 6, 9, 11, 12, 15, 16]), Candidate: [ 1  2  1 -1  1  2  0  0  2  0  1  1  0  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  1 -1  0  1  0 -1  1  0 -1  0  0  1] (Indices: [0, 2, 3, 6, 9, 12, 13, 15, 16]), Candidate: [ 1  2  1 -1  1  2  0  0  2  0  0  2  1  0  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  1 -1  0  0  0  1  0  0  0 -1  0  1] (Indices: [0, 2, 3, 6, 9, 14, 15, 16, 17]), Candidate: [ 1  2  1 -1  1  2  0  0  2  0  0  1  1  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  0  1  0 -1  1 -1  0  0  0  1  0  0] (Indices: [0, 2, 3, 6, 10, 11, 13, 18, 19]), Candidate: [ 1  2  1 -1  1  2  0  0  1  2  0  0  2  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  0  1 -1  1 -1  0  1 -1  1 -1  1  0] (Indices: [0, 2, 3, 6, 10, 12, 15, 17, 19]), Candidate: [ 1  2  1 -1  1  2  0  0  1  2 -1  2  0  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  0  0  1  0  0 -1  0  1  0 -1  0  1] (Indices: [0, 2, 3, 6, 11, 12, 13, 16, 17]), Candidate: [ 1  2  1 -1  1  2  0  0  1  1  1  1  1  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  0  0  1 -1  0  1  0 -1  1 -1  1  0] (Indices: [0, 2, 3, 6, 11, 14, 15, 17, 19]), Candidate: [ 1  2  1 -1  1  2  0  0  1  1  1  0  1  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  0  0  0  0  1  0  0 -1  1 -1  1  0] (Indices: [0, 2, 3, 6, 13, 14, 15, 17, 19]), Candidate: [ 1  2  1 -1  1  2  0  0  1  1  0  1  2  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0  0  0 -1  0  0  0  0  0  1  0 -1  1] (Indices: [0, 2, 3, 7, 8, 9, 10, 17, 18]), Candidate: [ 1  2  1 -1  1  1  2  0  1  1 -1  1  1  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0  0 -1  0  1 -1  0  0  0  1 -1  1  0] (Indices: [0, 2, 3, 7, 8, 9, 12, 17, 19]), Candidate: [ 1  2  1 -1  1  1  2  0  1  0  0  2  0  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0 -1  1  0 -1  0  1  0 -1  0  0  0  1] (Indices: [0, 2, 3, 7, 8, 10, 11, 14, 15]), Candidate: [ 1  2  1 -1  1  1  2  0  0  2  0  0  1  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0 -1  1 -1  0  1 -1  0  0  0  1  0  0] (Indices: [0, 2, 3, 7, 8, 10, 13, 18, 19]), Candidate: [ 1  2  1 -1  1  1  2  0  0  2 -1  1  2  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0 -1  0  1 -1  1 -1  1 -1  0  0  1  0] (Indices: [0, 2, 3, 7, 8, 11, 13, 15, 19]), Candidate: [ 1  2  1 -1  1  1  2  0  0  1  1  0  2  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0 -1  0  0  1 -1  1 -1  0  1 -1  1  0] (Indices: [0, 2, 3, 7, 8, 12, 14, 17, 19]), Candidate: [ 1  2  1 -1  1  1  2  0  0  1  0  2  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  1  0  0  0 -1  0  0  1 -1  0  0  1] (Indices: [0, 2, 3, 7, 9, 10, 11, 12, 16]), Candidate: [ 1  2  1 -1  1  1  2 -1  2  1  0  1  0  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  1  0 -1  0  1  0 -1  0  0  0  1  0] (Indices: [0, 2, 3, 7, 9, 10, 13, 14, 19]), Candidate: [ 1  2  1 -1  1  1  2 -1  2  1 -1  1  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 38550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  1 -1  1  0 -1  0  0  0  1 -1  1  0] (Indices: [0, 2, 3, 7, 9, 11, 12, 17, 19]), Candidate: [ 1  2  1 -1  1  1  2 -1  2  0  1  1  0  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  1 -1  0  1  0 -1  0  0  1 -1  1  0] (Indices: [0, 2, 3, 7, 9, 12, 13, 17, 19]), Candidate: [ 1  2  1 -1  1  1  2 -1  2  0  0  2  1  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  1 -1  0  0  0  1 -1  1 -1  1  0  0] (Indices: [0, 2, 3, 7, 9, 14, 16, 18, 19]), Candidate: [ 1  2  1 -1  1  1  2 -1  2  0  0  1  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 38700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  0  1  0 -1  0  1 -1  0  1  0 -1  1] (Indices: [0, 2, 3, 7, 10, 11, 14, 17, 18]), Candidate: [ 1  2  1 -1  1  1  2 -1  1  2  0  0  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 38750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  0  1 -1  0  1  0  0 -1  0  1 -1  1] (Indices: [0, 2, 3, 7, 10, 13, 14, 15, 18]), Candidate: [ 1  2  1 -1  1  1  2 -1  1  2 -1  1  2  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 38800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  0  0  1  0 -1  1  0 -1  0  1 -1  1] (Indices: [0, 2, 3, 7, 11, 12, 14, 15, 18]), Candidate: [ 1  2  1 -1  1  1  2 -1  1  1  1  1  0  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  0  0  1 -1  0  0  1  0 -1  1  0  0] (Indices: [0, 2, 3, 7, 11, 15, 16, 18, 19]), Candidate: [ 1  2  1 -1  1  1  2 -1  1  1  1  0  1  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  0  0  0  0  1 -1  1  0 -1  1  0  0] (Indices: [0, 2, 3, 7, 13, 15, 16, 18, 19]), Candidate: [ 1  2  1 -1  1  1  2 -1  1  1  0  1  2  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1  0  0 -1  1 -1  0  1 -1  0  1 -1  1] (Indices: [0, 2, 3, 8, 9, 10, 12, 15, 18]), Candidate: [ 1  2  1 -1  1  1  1  1  1  1 -1  2  0  1  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1  0 -1  1  0 -1  1 -1  1 -1  0  0  1] (Indices: [0, 2, 3, 8, 9, 11, 12, 14, 16]), Candidate: [ 1  2  1 -1  1  1  1  1  1  0  1  1  0  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1  0 -1  0  1  0  0 -1  1 -1  0  0  1] (Indices: [0, 2, 3, 8, 9, 12, 13, 14, 16]), Candidate: [ 1  2  1 -1  1  1  1  1  1  0  0  2  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1  0 -1  0  0  1 -1  0  1  0  0 -1  1] (Indices: [0, 2, 3, 8, 9, 13, 16, 17, 18]), Candidate: [ 1  2  1 -1  1  1  1  1  1  0  0  1  2  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1 -1  1  0 -1  1 -1  0  1 -1  1 -1  1] (Indices: [0, 2, 3, 8, 10, 11, 13, 16, 18]), Candidate: [ 1  2  1 -1  1  1  1  1  0  2  0  0  2  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1 -1  1 -1  1 -1  0  1  0  0 -1  0  1] (Indices: [0, 2, 3, 8, 10, 12, 15, 16, 17]), Candidate: [ 1  2  1 -1  1  1  1  1  0  2 -1  2  0  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1 -1  0  1  0  0 -1  1  0 -1  0  0  1] (Indices: [0, 2, 3, 8, 11, 12, 13, 15, 16]), Candidate: [ 1  2  1 -1  1  1  1  1  0  1  1  1  1  0  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1 -1  0  1 -1  0  1  0  0  0 -1  0  1] (Indices: [0, 2, 3, 8, 11, 14, 15, 16, 17]), Candidate: [ 1  2  1 -1  1  1  1  1  0  1  1  0  1  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1 -1  0  0  0  1  0  0  0  0 -1  0  1] (Indices: [0, 2, 3, 8, 13, 14, 15, 16, 17]), Candidate: [ 1  2  1 -1  1  1  1  1  0  1  0  1  2  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  1  0  0 -1  1 -1  1 -1  0  0  1  0] (Indices: [0, 2, 3, 9, 10, 11, 13, 15, 19]), Candidate: [ 1  2  1 -1  1  1  1  0  2  1  0  0  2  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  1  0 -1  1 -1  1 -1  0  1 -1  1  0] (Indices: [0, 2, 3, 9, 10, 12, 14, 17, 19]), Candidate: [ 1  2  1 -1  1  1  1  0  2  1 -1  2  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 39500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  1 -1  1  0  0  0 -1  0  0  1 -1  1] (Indices: [0, 2, 3, 9, 11, 12, 13, 14, 18]), Candidate: [ 1  2  1 -1  1  1  1  0  2  0  1  1  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  1 -1  1 -1  1 -1  0  1 -1  1  0  0] (Indices: [0, 2, 3, 9, 11, 13, 16, 18, 19]), Candidate: [ 1  2  1 -1  1  1  1  0  2  0  1  0  2  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  1 -1  0  1 -1  0  1 -1  1  0  0  0] (Indices: [0, 2, 3, 9, 12, 15, 17, 18, 19]), Candidate: [ 1  2  1 -1  1  1  1  0  2  0  0  2  0  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  0  1  0  0 -1  0  1  0 -1  0  1  0] (Indices: [0, 2, 3, 10, 11, 12, 15, 16, 19]), Candidate: [ 1  2  1 -1  1  1  1  0  1  2  0  1  0  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  0  1 -1  1  0  0 -1  0  1  0 -1  1] (Indices: [0, 2, 3, 10, 12, 13, 14, 17, 18]), Candidate: [ 1  2  1 -1  1  1  1  0  1  2 -1  2  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 39750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  0  0  1  0  0  0  0 -1  1 -1  0  1] (Indices: [0, 2, 3, 11, 12, 13, 14, 15, 17]), Candidate: [ 1  2  1 -1  1  1  1  0  1  1  1  1  1  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  0  0  1 -1  0  1  0  0  0 -1  1  0] (Indices: [0, 2, 3, 11, 14, 15, 16, 17, 19]), Candidate: [ 1  2  1 -1  1  1  1  0  1  1  1  0  1  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0 -1  1 -1  0  0  0  0  0  0  1 -1  1] (Indices: [0, 2, 4, 5, 6, 7, 8, 10, 18]), Candidate: [ 1  2  0  1  1  1  1  0  0  2 -1  1  1  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  1 -1  1 -1  0  0  1 -1  0  0  0  1] (Indices: [0, 2, 4, 5, 6, 7, 9, 11, 15]), Candidate: [ 1  2  0  1  1  1  1 -1  2  0  1  0  1  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  0  1 -1  0  1 -1  0  1 -1  0  0  1] (Indices: [0, 2, 4, 5, 6, 7, 10, 13, 16]), Candidate: [ 1  2  0  1  1  1  1 -1  1  2 -1  1  2  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 40000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  0  0  0  1  0 -1  0  0  1 -1  0  1] (Indices: [0, 2, 4, 5, 6, 7, 12, 13, 17]), Candidate: [ 1  2  0  1  1  1  1 -1  1  1  0  2  1  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  0  0  0  0  0  0  0  1  0 -1  1  0] (Indices: [0, 2, 4, 5, 6, 7, 16, 17, 19]), Candidate: [ 1  2  0  1  1  1  1 -1  1  1  0  1  1  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1 -1  1  0 -1  0  1 -1  0  0  0  0  1] (Indices: [0, 2, 4, 5, 6, 8, 10, 11, 14]), Candidate: [ 1  2  0  1  1  1  0  1  0  2  0  0  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1 -1  0  1 -1  0  1 -1  0  0  1 -1  1] (Indices: [0, 2, 4, 5, 6, 8, 11, 14, 18]), Candidate: [ 1  2  0  1  1  1  0  1  0  1  1  0  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1 -1  0  0  0  0  1  0 -1  0  1 -1  1] (Indices: [0, 2, 4, 5, 6, 8, 14, 15, 18]), Candidate: [1 2 0 1 1 1 0 1 0 1 0 1 1 2 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 40250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  1  0 -1  0  0  0  0  1 -1  0  1  0] (Indices: [0, 2, 4, 5, 6, 9, 10, 16, 19]), Candidate: [ 1  2  0  1  1  1  0  0  2  1 -1  1  1  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  1 -1  0  1 -1  0  0  0  1  0 -1  1] (Indices: [0, 2, 4, 5, 6, 9, 12, 17, 18]), Candidate: [1 2 0 1 1 1 0 0 2 0 0 2 0 1 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 40350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  0  1  0 -1  1 -1  0  0  0  0  1  0] (Indices: [0, 2, 4, 5, 6, 10, 11, 13, 19]), Candidate: [1 2 0 1 1 1 0 0 1 2 0 0 2 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 40400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  0  1 -1  0  1 -1  0  0  1 -1  1  0] (Indices: [0, 2, 4, 5, 6, 10, 13, 17, 19]), Candidate: [ 1  2  0  1  1  1  0  0  1  2 -1  1  2  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  0  0  1 -1  1 -1  1 -1  0  1 -1  1] (Indices: [0, 2, 4, 5, 6, 11, 13, 15, 18]), Candidate: [1 2 0 1 1 1 0 0 1 1 1 0 2 0 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 40500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  0  0  0  1 -1  1 -1  0  1  0 -1  1] (Indices: [0, 2, 4, 5, 6, 12, 14, 17, 18]), Candidate: [ 1  2  0  1  1  1  0  0  1  1  0  2  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0  0  0 -1  0  1 -1  0  0  0  0  0  1] (Indices: [0, 2, 4, 5, 7, 8, 9, 10, 13]), Candidate: [ 1  2  0  1  1  0  2  0  1  1 -1  1  2  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0 -1  1  0 -1  0  0  0  0  0  0  1  0] (Indices: [0, 2, 4, 5, 7, 8, 10, 11, 19]), Candidate: [1 2 0 1 1 0 2 0 0 2 0 0 1 1 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 40650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0 -1  0  1 -1  0  0  1 -1  0  0  1  0] (Indices: [0, 2, 4, 5, 7, 8, 11, 15, 19]), Candidate: [1 2 0 1 1 0 2 0 0 1 1 0 1 1 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 40700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0 -1  0  0  0  0  1 -1  0  1  0 -1  1] (Indices: [0, 2, 4, 5, 7, 8, 14, 17, 18]), Candidate: [ 1  2  0  1  1  0  2  0  0  1  0  1  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  1 -1  1  0 -1  1 -1  0  0  0  0  1] (Indices: [0, 2, 4, 5, 7, 9, 11, 12, 14]), Candidate: [ 1  2  0  1  1  0  2 -1  2  0  1  1  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 40800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  1 -1  0  0  1  0 -1  0  1 -1  0  1] (Indices: [0, 2, 4, 5, 7, 9, 13, 14, 17]), Candidate: [ 1  2  0  1  1  0  2 -1  2  0  0  1  2  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 40850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  0  1  0 -1  0  1 -1  0  0  0  1  0] (Indices: [0, 2, 4, 5, 7, 10, 11, 14, 19]), Candidate: [ 1  2  0  1  1  0  2 -1  1  2  0  0  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 40900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  0  1 -1  0  0  1  0 -1  0  0  1  0] (Indices: [0, 2, 4, 5, 7, 10, 14, 15, 19]), Candidate: [ 1  2  0  1  1  0  2 -1  1  2 -1  1  1  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 40950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  0  0  1 -1  1 -1  0  0  1  0 -1  1] (Indices: [0, 2, 4, 5, 7, 11, 13, 17, 18]), Candidate: [ 1  2  0  1  1  0  2 -1  1  1  1  0  2  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  0  0  0  1 -1  0  1  0 -1  0  1  0] (Indices: [0, 2, 4, 5, 7, 12, 15, 16, 19]), Candidate: [ 1  2  0  1  1  0  2 -1  1  1  0  2  0  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1  0  0  0 -1  0  0  0  0  0  0  1  0] (Indices: [0, 2, 4, 5, 8, 9, 10, 11, 19]), Candidate: [1 2 0 1 1 0 1 1 1 1 0 0 1 1 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 41100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1  0 -1  1 -1  0  0  1 -1  0  0  1  0] (Indices: [0, 2, 4, 5, 8, 9, 11, 15, 19]), Candidate: [1 2 0 1 1 0 1 1 1 0 1 0 1 1 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 41150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1  0 -1  0  0  0  1 -1  0  1  0 -1  1] (Indices: [0, 2, 4, 5, 8, 9, 14, 17, 18]), Candidate: [ 1  2  0  1  1  0  1  1  1  0  0  1  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1 -1  1 -1  1 -1  1 -1  0  0  1 -1  1] (Indices: [0, 2, 4, 5, 8, 10, 12, 14, 18]), Candidate: [ 1  2  0  1  1  0  1  1  0  2 -1  2  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 41250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1 -1  0  1  0  0 -1  0  0  1 -1  0  1] (Indices: [0, 2, 4, 5, 8, 11, 12, 13, 17]), Candidate: [1 2 0 1 1 0 1 1 0 1 1 1 1 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 41300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1 -1  0  1 -1  0  0  0  1  0 -1  1  0] (Indices: [0, 2, 4, 5, 8, 11, 16, 17, 19]), Candidate: [1 2 0 1 1 0 1 1 0 1 1 0 1 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 41350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1 -1  0  0  0  1 -1  1  0 -1  0  1  0] (Indices: [0, 2, 4, 5, 8, 13, 15, 16, 19]), Candidate: [1 2 0 1 1 0 1 1 0 1 0 1 2 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 41400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  1  0  0 -1  0  0  0  0  0  1  0  0] (Indices: [0, 2, 4, 5, 9, 10, 11, 18, 19]), Candidate: [1 2 0 1 1 0 1 0 2 1 0 0 1 1 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 41450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  1  0 -1  0  0  0  1 -1  1  0 -1  1] (Indices: [0, 2, 4, 5, 9, 10, 15, 17, 18]), Candidate: [ 1  2  0  1  1  0  1  0  2  1 -1  1  1  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  1 -1  1 -1  0  1 -1  0  1  0 -1  1] (Indices: [0, 2, 4, 5, 9, 11, 14, 17, 18]), Candidate: [ 1  2  0  1  1  0  1  0  2  0  1  0  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  1 -1  0  0  1  0  0 -1  0  1 -1  1] (Indices: [0, 2, 4, 5, 9, 13, 14, 15, 18]), Candidate: [1 2 0 1 1 0 1 0 2 0 0 1 2 1 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 41600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  0  1  0  0 -1  0  0  1 -1  0  1  0] (Indices: [0, 2, 4, 5, 10, 11, 12, 16, 19]), Candidate: [1 2 0 1 1 0 1 0 1 2 0 1 0 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 41650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  0  1 -1  1  0 -1  0  1 -1  0  1  0] (Indices: [0, 2, 4, 5, 10, 12, 13, 16, 19]), Candidate: [ 1  2  0  1  1  0  1  0  1  2 -1  2  1  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  0  1 -1  0  0  1 -1  1  0  0 -1  1] (Indices: [0, 2, 4, 5, 10, 14, 16, 17, 18]), Candidate: [ 1  2  0  1  1  0  1  0  1  2 -1  1  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 41750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  0  0  1 -1  1  0 -1  1 -1  0  1  0] (Indices: [0, 2, 4, 5, 11, 13, 14, 16, 19]), Candidate: [ 1  2  0  1  1  0  1  0  1  1  1  0  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  0  0  0  1 -1  1  0  0 -1  1 -1  1] (Indices: [0, 2, 4, 5, 12, 14, 15, 16, 18]), Candidate: [1 2 0 1 1 0 1 0 1 1 0 2 0 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 41850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0  0 -1  1 -1  0  0  0  0  0  1 -1  1] (Indices: [0, 2, 4, 6, 7, 8, 9, 11, 18]), Candidate: [1 2 0 1 0 2 1 0 1 0 1 0 1 1 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 41900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0 -1  1 -1  0  1 -1  0  0  0  0  1  0] (Indices: [0, 2, 4, 6, 7, 8, 10, 13, 19]), Candidate: [ 1  2  0  1  0  2  1  0  0  2 -1  1  2  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0 -1  0  0  1 -1  1  0 -1  0  0  0  1] (Indices: [0, 2, 4, 6, 7, 8, 12, 14, 15]), Candidate: [1 2 0 1 0 2 1 0 0 1 0 2 0 2 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 42000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  1  0  0  0 -1  0  0  0  0  0  0  1] (Indices: [0, 2, 4, 6, 7, 9, 10, 11, 12]), Candidate: [ 1  2  0  1  0  2  1 -1  2  1  0  1  0  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  1 -1  1 -1  0  1 -1  1 -1  0  0  1] (Indices: [0, 2, 4, 6, 7, 9, 11, 14, 16]), Candidate: [ 1  2  0  1  0  2  1 -1  2  0  1  0  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 42100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  1 -1  0  0  0  1  0  0 -1  0  0  1] (Indices: [0, 2, 4, 6, 7, 9, 14, 15, 16]), Candidate: [ 1  2  0  1  0  2  1 -1  2  0  0  1  1  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  0  1 -1  1  0 -1  0  1 -1  0  0  1] (Indices: [0, 2, 4, 6, 7, 10, 12, 13, 16]), Candidate: [ 1  2  0  1  0  2  1 -1  1  2 -1  2  1  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 42200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  0  1 -1  0  0  0  0  1  0  0 -1  1] (Indices: [0, 2, 4, 6, 7, 10, 16, 17, 18]), Candidate: [ 1  2  0  1  0  2  1 -1  1  2 -1  1  1  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 42250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  0  0  1 -1  0  0  1  0  0 -1  0  1] (Indices: [0, 2, 4, 6, 7, 11, 15, 16, 17]), Candidate: [ 1  2  0  1  0  2  1 -1  1  1  1  0  1  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  0  0  0  0  1  0 -1  1 -1  1 -1  1] (Indices: [0, 2, 4, 6, 7, 13, 14, 16, 18]), Candidate: [ 1  2  0  1  0  2  1 -1  1  1  0  1  2  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 42350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1  0  0 -1  0  1 -1  0  0  0  0  1  0] (Indices: [0, 2, 4, 6, 8, 9, 10, 13, 19]), Candidate: [ 1  2  0  1  0  2  0  1  1  1 -1  1  2  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1  0 -1  0  1 -1  1  0 -1  0  0  0  1] (Indices: [0, 2, 4, 6, 8, 9, 12, 14, 15]), Candidate: [1 2 0 1 0 2 0 1 1 0 0 2 0 2 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 42450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1 -1  1  0  0  0 -1  0  0  0  0  0  1] (Indices: [0, 2, 4, 6, 8, 10, 11, 12, 13]), Candidate: [1 2 0 1 0 2 0 1 0 2 0 1 1 0 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 42500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1 -1  1 -1  0  1  0 -1  1 -1  0  0  1] (Indices: [0, 2, 4, 6, 8, 10, 13, 14, 16]), Candidate: [ 1  2  0  1  0  2  0  1  0  2 -1  1  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 42550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1 -1  0  1  0 -1  0  0  1 -1  1 -1  1] (Indices: [0, 2, 4, 6, 8, 11, 12, 16, 18]), Candidate: [1 2 0 1 0 2 0 1 0 1 1 1 0 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 42600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1 -1  0  0  1  0 -1  0  1 -1  1 -1  1] (Indices: [0, 2, 4, 6, 8, 12, 13, 16, 18]), Candidate: [1 2 0 1 0 2 0 1 0 1 0 2 1 0 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 42650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1 -1  0  0  0  0  1  0 -1  0  1  0  0] (Indices: [0, 2, 4, 6, 8, 14, 15, 18, 19]), Candidate: [1 2 0 1 0 2 0 1 0 1 0 1 1 2 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 42700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  1  0 -1  1 -1  0  1 -1  1 -1  0  1] (Indices: [0, 2, 4, 6, 9, 10, 12, 15, 17]), Candidate: [ 1  2  0  1  0  2  0  0  2  1 -1  2  0  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  1 -1  1  0 -1  1  0 -1  0  0  0  1] (Indices: [0, 2, 4, 6, 9, 11, 12, 14, 15]), Candidate: [1 2 0 1 0 2 0 0 2 0 1 1 0 2 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 42800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  1 -1  0  1  0  0  0 -1  0  0  0  1] (Indices: [0, 2, 4, 6, 9, 12, 13, 14, 15]), Candidate: [1 2 0 1 0 2 0 0 2 0 0 2 1 1 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 42850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  1 -1  0  0  1 -1  1 -1  0  1  0  0] (Indices: [0, 2, 4, 6, 9, 13, 15, 18, 19]), Candidate: [1 2 0 1 0 2 0 0 2 0 0 1 2 0 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 42900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  0  1  0 -1  1 -1  0  1  0 -1  0  1] (Indices: [0, 2, 4, 6, 10, 11, 13, 16, 17]), Candidate: [1 2 0 1 0 2 0 0 1 2 0 0 2 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 42950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  0  1 -1  1 -1  1 -1  0  0  1  0  0] (Indices: [0, 2, 4, 6, 10, 12, 14, 18, 19]), Candidate: [ 1  2  0  1  0  2  0  0  1  2 -1  2  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 43000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  0  0  1  0  0  0 -1  0  0  0  1  0] (Indices: [0, 2, 4, 6, 11, 12, 13, 14, 19]), Candidate: [ 1  2  0  1  0  2  0  0  1  1  1  1  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  0  0  1 -1  1 -1  0  0  1  0  0  0] (Indices: [0, 2, 4, 6, 11, 13, 17, 18, 19]), Candidate: [1 2 0 1 0 2 0 0 1 1 1 0 2 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 43100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  0  0  0  1 -1  0  0  1  0  0  0  0] (Indices: [0, 2, 4, 6, 12, 16, 17, 18, 19]), Candidate: [1 2 0 1 0 2 0 0 1 1 0 2 0 1 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 43150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0  0  0 -1  0  0  0  1 -1  0  1 -1  1] (Indices: [0, 2, 4, 7, 8, 9, 10, 15, 18]), Candidate: [ 1  2  0  1  0  1  2  0  1  1 -1  1  1  1  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0  0 -1  0  1 -1  0  1 -1  0  0  1  0] (Indices: [0, 2, 4, 7, 8, 9, 12, 15, 19]), Candidate: [1 2 0 1 0 1 2 0 1 0 0 2 0 1 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 43250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0 -1  1  0 -1  1 -1  1 -1  0  0  0  1] (Indices: [0, 2, 4, 7, 8, 10, 11, 13, 15]), Candidate: [1 2 0 1 0 1 2 0 0 2 0 0 2 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 43300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0 -1  1 -1  0  1 -1  0  1  0 -1  0  1] (Indices: [0, 2, 4, 7, 8, 10, 13, 16, 17]), Candidate: [ 1  2  0  1  0  1  2  0  0  2 -1  1  2  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0 -1  0  1 -1  1  0 -1  0  0  1 -1  1] (Indices: [0, 2, 4, 7, 8, 11, 13, 14, 18]), Candidate: [ 1  2  0  1  0  1  2  0  0  1  1  0  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0 -1  0  0  1 -1  1  0 -1  0  0  1  0] (Indices: [0, 2, 4, 7, 8, 12, 14, 15, 19]), Candidate: [1 2 0 1 0 1 2 0 0 1 0 2 0 2 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 43450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0 -1  0  0  0  0  0  1 -1  1  0  0  0] (Indices: [0, 2, 4, 7, 8, 15, 17, 18, 19]), Candidate: [1 2 0 1 0 1 2 0 0 1 0 1 1 1 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 43500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  1  0 -1  1 -1  0  0  0  0  1  0  0] (Indices: [0, 2, 4, 7, 9, 10, 12, 18, 19]), Candidate: [ 1  2  0  1  0  1  2 -1  2  1 -1  2  0  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 43550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  1 -1  1  0 -1  0  1 -1  0  0  1  0] (Indices: [0, 2, 4, 7, 9, 11, 12, 15, 19]), Candidate: [ 1  2  0  1  0  1  2 -1  2  0  1  1  0  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  1 -1  0  1  0 -1  1 -1  0  0  1  0] (Indices: [0, 2, 4, 7, 9, 12, 13, 15, 19]), Candidate: [ 1  2  0  1  0  1  2 -1  2  0  0  2  1  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  1 -1  0  0  0  1  0 -1  1  0 -1  1] (Indices: [0, 2, 4, 7, 9, 14, 15, 17, 18]), Candidate: [ 1  2  0  1  0  1  2 -1  2  0  0  1  1  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  0  1  0 -1  0  1  0 -1  0  1 -1  1] (Indices: [0, 2, 4, 7, 10, 11, 14, 15, 18]), Candidate: [ 1  2  0  1  0  1  2 -1  1  2  0  0  1  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  0  1 -1  1 -1  0  0  1  0 -1  1  0] (Indices: [0, 2, 4, 7, 10, 12, 16, 17, 19]), Candidate: [ 1  2  0  1  0  1  2 -1  1  2 -1  2  0  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 43800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  0  0  1  0  0 -1  0  0  1  0 -1  1] (Indices: [0, 2, 4, 7, 11, 12, 13, 17, 18]), Candidate: [ 1  2  0  1  0  1  2 -1  1  1  1  1  1  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  0  0  1 -1  0  1 -1  1  0 -1  1  0] (Indices: [0, 2, 4, 7, 11, 14, 16, 17, 19]), Candidate: [ 1  2  0  1  0  1  2 -1  1  1  1  0  1  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 43900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  0  0  0  0  1  0 -1  1  0 -1  1  0] (Indices: [0, 2, 4, 7, 13, 14, 16, 17, 19]), Candidate: [ 1  2  0  1  0  1  2 -1  1  1  0  1  2  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 43950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1  0  0 -1  1 -1  1 -1  0  1 -1  0  1] (Indices: [0, 2, 4, 8, 9, 10, 12, 14, 17]), Candidate: [ 1  2  0  1  0  1  1  1  1  1 -1  2  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 44000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1  0 -1  1  0  0 -1  0  1 -1  0  0  1] (Indices: [0, 2, 4, 8, 9, 11, 12, 13, 16]), Candidate: [1 2 0 1 0 1 1 1 1 0 1 1 1 0 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 44050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1  0 -1  1 -1  0  0  0  1  0  0 -1  1] (Indices: [0, 2, 4, 8, 9, 11, 16, 17, 18]), Candidate: [1 2 0 1 0 1 1 1 1 0 1 0 1 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 44100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1  0 -1  0  0  1 -1  1  0 -1  1 -1  1] (Indices: [0, 2, 4, 8, 9, 13, 15, 16, 18]), Candidate: [1 2 0 1 0 1 1 1 1 0 0 1 2 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 44150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1 -1  1  0 -1  1 -1  1  0 -1  0  0  1] (Indices: [0, 2, 4, 8, 10, 11, 13, 15, 16]), Candidate: [1 2 0 1 0 1 1 1 0 2 0 0 2 0 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 44200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1 -1  1 -1  1 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 2, 4, 8, 10, 12, 14, 16, 18]), Candidate: [ 1  2  0  1  0  1  1  1  0  2 -1  2  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 44250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1 -1  0  1  0  0  0  0 -1  0  0  0  1] (Indices: [0, 2, 4, 8, 11, 12, 13, 14, 15]), Candidate: [1 2 0 1 0 1 1 1 0 1 1 1 1 1 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 44300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1 -1  0  1 -1  1 -1  1 -1  0  1  0  0] (Indices: [0, 2, 4, 8, 11, 13, 15, 18, 19]), Candidate: [1 2 0 1 0 1 1 1 0 1 1 0 2 0 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 44350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1 -1  0  0  1 -1  0  1  0  0  0 -1  1] (Indices: [0, 2, 4, 8, 12, 15, 16, 17, 18]), Candidate: [1 2 0 1 0 1 1 1 0 1 0 2 0 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 44400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  1  0  0 -1  1  0 -1  0  0  1 -1  1] (Indices: [0, 2, 4, 9, 10, 11, 13, 14, 18]), Candidate: [ 1  2  0  1  0  1  1  0  2  1  0  0  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  1  0 -1  1 -1  1  0 -1  0  0  1  0] (Indices: [0, 2, 4, 9, 10, 12, 14, 15, 19]), Candidate: [ 1  2  0  1  0  1  1  0  2  1 -1  2  0  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  1  0 -1  0  0  0  1 -1  1  0  0  0] (Indices: [0, 2, 4, 9, 10, 15, 17, 18, 19]), Candidate: [ 1  2  0  1  0  1  1  0  2  1 -1  1  1  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  1 -1  1 -1  1 -1  1 -1  1  0 -1  1] (Indices: [0, 2, 4, 9, 11, 13, 15, 17, 18]), Candidate: [1 2 0 1 0 1 1 0 2 0 1 0 2 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 44600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  1 -1  0  1 -1  1 -1  1 -1  1  0  0] (Indices: [0, 2, 4, 9, 12, 14, 16, 18, 19]), Candidate: [ 1  2  0  1  0  1  1  0  2  0  0  2  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  0  1  0  0 -1  1 -1  0  1  0 -1  1] (Indices: [0, 2, 4, 10, 11, 12, 14, 17, 18]), Candidate: [ 1  2  0  1  0  1  1  0  1  2  0  1  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  0  1 -1  1  0  0  0 -1  0  1 -1  1] (Indices: [0, 2, 4, 10, 12, 13, 14, 15, 18]), Candidate: [ 1  2  0  1  0  1  1  0  1  2 -1  2  1  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  0  1 -1  0  0  1  0  0 -1  1  0  0] (Indices: [0, 2, 4, 10, 14, 15, 16, 18, 19]), Candidate: [ 1  2  0  1  0  1  1  0  1  2 -1  1  1  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  0  0  1 -1  1 -1  1  0  0 -1  1  0] (Indices: [0, 2, 4, 11, 13, 15, 16, 17, 19]), Candidate: [1 2 0 1 0 1 1 0 1 1 1 0 2 0 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 44850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0  0 -1  1 -1  0  0  1 -1  0  0  0  1] (Indices: [0, 2, 5, 6, 7, 8, 9, 11, 15]), Candidate: [1 2 0 0 2 1 1 0 1 0 1 0 1 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 44900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0 -1  1 -1  0  1 -1  0  1 -1  0  0  1] (Indices: [0, 2, 5, 6, 7, 8, 10, 13, 16]), Candidate: [ 1  2  0  0  2  1  1  0  0  2 -1  1  2  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0 -1  0  0  1  0 -1  0  0  1 -1  0  1] (Indices: [0, 2, 5, 6, 7, 8, 12, 13, 17]), Candidate: [1 2 0 0 2 1 1 0 0 1 0 2 1 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 45000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0 -1  0  0  0  0  0  0  1  0 -1  1  0] (Indices: [0, 2, 5, 6, 7, 8, 16, 17, 19]), Candidate: [1 2 0 0 2 1 1 0 0 1 0 1 1 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 45050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  1 -1  1 -1  1 -1  0  0  0  1 -1  1] (Indices: [0, 2, 5, 6, 7, 9, 11, 13, 18]), Candidate: [ 1  2  0  0  2  1  1 -1  2  0  1  0  2  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  1 -1  0  0  1 -1  0  0  1  0 -1  1] (Indices: [0, 2, 5, 6, 7, 9, 13, 17, 18]), Candidate: [ 1  2  0  0  2  1  1 -1  2  0  0  1  2  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  0  1  0 -1  0  0  0  0  0  1  0  0] (Indices: [0, 2, 5, 6, 7, 10, 11, 18, 19]), Candidate: [ 1  2  0  0  2  1  1 -1  1  2  0  0  1  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  0  1 -1  0  0  0  1 -1  1  0 -1  1] (Indices: [0, 2, 5, 6, 7, 10, 15, 17, 18]), Candidate: [ 1  2  0  0  2  1  1 -1  1  2 -1  1  1  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 45250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  0  0  1 -1  0  1 -1  0  1  0 -1  1] (Indices: [0, 2, 5, 6, 7, 11, 14, 17, 18]), Candidate: [ 1  2  0  0  2  1  1 -1  1  1  1  0  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 45300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  0  0  0  0  1  0  0 -1  0  1 -1  1] (Indices: [0, 2, 5, 6, 7, 13, 14, 15, 18]), Candidate: [ 1  2  0  0  2  1  1 -1  1  1  0  1  2  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1  0  0 -1  0  1 -1  0  1 -1  0  0  1] (Indices: [0, 2, 5, 6, 8, 9, 10, 13, 16]), Candidate: [ 1  2  0  0  2  1  0  1  1  1 -1  1  2  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1  0 -1  0  1  0 -1  0  0  1 -1  0  1] (Indices: [0, 2, 5, 6, 8, 9, 12, 13, 17]), Candidate: [1 2 0 0 2 1 0 1 1 0 0 2 1 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 45450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1  0 -1  0  0  0  0  0  1  0 -1  1  0] (Indices: [0, 2, 5, 6, 8, 9, 16, 17, 19]), Candidate: [1 2 0 0 2 1 0 1 1 0 0 1 1 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 45500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1 -1  1 -1  1 -1  0  0  0  1 -1  1  0] (Indices: [0, 2, 5, 6, 8, 10, 12, 17, 19]), Candidate: [ 1  2  0  0  2  1  0  1  0  2 -1  2  0  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1 -1  0  1  0 -1  0  1 -1  0  1 -1  1] (Indices: [0, 2, 5, 6, 8, 11, 12, 15, 18]), Candidate: [1 2 0 0 2 1 0 1 0 1 1 1 0 1 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 45600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1 -1  0  0  1  0 -1  1 -1  0  1 -1  1] (Indices: [0, 2, 5, 6, 8, 12, 13, 15, 18]), Candidate: [1 2 0 0 2 1 0 1 0 1 0 2 1 0 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 45650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1 -1  0  0  0  0  1  0  0 -1  0  1  0] (Indices: [0, 2, 5, 6, 8, 14, 15, 16, 19]), Candidate: [1 2 0 0 2 1 0 1 0 1 0 1 1 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 45700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  1  0 -1  1 -1  1 -1  0  0  1 -1  1] (Indices: [0, 2, 5, 6, 9, 10, 12, 14, 18]), Candidate: [ 1  2  0  0  2  1  0  0  2  1 -1  2  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 45750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  1 -1  1  0  0 -1  0  0  1 -1  0  1] (Indices: [0, 2, 5, 6, 9, 11, 12, 13, 17]), Candidate: [1 2 0 0 2 1 0 0 2 0 1 1 1 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 45800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  1 -1  1 -1  0  0  0  1  0 -1  1  0] (Indices: [0, 2, 5, 6, 9, 11, 16, 17, 19]), Candidate: [1 2 0 0 2 1 0 0 2 0 1 0 1 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 45850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  1 -1  0  0  1 -1  1  0 -1  0  1  0] (Indices: [0, 2, 5, 6, 9, 13, 15, 16, 19]), Candidate: [1 2 0 0 2 1 0 0 2 0 0 1 2 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 45900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  0  1  0 -1  1 -1  1 -1  1 -1  0  1] (Indices: [0, 2, 5, 6, 10, 11, 13, 15, 17]), Candidate: [1 2 0 0 2 1 0 0 1 2 0 0 2 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 45950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  0  1 -1  1 -1  1 -1  1 -1  0  1  0] (Indices: [0, 2, 5, 6, 10, 12, 14, 16, 19]), Candidate: [ 1  2  0  0  2  1  0  0  1  2 -1  2  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 46000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  0  0  1  0  0  0 -1  1 -1  0  0  1] (Indices: [0, 2, 5, 6, 11, 12, 13, 14, 16]), Candidate: [ 1  2  0  0  2  1  0  0  1  1  1  1  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  0  0  1 -1  1 -1  0  1  0  0 -1  1] (Indices: [0, 2, 5, 6, 11, 13, 16, 17, 18]), Candidate: [1 2 0 0 2 1 0 0 1 1 1 0 2 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 46100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  0  0  0  1 -1  0  1  0  0 -1  1  0] (Indices: [0, 2, 5, 6, 12, 15, 16, 17, 19]), Candidate: [1 2 0 0 2 1 0 0 1 1 0 2 0 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 46150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0  0  0 -1  0  0  1 -1  0  0  0  1  0] (Indices: [0, 2, 5, 7, 8, 9, 10, 14, 19]), Candidate: [ 1  2  0  0  2  0  2  0  1  1 -1  1  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 46200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0  0 -1  0  1 -1  0  1  0 -1  0  0  1] (Indices: [0, 2, 5, 7, 8, 9, 12, 15, 16]), Candidate: [1 2 0 0 2 0 2 0 1 0 0 2 0 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 46250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0 -1  1  0  0 -1  0  0  0  0  1 -1  1] (Indices: [0, 2, 5, 7, 8, 10, 11, 12, 18]), Candidate: [1 2 0 0 2 0 2 0 0 2 0 1 0 1 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 46300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0 -1  1 -1  0  1 -1  1 -1  1 -1  0  1] (Indices: [0, 2, 5, 7, 8, 10, 13, 15, 17]), Candidate: [ 1  2  0  0  2  0  2  0  0  2 -1  1  2  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0 -1  0  1 -1  1  0  0 -1  0  0  0  1] (Indices: [0, 2, 5, 7, 8, 11, 13, 14, 15]), Candidate: [1 2 0 0 2 0 2 0 0 1 1 0 2 1 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 46400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0 -1  0  0  1 -1  1  0  0 -1  0  0  1] (Indices: [0, 2, 5, 7, 8, 12, 14, 15, 16]), Candidate: [1 2 0 0 2 0 2 0 0 1 0 2 0 2 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 46450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0 -1  0  0  0  0  0  1  0  0  0 -1  1] (Indices: [0, 2, 5, 7, 8, 15, 16, 17, 18]), Candidate: [1 2 0 0 2 0 2 0 0 1 0 1 1 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 46500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  1  0 -1  1 -1  0  0  1 -1  0  1  0] (Indices: [0, 2, 5, 7, 9, 10, 12, 16, 19]), Candidate: [ 1  2  0  0  2  0  2 -1  2  1 -1  2  0  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 46550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  1 -1  1  0 -1  0  1  0 -1  0  0  1] (Indices: [0, 2, 5, 7, 9, 11, 12, 15, 16]), Candidate: [ 1  2  0  0  2  0  2 -1  2  0  1  1  0  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  1 -1  0  1  0 -1  1  0 -1  0  0  1] (Indices: [0, 2, 5, 7, 9, 12, 13, 15, 16]), Candidate: [ 1  2  0  0  2  0  2 -1  2  0  0  2  1  0  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  1 -1  0  0  0  1  0  0  0 -1  0  1] (Indices: [0, 2, 5, 7, 9, 14, 15, 16, 17]), Candidate: [ 1  2  0  0  2  0  2 -1  2  0  0  1  1  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  0  1  0 -1  1 -1  0  0  0  1  0  0] (Indices: [0, 2, 5, 7, 10, 11, 13, 18, 19]), Candidate: [ 1  2  0  0  2  0  2 -1  1  2  0  0  2  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  0  1 -1  1 -1  0  1 -1  1 -1  1  0] (Indices: [0, 2, 5, 7, 10, 12, 15, 17, 19]), Candidate: [ 1  2  0  0  2  0  2 -1  1  2 -1  2  0  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 46800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  0  0  1  0  0 -1  0  1  0 -1  0  1] (Indices: [0, 2, 5, 7, 11, 12, 13, 16, 17]), Candidate: [ 1  2  0  0  2  0  2 -1  1  1  1  1  1  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  0  0  1 -1  0  1  0 -1  1 -1  1  0] (Indices: [0, 2, 5, 7, 11, 14, 15, 17, 19]), Candidate: [ 1  2  0  0  2  0  2 -1  1  1  1  0  1  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  0  0  0  0  1  0  0 -1  1 -1  1  0] (Indices: [0, 2, 5, 7, 13, 14, 15, 17, 19]), Candidate: [ 1  2  0  0  2  0  2 -1  1  1  0  1  2  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1  0  0 -1  1  0 -1  0  0  0  0  1  0] (Indices: [0, 2, 5, 8, 9, 10, 12, 13, 19]), Candidate: [ 1  2  0  0  2  0  1  1  1  1 -1  2  1  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1  0  0 -1  0  0  0  0  0  1  0  0  0] (Indices: [0, 2, 5, 8, 9, 10, 17, 18, 19]), Candidate: [ 1  2  0  0  2  0  1  1  1  1 -1  1  1  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1  0 -1  1 -1  0  0  1 -1  1  0 -1  1] (Indices: [0, 2, 5, 8, 9, 11, 15, 17, 18]), Candidate: [1 2 0 0 2 0 1 1 1 0 1 0 1 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 47100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1  0 -1  0  0  1  0 -1  0  1 -1  1  0] (Indices: [0, 2, 5, 8, 9, 13, 14, 17, 19]), Candidate: [ 1  2  0  0  2  0  1  1  1  0  0  1  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1 -1  1  0 -1  1  0 -1  0  1 -1  0  1] (Indices: [0, 2, 5, 8, 10, 11, 13, 14, 17]), Candidate: [ 1  2  0  0  2  0  1  1  0  2  0  0  2  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1 -1  1 -1  1 -1  1  0 -1  0  1 -1  1] (Indices: [0, 2, 5, 8, 10, 12, 14, 15, 18]), Candidate: [ 1  2  0  0  2  0  1  1  0  2 -1  2  0  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1 -1  1 -1  0  0  0  1  0 -1  1  0  0] (Indices: [0, 2, 5, 8, 10, 15, 16, 18, 19]), Candidate: [ 1  2  0  0  2  0  1  1  0  2 -1  1  1  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1 -1  0  1 -1  1 -1  1  0 -1  0  1  0] (Indices: [0, 2, 5, 8, 11, 13, 15, 16, 19]), Candidate: [1 2 0 0 2 0 1 1 0 1 1 0 2 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 47350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1 -1  0  0  1 -1  1 -1  1  0 -1  1  0] (Indices: [0, 2, 5, 8, 12, 14, 16, 17, 19]), Candidate: [ 1  2  0  0  2  0  1  1  0  1  0  2  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  1  0  0 -1  1  0  0 -1  0  0  0  1] (Indices: [0, 2, 5, 9, 10, 11, 13, 14, 15]), Candidate: [1 2 0 0 2 0 1 0 2 1 0 0 2 1 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 47450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  1  0 -1  1 -1  1  0  0 -1  0  0  1] (Indices: [0, 2, 5, 9, 10, 12, 14, 15, 16]), Candidate: [ 1  2  0  0  2  0  1  0  2  1 -1  2  0  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  1  0 -1  0  0  0  1  0  0  0 -1  1] (Indices: [0, 2, 5, 9, 10, 15, 16, 17, 18]), Candidate: [ 1  2  0  0  2  0  1  0  2  1 -1  1  1  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  1 -1  1 -1  1 -1  1  0  0 -1  0  1] (Indices: [0, 2, 5, 9, 11, 13, 15, 16, 17]), Candidate: [1 2 0 0 2 0 1 0 2 0 1 0 2 0 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 47600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  1 -1  0  1 -1  1  0 -1  0  1  0  0] (Indices: [0, 2, 5, 9, 12, 14, 15, 18, 19]), Candidate: [1 2 0 0 2 0 1 0 2 0 0 2 0 2 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 47650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  0  1  0  0 -1  1 -1  1  0 -1  0  1] (Indices: [0, 2, 5, 10, 11, 12, 14, 16, 17]), Candidate: [ 1  2  0  0  2  0  1  0  1  2  0  1  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  0  1  0 -1  0  0  0  1  0  0  0  0] (Indices: [0, 2, 5, 10, 11, 16, 17, 18, 19]), Candidate: [1 2 0 0 2 0 1 0 1 2 0 0 1 1 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 47750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  0  1 -1  0  1 -1  0  1  0  0  0  0] (Indices: [0, 2, 5, 10, 13, 16, 17, 18, 19]), Candidate: [ 1  2  0  0  2  0  1  0  1  2 -1  1  2  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  0  0  1 -1  1  0 -1  1 -1  1  0  0] (Indices: [0, 2, 5, 11, 13, 14, 16, 18, 19]), Candidate: [ 1  2  0  0  2  0  1  0  1  1  1  0  2  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0  0  0 -1  1 -1  1 -1  0  0  0  0  1] (Indices: [0, 2, 6, 7, 8, 9, 10, 12, 14]), Candidate: [ 1  2  0  0  1  2  1  0  1  1 -1  2  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 47900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0  0 -1  1 -1  0  0  0  1 -1  1 -1  1] (Indices: [0, 2, 6, 7, 8, 9, 11, 16, 18]), Candidate: [1 2 0 0 1 2 1 0 1 0 1 0 1 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 47950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0  0 -1  0  0  0  1 -1  0  0  1  0  0] (Indices: [0, 2, 6, 7, 8, 9, 14, 18, 19]), Candidate: [ 1  2  0  0  1  2  1  0  1  0  0  1  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0 -1  1 -1  1 -1  0  1  0 -1  0  0  1] (Indices: [0, 2, 6, 7, 8, 10, 12, 15, 16]), Candidate: [ 1  2  0  0  1  2  1  0  0  2 -1  2  0  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0 -1  0  1  0  0 -1  0  0  0  0  1  0] (Indices: [0, 2, 6, 7, 8, 11, 12, 13, 19]), Candidate: [1 2 0 0 1 2 1 0 0 1 1 1 1 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 48100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0 -1  0  1 -1  0  0  0  0  1  0  0  0] (Indices: [0, 2, 6, 7, 8, 11, 17, 18, 19]), Candidate: [1 2 0 0 1 2 1 0 0 1 1 0 1 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 48150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0 -1  0  0  0  1 -1  1 -1  1 -1  1  0] (Indices: [0, 2, 6, 7, 8, 13, 15, 17, 19]), Candidate: [1 2 0 0 1 2 1 0 0 1 0 1 2 0 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 48200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  1  0 -1  1  0 -1  1 -1  0  0  0  1] (Indices: [0, 2, 6, 7, 9, 10, 12, 13, 15]), Candidate: [ 1  2  0  0  1  2  1 -1  2  1 -1  2  1  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 48250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  1  0 -1  0  0  0  1 -1  0  1  0  0] (Indices: [0, 2, 6, 7, 9, 10, 15, 18, 19]), Candidate: [ 1  2  0  0  1  2  1 -1  2  1 -1  1  1  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 48300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  1 -1  1 -1  0  1 -1  0  0  1  0  0] (Indices: [0, 2, 6, 7, 9, 11, 14, 18, 19]), Candidate: [ 1  2  0  0  1  2  1 -1  2  0  1  0  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 48350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  1 -1  0  0  1  0 -1  1  0 -1  0  1] (Indices: [0, 2, 6, 7, 9, 13, 14, 16, 17]), Candidate: [ 1  2  0  0  1  2  1 -1  2  0  0  1  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 48400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  0  1  0  0 -1  0  0  0  1 -1  1  0] (Indices: [0, 2, 6, 7, 10, 11, 12, 17, 19]), Candidate: [ 1  2  0  0  1  2  1 -1  1  2  0  1  0  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  0  1 -1  1  0 -1  0  0  1 -1  1  0] (Indices: [0, 2, 6, 7, 10, 12, 13, 17, 19]), Candidate: [ 1  2  0  0  1  2  1 -1  1  2 -1  2  1  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 48500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  0  1 -1  0  0  1 -1  1 -1  1  0  0] (Indices: [0, 2, 6, 7, 10, 14, 16, 18, 19]), Candidate: [ 1  2  0  0  1  2  1 -1  1  2 -1  1  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 48550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  0  0  1 -1  1  0 -1  0  1 -1  1  0] (Indices: [0, 2, 6, 7, 11, 13, 14, 17, 19]), Candidate: [ 1  2  0  0  1  2  1 -1  1  1  1  0  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 48600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  0  0  0  1 -1  1  0 -1  1  0 -1  1] (Indices: [0, 2, 6, 7, 12, 14, 15, 17, 18]), Candidate: [ 1  2  0  0  1  2  1 -1  1  1  0  2  0  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1  0  0  0 -1  0  1 -1  0  0  0  1  0] (Indices: [0, 2, 6, 8, 9, 10, 11, 14, 19]), Candidate: [ 1  2  0  0  1  2  0  1  1  1  0  0  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1  0  0 -1  0  0  1  0 -1  0  0  1  0] (Indices: [0, 2, 6, 8, 9, 10, 14, 15, 19]), Candidate: [ 1  2  0  0  1  2  0  1  1  1 -1  1  1  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1  0 -1  1 -1  1 -1  0  0  1  0 -1  1] (Indices: [0, 2, 6, 8, 9, 11, 13, 17, 18]), Candidate: [1 2 0 0 1 2 0 1 1 0 1 0 2 0 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 48800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1  0 -1  0  1 -1  0  1  0 -1  0  1  0] (Indices: [0, 2, 6, 8, 9, 12, 15, 16, 19]), Candidate: [1 2 0 0 1 2 0 1 1 0 0 2 0 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 48850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1 -1  1  0  0 -1  1 -1  1 -1  0  0  1] (Indices: [0, 2, 6, 8, 10, 11, 12, 14, 16]), Candidate: [ 1  2  0  0  1  2  0  1  0  2  0  1  0  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1 -1  1 -1  1  0  0 -1  1 -1  0  0  1] (Indices: [0, 2, 6, 8, 10, 12, 13, 14, 16]), Candidate: [ 1  2  0  0  1  2  0  1  0  2 -1  2  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 48950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1 -1  1 -1  0  1 -1  0  1  0  0 -1  1] (Indices: [0, 2, 6, 8, 10, 13, 16, 17, 18]), Candidate: [ 1  2  0  0  1  2  0  1  0  2 -1  1  2  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1 -1  0  1  0 -1  0  0  1  0  0 -1  1] (Indices: [0, 2, 6, 8, 11, 12, 16, 17, 18]), Candidate: [1 2 0 0 1 2 0 1 0 1 1 1 0 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 49050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1 -1  0  0  1  0 -1  1  0 -1  1 -1  1] (Indices: [0, 2, 6, 8, 12, 13, 15, 16, 18]), Candidate: [1 2 0 0 1 2 0 1 0 1 0 2 1 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 49100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  1  0  0  0  0 -1  0  0  0  0  1  0] (Indices: [0, 2, 6, 9, 10, 11, 12, 13, 19]), Candidate: [1 2 0 0 1 2 0 0 2 1 0 1 1 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 49150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  1  0  0 -1  0  0  0  0  1  0  0  0] (Indices: [0, 2, 6, 9, 10, 11, 17, 18, 19]), Candidate: [1 2 0 0 1 2 0 0 2 1 0 0 1 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 49200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  1  0 -1  0  1 -1  1 -1  1 -1  1  0] (Indices: [0, 2, 6, 9, 10, 13, 15, 17, 19]), Candidate: [ 1  2  0  0  1  2  0  0  2  1 -1  1  2  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  1 -1  1  0 -1  0  1 -1  1 -1  1  0] (Indices: [0, 2, 6, 9, 11, 12, 15, 17, 19]), Candidate: [1 2 0 0 1 2 0 0 2 0 1 1 0 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 49300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  1 -1  0  1  0  0 -1  0  0  1  0  0] (Indices: [0, 2, 6, 9, 12, 13, 14, 18, 19]), Candidate: [ 1  2  0  0  1  2  0  0  2  0  0  2  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  0  1  0  0  0  0 -1  0  0  1 -1  1] (Indices: [0, 2, 6, 10, 11, 12, 13, 14, 18]), Candidate: [ 1  2  0  0  1  2  0  0  1  2  0  1  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  0  1  0 -1  1 -1  0  1 -1  1  0  0] (Indices: [0, 2, 6, 10, 11, 13, 16, 18, 19]), Candidate: [1 2 0 0 1 2 0 0 1 2 0 0 2 0 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 49450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  0  1 -1  1 -1  0  1 -1  1  0  0  0] (Indices: [0, 2, 6, 10, 12, 15, 17, 18, 19]), Candidate: [ 1  2  0  0  1  2  0  0  1  2 -1  2  0  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  0  0  1  0 -1  1 -1  1  0 -1  1  0] (Indices: [0, 2, 6, 11, 12, 14, 16, 17, 19]), Candidate: [ 1  2  0  0  1  2  0  0  1  1  1  1  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  0  0  0  0  1  0  0  0  0  0 -1  1] (Indices: [0, 2, 6, 13, 14, 15, 16, 17, 18]), Candidate: [1 2 0 0 1 2 0 0 1 1 0 1 2 1 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 49600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0  0  0 -1  1 -1  0  0  1  0 -1  0  1] (Indices: [0, 2, 7, 8, 9, 10, 12, 16, 17]), Candidate: [ 1  2  0  0  1  1  2  0  1  1 -1  2  0  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0  0 -1  1  0 -1  1 -1  0  0  1 -1  1] (Indices: [0, 2, 7, 8, 9, 11, 12, 14, 18]), Candidate: [ 1  2  0  0  1  1  2  0  1  0  1  1  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0  0 -1  0  1  0  0 -1  0  0  1 -1  1] (Indices: [0, 2, 7, 8, 9, 12, 13, 14, 18]), Candidate: [ 1  2  0  0  1  1  2  0  1  0  0  2  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0  0 -1  0  0  1 -1  0  1 -1  1  0  0] (Indices: [0, 2, 7, 8, 9, 13, 16, 18, 19]), Candidate: [1 2 0 0 1 1 2 0 1 0 0 1 2 0 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 49800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0 -1  1  0 -1  1 -1  0  0  1  0 -1  1] (Indices: [0, 2, 7, 8, 10, 11, 13, 17, 18]), Candidate: [1 2 0 0 1 1 2 0 0 2 0 0 2 0 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 49850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0 -1  1 -1  1 -1  0  1  0 -1  0  1  0] (Indices: [0, 2, 7, 8, 10, 12, 15, 16, 19]), Candidate: [ 1  2  0  0  1  1  2  0  0  2 -1  2  0  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0 -1  0  1  0  0 -1  1 -1  0  1 -1  1] (Indices: [0, 2, 7, 8, 11, 12, 13, 15, 18]), Candidate: [1 2 0 0 1 1 2 0 0 1 1 1 1 0 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 49950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0 -1  0  1 -1  0  1  0  0 -1  0  1  0] (Indices: [0, 2, 7, 8, 11, 14, 15, 16, 19]), Candidate: [1 2 0 0 1 1 2 0 0 1 1 0 1 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 50000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0 -1  0  0  0  1  0  0  0 -1  0  1  0] (Indices: [0, 2, 7, 8, 13, 14, 15, 16, 19]), Candidate: [1 2 0 0 1 1 2 0 0 1 0 1 2 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 50050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  1  0  0 -1  1 -1  0  1 -1  1 -1  1] (Indices: [0, 2, 7, 9, 10, 11, 13, 16, 18]), Candidate: [ 1  2  0  0  1  1  2 -1  2  1  0  0  2  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  1  0 -1  1 -1  0  1  0  0 -1  0  1] (Indices: [0, 2, 7, 9, 10, 12, 15, 16, 17]), Candidate: [ 1  2  0  0  1  1  2 -1  2  1 -1  2  0  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 50150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  1 -1  1  0  0 -1  1  0 -1  0  0  1] (Indices: [0, 2, 7, 9, 11, 12, 13, 15, 16]), Candidate: [ 1  2  0  0  1  1  2 -1  2  0  1  1  1  0  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  1 -1  1 -1  0  1  0  0  0 -1  0  1] (Indices: [0, 2, 7, 9, 11, 14, 15, 16, 17]), Candidate: [ 1  2  0  0  1  1  2 -1  2  0  1  0  1  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  1 -1  0  0  1  0  0  0  0 -1  0  1] (Indices: [0, 2, 7, 9, 13, 14, 15, 16, 17]), Candidate: [ 1  2  0  0  1  1  2 -1  2  0  0  1  2  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  0  1  0  0 -1  0  1 -1  1 -1  1  0] (Indices: [0, 2, 7, 10, 11, 12, 15, 17, 19]), Candidate: [ 1  2  0  0  1  1  2 -1  1  2  0  1  0  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  0  1 -1  1  0  0 -1  0  0  1  0  0] (Indices: [0, 2, 7, 10, 12, 13, 14, 18, 19]), Candidate: [ 1  2  0  0  1  1  2 -1  1  2 -1  2  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 50400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  0  0  1  0  0  0  0 -1  0  0  1  0] (Indices: [0, 2, 7, 11, 12, 13, 14, 15, 19]), Candidate: [ 1  2  0  0  1  1  2 -1  1  1  1  1  1  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  0  0  1 -1  0  1  0 -1  1  0  0  0] (Indices: [0, 2, 7, 11, 14, 15, 17, 18, 19]), Candidate: [ 1  2  0  0  1  1  2 -1  1  1  1  0  1  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1  0  0  0  0 -1  0  0  0  1 -1  1  0] (Indices: [0, 2, 8, 9, 10, 11, 12, 17, 19]), Candidate: [1 2 0 0 1 1 1 1 1 1 0 1 0 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 50550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1  0  0 -1  1  0 -1  0  0  1 -1  1  0] (Indices: [0, 2, 8, 9, 10, 12, 13, 17, 19]), Candidate: [ 1  2  0  0  1  1  1  1  1  1 -1  2  1  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1  0  0 -1  0  0  1 -1  1 -1  1  0  0] (Indices: [0, 2, 8, 9, 10, 14, 16, 18, 19]), Candidate: [ 1  2  0  0  1  1  1  1  1  1 -1  1  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 50650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1  0 -1  1 -1  1  0 -1  0  1 -1  1  0] (Indices: [0, 2, 8, 9, 11, 13, 14, 17, 19]), Candidate: [ 1  2  0  0  1  1  1  1  1  0  1  0  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1  0 -1  0  1 -1  1  0 -1  1  0 -1  1] (Indices: [0, 2, 8, 9, 12, 14, 15, 17, 18]), Candidate: [1 2 0 0 1 1 1 1 1 0 0 2 0 2 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 50750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1 -1  1  0  0 -1  1  0 -1  0  1 -1  1] (Indices: [0, 2, 8, 10, 11, 12, 14, 15, 18]), Candidate: [1 2 0 0 1 1 1 1 0 2 0 1 0 2 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 50800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1 -1  1  0 -1  0  0  1  0 -1  1  0  0] (Indices: [0, 2, 8, 10, 11, 15, 16, 18, 19]), Candidate: [1 2 0 0 1 1 1 1 0 2 0 0 1 1 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 50850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1 -1  1 -1  0  1 -1  1  0 -1  1  0  0] (Indices: [0, 2, 8, 10, 13, 15, 16, 18, 19]), Candidate: [ 1  2  0  0  1  1  1  1  0  2 -1  1  2  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1 -1  0  1 -1  1  0 -1  1  0  0 -1  1] (Indices: [0, 2, 8, 11, 13, 14, 16, 17, 18]), Candidate: [ 1  2  0  0  1  1  1  1  0  1  1  0  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  1  0  0  0  0 -1  1 -1  0  1 -1  1] (Indices: [0, 2, 9, 10, 11, 12, 13, 15, 18]), Candidate: [1 2 0 0 1 1 1 0 2 1 0 1 1 0 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 51000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  1  0  0 -1  0  1  0  0 -1  0  1  0] (Indices: [0, 2, 9, 10, 11, 14, 15, 16, 19]), Candidate: [1 2 0 0 1 1 1 0 2 1 0 0 1 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 51050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  1  0 -1  0  1  0  0  0 -1  0  1  0] (Indices: [0, 2, 9, 10, 13, 14, 15, 16, 19]), Candidate: [ 1  2  0  0  1  1  1  0  2  1 -1  1  2  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  1 -1  1  0 -1  0  1  0  0 -1  1  0] (Indices: [0, 2, 9, 11, 12, 15, 16, 17, 19]), Candidate: [1 2 0 0 1 1 1 0 2 0 1 1 0 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 51150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  1 -1  0  0  1  0 -1  1  0  0  0  0] (Indices: [0, 2, 9, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  2  0  0  1  1  1  0  2  0  0  1  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  0  1  0 -1  1 -1  1  0 -1  1  0  0] (Indices: [0, 2, 10, 11, 13, 15, 16, 18, 19]), Candidate: [1 2 0 0 1 1 1 0 1 2 0 0 2 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 51250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  0  0  1  0  0 -1  1 -1  1  0  0  0] (Indices: [0, 2, 11, 12, 13, 15, 17, 18, 19]), Candidate: [1 2 0 0 1 1 1 0 1 1 1 1 1 0 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 51300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0 -1  0  0  1  0 -1  0  0  0  0  0  1] (Indices: [0, 3, 4, 5, 6, 7, 8, 12, 13]), Candidate: [1 1 2 0 1 1 1 0 0 1 0 2 1 0 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 51350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  1 -1  0  1 -1  0  0  0  0  1 -1  1] (Indices: [0, 3, 4, 5, 6, 7, 9, 12, 18]), Candidate: [ 1  1  2  0  1  1  1 -1  2  0  0  2  0  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  0  1 -1  0  0  0  1 -1  1 -1  0  1] (Indices: [0, 3, 4, 5, 6, 7, 10, 15, 17]), Candidate: [ 1  1  2  0  1  1  1 -1  1  2 -1  1  1  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 51450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  0  0  0  1 -1  0  1 -1  0  1 -1  1] (Indices: [0, 3, 4, 5, 6, 7, 12, 15, 18]), Candidate: [ 1  1  2  0  1  1  1 -1  1  1  0  2  0  1  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1  0  0 -1  0  0  0  0  0  0  1 -1  1] (Indices: [0, 3, 4, 5, 6, 8, 9, 10, 18]), Candidate: [ 1  1  2  0  1  1  0  1  1  1 -1  1  1  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1 -1  1 -1  1 -1  0  0  0  1 -1  0  1] (Indices: [0, 3, 4, 5, 6, 8, 10, 12, 17]), Candidate: [ 1  1  2  0  1  1  0  1  0  2 -1  2  0  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1 -1  0  1 -1  0  0  0  0  1 -1  1  0] (Indices: [0, 3, 4, 5, 6, 8, 11, 17, 19]), Candidate: [1 1 2 0 1 1 0 1 0 1 1 0 1 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 51650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1 -1  0  0  0  0  0  1  0 -1  0  1  0] (Indices: [0, 3, 4, 5, 6, 8, 15, 16, 19]), Candidate: [1 1 2 0 1 1 0 1 0 1 0 1 1 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 51700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  1 -1  1  0 -1  0  0  0  0  0  1  0] (Indices: [0, 3, 4, 5, 6, 9, 11, 12, 19]), Candidate: [1 1 2 0 1 1 0 0 2 0 1 1 0 1 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 51750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  1 -1  0  0  1 -1  1 -1  0  1 -1  1] (Indices: [0, 3, 4, 5, 6, 9, 13, 15, 18]), Candidate: [1 1 2 0 1 1 0 0 2 0 0 1 2 0 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 51800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  0  1  0 -1  0  0  0  1  0 -1  0  1] (Indices: [0, 3, 4, 5, 6, 10, 11, 16, 17]), Candidate: [1 1 2 0 1 1 0 0 1 2 0 0 1 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 51850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  0  1 -1  0  0  1 -1  0  1 -1  1  0] (Indices: [0, 3, 4, 5, 6, 10, 14, 17, 19]), Candidate: [ 1  1  2  0  1  1  0  0  1  2 -1  1  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 51900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  0  0  1 -1  0  1  0 -1  0  1 -1  1] (Indices: [0, 3, 4, 5, 6, 11, 14, 15, 18]), Candidate: [1 1 2 0 1 1 0 0 1 1 1 0 1 2 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 51950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  0  0  0  1 -1  0  0  1  0 -1  1  0] (Indices: [0, 3, 4, 5, 6, 12, 16, 17, 19]), Candidate: [1 1 2 0 1 1 0 0 1 1 0 2 0 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 52000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0  0 -1  1 -1  0  0  1 -1  0  0  0  1] (Indices: [0, 3, 4, 5, 7, 8, 9, 11, 15]), Candidate: [1 1 2 0 1 0 2 0 1 0 1 0 1 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 52050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0 -1  1 -1  0  1 -1  0  1 -1  0  0  1] (Indices: [0, 3, 4, 5, 7, 8, 10, 13, 16]), Candidate: [ 1  1  2  0  1  0  2  0  0  2 -1  1  2  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0 -1  0  0  1  0 -1  0  0  1 -1  0  1] (Indices: [0, 3, 4, 5, 7, 8, 12, 13, 17]), Candidate: [1 1 2 0 1 0 2 0 0 1 0 2 1 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 52150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0 -1  0  0  0  0  0  0  1  0 -1  1  0] (Indices: [0, 3, 4, 5, 7, 8, 16, 17, 19]), Candidate: [1 1 2 0 1 0 2 0 0 1 0 1 1 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 52200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  1 -1  1 -1  1 -1  0  0  0  1 -1  1] (Indices: [0, 3, 4, 5, 7, 9, 11, 13, 18]), Candidate: [ 1  1  2  0  1  0  2 -1  2  0  1  0  2  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  1 -1  0  0  1 -1  0  0  1  0 -1  1] (Indices: [0, 3, 4, 5, 7, 9, 13, 17, 18]), Candidate: [ 1  1  2  0  1  0  2 -1  2  0  0  1  2  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  0  1  0 -1  0  0  0  0  0  1  0  0] (Indices: [0, 3, 4, 5, 7, 10, 11, 18, 19]), Candidate: [ 1  1  2  0  1  0  2 -1  1  2  0  0  1  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  0  1 -1  0  0  0  1 -1  1  0 -1  1] (Indices: [0, 3, 4, 5, 7, 10, 15, 17, 18]), Candidate: [ 1  1  2  0  1  0  2 -1  1  2 -1  1  1  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  0  0  1 -1  0  1 -1  0  1  0 -1  1] (Indices: [0, 3, 4, 5, 7, 11, 14, 17, 18]), Candidate: [ 1  1  2  0  1  0  2 -1  1  1  1  0  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  0  0  0  0  1  0  0 -1  0  1 -1  1] (Indices: [0, 3, 4, 5, 7, 13, 14, 15, 18]), Candidate: [ 1  1  2  0  1  0  2 -1  1  1  0  1  2  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1  0  0 -1  0  1 -1  0  1 -1  0  0  1] (Indices: [0, 3, 4, 5, 8, 9, 10, 13, 16]), Candidate: [ 1  1  2  0  1  0  1  1  1  1 -1  1  2  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1  0 -1  0  1  0 -1  0  0  1 -1  0  1] (Indices: [0, 3, 4, 5, 8, 9, 12, 13, 17]), Candidate: [1 1 2 0 1 0 1 1 1 0 0 2 1 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 52600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1  0 -1  0  0  0  0  0  1  0 -1  1  0] (Indices: [0, 3, 4, 5, 8, 9, 16, 17, 19]), Candidate: [1 1 2 0 1 0 1 1 1 0 0 1 1 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 52650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1 -1  1 -1  1 -1  0  0  0  1 -1  1  0] (Indices: [0, 3, 4, 5, 8, 10, 12, 17, 19]), Candidate: [ 1  1  2  0  1  0  1  1  0  2 -1  2  0  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1 -1  0  1  0 -1  0  1 -1  0  1 -1  1] (Indices: [0, 3, 4, 5, 8, 11, 12, 15, 18]), Candidate: [1 1 2 0 1 0 1 1 0 1 1 1 0 1 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 52750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1 -1  0  0  1  0 -1  1 -1  0  1 -1  1] (Indices: [0, 3, 4, 5, 8, 12, 13, 15, 18]), Candidate: [1 1 2 0 1 0 1 1 0 1 0 2 1 0 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 52800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1 -1  0  0  0  0  1  0  0 -1  0  1  0] (Indices: [0, 3, 4, 5, 8, 14, 15, 16, 19]), Candidate: [1 1 2 0 1 0 1 1 0 1 0 1 1 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 52850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  1  0 -1  1 -1  1 -1  0  0  1 -1  1] (Indices: [0, 3, 4, 5, 9, 10, 12, 14, 18]), Candidate: [ 1  1  2  0  1  0  1  0  2  1 -1  2  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  1 -1  1  0  0 -1  0  0  1 -1  0  1] (Indices: [0, 3, 4, 5, 9, 11, 12, 13, 17]), Candidate: [1 1 2 0 1 0 1 0 2 0 1 1 1 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 52950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  1 -1  1 -1  0  0  0  1  0 -1  1  0] (Indices: [0, 3, 4, 5, 9, 11, 16, 17, 19]), Candidate: [1 1 2 0 1 0 1 0 2 0 1 0 1 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 53000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  1 -1  0  0  1 -1  1  0 -1  0  1  0] (Indices: [0, 3, 4, 5, 9, 13, 15, 16, 19]), Candidate: [1 1 2 0 1 0 1 0 2 0 0 1 2 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 53050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  0  1  0 -1  1 -1  1 -1  1 -1  0  1] (Indices: [0, 3, 4, 5, 10, 11, 13, 15, 17]), Candidate: [1 1 2 0 1 0 1 0 1 2 0 0 2 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 53100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  0  1 -1  1 -1  1 -1  1 -1  0  1  0] (Indices: [0, 3, 4, 5, 10, 12, 14, 16, 19]), Candidate: [ 1  1  2  0  1  0  1  0  1  2 -1  2  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 53150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  0  0  1  0  0  0 -1  1 -1  0  0  1] (Indices: [0, 3, 4, 5, 11, 12, 13, 14, 16]), Candidate: [ 1  1  2  0  1  0  1  0  1  1  1  1  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  0  0  1 -1  1 -1  0  1  0  0 -1  1] (Indices: [0, 3, 4, 5, 11, 13, 16, 17, 18]), Candidate: [1 1 2 0 1 0 1 0 1 1 1 0 2 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 53250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  0  0  0  1 -1  0  1  0  0 -1  1  0] (Indices: [0, 3, 4, 5, 12, 15, 16, 17, 19]), Candidate: [1 1 2 0 1 0 1 0 1 1 0 2 0 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 53300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0  0 -1  0  0  1 -1  1 -1  0  0  0  1] (Indices: [0, 3, 4, 6, 7, 8, 9, 13, 15]), Candidate: [1 1 2 0 0 2 1 0 1 0 0 1 2 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 53350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0 -1  1 -1  0  0  0  0  1  0 -1  0  1] (Indices: [0, 3, 4, 6, 7, 8, 10, 16, 17]), Candidate: [ 1  1  2  0  0  2  1  0  0  2 -1  1  1  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0 -1  0  0  1 -1  0  0  1 -1  1 -1  1] (Indices: [0, 3, 4, 6, 7, 8, 12, 16, 18]), Candidate: [1 1 2 0 0 2 1 0 0 1 0 2 0 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 53450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  1  0 -1  1 -1  0  1 -1  0  0  0  1] (Indices: [0, 3, 4, 6, 7, 9, 10, 12, 15]), Candidate: [ 1  1  2  0  0  2  1 -1  2  1 -1  2  0  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 53500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  1 -1  1 -1  0  0  0  1 -1  0  1  0] (Indices: [0, 3, 4, 6, 7, 9, 11, 16, 19]), Candidate: [ 1  1  2  0  0  2  1 -1  2  0  1  0  1  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  1 -1  0  0  0  0  1  0  0 -1  0  1] (Indices: [0, 3, 4, 6, 7, 9, 15, 16, 17]), Candidate: [ 1  1  2  0  0  2  1 -1  2  0  0  1  1  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  0  1 -1  1 -1  0  1 -1  1 -1  0  1] (Indices: [0, 3, 4, 6, 7, 10, 12, 15, 17]), Candidate: [ 1  1  2  0  0  2  1 -1  1  2 -1  2  0  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 53650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  0  0  1  0 -1  1  0 -1  0  0  0  1] (Indices: [0, 3, 4, 6, 7, 11, 12, 14, 15]), Candidate: [ 1  1  2  0  0  2  1 -1  1  1  1  1  0  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  0  0  0  1  0  0  0 -1  0  0  0  1] (Indices: [0, 3, 4, 6, 7, 12, 13, 14, 15]), Candidate: [ 1  1  2  0  0  2  1 -1  1  1  0  2  1  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  0  0  0  0  1 -1  1 -1  0  1  0  0] (Indices: [0, 3, 4, 6, 7, 13, 15, 18, 19]), Candidate: [ 1  1  2  0  0  2  1 -1  1  1  0  1  2  0  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1  0  0 -1  0  0  0  0  1  0 -1  0  1] (Indices: [0, 3, 4, 6, 8, 9, 10, 16, 17]), Candidate: [ 1  1  2  0  0  2  0  1  1  1 -1  1  1  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1  0 -1  0  1 -1  0  0  1 -1  1 -1  1] (Indices: [0, 3, 4, 6, 8, 9, 12, 16, 18]), Candidate: [1 1 2 0 0 2 0 1 1 0 0 2 0 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 53900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1 -1  1  0 -1  1 -1  0  0  1 -1  0  1] (Indices: [0, 3, 4, 6, 8, 10, 11, 13, 17]), Candidate: [1 1 2 0 0 2 0 1 0 2 0 0 2 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 53950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1 -1  1 -1  0  1 -1  0  1 -1  0  1  0] (Indices: [0, 3, 4, 6, 8, 10, 13, 16, 19]), Candidate: [ 1  1  2  0  0  2  0  1  0  2 -1  1  2  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1 -1  0  1 -1  1 -1  1  0 -1  0  0  1] (Indices: [0, 3, 4, 6, 8, 11, 13, 15, 16]), Candidate: [1 1 2 0 0 2 0 1 0 1 1 0 2 0 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 54050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1 -1  0  0  1 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 3, 4, 6, 8, 12, 14, 16, 18]), Candidate: [ 1  1  2  0  0  2  0  1  0  1  0  2  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  1  0  0  0  0 -1  0  0  0  0  0  1] (Indices: [0, 3, 4, 6, 9, 10, 11, 12, 13]), Candidate: [1 1 2 0 0 2 0 0 2 1 0 1 1 0 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 54150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  1  0 -1  0  1  0 -1  1 -1  0  0  1] (Indices: [0, 3, 4, 6, 9, 10, 13, 14, 16]), Candidate: [ 1  1  2  0  0  2  0  0  2  1 -1  1  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 54200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  1 -1  1  0 -1  0  0  1 -1  1 -1  1] (Indices: [0, 3, 4, 6, 9, 11, 12, 16, 18]), Candidate: [1 1 2 0 0 2 0 0 2 0 1 1 0 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 54250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  1 -1  0  1  0 -1  0  1 -1  1 -1  1] (Indices: [0, 3, 4, 6, 9, 12, 13, 16, 18]), Candidate: [1 1 2 0 0 2 0 0 2 0 0 2 1 0 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 54300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  1 -1  0  0  0  1  0 -1  0  1  0  0] (Indices: [0, 3, 4, 6, 9, 14, 15, 18, 19]), Candidate: [1 1 2 0 0 2 0 0 2 0 0 1 1 2 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 54350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  0  1  0 -1  0  1 -1  1  0 -1  0  1] (Indices: [0, 3, 4, 6, 10, 11, 14, 16, 17]), Candidate: [ 1  1  2  0  0  2  0  0  1  2  0  0  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  0  1 -1  1 -1  0  0  0  1  0  0  0] (Indices: [0, 3, 4, 6, 10, 12, 17, 18, 19]), Candidate: [ 1  1  2  0  0  2  0  0  1  2 -1  2  0  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  0  0  1  0  0 -1  0  0  0  1  0  0] (Indices: [0, 3, 4, 6, 11, 12, 13, 18, 19]), Candidate: [1 1 2 0 0 2 0 0 1 1 1 1 1 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 54500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  0  0  1 -1  0  1 -1  0  1  0  0  0] (Indices: [0, 3, 4, 6, 11, 14, 17, 18, 19]), Candidate: [ 1  1  2  0  0  2  0  0  1  1  1  0  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  0  0  0  0  1  0 -1  0  1  0  0  0] (Indices: [0, 3, 4, 6, 13, 14, 17, 18, 19]), Candidate: [ 1  1  2  0  0  2  0  0  1  1  0  1  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0  0 -1  1  0 -1  0  1 -1  0  0  0  1] (Indices: [0, 3, 4, 7, 8, 9, 11, 12, 15]), Candidate: [1 1 2 0 0 1 2 0 1 0 1 1 0 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 54650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0  0 -1  0  0  1  0 -1  0  0  1 -1  1] (Indices: [0, 3, 4, 7, 8, 9, 13, 14, 18]), Candidate: [ 1  1  2  0  0  1  2  0  1  0  0  1  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0 -1  1  0 -1  0  0  1  0 -1  0  0  1] (Indices: [0, 3, 4, 7, 8, 10, 11, 15, 16]), Candidate: [1 1 2 0 0 1 2 0 0 2 0 0 1 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 54750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0 -1  1 -1  0  0  1 -1  1  0 -1  0  1] (Indices: [0, 3, 4, 7, 8, 10, 14, 16, 17]), Candidate: [ 1  1  2  0  0  1  2  0  0  2 -1  1  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 54800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0 -1  0  1 -1  1 -1  0  0  1 -1  1  0] (Indices: [0, 3, 4, 7, 8, 11, 13, 17, 19]), Candidate: [1 1 2 0 0 1 2 0 0 1 1 0 2 0 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 54850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0 -1  0  0  1 -1  0  1 -1  1  0 -1  1] (Indices: [0, 3, 4, 7, 8, 12, 15, 17, 18]), Candidate: [1 1 2 0 0 1 2 0 0 1 0 2 0 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 54900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  1  0  0 -1  1 -1  1 -1  0  0  0  1] (Indices: [0, 3, 4, 7, 9, 10, 11, 13, 15]), Candidate: [ 1  1  2  0  0  1  2 -1  2  1  0  0  2  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  1  0 -1  0  1 -1  0  1  0 -1  0  1] (Indices: [0, 3, 4, 7, 9, 10, 13, 16, 17]), Candidate: [ 1  1  2  0  0  1  2 -1  2  1 -1  1  2  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  1 -1  1 -1  1  0 -1  0  0  1 -1  1] (Indices: [0, 3, 4, 7, 9, 11, 13, 14, 18]), Candidate: [ 1  1  2  0  0  1  2 -1  2  0  1  0  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  1 -1  0  1 -1  1  0 -1  0  0  1  0] (Indices: [0, 3, 4, 7, 9, 12, 14, 15, 19]), Candidate: [ 1  1  2  0  0  1  2 -1  2  0  0  2  0  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  1 -1  0  0  0  0  1 -1  1  0  0  0] (Indices: [0, 3, 4, 7, 9, 15, 17, 18, 19]), Candidate: [ 1  1  2  0  0  1  2 -1  2  0  0  1  1  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  0  1  0 -1  0  0  1  0 -1  0  1  0] (Indices: [0, 3, 4, 7, 10, 11, 15, 16, 19]), Candidate: [ 1  1  2  0  0  1  2 -1  1  2  0  0  1  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  0  1 -1  0  1  0 -1  0  1  0 -1  1] (Indices: [0, 3, 4, 7, 10, 13, 14, 17, 18]), Candidate: [ 1  1  2  0  0  1  2 -1  1  2 -1  1  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 55250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  0  0  1  0 -1  1 -1  0  1  0 -1  1] (Indices: [0, 3, 4, 7, 11, 12, 14, 17, 18]), Candidate: [ 1  1  2  0  0  1  2 -1  1  1  1  1  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  0  0  0  1  0  0  0 -1  0  1 -1  1] (Indices: [0, 3, 4, 7, 12, 13, 14, 15, 18]), Candidate: [ 1  1  2  0  0  1  2 -1  1  1  0  2  1  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  0  0  0  0  0  1  0  0 -1  1  0  0] (Indices: [0, 3, 4, 7, 14, 15, 16, 18, 19]), Candidate: [ 1  1  2  0  0  1  2 -1  1  1  0  1  1  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1  0  0 -1  1 -1  0  0  0  1  0 -1  1] (Indices: [0, 3, 4, 8, 9, 10, 12, 17, 18]), Candidate: [ 1  1  2  0  0  1  1  1  1  1 -1  2  0  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1  0 -1  1  0 -1  0  1 -1  1 -1  0  1] (Indices: [0, 3, 4, 8, 9, 11, 12, 15, 17]), Candidate: [1 1 2 0 0 1 1 1 1 0 1 1 0 1 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 55500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1  0 -1  0  1  0 -1  1 -1  1 -1  0  1] (Indices: [0, 3, 4, 8, 9, 12, 13, 15, 17]), Candidate: [1 1 2 0 0 1 1 1 1 0 0 2 1 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 55550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1  0 -1  0  0  0  1  0  0 -1  1 -1  1] (Indices: [0, 3, 4, 8, 9, 14, 15, 16, 18]), Candidate: [1 1 2 0 0 1 1 1 1 0 0 1 1 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 55600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1 -1  1  0 -1  0  1  0  0 -1  0  0  1] (Indices: [0, 3, 4, 8, 10, 11, 14, 15, 16]), Candidate: [1 1 2 0 0 1 1 1 0 2 0 0 1 2 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 55650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1 -1  1 -1  1 -1  0  1 -1  0  1  0  0] (Indices: [0, 3, 4, 8, 10, 12, 15, 18, 19]), Candidate: [ 1  1  2  0  0  1  1  1  0  2 -1  2  0  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1 -1  0  1  0  0 -1  0  1 -1  1 -1  1] (Indices: [0, 3, 4, 8, 11, 12, 13, 16, 18]), Candidate: [1 1 2 0 0 1 1 1 0 1 1 1 1 0 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 55750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1 -1  0  1 -1  0  1  0 -1  0  1  0  0] (Indices: [0, 3, 4, 8, 11, 14, 15, 18, 19]), Candidate: [1 1 2 0 0 1 1 1 0 1 1 0 1 2 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 55800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1 -1  0  0  0  1  0  0 -1  0  1  0  0] (Indices: [0, 3, 4, 8, 13, 14, 15, 18, 19]), Candidate: [1 1 2 0 0 1 1 1 0 1 0 1 2 1 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 55850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  1  0  0 -1  1 -1  0  0  1 -1  1  0] (Indices: [0, 3, 4, 9, 10, 11, 13, 17, 19]), Candidate: [1 1 2 0 0 1 1 0 2 1 0 0 2 0 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 55900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  1  0 -1  1 -1  0  1 -1  1  0 -1  1] (Indices: [0, 3, 4, 9, 10, 12, 15, 17, 18]), Candidate: [ 1  1  2  0  0  1  1  0  2  1 -1  2  0  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  1 -1  1  0  0 -1  1 -1  0  0  1  0] (Indices: [0, 3, 4, 9, 11, 12, 13, 15, 19]), Candidate: [1 1 2 0 0 1 1 0 2 0 1 1 1 0 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 56000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  1 -1  1 -1  0  1  0 -1  1  0 -1  1] (Indices: [0, 3, 4, 9, 11, 14, 15, 17, 18]), Candidate: [1 1 2 0 0 1 1 0 2 0 1 0 1 2 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 56050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  1 -1  0  0  1  0  0 -1  1  0 -1  1] (Indices: [0, 3, 4, 9, 13, 14, 15, 17, 18]), Candidate: [1 1 2 0 0 1 1 0 2 0 0 1 2 1 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 56100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  0  1  0  0 -1  0  0  1  0 -1  1  0] (Indices: [0, 3, 4, 10, 11, 12, 16, 17, 19]), Candidate: [1 1 2 0 0 1 1 0 1 2 0 1 0 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 56150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  0  1 -1  1  0 -1  1  0 -1  0  1  0] (Indices: [0, 3, 4, 10, 12, 13, 15, 16, 19]), Candidate: [ 1  1  2  0  0  1  1  0  1  2 -1  2  1  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  0  0  1  0  0  0 -1  1 -1  0  1  0] (Indices: [0, 3, 4, 11, 12, 13, 14, 16, 19]), Candidate: [ 1  1  2  0  0  1  1  0  1  1  1  1  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  0  0  0  1  0  0  0  0  0 -1  0  1] (Indices: [0, 3, 4, 12, 13, 14, 15, 16, 17]), Candidate: [1 1 2 0 0 1 1 0 1 1 0 2 1 1 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 56300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0  0 -1  0  1 -1  0  0  0  0  1 -1  1] (Indices: [0, 3, 5, 6, 7, 8, 9, 12, 18]), Candidate: [ 1  1  2 -1  2  1  1  0  1  0  0  2  0  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0 -1  1 -1  0  0  0  1 -1  1 -1  0  1] (Indices: [0, 3, 5, 6, 7, 8, 10, 15, 17]), Candidate: [ 1  1  2 -1  2  1  1  0  0  2 -1  1  1  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0 -1  0  0  1 -1  0  1 -1  0  1 -1  1] (Indices: [0, 3, 5, 6, 7, 8, 12, 15, 18]), Candidate: [ 1  1  2 -1  2  1  1  0  0  1  0  2  0  1  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  1  0  0 -1  0  0  0  0  0  0  1  0] (Indices: [0, 3, 5, 6, 7, 9, 10, 11, 19]), Candidate: [ 1  1  2 -1  2  1  1 -1  2  1  0  0  1  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  1 -1  1 -1  0  0  1 -1  0  0  1  0] (Indices: [0, 3, 5, 6, 7, 9, 11, 15, 19]), Candidate: [ 1  1  2 -1  2  1  1 -1  2  0  1  0  1  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  1 -1  0  0  0  1 -1  0  1  0 -1  1] (Indices: [0, 3, 5, 6, 7, 9, 14, 17, 18]), Candidate: [ 1  1  2 -1  2  1  1 -1  2  0  0  1  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 56600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  0  1 -1  1 -1  1 -1  0  0  1 -1  1] (Indices: [0, 3, 5, 6, 7, 10, 12, 14, 18]), Candidate: [ 1  1  2 -1  2  1  1 -1  1  2 -1  2  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 56650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  0  0  1  0  0 -1  0  0  1 -1  0  1] (Indices: [0, 3, 5, 6, 7, 11, 12, 13, 17]), Candidate: [ 1  1  2 -1  2  1  1 -1  1  1  1  1  1  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  0  0  1 -1  0  0  0  1  0 -1  1  0] (Indices: [0, 3, 5, 6, 7, 11, 16, 17, 19]), Candidate: [ 1  1  2 -1  2  1  1 -1  1  1  1  0  1  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  0  0  0  0  1 -1  1  0 -1  0  1  0] (Indices: [0, 3, 5, 6, 7, 13, 15, 16, 19]), Candidate: [ 1  1  2 -1  2  1  1 -1  1  1  0  1  2  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1  0  0 -1  0  0  0  1 -1  1 -1  0  1] (Indices: [0, 3, 5, 6, 8, 9, 10, 15, 17]), Candidate: [ 1  1  2 -1  2  1  0  1  1  1 -1  1  1  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1  0 -1  0  1 -1  0  1 -1  0  1 -1  1] (Indices: [0, 3, 5, 6, 8, 9, 12, 15, 18]), Candidate: [ 1  1  2 -1  2  1  0  1  1  0  0  2  0  1  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1 -1  1  0 -1  1  0 -1  0  0  0  0  1] (Indices: [0, 3, 5, 6, 8, 10, 11, 13, 14]), Candidate: [ 1  1  2 -1  2  1  0  1  0  2  0  0  2  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1 -1  1 -1  0  1 -1  1 -1  0  0  1  0] (Indices: [0, 3, 5, 6, 8, 10, 13, 15, 19]), Candidate: [ 1  1  2 -1  2  1  0  1  0  2 -1  1  2  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1 -1  0  1 -1  1  0 -1  0  1 -1  0  1] (Indices: [0, 3, 5, 6, 8, 11, 13, 14, 17]), Candidate: [ 1  1  2 -1  2  1  0  1  0  1  1  0  2  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1 -1  0  0  1 -1  1  0 -1  0  1 -1  1] (Indices: [0, 3, 5, 6, 8, 12, 14, 15, 18]), Candidate: [ 1  1  2 -1  2  1  0  1  0  1  0  2  0  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1 -1  0  0  0  0  0  1  0 -1  1  0  0] (Indices: [0, 3, 5, 6, 8, 15, 16, 18, 19]), Candidate: [ 1  1  2 -1  2  1  0  1  0  1  0  1  1  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  1  0 -1  1 -1  0  0  0  1 -1  1  0] (Indices: [0, 3, 5, 6, 9, 10, 12, 17, 19]), Candidate: [ 1  1  2 -1  2  1  0  0  2  1 -1  2  0  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  1 -1  1  0 -1  0  1 -1  0  1 -1  1] (Indices: [0, 3, 5, 6, 9, 11, 12, 15, 18]), Candidate: [ 1  1  2 -1  2  1  0  0  2  0  1  1  0  1  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  1 -1  0  1  0 -1  1 -1  0  1 -1  1] (Indices: [0, 3, 5, 6, 9, 12, 13, 15, 18]), Candidate: [ 1  1  2 -1  2  1  0  0  2  0  0  2  1  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  1 -1  0  0  0  1  0  0 -1  0  1  0] (Indices: [0, 3, 5, 6, 9, 14, 15, 16, 19]), Candidate: [ 1  1  2 -1  2  1  0  0  2  0  0  1  1  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  0  1  0 -1  0  1  0 -1  1 -1  0  1] (Indices: [0, 3, 5, 6, 10, 11, 14, 15, 17]), Candidate: [ 1  1  2 -1  2  1  0  0  1  2  0  0  1  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  0  1 -1  1 -1  0  0  1  0  0 -1  1] (Indices: [0, 3, 5, 6, 10, 12, 16, 17, 18]), Candidate: [ 1  1  2 -1  2  1  0  0  1  2 -1  2  0  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  0  0  1  0  0 -1  0  1 -1  0  1  0] (Indices: [0, 3, 5, 6, 11, 12, 13, 16, 19]), Candidate: [ 1  1  2 -1  2  1  0  0  1  1  1  1  1  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  0  0  1 -1  0  1 -1  1  0  0 -1  1] (Indices: [0, 3, 5, 6, 11, 14, 16, 17, 18]), Candidate: [ 1  1  2 -1  2  1  0  0  1  1  1  0  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  0  0  0  0  1  0 -1  1  0  0 -1  1] (Indices: [0, 3, 5, 6, 13, 14, 16, 17, 18]), Candidate: [ 1  1  2 -1  2  1  0  0  1  1  0  1  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0  0  0 -1  0  0  0  0  0  0  1  0  0] (Indices: [0, 3, 5, 7, 8, 9, 10, 18, 19]), Candidate: [ 1  1  2 -1  2  0  2  0  1  1 -1  1  1  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0  0 -1  0  0  1  0  0 -1  0  0  0  1] (Indices: [0, 3, 5, 7, 8, 9, 13, 14, 15]), Candidate: [ 1  1  2 -1  2  0  2  0  1  0  0  1  2  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0 -1  1  0 -1  0  1 -1  0  1 -1  0  1] (Indices: [0, 3, 5, 7, 8, 10, 11, 14, 17]), Candidate: [ 1  1  2 -1  2  0  2  0  0  2  0  0  1  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0 -1  1 -1  0  0  1  0 -1  1 -1  0  1] (Indices: [0, 3, 5, 7, 8, 10, 14, 15, 17]), Candidate: [ 1  1  2 -1  2  0  2  0  0  2 -1  1  1  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0 -1  0  1 -1  1 -1  0  1 -1  1 -1  1] (Indices: [0, 3, 5, 7, 8, 11, 13, 16, 18]), Candidate: [ 1  1  2 -1  2  0  2  0  0  1  1  0  2  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0 -1  0  0  1 -1  0  1  0  0 -1  0  1] (Indices: [0, 3, 5, 7, 8, 12, 15, 16, 17]), Candidate: [ 1  1  2 -1  2  0  2  0  0  1  0  2  0  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  1  0  0  0 -1  0  0  0  0  1 -1  1] (Indices: [0, 3, 5, 7, 9, 10, 11, 12, 18]), Candidate: [ 1  1  2 -1  2  0  2 -1  2  1  0  1  0  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  1  0 -1  0  1 -1  1 -1  1 -1  0  1] (Indices: [0, 3, 5, 7, 9, 10, 13, 15, 17]), Candidate: [ 1  1  2 -1  2  0  2 -1  2  1 -1  1  2  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 58000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  1 -1  1 -1  1  0  0 -1  0  0  0  1] (Indices: [0, 3, 5, 7, 9, 11, 13, 14, 15]), Candidate: [ 1  1  2 -1  2  0  2 -1  2  0  1  0  2  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  1 -1  0  1 -1  1  0  0 -1  0  0  1] (Indices: [0, 3, 5, 7, 9, 12, 14, 15, 16]), Candidate: [ 1  1  2 -1  2  0  2 -1  2  0  0  2  0  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  1 -1  0  0  0  0  1  0  0  0 -1  1] (Indices: [0, 3, 5, 7, 9, 15, 16, 17, 18]), Candidate: [ 1  1  2 -1  2  0  2 -1  2  0  0  1  1  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  0  1  0 -1  0  1 -1  0  0  1  0  0] (Indices: [0, 3, 5, 7, 10, 11, 14, 18, 19]), Candidate: [ 1  1  2 -1  2  0  2 -1  1  2  0  0  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 58200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  0  1 -1  0  1  0 -1  1  0 -1  0  1] (Indices: [0, 3, 5, 7, 10, 13, 14, 16, 17]), Candidate: [ 1  1  2 -1  2  0  2 -1  1  2 -1  1  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 58250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  0  0  1  0 -1  1 -1  1  0 -1  0  1] (Indices: [0, 3, 5, 7, 11, 12, 14, 16, 17]), Candidate: [ 1  1  2 -1  2  0  2 -1  1  1  1  1  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 58300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  0  0  1 -1  0  0  0  1  0  0  0  0] (Indices: [0, 3, 5, 7, 11, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  2  0  2 -1  1  1  1  0  1  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  0  0  0  0  1 -1  0  1  0  0  0  0] (Indices: [0, 3, 5, 7, 13, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  2  0  2 -1  1  1  0  1  2  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1  0  0 -1  1 -1  0  0  1  0 -1  0  1] (Indices: [0, 3, 5, 8, 9, 10, 12, 16, 17]), Candidate: [ 1  1  2 -1  2  0  1  1  1  1 -1  2  0  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1  0 -1  1  0 -1  1 -1  0  0  1 -1  1] (Indices: [0, 3, 5, 8, 9, 11, 12, 14, 18]), Candidate: [ 1  1  2 -1  2  0  1  1  1  0  1  1  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1  0 -1  0  1  0  0 -1  0  0  1 -1  1] (Indices: [0, 3, 5, 8, 9, 12, 13, 14, 18]), Candidate: [ 1  1  2 -1  2  0  1  1  1  0  0  2  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1  0 -1  0  0  1 -1  0  1 -1  1  0  0] (Indices: [0, 3, 5, 8, 9, 13, 16, 18, 19]), Candidate: [ 1  1  2 -1  2  0  1  1  1  0  0  1  2  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1 -1  1  0 -1  1 -1  0  0  1  0 -1  1] (Indices: [0, 3, 5, 8, 10, 11, 13, 17, 18]), Candidate: [ 1  1  2 -1  2  0  1  1  0  2  0  0  2  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1 -1  1 -1  1 -1  0  1  0 -1  0  1  0] (Indices: [0, 3, 5, 8, 10, 12, 15, 16, 19]), Candidate: [ 1  1  2 -1  2  0  1  1  0  2 -1  2  0  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1 -1  0  1  0  0 -1  1 -1  0  1 -1  1] (Indices: [0, 3, 5, 8, 11, 12, 13, 15, 18]), Candidate: [ 1  1  2 -1  2  0  1  1  0  1  1  1  1  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1 -1  0  1 -1  0  1  0  0 -1  0  1  0] (Indices: [0, 3, 5, 8, 11, 14, 15, 16, 19]), Candidate: [ 1  1  2 -1  2  0  1  1  0  1  1  0  1  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1 -1  0  0  0  1  0  0  0 -1  0  1  0] (Indices: [0, 3, 5, 8, 13, 14, 15, 16, 19]), Candidate: [ 1  1  2 -1  2  0  1  1  0  1  0  1  2  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  1  0  0 -1  1 -1  0  1 -1  1 -1  1] (Indices: [0, 3, 5, 9, 10, 11, 13, 16, 18]), Candidate: [ 1  1  2 -1  2  0  1  0  2  1  0  0  2  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  1  0 -1  1 -1  0  1  0  0 -1  0  1] (Indices: [0, 3, 5, 9, 10, 12, 15, 16, 17]), Candidate: [ 1  1  2 -1  2  0  1  0  2  1 -1  2  0  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  1 -1  1  0  0 -1  1  0 -1  0  0  1] (Indices: [0, 3, 5, 9, 11, 12, 13, 15, 16]), Candidate: [ 1  1  2 -1  2  0  1  0  2  0  1  1  1  0  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  1 -1  1 -1  0  1  0  0  0 -1  0  1] (Indices: [0, 3, 5, 9, 11, 14, 15, 16, 17]), Candidate: [ 1  1  2 -1  2  0  1  0  2  0  1  0  1  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  1 -1  0  0  1  0  0  0  0 -1  0  1] (Indices: [0, 3, 5, 9, 13, 14, 15, 16, 17]), Candidate: [ 1  1  2 -1  2  0  1  0  2  0  0  1  2  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  0  1  0  0 -1  0  1 -1  1 -1  1  0] (Indices: [0, 3, 5, 10, 11, 12, 15, 17, 19]), Candidate: [ 1  1  2 -1  2  0  1  0  1  2  0  1  0  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  0  1 -1  1  0  0 -1  0  0  1  0  0] (Indices: [0, 3, 5, 10, 12, 13, 14, 18, 19]), Candidate: [ 1  1  2 -1  2  0  1  0  1  2 -1  2  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 59200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  0  0  1  0  0  0  0 -1  0  0  1  0] (Indices: [0, 3, 5, 11, 12, 13, 14, 15, 19]), Candidate: [ 1  1  2 -1  2  0  1  0  1  1  1  1  1  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  0  0  1 -1  0  1  0 -1  1  0  0  0] (Indices: [0, 3, 5, 11, 14, 15, 17, 18, 19]), Candidate: [ 1  1  2 -1  2  0  1  0  1  1  1  0  1  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0  0  0 -1  0  1 -1  0  0  0  1 -1  1] (Indices: [0, 3, 6, 7, 8, 9, 10, 13, 18]), Candidate: [ 1  1  2 -1  1  2  1  0  1  1 -1  1  2  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 59350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0  0 -1  0  1  0 -1  0  0  0  0  1  0] (Indices: [0, 3, 6, 7, 8, 9, 12, 13, 19]), Candidate: [ 1  1  2 -1  1  2  1  0  1  0  0  2  1  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0  0 -1  0  0  0  0  0  0  1  0  0  0] (Indices: [0, 3, 6, 7, 8, 9, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  2  1  0  1  0  0  1  1  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0 -1  1 -1  0  1  0  0 -1  0  0  0  1] (Indices: [0, 3, 6, 7, 8, 10, 13, 14, 15]), Candidate: [ 1  1  2 -1  1  2  1  0  0  2 -1  1  2  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 59500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0 -1  0  1  0 -1  0  0  1  0 -1  0  1] (Indices: [0, 3, 6, 7, 8, 11, 12, 16, 17]), Candidate: [ 1  1  2 -1  1  2  1  0  0  1  1  1  0  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0 -1  0  0  1  0 -1  0  1  0 -1  0  1] (Indices: [0, 3, 6, 7, 8, 12, 13, 16, 17]), Candidate: [ 1  1  2 -1  1  2  1  0  0  1  0  2  1  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0 -1  0  0  0  0  1  0 -1  1 -1  1  0] (Indices: [0, 3, 6, 7, 8, 14, 15, 17, 19]), Candidate: [ 1  1  2 -1  1  2  1  0  0  1  0  1  1  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  1  0 -1  1 -1  0  1  0 -1  0  0  1] (Indices: [0, 3, 6, 7, 9, 10, 12, 15, 16]), Candidate: [ 1  1  2 -1  1  2  1 -1  2  1 -1  2  0  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 59700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  1 -1  1  0  0 -1  0  0  0  0  1  0] (Indices: [0, 3, 6, 7, 9, 11, 12, 13, 19]), Candidate: [ 1  1  2 -1  1  2  1 -1  2  0  1  1  1  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 59750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  1 -1  1 -1  0  0  0  0  1  0  0  0] (Indices: [0, 3, 6, 7, 9, 11, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  2  1 -1  2  0  1  0  1  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 59800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  1 -1  0  0  1 -1  1 -1  1 -1  1  0] (Indices: [0, 3, 6, 7, 9, 13, 15, 17, 19]), Candidate: [ 1  1  2 -1  1  2  1 -1  2  0  0  1  2  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 59850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  0  1  0 -1  1 -1  1 -1  0  0  1  0] (Indices: [0, 3, 6, 7, 10, 11, 13, 15, 19]), Candidate: [ 1  1  2 -1  1  2  1 -1  1  2  0  0  2  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 59900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  0  1 -1  1 -1  1 -1  0  1 -1  1  0] (Indices: [0, 3, 6, 7, 10, 12, 14, 17, 19]), Candidate: [ 1  1  2 -1  1  2  1 -1  1  2 -1  2  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 59950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  0  0  1  0  0  0 -1  0  0  1 -1  1] (Indices: [0, 3, 6, 7, 11, 12, 13, 14, 18]), Candidate: [ 1  1  2 -1  1  2  1 -1  1  1  1  1  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 60000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  0  0  1 -1  1 -1  0  1 -1  1  0  0] (Indices: [0, 3, 6, 7, 11, 13, 16, 18, 19]), Candidate: [ 1  1  2 -1  1  2  1 -1  1  1  1  0  2  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 60050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  0  0  0  1 -1  0  1 -1  1  0  0  0] (Indices: [0, 3, 6, 7, 12, 15, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  2  1 -1  1  1  0  2  0  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 60100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1  0  0  0 -1  0  0  0  0  0  1  0  0] (Indices: [0, 3, 6, 8, 9, 10, 11, 18, 19]), Candidate: [ 1  1  2 -1  1  2  0  1  1  1  0  0  1  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1  0  0 -1  0  0  0  1 -1  1  0 -1  1] (Indices: [0, 3, 6, 8, 9, 10, 15, 17, 18]), Candidate: [ 1  1  2 -1  1  2  0  1  1  1 -1  1  1  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 60200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1  0 -1  1 -1  0  1 -1  0  1  0 -1  1] (Indices: [0, 3, 6, 8, 9, 11, 14, 17, 18]), Candidate: [ 1  1  2 -1  1  2  0  1  1  0  1  0  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 60250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1  0 -1  0  0  1  0  0 -1  0  1 -1  1] (Indices: [0, 3, 6, 8, 9, 13, 14, 15, 18]), Candidate: [ 1  1  2 -1  1  2  0  1  1  0  0  1  2  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1 -1  1  0  0 -1  0  0  1 -1  0  1  0] (Indices: [0, 3, 6, 8, 10, 11, 12, 16, 19]), Candidate: [ 1  1  2 -1  1  2  0  1  0  2  0  1  0  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1 -1  1 -1  1  0 -1  0  1 -1  0  1  0] (Indices: [0, 3, 6, 8, 10, 12, 13, 16, 19]), Candidate: [ 1  1  2 -1  1  2  0  1  0  2 -1  2  1  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 60400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1 -1  1 -1  0  0  1 -1  1  0  0 -1  1] (Indices: [0, 3, 6, 8, 10, 14, 16, 17, 18]), Candidate: [ 1  1  2 -1  1  2  0  1  0  2 -1  1  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 60450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1 -1  0  1 -1  1  0 -1  1 -1  0  1  0] (Indices: [0, 3, 6, 8, 11, 13, 14, 16, 19]), Candidate: [ 1  1  2 -1  1  2  0  1  0  1  1  0  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 60500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1 -1  0  0  1 -1  1  0  0 -1  1 -1  1] (Indices: [0, 3, 6, 8, 12, 14, 15, 16, 18]), Candidate: [ 1  1  2 -1  1  2  0  1  0  1  0  2  0  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  1  0  0  0 -1  0  0  1  0 -1  0  1] (Indices: [0, 3, 6, 9, 10, 11, 12, 16, 17]), Candidate: [ 1  1  2 -1  1  2  0  0  2  1  0  1  0  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  1  0 -1  1  0 -1  0  1  0 -1  0  1] (Indices: [0, 3, 6, 9, 10, 12, 13, 16, 17]), Candidate: [ 1  1  2 -1  1  2  0  0  2  1 -1  2  1  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 60650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  1  0 -1  0  0  1  0 -1  1 -1  1  0] (Indices: [0, 3, 6, 9, 10, 14, 15, 17, 19]), Candidate: [ 1  1  2 -1  1  2  0  0  2  1 -1  1  1  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 60700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  1 -1  1 -1  1  0 -1  1  0 -1  0  1] (Indices: [0, 3, 6, 9, 11, 13, 14, 16, 17]), Candidate: [ 1  1  2 -1  1  2  0  0  2  0  1  0  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 60750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  1 -1  0  1  0 -1  0  0  1  0  0  0] (Indices: [0, 3, 6, 9, 12, 13, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  2  0  0  2  0  0  2  1  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  0  1  0  0  0 -1  0  0  1 -1  1  0] (Indices: [0, 3, 6, 10, 11, 12, 13, 17, 19]), Candidate: [ 1  1  2 -1  1  2  0  0  1  2  0  1  1  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  0  1  0 -1  0  1 -1  1 -1  1  0  0] (Indices: [0, 3, 6, 10, 11, 14, 16, 18, 19]), Candidate: [ 1  1  2 -1  1  2  0  0  1  2  0  0  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 60900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  0  1 -1  0  1  0 -1  1 -1  1  0  0] (Indices: [0, 3, 6, 10, 13, 14, 16, 18, 19]), Candidate: [ 1  1  2 -1  1  2  0  0  1  2 -1  1  2  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 60950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  0  0  1 -1  1  0  0  0 -1  0  1  0] (Indices: [0, 3, 6, 11, 13, 14, 15, 16, 19]), Candidate: [ 1  1  2 -1  1  2  0  0  1  1  1  0  2  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0  0  0  0  0 -1  0  0  1 -1  0  0  1] (Indices: [0, 3, 7, 8, 9, 10, 11, 12, 16]), Candidate: [ 1  1  2 -1  1  1  2  0  1  1  0  1  0  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0  0  0 -1  0  1  0 -1  0  0  0  1  0] (Indices: [0, 3, 7, 8, 9, 10, 13, 14, 19]), Candidate: [ 1  1  2 -1  1  1  2  0  1  1 -1  1  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 61100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0  0 -1  1  0 -1  0  0  0  1 -1  1  0] (Indices: [0, 3, 7, 8, 9, 11, 12, 17, 19]), Candidate: [ 1  1  2 -1  1  1  2  0  1  0  1  1  0  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0  0 -1  0  1  0 -1  0  0  1 -1  1  0] (Indices: [0, 3, 7, 8, 9, 12, 13, 17, 19]), Candidate: [ 1  1  2 -1  1  1  2  0  1  0  0  2  1  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0  0 -1  0  0  0  1 -1  1 -1  1  0  0] (Indices: [0, 3, 7, 8, 9, 14, 16, 18, 19]), Candidate: [ 1  1  2 -1  1  1  2  0  1  0  0  1  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 61250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0 -1  1  0 -1  0  1 -1  0  1  0 -1  1] (Indices: [0, 3, 7, 8, 10, 11, 14, 17, 18]), Candidate: [ 1  1  2 -1  1  1  2  0  0  2  0  0  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 61300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0 -1  1 -1  0  1  0  0 -1  0  1 -1  1] (Indices: [0, 3, 7, 8, 10, 13, 14, 15, 18]), Candidate: [ 1  1  2 -1  1  1  2  0  0  2 -1  1  2  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 61350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0 -1  0  1  0 -1  1  0 -1  0  1 -1  1] (Indices: [0, 3, 7, 8, 11, 12, 14, 15, 18]), Candidate: [ 1  1  2 -1  1  1  2  0  0  1  1  1  0  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0 -1  0  1 -1  0  0  1  0 -1  1  0  0] (Indices: [0, 3, 7, 8, 11, 15, 16, 18, 19]), Candidate: [ 1  1  2 -1  1  1  2  0  0  1  1  0  1  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0 -1  0  0  0  1 -1  1  0 -1  1  0  0] (Indices: [0, 3, 7, 8, 13, 15, 16, 18, 19]), Candidate: [ 1  1  2 -1  1  1  2  0  0  1  0  1  2  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  1  0  0 -1  0  1 -1  1 -1  1 -1  1] (Indices: [0, 3, 7, 9, 10, 11, 14, 16, 18]), Candidate: [ 1  1  2 -1  1  1  2 -1  2  1  0  0  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 61550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  1  0 -1  0  1  0  0  0 -1  0  0  1] (Indices: [0, 3, 7, 9, 10, 13, 14, 15, 16]), Candidate: [ 1  1  2 -1  1  1  2 -1  2  1 -1  1  2  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 61600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  1 -1  1  0 -1  1  0  0 -1  0  0  1] (Indices: [0, 3, 7, 9, 11, 12, 14, 15, 16]), Candidate: [ 1  1  2 -1  1  1  2 -1  2  0  1  1  0  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 61650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  1 -1  1 -1  0  0  1  0  0  0 -1  1] (Indices: [0, 3, 7, 9, 11, 15, 16, 17, 18]), Candidate: [ 1  1  2 -1  1  1  2 -1  2  0  1  0  1  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 61700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  1 -1  0  0  1 -1  1  0  0  0 -1  1] (Indices: [0, 3, 7, 9, 13, 15, 16, 17, 18]), Candidate: [ 1  1  2 -1  1  1  2 -1  2  0  0  1  2  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 61750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  0  1  0 -1  1  0 -1  1  0 -1  0  1] (Indices: [0, 3, 7, 10, 11, 13, 14, 16, 17]), Candidate: [ 1  1  2 -1  1  1  2 -1  1  2  0  0  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 61800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  0  1 -1  1  0 -1  0  0  1  0  0  0] (Indices: [0, 3, 7, 10, 12, 13, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  1  2 -1  1  2 -1  2  1  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 61850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  0  0  1  0  0 -1  1 -1  1  0 -1  1] (Indices: [0, 3, 7, 11, 12, 13, 15, 17, 18]), Candidate: [ 1  1  2 -1  1  1  2 -1  1  1  1  1  1  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 61900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  0  0  0  1  0  0 -1  1  0 -1  1  0] (Indices: [0, 3, 7, 12, 13, 14, 16, 17, 19]), Candidate: [ 1  1  2 -1  1  1  2 -1  1  1  0  2  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 61950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1  0  0  0 -1  1 -1  1 -1  0  0  1  0] (Indices: [0, 3, 8, 9, 10, 11, 13, 15, 19]), Candidate: [ 1  1  2 -1  1  1  1  1  1  1  0  0  2  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1  0  0 -1  1 -1  1 -1  0  1 -1  1  0] (Indices: [0, 3, 8, 9, 10, 12, 14, 17, 19]), Candidate: [ 1  1  2 -1  1  1  1  1  1  1 -1  2  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 62050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1  0 -1  1  0  0  0 -1  0  0  1 -1  1] (Indices: [0, 3, 8, 9, 11, 12, 13, 14, 18]), Candidate: [ 1  1  2 -1  1  1  1  1  1  0  1  1  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 62100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1  0 -1  1 -1  1 -1  0  1 -1  1  0  0] (Indices: [0, 3, 8, 9, 11, 13, 16, 18, 19]), Candidate: [ 1  1  2 -1  1  1  1  1  1  0  1  0  2  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1  0 -1  0  1 -1  0  1 -1  1  0  0  0] (Indices: [0, 3, 8, 9, 12, 15, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  1  1  1  1  0  0  2  0  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1 -1  1  0  0 -1  0  1  0 -1  0  1  0] (Indices: [0, 3, 8, 10, 11, 12, 15, 16, 19]), Candidate: [ 1  1  2 -1  1  1  1  1  0  2  0  1  0  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1 -1  1 -1  1  0  0 -1  0  1  0 -1  1] (Indices: [0, 3, 8, 10, 12, 13, 14, 17, 18]), Candidate: [ 1  1  2 -1  1  1  1  1  0  2 -1  2  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 62300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1 -1  0  1  0  0  0  0 -1  1 -1  0  1] (Indices: [0, 3, 8, 11, 12, 13, 14, 15, 17]), Candidate: [ 1  1  2 -1  1  1  1  1  0  1  1  1  1  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1 -1  0  1 -1  0  1  0  0  0 -1  1  0] (Indices: [0, 3, 8, 11, 14, 15, 16, 17, 19]), Candidate: [ 1  1  2 -1  1  1  1  1  0  1  1  0  1  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  1  0  0  0 -1  1  0 -1  0  1 -1  1] (Indices: [0, 3, 9, 10, 11, 12, 14, 15, 18]), Candidate: [ 1  1  2 -1  1  1  1  0  2  1  0  1  0  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  1  0  0 -1  0  0  1  0 -1  1  0  0] (Indices: [0, 3, 9, 10, 11, 15, 16, 18, 19]), Candidate: [ 1  1  2 -1  1  1  1  0  2  1  0  0  1  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  1  0 -1  0  1 -1  1  0 -1  1  0  0] (Indices: [0, 3, 9, 10, 13, 15, 16, 18, 19]), Candidate: [ 1  1  2 -1  1  1  1  0  2  1 -1  1  2  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 62550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  1 -1  1 -1  1  0 -1  1  0  0 -1  1] (Indices: [0, 3, 9, 11, 13, 14, 16, 17, 18]), Candidate: [ 1  1  2 -1  1  1  1  0  2  0  1  0  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 62600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  0  1  0  0  0  0 -1  0  1  0 -1  1] (Indices: [0, 3, 10, 11, 12, 13, 14, 17, 18]), Candidate: [ 1  1  2 -1  1  1  1  0  1  2  0  1  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 62650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  0  1 -1  1  0  0  0  0 -1  1 -1  1] (Indices: [0, 3, 10, 12, 13, 14, 15, 16, 18]), Candidate: [ 1  1  2 -1  1  1  1  0  1  2 -1  2  1  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 62700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  0  0  1 -1  1  0  0  0 -1  1  0  0] (Indices: [0, 3, 11, 13, 14, 15, 16, 18, 19]), Candidate: [ 1  1  2 -1  1  1  1  0  1  1  1  0  2  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0  0 -1  0  0  0  0  1 -1  0  1 -1  1] (Indices: [0, 4, 5, 6, 7, 8, 9, 15, 18]), Candidate: [1 1 1 1 1 1 1 0 1 0 0 1 1 1 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 62800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0 -1  0  1  0 -1  0  0  0  0  0  1  0] (Indices: [0, 4, 5, 6, 7, 8, 11, 12, 19]), Candidate: [1 1 1 1 1 1 1 0 0 1 1 1 0 1 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 62850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0 -1  0  0  0  1 -1  1 -1  0  1 -1  1] (Indices: [0, 4, 5, 6, 7, 8, 13, 15, 18]), Candidate: [1 1 1 1 1 1 1 0 0 1 0 1 2 0 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 62900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  1  0 -1  0  0  1 -1  1 -1  0  0  1] (Indices: [0, 4, 5, 6, 7, 9, 10, 14, 16]), Candidate: [ 1  1  1  1  1  1  1 -1  2  1 -1  1  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 62950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  1 -1  0  1 -1  1 -1  0  1 -1  0  1] (Indices: [0, 4, 5, 6, 7, 9, 12, 14, 17]), Candidate: [ 1  1  1  1  1  1  1 -1  2  0  0  2  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 63000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  0  1  0  0 -1  0  1 -1  0  0  0  1] (Indices: [0, 4, 5, 6, 7, 10, 11, 12, 15]), Candidate: [ 1  1  1  1  1  1  1 -1  1  2  0  1  0  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  0  1 -1  0  1  0 -1  0  0  1 -1  1] (Indices: [0, 4, 5, 6, 7, 10, 13, 14, 18]), Candidate: [ 1  1  1  1  1  1  1 -1  1  2 -1  1  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 63100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  0  0  1  0 -1  0  0  0  1  0 -1  1] (Indices: [0, 4, 5, 6, 7, 11, 12, 17, 18]), Candidate: [ 1  1  1  1  1  1  1 -1  1  1  1  1  0  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  0  0  0  1  0 -1  0  0  1  0 -1  1] (Indices: [0, 4, 5, 6, 7, 12, 13, 17, 18]), Candidate: [ 1  1  1  1  1  1  1 -1  1  1  0  2  1  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  0  0  0  0  0  1 -1  1  0 -1  1  0] (Indices: [0, 4, 5, 6, 7, 14, 16, 17, 19]), Candidate: [ 1  1  1  1  1  1  1 -1  1  1  0  1  1  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 63250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1  0 -1  1  0 -1  0  0  0  0  0  1  0] (Indices: [0, 4, 5, 6, 8, 9, 11, 12, 19]), Candidate: [1 1 1 1 1 1 0 1 1 0 1 1 0 1 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 63300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1  0 -1  0  0  1 -1  1 -1  0  1 -1  1] (Indices: [0, 4, 5, 6, 8, 9, 13, 15, 18]), Candidate: [1 1 1 1 1 1 0 1 1 0 0 1 2 0 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 63350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1 -1  1  0 -1  0  0  0  1  0 -1  0  1] (Indices: [0, 4, 5, 6, 8, 10, 11, 16, 17]), Candidate: [1 1 1 1 1 1 0 1 0 2 0 0 1 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 63400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1 -1  1 -1  0  0  1 -1  0  1 -1  1  0] (Indices: [0, 4, 5, 6, 8, 10, 14, 17, 19]), Candidate: [ 1  1  1  1  1  1  0  1  0  2 -1  1  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 63450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1 -1  0  1 -1  0  1  0 -1  0  1 -1  1] (Indices: [0, 4, 5, 6, 8, 11, 14, 15, 18]), Candidate: [1 1 1 1 1 1 0 1 0 1 1 0 1 2 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 63500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1 -1  0  0  1 -1  0  0  1  0 -1  1  0] (Indices: [0, 4, 5, 6, 8, 12, 16, 17, 19]), Candidate: [1 1 1 1 1 1 0 1 0 1 0 2 0 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 63550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  1  0  0 -1  1 -1  0  0  0  0  1  0] (Indices: [0, 4, 5, 6, 9, 10, 11, 13, 19]), Candidate: [1 1 1 1 1 1 0 0 2 1 0 0 2 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 63600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  1  0 -1  0  1 -1  0  0  1 -1  1  0] (Indices: [0, 4, 5, 6, 9, 10, 13, 17, 19]), Candidate: [ 1  1  1  1  1  1  0  0  2  1 -1  1  2  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  1 -1  1 -1  1 -1  1 -1  0  1 -1  1] (Indices: [0, 4, 5, 6, 9, 11, 13, 15, 18]), Candidate: [1 1 1 1 1 1 0 0 2 0 1 0 2 0 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 63700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  1 -1  0  1 -1  1 -1  0  1  0 -1  1] (Indices: [0, 4, 5, 6, 9, 12, 14, 17, 18]), Candidate: [ 1  1  1  1  1  1  0  0  2  0  0  2  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  0  1  0  0  0 -1  0  1 -1  0  0  1] (Indices: [0, 4, 5, 6, 10, 11, 12, 13, 16]), Candidate: [1 1 1 1 1 1 0 0 1 2 0 1 1 0 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 63800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  0  1  0 -1  0  0  0  1  0  0 -1  1] (Indices: [0, 4, 5, 6, 10, 11, 16, 17, 18]), Candidate: [1 1 1 1 1 1 0 0 1 2 0 0 1 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 63850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  0  1 -1  0  1 -1  1  0 -1  1 -1  1] (Indices: [0, 4, 5, 6, 10, 13, 15, 16, 18]), Candidate: [ 1  1  1  1  1  1  0  0  1  2 -1  1  2  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  0  0  1  0 -1  0  1  0 -1  1 -1  1] (Indices: [0, 4, 5, 6, 11, 12, 15, 16, 18]), Candidate: [1 1 1 1 1 1 0 0 1 1 1 1 0 1 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 63950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  0  0  0  1  0  0 -1  1 -1  0  1  0] (Indices: [0, 4, 5, 6, 12, 13, 14, 16, 19]), Candidate: [ 1  1  1  1  1  1  0  0  1  1  0  2  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0  0  0  0  0 -1  0  0  0  0  0  0  1] (Indices: [0, 4, 5, 7, 8, 9, 10, 11, 12]), Candidate: [1 1 1 1 1 0 2 0 1 1 0 1 0 1 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 64050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0  0 -1  1 -1  0  1 -1  1 -1  0  0  1] (Indices: [0, 4, 5, 7, 8, 9, 11, 14, 16]), Candidate: [ 1  1  1  1  1  0  2  0  1  0  1  0  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0  0 -1  0  0  0  1  0  0 -1  0  0  1] (Indices: [0, 4, 5, 7, 8, 9, 14, 15, 16]), Candidate: [1 1 1 1 1 0 2 0 1 0 0 1 1 2 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 64150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0 -1  1 -1  1  0 -1  0  1 -1  0  0  1] (Indices: [0, 4, 5, 7, 8, 10, 12, 13, 16]), Candidate: [ 1  1  1  1  1  0  2  0  0  2 -1  2  1  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0 -1  1 -1  0  0  0  0  1  0  0 -1  1] (Indices: [0, 4, 5, 7, 8, 10, 16, 17, 18]), Candidate: [ 1  1  1  1  1  0  2  0  0  2 -1  1  1  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0 -1  0  1 -1  0  0  1  0  0 -1  0  1] (Indices: [0, 4, 5, 7, 8, 11, 15, 16, 17]), Candidate: [1 1 1 1 1 0 2 0 0 1 1 0 1 1 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 64300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0 -1  0  0  0  1  0 -1  1 -1  1 -1  1] (Indices: [0, 4, 5, 7, 8, 13, 14, 16, 18]), Candidate: [ 1  1  1  1  1  0  2  0  0  1  0  1  2  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  1  0  0 -1  0  0  1 -1  0  1 -1  1] (Indices: [0, 4, 5, 7, 9, 10, 11, 15, 18]), Candidate: [ 1  1  1  1  1  0  2 -1  2  1  0  0  1  1  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  1  0 -1  0  0  1 -1  1 -1  0  1  0] (Indices: [0, 4, 5, 7, 9, 10, 14, 16, 19]), Candidate: [ 1  1  1  1  1  0  2 -1  2  1 -1  1  1  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 64450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  1 -1  1 -1  0  1  0  0 -1  0  0  1] (Indices: [0, 4, 5, 7, 9, 11, 14, 15, 16]), Candidate: [ 1  1  1  1  1  0  2 -1  2  0  1  0  1  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  1 -1  0  1 -1  0  1 -1  0  1  0  0] (Indices: [0, 4, 5, 7, 9, 12, 15, 18, 19]), Candidate: [ 1  1  1  1  1  0  2 -1  2  0  0  2  0  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  0  1  0  0 -1  1 -1  0  0  0  1  0] (Indices: [0, 4, 5, 7, 10, 11, 12, 14, 19]), Candidate: [ 1  1  1  1  1  0  2 -1  1  2  0  1  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 64600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  0  1 -1  1  0  0 -1  0  0  0  1  0] (Indices: [0, 4, 5, 7, 10, 12, 13, 14, 19]), Candidate: [ 1  1  1  1  1  0  2 -1  1  2 -1  2  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 64650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  0  1 -1  0  1 -1  0  0  1  0  0  0] (Indices: [0, 4, 5, 7, 10, 13, 17, 18, 19]), Candidate: [ 1  1  1  1  1  0  2 -1  1  2 -1  1  2  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 64700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  0  0  1  0 -1  0  0  0  1  0  0  0] (Indices: [0, 4, 5, 7, 11, 12, 17, 18, 19]), Candidate: [ 1  1  1  1  1  0  2 -1  1  1  1  1  0  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  0  0  0  1  0 -1  1 -1  1 -1  1  0] (Indices: [0, 4, 5, 7, 12, 13, 15, 17, 19]), Candidate: [ 1  1  1  1  1  0  2 -1  1  1  0  2  1  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1  0  0  0 -1  1 -1  1 -1  0  0  0  1] (Indices: [0, 4, 5, 8, 9, 10, 11, 13, 15]), Candidate: [1 1 1 1 1 0 1 1 1 1 0 0 2 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 64850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1  0  0 -1  0  1 -1  0  1  0 -1  0  1] (Indices: [0, 4, 5, 8, 9, 10, 13, 16, 17]), Candidate: [ 1  1  1  1  1  0  1  1  1  1 -1  1  2  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1  0 -1  1 -1  1  0 -1  0  0  1 -1  1] (Indices: [0, 4, 5, 8, 9, 11, 13, 14, 18]), Candidate: [ 1  1  1  1  1  0  1  1  1  0  1  0  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1  0 -1  0  1 -1  1  0 -1  0  0  1  0] (Indices: [0, 4, 5, 8, 9, 12, 14, 15, 19]), Candidate: [1 1 1 1 1 0 1 1 1 0 0 2 0 2 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 65000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1  0 -1  0  0  0  0  1 -1  1  0  0  0] (Indices: [0, 4, 5, 8, 9, 15, 17, 18, 19]), Candidate: [1 1 1 1 1 0 1 1 1 0 0 1 1 1 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 65050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1 -1  1  0 -1  0  0  1  0 -1  0  1  0] (Indices: [0, 4, 5, 8, 10, 11, 15, 16, 19]), Candidate: [1 1 1 1 1 0 1 1 0 2 0 0 1 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 65100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1 -1  1 -1  0  1  0 -1  0  1  0 -1  1] (Indices: [0, 4, 5, 8, 10, 13, 14, 17, 18]), Candidate: [ 1  1  1  1  1  0  1  1  0  2 -1  1  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 65150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1 -1  0  1  0 -1  1 -1  0  1  0 -1  1] (Indices: [0, 4, 5, 8, 11, 12, 14, 17, 18]), Candidate: [ 1  1  1  1  1  0  1  1  0  1  1  1  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1 -1  0  0  1  0  0  0 -1  0  1 -1  1] (Indices: [0, 4, 5, 8, 12, 13, 14, 15, 18]), Candidate: [1 1 1 1 1 0 1 1 0 1 0 2 1 1 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 65250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1 -1  0  0  0  0  1  0  0 -1  1  0  0] (Indices: [0, 4, 5, 8, 14, 15, 16, 18, 19]), Candidate: [1 1 1 1 1 0 1 1 0 1 0 1 1 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 65300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  1  0  0 -1  0  0  1  0  0 -1  0  1] (Indices: [0, 4, 5, 9, 10, 11, 15, 16, 17]), Candidate: [1 1 1 1 1 0 1 0 2 1 0 0 1 1 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 65350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  1  0 -1  0  1  0 -1  1 -1  1 -1  1] (Indices: [0, 4, 5, 9, 10, 13, 14, 16, 18]), Candidate: [ 1  1  1  1  1  0  1  0  2  1 -1  1  2  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 65400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  1 -1  1  0 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 4, 5, 9, 11, 12, 14, 16, 18]), Candidate: [ 1  1  1  1  1  0  1  0  2  0  1  1  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  1 -1  0  1  0  0  0  0 -1  0  0  1] (Indices: [0, 4, 5, 9, 12, 13, 14, 15, 16]), Candidate: [1 1 1 1 1 0 1 0 2 0 0 2 1 1 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 65500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  1 -1  0  0  0  1  0  0  0  0 -1  1] (Indices: [0, 4, 5, 9, 14, 15, 16, 17, 18]), Candidate: [1 1 1 1 1 0 1 0 2 0 0 1 1 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 65550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  0  1  0 -1  1  0 -1  0  0  1  0  0] (Indices: [0, 4, 5, 10, 11, 13, 14, 18, 19]), Candidate: [ 1  1  1  1  1  0  1  0  1  2  0  0  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  0  1 -1  1 -1  1  0 -1  1 -1  1  0] (Indices: [0, 4, 5, 10, 12, 14, 15, 17, 19]), Candidate: [ 1  1  1  1  1  0  1  0  1  2 -1  2  0  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  0  0  1  0  0 -1  0  1 -1  1  0  0] (Indices: [0, 4, 5, 11, 12, 13, 16, 18, 19]), Candidate: [1 1 1 1 1 0 1 0 1 1 1 1 1 0 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 65700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  0  0  0  1  0 -1  1  0 -1  1  0  0] (Indices: [0, 4, 5, 12, 13, 15, 16, 18, 19]), Candidate: [1 1 1 1 1 0 1 0 1 1 0 2 1 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 65750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0  0  0 -1  0  0  0  0  0  1 -1  1  0] (Indices: [0, 4, 6, 7, 8, 9, 10, 17, 19]), Candidate: [ 1  1  1  1  0  2  1  0  1  1 -1  1  1  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0  0 -1  0  1 -1  0  0  0  0  1  0  0] (Indices: [0, 4, 6, 7, 8, 9, 12, 18, 19]), Candidate: [1 1 1 1 0 2 1 0 1 0 0 2 0 1 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 65850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0 -1  1  0 -1  0  1 -1  1 -1  0  0  1] (Indices: [0, 4, 6, 7, 8, 10, 11, 14, 16]), Candidate: [ 1  1  1  1  0  2  1  0  0  2  0  0  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0 -1  1 -1  0  0  1  0  0 -1  0  0  1] (Indices: [0, 4, 6, 7, 8, 10, 14, 15, 16]), Candidate: [ 1  1  1  1  0  2  1  0  0  2 -1  1  1  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0 -1  0  1 -1  1 -1  0  1  0 -1  0  1] (Indices: [0, 4, 6, 7, 8, 11, 13, 16, 17]), Candidate: [1 1 1 1 0 2 1 0 0 1 1 0 2 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 66000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0 -1  0  0  1 -1  1 -1  0  0  1  0  0] (Indices: [0, 4, 6, 7, 8, 12, 14, 18, 19]), Candidate: [ 1  1  1  1  0  2  1  0  0  1  0  2  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  1  0  0  0 -1  0  0  0  1 -1  0  1] (Indices: [0, 4, 6, 7, 9, 10, 11, 12, 17]), Candidate: [ 1  1  1  1  0  2  1 -1  2  1  0  1  0  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  1  0 -1  0  1 -1  1  0 -1  0  0  1] (Indices: [0, 4, 6, 7, 9, 10, 13, 15, 16]), Candidate: [ 1  1  1  1  0  2  1 -1  2  1 -1  1  2  0  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 66150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  1 -1  1  0 -1  0  0  0  0  1  0  0] (Indices: [0, 4, 6, 7, 9, 11, 12, 18, 19]), Candidate: [ 1  1  1  1  0  2  1 -1  2  0  1  1  0  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  1 -1  0  1  0 -1  0  0  0  1  0  0] (Indices: [0, 4, 6, 7, 9, 12, 13, 18, 19]), Candidate: [ 1  1  1  1  0  2  1 -1  2  0  0  2  1  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  1 -1  0  0  0  1 -1  0  1  0  0  0] (Indices: [0, 4, 6, 7, 9, 14, 17, 18, 19]), Candidate: [ 1  1  1  1  0  2  1 -1  2  0  0  1  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 66300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  0  1  0 -1  0  1 -1  0  1 -1  1  0] (Indices: [0, 4, 6, 7, 10, 11, 14, 17, 19]), Candidate: [ 1  1  1  1  0  2  1 -1  1  2  0  0  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 66350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  0  1 -1  0  1  0  0 -1  0  0  1  0] (Indices: [0, 4, 6, 7, 10, 13, 14, 15, 19]), Candidate: [ 1  1  1  1  0  2  1 -1  1  2 -1  1  2  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 66400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  0  0  1  0 -1  1  0 -1  0  0  1  0] (Indices: [0, 4, 6, 7, 11, 12, 14, 15, 19]), Candidate: [ 1  1  1  1  0  2  1 -1  1  1  1  1  0  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  0  0  1 -1  0  0  1 -1  1  0  0  0] (Indices: [0, 4, 6, 7, 11, 15, 17, 18, 19]), Candidate: [ 1  1  1  1  0  2  1 -1  1  1  1  0  1  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  0  0  0  0  1 -1  1 -1  1  0  0  0] (Indices: [0, 4, 6, 7, 13, 15, 17, 18, 19]), Candidate: [ 1  1  1  1  0  2  1 -1  1  1  0  1  2  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1  0  0 -1  1 -1  0  1 -1  0  0  1  0] (Indices: [0, 4, 6, 8, 9, 10, 12, 15, 19]), Candidate: [ 1  1  1  1  0  2  0  1  1  1 -1  2  0  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1  0 -1  1  0 -1  1 -1  0  1 -1  0  1] (Indices: [0, 4, 6, 8, 9, 11, 12, 14, 17]), Candidate: [ 1  1  1  1  0  2  0  1  1  0  1  1  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1  0 -1  0  1  0  0 -1  0  1 -1  0  1] (Indices: [0, 4, 6, 8, 9, 12, 13, 14, 17]), Candidate: [ 1  1  1  1  0  2  0  1  1  0  0  2  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1  0 -1  0  0  1 -1  0  1  0 -1  1  0] (Indices: [0, 4, 6, 8, 9, 13, 16, 17, 19]), Candidate: [1 1 1 1 0 2 0 1 1 0 0 1 2 0 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 66750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1 -1  1  0 -1  1 -1  0  1 -1  0  1  0] (Indices: [0, 4, 6, 8, 10, 11, 13, 16, 19]), Candidate: [1 1 1 1 0 2 0 1 0 2 0 0 2 0 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 66800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1 -1  1 -1  1 -1  0  1  0 -1  1 -1  1] (Indices: [0, 4, 6, 8, 10, 12, 15, 16, 18]), Candidate: [ 1  1  1  1  0  2  0  1  0  2 -1  2  0  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1 -1  0  1  0  0 -1  1 -1  1 -1  0  1] (Indices: [0, 4, 6, 8, 11, 12, 13, 15, 17]), Candidate: [1 1 1 1 0 2 0 1 0 1 1 1 1 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 66900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1 -1  0  1 -1  0  1  0  0 -1  1 -1  1] (Indices: [0, 4, 6, 8, 11, 14, 15, 16, 18]), Candidate: [1 1 1 1 0 2 0 1 0 1 1 0 1 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 66950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1 -1  0  0  0  1  0  0  0 -1  1 -1  1] (Indices: [0, 4, 6, 8, 13, 14, 15, 16, 18]), Candidate: [1 1 1 1 0 2 0 1 0 1 0 1 2 1 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 67000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  1  0  0 -1  1 -1  0  1  0 -1  0  1] (Indices: [0, 4, 6, 9, 10, 11, 13, 16, 17]), Candidate: [1 1 1 1 0 2 0 0 2 1 0 0 2 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 67050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  1  0 -1  1 -1  1 -1  0  0  1  0  0] (Indices: [0, 4, 6, 9, 10, 12, 14, 18, 19]), Candidate: [ 1  1  1  1  0  2  0  0  2  1 -1  2  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 67100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  1 -1  1  0  0  0 -1  0  0  0  1  0] (Indices: [0, 4, 6, 9, 11, 12, 13, 14, 19]), Candidate: [ 1  1  1  1  0  2  0  0  2  0  1  1  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  1 -1  1 -1  1 -1  0  0  1  0  0  0] (Indices: [0, 4, 6, 9, 11, 13, 17, 18, 19]), Candidate: [1 1 1 1 0 2 0 0 2 0 1 0 2 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 67200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  1 -1  0  1 -1  0  0  1  0  0  0  0] (Indices: [0, 4, 6, 9, 12, 16, 17, 18, 19]), Candidate: [1 1 1 1 0 2 0 0 2 0 0 2 0 1 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 67250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  0  1  0  0 -1  0  1 -1  1  0 -1  1] (Indices: [0, 4, 6, 10, 11, 12, 15, 17, 18]), Candidate: [1 1 1 1 0 2 0 0 1 2 0 1 0 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 67300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  0  1 -1  1  0  0 -1  0  1 -1  1  0] (Indices: [0, 4, 6, 10, 12, 13, 14, 17, 19]), Candidate: [ 1  1  1  1  0  2  0  0  1  2 -1  2  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 67350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  0  0  1  0  0  0  0 -1  0  1 -1  1] (Indices: [0, 4, 6, 11, 12, 13, 14, 15, 18]), Candidate: [1 1 1 1 0 2 0 0 1 1 1 1 1 1 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 67400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  0  0  1 -1  0  1  0  0 -1  1  0  0] (Indices: [0, 4, 6, 11, 14, 15, 16, 18, 19]), Candidate: [1 1 1 1 0 2 0 0 1 1 1 0 1 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 67450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0  0  0  0 -1  0  0  1  0 -1  0  0  1] (Indices: [0, 4, 7, 8, 9, 10, 11, 15, 16]), Candidate: [1 1 1 1 0 1 2 0 1 1 0 0 1 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 67500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0  0  0 -1  0  0  1 -1  1  0 -1  0  1] (Indices: [0, 4, 7, 8, 9, 10, 14, 16, 17]), Candidate: [ 1  1  1  1  0  1  2  0  1  1 -1  1  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 67550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0  0 -1  1 -1  1 -1  0  0  1 -1  1  0] (Indices: [0, 4, 7, 8, 9, 11, 13, 17, 19]), Candidate: [1 1 1 1 0 1 2 0 1 0 1 0 2 0 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 67600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0  0 -1  0  1 -1  0  1 -1  1  0 -1  1] (Indices: [0, 4, 7, 8, 9, 12, 15, 17, 18]), Candidate: [1 1 1 1 0 1 2 0 1 0 0 2 0 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 67650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0 -1  1  0  0 -1  1 -1  0  1 -1  0  1] (Indices: [0, 4, 7, 8, 10, 11, 12, 14, 17]), Candidate: [ 1  1  1  1  0  1  2  0  0  2  0  1  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0 -1  1 -1  1  0  0 -1  0  1 -1  0  1] (Indices: [0, 4, 7, 8, 10, 12, 13, 14, 17]), Candidate: [ 1  1  1  1  0  1  2  0  0  2 -1  2  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 67750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0 -1  1 -1  0  1 -1  0  1  0 -1  1  0] (Indices: [0, 4, 7, 8, 10, 13, 16, 17, 19]), Candidate: [ 1  1  1  1  0  1  2  0  0  2 -1  1  2  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0 -1  0  1  0 -1  0  0  1  0 -1  1  0] (Indices: [0, 4, 7, 8, 11, 12, 16, 17, 19]), Candidate: [1 1 1 1 0 1 2 0 0 1 1 1 0 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 67850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0 -1  0  0  1  0 -1  1  0 -1  0  1  0] (Indices: [0, 4, 7, 8, 12, 13, 15, 16, 19]), Candidate: [1 1 1 1 0 1 2 0 0 1 0 2 1 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 67900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  1  0  0  0 -1  1  0 -1  0  0  0  1] (Indices: [0, 4, 7, 9, 10, 11, 12, 14, 15]), Candidate: [ 1  1  1  1  0  1  2 -1  2  1  0  1  0  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  1  0 -1  1  0  0  0 -1  0  0  0  1] (Indices: [0, 4, 7, 9, 10, 12, 13, 14, 15]), Candidate: [ 1  1  1  1  0  1  2 -1  2  1 -1  2  1  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  1  0 -1  0  1 -1  1 -1  0  1  0  0] (Indices: [0, 4, 7, 9, 10, 13, 15, 18, 19]), Candidate: [ 1  1  1  1  0  1  2 -1  2  1 -1  1  2  0  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  1 -1  1  0 -1  0  1 -1  0  1  0  0] (Indices: [0, 4, 7, 9, 11, 12, 15, 18, 19]), Candidate: [ 1  1  1  1  0  1  2 -1  2  0  1  1  0  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  1 -1  0  1  0 -1  1  0  0 -1  0  1] (Indices: [0, 4, 7, 9, 12, 13, 15, 16, 17]), Candidate: [ 1  1  1  1  0  1  2 -1  2  0  0  2  1  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  0  1  0  0  0  0 -1  0  0  0  1  0] (Indices: [0, 4, 7, 10, 11, 12, 13, 14, 19]), Candidate: [ 1  1  1  1  0  1  2 -1  1  2  0  1  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  0  1  0 -1  1 -1  0  0  1  0  0  0] (Indices: [0, 4, 7, 10, 11, 13, 17, 18, 19]), Candidate: [ 1  1  1  1  0  1  2 -1  1  2  0  0  2  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  0  1 -1  1 -1  0  0  1  0  0  0  0] (Indices: [0, 4, 7, 10, 12, 16, 17, 18, 19]), Candidate: [ 1  1  1  1  0  1  2 -1  1  2 -1  2  0  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  0  0  1  0 -1  1 -1  1 -1  1  0  0] (Indices: [0, 4, 7, 11, 12, 14, 16, 18, 19]), Candidate: [ 1  1  1  1  0  1  2 -1  1  1  1  1  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  0  0  0  0  1  0  0  0  0 -1  1  0] (Indices: [0, 4, 7, 13, 14, 15, 16, 17, 19]), Candidate: [ 1  1  1  1  0  1  2 -1  1  1  0  1  2  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1  0  0  0 -1  0  1 -1  0  1 -1  1  0] (Indices: [0, 4, 8, 9, 10, 11, 14, 17, 19]), Candidate: [ 1  1  1  1  0  1  1  1  1  1  0  0  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1  0  0 -1  0  1  0  0 -1  0  0  1  0] (Indices: [0, 4, 8, 9, 10, 13, 14, 15, 19]), Candidate: [ 1  1  1  1  0  1  1  1  1  1 -1  1  2  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1  0 -1  1  0 -1  1  0 -1  0  0  1  0] (Indices: [0, 4, 8, 9, 11, 12, 14, 15, 19]), Candidate: [1 1 1 1 0 1 1 1 1 0 1 1 0 2 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 68550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1  0 -1  1 -1  0  0  1 -1  1  0  0  0] (Indices: [0, 4, 8, 9, 11, 15, 17, 18, 19]), Candidate: [1 1 1 1 0 1 1 1 1 0 1 0 1 1 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 68600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1  0 -1  0  0  1 -1  1 -1  1  0  0  0] (Indices: [0, 4, 8, 9, 13, 15, 17, 18, 19]), Candidate: [1 1 1 1 0 1 1 1 1 0 0 1 2 0 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 68650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1 -1  1  0 -1  1  0 -1  0  1  0 -1  1] (Indices: [0, 4, 8, 10, 11, 13, 14, 17, 18]), Candidate: [ 1  1  1  1  0  1  1  1  0  2  0  0  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1 -1  1 -1  1 -1  1  0  0 -1  0  1  0] (Indices: [0, 4, 8, 10, 12, 14, 15, 16, 19]), Candidate: [ 1  1  1  1  0  1  1  1  0  2 -1  2  0  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1 -1  0  1  0  0 -1  0  1  0  0 -1  1] (Indices: [0, 4, 8, 11, 12, 13, 16, 17, 18]), Candidate: [1 1 1 1 0 1 1 1 0 1 1 1 1 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 68800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1 -1  0  0  1  0 -1  1  0  0  0 -1  1] (Indices: [0, 4, 8, 12, 13, 15, 16, 17, 18]), Candidate: [1 1 1 1 0 1 1 1 0 1 0 2 1 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 68850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  1  0  0  0 -1  0  0  1  0 -1  1  0] (Indices: [0, 4, 9, 10, 11, 12, 16, 17, 19]), Candidate: [1 1 1 1 0 1 1 0 2 1 0 1 0 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 68900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  1  0 -1  1  0 -1  1  0 -1  0  1  0] (Indices: [0, 4, 9, 10, 12, 13, 15, 16, 19]), Candidate: [ 1  1  1  1  0  1  1  0  2  1 -1  2  1  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  1 -1  1  0  0  0 -1  1 -1  0  1  0] (Indices: [0, 4, 9, 11, 12, 13, 14, 16, 19]), Candidate: [ 1  1  1  1  0  1  1  0  2  0  1  1  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  1 -1  0  1  0  0  0  0  0 -1  0  1] (Indices: [0, 4, 9, 12, 13, 14, 15, 16, 17]), Candidate: [1 1 1 1 0 1 1 0 2 0 0 2 1 1 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 69050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  0  1  0  0 -1  1  0  0 -1  0  1  0] (Indices: [0, 4, 10, 11, 12, 14, 15, 16, 19]), Candidate: [1 1 1 1 0 1 1 0 1 2 0 1 0 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 69100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  0  1 -1  1 -1  1  0  0  0 -1  1  0] (Indices: [0, 4, 10, 12, 14, 15, 16, 17, 19]), Candidate: [ 1  1  1  1  0  1  1  0  1  2 -1  2  0  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0  0  0  0 -1  0  1 -1  0  0  0  0  1] (Indices: [0, 5, 6, 7, 8, 9, 10, 11, 14]), Candidate: [ 1  1  1  0  2  1  1  0  1  1  0  0  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0  0 -1  1 -1  0  1 -1  0  0  1 -1  1] (Indices: [0, 5, 6, 7, 8, 9, 11, 14, 18]), Candidate: [ 1  1  1  0  2  1  1  0  1  0  1  0  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0  0 -1  0  0  0  1  0 -1  0  1 -1  1] (Indices: [0, 5, 6, 7, 8, 9, 14, 15, 18]), Candidate: [1 1 1 0 2 1 1 0 1 0 0 1 1 2 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 69300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0 -1  1 -1  1  0 -1  0  0  0  1 -1  1] (Indices: [0, 5, 6, 7, 8, 10, 12, 13, 18]), Candidate: [ 1  1  1  0  2  1  1  0  0  2 -1  2  1  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0 -1  1 -1  0  0  0  0  1 -1  1  0  0] (Indices: [0, 5, 6, 7, 8, 10, 16, 18, 19]), Candidate: [ 1  1  1  0  2  1  1  0  0  2 -1  1  1  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0 -1  0  1 -1  0  0  1  0 -1  0  1  0] (Indices: [0, 5, 6, 7, 8, 11, 15, 16, 19]), Candidate: [1 1 1 0 2 1 1 0 0 1 1 0 1 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 69450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0 -1  0  0  0  1  0 -1  0  1  0 -1  1] (Indices: [0, 5, 6, 7, 8, 13, 14, 17, 18]), Candidate: [ 1  1  1  0  2  1  1  0  0  1  0  1  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  1  0  0 -1  0  0  0  1  0 -1  0  1] (Indices: [0, 5, 6, 7, 9, 10, 11, 16, 17]), Candidate: [ 1  1  1  0  2  1  1 -1  2  1  0  0  1  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  1  0 -1  0  0  1 -1  0  1 -1  1  0] (Indices: [0, 5, 6, 7, 9, 10, 14, 17, 19]), Candidate: [ 1  1  1  0  2  1  1 -1  2  1 -1  1  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 69600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  1 -1  1 -1  0  1  0 -1  0  1 -1  1] (Indices: [0, 5, 6, 7, 9, 11, 14, 15, 18]), Candidate: [ 1  1  1  0  2  1  1 -1  2  0  1  0  1  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  1 -1  0  1 -1  0  0  1  0 -1  1  0] (Indices: [0, 5, 6, 7, 9, 12, 16, 17, 19]), Candidate: [ 1  1  1  0  2  1  1 -1  2  0  0  2  0  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  0  1  0  0 -1  0  1 -1  1 -1  0  1] (Indices: [0, 5, 6, 7, 10, 11, 12, 15, 17]), Candidate: [ 1  1  1  0  2  1  1 -1  1  2  0  1  0  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  0  1 -1  1  0 -1  1 -1  1 -1  0  1] (Indices: [0, 5, 6, 7, 10, 12, 13, 15, 17]), Candidate: [ 1  1  1  0  2  1  1 -1  1  2 -1  2  1  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 69800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  0  1 -1  0  0  1  0  0 -1  1 -1  1] (Indices: [0, 5, 6, 7, 10, 14, 15, 16, 18]), Candidate: [ 1  1  1  0  2  1  1 -1  1  2 -1  1  1  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 69850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  0  0  1 -1  1  0  0 -1  1 -1  0  1] (Indices: [0, 5, 6, 7, 11, 13, 14, 15, 17]), Candidate: [ 1  1  1  0  2  1  1 -1  1  1  1  0  2  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  0  0  0  1  0 -1  0  1  0  0 -1  1] (Indices: [0, 5, 6, 7, 12, 13, 16, 17, 18]), Candidate: [ 1  1  1  0  2  1  1 -1  1  1  0  2  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1  0  0  0 -1  1 -1  0  0  1 -1  0  1] (Indices: [0, 5, 6, 8, 9, 10, 11, 13, 17]), Candidate: [1 1 1 0 2 1 0 1 1 1 0 0 2 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 70000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1  0  0 -1  0  1 -1  0  1 -1  0  1  0] (Indices: [0, 5, 6, 8, 9, 10, 13, 16, 19]), Candidate: [ 1  1  1  0  2  1  0  1  1  1 -1  1  2  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1  0 -1  1 -1  1 -1  1  0 -1  0  0  1] (Indices: [0, 5, 6, 8, 9, 11, 13, 15, 16]), Candidate: [1 1 1 0 2 1 0 1 1 0 1 0 2 0 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 70100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1  0 -1  0  1 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 5, 6, 8, 9, 12, 14, 16, 18]), Candidate: [ 1  1  1  0  2  1  0  1  1  0  0  2  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1 -1  1  0  0  0  0 -1  0  0  0  0  1] (Indices: [0, 5, 6, 8, 10, 11, 12, 13, 14]), Candidate: [ 1  1  1  0  2  1  0  1  0  2  0  1  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1 -1  1  0 -1  0  0  1 -1  1 -1  1  0] (Indices: [0, 5, 6, 8, 10, 11, 15, 17, 19]), Candidate: [1 1 1 0 2 1 0 1 0 2 0 0 1 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 70250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1 -1  1 -1  0  1  0 -1  0  0  1  0  0] (Indices: [0, 5, 6, 8, 10, 13, 14, 18, 19]), Candidate: [ 1  1  1  0  2  1  0  1  0  2 -1  1  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 70300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1 -1  0  1  0 -1  1 -1  0  0  1  0  0] (Indices: [0, 5, 6, 8, 11, 12, 14, 18, 19]), Candidate: [ 1  1  1  0  2  1  0  1  0  1  1  1  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1 -1  0  0  1  0  0 -1  1  0 -1  0  1] (Indices: [0, 5, 6, 8, 12, 13, 14, 16, 17]), Candidate: [ 1  1  1  0  2  1  0  1  0  1  0  2  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1 -1  0  0  0  0  1 -1  1  0  0  0  0] (Indices: [0, 5, 6, 8, 14, 16, 17, 18, 19]), Candidate: [ 1  1  1  0  2  1  0  1  0  1  0  1  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  1  0  0 -1  0  0  1  0 -1  0  1  0] (Indices: [0, 5, 6, 9, 10, 11, 15, 16, 19]), Candidate: [1 1 1 0 2 1 0 0 2 1 0 0 1 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 70500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  1  0 -1  0  1  0 -1  0  1  0 -1  1] (Indices: [0, 5, 6, 9, 10, 13, 14, 17, 18]), Candidate: [ 1  1  1  0  2  1  0  0  2  1 -1  1  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 70550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  1 -1  1  0 -1  1 -1  0  1  0 -1  1] (Indices: [0, 5, 6, 9, 11, 12, 14, 17, 18]), Candidate: [ 1  1  1  0  2  1  0  0  2  0  1  1  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  1 -1  0  1  0  0  0 -1  0  1 -1  1] (Indices: [0, 5, 6, 9, 12, 13, 14, 15, 18]), Candidate: [1 1 1 0 2 1 0 0 2 0 0 2 1 1 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 70650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  1 -1  0  0  0  1  0  0 -1  1  0  0] (Indices: [0, 5, 6, 9, 14, 15, 16, 18, 19]), Candidate: [1 1 1 0 2 1 0 0 2 0 0 1 1 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 70700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  0  1  0 -1  1 -1  1  0 -1  1 -1  1] (Indices: [0, 5, 6, 10, 11, 13, 15, 16, 18]), Candidate: [1 1 1 0 2 1 0 0 1 2 0 0 2 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 70750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  0  1 -1  1 -1  1 -1  1  0  0 -1  1] (Indices: [0, 5, 6, 10, 12, 14, 16, 17, 18]), Candidate: [ 1  1  1  0  2  1  0  0  1  2 -1  2  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 70800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  0  0  1  0 -1  1  0  0  0 -1  0  1] (Indices: [0, 5, 6, 11, 12, 14, 15, 16, 17]), Candidate: [1 1 1 0 2 1 0 0 1 1 1 1 0 2 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 70850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  0  0  0  1  0 -1  0  1  0  0  0  0] (Indices: [0, 5, 6, 12, 13, 16, 17, 18, 19]), Candidate: [1 1 1 0 2 1 0 0 1 1 0 2 1 0 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 70900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0  0  0 -1  1 -1  1 -1  0  1 -1  0  1] (Indices: [0, 5, 7, 8, 9, 10, 12, 14, 17]), Candidate: [ 1  1  1  0  2  0  2  0  1  1 -1  2  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 70950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0  0 -1  1  0  0 -1  0  1 -1  0  0  1] (Indices: [0, 5, 7, 8, 9, 11, 12, 13, 16]), Candidate: [1 1 1 0 2 0 2 0 1 0 1 1 1 0 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 71000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0  0 -1  1 -1  0  0  0  1  0  0 -1  1] (Indices: [0, 5, 7, 8, 9, 11, 16, 17, 18]), Candidate: [1 1 1 0 2 0 2 0 1 0 1 0 1 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 71050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0  0 -1  0  0  1 -1  1  0 -1  1 -1  1] (Indices: [0, 5, 7, 8, 9, 13, 15, 16, 18]), Candidate: [1 1 1 0 2 0 2 0 1 0 0 1 2 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 71100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0 -1  1  0 -1  1 -1  1  0 -1  0  0  1] (Indices: [0, 5, 7, 8, 10, 11, 13, 15, 16]), Candidate: [1 1 1 0 2 0 2 0 0 2 0 0 2 0 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 71150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0 -1  1 -1  1 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 5, 7, 8, 10, 12, 14, 16, 18]), Candidate: [ 1  1  1  0  2  0  2  0  0  2 -1  2  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 71200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0 -1  0  1  0  0  0  0 -1  0  0  0  1] (Indices: [0, 5, 7, 8, 11, 12, 13, 14, 15]), Candidate: [1 1 1 0 2 0 2 0 0 1 1 1 1 1 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 71250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0 -1  0  1 -1  1 -1  1 -1  0  1  0  0] (Indices: [0, 5, 7, 8, 11, 13, 15, 18, 19]), Candidate: [1 1 1 0 2 0 2 0 0 1 1 0 2 0 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 71300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0 -1  0  0  1 -1  0  1  0  0  0 -1  1] (Indices: [0, 5, 7, 8, 12, 15, 16, 17, 18]), Candidate: [1 1 1 0 2 0 2 0 0 1 0 2 0 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 71350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  1  0  0 -1  1  0 -1  0  0  1 -1  1] (Indices: [0, 5, 7, 9, 10, 11, 13, 14, 18]), Candidate: [ 1  1  1  0  2  0  2 -1  2  1  0  0  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 71400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  1  0 -1  1 -1  1  0 -1  0  0  1  0] (Indices: [0, 5, 7, 9, 10, 12, 14, 15, 19]), Candidate: [ 1  1  1  0  2  0  2 -1  2  1 -1  2  0  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 71450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  1  0 -1  0  0  0  1 -1  1  0  0  0] (Indices: [0, 5, 7, 9, 10, 15, 17, 18, 19]), Candidate: [ 1  1  1  0  2  0  2 -1  2  1 -1  1  1  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 71500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  1 -1  1 -1  1 -1  1 -1  1  0 -1  1] (Indices: [0, 5, 7, 9, 11, 13, 15, 17, 18]), Candidate: [ 1  1  1  0  2  0  2 -1  2  0  1  0  2  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  1 -1  0  1 -1  1 -1  1 -1  1  0  0] (Indices: [0, 5, 7, 9, 12, 14, 16, 18, 19]), Candidate: [ 1  1  1  0  2  0  2 -1  2  0  0  2  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 71600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  0  1  0  0 -1  1 -1  0  1  0 -1  1] (Indices: [0, 5, 7, 10, 11, 12, 14, 17, 18]), Candidate: [ 1  1  1  0  2  0  2 -1  1  2  0  1  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 71650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  0  1 -1  1  0  0  0 -1  0  1 -1  1] (Indices: [0, 5, 7, 10, 12, 13, 14, 15, 18]), Candidate: [ 1  1  1  0  2  0  2 -1  1  2 -1  2  1  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 71700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  0  1 -1  0  0  1  0  0 -1  1  0  0] (Indices: [0, 5, 7, 10, 14, 15, 16, 18, 19]), Candidate: [ 1  1  1  0  2  0  2 -1  1  2 -1  1  1  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 71750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  0  0  1 -1  1 -1  1  0  0 -1  1  0] (Indices: [0, 5, 7, 11, 13, 15, 16, 17, 19]), Candidate: [ 1  1  1  0  2  0  2 -1  1  1  1  0  2  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1  0  0  0  0 -1  0  1 -1  1 -1  0  1] (Indices: [0, 5, 8, 9, 10, 11, 12, 15, 17]), Candidate: [1 1 1 0 2 0 1 1 1 1 0 1 0 1 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 71850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1  0  0 -1  1  0 -1  1 -1  1 -1  0  1] (Indices: [0, 5, 8, 9, 10, 12, 13, 15, 17]), Candidate: [ 1  1  1  0  2  0  1  1  1  1 -1  2  1  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1  0  0 -1  0  0  1  0  0 -1  1 -1  1] (Indices: [0, 5, 8, 9, 10, 14, 15, 16, 18]), Candidate: [ 1  1  1  0  2  0  1  1  1  1 -1  1  1  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1  0 -1  1 -1  1  0  0 -1  1 -1  0  1] (Indices: [0, 5, 8, 9, 11, 13, 14, 15, 17]), Candidate: [1 1 1 0 2 0 1 1 1 0 1 0 2 1 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 72000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1  0 -1  0  1  0 -1  0  1  0  0 -1  1] (Indices: [0, 5, 8, 9, 12, 13, 16, 17, 18]), Candidate: [1 1 1 0 2 0 1 1 1 0 0 2 1 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 72050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1 -1  1  0  0  0 -1  0  1 -1  1 -1  1] (Indices: [0, 5, 8, 10, 11, 12, 13, 16, 18]), Candidate: [1 1 1 0 2 0 1 1 0 2 0 1 1 0 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 72100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1 -1  1  0 -1  0  1  0 -1  0  1  0  0] (Indices: [0, 5, 8, 10, 11, 14, 15, 18, 19]), Candidate: [1 1 1 0 2 0 1 1 0 2 0 0 1 2 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 72150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1 -1  1 -1  0  1  0  0 -1  0  1  0  0] (Indices: [0, 5, 8, 10, 13, 14, 15, 18, 19]), Candidate: [ 1  1  1  0  2  0  1  1  0  2 -1  1  2  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1 -1  0  1  0 -1  0  0  1  0  0  0  0] (Indices: [0, 5, 8, 11, 12, 16, 17, 18, 19]), Candidate: [1 1 1 0 2 0 1 1 0 1 1 1 0 1 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 72250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  1  0  0  0  0  0  0 -1  0  0  0  1] (Indices: [0, 5, 9, 10, 11, 12, 13, 14, 15]), Candidate: [1 1 1 0 2 0 1 0 2 1 0 1 1 1 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 72300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  1  0  0 -1  1 -1  1 -1  0  1  0  0] (Indices: [0, 5, 9, 10, 11, 13, 15, 18, 19]), Candidate: [1 1 1 0 2 0 1 0 2 1 0 0 2 0 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 72350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  1  0 -1  1 -1  0  1  0  0  0 -1  1] (Indices: [0, 5, 9, 10, 12, 15, 16, 17, 18]), Candidate: [ 1  1  1  0  2  0  1  0  2  1 -1  2  0  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  1 -1  1  0 -1  1  0 -1  1 -1  1  0] (Indices: [0, 5, 9, 11, 12, 14, 15, 17, 19]), Candidate: [1 1 1 0 2 0 1 0 2 0 1 1 0 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 72450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  1 -1  0  1 -1  1  0 -1  1  0  0  0] (Indices: [0, 5, 9, 12, 14, 15, 17, 18, 19]), Candidate: [1 1 1 0 2 0 1 0 2 0 0 2 0 2 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 72500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  0  1  0 -1  1  0  0 -1  0  1  0  0] (Indices: [0, 5, 10, 11, 13, 14, 15, 18, 19]), Candidate: [1 1 1 0 2 0 1 0 1 2 0 0 2 1 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 72550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  0  0  1  0  0  0 -1  1  0  0 -1  1] (Indices: [0, 5, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 1  1  1  0  2  0  1  0  1  1  1  1  1  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0  0  0  0 -1  0  0  1 -1  0  1 -1  1] (Indices: [0, 6, 7, 8, 9, 10, 11, 15, 18]), Candidate: [1 1 1 0 1 2 1 0 1 1 0 0 1 1 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 72650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0  0  0 -1  0  0  1 -1  1 -1  0  1  0] (Indices: [0, 6, 7, 8, 9, 10, 14, 16, 19]), Candidate: [ 1  1  1  0  1  2  1  0  1  1 -1  1  1  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 72700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0  0 -1  1 -1  0  1  0  0 -1  0  0  1] (Indices: [0, 6, 7, 8, 9, 11, 14, 15, 16]), Candidate: [1 1 1 0 1 2 1 0 1 0 1 0 1 2 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 72750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0  0 -1  0  1 -1  0  1 -1  0  1  0  0] (Indices: [0, 6, 7, 8, 9, 12, 15, 18, 19]), Candidate: [1 1 1 0 1 2 1 0 1 0 0 2 0 1 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 72800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0 -1  1  0  0 -1  1 -1  0  0  0  1  0] (Indices: [0, 6, 7, 8, 10, 11, 12, 14, 19]), Candidate: [ 1  1  1  0  1  2  1  0  0  2  0  1  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0 -1  1 -1  1  0  0 -1  0  0  0  1  0] (Indices: [0, 6, 7, 8, 10, 12, 13, 14, 19]), Candidate: [ 1  1  1  0  1  2  1  0  0  2 -1  2  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 72900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0 -1  1 -1  0  1 -1  0  0  1  0  0  0] (Indices: [0, 6, 7, 8, 10, 13, 17, 18, 19]), Candidate: [ 1  1  1  0  1  2  1  0  0  2 -1  1  2  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0 -1  0  1  0 -1  0  0  0  1  0  0  0] (Indices: [0, 6, 7, 8, 11, 12, 17, 18, 19]), Candidate: [1 1 1 0 1 2 1 0 0 1 1 1 0 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 73000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0 -1  0  0  1  0 -1  1 -1  1 -1  1  0] (Indices: [0, 6, 7, 8, 12, 13, 15, 17, 19]), Candidate: [1 1 1 0 1 2 1 0 0 1 0 2 1 0 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 73050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  1  0  0  0 -1  1 -1  0  1 -1  0  1] (Indices: [0, 6, 7, 9, 10, 11, 12, 14, 17]), Candidate: [ 1  1  1  0  1  2  1 -1  2  1  0  1  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 73100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  1  0 -1  1  0  0 -1  0  1 -1  0  1] (Indices: [0, 6, 7, 9, 10, 12, 13, 14, 17]), Candidate: [ 1  1  1  0  1  2  1 -1  2  1 -1  2  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 73150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  1  0 -1  0  1 -1  0  1  0 -1  1  0] (Indices: [0, 6, 7, 9, 10, 13, 16, 17, 19]), Candidate: [ 1  1  1  0  1  2  1 -1  2  1 -1  1  2  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 73200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  1 -1  1  0 -1  0  0  1  0 -1  1  0] (Indices: [0, 6, 7, 9, 11, 12, 16, 17, 19]), Candidate: [ 1  1  1  0  1  2  1 -1  2  0  1  1  0  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  1 -1  0  1  0 -1  1  0 -1  0  1  0] (Indices: [0, 6, 7, 9, 12, 13, 15, 16, 19]), Candidate: [ 1  1  1  0  1  2  1 -1  2  0  0  2  1  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  0  1  0  0  0 -1  1 -1  1 -1  0  1] (Indices: [0, 6, 7, 10, 11, 12, 13, 15, 17]), Candidate: [ 1  1  1  0  1  2  1 -1  1  2  0  1  1  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  0  1  0 -1  0  1  0  0 -1  1 -1  1] (Indices: [0, 6, 7, 10, 11, 14, 15, 16, 18]), Candidate: [ 1  1  1  0  1  2  1 -1  1  2  0  0  1  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  0  1 -1  0  1  0  0  0 -1  1 -1  1] (Indices: [0, 6, 7, 10, 13, 14, 15, 16, 18]), Candidate: [ 1  1  1  0  1  2  1 -1  1  2 -1  1  2  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 73450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  0  0  1  0 -1  0  1  0  0  0 -1  1] (Indices: [0, 6, 7, 11, 12, 15, 16, 17, 18]), Candidate: [ 1  1  1  0  1  2  1 -1  1  1  1  1  0  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  0  0  0  0  1  0  0 -1  1  0  0  0] (Indices: [0, 6, 7, 13, 14, 15, 17, 18, 19]), Candidate: [ 1  1  1  0  1  2  1 -1  1  1  0  1  2  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1  0  0  0 -1  0  0  1  0  0 -1  0  1] (Indices: [0, 6, 8, 9, 10, 11, 15, 16, 17]), Candidate: [1 1 1 0 1 2 0 1 1 1 0 0 1 1 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 73600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1  0  0 -1  0  1  0 -1  1 -1  1 -1  1] (Indices: [0, 6, 8, 9, 10, 13, 14, 16, 18]), Candidate: [ 1  1  1  0  1  2  0  1  1  1 -1  1  2  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 73650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1  0 -1  1  0 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 6, 8, 9, 11, 12, 14, 16, 18]), Candidate: [ 1  1  1  0  1  2  0  1  1  0  1  1  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1  0 -1  0  1  0  0  0  0 -1  0  0  1] (Indices: [0, 6, 8, 9, 12, 13, 14, 15, 16]), Candidate: [1 1 1 0 1 2 0 1 1 0 0 2 1 1 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 73750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1  0 -1  0  0  0  1  0  0  0  0 -1  1] (Indices: [0, 6, 8, 9, 14, 15, 16, 17, 18]), Candidate: [1 1 1 0 1 2 0 1 1 0 0 1 1 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 73800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1 -1  1  0 -1  1  0 -1  0  0  1  0  0] (Indices: [0, 6, 8, 10, 11, 13, 14, 18, 19]), Candidate: [ 1  1  1  0  1  2  0  1  0  2  0  0  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1 -1  1 -1  1 -1  1  0 -1  1 -1  1  0] (Indices: [0, 6, 8, 10, 12, 14, 15, 17, 19]), Candidate: [ 1  1  1  0  1  2  0  1  0  2 -1  2  0  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1 -1  0  1  0  0 -1  0  1 -1  1  0  0] (Indices: [0, 6, 8, 11, 12, 13, 16, 18, 19]), Candidate: [1 1 1 0 1 2 0 1 0 1 1 1 1 0 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 73950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1 -1  0  0  1  0 -1  1  0 -1  1  0  0] (Indices: [0, 6, 8, 12, 13, 15, 16, 18, 19]), Candidate: [1 1 1 0 1 2 0 1 0 1 0 2 1 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 74000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  1  0  0  0 -1  0  0  0  1  0  0  0] (Indices: [0, 6, 9, 10, 11, 12, 17, 18, 19]), Candidate: [1 1 1 0 1 2 0 0 2 1 0 1 0 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 74050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  1  0 -1  1  0 -1  1 -1  1 -1  1  0] (Indices: [0, 6, 9, 10, 12, 13, 15, 17, 19]), Candidate: [ 1  1  1  0  1  2  0  0  2  1 -1  2  1  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  1 -1  1  0  0  0 -1  0  1 -1  1  0] (Indices: [0, 6, 9, 11, 12, 13, 14, 17, 19]), Candidate: [ 1  1  1  0  1  2  0  0  2  0  1  1  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  1 -1  0  1  0  0  0  0 -1  0  1  0] (Indices: [0, 6, 9, 12, 13, 14, 15, 16, 19]), Candidate: [1 1 1 0 1 2 0 0 2 0 0 2 1 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 74200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  0  1  0  0 -1  1  0 -1  1 -1  1  0] (Indices: [0, 6, 10, 11, 12, 14, 15, 17, 19]), Candidate: [1 1 1 0 1 2 0 0 1 2 0 1 0 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 74250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  0  1 -1  1 -1  1  0 -1  1  0  0  0] (Indices: [0, 6, 10, 12, 14, 15, 17, 18, 19]), Candidate: [ 1  1  1  0  1  2  0  0  1  2 -1  2  0  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0  0  0  0  0  0 -1  0  0  0  1 -1  1] (Indices: [0, 7, 8, 9, 10, 11, 12, 13, 18]), Candidate: [1 1 1 0 1 1 2 0 1 1 0 1 1 0 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 74350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0  0  0  0 -1  0  0  0  1 -1  1  0  0] (Indices: [0, 7, 8, 9, 10, 11, 16, 18, 19]), Candidate: [1 1 1 0 1 1 2 0 1 1 0 0 1 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 74400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0  0  0 -1  0  1 -1  1 -1  1  0 -1  1] (Indices: [0, 7, 8, 9, 10, 13, 15, 17, 18]), Candidate: [ 1  1  1  0  1  1  2  0  1  1 -1  1  2  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0  0 -1  1  0 -1  0  1 -1  1  0 -1  1] (Indices: [0, 7, 8, 9, 11, 12, 15, 17, 18]), Candidate: [1 1 1 0 1 1 2 0 1 0 1 1 0 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 74500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0  0 -1  0  1  0  0 -1  0  1 -1  1  0] (Indices: [0, 7, 8, 9, 12, 13, 14, 17, 19]), Candidate: [ 1  1  1  0  1  1  2  0  1  0  0  2  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0 -1  1  0  0  0  0 -1  0  1 -1  0  1] (Indices: [0, 7, 8, 10, 11, 12, 13, 14, 17]), Candidate: [ 1  1  1  0  1  1  2  0  0  2  0  1  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0 -1  1  0 -1  1 -1  0  1  0 -1  1  0] (Indices: [0, 7, 8, 10, 11, 13, 16, 17, 19]), Candidate: [1 1 1 0 1 1 2 0 0 2 0 0 2 0 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 74650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0 -1  1 -1  1 -1  0  1  0 -1  1  0  0] (Indices: [0, 7, 8, 10, 12, 15, 16, 18, 19]), Candidate: [ 1  1  1  0  1  1  2  0  0  2 -1  2  0  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0 -1  0  1  0 -1  1 -1  1  0  0 -1  1] (Indices: [0, 7, 8, 11, 12, 14, 16, 17, 18]), Candidate: [ 1  1  1  0  1  1  2  0  0  1  1  1  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0 -1  0  0  1 -1  0  1  0  0  0  0  0] (Indices: [0, 7, 8, 12, 15, 16, 17, 18, 19]), Candidate: [1 1 1 0 1 1 2 0 0 1 0 2 0 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 74800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  1  0  0 -1  1  0 -1  0  1  0 -1  1] (Indices: [0, 7, 9, 10, 11, 13, 14, 17, 18]), Candidate: [ 1  1  1  0  1  1  2 -1  2  1  0  0  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 74850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  1  0 -1  1 -1  1  0  0 -1  0  1  0] (Indices: [0, 7, 9, 10, 12, 14, 15, 16, 19]), Candidate: [ 1  1  1  0  1  1  2 -1  2  1 -1  2  0  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 74900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  1 -1  1  0  0 -1  0  1  0  0 -1  1] (Indices: [0, 7, 9, 11, 12, 13, 16, 17, 18]), Candidate: [ 1  1  1  0  1  1  2 -1  2  0  1  1  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  1 -1  0  1  0 -1  1  0  0  0 -1  1] (Indices: [0, 7, 9, 12, 13, 15, 16, 17, 18]), Candidate: [ 1  1  1  0  1  1  2 -1  2  0  0  2  1  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  0  1  0  0 -1  0  1  0 -1  1  0  0] (Indices: [0, 7, 10, 11, 12, 15, 16, 18, 19]), Candidate: [ 1  1  1  0  1  1  2 -1  1  2  0  1  0  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  0  1 -1  0  1 -1  1  0  0  0  0  0] (Indices: [0, 7, 10, 13, 15, 16, 17, 18, 19]), Candidate: [ 1  1  1  0  1  1  2 -1  1  2 -1  1  2  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 75100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1  0  0  0  0  0 -1  0  0  1  0 -1  1] (Indices: [0, 8, 9, 10, 11, 12, 13, 17, 18]), Candidate: [1 1 1 0 1 1 1 1 1 1 0 1 1 0 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 75150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1  0  0  0 -1  0  1 -1  1  0 -1  1  0] (Indices: [0, 8, 9, 10, 11, 14, 16, 17, 19]), Candidate: [ 1  1  1  0  1  1  1  1  1  1  0  0  1  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1  0  0 -1  0  1  0 -1  1  0 -1  1  0] (Indices: [0, 8, 9, 10, 13, 14, 16, 17, 19]), Candidate: [ 1  1  1  0  1  1  1  1  1  1 -1  1  2  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 75250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1  0 -1  1 -1  1  0  0  0 -1  1 -1  1] (Indices: [0, 8, 9, 11, 13, 14, 15, 16, 18]), Candidate: [1 1 1 0 1 1 1 1 1 0 1 0 2 1 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 75300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1 -1  1  0  0  0  0  0 -1  0  1 -1  1] (Indices: [0, 8, 10, 11, 12, 13, 14, 15, 18]), Candidate: [1 1 1 0 1 1 1 1 0 2 0 1 1 1 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 75350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1 -1  1  0 -1  0  1  0  0 -1  1  0  0] (Indices: [0, 8, 10, 11, 14, 15, 16, 18, 19]), Candidate: [1 1 1 0 1 1 1 1 0 2 0 0 1 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 75400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1 -1  0  1  0 -1  1  0 -1  1  0  0  0] (Indices: [0, 8, 11, 12, 14, 15, 17, 18, 19]), Candidate: [1 1 1 0 1 1 1 1 0 1 1 1 0 2 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 75450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  1  0  0  0 -1  0  1  0 -1  1  0  0] (Indices: [0, 9, 10, 11, 12, 15, 16, 18, 19]), Candidate: [1 1 1 0 1 1 1 0 2 1 0 1 0 1 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 75500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  1  0 -1  0  1 -1  1  0  0  0  0  0] (Indices: [0, 9, 10, 13, 15, 16, 17, 18, 19]), Candidate: [ 1  1  1  0  1  1  1  0  2  1 -1  1  2  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  0  1  0  0  0 -1  1  0 -1  1  0  0] (Indices: [0, 10, 11, 12, 13, 15, 16, 18, 19]), Candidate: [1 1 1 0 1 1 1 0 1 2 0 1 1 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 75600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  1 -1  0  0  0  0  0  1 -1  0  0  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 9, 16]), Candidate: [ 3  1  1  0  1  1  1 -1  2  0  0  1  1  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1  0 -1  1 -1  0  0  0  0  0  0  0  0] (Indices: [1, 2, 3, 4, 5, 6, 8, 9, 11]), Candidate: [3 1 1 0 1 1 0 1 1 0 1 0 1 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 75700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1 -1  0  0  0  0  0  0  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 8, 16, 19]), Candidate: [3 1 1 0 1 1 0 1 0 1 0 1 1 1 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 75750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  0  1  0 -1  1 -1  0  0  0  0  0  0] (Indices: [1, 2, 3, 4, 5, 6, 10, 11, 13]), Candidate: [3 1 1 0 1 1 0 0 1 2 0 0 2 0 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 75800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  0  0  1 -1  0  1 -1  0  1 -1  0  0] (Indices: [1, 2, 3, 4, 5, 6, 11, 14, 17]), Candidate: [ 3  1  1  0  1  1  0  0  1  1  1  0  1  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  0  0  0  0  0  1  0 -1  1 -1  0  0] (Indices: [1, 2, 3, 4, 5, 6, 14, 15, 17]), Candidate: [3 1 1 0 1 1 0 0 1 1 0 1 1 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 75900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0 -1  0  0  1 -1  0  0  0  1 -1  0  0] (Indices: [1, 2, 3, 4, 5, 7, 8, 12, 17]), Candidate: [3 1 1 0 1 0 2 0 0 1 0 2 0 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 75950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  1 -1  0  0  1 -1  0  1 -1  0  0  0] (Indices: [1, 2, 3, 4, 5, 7, 9, 13, 16]), Candidate: [ 3  1  1  0  1  0  2 -1  2  0  0  1  2  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  0  1 -1  0  0  0  0  1 -1  1 -1  0] (Indices: [1, 2, 3, 4, 5, 7, 10, 16, 18]), Candidate: [ 3  1  1  0  1  0  2 -1  1  2 -1  1  1  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 76050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  0  0  0  1 -1  0  0  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 5, 7, 12, 16, 19]), Candidate: [ 3  1  1  0  1  0  2 -1  1  1  0  2  0  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1  0 -1  1 -1  0  1 -1  0  0  0  0  0] (Indices: [1, 2, 3, 4, 5, 8, 9, 11, 14]), Candidate: [ 3  1  1  0  1  0  1  1  1  0  1  0  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1 -1  1 -1  0  1 -1  1 -1  0  0  0  0] (Indices: [1, 2, 3, 4, 5, 8, 10, 13, 15]), Candidate: [ 3  1  1  0  1  0  1  1  0  2 -1  1  2  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1 -1  0  0  1  0 -1  0  1 -1  0  0  0] (Indices: [1, 2, 3, 4, 5, 8, 12, 13, 16]), Candidate: [3 1 1 0 1 0 1 1 0 1 0 2 1 0 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 76250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1 -1  0  0  0  0  0  0  1  0  0 -1  0] (Indices: [1, 2, 3, 4, 5, 8, 16, 17, 18]), Candidate: [3 1 1 0 1 0 1 1 0 1 0 1 1 1 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 76300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  1 -1  1 -1  1 -1  0  0  1 -1  0  0] (Indices: [1, 2, 3, 4, 5, 9, 11, 13, 17]), Candidate: [3 1 1 0 1 0 1 0 2 0 1 0 2 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 76350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  1 -1  0  0  1 -1  0  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 5, 9, 13, 16, 19]), Candidate: [3 1 1 0 1 0 1 0 2 0 0 1 2 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 76400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  0  1  0 -1  0  0  0  0  1 -1  1 -1] (Indices: [1, 2, 3, 4, 5, 10, 11, 17, 19]), Candidate: [3 1 1 0 1 0 1 0 1 2 0 0 1 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 76450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  0  1 -1  0  0  0  1  0 -1  0  1 -1] (Indices: [1, 2, 3, 4, 5, 10, 15, 16, 19]), Candidate: [ 3  1  1  0  1  0  1  0  1  2 -1  1  1  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  0  0  1 -1  0  1 -1  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 5, 11, 14, 16, 19]), Candidate: [ 3  1  1  0  1  0  1  0  1  1  1  0  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  0  0  0  0  1  0  0 -1  1 -1  0  0] (Indices: [1, 2, 3, 4, 5, 13, 14, 15, 17]), Candidate: [3 1 1 0 1 0 1 0 1 1 0 1 2 1 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 76600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0 -1  1 -1  0  0  0  0  0  1 -1  0  0] (Indices: [1, 2, 3, 4, 6, 7, 8, 10, 17]), Candidate: [ 3  1  1  0  0  2  1  0  0  2 -1  1  1  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  1 -1  1 -1  0  1 -1  0  0  0  0  0] (Indices: [1, 2, 3, 4, 6, 7, 9, 11, 14]), Candidate: [ 3  1  1  0  0  2  1 -1  2  0  1  0  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 76700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  0  1 -1  0  1 -1  1 -1  0  0  0  0] (Indices: [1, 2, 3, 4, 6, 7, 10, 13, 15]), Candidate: [ 3  1  1  0  0  2  1 -1  1  2 -1  1  2  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 76750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  0  0  0  1  0 -1  0  1 -1  0  0  0] (Indices: [1, 2, 3, 4, 6, 7, 12, 13, 16]), Candidate: [ 3  1  1  0  0  2  1 -1  1  1  0  2  1  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  0  0  0  0  0  0  0  1  0  0 -1  0] (Indices: [1, 2, 3, 4, 6, 7, 16, 17, 18]), Candidate: [ 3  1  1  0  0  2  1 -1  1  1  0  1  1  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1 -1  1  0 -1  1 -1  0  0  0  0  0  0] (Indices: [1, 2, 3, 4, 6, 8, 10, 11, 13]), Candidate: [3 1 1 0 0 2 0 1 0 2 0 0 2 0 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 76900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1 -1  0  1 -1  0  1 -1  0  1 -1  0  0] (Indices: [1, 2, 3, 4, 6, 8, 11, 14, 17]), Candidate: [ 3  1  1  0  0  2  0  1  0  1  1  0  1  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1 -1  0  0  0  0  1  0 -1  1 -1  0  0] (Indices: [1, 2, 3, 4, 6, 8, 14, 15, 17]), Candidate: [3 1 1 0 0 2 0 1 0 1 0 1 1 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 77000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  1  0 -1  0  0  0  0  1 -1  1 -1  0] (Indices: [1, 2, 3, 4, 6, 9, 10, 16, 18]), Candidate: [ 3  1  1  0  0  2  0  0  2  1 -1  1  1  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  1 -1  0  1 -1  0  0  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 6, 9, 12, 16, 19]), Candidate: [3 1 1 0 0 2 0 0 2 0 0 2 0 1 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 77100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  0  1  0 -1  1 -1  0  0  0  1 -1  0] (Indices: [1, 2, 3, 4, 6, 10, 11, 13, 18]), Candidate: [3 1 1 0 0 2 0 0 1 2 0 0 2 0 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 77150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  0  1 -1  0  1 -1  0  0  1  0 -1  0] (Indices: [1, 2, 3, 4, 6, 10, 13, 17, 18]), Candidate: [ 3  1  1  0  0  2  0  0  1  2 -1  1  2  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  0  0  1 -1  1 -1  1 -1  1 -1  0  0] (Indices: [1, 2, 3, 4, 6, 11, 13, 15, 17]), Candidate: [3 1 1 0 0 2 0 0 1 1 1 0 2 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 77250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  0  0  0  1 -1  1 -1  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 6, 12, 14, 16, 19]), Candidate: [ 3  1  1  0  0  2  0  0  1  1  0  2  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0  0  0 -1  1 -1  0  0  0  0  0  0  0] (Indices: [1, 2, 3, 4, 7, 8, 9, 10, 12]), Candidate: [ 3  1  1  0  0  1  2  0  1  1 -1  2  0  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0 -1  1  0 -1  0  0  0  0  0  1 -1  0] (Indices: [1, 2, 3, 4, 7, 8, 10, 11, 18]), Candidate: [3 1 1 0 0 1 2 0 0 2 0 0 1 1 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 77400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0 -1  0  1 -1  0  0  1 -1  0  1 -1  0] (Indices: [1, 2, 3, 4, 7, 8, 11, 15, 18]), Candidate: [3 1 1 0 0 1 2 0 0 1 1 0 1 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 77450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0 -1  0  0  0  0  1 -1  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 7, 8, 14, 16, 19]), Candidate: [ 3  1  1  0  0  1  2  0  0  1  0  1  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  1 -1  1  0  0 -1  0  0  0  0  0  0] (Indices: [1, 2, 3, 4, 7, 9, 11, 12, 13]), Candidate: [ 3  1  1  0  0  1  2 -1  2  0  1  1  1  0  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  1 -1  0  0  1  0 -1  1 -1  0  0  0] (Indices: [1, 2, 3, 4, 7, 9, 13, 14, 16]), Candidate: [ 3  1  1  0  0  1  2 -1  2  0  0  1  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 77600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  0  1  0 -1  0  1 -1  0  0  1 -1  0] (Indices: [1, 2, 3, 4, 7, 10, 11, 14, 18]), Candidate: [ 3  1  1  0  0  1  2 -1  1  2  0  0  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 77650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  0  1 -1  0  0  1  0 -1  0  1 -1  0] (Indices: [1, 2, 3, 4, 7, 10, 14, 15, 18]), Candidate: [ 3  1  1  0  0  1  2 -1  1  2 -1  1  1  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 77700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  0  0  1 -1  1 -1  0  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 7, 11, 13, 16, 19]), Candidate: [ 3  1  1  0  0  1  2 -1  1  1  1  0  2  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  0  0  0  1 -1  0  1  0 -1  1 -1  0] (Indices: [1, 2, 3, 4, 7, 12, 15, 16, 18]), Candidate: [ 3  1  1  0  0  1  2 -1  1  1  0  2  0  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1  0  0  0 -1  0  0  0  0  0  1 -1  0] (Indices: [1, 2, 3, 4, 8, 9, 10, 11, 18]), Candidate: [3 1 1 0 0 1 1 1 1 1 0 0 1 1 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 77850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1  0 -1  1 -1  0  0  1 -1  0  1 -1  0] (Indices: [1, 2, 3, 4, 8, 9, 11, 15, 18]), Candidate: [3 1 1 0 0 1 1 1 1 0 1 0 1 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 77900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1  0 -1  0  0  0  1 -1  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 8, 9, 14, 16, 19]), Candidate: [ 3  1  1  0  0  1  1  1  1  0  0  1  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1 -1  1 -1  1 -1  1 -1  0  1 -1  0  0] (Indices: [1, 2, 3, 4, 8, 10, 12, 14, 17]), Candidate: [ 3  1  1  0  0  1  1  1  0  2 -1  2  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 78000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1 -1  0  1  0  0 -1  0  1 -1  0  0  0] (Indices: [1, 2, 3, 4, 8, 11, 12, 13, 16]), Candidate: [3 1 1 0 0 1 1 1 0 1 1 1 1 0 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 78050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1 -1  0  1 -1  0  0  0  1  0  0 -1  0] (Indices: [1, 2, 3, 4, 8, 11, 16, 17, 18]), Candidate: [3 1 1 0 0 1 1 1 0 1 1 0 1 1 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 78100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1 -1  0  0  0  1 -1  1  0 -1  1 -1  0] (Indices: [1, 2, 3, 4, 8, 13, 15, 16, 18]), Candidate: [3 1 1 0 0 1 1 1 0 1 0 1 2 0 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 78150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  1  0  0 -1  0  0  0  0  1 -1  1 -1] (Indices: [1, 2, 3, 4, 9, 10, 11, 17, 19]), Candidate: [3 1 1 0 0 1 1 0 2 1 0 0 1 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 78200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  1  0 -1  0  0  0  1  0 -1  0  1 -1] (Indices: [1, 2, 3, 4, 9, 10, 15, 16, 19]), Candidate: [ 3  1  1  0  0  1  1  0  2  1 -1  1  1  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  1 -1  1 -1  0  1 -1  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 9, 11, 14, 16, 19]), Candidate: [ 3  1  1  0  0  1  1  0  2  0  1  0  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  1 -1  0  0  1  0  0 -1  1 -1  0  0] (Indices: [1, 2, 3, 4, 9, 13, 14, 15, 17]), Candidate: [3 1 1 0 0 1 1 0 2 0 0 1 2 1 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 78350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  0  1  0  0 -1  0  0  1 -1  1 -1  0] (Indices: [1, 2, 3, 4, 10, 11, 12, 16, 18]), Candidate: [3 1 1 0 0 1 1 0 1 2 0 1 0 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 78400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  0  1 -1  1  0 -1  0  1 -1  1 -1  0] (Indices: [1, 2, 3, 4, 10, 12, 13, 16, 18]), Candidate: [ 3  1  1  0  0  1  1  0  1  2 -1  2  1  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  0  1 -1  0  0  1  0 -1  0  1  0 -1] (Indices: [1, 2, 3, 4, 10, 14, 15, 18, 19]), Candidate: [ 3  1  1  0  0  1  1  0  1  2 -1  1  1  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  0  0  1 -1  1  0 -1  1 -1  1 -1  0] (Indices: [1, 2, 3, 4, 11, 13, 14, 16, 18]), Candidate: [ 3  1  1  0  0  1  1  0  1  1  1  0  2  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  0  0  0  1 -1  1  0  0  0 -1  0  0] (Indices: [1, 2, 3, 4, 12, 14, 15, 16, 17]), Candidate: [3 1 1 0 0 1 1 0 1 1 0 2 0 2 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 78600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0 -1  1 -1  0  0  0  1 -1  0  0  0  0] (Indices: [1, 2, 3, 5, 6, 7, 8, 10, 15]), Candidate: [ 3  1  1 -1  2  1  1  0  0  2 -1  1  1  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 78650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  1 -1  1  0 -1  0  0  0  0  0  0  0] (Indices: [1, 2, 3, 5, 6, 7, 9, 11, 12]), Candidate: [ 3  1  1 -1  2  1  1 -1  2  0  1  1  0  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 78700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  0  1 -1  1 -1  0  0  0  0  0  1 -1] (Indices: [1, 2, 3, 5, 6, 7, 10, 12, 19]), Candidate: [ 3  1  1 -1  2  1  1 -1  1  2 -1  2  0  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 78750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  0  0  0  1  0  0 -1  0  0  0  0  0] (Indices: [1, 2, 3, 5, 6, 7, 12, 13, 14]), Candidate: [ 3  1  1 -1  2  1  1 -1  1  1  0  2  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 78800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  0  0  0  0  0  0  1 -1  1 -1  1 -1] (Indices: [1, 2, 3, 5, 6, 7, 15, 17, 19]), Candidate: [ 3  1  1 -1  2  1  1 -1  1  1  0  1  1  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 78850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1  0 -1  0  0  0  0  0  0  0  1  0 -1] (Indices: [1, 2, 3, 5, 6, 8, 9, 18, 19]), Candidate: [ 3  1  1 -1  2  1  0  1  1  0  0  1  1  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1 -1  0  1 -1  0  1  0 -1  0  0  0  0] (Indices: [1, 2, 3, 5, 6, 8, 11, 14, 15]), Candidate: [ 3  1  1 -1  2  1  0  1  0  1  1  0  1  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1 -1  0  0  0  1 -1  0  0  0  1  0 -1] (Indices: [1, 2, 3, 5, 6, 8, 13, 18, 19]), Candidate: [ 3  1  1 -1  2  1  0  1  0  1  0  1  2  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  1  0 -1  0  0  0  1 -1  0  0  1 -1] (Indices: [1, 2, 3, 5, 6, 9, 10, 15, 19]), Candidate: [ 3  1  1 -1  2  1  0  0  2  1 -1  1  1  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 79050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  1 -1  0  1 -1  0  0  1  0 -1  0  0] (Indices: [1, 2, 3, 5, 6, 9, 12, 16, 17]), Candidate: [ 3  1  1 -1  2  1  0  0  2  0  0  2  0  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  0  1  0 -1  1 -1  0  1 -1  0  0  0] (Indices: [1, 2, 3, 5, 6, 10, 11, 13, 16]), Candidate: [ 3  1  1 -1  2  1  0  0  1  2  0  0  2  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  0  1 -1  0  1 -1  0  1 -1  1 -1  0] (Indices: [1, 2, 3, 5, 6, 10, 13, 16, 18]), Candidate: [ 3  1  1 -1  2  1  0  0  1  2 -1  1  2  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 79200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  0  0  1 -1  1  0 -1  0  0  0  1 -1] (Indices: [1, 2, 3, 5, 6, 11, 13, 14, 19]), Candidate: [ 3  1  1 -1  2  1  0  0  1  1  1  0  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 79250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  0  0  0  1 -1  1 -1  1  0 -1  0  0] (Indices: [1, 2, 3, 5, 6, 12, 14, 16, 17]), Candidate: [ 3  1  1 -1  2  1  0  0  1  1  0  2  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 79300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  0  0  0  0  0  0  0  1  0  0  0 -1] (Indices: [1, 2, 3, 5, 6, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  1  0  0  1  1  0  1  1  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0 -1  1  0 -1  0  0  0  1 -1  0  0  0] (Indices: [1, 2, 3, 5, 7, 8, 10, 11, 16]), Candidate: [ 3  1  1 -1  2  0  2  0  0  2  0  0  1  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0 -1  0  1 -1  0  0  1  0 -1  0  0  0] (Indices: [1, 2, 3, 5, 7, 8, 11, 15, 16]), Candidate: [ 3  1  1 -1  2  0  2  0  0  1  1  0  1  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0 -1  0  0  0  0  1 -1  1  0 -1  0  0] (Indices: [1, 2, 3, 5, 7, 8, 14, 16, 17]), Candidate: [ 3  1  1 -1  2  0  2  0  0  1  0  1  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 79500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  1  0 -1  0  0  0  0  0  1 -1  1 -1] (Indices: [1, 2, 3, 5, 7, 9, 10, 17, 19]), Candidate: [ 3  1  1 -1  2  0  2 -1  2  1 -1  1  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 79550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  1 -1  0  1 -1  0  0  0  0  1  0 -1] (Indices: [1, 2, 3, 5, 7, 9, 12, 18, 19]), Candidate: [ 3  1  1 -1  2  0  2 -1  2  0  0  2  0  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 79600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  0  1  0 -1  0  1 -1  1 -1  0  0  0] (Indices: [1, 2, 3, 5, 7, 10, 11, 14, 16]), Candidate: [ 3  1  1 -1  2  0  2 -1  1  2  0  0  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 79650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  0  1 -1  0  0  1  0  0 -1  0  0  0] (Indices: [1, 2, 3, 5, 7, 10, 14, 15, 16]), Candidate: [ 3  1  1 -1  2  0  2 -1  1  2 -1  1  1  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 79700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  0  0  1 -1  1 -1  0  1  0 -1  0  0] (Indices: [1, 2, 3, 5, 7, 11, 13, 16, 17]), Candidate: [ 3  1  1 -1  2  0  2 -1  1  1  1  0  2  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 79750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  0  0  0  1 -1  1 -1  0  0  1  0 -1] (Indices: [1, 2, 3, 5, 7, 12, 14, 18, 19]), Candidate: [ 3  1  1 -1  2  0  2 -1  1  1  0  2  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 79800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1  0  0  0 -1  0  0  0  1 -1  0  0  0] (Indices: [1, 2, 3, 5, 8, 9, 10, 11, 16]), Candidate: [ 3  1  1 -1  2  0  1  1  1  1  0  0  1  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1  0 -1  1 -1  0  0  1  0 -1  0  0  0] (Indices: [1, 2, 3, 5, 8, 9, 11, 15, 16]), Candidate: [ 3  1  1 -1  2  0  1  1  1  0  1  0  1  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1  0 -1  0  0  0  1 -1  1  0 -1  0  0] (Indices: [1, 2, 3, 5, 8, 9, 14, 16, 17]), Candidate: [ 3  1  1 -1  2  0  1  1  1  0  0  1  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 79950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1 -1  1 -1  1 -1  1  0 -1  0  0  0  0] (Indices: [1, 2, 3, 5, 8, 10, 12, 14, 15]), Candidate: [ 3  1  1 -1  2  0  1  1  0  2 -1  2  0  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 80000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1 -1  0  1  0  0  0 -1  0  0  0  0  0] (Indices: [1, 2, 3, 5, 8, 11, 12, 13, 14]), Candidate: [ 3  1  1 -1  2  0  1  1  0  1  1  1  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 80050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1 -1  0  1 -1  0  0  1 -1  1 -1  1 -1] (Indices: [1, 2, 3, 5, 8, 11, 15, 17, 19]), Candidate: [ 3  1  1 -1  2  0  1  1  0  1  1  0  1  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1 -1  0  0  0  1  0 -1  0  0  1  0 -1] (Indices: [1, 2, 3, 5, 8, 13, 14, 18, 19]), Candidate: [ 3  1  1 -1  2  0  1  1  0  1  0  1  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 80150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  1  0  0 -1  0  0  0  1 -1  0  1 -1] (Indices: [1, 2, 3, 5, 9, 10, 11, 16, 19]), Candidate: [ 3  1  1 -1  2  0  1  0  2  1  0  0  1  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  1  0 -1  0  0  0  1  0  0 -1  0  0] (Indices: [1, 2, 3, 5, 9, 10, 15, 16, 17]), Candidate: [ 3  1  1 -1  2  0  1  0  2  1 -1  1  1  1  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 80250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  1 -1  1 -1  0  1 -1  1  0 -1  0  0] (Indices: [1, 2, 3, 5, 9, 11, 14, 16, 17]), Candidate: [ 3  1  1 -1  2  0  1  0  2  0  1  0  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 80300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  1 -1  0  1 -1  0  0  0  1  0  0 -1] (Indices: [1, 2, 3, 5, 9, 12, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  0  1  0  2  0  0  2  0  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  0  1  0  0 -1  0  1 -1  0  0  1 -1] (Indices: [1, 2, 3, 5, 10, 11, 12, 15, 19]), Candidate: [ 3  1  1 -1  2  0  1  0  1  2  0  1  0  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  0  1 -1  1  0 -1  1 -1  0  0  1 -1] (Indices: [1, 2, 3, 5, 10, 12, 13, 15, 19]), Candidate: [ 3  1  1 -1  2  0  1  0  1  2 -1  2  1  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 80450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  0  1 -1  0  0  1  0 -1  1  0 -1  0] (Indices: [1, 2, 3, 5, 10, 14, 15, 17, 18]), Candidate: [ 3  1  1 -1  2  0  1  0  1  2 -1  1  1  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 80500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  0  0  1 -1  1  0  0 -1  0  0  1 -1] (Indices: [1, 2, 3, 5, 11, 13, 14, 15, 19]), Candidate: [ 3  1  1 -1  2  0  1  0  1  1  1  0  2  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  0  0  0  1  0 -1  0  1 -1  1  0 -1] (Indices: [1, 2, 3, 5, 12, 13, 16, 18, 19]), Candidate: [ 3  1  1 -1  2  0  1  0  1  1  0  2  1  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0  0 -1  1 -1  0  0  1 -1  0  0  0  0] (Indices: [1, 2, 3, 6, 7, 8, 9, 11, 15]), Candidate: [ 3  1  1 -1  1  2  1  0  1  0  1  0  1  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0 -1  1 -1  0  1 -1  0  1 -1  0  0  0] (Indices: [1, 2, 3, 6, 7, 8, 10, 13, 16]), Candidate: [ 3  1  1 -1  1  2  1  0  0  2 -1  1  2  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 80700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0 -1  0  0  1  0 -1  0  0  1 -1  0  0] (Indices: [1, 2, 3, 6, 7, 8, 12, 13, 17]), Candidate: [ 3  1  1 -1  1  2  1  0  0  1  0  2  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0 -1  0  0  0  0  0  0  1  0 -1  1 -1] (Indices: [1, 2, 3, 6, 7, 8, 16, 17, 19]), Candidate: [ 3  1  1 -1  1  2  1  0  0  1  0  1  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  1 -1  1 -1  1 -1  0  0  0  1 -1  0] (Indices: [1, 2, 3, 6, 7, 9, 11, 13, 18]), Candidate: [ 3  1  1 -1  1  2  1 -1  2  0  1  0  2  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 80850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  1 -1  0  0  1 -1  0  0  1  0 -1  0] (Indices: [1, 2, 3, 6, 7, 9, 13, 17, 18]), Candidate: [ 3  1  1 -1  1  2  1 -1  2  0  0  1  2  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 80900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  0  1  0 -1  0  0  0  0  0  1  0 -1] (Indices: [1, 2, 3, 6, 7, 10, 11, 18, 19]), Candidate: [ 3  1  1 -1  1  2  1 -1  1  2  0  0  1  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 80950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  0  1 -1  0  0  0  1 -1  1  0 -1  0] (Indices: [1, 2, 3, 6, 7, 10, 15, 17, 18]), Candidate: [ 3  1  1 -1  1  2  1 -1  1  2 -1  1  1  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 81000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  0  0  1 -1  0  1 -1  0  1  0 -1  0] (Indices: [1, 2, 3, 6, 7, 11, 14, 17, 18]), Candidate: [ 3  1  1 -1  1  2  1 -1  1  1  1  0  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 81050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  0  0  0  0  1  0  0 -1  0  1 -1  0] (Indices: [1, 2, 3, 6, 7, 13, 14, 15, 18]), Candidate: [ 3  1  1 -1  1  2  1 -1  1  1  0  1  2  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 81100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1  0  0 -1  0  1 -1  0  1 -1  0  0  0] (Indices: [1, 2, 3, 6, 8, 9, 10, 13, 16]), Candidate: [ 3  1  1 -1  1  2  0  1  1  1 -1  1  2  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 81150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1  0 -1  0  1  0 -1  0  0  1 -1  0  0] (Indices: [1, 2, 3, 6, 8, 9, 12, 13, 17]), Candidate: [ 3  1  1 -1  1  2  0  1  1  0  0  2  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1  0 -1  0  0  0  0  0  1  0 -1  1 -1] (Indices: [1, 2, 3, 6, 8, 9, 16, 17, 19]), Candidate: [ 3  1  1 -1  1  2  0  1  1  0  0  1  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1 -1  1 -1  1 -1  0  0  0  1 -1  1 -1] (Indices: [1, 2, 3, 6, 8, 10, 12, 17, 19]), Candidate: [ 3  1  1 -1  1  2  0  1  0  2 -1  2  0  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 81300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1 -1  0  1  0 -1  0  1 -1  0  1 -1  0] (Indices: [1, 2, 3, 6, 8, 11, 12, 15, 18]), Candidate: [ 3  1  1 -1  1  2  0  1  0  1  1  1  0  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1 -1  0  0  1  0 -1  1 -1  0  1 -1  0] (Indices: [1, 2, 3, 6, 8, 12, 13, 15, 18]), Candidate: [ 3  1  1 -1  1  2  0  1  0  1  0  2  1  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1 -1  0  0  0  0  1  0  0 -1  0  1 -1] (Indices: [1, 2, 3, 6, 8, 14, 15, 16, 19]), Candidate: [ 3  1  1 -1  1  2  0  1  0  1  0  1  1  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  1  0 -1  1 -1  1 -1  0  0  1 -1  0] (Indices: [1, 2, 3, 6, 9, 10, 12, 14, 18]), Candidate: [ 3  1  1 -1  1  2  0  0  2  1 -1  2  0  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 81500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  1 -1  1  0  0 -1  0  0  1 -1  0  0] (Indices: [1, 2, 3, 6, 9, 11, 12, 13, 17]), Candidate: [ 3  1  1 -1  1  2  0  0  2  0  1  1  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  1 -1  1 -1  0  0  0  1  0 -1  1 -1] (Indices: [1, 2, 3, 6, 9, 11, 16, 17, 19]), Candidate: [ 3  1  1 -1  1  2  0  0  2  0  1  0  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  1 -1  0  0  1 -1  1  0 -1  0  1 -1] (Indices: [1, 2, 3, 6, 9, 13, 15, 16, 19]), Candidate: [ 3  1  1 -1  1  2  0  0  2  0  0  1  2  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  0  1  0 -1  1 -1  1 -1  1 -1  0  0] (Indices: [1, 2, 3, 6, 10, 11, 13, 15, 17]), Candidate: [ 3  1  1 -1  1  2  0  0  1  2  0  0  2  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  0  1 -1  1 -1  1 -1  1 -1  0  1 -1] (Indices: [1, 2, 3, 6, 10, 12, 14, 16, 19]), Candidate: [ 3  1  1 -1  1  2  0  0  1  2 -1  2  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 81750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  0  0  1  0  0  0 -1  1 -1  0  0  0] (Indices: [1, 2, 3, 6, 11, 12, 13, 14, 16]), Candidate: [ 3  1  1 -1  1  2  0  0  1  1  1  1  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 81800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  0  0  1 -1  1 -1  0  1  0  0 -1  0] (Indices: [1, 2, 3, 6, 11, 13, 16, 17, 18]), Candidate: [ 3  1  1 -1  1  2  0  0  1  1  1  0  2  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  0  0  0  1 -1  0  1  0  0 -1  1 -1] (Indices: [1, 2, 3, 6, 12, 15, 16, 17, 19]), Candidate: [ 3  1  1 -1  1  2  0  0  1  1  0  2  0  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0  0  0 -1  0  0  1 -1  0  0  0  1 -1] (Indices: [1, 2, 3, 7, 8, 9, 10, 14, 19]), Candidate: [ 3  1  1 -1  1  1  2  0  1  1 -1  1  1  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 81950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0  0 -1  0  1 -1  0  1  0 -1  0  0  0] (Indices: [1, 2, 3, 7, 8, 9, 12, 15, 16]), Candidate: [ 3  1  1 -1  1  1  2  0  1  0  0  2  0  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0 -1  1  0  0 -1  0  0  0  0  1 -1  0] (Indices: [1, 2, 3, 7, 8, 10, 11, 12, 18]), Candidate: [ 3  1  1 -1  1  1  2  0  0  2  0  1  0  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0 -1  1 -1  0  1 -1  1 -1  1 -1  0  0] (Indices: [1, 2, 3, 7, 8, 10, 13, 15, 17]), Candidate: [ 3  1  1 -1  1  1  2  0  0  2 -1  1  2  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 82100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0 -1  0  1 -1  1  0  0 -1  0  0  0  0] (Indices: [1, 2, 3, 7, 8, 11, 13, 14, 15]), Candidate: [ 3  1  1 -1  1  1  2  0  0  1  1  0  2  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0 -1  0  0  1 -1  1  0  0 -1  0  0  0] (Indices: [1, 2, 3, 7, 8, 12, 14, 15, 16]), Candidate: [ 3  1  1 -1  1  1  2  0  0  1  0  2  0  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0 -1  0  0  0  0  0  1  0  0  0 -1  0] (Indices: [1, 2, 3, 7, 8, 15, 16, 17, 18]), Candidate: [ 3  1  1 -1  1  1  2  0  0  1  0  1  1  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  1  0 -1  1 -1  0  0  1 -1  0  1 -1] (Indices: [1, 2, 3, 7, 9, 10, 12, 16, 19]), Candidate: [ 3  1  1 -1  1  1  2 -1  2  1 -1  2  0  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 82300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  1 -1  1  0 -1  0  1  0 -1  0  0  0] (Indices: [1, 2, 3, 7, 9, 11, 12, 15, 16]), Candidate: [ 3  1  1 -1  1  1  2 -1  2  0  1  1  0  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 82350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  1 -1  0  1  0 -1  1  0 -1  0  0  0] (Indices: [1, 2, 3, 7, 9, 12, 13, 15, 16]), Candidate: [ 3  1  1 -1  1  1  2 -1  2  0  0  2  1  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 82400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  1 -1  0  0  0  1  0  0  0 -1  0  0] (Indices: [1, 2, 3, 7, 9, 14, 15, 16, 17]), Candidate: [ 3  1  1 -1  1  1  2 -1  2  0  0  1  1  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 82450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  0  1  0 -1  1 -1  0  0  0  1  0 -1] (Indices: [1, 2, 3, 7, 10, 11, 13, 18, 19]), Candidate: [ 3  1  1 -1  1  1  2 -1  1  2  0  0  2  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 82500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  0  1 -1  1 -1  0  1 -1  1 -1  1 -1] (Indices: [1, 2, 3, 7, 10, 12, 15, 17, 19]), Candidate: [ 3  1  1 -1  1  1  2 -1  1  2 -1  2  0  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 82550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  0  0  1  0  0 -1  0  1  0 -1  0  0] (Indices: [1, 2, 3, 7, 11, 12, 13, 16, 17]), Candidate: [ 3  1  1 -1  1  1  2 -1  1  1  1  1  1  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 82600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  0  0  1 -1  0  1  0 -1  1 -1  1 -1] (Indices: [1, 2, 3, 7, 11, 14, 15, 17, 19]), Candidate: [ 3  1  1 -1  1  1  2 -1  1  1  1  0  1  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 82650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  0  0  0  0  1  0  0 -1  1 -1  1 -1] (Indices: [1, 2, 3, 7, 13, 14, 15, 17, 19]), Candidate: [ 3  1  1 -1  1  1  2 -1  1  1  0  1  2  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 82700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1  0  0 -1  1  0 -1  0  0  0  0  1 -1] (Indices: [1, 2, 3, 8, 9, 10, 12, 13, 19]), Candidate: [ 3  1  1 -1  1  1  1  1  1  1 -1  2  1  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 82750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1  0  0 -1  0  0  0  0  0  1  0  0 -1] (Indices: [1, 2, 3, 8, 9, 10, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  1  1  1  1  1 -1  1  1  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 82800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1  0 -1  1 -1  0  0  1 -1  1  0 -1  0] (Indices: [1, 2, 3, 8, 9, 11, 15, 17, 18]), Candidate: [ 3  1  1 -1  1  1  1  1  1  0  1  0  1  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1  0 -1  0  0  1  0 -1  0  1 -1  1 -1] (Indices: [1, 2, 3, 8, 9, 13, 14, 17, 19]), Candidate: [ 3  1  1 -1  1  1  1  1  1  0  0  1  2  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 82900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1 -1  1  0 -1  1  0 -1  0  1 -1  0  0] (Indices: [1, 2, 3, 8, 10, 11, 13, 14, 17]), Candidate: [ 3  1  1 -1  1  1  1  1  0  2  0  0  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 82950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1 -1  1 -1  1 -1  1  0 -1  0  1 -1  0] (Indices: [1, 2, 3, 8, 10, 12, 14, 15, 18]), Candidate: [ 3  1  1 -1  1  1  1  1  0  2 -1  2  0  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 83000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1 -1  1 -1  0  0  0  1  0 -1  1  0 -1] (Indices: [1, 2, 3, 8, 10, 15, 16, 18, 19]), Candidate: [ 3  1  1 -1  1  1  1  1  0  2 -1  1  1  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 83050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1 -1  0  1 -1  1 -1  1  0 -1  0  1 -1] (Indices: [1, 2, 3, 8, 11, 13, 15, 16, 19]), Candidate: [ 3  1  1 -1  1  1  1  1  0  1  1  0  2  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1 -1  0  0  1 -1  1 -1  1  0 -1  1 -1] (Indices: [1, 2, 3, 8, 12, 14, 16, 17, 19]), Candidate: [ 3  1  1 -1  1  1  1  1  0  1  0  2  0  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 83150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  1  0  0 -1  1  0  0 -1  0  0  0  0] (Indices: [1, 2, 3, 9, 10, 11, 13, 14, 15]), Candidate: [ 3  1  1 -1  1  1  1  0  2  1  0  0  2  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  1  0 -1  1 -1  1  0  0 -1  0  0  0] (Indices: [1, 2, 3, 9, 10, 12, 14, 15, 16]), Candidate: [ 3  1  1 -1  1  1  1  0  2  1 -1  2  0  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 83250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  1  0 -1  0  0  0  1  0  0  0 -1  0] (Indices: [1, 2, 3, 9, 10, 15, 16, 17, 18]), Candidate: [ 3  1  1 -1  1  1  1  0  2  1 -1  1  1  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 83300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  1 -1  1 -1  1 -1  1  0  0 -1  0  0] (Indices: [1, 2, 3, 9, 11, 13, 15, 16, 17]), Candidate: [ 3  1  1 -1  1  1  1  0  2  0  1  0  2  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  1 -1  0  1 -1  1  0 -1  0  1  0 -1] (Indices: [1, 2, 3, 9, 12, 14, 15, 18, 19]), Candidate: [ 3  1  1 -1  1  1  1  0  2  0  0  2  0  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  0  1  0  0 -1  1 -1  1  0 -1  0  0] (Indices: [1, 2, 3, 10, 11, 12, 14, 16, 17]), Candidate: [ 3  1  1 -1  1  1  1  0  1  2  0  1  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 83450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  0  1  0 -1  0  0  0  1  0  0  0 -1] (Indices: [1, 2, 3, 10, 11, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  1  1  0  1  2  0  0  1  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  0  1 -1  0  1 -1  0  1  0  0  0 -1] (Indices: [1, 2, 3, 10, 13, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  1  1  0  1  2 -1  1  2  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 83550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  0  0  1 -1  1  0 -1  1 -1  1  0 -1] (Indices: [1, 2, 3, 11, 13, 14, 16, 18, 19]), Candidate: [ 3  1  1 -1  1  1  1  0  1  1  1  0  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 83600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0  0 -1  0  0  0  0  0  0  0  0  1 -1] (Indices: [1, 2, 4, 5, 6, 7, 8, 9, 19]), Candidate: [3 1 0 1 1 1 1 0 1 0 0 1 1 1 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 83650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  1  0 -1  0  0  0  1 -1  0  0  0  0] (Indices: [1, 2, 4, 5, 6, 7, 9, 10, 15]), Candidate: [ 3  1  0  1  1  1  1 -1  2  1 -1  1  1  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 83700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  0  1 -1  1 -1  1 -1  0  0  0  0  0] (Indices: [1, 2, 4, 5, 6, 7, 10, 12, 14]), Candidate: [ 3  1  0  1  1  1  1 -1  1  2 -1  2  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 83750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  0  0  1 -1  0  0  0  1 -1  1 -1  0] (Indices: [1, 2, 4, 5, 6, 7, 11, 16, 18]), Candidate: [ 3  1  0  1  1  1  1 -1  1  1  1  0  1  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  0  0  0  0  0  1 -1  0  0  1  0 -1] (Indices: [1, 2, 4, 5, 6, 7, 14, 18, 19]), Candidate: [ 3  1  0  1  1  1  1 -1  1  1  0  1  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 83850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1  0 -1  0  0  0  0  0  1  0 -1  0  0] (Indices: [1, 2, 4, 5, 6, 8, 9, 16, 17]), Candidate: [3 1 0 1 1 1 0 1 1 0 0 1 1 1 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 83900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1 -1  0  1 -1  1 -1  1 -1  0  0  0  0] (Indices: [1, 2, 4, 5, 6, 8, 11, 13, 15]), Candidate: [3 1 0 1 1 1 0 1 0 1 1 0 2 0 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 83950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1 -1  0  0  0  1 -1  0  1  0 -1  0  0] (Indices: [1, 2, 4, 5, 6, 8, 13, 16, 17]), Candidate: [3 1 0 1 1 1 0 1 0 1 0 1 2 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 84000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  1  0 -1  0  0  1 -1  0  0  1 -1  0] (Indices: [1, 2, 4, 5, 6, 9, 10, 14, 18]), Candidate: [ 3  1  0  1  1  1  0  0  2  1 -1  1  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 84050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  1 -1  0  1 -1  1 -1  0  0  0  1 -1] (Indices: [1, 2, 4, 5, 6, 9, 12, 14, 19]), Candidate: [ 3  1  0  1  1  1  0  0  2  0  0  2  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  0  1  0  0 -1  0  0  0  1 -1  0  0] (Indices: [1, 2, 4, 5, 6, 10, 11, 12, 17]), Candidate: [3 1 0 1 1 1 0 0 1 2 0 1 0 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 84150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  0  1 -1  0  1 -1  1  0 -1  0  0  0] (Indices: [1, 2, 4, 5, 6, 10, 13, 15, 16]), Candidate: [ 3  1  0  1  1  1  0  0  1  2 -1  1  2  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  0  0  1  0 -1  0  0  0  0  1  0 -1] (Indices: [1, 2, 4, 5, 6, 11, 12, 18, 19]), Candidate: [3 1 0 1 1 1 0 0 1 1 1 1 0 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 84250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  0  0  0  1  0 -1  0  0  0  1  0 -1] (Indices: [1, 2, 4, 5, 6, 12, 13, 18, 19]), Candidate: [3 1 0 1 1 1 0 0 1 1 0 2 1 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 84300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  0  0  0  0  0  1 -1  0  1  0  0 -1] (Indices: [1, 2, 4, 5, 6, 14, 17, 18, 19]), Candidate: [ 3  1  0  1  1  1  0  0  1  1  0  1  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0  0 -1  0  0  0  0  0  0  0  1  0 -1] (Indices: [1, 2, 4, 5, 7, 8, 9, 18, 19]), Candidate: [3 1 0 1 1 0 2 0 1 0 0 1 1 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 84400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0 -1  0  1 -1  0  1  0 -1  0  0  0  0] (Indices: [1, 2, 4, 5, 7, 8, 11, 14, 15]), Candidate: [3 1 0 1 1 0 2 0 0 1 1 0 1 2 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 84450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0 -1  0  0  0  1 -1  0  0  0  1  0 -1] (Indices: [1, 2, 4, 5, 7, 8, 13, 18, 19]), Candidate: [3 1 0 1 1 0 2 0 0 1 0 1 2 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 84500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  1  0 -1  0  0  0  1 -1  0  0  1 -1] (Indices: [1, 2, 4, 5, 7, 9, 10, 15, 19]), Candidate: [ 3  1  0  1  1  0  2 -1  2  1 -1  1  1  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 84550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  1 -1  0  1 -1  0  0  1  0 -1  0  0] (Indices: [1, 2, 4, 5, 7, 9, 12, 16, 17]), Candidate: [ 3  1  0  1  1  0  2 -1  2  0  0  2  0  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  0  1  0 -1  1 -1  0  1 -1  0  0  0] (Indices: [1, 2, 4, 5, 7, 10, 11, 13, 16]), Candidate: [ 3  1  0  1  1  0  2 -1  1  2  0  0  2  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  0  1 -1  0  1 -1  0  1 -1  1 -1  0] (Indices: [1, 2, 4, 5, 7, 10, 13, 16, 18]), Candidate: [ 3  1  0  1  1  0  2 -1  1  2 -1  1  2  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 84700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  0  0  1 -1  1  0 -1  0  0  0  1 -1] (Indices: [1, 2, 4, 5, 7, 11, 13, 14, 19]), Candidate: [ 3  1  0  1  1  0  2 -1  1  1  1  0  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 84750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  0  0  0  1 -1  1 -1  1  0 -1  0  0] (Indices: [1, 2, 4, 5, 7, 12, 14, 16, 17]), Candidate: [ 3  1  0  1  1  0  2 -1  1  1  0  2  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 84800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  0  0  0  0  0  0  0  1  0  0  0 -1] (Indices: [1, 2, 4, 5, 7, 16, 17, 18, 19]), Candidate: [ 3  1  0  1  1  0  2 -1  1  1  0  1  1  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1  0 -1  1 -1  0  1  0 -1  0  0  0  0] (Indices: [1, 2, 4, 5, 8, 9, 11, 14, 15]), Candidate: [3 1 0 1 1 0 1 1 1 0 1 0 1 2 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 84900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1  0 -1  0  0  1 -1  0  0  0  1  0 -1] (Indices: [1, 2, 4, 5, 8, 9, 13, 18, 19]), Candidate: [3 1 0 1 1 0 1 1 1 0 0 1 2 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 84950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1 -1  1 -1  1  0 -1  1 -1  0  0  0  0] (Indices: [1, 2, 4, 5, 8, 10, 12, 13, 15]), Candidate: [ 3  1  0  1  1  0  1  1  0  2 -1  2  1  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1 -1  1 -1  0  0  0  1 -1  0  1  0 -1] (Indices: [1, 2, 4, 5, 8, 10, 15, 18, 19]), Candidate: [ 3  1  0  1  1  0  1  1  0  2 -1  1  1  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1 -1  0  1 -1  0  1 -1  0  0  1  0 -1] (Indices: [1, 2, 4, 5, 8, 11, 14, 18, 19]), Candidate: [ 3  1  0  1  1  0  1  1  0  1  1  0  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1 -1  0  0  0  1  0 -1  1  0 -1  0  0] (Indices: [1, 2, 4, 5, 8, 13, 14, 16, 17]), Candidate: [ 3  1  0  1  1  0  1  1  0  1  0  1  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  1  0  0 -1  0  0  1 -1  1 -1  0  0] (Indices: [1, 2, 4, 5, 9, 10, 11, 15, 17]), Candidate: [3 1 0 1 1 0 1 0 2 1 0 0 1 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 85200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  1  0 -1  0  0  1 -1  1 -1  1 -1  0] (Indices: [1, 2, 4, 5, 9, 10, 14, 16, 18]), Candidate: [ 3  1  0  1  1  0  1  0  2  1 -1  1  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 85250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  1 -1  1 -1  1 -1  0  0  0  1  0 -1] (Indices: [1, 2, 4, 5, 9, 11, 13, 18, 19]), Candidate: [3 1 0 1 1 0 1 0 2 0 1 0 2 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 85300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  1 -1  0  1 -1  0  1 -1  1 -1  1 -1] (Indices: [1, 2, 4, 5, 9, 12, 15, 17, 19]), Candidate: [3 1 0 1 1 0 1 0 2 0 0 2 0 1 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 85350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  0  1  0  0 -1  1 -1  0  0  1 -1  0] (Indices: [1, 2, 4, 5, 10, 11, 12, 14, 18]), Candidate: [ 3  1  0  1  1  0  1  0  1  2  0  1  0  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  0  1 -1  1  0  0 -1  0  0  1 -1  0] (Indices: [1, 2, 4, 5, 10, 12, 13, 14, 18]), Candidate: [ 3  1  0  1  1  0  1  0  1  2 -1  2  1  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 85450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  0  1 -1  0  1 -1  0  1 -1  1  0 -1] (Indices: [1, 2, 4, 5, 10, 13, 16, 18, 19]), Candidate: [ 3  1  0  1  1  0  1  0  1  2 -1  1  2  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  0  0  1  0 -1  0  0  1 -1  1  0 -1] (Indices: [1, 2, 4, 5, 11, 12, 16, 18, 19]), Candidate: [3 1 0 1 1 0 1 0 1 1 1 1 0 1 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 85550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  0  0  0  1  0 -1  1 -1  1  0 -1  0] (Indices: [1, 2, 4, 5, 12, 13, 15, 17, 18]), Candidate: [3 1 0 1 1 0 1 0 1 1 0 2 1 0 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 85600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0  0  0 -1  0  0  0  0  0  0  1 -1  0] (Indices: [1, 2, 4, 6, 7, 8, 9, 10, 18]), Candidate: [ 3  1  0  1  0  2  1  0  1  1 -1  1  1  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0 -1  1 -1  1 -1  0  0  0  1 -1  0  0] (Indices: [1, 2, 4, 6, 7, 8, 10, 12, 17]), Candidate: [ 3  1  0  1  0  2  1  0  0  2 -1  2  0  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0 -1  0  1 -1  0  0  0  0  1 -1  1 -1] (Indices: [1, 2, 4, 6, 7, 8, 11, 17, 19]), Candidate: [3 1 0 1 0 2 1 0 0 1 1 0 1 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 85750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0 -1  0  0  0  0  0  1  0 -1  0  1 -1] (Indices: [1, 2, 4, 6, 7, 8, 15, 16, 19]), Candidate: [3 1 0 1 0 2 1 0 0 1 0 1 1 1 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 85800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  1 -1  1  0 -1  0  0  0  0  0  1 -1] (Indices: [1, 2, 4, 6, 7, 9, 11, 12, 19]), Candidate: [ 3  1  0  1  0  2  1 -1  2  0  1  1  0  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  1 -1  0  0  1 -1  1 -1  0  1 -1  0] (Indices: [1, 2, 4, 6, 7, 9, 13, 15, 18]), Candidate: [ 3  1  0  1  0  2  1 -1  2  0  0  1  2  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  0  1  0 -1  0  0  0  1  0 -1  0  0] (Indices: [1, 2, 4, 6, 7, 10, 11, 16, 17]), Candidate: [ 3  1  0  1  0  2  1 -1  1  2  0  0  1  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  0  1 -1  0  0  1 -1  0  1 -1  1 -1] (Indices: [1, 2, 4, 6, 7, 10, 14, 17, 19]), Candidate: [ 3  1  0  1  0  2  1 -1  1  2 -1  1  1  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 86000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  0  0  1 -1  0  1  0 -1  0  1 -1  0] (Indices: [1, 2, 4, 6, 7, 11, 14, 15, 18]), Candidate: [ 3  1  0  1  0  2  1 -1  1  1  1  0  1  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  0  0  0  1 -1  0  0  1  0 -1  1 -1] (Indices: [1, 2, 4, 6, 7, 12, 16, 17, 19]), Candidate: [ 3  1  0  1  0  2  1 -1  1  1  0  2  0  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1  0  0 -1  1 -1  0  0  0  1 -1  0  0] (Indices: [1, 2, 4, 6, 8, 9, 10, 12, 17]), Candidate: [ 3  1  0  1  0  2  0  1  1  1 -1  2  0  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1  0 -1  1 -1  0  0  0  0  1 -1  1 -1] (Indices: [1, 2, 4, 6, 8, 9, 11, 17, 19]), Candidate: [3 1 0 1 0 2 0 1 1 0 1 0 1 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 86200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1  0 -1  0  0  0  0  1  0 -1  0  1 -1] (Indices: [1, 2, 4, 6, 8, 9, 15, 16, 19]), Candidate: [3 1 0 1 0 2 0 1 1 0 0 1 1 1 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 86250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1 -1  1 -1  1 -1  0  1 -1  0  0  1 -1] (Indices: [1, 2, 4, 6, 8, 10, 12, 15, 19]), Candidate: [ 3  1  0  1  0  2  0  1  0  2 -1  2  0  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1 -1  0  1  0 -1  1 -1  0  1 -1  0  0] (Indices: [1, 2, 4, 6, 8, 11, 12, 14, 17]), Candidate: [ 3  1  0  1  0  2  0  1  0  1  1  1  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1 -1  0  0  1  0  0 -1  0  1 -1  0  0] (Indices: [1, 2, 4, 6, 8, 12, 13, 14, 17]), Candidate: [ 3  1  0  1  0  2  0  1  0  1  0  2  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1 -1  0  0  0  1 -1  0  1  0 -1  1 -1] (Indices: [1, 2, 4, 6, 8, 13, 16, 17, 19]), Candidate: [3 1 0 1 0 2 0 1 0 1 0 1 2 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 86450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  1  0 -1  1  0 -1  0  0  0  1 -1  0] (Indices: [1, 2, 4, 6, 9, 10, 12, 13, 18]), Candidate: [ 3  1  0  1  0  2  0  0  2  1 -1  2  1  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  1  0 -1  0  0  0  0  1 -1  1  0 -1] (Indices: [1, 2, 4, 6, 9, 10, 16, 18, 19]), Candidate: [ 3  1  0  1  0  2  0  0  2  1 -1  1  1  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  1 -1  1 -1  0  0  1  0 -1  0  1 -1] (Indices: [1, 2, 4, 6, 9, 11, 15, 16, 19]), Candidate: [3 1 0 1 0 2 0 0 2 0 1 0 1 1 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 86600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  1 -1  0  0  1  0 -1  0  1  0 -1  0] (Indices: [1, 2, 4, 6, 9, 13, 14, 17, 18]), Candidate: [ 3  1  0  1  0  2  0  0  2  0  0  1  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  0  1  0 -1  1  0 -1  1 -1  0  0  0] (Indices: [1, 2, 4, 6, 10, 11, 13, 14, 16]), Candidate: [ 3  1  0  1  0  2  0  0  1  2  0  0  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  0  1 -1  1 -1  1  0 -1  1 -1  0  0] (Indices: [1, 2, 4, 6, 10, 12, 14, 15, 17]), Candidate: [ 3  1  0  1  0  2  0  0  1  2 -1  2  0  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  0  1 -1  0  0  0  1  0  0 -1  1 -1] (Indices: [1, 2, 4, 6, 10, 15, 16, 17, 19]), Candidate: [ 3  1  0  1  0  2  0  0  1  2 -1  1  1  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  0  0  1 -1  1 -1  1  0 -1  1 -1  0] (Indices: [1, 2, 4, 6, 11, 13, 15, 16, 18]), Candidate: [3 1 0 1 0 2 0 0 1 1 1 0 2 0 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 86850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  0  0  0  1 -1  1 -1  1  0  0 -1  0] (Indices: [1, 2, 4, 6, 12, 14, 16, 17, 18]), Candidate: [ 3  1  0  1  0  2  0  0  1  1  0  2  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0  0  0 -1  0  1 -1  0  0  0  0  1 -1] (Indices: [1, 2, 4, 7, 8, 9, 10, 13, 19]), Candidate: [ 3  1  0  1  0  1  2  0  1  1 -1  1  2  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0  0 -1  0  1 -1  1  0 -1  0  0  0  0] (Indices: [1, 2, 4, 7, 8, 9, 12, 14, 15]), Candidate: [3 1 0 1 0 1 2 0 1 0 0 2 0 2 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 87000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0 -1  1  0  0  0 -1  0  0  0  0  0  0] (Indices: [1, 2, 4, 7, 8, 10, 11, 12, 13]), Candidate: [3 1 0 1 0 1 2 0 0 2 0 1 1 0 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 87050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0 -1  1 -1  0  1  0 -1  1 -1  0  0  0] (Indices: [1, 2, 4, 7, 8, 10, 13, 14, 16]), Candidate: [ 3  1  0  1  0  1  2  0  0  2 -1  1  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 87100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0 -1  0  1  0 -1  0  0  1 -1  1 -1  0] (Indices: [1, 2, 4, 7, 8, 11, 12, 16, 18]), Candidate: [3 1 0 1 0 1 2 0 0 1 1 1 0 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 87150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0 -1  0  0  1  0 -1  0  1 -1  1 -1  0] (Indices: [1, 2, 4, 7, 8, 12, 13, 16, 18]), Candidate: [3 1 0 1 0 1 2 0 0 1 0 2 1 0 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 87200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0 -1  0  0  0  0  1  0 -1  0  1  0 -1] (Indices: [1, 2, 4, 7, 8, 14, 15, 18, 19]), Candidate: [3 1 0 1 0 1 2 0 0 1 0 1 1 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 87250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  1  0 -1  1 -1  0  1 -1  1 -1  0  0] (Indices: [1, 2, 4, 7, 9, 10, 12, 15, 17]), Candidate: [ 3  1  0  1  0  1  2 -1  2  1 -1  2  0  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 87300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  1 -1  1  0 -1  1  0 -1  0  0  0  0] (Indices: [1, 2, 4, 7, 9, 11, 12, 14, 15]), Candidate: [ 3  1  0  1  0  1  2 -1  2  0  1  1  0  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  1 -1  0  1  0  0  0 -1  0  0  0  0] (Indices: [1, 2, 4, 7, 9, 12, 13, 14, 15]), Candidate: [ 3  1  0  1  0  1  2 -1  2  0  0  2  1  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  1 -1  0  0  1 -1  1 -1  0  1  0 -1] (Indices: [1, 2, 4, 7, 9, 13, 15, 18, 19]), Candidate: [ 3  1  0  1  0  1  2 -1  2  0  0  1  2  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  0  1  0 -1  1 -1  0  1  0 -1  0  0] (Indices: [1, 2, 4, 7, 10, 11, 13, 16, 17]), Candidate: [ 3  1  0  1  0  1  2 -1  1  2  0  0  2  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  0  1 -1  1 -1  1 -1  0  0  1  0 -1] (Indices: [1, 2, 4, 7, 10, 12, 14, 18, 19]), Candidate: [ 3  1  0  1  0  1  2 -1  1  2 -1  2  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 87550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  0  0  1  0  0  0 -1  0  0  0  1 -1] (Indices: [1, 2, 4, 7, 11, 12, 13, 14, 19]), Candidate: [ 3  1  0  1  0  1  2 -1  1  1  1  1  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 87600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  0  0  1 -1  1 -1  0  0  1  0  0 -1] (Indices: [1, 2, 4, 7, 11, 13, 17, 18, 19]), Candidate: [ 3  1  0  1  0  1  2 -1  1  1  1  0  2  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  0  0  0  1 -1  0  0  1  0  0  0 -1] (Indices: [1, 2, 4, 7, 12, 16, 17, 18, 19]), Candidate: [ 3  1  0  1  0  1  2 -1  1  1  0  2  0  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1  0  0 -1  1  0  0 -1  0  0  0  0  0] (Indices: [1, 2, 4, 8, 9, 10, 12, 13, 14]), Candidate: [ 3  1  0  1  0  1  1  1  1  1 -1  2  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 87750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1  0  0 -1  0  0  0  1 -1  1 -1  1 -1] (Indices: [1, 2, 4, 8, 9, 10, 15, 17, 19]), Candidate: [ 3  1  0  1  0  1  1  1  1  1 -1  1  1  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1  0 -1  1 -1  0  1 -1  0  1 -1  1 -1] (Indices: [1, 2, 4, 8, 9, 11, 14, 17, 19]), Candidate: [ 3  1  0  1  0  1  1  1  1  0  1  0  1  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1  0 -1  0  0  1  0  0 -1  0  0  1 -1] (Indices: [1, 2, 4, 8, 9, 13, 14, 15, 19]), Candidate: [3 1 0 1 0 1 1 1 1 0 0 1 2 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 87900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1 -1  1  0  0 -1  0  0  0  1  0 -1  0] (Indices: [1, 2, 4, 8, 10, 11, 12, 17, 18]), Candidate: [3 1 0 1 0 1 1 1 0 2 0 1 0 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 87950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1 -1  1 -1  1  0 -1  0  0  1  0 -1  0] (Indices: [1, 2, 4, 8, 10, 12, 13, 17, 18]), Candidate: [ 3  1  0  1  0  1  1  1  0  2 -1  2  1  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1 -1  1 -1  0  0  1 -1  1  0 -1  1 -1] (Indices: [1, 2, 4, 8, 10, 14, 16, 17, 19]), Candidate: [ 3  1  0  1  0  1  1  1  0  2 -1  1  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 88050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1 -1  0  1 -1  1  0 -1  0  1  0 -1  0] (Indices: [1, 2, 4, 8, 11, 13, 14, 17, 18]), Candidate: [ 3  1  0  1  0  1  1  1  0  1  1  0  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1 -1  0  0  1 -1  1  0  0 -1  0  1 -1] (Indices: [1, 2, 4, 8, 12, 14, 15, 16, 19]), Candidate: [3 1 0 1 0 1 1 1 0 1 0 2 0 2 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 88150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  1  0  0  0 -1  0  0  1 -1  1 -1  0] (Indices: [1, 2, 4, 9, 10, 11, 12, 16, 18]), Candidate: [3 1 0 1 0 1 1 0 2 1 0 1 0 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 88200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  1  0 -1  1  0 -1  0  1 -1  1 -1  0] (Indices: [1, 2, 4, 9, 10, 12, 13, 16, 18]), Candidate: [ 3  1  0  1  0  1  1  0  2  1 -1  2  1  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  1  0 -1  0  0  1  0 -1  0  1  0 -1] (Indices: [1, 2, 4, 9, 10, 14, 15, 18, 19]), Candidate: [ 3  1  0  1  0  1  1  0  2  1 -1  1  1  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  1 -1  1 -1  1  0 -1  1 -1  1 -1  0] (Indices: [1, 2, 4, 9, 11, 13, 14, 16, 18]), Candidate: [ 3  1  0  1  0  1  1  0  2  0  1  0  2  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  1 -1  0  1 -1  1  0  0  0 -1  0  0] (Indices: [1, 2, 4, 9, 12, 14, 15, 16, 17]), Candidate: [3 1 0 1 0 1 1 0 2 0 0 2 0 2 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 88400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  0  1  0  0  0 -1  0  0  0  1  0 -1] (Indices: [1, 2, 4, 10, 11, 12, 13, 18, 19]), Candidate: [3 1 0 1 0 1 1 0 1 2 0 1 1 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 88450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  0  1  0 -1  0  1 -1  0  1  0  0 -1] (Indices: [1, 2, 4, 10, 11, 14, 17, 18, 19]), Candidate: [ 3  1  0  1  0  1  1  0  1  2  0  0  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  0  1 -1  0  1  0 -1  0  1  0  0 -1] (Indices: [1, 2, 4, 10, 13, 14, 17, 18, 19]), Candidate: [ 3  1  0  1  0  1  1  0  1  2 -1  1  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 88550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  0  0  1 -1  1  0  0 -1  1  0 -1  0] (Indices: [1, 2, 4, 11, 13, 14, 15, 17, 18]), Candidate: [3 1 0 1 0 1 1 0 1 1 1 0 2 1 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 88600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0  0  0 -1  0  0  0  1 -1  0  0  0  0] (Indices: [1, 2, 5, 6, 7, 8, 9, 10, 15]), Candidate: [ 3  1  0  0  2  1  1  0  1  1 -1  1  1  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0 -1  1 -1  1 -1  1 -1  0  0  0  0  0] (Indices: [1, 2, 5, 6, 7, 8, 10, 12, 14]), Candidate: [ 3  1  0  0  2  1  1  0  0  2 -1  2  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 88700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0 -1  0  1 -1  0  0  0  1 -1  1 -1  0] (Indices: [1, 2, 5, 6, 7, 8, 11, 16, 18]), Candidate: [3 1 0 0 2 1 1 0 0 1 1 0 1 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 88750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0 -1  0  0  0  0  1 -1  0  0  1  0 -1] (Indices: [1, 2, 5, 6, 7, 8, 14, 18, 19]), Candidate: [ 3  1  0  0  2  1  1  0  0  1  0  1  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  1 -1  1  0 -1  0  0  1 -1  0  0  0] (Indices: [1, 2, 5, 6, 7, 9, 11, 12, 16]), Candidate: [ 3  1  0  0  2  1  1 -1  2  0  1  1  0  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  1 -1  0  0  1  0 -1  0  0  0  1 -1] (Indices: [1, 2, 5, 6, 7, 9, 13, 14, 19]), Candidate: [ 3  1  0  0  2  1  1 -1  2  0  0  1  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 88900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  0  1  0 -1  0  0  1 -1  1 -1  0  0] (Indices: [1, 2, 5, 6, 7, 10, 11, 15, 17]), Candidate: [ 3  1  0  0  2  1  1 -1  1  2  0  0  1  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  0  1 -1  0  0  1 -1  1 -1  1 -1  0] (Indices: [1, 2, 5, 6, 7, 10, 14, 16, 18]), Candidate: [ 3  1  0  0  2  1  1 -1  1  2 -1  1  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 89000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  0  0  1 -1  1 -1  0  0  0  1  0 -1] (Indices: [1, 2, 5, 6, 7, 11, 13, 18, 19]), Candidate: [ 3  1  0  0  2  1  1 -1  1  1  1  0  2  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  0  0  0  1 -1  0  1 -1  1 -1  1 -1] (Indices: [1, 2, 5, 6, 7, 12, 15, 17, 19]), Candidate: [ 3  1  0  0  2  1  1 -1  1  1  0  2  0  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1  0  0 -1  1 -1  1 -1  0  0  0  0  0] (Indices: [1, 2, 5, 6, 8, 9, 10, 12, 14]), Candidate: [ 3  1  0  0  2  1  0  1  1  1 -1  2  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 89150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1  0 -1  1 -1  0  0  0  1 -1  1 -1  0] (Indices: [1, 2, 5, 6, 8, 9, 11, 16, 18]), Candidate: [3 1 0 0 2 1 0 1 1 0 1 0 1 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 89200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1  0 -1  0  0  0  1 -1  0  0  1  0 -1] (Indices: [1, 2, 5, 6, 8, 9, 14, 18, 19]), Candidate: [ 3  1  0  0  2  1  0  1  1  0  0  1  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1 -1  1 -1  1 -1  0  1  0 -1  0  0  0] (Indices: [1, 2, 5, 6, 8, 10, 12, 15, 16]), Candidate: [ 3  1  0  0  2  1  0  1  0  2 -1  2  0  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1 -1  0  1  0  0 -1  0  0  0  0  1 -1] (Indices: [1, 2, 5, 6, 8, 11, 12, 13, 19]), Candidate: [3 1 0 0 2 1 0 1 0 1 1 1 1 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 89350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1 -1  0  1 -1  0  0  0  0  1  0  0 -1] (Indices: [1, 2, 5, 6, 8, 11, 17, 18, 19]), Candidate: [3 1 0 0 2 1 0 1 0 1 1 0 1 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 89400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1 -1  0  0  0  1 -1  1 -1  1 -1  1 -1] (Indices: [1, 2, 5, 6, 8, 13, 15, 17, 19]), Candidate: [3 1 0 0 2 1 0 1 0 1 0 1 2 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 89450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  1  0 -1  1  0 -1  1 -1  0  0  0  0] (Indices: [1, 2, 5, 6, 9, 10, 12, 13, 15]), Candidate: [ 3  1  0  0  2  1  0  0  2  1 -1  2  1  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  1  0 -1  0  0  0  1 -1  0  1  0 -1] (Indices: [1, 2, 5, 6, 9, 10, 15, 18, 19]), Candidate: [ 3  1  0  0  2  1  0  0  2  1 -1  1  1  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  1 -1  1 -1  0  1 -1  0  0  1  0 -1] (Indices: [1, 2, 5, 6, 9, 11, 14, 18, 19]), Candidate: [ 3  1  0  0  2  1  0  0  2  0  1  0  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  1 -1  0  0  1  0 -1  1  0 -1  0  0] (Indices: [1, 2, 5, 6, 9, 13, 14, 16, 17]), Candidate: [ 3  1  0  0  2  1  0  0  2  0  0  1  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  0  1  0  0 -1  0  0  0  1 -1  1 -1] (Indices: [1, 2, 5, 6, 10, 11, 12, 17, 19]), Candidate: [3 1 0 0 2 1 0 0 1 2 0 1 0 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 89700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  0  1 -1  1  0 -1  0  0  1 -1  1 -1] (Indices: [1, 2, 5, 6, 10, 12, 13, 17, 19]), Candidate: [ 3  1  0  0  2  1  0  0  1  2 -1  2  1  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  0  1 -1  0  0  1 -1  1 -1  1  0 -1] (Indices: [1, 2, 5, 6, 10, 14, 16, 18, 19]), Candidate: [ 3  1  0  0  2  1  0  0  1  2 -1  1  1  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 89800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  0  0  1 -1  1  0 -1  0  1 -1  1 -1] (Indices: [1, 2, 5, 6, 11, 13, 14, 17, 19]), Candidate: [ 3  1  0  0  2  1  0  0  1  1  1  0  2  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  0  0  0  1 -1  1  0 -1  1  0 -1  0] (Indices: [1, 2, 5, 6, 12, 14, 15, 17, 18]), Candidate: [3 1 0 0 2 1 0 0 1 1 0 2 0 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 89900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0  0  0 -1  0  1 -1  0  1 -1  0  0  0] (Indices: [1, 2, 5, 7, 8, 9, 10, 13, 16]), Candidate: [ 3  1  0  0  2  0  2  0  1  1 -1  1  2  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0  0 -1  0  1  0 -1  0  0  1 -1  0  0] (Indices: [1, 2, 5, 7, 8, 9, 12, 13, 17]), Candidate: [3 1 0 0 2 0 2 0 1 0 0 2 1 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 90000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0  0 -1  0  0  0  0  0  1  0 -1  1 -1] (Indices: [1, 2, 5, 7, 8, 9, 16, 17, 19]), Candidate: [3 1 0 0 2 0 2 0 1 0 0 1 1 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 90050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0 -1  1 -1  1 -1  0  0  0  1 -1  1 -1] (Indices: [1, 2, 5, 7, 8, 10, 12, 17, 19]), Candidate: [ 3  1  0  0  2  0  2  0  0  2 -1  2  0  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0 -1  0  1  0 -1  0  1 -1  0  1 -1  0] (Indices: [1, 2, 5, 7, 8, 11, 12, 15, 18]), Candidate: [3 1 0 0 2 0 2 0 0 1 1 1 0 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 90150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0 -1  0  0  1  0 -1  1 -1  0  1 -1  0] (Indices: [1, 2, 5, 7, 8, 12, 13, 15, 18]), Candidate: [3 1 0 0 2 0 2 0 0 1 0 2 1 0 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 90200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0 -1  0  0  0  0  1  0  0 -1  0  1 -1] (Indices: [1, 2, 5, 7, 8, 14, 15, 16, 19]), Candidate: [3 1 0 0 2 0 2 0 0 1 0 1 1 2 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 90250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  1  0 -1  1 -1  1 -1  0  0  1 -1  0] (Indices: [1, 2, 5, 7, 9, 10, 12, 14, 18]), Candidate: [ 3  1  0  0  2  0  2 -1  2  1 -1  2  0  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 90300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  1 -1  1  0  0 -1  0  0  1 -1  0  0] (Indices: [1, 2, 5, 7, 9, 11, 12, 13, 17]), Candidate: [ 3  1  0  0  2  0  2 -1  2  0  1  1  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  1 -1  1 -1  0  0  0  1  0 -1  1 -1] (Indices: [1, 2, 5, 7, 9, 11, 16, 17, 19]), Candidate: [ 3  1  0  0  2  0  2 -1  2  0  1  0  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  1 -1  0  0  1 -1  1  0 -1  0  1 -1] (Indices: [1, 2, 5, 7, 9, 13, 15, 16, 19]), Candidate: [ 3  1  0  0  2  0  2 -1  2  0  0  1  2  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  0  1  0 -1  1 -1  1 -1  1 -1  0  0] (Indices: [1, 2, 5, 7, 10, 11, 13, 15, 17]), Candidate: [ 3  1  0  0  2  0  2 -1  1  2  0  0  2  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  0  1 -1  1 -1  1 -1  1 -1  0  1 -1] (Indices: [1, 2, 5, 7, 10, 12, 14, 16, 19]), Candidate: [ 3  1  0  0  2  0  2 -1  1  2 -1  2  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 90550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  0  0  1  0  0  0 -1  1 -1  0  0  0] (Indices: [1, 2, 5, 7, 11, 12, 13, 14, 16]), Candidate: [ 3  1  0  0  2  0  2 -1  1  1  1  1  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 90600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  0  0  1 -1  1 -1  0  1  0  0 -1  0] (Indices: [1, 2, 5, 7, 11, 13, 16, 17, 18]), Candidate: [ 3  1  0  0  2  0  2 -1  1  1  1  0  2  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  0  0  0  1 -1  0  1  0  0 -1  1 -1] (Indices: [1, 2, 5, 7, 12, 15, 16, 17, 19]), Candidate: [ 3  1  0  0  2  0  2 -1  1  1  0  2  0  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1  0  0  0 -1  0  0  0  0  1  0 -1  0] (Indices: [1, 2, 5, 8, 9, 10, 11, 17, 18]), Candidate: [3 1 0 0 2 0 1 1 1 1 0 0 1 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 90750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1  0  0 -1  0  0  0  1  0 -1  1 -1  0] (Indices: [1, 2, 5, 8, 9, 10, 15, 16, 18]), Candidate: [ 3  1  0  0  2  0  1  1  1  1 -1  1  1  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1  0 -1  1 -1  0  1 -1  1 -1  1 -1  0] (Indices: [1, 2, 5, 8, 9, 11, 14, 16, 18]), Candidate: [ 3  1  0  0  2  0  1  1  1  0  1  0  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1  0 -1  0  0  1  0  0  0 -1  0  0  0] (Indices: [1, 2, 5, 8, 9, 13, 14, 15, 16]), Candidate: [3 1 0 0 2 0 1 1 1 0 0 1 2 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 90900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1 -1  1  0  0 -1  0  0  1  0 -1  0  0] (Indices: [1, 2, 5, 8, 10, 11, 12, 16, 17]), Candidate: [3 1 0 0 2 0 1 1 0 2 0 1 0 1 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 90950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1 -1  1 -1  1  0 -1  0  1  0 -1  0  0] (Indices: [1, 2, 5, 8, 10, 12, 13, 16, 17]), Candidate: [ 3  1  0  0  2  0  1  1  0  2 -1  2  1  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1 -1  1 -1  0  0  1  0 -1  1 -1  1 -1] (Indices: [1, 2, 5, 8, 10, 14, 15, 17, 19]), Candidate: [ 3  1  0  0  2  0  1  1  0  2 -1  1  1  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1 -1  0  1 -1  1  0 -1  1  0 -1  0  0] (Indices: [1, 2, 5, 8, 11, 13, 14, 16, 17]), Candidate: [ 3  1  0  0  2  0  1  1  0  1  1  0  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1 -1  0  0  1  0 -1  0  0  1  0  0 -1] (Indices: [1, 2, 5, 8, 12, 13, 17, 18, 19]), Candidate: [3 1 0 0 2 0 1 1 0 1 0 2 1 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 91150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  1  0  0  0 -1  0  1 -1  0  1 -1  0] (Indices: [1, 2, 5, 9, 10, 11, 12, 15, 18]), Candidate: [3 1 0 0 2 0 1 0 2 1 0 1 0 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 91200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  1  0 -1  1  0 -1  1 -1  0  1 -1  0] (Indices: [1, 2, 5, 9, 10, 12, 13, 15, 18]), Candidate: [ 3  1  0  0  2  0  1  0  2  1 -1  2  1  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  1  0 -1  0  0  1  0  0 -1  0  1 -1] (Indices: [1, 2, 5, 9, 10, 14, 15, 16, 19]), Candidate: [ 3  1  0  0  2  0  1  0  2  1 -1  1  1  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  1 -1  1 -1  1  0  0 -1  0  1 -1  0] (Indices: [1, 2, 5, 9, 11, 13, 14, 15, 18]), Candidate: [3 1 0 0 2 0 1 0 2 0 1 0 2 1 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 91350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  1 -1  0  1  0 -1  0  1  0 -1  1 -1] (Indices: [1, 2, 5, 9, 12, 13, 16, 17, 19]), Candidate: [3 1 0 0 2 0 1 0 2 0 0 2 1 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 91400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  0  1  0  0  0 -1  0  1 -1  0  1 -1] (Indices: [1, 2, 5, 10, 11, 12, 13, 16, 19]), Candidate: [3 1 0 0 2 0 1 0 1 2 0 1 1 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 91450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  0  1  0 -1  0  1 -1  1  0  0 -1  0] (Indices: [1, 2, 5, 10, 11, 14, 16, 17, 18]), Candidate: [ 3  1  0  0  2  0  1  0  1  2  0  0  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  0  1 -1  0  1  0 -1  1  0  0 -1  0] (Indices: [1, 2, 5, 10, 13, 14, 16, 17, 18]), Candidate: [ 3  1  0  0  2  0  1  0  1  2 -1  1  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 91550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  0  0  1 -1  1  0  0  0  0 -1  0  0] (Indices: [1, 2, 5, 11, 13, 14, 15, 16, 17]), Candidate: [3 1 0 0 2 0 1 0 1 1 1 0 2 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 91600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0  0  0  0 -1  1 -1  0  0  0  0  0  0] (Indices: [1, 2, 6, 7, 8, 9, 10, 11, 13]), Candidate: [3 1 0 0 1 2 1 0 1 1 0 0 2 0 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 91650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0  0 -1  1 -1  0  1 -1  0  1 -1  0  0] (Indices: [1, 2, 6, 7, 8, 9, 11, 14, 17]), Candidate: [ 3  1  0  0  1  2  1  0  1  0  1  0  1  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0  0 -1  0  0  0  1  0 -1  1 -1  0  0] (Indices: [1, 2, 6, 7, 8, 9, 14, 15, 17]), Candidate: [3 1 0 0 1 2 1 0 1 0 0 1 1 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 91750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0 -1  1 -1  1  0 -1  0  0  1 -1  0  0] (Indices: [1, 2, 6, 7, 8, 10, 12, 13, 17]), Candidate: [ 3  1  0  0  1  2  1  0  0  2 -1  2  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0 -1  1 -1  0  0  0  0  1  0 -1  1 -1] (Indices: [1, 2, 6, 7, 8, 10, 16, 17, 19]), Candidate: [ 3  1  0  0  1  2  1  0  0  2 -1  1  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0 -1  0  1 -1  0  0  1  0 -1  1 -1  0] (Indices: [1, 2, 6, 7, 8, 11, 15, 16, 18]), Candidate: [3 1 0 0 1 2 1 0 0 1 1 0 1 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 91900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0 -1  0  0  0  1  0 -1  1 -1  0  1 -1] (Indices: [1, 2, 6, 7, 8, 13, 14, 16, 19]), Candidate: [ 3  1  0  0  1  2  1  0  0  1  0  1  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  1  0  0 -1  0  0  1 -1  0  0  1 -1] (Indices: [1, 2, 6, 7, 9, 10, 11, 15, 19]), Candidate: [ 3  1  0  0  1  2  1 -1  2  1  0  0  1  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  1  0 -1  0  0  1 -1  0  1  0 -1  0] (Indices: [1, 2, 6, 7, 9, 10, 14, 17, 18]), Candidate: [ 3  1  0  0  1  2  1 -1  2  1 -1  1  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 92050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  1 -1  1 -1  0  1  0 -1  1 -1  0  0] (Indices: [1, 2, 6, 7, 9, 11, 14, 15, 17]), Candidate: [ 3  1  0  0  1  2  1 -1  2  0  1  0  1  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  1 -1  0  1 -1  0  0  1  0  0 -1  0] (Indices: [1, 2, 6, 7, 9, 12, 16, 17, 18]), Candidate: [ 3  1  0  0  1  2  1 -1  2  0  0  2  0  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  0  1  0  0 -1  0  1  0 -1  0  0  0] (Indices: [1, 2, 6, 7, 10, 11, 12, 15, 16]), Candidate: [ 3  1  0  0  1  2  1 -1  1  2  0  1  0  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  0  1 -1  1  0 -1  1  0 -1  0  0  0] (Indices: [1, 2, 6, 7, 10, 12, 13, 15, 16]), Candidate: [ 3  1  0  0  1  2  1 -1  1  2 -1  2  1  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 92250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  0  1 -1  0  0  1  0  0  0 -1  0  0] (Indices: [1, 2, 6, 7, 10, 14, 15, 16, 17]), Candidate: [ 3  1  0  0  1  2  1 -1  1  2 -1  1  1  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 92300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  0  0  1 -1  1  0  0  0 -1  0  0  0] (Indices: [1, 2, 6, 7, 11, 13, 14, 15, 16]), Candidate: [ 3  1  0  0  1  2  1 -1  1  1  1  0  2  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  0  0  0  1  0 -1  1 -1  0  1  0 -1] (Indices: [1, 2, 6, 7, 12, 13, 15, 18, 19]), Candidate: [ 3  1  0  0  1  2  1 -1  1  1  0  2  1  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1  0  0  0 -1  1 -1  0  1 -1  0  0  0] (Indices: [1, 2, 6, 8, 9, 10, 11, 13, 16]), Candidate: [3 1 0 0 1 2 0 1 1 1 0 0 2 0 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 92450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1  0  0 -1  0  1 -1  0  1 -1  1 -1  0] (Indices: [1, 2, 6, 8, 9, 10, 13, 16, 18]), Candidate: [ 3  1  0  0  1  2  0  1  1  1 -1  1  2  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1  0 -1  1 -1  1  0 -1  0  0  0  1 -1] (Indices: [1, 2, 6, 8, 9, 11, 13, 14, 19]), Candidate: [ 3  1  0  0  1  2  0  1  1  0  1  0  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1  0 -1  0  1 -1  1 -1  1  0 -1  0  0] (Indices: [1, 2, 6, 8, 9, 12, 14, 16, 17]), Candidate: [ 3  1  0  0  1  2  0  1  1  0  0  2  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1  0 -1  0  0  0  0  0  1  0  0  0 -1] (Indices: [1, 2, 6, 8, 9, 16, 17, 18, 19]), Candidate: [3 1 0 0 1 2 0 1 1 0 0 1 1 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 92650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1 -1  1  0 -1  0  0  1 -1  1  0 -1  0] (Indices: [1, 2, 6, 8, 10, 11, 15, 17, 18]), Candidate: [3 1 0 0 1 2 0 1 0 2 0 0 1 1 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 92700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1 -1  1 -1  0  1  0 -1  0  1 -1  1 -1] (Indices: [1, 2, 6, 8, 10, 13, 14, 17, 19]), Candidate: [ 3  1  0  0  1  2  0  1  0  2 -1  1  2  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 92750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1 -1  0  1  0 -1  1 -1  0  1 -1  1 -1] (Indices: [1, 2, 6, 8, 11, 12, 14, 17, 19]), Candidate: [ 3  1  0  0  1  2  0  1  0  1  1  1  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1 -1  0  0  1  0  0  0 -1  0  0  1 -1] (Indices: [1, 2, 6, 8, 12, 13, 14, 15, 19]), Candidate: [3 1 0 0 1 2 0 1 0 1 0 2 1 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 92850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1 -1  0  0  0  0  1  0 -1  1  0  0 -1] (Indices: [1, 2, 6, 8, 14, 15, 17, 18, 19]), Candidate: [3 1 0 0 1 2 0 1 0 1 0 1 1 2 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 92900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  1  0  0 -1  0  0  1  0 -1  1 -1  0] (Indices: [1, 2, 6, 9, 10, 11, 15, 16, 18]), Candidate: [3 1 0 0 1 2 0 0 2 1 0 0 1 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 92950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  1  0 -1  0  1  0 -1  1 -1  0  1 -1] (Indices: [1, 2, 6, 9, 10, 13, 14, 16, 19]), Candidate: [ 3  1  0  0  1  2  0  0  2  1 -1  1  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 93000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  1 -1  1  0 -1  1 -1  1 -1  0  1 -1] (Indices: [1, 2, 6, 9, 11, 12, 14, 16, 19]), Candidate: [ 3  1  0  0  1  2  0  0  2  0  1  1  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  1 -1  0  1  0  0  0 -1  1 -1  0  0] (Indices: [1, 2, 6, 9, 12, 13, 14, 15, 17]), Candidate: [3 1 0 0 1 2 0 0 2 0 0 2 1 1 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 93100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  1 -1  0  0  0  1  0  0  0 -1  1 -1] (Indices: [1, 2, 6, 9, 14, 15, 16, 17, 19]), Candidate: [3 1 0 0 1 2 0 0 2 0 0 1 1 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 93150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  0  1  0 -1  1 -1  1  0  0 -1  0  0] (Indices: [1, 2, 6, 10, 11, 13, 15, 16, 17]), Candidate: [3 1 0 0 1 2 0 0 1 2 0 0 2 0 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 93200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  0  1 -1  1 -1  1  0 -1  0  1  0 -1] (Indices: [1, 2, 6, 10, 12, 14, 15, 18, 19]), Candidate: [ 3  1  0  0  1  2  0  0  1  2 -1  2  0  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  0  0  1  0  0 -1  0  0  1  0  0 -1] (Indices: [1, 2, 6, 11, 12, 13, 17, 18, 19]), Candidate: [3 1 0 0 1 2 0 0 1 1 1 1 1 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 93300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  0  0  0  1  0 -1  1 -1  1  0  0 -1] (Indices: [1, 2, 6, 12, 13, 15, 17, 18, 19]), Candidate: [3 1 0 0 1 2 0 0 1 1 0 2 1 0 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 93350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0  0  0 -1  1 -1  1 -1  1 -1  0  0  0] (Indices: [1, 2, 7, 8, 9, 10, 12, 14, 16]), Candidate: [ 3  1  0  0  1  1  2  0  1  1 -1  2  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 93400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0  0 -1  1  0  0 -1  1 -1  0  0  0  0] (Indices: [1, 2, 7, 8, 9, 11, 12, 13, 15]), Candidate: [3 1 0 0 1 1 2 0 1 0 1 1 1 0 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 93450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0  0 -1  1 -1  0  0  1 -1  0  1  0 -1] (Indices: [1, 2, 7, 8, 9, 11, 15, 18, 19]), Candidate: [3 1 0 0 1 1 2 0 1 0 1 0 1 1 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 93500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0  0 -1  0  0  1 -1  1  0  0 -1  0  0] (Indices: [1, 2, 7, 8, 9, 13, 15, 16, 17]), Candidate: [3 1 0 0 1 1 2 0 1 0 0 1 2 0 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 93550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0 -1  1  0 -1  1  0 -1  0  0  0  1 -1] (Indices: [1, 2, 7, 8, 10, 11, 13, 14, 19]), Candidate: [ 3  1  0  0  1  1  2  0  0  2  0  0  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0 -1  1 -1  1 -1  1 -1  1  0 -1  0  0] (Indices: [1, 2, 7, 8, 10, 12, 14, 16, 17]), Candidate: [ 3  1  0  0  1  1  2  0  0  2 -1  2  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 93650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0 -1  1 -1  0  0  0  0  1  0  0  0 -1] (Indices: [1, 2, 7, 8, 10, 16, 17, 18, 19]), Candidate: [ 3  1  0  0  1  1  2  0  0  2 -1  1  1  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0 -1  0  1 -1  1 -1  1 -1  1 -1  1 -1] (Indices: [1, 2, 7, 8, 11, 13, 15, 17, 19]), Candidate: [3 1 0 0 1 1 2 0 0 1 1 0 2 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 93750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0 -1  0  0  1 -1  1 -1  0  1  0  0 -1] (Indices: [1, 2, 7, 8, 12, 14, 17, 18, 19]), Candidate: [ 3  1  0  0  1  1  2  0  0  1  0  2  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  1  0  0 -1  1  0 -1  0  1 -1  0  0] (Indices: [1, 2, 7, 9, 10, 11, 13, 14, 17]), Candidate: [ 3  1  0  0  1  1  2 -1  2  1  0  0  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 93850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  1  0 -1  1 -1  1  0 -1  0  1 -1  0] (Indices: [1, 2, 7, 9, 10, 12, 14, 15, 18]), Candidate: [ 3  1  0  0  1  1  2 -1  2  1 -1  2  0  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 93900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  1  0 -1  0  0  0  1  0 -1  1  0 -1] (Indices: [1, 2, 7, 9, 10, 15, 16, 18, 19]), Candidate: [ 3  1  0  0  1  1  2 -1  2  1 -1  1  1  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 93950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  1 -1  1 -1  1 -1  1  0 -1  0  1 -1] (Indices: [1, 2, 7, 9, 11, 13, 15, 16, 19]), Candidate: [ 3  1  0  0  1  1  2 -1  2  0  1  0  2  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  1 -1  0  1 -1  1 -1  1  0 -1  1 -1] (Indices: [1, 2, 7, 9, 12, 14, 16, 17, 19]), Candidate: [ 3  1  0  0  1  1  2 -1  2  0  0  2  0  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 94050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  0  1  0  0 -1  1 -1  1 -1  0  1 -1] (Indices: [1, 2, 7, 10, 11, 12, 14, 16, 19]), Candidate: [ 3  1  0  0  1  1  2 -1  1  2  0  1  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 94100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  0  1 -1  1  0  0  0 -1  1 -1  0  0] (Indices: [1, 2, 7, 10, 12, 13, 14, 15, 17]), Candidate: [ 3  1  0  0  1  1  2 -1  1  2 -1  2  1  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 94150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  0  1 -1  0  0  1  0  0  0 -1  1 -1] (Indices: [1, 2, 7, 10, 14, 15, 16, 17, 19]), Candidate: [ 3  1  0  0  1  1  2 -1  1  2 -1  1  1  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 94200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  0  0  1 -1  1 -1  1  0  0  0 -1  0] (Indices: [1, 2, 7, 11, 13, 15, 16, 17, 18]), Candidate: [ 3  1  0  0  1  1  2 -1  1  1  1  0  2  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1  0  0  0  0 -1  0  1  0 -1  0  0  0] (Indices: [1, 2, 8, 9, 10, 11, 12, 15, 16]), Candidate: [3 1 0 0 1 1 1 1 1 1 0 1 0 1 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 94300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1  0  0 -1  1  0 -1  1  0 -1  0  0  0] (Indices: [1, 2, 8, 9, 10, 12, 13, 15, 16]), Candidate: [ 3  1  0  0  1  1  1  1  1  1 -1  2  1  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1  0  0 -1  0  0  1  0  0  0 -1  0  0] (Indices: [1, 2, 8, 9, 10, 14, 15, 16, 17]), Candidate: [ 3  1  0  0  1  1  1  1  1  1 -1  1  1  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1  0 -1  1 -1  1  0  0  0 -1  0  0  0] (Indices: [1, 2, 8, 9, 11, 13, 14, 15, 16]), Candidate: [3 1 0 0 1 1 1 1 1 0 1 0 2 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 94450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1  0 -1  0  1  0 -1  1 -1  0  1  0 -1] (Indices: [1, 2, 8, 9, 12, 13, 15, 18, 19]), Candidate: [3 1 0 0 1 1 1 1 1 0 0 2 1 0 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 94500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1 -1  1  0  0  0 -1  0  1  0 -1  0  0] (Indices: [1, 2, 8, 10, 11, 12, 13, 16, 17]), Candidate: [3 1 0 0 1 1 1 1 0 2 0 1 1 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 94550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1 -1  1  0 -1  0  1  0 -1  1 -1  1 -1] (Indices: [1, 2, 8, 10, 11, 14, 15, 17, 19]), Candidate: [3 1 0 0 1 1 1 1 0 2 0 0 1 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 94600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1 -1  1 -1  0  1  0  0 -1  1 -1  1 -1] (Indices: [1, 2, 8, 10, 13, 14, 15, 17, 19]), Candidate: [ 3  1  0  0  1  1  1  1  0  2 -1  1  2  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1 -1  0  1  0 -1  0  1 -1  1  0  0 -1] (Indices: [1, 2, 8, 11, 12, 15, 17, 18, 19]), Candidate: [3 1 0 0 1 1 1 1 0 1 1 1 0 1 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 94700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1 -1  0  0  0  0  1  0  0  0  0  0 -1] (Indices: [1, 2, 8, 14, 15, 16, 17, 18, 19]), Candidate: [3 1 0 0 1 1 1 1 0 1 0 1 1 2 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 94750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  1  0  0 -1  1 -1  1 -1  1 -1  1 -1] (Indices: [1, 2, 9, 10, 11, 13, 15, 17, 19]), Candidate: [3 1 0 0 1 1 1 0 2 1 0 0 2 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 94800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  1  0 -1  1 -1  1 -1  0  1  0  0 -1] (Indices: [1, 2, 9, 10, 12, 14, 17, 18, 19]), Candidate: [ 3  1  0  0  1  1  1  0  2  1 -1  2  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 94850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  1 -1  1  0 -1  1  0 -1  1  0 -1  0] (Indices: [1, 2, 9, 11, 12, 14, 15, 17, 18]), Candidate: [3 1 0 0 1 1 1 0 2 0 1 1 0 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 94900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  1 -1  0  1 -1  1  0  0 -1  1  0 -1] (Indices: [1, 2, 9, 12, 14, 15, 16, 18, 19]), Candidate: [3 1 0 0 1 1 1 0 2 0 0 2 0 2 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 94950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  0  1  0 -1  1  0  0 -1  1 -1  1 -1] (Indices: [1, 2, 10, 11, 13, 14, 15, 17, 19]), Candidate: [3 1 0 0 1 1 1 0 1 2 0 0 2 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 95000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  0  0  1  0  0  0  0 -1  0  1  0 -1] (Indices: [1, 2, 11, 12, 13, 14, 15, 18, 19]), Candidate: [3 1 0 0 1 1 1 0 1 1 1 1 1 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 95050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0 -1  0  1  0 -1  0  0  0  0  0  0  0] (Indices: [1, 3, 4, 5, 6, 7, 8, 11, 12]), Candidate: [3 0 2 0 1 1 1 0 0 1 1 1 0 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 95100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  1 -1  1 -1  0  0  0  0  1 -1  0  0] (Indices: [1, 3, 4, 5, 6, 7, 9, 11, 17]), Candidate: [ 3  0  2  0  1  1  1 -1  2  0  1  0  1  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  0  1 -1  0  1 -1  0  0  0  1 -1  0] (Indices: [1, 3, 4, 5, 6, 7, 10, 13, 18]), Candidate: [ 3  0  2  0  1  1  1 -1  1  2 -1  1  2  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 95200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  0  0  0  1  0 -1  0  0  0  0  1 -1] (Indices: [1, 3, 4, 5, 6, 7, 12, 13, 19]), Candidate: [ 3  0  2  0  1  1  1 -1  1  1  0  2  1  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  0  0  0  0  0  0  0  0  1  0  0 -1] (Indices: [1, 3, 4, 5, 6, 7, 17, 18, 19]), Candidate: [ 3  0  2  0  1  1  1 -1  1  1  0  1  1  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1 -1  1  0 -1  0  0  0  1 -1  0  0  0] (Indices: [1, 3, 4, 5, 6, 8, 10, 11, 16]), Candidate: [3 0 2 0 1 1 0 1 0 2 0 0 1 1 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 95350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1 -1  0  1 -1  0  0  1  0 -1  0  0  0] (Indices: [1, 3, 4, 5, 6, 8, 11, 15, 16]), Candidate: [3 0 2 0 1 1 0 1 0 1 1 0 1 1 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 95400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1 -1  0  0  0  0  1 -1  1  0 -1  0  0] (Indices: [1, 3, 4, 5, 6, 8, 14, 16, 17]), Candidate: [ 3  0  2  0  1  1  0  1  0  1  0  1  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  1  0 -1  0  0  0  0  0  1 -1  1 -1] (Indices: [1, 3, 4, 5, 6, 9, 10, 17, 19]), Candidate: [ 3  0  2  0  1  1  0  0  2  1 -1  1  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  1 -1  0  1 -1  0  0  0  0  1  0 -1] (Indices: [1, 3, 4, 5, 6, 9, 12, 18, 19]), Candidate: [3 0 2 0 1 1 0 0 2 0 0 2 0 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 95550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  0  1  0 -1  0  1 -1  1 -1  0  0  0] (Indices: [1, 3, 4, 5, 6, 10, 11, 14, 16]), Candidate: [ 3  0  2  0  1  1  0  0  1  2  0  0  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  0  1 -1  0  0  1  0  0 -1  0  0  0] (Indices: [1, 3, 4, 5, 6, 10, 14, 15, 16]), Candidate: [ 3  0  2  0  1  1  0  0  1  2 -1  1  1  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  0  0  1 -1  1 -1  0  1  0 -1  0  0] (Indices: [1, 3, 4, 5, 6, 11, 13, 16, 17]), Candidate: [3 0 2 0 1 1 0 0 1 1 1 0 2 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 95700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  0  0  0  1 -1  1 -1  0  0  1  0 -1] (Indices: [1, 3, 4, 5, 6, 12, 14, 18, 19]), Candidate: [ 3  0  2  0  1  1  0  0  1  1  0  2  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0  0  0 -1  0  0  0  1 -1  0  0  0  0] (Indices: [1, 3, 4, 5, 7, 8, 9, 10, 15]), Candidate: [ 3  0  2  0  1  0  2  0  1  1 -1  1  1  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0 -1  1 -1  1 -1  1 -1  0  0  0  0  0] (Indices: [1, 3, 4, 5, 7, 8, 10, 12, 14]), Candidate: [ 3  0  2  0  1  0  2  0  0  2 -1  2  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 95850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0 -1  0  1 -1  0  0  0  1 -1  1 -1  0] (Indices: [1, 3, 4, 5, 7, 8, 11, 16, 18]), Candidate: [3 0 2 0 1 0 2 0 0 1 1 0 1 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 95900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0 -1  0  0  0  0  1 -1  0  0  1  0 -1] (Indices: [1, 3, 4, 5, 7, 8, 14, 18, 19]), Candidate: [ 3  0  2  0  1  0  2  0  0  1  0  1  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  1 -1  1  0 -1  0  0  1 -1  0  0  0] (Indices: [1, 3, 4, 5, 7, 9, 11, 12, 16]), Candidate: [ 3  0  2  0  1  0  2 -1  2  0  1  1  0  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  1 -1  0  0  1  0 -1  0  0  0  1 -1] (Indices: [1, 3, 4, 5, 7, 9, 13, 14, 19]), Candidate: [ 3  0  2  0  1  0  2 -1  2  0  0  1  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 96050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  0  1  0 -1  0  0  1 -1  1 -1  0  0] (Indices: [1, 3, 4, 5, 7, 10, 11, 15, 17]), Candidate: [ 3  0  2  0  1  0  2 -1  1  2  0  0  1  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  0  1 -1  0  0  1 -1  1 -1  1 -1  0] (Indices: [1, 3, 4, 5, 7, 10, 14, 16, 18]), Candidate: [ 3  0  2  0  1  0  2 -1  1  2 -1  1  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 96150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  0  0  1 -1  1 -1  0  0  0  1  0 -1] (Indices: [1, 3, 4, 5, 7, 11, 13, 18, 19]), Candidate: [ 3  0  2  0  1  0  2 -1  1  1  1  0  2  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  0  0  0  1 -1  0  1 -1  1 -1  1 -1] (Indices: [1, 3, 4, 5, 7, 12, 15, 17, 19]), Candidate: [ 3  0  2  0  1  0  2 -1  1  1  0  2  0  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1  0  0 -1  1 -1  1 -1  0  0  0  0  0] (Indices: [1, 3, 4, 5, 8, 9, 10, 12, 14]), Candidate: [ 3  0  2  0  1  0  1  1  1  1 -1  2  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 96300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1  0 -1  1 -1  0  0  0  1 -1  1 -1  0] (Indices: [1, 3, 4, 5, 8, 9, 11, 16, 18]), Candidate: [3 0 2 0 1 0 1 1 1 0 1 0 1 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 96350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1  0 -1  0  0  0  1 -1  0  0  1  0 -1] (Indices: [1, 3, 4, 5, 8, 9, 14, 18, 19]), Candidate: [ 3  0  2  0  1  0  1  1  1  0  0  1  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1 -1  1 -1  1 -1  0  1  0 -1  0  0  0] (Indices: [1, 3, 4, 5, 8, 10, 12, 15, 16]), Candidate: [ 3  0  2  0  1  0  1  1  0  2 -1  2  0  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1 -1  0  1  0  0 -1  0  0  0  0  1 -1] (Indices: [1, 3, 4, 5, 8, 11, 12, 13, 19]), Candidate: [3 0 2 0 1 0 1 1 0 1 1 1 1 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 96500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1 -1  0  1 -1  0  0  0  0  1  0  0 -1] (Indices: [1, 3, 4, 5, 8, 11, 17, 18, 19]), Candidate: [3 0 2 0 1 0 1 1 0 1 1 0 1 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 96550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1 -1  0  0  0  1 -1  1 -1  1 -1  1 -1] (Indices: [1, 3, 4, 5, 8, 13, 15, 17, 19]), Candidate: [3 0 2 0 1 0 1 1 0 1 0 1 2 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 96600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  1  0 -1  1  0 -1  1 -1  0  0  0  0] (Indices: [1, 3, 4, 5, 9, 10, 12, 13, 15]), Candidate: [ 3  0  2  0  1  0  1  0  2  1 -1  2  1  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  1  0 -1  0  0  0  1 -1  0  1  0 -1] (Indices: [1, 3, 4, 5, 9, 10, 15, 18, 19]), Candidate: [ 3  0  2  0  1  0  1  0  2  1 -1  1  1  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  1 -1  1 -1  0  1 -1  0  0  1  0 -1] (Indices: [1, 3, 4, 5, 9, 11, 14, 18, 19]), Candidate: [ 3  0  2  0  1  0  1  0  2  0  1  0  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  1 -1  0  0  1  0 -1  1  0 -1  0  0] (Indices: [1, 3, 4, 5, 9, 13, 14, 16, 17]), Candidate: [ 3  0  2  0  1  0  1  0  2  0  0  1  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  0  1  0  0 -1  0  0  0  1 -1  1 -1] (Indices: [1, 3, 4, 5, 10, 11, 12, 17, 19]), Candidate: [3 0 2 0 1 0 1 0 1 2 0 1 0 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 96850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  0  1 -1  1  0 -1  0  0  1 -1  1 -1] (Indices: [1, 3, 4, 5, 10, 12, 13, 17, 19]), Candidate: [ 3  0  2  0  1  0  1  0  1  2 -1  2  1  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  0  1 -1  0  0  1 -1  1 -1  1  0 -1] (Indices: [1, 3, 4, 5, 10, 14, 16, 18, 19]), Candidate: [ 3  0  2  0  1  0  1  0  1  2 -1  1  1  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 96950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  0  0  1 -1  1  0 -1  0  1 -1  1 -1] (Indices: [1, 3, 4, 5, 11, 13, 14, 17, 19]), Candidate: [ 3  0  2  0  1  0  1  0  1  1  1  0  2  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 97000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  0  0  0  1 -1  1  0 -1  1  0 -1  0] (Indices: [1, 3, 4, 5, 12, 14, 15, 17, 18]), Candidate: [3 0 2 0 1 0 1 0 1 1 0 2 0 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 97050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0  0 -1  0  1  0 -1  0  0  0  0  0  0] (Indices: [1, 3, 4, 6, 7, 8, 9, 12, 13]), Candidate: [3 0 2 0 0 2 1 0 1 0 0 2 1 0 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 97100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0 -1  1 -1  0  0  1 -1  1 -1  0  0  0] (Indices: [1, 3, 4, 6, 7, 8, 10, 14, 16]), Candidate: [ 3  0  2  0  0  2  1  0  0  2 -1  1  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 97150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0 -1  0  0  1 -1  1 -1  0  1 -1  0  0] (Indices: [1, 3, 4, 6, 7, 8, 12, 14, 17]), Candidate: [ 3  0  2  0  0  2  1  0  0  1  0  2  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 97200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  1  0  0 -1  0  1 -1  0  0  0  0  0] (Indices: [1, 3, 4, 6, 7, 9, 10, 11, 14]), Candidate: [ 3  0  2  0  0  2  1 -1  2  1  0  0  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 97250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  1 -1  1 -1  0  1 -1  0  0  1 -1  0] (Indices: [1, 3, 4, 6, 7, 9, 11, 14, 18]), Candidate: [ 3  0  2  0  0  2  1 -1  2  0  1  0  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 97300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  1 -1  0  0  0  1  0 -1  0  1 -1  0] (Indices: [1, 3, 4, 6, 7, 9, 14, 15, 18]), Candidate: [ 3  0  2  0  0  2  1 -1  2  0  0  1  1  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 97350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  0  1 -1  1  0 -1  0  0  0  1 -1  0] (Indices: [1, 3, 4, 6, 7, 10, 12, 13, 18]), Candidate: [ 3  0  2  0  0  2  1 -1  1  2 -1  2  1  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 97400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  0  1 -1  0  0  0  0  1 -1  1  0 -1] (Indices: [1, 3, 4, 6, 7, 10, 16, 18, 19]), Candidate: [ 3  0  2  0  0  2  1 -1  1  2 -1  1  1  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 97450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  0  0  1 -1  0  0  1  0 -1  0  1 -1] (Indices: [1, 3, 4, 6, 7, 11, 15, 16, 19]), Candidate: [ 3  0  2  0  0  2  1 -1  1  1  1  0  1  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 97500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  0  0  0  0  1  0 -1  0  1  0 -1  0] (Indices: [1, 3, 4, 6, 7, 13, 14, 17, 18]), Candidate: [ 3  0  2  0  0  2  1 -1  1  1  0  1  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 97550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1  0  0 -1  0  0  1 -1  1 -1  0  0  0] (Indices: [1, 3, 4, 6, 8, 9, 10, 14, 16]), Candidate: [ 3  0  2  0  0  2  0  1  1  1 -1  1  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 97600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1  0 -1  0  1 -1  1 -1  0  1 -1  0  0] (Indices: [1, 3, 4, 6, 8, 9, 12, 14, 17]), Candidate: [ 3  0  2  0  0  2  0  1  1  0  0  2  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 97650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1 -1  1  0  0 -1  0  1 -1  0  0  0  0] (Indices: [1, 3, 4, 6, 8, 10, 11, 12, 15]), Candidate: [3 0 2 0 0 2 0 1 0 2 0 1 0 1 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 97700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1 -1  1 -1  0  1  0 -1  0  0  1 -1  0] (Indices: [1, 3, 4, 6, 8, 10, 13, 14, 18]), Candidate: [ 3  0  2  0  0  2  0  1  0  2 -1  1  2  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 97750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1 -1  0  1  0 -1  0  0  0  1  0 -1  0] (Indices: [1, 3, 4, 6, 8, 11, 12, 17, 18]), Candidate: [3 0 2 0 0 2 0 1 0 1 1 1 0 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 97800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1 -1  0  0  1  0 -1  0  0  1  0 -1  0] (Indices: [1, 3, 4, 6, 8, 12, 13, 17, 18]), Candidate: [3 0 2 0 0 2 0 1 0 1 0 2 1 0 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 97850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1 -1  0  0  0  0  1 -1  1  0 -1  1 -1] (Indices: [1, 3, 4, 6, 8, 14, 16, 17, 19]), Candidate: [ 3  0  2  0  0  2  0  1  0  1  0  1  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 97900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  1  0 -1  1 -1  0  1 -1  0  0  1 -1] (Indices: [1, 3, 4, 6, 9, 10, 12, 15, 19]), Candidate: [ 3  0  2  0  0  2  0  0  2  1 -1  2  0  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 97950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  1 -1  1  0 -1  1 -1  0  1 -1  0  0] (Indices: [1, 3, 4, 6, 9, 11, 12, 14, 17]), Candidate: [ 3  0  2  0  0  2  0  0  2  0  1  1  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  1 -1  0  1  0  0 -1  0  1 -1  0  0] (Indices: [1, 3, 4, 6, 9, 12, 13, 14, 17]), Candidate: [ 3  0  2  0  0  2  0  0  2  0  0  2  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  1 -1  0  0  1 -1  0  1  0 -1  1 -1] (Indices: [1, 3, 4, 6, 9, 13, 16, 17, 19]), Candidate: [3 0 2 0 0 2 0 0 2 0 0 1 2 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 98100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  0  1  0 -1  1 -1  0  1 -1  0  1 -1] (Indices: [1, 3, 4, 6, 10, 11, 13, 16, 19]), Candidate: [3 0 2 0 0 2 0 0 1 2 0 0 2 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 98150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  0  1 -1  1 -1  0  1  0 -1  1 -1  0] (Indices: [1, 3, 4, 6, 10, 12, 15, 16, 18]), Candidate: [ 3  0  2  0  0  2  0  0  1  2 -1  2  0  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  0  0  1  0  0 -1  1 -1  1 -1  0  0] (Indices: [1, 3, 4, 6, 11, 12, 13, 15, 17]), Candidate: [3 0 2 0 0 2 0 0 1 1 1 1 1 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 98250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  0  0  1 -1  0  1  0  0 -1  1 -1  0] (Indices: [1, 3, 4, 6, 11, 14, 15, 16, 18]), Candidate: [3 0 2 0 0 2 0 0 1 1 1 0 1 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 98300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  0  0  0  0  1  0  0  0 -1  1 -1  0] (Indices: [1, 3, 4, 6, 13, 14, 15, 16, 18]), Candidate: [3 0 2 0 0 2 0 0 1 1 0 1 2 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 98350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0  0  0 -1  0  0  0  0  1  0 -1  0  0] (Indices: [1, 3, 4, 7, 8, 9, 10, 16, 17]), Candidate: [ 3  0  2  0  0  1  2  0  1  1 -1  1  1  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0  0 -1  0  1 -1  0  0  1 -1  1 -1  0] (Indices: [1, 3, 4, 7, 8, 9, 12, 16, 18]), Candidate: [3 0 2 0 0 1 2 0 1 0 0 2 0 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 98450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0 -1  1  0 -1  1 -1  0  0  1 -1  0  0] (Indices: [1, 3, 4, 7, 8, 10, 11, 13, 17]), Candidate: [3 0 2 0 0 1 2 0 0 2 0 0 2 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 98500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0 -1  1 -1  0  1 -1  0  1 -1  0  1 -1] (Indices: [1, 3, 4, 7, 8, 10, 13, 16, 19]), Candidate: [ 3  0  2  0  0  1  2  0  0  2 -1  1  2  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0 -1  0  1 -1  1 -1  1  0 -1  0  0  0] (Indices: [1, 3, 4, 7, 8, 11, 13, 15, 16]), Candidate: [3 0 2 0 0 1 2 0 0 1 1 0 2 0 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 98600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0 -1  0  0  1 -1  1 -1  1 -1  1 -1  0] (Indices: [1, 3, 4, 7, 8, 12, 14, 16, 18]), Candidate: [ 3  0  2  0  0  1  2  0  0  1  0  2  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  1  0  0  0  0 -1  0  0  0  0  0  0] (Indices: [1, 3, 4, 7, 9, 10, 11, 12, 13]), Candidate: [ 3  0  2  0  0  1  2 -1  2  1  0  1  1  0  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  1  0 -1  0  1  0 -1  1 -1  0  0  0] (Indices: [1, 3, 4, 7, 9, 10, 13, 14, 16]), Candidate: [ 3  0  2  0  0  1  2 -1  2  1 -1  1  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 98750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  1 -1  1  0 -1  0  0  1 -1  1 -1  0] (Indices: [1, 3, 4, 7, 9, 11, 12, 16, 18]), Candidate: [ 3  0  2  0  0  1  2 -1  2  0  1  1  0  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  1 -1  0  1  0 -1  0  1 -1  1 -1  0] (Indices: [1, 3, 4, 7, 9, 12, 13, 16, 18]), Candidate: [ 3  0  2  0  0  1  2 -1  2  0  0  2  1  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  1 -1  0  0  0  1  0 -1  0  1  0 -1] (Indices: [1, 3, 4, 7, 9, 14, 15, 18, 19]), Candidate: [ 3  0  2  0  0  1  2 -1  2  0  0  1  1  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  0  1  0 -1  0  1 -1  1  0 -1  0  0] (Indices: [1, 3, 4, 7, 10, 11, 14, 16, 17]), Candidate: [ 3  0  2  0  0  1  2 -1  1  2  0  0  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 98950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  0  1 -1  1 -1  0  0  0  1  0  0 -1] (Indices: [1, 3, 4, 7, 10, 12, 17, 18, 19]), Candidate: [ 3  0  2  0  0  1  2 -1  1  2 -1  2  0  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 99000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  0  0  1  0  0 -1  0  0  0  1  0 -1] (Indices: [1, 3, 4, 7, 11, 12, 13, 18, 19]), Candidate: [ 3  0  2  0  0  1  2 -1  1  1  1  1  1  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 99050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  0  0  1 -1  0  1 -1  0  1  0  0 -1] (Indices: [1, 3, 4, 7, 11, 14, 17, 18, 19]), Candidate: [ 3  0  2  0  0  1  2 -1  1  1  1  0  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 99100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  0  0  0  0  1  0 -1  0  1  0  0 -1] (Indices: [1, 3, 4, 7, 13, 14, 17, 18, 19]), Candidate: [ 3  0  2  0  0  1  2 -1  1  1  0  1  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 99150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1  0  0 -1  1 -1  1 -1  0  0  0  1 -1] (Indices: [1, 3, 4, 8, 9, 10, 12, 14, 19]), Candidate: [ 3  0  2  0  0  1  1  1  1  1 -1  2  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 99200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1  0 -1  1  0  0 -1  0  0  0  1 -1  0] (Indices: [1, 3, 4, 8, 9, 11, 12, 13, 18]), Candidate: [3 0 2 0 0 1 1 1 1 0 1 1 1 0 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 99250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1  0 -1  1 -1  0  0  0  1 -1  1  0 -1] (Indices: [1, 3, 4, 8, 9, 11, 16, 18, 19]), Candidate: [3 0 2 0 0 1 1 1 1 0 1 0 1 1 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 99300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1  0 -1  0  0  1 -1  1 -1  1  0 -1  0] (Indices: [1, 3, 4, 8, 9, 13, 15, 17, 18]), Candidate: [3 0 2 0 0 1 1 1 1 0 0 1 2 0 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 99350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1 -1  1  0 -1  1 -1  1 -1  0  1 -1  0] (Indices: [1, 3, 4, 8, 10, 11, 13, 15, 18]), Candidate: [3 0 2 0 0 1 1 1 0 2 0 0 2 0 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 99400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1 -1  1 -1  1 -1  1 -1  0  1  0 -1  0] (Indices: [1, 3, 4, 8, 10, 12, 14, 17, 18]), Candidate: [ 3  0  2  0  0  1  1  1  0  2 -1  2  0  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 99450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1 -1  0  1  0  0  0 -1  0  1 -1  0  0] (Indices: [1, 3, 4, 8, 11, 12, 13, 14, 17]), Candidate: [ 3  0  2  0  0  1  1  1  0  1  1  1  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 99500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1 -1  0  1 -1  1 -1  0  1  0 -1  1 -1] (Indices: [1, 3, 4, 8, 11, 13, 16, 17, 19]), Candidate: [3 0 2 0 0 1 1 1 0 1 1 0 2 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 99550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1 -1  0  0  1 -1  0  1  0 -1  1  0 -1] (Indices: [1, 3, 4, 8, 12, 15, 16, 18, 19]), Candidate: [3 0 2 0 0 1 1 1 0 1 0 2 0 1 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 99600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  1  0  0 -1  1 -1  1  0 -1  0  0  0] (Indices: [1, 3, 4, 9, 10, 11, 13, 15, 16]), Candidate: [3 0 2 0 0 1 1 0 2 1 0 0 2 0 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 99650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  1  0 -1  1 -1  1 -1  1 -1  1 -1  0] (Indices: [1, 3, 4, 9, 10, 12, 14, 16, 18]), Candidate: [ 3  0  2  0  0  1  1  0  2  1 -1  2  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 99700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  1 -1  1  0  0  0  0 -1  0  0  0  0] (Indices: [1, 3, 4, 9, 11, 12, 13, 14, 15]), Candidate: [3 0 2 0 0 1 1 0 2 0 1 1 1 1 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 99750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  1 -1  1 -1  1 -1  1 -1  0  1  0 -1] (Indices: [1, 3, 4, 9, 11, 13, 15, 18, 19]), Candidate: [3 0 2 0 0 1 1 0 2 0 1 0 2 0 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 99800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  1 -1  0  1 -1  0  1  0  0  0 -1  0] (Indices: [1, 3, 4, 9, 12, 15, 16, 17, 18]), Candidate: [3 0 2 0 0 1 1 0 2 0 0 2 0 1 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 99850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  0  1  0  0 -1  1 -1  0  0  1  0 -1] (Indices: [1, 3, 4, 10, 11, 12, 14, 18, 19]), Candidate: [ 3  0  2  0  0  1  1  0  1  2  0  1  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 99900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  0  1 -1  1  0  0 -1  1  0 -1  0  0] (Indices: [1, 3, 4, 10, 12, 13, 14, 16, 17]), Candidate: [ 3  0  2  0  0  1  1  0  1  2 -1  2  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 99950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  0  1 -1  0  0  1 -1  1  0  0  0 -1] (Indices: [1, 3, 4, 10, 14, 16, 17, 18, 19]), Candidate: [ 3  0  2  0  0  1  1  0  1  2 -1  1  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  0  0  1 -1  1 -1  1 -1  1  0  0 -1] (Indices: [1, 3, 4, 11, 13, 15, 17, 18, 19]), Candidate: [3 0 2 0 0 1 1 0 1 1 1 0 2 0 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 100050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0  0 -1  1 -1  0  0  0  0  1 -1  0  0] (Indices: [1, 3, 5, 6, 7, 8, 9, 11, 17]), Candidate: [ 3  0  2 -1  2  1  1  0  1  0  1  0  1  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0 -1  1 -1  0  1 -1  0  0  0  1 -1  0] (Indices: [1, 3, 5, 6, 7, 8, 10, 13, 18]), Candidate: [ 3  0  2 -1  2  1  1  0  0  2 -1  1  2  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0 -1  0  0  1  0 -1  0  0  0  0  1 -1] (Indices: [1, 3, 5, 6, 7, 8, 12, 13, 19]), Candidate: [ 3  0  2 -1  2  1  1  0  0  1  0  2  1  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0 -1  0  0  0  0  0  0  0  1  0  0 -1] (Indices: [1, 3, 5, 6, 7, 8, 17, 18, 19]), Candidate: [ 3  0  2 -1  2  1  1  0  0  1  0  1  1  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  1 -1  1 -1  0  1  0 -1  0  0  0  0] (Indices: [1, 3, 5, 6, 7, 9, 11, 14, 15]), Candidate: [ 3  0  2 -1  2  1  1 -1  2  0  1  0  1  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  1 -1  0  0  1 -1  0  0  0  1  0 -1] (Indices: [1, 3, 5, 6, 7, 9, 13, 18, 19]), Candidate: [ 3  0  2 -1  2  1  1 -1  2  0  0  1  2  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  0  1 -1  1  0 -1  1 -1  0  0  0  0] (Indices: [1, 3, 5, 6, 7, 10, 12, 13, 15]), Candidate: [ 3  0  2 -1  2  1  1 -1  1  2 -1  2  1  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 100400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  0  1 -1  0  0  0  1 -1  0  1  0 -1] (Indices: [1, 3, 5, 6, 7, 10, 15, 18, 19]), Candidate: [ 3  0  2 -1  2  1  1 -1  1  2 -1  1  1  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 100450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  0  0  1 -1  0  1 -1  0  0  1  0 -1] (Indices: [1, 3, 5, 6, 7, 11, 14, 18, 19]), Candidate: [ 3  0  2 -1  2  1  1 -1  1  1  1  0  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 100500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  0  0  0  0  1  0 -1  1  0 -1  0  0] (Indices: [1, 3, 5, 6, 7, 13, 14, 16, 17]), Candidate: [ 3  0  2 -1  2  1  1 -1  1  1  0  1  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 100550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1  0  0 -1  0  1 -1  0  0  0  1 -1  0] (Indices: [1, 3, 5, 6, 8, 9, 10, 13, 18]), Candidate: [ 3  0  2 -1  2  1  0  1  1  1 -1  1  2  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1  0 -1  0  1  0 -1  0  0  0  0  1 -1] (Indices: [1, 3, 5, 6, 8, 9, 12, 13, 19]), Candidate: [ 3  0  2 -1  2  1  0  1  1  0  0  2  1  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1  0 -1  0  0  0  0  0  0  1  0  0 -1] (Indices: [1, 3, 5, 6, 8, 9, 17, 18, 19]), Candidate: [ 3  0  2 -1  2  1  0  1  1  0  0  1  1  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1 -1  1 -1  0  1  0  0 -1  0  0  0  0] (Indices: [1, 3, 5, 6, 8, 10, 13, 14, 15]), Candidate: [ 3  0  2 -1  2  1  0  1  0  2 -1  1  2  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1 -1  0  1  0 -1  0  0  1  0 -1  0  0] (Indices: [1, 3, 5, 6, 8, 11, 12, 16, 17]), Candidate: [ 3  0  2 -1  2  1  0  1  0  1  1  1  0  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1 -1  0  0  1  0 -1  0  1  0 -1  0  0] (Indices: [1, 3, 5, 6, 8, 12, 13, 16, 17]), Candidate: [ 3  0  2 -1  2  1  0  1  0  1  0  2  1  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1 -1  0  0  0  0  1  0 -1  1 -1  1 -1] (Indices: [1, 3, 5, 6, 8, 14, 15, 17, 19]), Candidate: [ 3  0  2 -1  2  1  0  1  0  1  0  1  1  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  1  0 -1  1 -1  0  1  0 -1  0  0  0] (Indices: [1, 3, 5, 6, 9, 10, 12, 15, 16]), Candidate: [ 3  0  2 -1  2  1  0  0  2  1 -1  2  0  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  1 -1  1  0  0 -1  0  0  0  0  1 -1] (Indices: [1, 3, 5, 6, 9, 11, 12, 13, 19]), Candidate: [ 3  0  2 -1  2  1  0  0  2  0  1  1  1  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  1 -1  1 -1  0  0  0  0  1  0  0 -1] (Indices: [1, 3, 5, 6, 9, 11, 17, 18, 19]), Candidate: [ 3  0  2 -1  2  1  0  0  2  0  1  0  1  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  1 -1  0  0  1 -1  1 -1  1 -1  1 -1] (Indices: [1, 3, 5, 6, 9, 13, 15, 17, 19]), Candidate: [ 3  0  2 -1  2  1  0  0  2  0  0  1  2  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  0  1  0 -1  1 -1  1 -1  0  0  1 -1] (Indices: [1, 3, 5, 6, 10, 11, 13, 15, 19]), Candidate: [ 3  0  2 -1  2  1  0  0  1  2  0  0  2  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  0  1 -1  1 -1  1 -1  0  1 -1  1 -1] (Indices: [1, 3, 5, 6, 10, 12, 14, 17, 19]), Candidate: [ 3  0  2 -1  2  1  0  0  1  2 -1  2  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 101200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  0  0  1  0  0  0 -1  0  0  1 -1  0] (Indices: [1, 3, 5, 6, 11, 12, 13, 14, 18]), Candidate: [ 3  0  2 -1  2  1  0  0  1  1  1  1  1  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 101250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  0  0  1 -1  1 -1  0  1 -1  1  0 -1] (Indices: [1, 3, 5, 6, 11, 13, 16, 18, 19]), Candidate: [ 3  0  2 -1  2  1  0  0  1  1  1  0  2  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  0  0  0  1 -1  0  1 -1  1  0  0 -1] (Indices: [1, 3, 5, 6, 12, 15, 17, 18, 19]), Candidate: [ 3  0  2 -1  2  1  0  0  1  1  0  2  0  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0  0  0 -1  0  0  0  1 -1  1 -1  0  0] (Indices: [1, 3, 5, 7, 8, 9, 10, 15, 17]), Candidate: [ 3  0  2 -1  2  0  2  0  1  1 -1  1  1  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 101400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0  0 -1  0  1 -1  0  1 -1  0  1 -1  0] (Indices: [1, 3, 5, 7, 8, 9, 12, 15, 18]), Candidate: [ 3  0  2 -1  2  0  2  0  1  0  0  2  0  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0 -1  1  0 -1  1  0 -1  0  0  0  0  0] (Indices: [1, 3, 5, 7, 8, 10, 11, 13, 14]), Candidate: [ 3  0  2 -1  2  0  2  0  0  2  0  0  2  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 101500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0 -1  1 -1  0  1 -1  1 -1  0  0  1 -1] (Indices: [1, 3, 5, 7, 8, 10, 13, 15, 19]), Candidate: [ 3  0  2 -1  2  0  2  0  0  2 -1  1  2  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 101550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0 -1  0  1 -1  1  0 -1  0  1 -1  0  0] (Indices: [1, 3, 5, 7, 8, 11, 13, 14, 17]), Candidate: [ 3  0  2 -1  2  0  2  0  0  1  1  0  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 101600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0 -1  0  0  1 -1  1  0 -1  0  1 -1  0] (Indices: [1, 3, 5, 7, 8, 12, 14, 15, 18]), Candidate: [ 3  0  2 -1  2  0  2  0  0  1  0  2  0  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0 -1  0  0  0  0  0  1  0 -1  1  0 -1] (Indices: [1, 3, 5, 7, 8, 15, 16, 18, 19]), Candidate: [ 3  0  2 -1  2  0  2  0  0  1  0  1  1  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  1  0 -1  1 -1  0  0  0  1 -1  1 -1] (Indices: [1, 3, 5, 7, 9, 10, 12, 17, 19]), Candidate: [ 3  0  2 -1  2  0  2 -1  2  1 -1  2  0  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 101750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  1 -1  1  0 -1  0  1 -1  0  1 -1  0] (Indices: [1, 3, 5, 7, 9, 11, 12, 15, 18]), Candidate: [ 3  0  2 -1  2  0  2 -1  2  0  1  1  0  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 101800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  1 -1  0  1  0 -1  1 -1  0  1 -1  0] (Indices: [1, 3, 5, 7, 9, 12, 13, 15, 18]), Candidate: [ 3  0  2 -1  2  0  2 -1  2  0  0  2  1  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 101850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  1 -1  0  0  0  1  0  0 -1  0  1 -1] (Indices: [1, 3, 5, 7, 9, 14, 15, 16, 19]), Candidate: [ 3  0  2 -1  2  0  2 -1  2  0  0  1  1  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 101900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  0  1  0 -1  0  1  0 -1  1 -1  0  0] (Indices: [1, 3, 5, 7, 10, 11, 14, 15, 17]), Candidate: [ 3  0  2 -1  2  0  2 -1  1  2  0  0  1  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 101950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  0  1 -1  1 -1  0  0  1  0  0 -1  0] (Indices: [1, 3, 5, 7, 10, 12, 16, 17, 18]), Candidate: [ 3  0  2 -1  2  0  2 -1  1  2 -1  2  0  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 102000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  0  0  1  0  0 -1  0  1 -1  0  1 -1] (Indices: [1, 3, 5, 7, 11, 12, 13, 16, 19]), Candidate: [ 3  0  2 -1  2  0  2 -1  1  1  1  1  1  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  0  0  1 -1  0  1 -1  1  0  0 -1  0] (Indices: [1, 3, 5, 7, 11, 14, 16, 17, 18]), Candidate: [ 3  0  2 -1  2  0  2 -1  1  1  1  0  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 102100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  0  0  0  0  1  0 -1  1  0  0 -1  0] (Indices: [1, 3, 5, 7, 13, 14, 16, 17, 18]), Candidate: [ 3  0  2 -1  2  0  2 -1  1  1  0  1  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 102150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1  0  0 -1  1 -1  1 -1  1 -1  0  0  0] (Indices: [1, 3, 5, 8, 9, 10, 12, 14, 16]), Candidate: [ 3  0  2 -1  2  0  1  1  1  1 -1  2  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 102200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1  0 -1  1  0  0 -1  1 -1  0  0  0  0] (Indices: [1, 3, 5, 8, 9, 11, 12, 13, 15]), Candidate: [ 3  0  2 -1  2  0  1  1  1  0  1  1  1  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1  0 -1  1 -1  0  0  1 -1  0  1  0 -1] (Indices: [1, 3, 5, 8, 9, 11, 15, 18, 19]), Candidate: [ 3  0  2 -1  2  0  1  1  1  0  1  0  1  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1  0 -1  0  0  1 -1  1  0  0 -1  0  0] (Indices: [1, 3, 5, 8, 9, 13, 15, 16, 17]), Candidate: [ 3  0  2 -1  2  0  1  1  1  0  0  1  2  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1 -1  1  0 -1  1  0 -1  0  0  0  1 -1] (Indices: [1, 3, 5, 8, 10, 11, 13, 14, 19]), Candidate: [ 3  0  2 -1  2  0  1  1  0  2  0  0  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1 -1  1 -1  1 -1  1 -1  1  0 -1  0  0] (Indices: [1, 3, 5, 8, 10, 12, 14, 16, 17]), Candidate: [ 3  0  2 -1  2  0  1  1  0  2 -1  2  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 102450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1 -1  1 -1  0  0  0  0  1  0  0  0 -1] (Indices: [1, 3, 5, 8, 10, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  2  0  1  1  0  2 -1  1  1  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1 -1  0  1 -1  1 -1  1 -1  1 -1  1 -1] (Indices: [1, 3, 5, 8, 11, 13, 15, 17, 19]), Candidate: [ 3  0  2 -1  2  0  1  1  0  1  1  0  2  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1 -1  0  0  1 -1  1 -1  0  1  0  0 -1] (Indices: [1, 3, 5, 8, 12, 14, 17, 18, 19]), Candidate: [ 3  0  2 -1  2  0  1  1  0  1  0  2  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  1  0  0 -1  1  0 -1  0  1 -1  0  0] (Indices: [1, 3, 5, 9, 10, 11, 13, 14, 17]), Candidate: [ 3  0  2 -1  2  0  1  0  2  1  0  0  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  1  0 -1  1 -1  1  0 -1  0  1 -1  0] (Indices: [1, 3, 5, 9, 10, 12, 14, 15, 18]), Candidate: [ 3  0  2 -1  2  0  1  0  2  1 -1  2  0  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  1  0 -1  0  0  0  1  0 -1  1  0 -1] (Indices: [1, 3, 5, 9, 10, 15, 16, 18, 19]), Candidate: [ 3  0  2 -1  2  0  1  0  2  1 -1  1  1  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  1 -1  1 -1  1 -1  1  0 -1  0  1 -1] (Indices: [1, 3, 5, 9, 11, 13, 15, 16, 19]), Candidate: [ 3  0  2 -1  2  0  1  0  2  0  1  0  2  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  1 -1  0  1 -1  1 -1  1  0 -1  1 -1] (Indices: [1, 3, 5, 9, 12, 14, 16, 17, 19]), Candidate: [ 3  0  2 -1  2  0  1  0  2  0  0  2  0  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  0  1  0  0 -1  1 -1  1 -1  0  1 -1] (Indices: [1, 3, 5, 10, 11, 12, 14, 16, 19]), Candidate: [ 3  0  2 -1  2  0  1  0  1  2  0  1  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  0  1 -1  1  0  0  0 -1  1 -1  0  0] (Indices: [1, 3, 5, 10, 12, 13, 14, 15, 17]), Candidate: [ 3  0  2 -1  2  0  1  0  1  2 -1  2  1  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  0  1 -1  0  0  1  0  0  0 -1  1 -1] (Indices: [1, 3, 5, 10, 14, 15, 16, 17, 19]), Candidate: [ 3  0  2 -1  2  0  1  0  1  2 -1  1  1  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 103000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  0  0  1 -1  1 -1  1  0  0  0 -1  0] (Indices: [1, 3, 5, 11, 13, 15, 16, 17, 18]), Candidate: [ 3  0  2 -1  2  0  1  0  1  1  1  0  2  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0  0  0 -1  1 -1  0  0  1 -1  0  0  0] (Indices: [1, 3, 6, 7, 8, 9, 10, 12, 16]), Candidate: [ 3  0  2 -1  1  2  1  0  1  1 -1  2  0  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 103100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0  0 -1  1 -1  0  0  0  0  1  0 -1  0] (Indices: [1, 3, 6, 7, 8, 9, 11, 17, 18]), Candidate: [ 3  0  2 -1  1  2  1  0  1  0  1  0  1  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0  0 -1  0  0  0  0  1  0 -1  1 -1  0] (Indices: [1, 3, 6, 7, 8, 9, 15, 16, 18]), Candidate: [ 3  0  2 -1  1  2  1  0  1  0  0  1  1  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0 -1  1 -1  1 -1  0  1 -1  0  1 -1  0] (Indices: [1, 3, 6, 7, 8, 10, 12, 15, 18]), Candidate: [ 3  0  2 -1  1  2  1  0  0  2 -1  2  0  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 103250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0 -1  0  1  0 -1  1 -1  1 -1  0  0  0] (Indices: [1, 3, 6, 7, 8, 11, 12, 14, 16]), Candidate: [ 3  0  2 -1  1  2  1  0  0  1  1  1  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 103300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0 -1  0  0  1  0  0 -1  1 -1  0  0  0] (Indices: [1, 3, 6, 7, 8, 12, 13, 14, 16]), Candidate: [ 3  0  2 -1  1  2  1  0  0  1  0  2  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 103350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0 -1  0  0  0  1 -1  0  1  0  0 -1  0] (Indices: [1, 3, 6, 7, 8, 13, 16, 17, 18]), Candidate: [ 3  0  2 -1  1  2  1  0  0  1  0  1  2  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  1  0 -1  1  0 -1  0  0  1 -1  0  0] (Indices: [1, 3, 6, 7, 9, 10, 12, 13, 17]), Candidate: [ 3  0  2 -1  1  2  1 -1  2  1 -1  2  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 103450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  1  0 -1  0  0  0  0  1  0 -1  1 -1] (Indices: [1, 3, 6, 7, 9, 10, 16, 17, 19]), Candidate: [ 3  0  2 -1  1  2  1 -1  2  1 -1  1  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 103500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  1 -1  1 -1  0  0  1  0 -1  1 -1  0] (Indices: [1, 3, 6, 7, 9, 11, 15, 16, 18]), Candidate: [ 3  0  2 -1  1  2  1 -1  2  0  1  0  1  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 103550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  1 -1  0  0  1  0 -1  1 -1  0  1 -1] (Indices: [1, 3, 6, 7, 9, 13, 14, 16, 19]), Candidate: [ 3  0  2 -1  1  2  1 -1  2  0  0  1  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 103600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  0  1  0 -1  1  0  0 -1  0  0  0  0] (Indices: [1, 3, 6, 7, 10, 11, 13, 14, 15]), Candidate: [ 3  0  2 -1  1  2  1 -1  1  2  0  0  2  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 103650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  0  1 -1  1 -1  1  0  0 -1  0  0  0] (Indices: [1, 3, 6, 7, 10, 12, 14, 15, 16]), Candidate: [ 3  0  2 -1  1  2  1 -1  1  2 -1  2  0  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 103700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  0  1 -1  0  0  0  1  0  0  0 -1  0] (Indices: [1, 3, 6, 7, 10, 15, 16, 17, 18]), Candidate: [ 3  0  2 -1  1  2  1 -1  1  2 -1  1  1  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 103750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  0  0  1 -1  1 -1  1  0  0 -1  0  0] (Indices: [1, 3, 6, 7, 11, 13, 15, 16, 17]), Candidate: [ 3  0  2 -1  1  2  1 -1  1  1  1  0  2  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 103800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  0  0  0  1 -1  1  0 -1  0  1  0 -1] (Indices: [1, 3, 6, 7, 12, 14, 15, 18, 19]), Candidate: [ 3  0  2 -1  1  2  1 -1  1  1  0  2  0  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 103850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1  0  0  0 -1  0  0  1 -1  1 -1  0  0] (Indices: [1, 3, 6, 8, 9, 10, 11, 15, 17]), Candidate: [ 3  0  2 -1  1  2  0  1  1  1  0  0  1  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1  0  0 -1  0  0  1 -1  1 -1  1 -1  0] (Indices: [1, 3, 6, 8, 9, 10, 14, 16, 18]), Candidate: [ 3  0  2 -1  1  2  0  1  1  1 -1  1  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 103950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1  0 -1  1 -1  1 -1  0  0  0  1  0 -1] (Indices: [1, 3, 6, 8, 9, 11, 13, 18, 19]), Candidate: [ 3  0  2 -1  1  2  0  1  1  0  1  0  2  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1  0 -1  0  1 -1  0  1 -1  1 -1  1 -1] (Indices: [1, 3, 6, 8, 9, 12, 15, 17, 19]), Candidate: [ 3  0  2 -1  1  2  0  1  1  0  0  2  0  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1 -1  1  0  0 -1  1 -1  0  0  1 -1  0] (Indices: [1, 3, 6, 8, 10, 11, 12, 14, 18]), Candidate: [ 3  0  2 -1  1  2  0  1  0  2  0  1  0  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 104100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1 -1  1 -1  1  0  0 -1  0  0  1 -1  0] (Indices: [1, 3, 6, 8, 10, 12, 13, 14, 18]), Candidate: [ 3  0  2 -1  1  2  0  1  0  2 -1  2  1  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 104150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1 -1  1 -1  0  1 -1  0  1 -1  1  0 -1] (Indices: [1, 3, 6, 8, 10, 13, 16, 18, 19]), Candidate: [ 3  0  2 -1  1  2  0  1  0  2 -1  1  2  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 104200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1 -1  0  1  0 -1  0  0  1 -1  1  0 -1] (Indices: [1, 3, 6, 8, 11, 12, 16, 18, 19]), Candidate: [ 3  0  2 -1  1  2  0  1  0  1  1  1  0  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1 -1  0  0  1  0 -1  1 -1  1  0 -1  0] (Indices: [1, 3, 6, 8, 12, 13, 15, 17, 18]), Candidate: [ 3  0  2 -1  1  2  0  1  0  1  0  2  1  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  1  0  0  0 -1  1 -1  1 -1  0  0  0] (Indices: [1, 3, 6, 9, 10, 11, 12, 14, 16]), Candidate: [ 3  0  2 -1  1  2  0  0  2  1  0  1  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 104350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  1  0 -1  1  0  0 -1  1 -1  0  0  0] (Indices: [1, 3, 6, 9, 10, 12, 13, 14, 16]), Candidate: [ 3  0  2 -1  1  2  0  0  2  1 -1  2  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 104400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  1  0 -1  0  1 -1  0  1  0  0 -1  0] (Indices: [1, 3, 6, 9, 10, 13, 16, 17, 18]), Candidate: [ 3  0  2 -1  1  2  0  0  2  1 -1  1  2  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 104450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  1 -1  1  0 -1  0  0  1  0  0 -1  0] (Indices: [1, 3, 6, 9, 11, 12, 16, 17, 18]), Candidate: [ 3  0  2 -1  1  2  0  0  2  0  1  1  0  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  1 -1  0  1  0 -1  1  0 -1  1 -1  0] (Indices: [1, 3, 6, 9, 12, 13, 15, 16, 18]), Candidate: [ 3  0  2 -1  1  2  0  0  2  0  0  2  1  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  0  1  0  0  0 -1  1  0 -1  0  0  0] (Indices: [1, 3, 6, 10, 11, 12, 13, 15, 16]), Candidate: [ 3  0  2 -1  1  2  0  0  1  2  0  1  1  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  0  1  0 -1  0  1  0  0  0 -1  0  0] (Indices: [1, 3, 6, 10, 11, 14, 15, 16, 17]), Candidate: [ 3  0  2 -1  1  2  0  0  1  2  0  0  1  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  0  1 -1  0  1  0  0  0  0 -1  0  0] (Indices: [1, 3, 6, 10, 13, 14, 15, 16, 17]), Candidate: [ 3  0  2 -1  1  2  0  0  1  2 -1  1  2  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 104700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  0  0  1  0 -1  1 -1  0  1  0  0 -1] (Indices: [1, 3, 6, 11, 12, 14, 17, 18, 19]), Candidate: [ 3  0  2 -1  1  2  0  0  1  1  1  1  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 104750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  0  0  0  0  1  0  0  0 -1  1  0 -1] (Indices: [1, 3, 6, 13, 14, 15, 16, 18, 19]), Candidate: [ 3  0  2 -1  1  2  0  0  1  1  0  1  2  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0  0  0 -1  1 -1  0  0  1 -1  0  1 -1] (Indices: [1, 3, 7, 8, 9, 10, 12, 16, 19]), Candidate: [ 3  0  2 -1  1  1  2  0  1  1 -1  2  0  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 104850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0  0 -1  1  0 -1  0  1  0 -1  0  0  0] (Indices: [1, 3, 7, 8, 9, 11, 12, 15, 16]), Candidate: [ 3  0  2 -1  1  1  2  0  1  0  1  1  0  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0  0 -1  0  1  0 -1  1  0 -1  0  0  0] (Indices: [1, 3, 7, 8, 9, 12, 13, 15, 16]), Candidate: [ 3  0  2 -1  1  1  2  0  1  0  0  2  1  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0  0 -1  0  0  0  1  0  0  0 -1  0  0] (Indices: [1, 3, 7, 8, 9, 14, 15, 16, 17]), Candidate: [ 3  0  2 -1  1  1  2  0  1  0  0  1  1  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0 -1  1  0 -1  1 -1  0  0  0  1  0 -1] (Indices: [1, 3, 7, 8, 10, 11, 13, 18, 19]), Candidate: [ 3  0  2 -1  1  1  2  0  0  2  0  0  2  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0 -1  1 -1  1 -1  0  1 -1  1 -1  1 -1] (Indices: [1, 3, 7, 8, 10, 12, 15, 17, 19]), Candidate: [ 3  0  2 -1  1  1  2  0  0  2 -1  2  0  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 105100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0 -1  0  1  0  0 -1  0  1  0 -1  0  0] (Indices: [1, 3, 7, 8, 11, 12, 13, 16, 17]), Candidate: [ 3  0  2 -1  1  1  2  0  0  1  1  1  1  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0 -1  0  1 -1  0  1  0 -1  1 -1  1 -1] (Indices: [1, 3, 7, 8, 11, 14, 15, 17, 19]), Candidate: [ 3  0  2 -1  1  1  2  0  0  1  1  0  1  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0 -1  0  0  0  1  0  0 -1  1 -1  1 -1] (Indices: [1, 3, 7, 8, 13, 14, 15, 17, 19]), Candidate: [ 3  0  2 -1  1  1  2  0  0  1  0  1  2  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  1  0  0 -1  1 -1  0  0  1  0 -1  0] (Indices: [1, 3, 7, 9, 10, 11, 13, 17, 18]), Candidate: [ 3  0  2 -1  1  1  2 -1  2  1  0  0  2  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 105300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  1  0 -1  1 -1  0  1  0 -1  0  1 -1] (Indices: [1, 3, 7, 9, 10, 12, 15, 16, 19]), Candidate: [ 3  0  2 -1  1  1  2 -1  2  1 -1  2  0  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 105350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  1 -1  1  0  0 -1  1 -1  0  1 -1  0] (Indices: [1, 3, 7, 9, 11, 12, 13, 15, 18]), Candidate: [ 3  0  2 -1  1  1  2 -1  2  0  1  1  1  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 105400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  1 -1  1 -1  0  1  0  0 -1  0  1 -1] (Indices: [1, 3, 7, 9, 11, 14, 15, 16, 19]), Candidate: [ 3  0  2 -1  1  1  2 -1  2  0  1  0  1  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 105450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  1 -1  0  0  1  0  0  0 -1  0  1 -1] (Indices: [1, 3, 7, 9, 13, 14, 15, 16, 19]), Candidate: [ 3  0  2 -1  1  1  2 -1  2  0  0  1  2  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 105500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  0  1  0  0 -1  0  0  1  0  0 -1  0] (Indices: [1, 3, 7, 10, 11, 12, 16, 17, 18]), Candidate: [ 3  0  2 -1  1  1  2 -1  1  2  0  1  0  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 105550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  0  1 -1  1  0 -1  1  0 -1  1 -1  0] (Indices: [1, 3, 7, 10, 12, 13, 15, 16, 18]), Candidate: [ 3  0  2 -1  1  1  2 -1  1  2 -1  2  1  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 105600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  0  0  1  0  0  0 -1  1 -1  1 -1  0] (Indices: [1, 3, 7, 11, 12, 13, 14, 16, 18]), Candidate: [ 3  0  2 -1  1  1  2 -1  1  1  1  1  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 105650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  0  0  1 -1  0  0  1  0  0  0  0 -1] (Indices: [1, 3, 7, 11, 15, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  1  1  2 -1  1  1  1  0  1  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 105700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1  0  0  0 -1  1  0  0 -1  0  0  0  0] (Indices: [1, 3, 8, 9, 10, 11, 13, 14, 15]), Candidate: [ 3  0  2 -1  1  1  1  1  1  1  0  0  2  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1  0  0 -1  1 -1  1  0  0 -1  0  0  0] (Indices: [1, 3, 8, 9, 10, 12, 14, 15, 16]), Candidate: [ 3  0  2 -1  1  1  1  1  1  1 -1  2  0  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 105800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1  0  0 -1  0  0  0  1  0  0  0 -1  0] (Indices: [1, 3, 8, 9, 10, 15, 16, 17, 18]), Candidate: [ 3  0  2 -1  1  1  1  1  1  1 -1  1  1  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 105850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1  0 -1  1 -1  1 -1  1  0  0 -1  0  0] (Indices: [1, 3, 8, 9, 11, 13, 15, 16, 17]), Candidate: [ 3  0  2 -1  1  1  1  1  1  0  1  0  2  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1  0 -1  0  1 -1  1  0 -1  0  1  0 -1] (Indices: [1, 3, 8, 9, 12, 14, 15, 18, 19]), Candidate: [ 3  0  2 -1  1  1  1  1  1  0  0  2  0  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1 -1  1  0  0 -1  1 -1  1  0 -1  0  0] (Indices: [1, 3, 8, 10, 11, 12, 14, 16, 17]), Candidate: [ 3  0  2 -1  1  1  1  1  0  2  0  1  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 106000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1 -1  1  0 -1  0  0  0  1  0  0  0 -1] (Indices: [1, 3, 8, 10, 11, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  1  1  1  1  0  2  0  0  1  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 106050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1 -1  1 -1  0  1 -1  0  1  0  0  0 -1] (Indices: [1, 3, 8, 10, 13, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  1  1  1  1  0  2 -1  1  2  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 106100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1 -1  0  1 -1  1  0 -1  1 -1  1  0 -1] (Indices: [1, 3, 8, 11, 13, 14, 16, 18, 19]), Candidate: [ 3  0  2 -1  1  1  1  1  0  1  1  0  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 106150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  1  0  0  0  0 -1  0  1  0 -1  0  0] (Indices: [1, 3, 9, 10, 11, 12, 13, 16, 17]), Candidate: [ 3  0  2 -1  1  1  1  0  2  1  0  1  1  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 106200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  1  0  0 -1  0  1  0 -1  1 -1  1 -1] (Indices: [1, 3, 9, 10, 11, 14, 15, 17, 19]), Candidate: [ 3  0  2 -1  1  1  1  0  2  1  0  0  1  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 106250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  1  0 -1  0  1  0  0 -1  1 -1  1 -1] (Indices: [1, 3, 9, 10, 13, 14, 15, 17, 19]), Candidate: [ 3  0  2 -1  1  1  1  0  2  1 -1  1  2  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 106300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  1 -1  1  0 -1  0  1 -1  1  0  0 -1] (Indices: [1, 3, 9, 11, 12, 15, 17, 18, 19]), Candidate: [ 3  0  2 -1  1  1  1  0  2  0  1  1  0  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 106350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  1 -1  0  0  0  1  0  0  0  0  0 -1] (Indices: [1, 3, 9, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  1  1  1  0  2  0  0  1  1  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 106400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  0  1  0 -1  1 -1  0  1  0  0  0 -1] (Indices: [1, 3, 10, 11, 13, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  1  1  1  0  1  2  0  0  2  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 106450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  0  0  1  0 -1  1  0  0  0  0 -1  0] (Indices: [1, 3, 11, 12, 14, 15, 16, 17, 18]), Candidate: [ 3  0  2 -1  1  1  1  0  1  1  1  1  0  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 106500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0  0 -1  0  0  1 -1  0  0  0  0  1 -1] (Indices: [1, 4, 5, 6, 7, 8, 9, 13, 19]), Candidate: [3 0 1 1 1 1 1 0 1 0 0 1 2 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 106550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0 -1  1 -1  0  0  0  0  0  1 -1  1 -1] (Indices: [1, 4, 5, 6, 7, 8, 10, 17, 19]), Candidate: [ 3  0  1  1  1  1  1  0  0  2 -1  1  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 106600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0 -1  0  0  1 -1  0  0  0  0  1  0 -1] (Indices: [1, 4, 5, 6, 7, 8, 12, 18, 19]), Candidate: [3 0 1 1 1 1 1 0 0 1 0 2 0 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 106650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  1  0 -1  1 -1  0  0  0  0  0  1 -1] (Indices: [1, 4, 5, 6, 7, 9, 10, 12, 19]), Candidate: [ 3  0  1  1  1  1  1 -1  2  1 -1  2  0  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 106700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  1 -1  0  1  0  0 -1  0  0  0  0  0] (Indices: [1, 4, 5, 6, 7, 9, 12, 13, 14]), Candidate: [ 3  0  1  1  1  1  1 -1  2  0  0  2  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 106750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  1 -1  0  0  0  0  1 -1  1 -1  1 -1] (Indices: [1, 4, 5, 6, 7, 9, 15, 17, 19]), Candidate: [ 3  0  1  1  1  1  1 -1  2  0  0  1  1  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 106800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  0  1 -1  1 -1  0  0  1 -1  1 -1  0] (Indices: [1, 4, 5, 6, 7, 10, 12, 16, 18]), Candidate: [ 3  0  1  1  1  1  1 -1  1  2 -1  2  0  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 106850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  0  0  1  0 -1  1 -1  0  0  0  1 -1] (Indices: [1, 4, 5, 6, 7, 11, 12, 14, 19]), Candidate: [ 3  0  1  1  1  1  1 -1  1  1  1  1  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 106900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  0  0  0  1  0  0 -1  0  0  0  1 -1] (Indices: [1, 4, 5, 6, 7, 12, 13, 14, 19]), Candidate: [ 3  0  1  1  1  1  1 -1  1  1  0  2  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 106950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  0  0  0  0  1 -1  0  0  1  0  0 -1] (Indices: [1, 4, 5, 6, 7, 13, 17, 18, 19]), Candidate: [ 3  0  1  1  1  1  1 -1  1  1  0  1  2  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1  0  0 -1  0  0  0  0  0  1 -1  1 -1] (Indices: [1, 4, 5, 6, 8, 9, 10, 17, 19]), Candidate: [ 3  0  1  1  1  1  0  1  1  1 -1  1  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1  0 -1  0  1 -1  0  0  0  0  1  0 -1] (Indices: [1, 4, 5, 6, 8, 9, 12, 18, 19]), Candidate: [3 0 1 1 1 1 0 1 1 0 0 2 0 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 107100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1 -1  1  0 -1  0  1 -1  1 -1  0  0  0] (Indices: [1, 4, 5, 6, 8, 10, 11, 14, 16]), Candidate: [ 3  0  1  1  1  1  0  1  0  2  0  0  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1 -1  1 -1  0  0  1  0  0 -1  0  0  0] (Indices: [1, 4, 5, 6, 8, 10, 14, 15, 16]), Candidate: [ 3  0  1  1  1  1  0  1  0  2 -1  1  1  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1 -1  0  1 -1  1 -1  0  1  0 -1  0  0] (Indices: [1, 4, 5, 6, 8, 11, 13, 16, 17]), Candidate: [3 0 1 1 1 1 0 1 0 1 1 0 2 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 107250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1 -1  0  0  1 -1  1 -1  0  0  1  0 -1] (Indices: [1, 4, 5, 6, 8, 12, 14, 18, 19]), Candidate: [ 3  0  1  1  1  1  0  1  0  1  0  2  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  1  0  0  0 -1  0  0  0  1 -1  0  0] (Indices: [1, 4, 5, 6, 9, 10, 11, 12, 17]), Candidate: [3 0 1 1 1 1 0 0 2 1 0 1 0 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 107350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  1  0 -1  0  1 -1  1  0 -1  0  0  0] (Indices: [1, 4, 5, 6, 9, 10, 13, 15, 16]), Candidate: [ 3  0  1  1  1  1  0  0  2  1 -1  1  2  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  1 -1  1  0 -1  0  0  0  0  1  0 -1] (Indices: [1, 4, 5, 6, 9, 11, 12, 18, 19]), Candidate: [3 0 1 1 1 1 0 0 2 0 1 1 0 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 107450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  1 -1  0  1  0 -1  0  0  0  1  0 -1] (Indices: [1, 4, 5, 6, 9, 12, 13, 18, 19]), Candidate: [3 0 1 1 1 1 0 0 2 0 0 2 1 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 107500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  1 -1  0  0  0  1 -1  0  1  0  0 -1] (Indices: [1, 4, 5, 6, 9, 14, 17, 18, 19]), Candidate: [ 3  0  1  1  1  1  0  0  2  0  0  1  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  0  1  0 -1  0  1 -1  0  1 -1  1 -1] (Indices: [1, 4, 5, 6, 10, 11, 14, 17, 19]), Candidate: [ 3  0  1  1  1  1  0  0  1  2  0  0  1  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  0  1 -1  0  1  0  0 -1  0  0  1 -1] (Indices: [1, 4, 5, 6, 10, 13, 14, 15, 19]), Candidate: [ 3  0  1  1  1  1  0  0  1  2 -1  1  2  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  0  0  1  0 -1  1  0 -1  0  0  1 -1] (Indices: [1, 4, 5, 6, 11, 12, 14, 15, 19]), Candidate: [3 0 1 1 1 1 0 0 1 1 1 1 0 2 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 107700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  0  0  1 -1  0  0  1 -1  1  0  0 -1] (Indices: [1, 4, 5, 6, 11, 15, 17, 18, 19]), Candidate: [3 0 1 1 1 1 0 0 1 1 1 0 1 1 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 107750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  0  0  0  0  1 -1  1 -1  1  0  0 -1] (Indices: [1, 4, 5, 6, 13, 15, 17, 18, 19]), Candidate: [3 0 1 1 1 1 0 0 1 1 0 1 2 0 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 107800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0  0 -1  1  0 -1  0  0  0  0  0  1 -1] (Indices: [1, 4, 5, 7, 8, 9, 11, 12, 19]), Candidate: [3 0 1 1 1 0 2 0 1 0 1 1 0 1 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 107850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0  0 -1  0  0  1 -1  1 -1  0  1 -1  0] (Indices: [1, 4, 5, 7, 8, 9, 13, 15, 18]), Candidate: [3 0 1 1 1 0 2 0 1 0 0 1 2 0 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 107900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0 -1  1  0 -1  0  0  0  1  0 -1  0  0] (Indices: [1, 4, 5, 7, 8, 10, 11, 16, 17]), Candidate: [3 0 1 1 1 0 2 0 0 2 0 0 1 1 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 107950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0 -1  1 -1  0  0  1 -1  0  1 -1  1 -1] (Indices: [1, 4, 5, 7, 8, 10, 14, 17, 19]), Candidate: [ 3  0  1  1  1  0  2  0  0  2 -1  1  1  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 108000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0 -1  0  1 -1  0  1  0 -1  0  1 -1  0] (Indices: [1, 4, 5, 7, 8, 11, 14, 15, 18]), Candidate: [3 0 1 1 1 0 2 0 0 1 1 0 1 2 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 108050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0 -1  0  0  1 -1  0  0  1  0 -1  1 -1] (Indices: [1, 4, 5, 7, 8, 12, 16, 17, 19]), Candidate: [3 0 1 1 1 0 2 0 0 1 0 2 0 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 108100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  1  0  0 -1  1 -1  0  0  0  0  1 -1] (Indices: [1, 4, 5, 7, 9, 10, 11, 13, 19]), Candidate: [ 3  0  1  1  1  0  2 -1  2  1  0  0  2  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  1  0 -1  0  1 -1  0  0  1 -1  1 -1] (Indices: [1, 4, 5, 7, 9, 10, 13, 17, 19]), Candidate: [ 3  0  1  1  1  0  2 -1  2  1 -1  1  2  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 108200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  1 -1  1 -1  1 -1  1 -1  0  1 -1  0] (Indices: [1, 4, 5, 7, 9, 11, 13, 15, 18]), Candidate: [ 3  0  1  1  1  0  2 -1  2  0  1  0  2  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  1 -1  0  1 -1  1 -1  0  1  0 -1  0] (Indices: [1, 4, 5, 7, 9, 12, 14, 17, 18]), Candidate: [ 3  0  1  1  1  0  2 -1  2  0  0  2  0  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 108300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  0  1  0  0  0 -1  0  1 -1  0  0  0] (Indices: [1, 4, 5, 7, 10, 11, 12, 13, 16]), Candidate: [ 3  0  1  1  1  0  2 -1  1  2  0  1  1  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  0  1  0 -1  0  0  0  1  0  0 -1  0] (Indices: [1, 4, 5, 7, 10, 11, 16, 17, 18]), Candidate: [ 3  0  1  1  1  0  2 -1  1  2  0  0  1  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  0  1 -1  0  1 -1  1  0 -1  1 -1  0] (Indices: [1, 4, 5, 7, 10, 13, 15, 16, 18]), Candidate: [ 3  0  1  1  1  0  2 -1  1  2 -1  1  2  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 108450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  0  0  1  0 -1  0  1  0 -1  1 -1  0] (Indices: [1, 4, 5, 7, 11, 12, 15, 16, 18]), Candidate: [ 3  0  1  1  1  0  2 -1  1  1  1  1  0  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  0  0  0  1  0  0 -1  1 -1  0  1 -1] (Indices: [1, 4, 5, 7, 12, 13, 14, 16, 19]), Candidate: [ 3  0  1  1  1  0  2 -1  1  1  0  2  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 108550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1  0  0  0  0  0 -1  0  0  0  0  0  0] (Indices: [1, 4, 5, 8, 9, 10, 11, 12, 13]), Candidate: [3 0 1 1 1 0 1 1 1 1 0 1 1 0 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 108600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1  0  0 -1  0  1  0 -1  1 -1  0  0  0] (Indices: [1, 4, 5, 8, 9, 10, 13, 14, 16]), Candidate: [ 3  0  1  1  1  0  1  1  1  1 -1  1  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 108650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1  0 -1  1  0 -1  0  0  1 -1  1 -1  0] (Indices: [1, 4, 5, 8, 9, 11, 12, 16, 18]), Candidate: [3 0 1 1 1 0 1 1 1 0 1 1 0 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 108700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1  0 -1  0  1  0 -1  0  1 -1  1 -1  0] (Indices: [1, 4, 5, 8, 9, 12, 13, 16, 18]), Candidate: [3 0 1 1 1 0 1 1 1 0 0 2 1 0 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 108750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1  0 -1  0  0  0  1  0 -1  0  1  0 -1] (Indices: [1, 4, 5, 8, 9, 14, 15, 18, 19]), Candidate: [3 0 1 1 1 0 1 1 1 0 0 1 1 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 108800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1 -1  1  0 -1  0  1 -1  1  0 -1  0  0] (Indices: [1, 4, 5, 8, 10, 11, 14, 16, 17]), Candidate: [ 3  0  1  1  1  0  1  1  0  2  0  0  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1 -1  1 -1  1 -1  0  0  0  1  0  0 -1] (Indices: [1, 4, 5, 8, 10, 12, 17, 18, 19]), Candidate: [ 3  0  1  1  1  0  1  1  0  2 -1  2  0  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1 -1  0  1  0  0 -1  0  0  0  1  0 -1] (Indices: [1, 4, 5, 8, 11, 12, 13, 18, 19]), Candidate: [3 0 1 1 1 0 1 1 0 1 1 1 1 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 108950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1 -1  0  1 -1  0  1 -1  0  1  0  0 -1] (Indices: [1, 4, 5, 8, 11, 14, 17, 18, 19]), Candidate: [ 3  0  1  1  1  0  1  1  0  1  1  0  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1 -1  0  0  0  1  0 -1  0  1  0  0 -1] (Indices: [1, 4, 5, 8, 13, 14, 17, 18, 19]), Candidate: [ 3  0  1  1  1  0  1  1  0  1  0  1  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  1  0  0 -1  0  1  0 -1  0  1 -1  0] (Indices: [1, 4, 5, 9, 10, 11, 14, 15, 18]), Candidate: [3 0 1 1 1 0 1 0 2 1 0 0 1 2 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 109100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  1  0 -1  1 -1  0  0  1  0 -1  1 -1] (Indices: [1, 4, 5, 9, 10, 12, 16, 17, 19]), Candidate: [ 3  0  1  1  1  0  1  0  2  1 -1  2  0  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  1 -1  1  0  0 -1  0  0  1  0 -1  0] (Indices: [1, 4, 5, 9, 11, 12, 13, 17, 18]), Candidate: [3 0 1 1 1 0 1 0 2 0 1 1 1 0 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 109200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  1 -1  1 -1  0  1 -1  1  0 -1  1 -1] (Indices: [1, 4, 5, 9, 11, 14, 16, 17, 19]), Candidate: [ 3  0  1  1  1  0  1  0  2  0  1  0  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  1 -1  0  0  1  0 -1  1  0 -1  1 -1] (Indices: [1, 4, 5, 9, 13, 14, 16, 17, 19]), Candidate: [ 3  0  1  1  1  0  1  0  2  0  0  1  2  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  0  1  0 -1  1  0  0 -1  1 -1  0  0] (Indices: [1, 4, 5, 10, 11, 13, 14, 15, 17]), Candidate: [3 0 1 1 1 0 1 0 1 2 0 0 2 1 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 109350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  0  1 -1  1  0 -1  0  1  0  0 -1  0] (Indices: [1, 4, 5, 10, 12, 13, 16, 17, 18]), Candidate: [ 3  0  1  1  1  0  1  0  1  2 -1  2  1  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  0  0  1  0  0 -1  1  0  0 -1  0  0] (Indices: [1, 4, 5, 11, 12, 13, 15, 16, 17]), Candidate: [3 0 1 1 1 0 1 0 1 1 1 1 1 0 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 109450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  0  0  0  1  0  0  0 -1  1 -1  1 -1] (Indices: [1, 4, 5, 12, 13, 14, 15, 17, 19]), Candidate: [3 0 1 1 1 0 1 0 1 1 0 2 1 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 109500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0  0  0 -1  0  0  0  1  0 -1  0  0  0] (Indices: [1, 4, 6, 7, 8, 9, 10, 15, 16]), Candidate: [ 3  0  1  1  0  2  1  0  1  1 -1  1  1  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0  0 -1  0  1 -1  0  1 -1  1 -1  0  0] (Indices: [1, 4, 6, 7, 8, 9, 12, 15, 17]), Candidate: [3 0 1 1 0 2 1 0 1 0 0 2 0 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 109600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0 -1  1  0  0 -1  0  0  0  0  0  1 -1] (Indices: [1, 4, 6, 7, 8, 10, 11, 12, 19]), Candidate: [3 0 1 1 0 2 1 0 0 2 0 1 0 1 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 109650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0 -1  1 -1  0  1 -1  1 -1  0  1 -1  0] (Indices: [1, 4, 6, 7, 8, 10, 13, 15, 18]), Candidate: [ 3  0  1  1  0  2  1  0  0  2 -1  1  2  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0 -1  0  1 -1  1  0 -1  1 -1  0  0  0] (Indices: [1, 4, 6, 7, 8, 11, 13, 14, 16]), Candidate: [ 3  0  1  1  0  2  1  0  0  1  1  0  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0 -1  0  0  1 -1  1  0 -1  1 -1  0  0] (Indices: [1, 4, 6, 7, 8, 12, 14, 15, 17]), Candidate: [3 0 1 1 0 2 1 0 0 1 0 2 0 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 109800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0 -1  0  0  0  0  0  1  0  0 -1  1 -1] (Indices: [1, 4, 6, 7, 8, 15, 16, 17, 19]), Candidate: [3 0 1 1 0 2 1 0 0 1 0 1 1 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 109850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  1  0 -1  1 -1  0  0  0  1  0 -1  0] (Indices: [1, 4, 6, 7, 9, 10, 12, 17, 18]), Candidate: [ 3  0  1  1  0  2  1 -1  2  1 -1  2  0  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 109900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  1 -1  1  0 -1  0  1 -1  1 -1  0  0] (Indices: [1, 4, 6, 7, 9, 11, 12, 15, 17]), Candidate: [ 3  0  1  1  0  2  1 -1  2  0  1  1  0  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  1 -1  0  1  0 -1  1 -1  1 -1  0  0] (Indices: [1, 4, 6, 7, 9, 12, 13, 15, 17]), Candidate: [ 3  0  1  1  0  2  1 -1  2  0  0  2  1  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  1 -1  0  0  0  1  0  0 -1  1 -1  0] (Indices: [1, 4, 6, 7, 9, 14, 15, 16, 18]), Candidate: [ 3  0  1  1  0  2  1 -1  2  0  0  1  1  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  0  1  0 -1  0  1  0  0 -1  0  0  0] (Indices: [1, 4, 6, 7, 10, 11, 14, 15, 16]), Candidate: [ 3  0  1  1  0  2  1 -1  1  2  0  0  1  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  0  1 -1  1 -1  0  1 -1  0  1  0 -1] (Indices: [1, 4, 6, 7, 10, 12, 15, 18, 19]), Candidate: [ 3  0  1  1  0  2  1 -1  1  2 -1  2  0  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 110150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  0  0  1  0  0 -1  0  1 -1  1 -1  0] (Indices: [1, 4, 6, 7, 11, 12, 13, 16, 18]), Candidate: [ 3  0  1  1  0  2  1 -1  1  1  1  1  1  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  0  0  1 -1  0  1  0 -1  0  1  0 -1] (Indices: [1, 4, 6, 7, 11, 14, 15, 18, 19]), Candidate: [ 3  0  1  1  0  2  1 -1  1  1  1  0  1  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  0  0  0  0  1  0  0 -1  0  1  0 -1] (Indices: [1, 4, 6, 7, 13, 14, 15, 18, 19]), Candidate: [ 3  0  1  1  0  2  1 -1  1  1  0  1  2  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1  0  0 -1  1 -1  1  0 -1  0  0  0  0] (Indices: [1, 4, 6, 8, 9, 10, 12, 14, 15]), Candidate: [ 3  0  1  1  0  2  0  1  1  1 -1  2  0  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1  0 -1  1  0  0  0 -1  0  0  0  0  0] (Indices: [1, 4, 6, 8, 9, 11, 12, 13, 14]), Candidate: [ 3  0  1  1  0  2  0  1  1  0  1  1  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1  0 -1  1 -1  0  0  1 -1  1 -1  1 -1] (Indices: [1, 4, 6, 8, 9, 11, 15, 17, 19]), Candidate: [3 0 1 1 0 2 0 1 1 0 1 0 1 1 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 110450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1  0 -1  0  0  1  0 -1  0  0  1  0 -1] (Indices: [1, 4, 6, 8, 9, 13, 14, 18, 19]), Candidate: [ 3  0  1  1  0  2  0  1  1  0  0  1  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1 -1  1  0 -1  1  0 -1  0  0  1 -1  0] (Indices: [1, 4, 6, 8, 10, 11, 13, 14, 18]), Candidate: [ 3  0  1  1  0  2  0  1  0  2  0  0  2  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1 -1  1 -1  1 -1  1  0 -1  0  0  1 -1] (Indices: [1, 4, 6, 8, 10, 12, 14, 15, 19]), Candidate: [ 3  0  1  1  0  2  0  1  0  2 -1  2  0  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1 -1  1 -1  0  0  0  1 -1  1  0  0 -1] (Indices: [1, 4, 6, 8, 10, 15, 17, 18, 19]), Candidate: [ 3  0  1  1  0  2  0  1  0  2 -1  1  1  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1 -1  0  1 -1  1 -1  1 -1  1  0 -1  0] (Indices: [1, 4, 6, 8, 11, 13, 15, 17, 18]), Candidate: [3 0 1 1 0 2 0 1 0 1 1 0 2 0 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 110700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1 -1  0  0  1 -1  1 -1  1 -1  1  0 -1] (Indices: [1, 4, 6, 8, 12, 14, 16, 18, 19]), Candidate: [ 3  0  1  1  0  2  0  1  0  1  0  2  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  1  0  0 -1  1  0 -1  1 -1  0  0  0] (Indices: [1, 4, 6, 9, 10, 11, 13, 14, 16]), Candidate: [ 3  0  1  1  0  2  0  0  2  1  0  0  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  1  0 -1  1 -1  1  0 -1  1 -1  0  0] (Indices: [1, 4, 6, 9, 10, 12, 14, 15, 17]), Candidate: [ 3  0  1  1  0  2  0  0  2  1 -1  2  0  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  1  0 -1  0  0  0  1  0  0 -1  1 -1] (Indices: [1, 4, 6, 9, 10, 15, 16, 17, 19]), Candidate: [ 3  0  1  1  0  2  0  0  2  1 -1  1  1  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  1 -1  1 -1  1 -1  1  0 -1  1 -1  0] (Indices: [1, 4, 6, 9, 11, 13, 15, 16, 18]), Candidate: [3 0 1 1 0 2 0 0 2 0 1 0 2 0 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 110950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  1 -1  0  1 -1  1 -1  1  0  0 -1  0] (Indices: [1, 4, 6, 9, 12, 14, 16, 17, 18]), Candidate: [ 3  0  1  1  0  2  0  0  2  0  0  2  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  0  1  0  0 -1  1 -1  1 -1  1 -1  0] (Indices: [1, 4, 6, 10, 11, 12, 14, 16, 18]), Candidate: [ 3  0  1  1  0  2  0  0  1  2  0  1  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  0  1 -1  1  0  0  0  0 -1  0  0  0] (Indices: [1, 4, 6, 10, 12, 13, 14, 15, 16]), Candidate: [ 3  0  1  1  0  2  0  0  1  2 -1  2  1  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  0  1 -1  0  0  1  0  0  0  0 -1  0] (Indices: [1, 4, 6, 10, 14, 15, 16, 17, 18]), Candidate: [ 3  0  1  1  0  2  0  0  1  2 -1  1  1  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  0  0  1 -1  1  0 -1  0  1  0  0 -1] (Indices: [1, 4, 6, 11, 13, 14, 17, 18, 19]), Candidate: [ 3  0  1  1  0  2  0  0  1  1  1  0  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0  0  0  0 -1  1 -1  0  0  1 -1  0  0] (Indices: [1, 4, 7, 8, 9, 10, 11, 13, 17]), Candidate: [3 0 1 1 0 1 2 0 1 1 0 0 2 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 111250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0  0  0 -1  0  1 -1  0  1 -1  0  1 -1] (Indices: [1, 4, 7, 8, 9, 10, 13, 16, 19]), Candidate: [ 3  0  1  1  0  1  2  0  1  1 -1  1  2  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0  0 -1  1 -1  1 -1  1  0 -1  0  0  0] (Indices: [1, 4, 7, 8, 9, 11, 13, 15, 16]), Candidate: [3 0 1 1 0 1 2 0 1 0 1 0 2 0 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 111350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0  0 -1  0  1 -1  1 -1  1 -1  1 -1  0] (Indices: [1, 4, 7, 8, 9, 12, 14, 16, 18]), Candidate: [ 3  0  1  1  0  1  2  0  1  0  0  2  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0 -1  1  0  0  0  0 -1  0  0  0  0  0] (Indices: [1, 4, 7, 8, 10, 11, 12, 13, 14]), Candidate: [ 3  0  1  1  0  1  2  0  0  2  0  1  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0 -1  1  0 -1  0  0  1 -1  1 -1  1 -1] (Indices: [1, 4, 7, 8, 10, 11, 15, 17, 19]), Candidate: [3 0 1 1 0 1 2 0 0 2 0 0 1 1 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 111500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0 -1  1 -1  0  1  0 -1  0  0  1  0 -1] (Indices: [1, 4, 7, 8, 10, 13, 14, 18, 19]), Candidate: [ 3  0  1  1  0  1  2  0  0  2 -1  1  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 111550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0 -1  0  1  0 -1  1 -1  0  0  1  0 -1] (Indices: [1, 4, 7, 8, 11, 12, 14, 18, 19]), Candidate: [ 3  0  1  1  0  1  2  0  0  1  1  1  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0 -1  0  0  1  0  0 -1  1  0 -1  0  0] (Indices: [1, 4, 7, 8, 12, 13, 14, 16, 17]), Candidate: [ 3  0  1  1  0  1  2  0  0  1  0  2  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0 -1  0  0  0  0  1 -1  1  0  0  0 -1] (Indices: [1, 4, 7, 8, 14, 16, 17, 18, 19]), Candidate: [ 3  0  1  1  0  1  2  0  0  1  0  1  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  1  0  0 -1  0  0  1  0 -1  0  1 -1] (Indices: [1, 4, 7, 9, 10, 11, 15, 16, 19]), Candidate: [ 3  0  1  1  0  1  2 -1  2  1  0  0  1  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  1  0 -1  0  1  0 -1  0  1  0 -1  0] (Indices: [1, 4, 7, 9, 10, 13, 14, 17, 18]), Candidate: [ 3  0  1  1  0  1  2 -1  2  1 -1  1  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 111800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  1 -1  1  0 -1  1 -1  0  1  0 -1  0] (Indices: [1, 4, 7, 9, 11, 12, 14, 17, 18]), Candidate: [ 3  0  1  1  0  1  2 -1  2  0  1  1  0  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 111850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  1 -1  0  1  0  0  0 -1  0  1 -1  0] (Indices: [1, 4, 7, 9, 12, 13, 14, 15, 18]), Candidate: [ 3  0  1  1  0  1  2 -1  2  0  0  2  1  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  1 -1  0  0  0  1  0  0 -1  1  0 -1] (Indices: [1, 4, 7, 9, 14, 15, 16, 18, 19]), Candidate: [ 3  0  1  1  0  1  2 -1  2  0  0  1  1  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  0  1  0 -1  1 -1  1  0 -1  1 -1  0] (Indices: [1, 4, 7, 10, 11, 13, 15, 16, 18]), Candidate: [ 3  0  1  1  0  1  2 -1  1  2  0  0  2  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  0  1 -1  1 -1  1 -1  1  0  0 -1  0] (Indices: [1, 4, 7, 10, 12, 14, 16, 17, 18]), Candidate: [ 3  0  1  1  0  1  2 -1  1  2 -1  2  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 112050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  0  0  1  0 -1  1  0  0  0 -1  0  0] (Indices: [1, 4, 7, 11, 12, 14, 15, 16, 17]), Candidate: [ 3  0  1  1  0  1  2 -1  1  1  1  1  0  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  0  0  0  1  0 -1  0  1  0  0  0 -1] (Indices: [1, 4, 7, 12, 13, 16, 17, 18, 19]), Candidate: [ 3  0  1  1  0  1  2 -1  1  1  0  2  1  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1  0  0  0 -1  0  1  0  0 -1  0  0  0] (Indices: [1, 4, 8, 9, 10, 11, 14, 15, 16]), Candidate: [3 0 1 1 0 1 1 1 1 1 0 0 1 2 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 112200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1  0  0 -1  1 -1  0  1 -1  0  1  0 -1] (Indices: [1, 4, 8, 9, 10, 12, 15, 18, 19]), Candidate: [ 3  0  1  1  0  1  1  1  1  1 -1  2  0  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1  0 -1  1  0  0 -1  0  1 -1  1 -1  0] (Indices: [1, 4, 8, 9, 11, 12, 13, 16, 18]), Candidate: [3 0 1 1 0 1 1 1 1 0 1 1 1 0 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 112300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1  0 -1  1 -1  0  1  0 -1  0  1  0 -1] (Indices: [1, 4, 8, 9, 11, 14, 15, 18, 19]), Candidate: [3 0 1 1 0 1 1 1 1 0 1 0 1 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 112350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1  0 -1  0  0  1  0  0 -1  0  1  0 -1] (Indices: [1, 4, 8, 9, 13, 14, 15, 18, 19]), Candidate: [3 0 1 1 0 1 1 1 1 0 0 1 2 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 112400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1 -1  1  0  0 -1  0  0  0  1  0  0 -1] (Indices: [1, 4, 8, 10, 11, 12, 17, 18, 19]), Candidate: [3 0 1 1 0 1 1 1 0 2 0 1 0 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 112450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1 -1  1 -1  1  0 -1  1 -1  1 -1  1 -1] (Indices: [1, 4, 8, 10, 12, 13, 15, 17, 19]), Candidate: [ 3  0  1  1  0  1  1  1  0  2 -1  2  1  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1 -1  0  1  0  0  0 -1  0  1 -1  1 -1] (Indices: [1, 4, 8, 11, 12, 13, 14, 17, 19]), Candidate: [ 3  0  1  1  0  1  1  1  0  1  1  1  1  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1 -1  0  0  1  0  0  0  0 -1  0  1 -1] (Indices: [1, 4, 8, 12, 13, 14, 15, 16, 19]), Candidate: [3 0 1 1 0 1 1 1 0 1 0 2 1 1 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 112600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  1  0  0  0 -1  1 -1  0  0  1  0 -1] (Indices: [1, 4, 9, 10, 11, 12, 14, 18, 19]), Candidate: [ 3  0  1  1  0  1  1  0  2  1  0  1  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  1  0 -1  1  0  0 -1  1  0 -1  0  0] (Indices: [1, 4, 9, 10, 12, 13, 14, 16, 17]), Candidate: [ 3  0  1  1  0  1  1  0  2  1 -1  2  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 112700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  1  0 -1  0  0  1 -1  1  0  0  0 -1] (Indices: [1, 4, 9, 10, 14, 16, 17, 18, 19]), Candidate: [ 3  0  1  1  0  1  1  0  2  1 -1  1  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 112750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  1 -1  1 -1  1 -1  1 -1  1  0  0 -1] (Indices: [1, 4, 9, 11, 13, 15, 17, 18, 19]), Candidate: [3 0 1 1 0 1 1 0 2 0 1 0 2 0 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 112800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  0  1  0  0  0 -1  1 -1  1 -1  1 -1] (Indices: [1, 4, 10, 11, 12, 13, 15, 17, 19]), Candidate: [3 0 1 1 0 1 1 0 1 2 0 1 1 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 112850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  0  1 -1  1  0  0 -1  1 -1  1  0 -1] (Indices: [1, 4, 10, 12, 13, 14, 16, 18, 19]), Candidate: [ 3  0  1  1  0  1  1  0  1  2 -1  2  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 112900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  0  0  0  1  0  0  0  0 -1  1  0 -1] (Indices: [1, 4, 12, 13, 14, 15, 16, 18, 19]), Candidate: [3 0 1 1 0 1 1 0 1 1 0 2 1 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 112950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0  0 -1  1 -1  1 -1  1 -1  0  0  0  0] (Indices: [1, 5, 6, 7, 8, 9, 11, 13, 15]), Candidate: [3 0 1 0 2 1 1 0 1 0 1 0 2 0 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 113000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0  0 -1  0  0  1 -1  0  1  0 -1  0  0] (Indices: [1, 5, 6, 7, 8, 9, 13, 16, 17]), Candidate: [3 0 1 0 2 1 1 0 1 0 0 1 2 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 113050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0 -1  1  0 -1  0  0  0  1 -1  0  1 -1] (Indices: [1, 5, 6, 7, 8, 10, 11, 16, 19]), Candidate: [3 0 1 0 2 1 1 0 0 2 0 0 1 1 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 113100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0 -1  1 -1  0  0  0  1  0  0 -1  0  0] (Indices: [1, 5, 6, 7, 8, 10, 15, 16, 17]), Candidate: [ 3  0  1  0  2  1  1  0  0  2 -1  1  1  1  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0 -1  0  1 -1  0  1 -1  1  0 -1  0  0] (Indices: [1, 5, 6, 7, 8, 11, 14, 16, 17]), Candidate: [ 3  0  1  0  2  1  1  0  0  1  1  0  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0 -1  0  0  1 -1  0  0  0  1  0  0 -1] (Indices: [1, 5, 6, 7, 8, 12, 17, 18, 19]), Candidate: [3 0 1 0 2 1 1 0 0 1 0 2 0 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 113250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  1  0  0 -1  0  1 -1  1 -1  0  0  0] (Indices: [1, 5, 6, 7, 9, 10, 11, 14, 16]), Candidate: [ 3  0  1  0  2  1  1 -1  2  1  0  0  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 113300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  1  0 -1  0  0  1  0  0 -1  0  0  0] (Indices: [1, 5, 6, 7, 9, 10, 14, 15, 16]), Candidate: [ 3  0  1  0  2  1  1 -1  2  1 -1  1  1  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 113350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  1 -1  1 -1  1 -1  0  1  0 -1  0  0] (Indices: [1, 5, 6, 7, 9, 11, 13, 16, 17]), Candidate: [ 3  0  1  0  2  1  1 -1  2  0  1  0  2  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  1 -1  0  1 -1  1 -1  0  0  1  0 -1] (Indices: [1, 5, 6, 7, 9, 12, 14, 18, 19]), Candidate: [ 3  0  1  0  2  1  1 -1  2  0  0  2  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 113450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  0  1  0  0  0 -1  0  0  0  1 -1  0] (Indices: [1, 5, 6, 7, 10, 11, 12, 13, 18]), Candidate: [ 3  0  1  0  2  1  1 -1  1  2  0  1  1  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  0  1  0 -1  0  0  0  1 -1  1  0 -1] (Indices: [1, 5, 6, 7, 10, 11, 16, 18, 19]), Candidate: [ 3  0  1  0  2  1  1 -1  1  2  0  0  1  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  0  1 -1  0  1 -1  1 -1  1  0 -1  0] (Indices: [1, 5, 6, 7, 10, 13, 15, 17, 18]), Candidate: [ 3  0  1  0  2  1  1 -1  1  2 -1  1  2  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 113600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  0  0  1  0 -1  0  1 -1  1  0 -1  0] (Indices: [1, 5, 6, 7, 11, 12, 15, 17, 18]), Candidate: [ 3  0  1  0  2  1  1 -1  1  1  1  1  0  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  0  0  0  1  0  0 -1  0  1 -1  1 -1] (Indices: [1, 5, 6, 7, 12, 13, 14, 17, 19]), Candidate: [ 3  0  1  0  2  1  1 -1  1  1  0  2  1  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 113700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1  0  0  0  0 -1  0  1 -1  0  0  0  0] (Indices: [1, 5, 6, 8, 9, 10, 11, 12, 15]), Candidate: [3 0 1 0 2 1 0 1 1 1 0 1 0 1 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 113750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1  0  0 -1  0  1  0 -1  0  0  1 -1  0] (Indices: [1, 5, 6, 8, 9, 10, 13, 14, 18]), Candidate: [ 3  0  1  0  2  1  0  1  1  1 -1  1  2  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 113800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1  0 -1  1  0 -1  0  0  0  1  0 -1  0] (Indices: [1, 5, 6, 8, 9, 11, 12, 17, 18]), Candidate: [3 0 1 0 2 1 0 1 1 0 1 1 0 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 113850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1  0 -1  0  1  0 -1  0  0  1  0 -1  0] (Indices: [1, 5, 6, 8, 9, 12, 13, 17, 18]), Candidate: [3 0 1 0 2 1 0 1 1 0 0 2 1 0 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 113900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1  0 -1  0  0  0  1 -1  1  0 -1  1 -1] (Indices: [1, 5, 6, 8, 9, 14, 16, 17, 19]), Candidate: [ 3  0  1  0  2  1  0  1  1  0  0  1  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1 -1  1  0 -1  0  1 -1  1 -1  0  1 -1] (Indices: [1, 5, 6, 8, 10, 11, 14, 16, 19]), Candidate: [ 3  0  1  0  2  1  0  1  0  2  0  0  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1 -1  1 -1  0  1  0  0 -1  1 -1  0  0] (Indices: [1, 5, 6, 8, 10, 13, 14, 15, 17]), Candidate: [ 3  0  1  0  2  1  0  1  0  2 -1  1  2  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1 -1  0  1  0 -1  1  0 -1  1 -1  0  0] (Indices: [1, 5, 6, 8, 11, 12, 14, 15, 17]), Candidate: [3 0 1 0 2 1 0 1 0 1 1 1 0 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 114100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1 -1  0  1 -1  0  0  1  0  0 -1  1 -1] (Indices: [1, 5, 6, 8, 11, 15, 16, 17, 19]), Candidate: [3 0 1 0 2 1 0 1 0 1 1 0 1 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 114150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1 -1  0  0  0  1 -1  1  0  0 -1  1 -1] (Indices: [1, 5, 6, 8, 13, 15, 16, 17, 19]), Candidate: [3 0 1 0 2 1 0 1 0 1 0 1 2 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 114200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  1  0  0 -1  0  1 -1  1  0 -1  0  0] (Indices: [1, 5, 6, 9, 10, 11, 14, 16, 17]), Candidate: [ 3  0  1  0  2  1  0  0  2  1  0  0  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  1  0 -1  1 -1  0  0  0  1  0  0 -1] (Indices: [1, 5, 6, 9, 10, 12, 17, 18, 19]), Candidate: [ 3  0  1  0  2  1  0  0  2  1 -1  2  0  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  1 -1  1  0  0 -1  0  0  0  1  0 -1] (Indices: [1, 5, 6, 9, 11, 12, 13, 18, 19]), Candidate: [3 0 1 0 2 1 0 0 2 0 1 1 1 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 114350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  1 -1  1 -1  0  1 -1  0  1  0  0 -1] (Indices: [1, 5, 6, 9, 11, 14, 17, 18, 19]), Candidate: [ 3  0  1  0  2  1  0  0  2  0  1  0  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  1 -1  0  0  1  0 -1  0  1  0  0 -1] (Indices: [1, 5, 6, 9, 13, 14, 17, 18, 19]), Candidate: [ 3  0  1  0  2  1  0  0  2  0  0  1  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  0  1  0 -1  1  0  0 -1  0  0  1 -1] (Indices: [1, 5, 6, 10, 11, 13, 14, 15, 19]), Candidate: [3 0 1 0 2 1 0 0 1 2 0 0 2 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 114500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  0  1 -1  1  0 -1  0  1 -1  1  0 -1] (Indices: [1, 5, 6, 10, 12, 13, 16, 18, 19]), Candidate: [ 3  0  1  0  2  1  0  0  1  2 -1  2  1  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  0  0  1  0  0 -1  1  0 -1  0  1 -1] (Indices: [1, 5, 6, 11, 12, 13, 15, 16, 19]), Candidate: [3 0 1 0 2 1 0 0 1 1 1 1 1 0 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 114600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  0  0  0  1  0  0 -1  1  0  0 -1  0] (Indices: [1, 5, 6, 12, 13, 14, 16, 17, 18]), Candidate: [ 3  0  1  0  2  1  0  0  1  1  0  2  1  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0  0  0 -1  1  0  0 -1  0  0  0  0  0] (Indices: [1, 5, 7, 8, 9, 10, 12, 13, 14]), Candidate: [ 3  0  1  0  2  0  2  0  1  1 -1  2  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 114700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0  0  0 -1  0  0  0  1 -1  1 -1  1 -1] (Indices: [1, 5, 7, 8, 9, 10, 15, 17, 19]), Candidate: [ 3  0  1  0  2  0  2  0  1  1 -1  1  1  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0  0 -1  1 -1  0  1 -1  0  1 -1  1 -1] (Indices: [1, 5, 7, 8, 9, 11, 14, 17, 19]), Candidate: [ 3  0  1  0  2  0  2  0  1  0  1  0  1  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0  0 -1  0  0  1  0  0 -1  0  0  1 -1] (Indices: [1, 5, 7, 8, 9, 13, 14, 15, 19]), Candidate: [3 0 1 0 2 0 2 0 1 0 0 1 2 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 114850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0 -1  1  0  0 -1  0  0  0  1  0 -1  0] (Indices: [1, 5, 7, 8, 10, 11, 12, 17, 18]), Candidate: [3 0 1 0 2 0 2 0 0 2 0 1 0 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 114900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0 -1  1 -1  1  0 -1  0  0  1  0 -1  0] (Indices: [1, 5, 7, 8, 10, 12, 13, 17, 18]), Candidate: [ 3  0  1  0  2  0  2  0  0  2 -1  2  1  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0 -1  1 -1  0  0  1 -1  1  0 -1  1 -1] (Indices: [1, 5, 7, 8, 10, 14, 16, 17, 19]), Candidate: [ 3  0  1  0  2  0  2  0  0  2 -1  1  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 115000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0 -1  0  1 -1  1  0 -1  0  1  0 -1  0] (Indices: [1, 5, 7, 8, 11, 13, 14, 17, 18]), Candidate: [ 3  0  1  0  2  0  2  0  0  1  1  0  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0 -1  0  0  1 -1  1  0  0 -1  0  1 -1] (Indices: [1, 5, 7, 8, 12, 14, 15, 16, 19]), Candidate: [3 0 1 0 2 0 2 0 0 1 0 2 0 2 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 115100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  1  0  0  0 -1  0  0  1 -1  1 -1  0] (Indices: [1, 5, 7, 9, 10, 11, 12, 16, 18]), Candidate: [ 3  0  1  0  2  0  2 -1  2  1  0  1  0  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  1  0 -1  1  0 -1  0  1 -1  1 -1  0] (Indices: [1, 5, 7, 9, 10, 12, 13, 16, 18]), Candidate: [ 3  0  1  0  2  0  2 -1  2  1 -1  2  1  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 115200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  1  0 -1  0  0  1  0 -1  0  1  0 -1] (Indices: [1, 5, 7, 9, 10, 14, 15, 18, 19]), Candidate: [ 3  0  1  0  2  0  2 -1  2  1 -1  1  1  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 115250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  1 -1  1 -1  1  0 -1  1 -1  1 -1  0] (Indices: [1, 5, 7, 9, 11, 13, 14, 16, 18]), Candidate: [ 3  0  1  0  2  0  2 -1  2  0  1  0  2  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 115300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  1 -1  0  1 -1  1  0  0  0 -1  0  0] (Indices: [1, 5, 7, 9, 12, 14, 15, 16, 17]), Candidate: [ 3  0  1  0  2  0  2 -1  2  0  0  2  0  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  0  1  0  0  0 -1  0  0  0  1  0 -1] (Indices: [1, 5, 7, 10, 11, 12, 13, 18, 19]), Candidate: [ 3  0  1  0  2  0  2 -1  1  2  0  1  1  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  0  1  0 -1  0  1 -1  0  1  0  0 -1] (Indices: [1, 5, 7, 10, 11, 14, 17, 18, 19]), Candidate: [ 3  0  1  0  2  0  2 -1  1  2  0  0  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 115450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  0  1 -1  0  1  0 -1  0  1  0  0 -1] (Indices: [1, 5, 7, 10, 13, 14, 17, 18, 19]), Candidate: [ 3  0  1  0  2  0  2 -1  1  2 -1  1  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 115500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  0  0  1 -1  1  0  0 -1  1  0 -1  0] (Indices: [1, 5, 7, 11, 13, 14, 15, 17, 18]), Candidate: [ 3  0  1  0  2  0  2 -1  1  1  1  0  2  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1  0  0  0  0  0 -1  0  0  0  1 -1  0] (Indices: [1, 5, 8, 9, 10, 11, 12, 13, 18]), Candidate: [3 0 1 0 2 0 1 1 1 1 0 1 1 0 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 115600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1  0  0  0 -1  0  0  0  1 -1  1  0 -1] (Indices: [1, 5, 8, 9, 10, 11, 16, 18, 19]), Candidate: [3 0 1 0 2 0 1 1 1 1 0 0 1 1 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 115650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1  0  0 -1  0  1 -1  1 -1  1  0 -1  0] (Indices: [1, 5, 8, 9, 10, 13, 15, 17, 18]), Candidate: [ 3  0  1  0  2  0  1  1  1  1 -1  1  2  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1  0 -1  1  0 -1  0  1 -1  1  0 -1  0] (Indices: [1, 5, 8, 9, 11, 12, 15, 17, 18]), Candidate: [3 0 1 0 2 0 1 1 1 0 1 1 0 1 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 115750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1  0 -1  0  1  0  0 -1  0  1 -1  1 -1] (Indices: [1, 5, 8, 9, 12, 13, 14, 17, 19]), Candidate: [ 3  0  1  0  2  0  1  1  1  0  0  2  1  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1 -1  1  0  0  0  0 -1  0  1 -1  0  0] (Indices: [1, 5, 8, 10, 11, 12, 13, 14, 17]), Candidate: [ 3  0  1  0  2  0  1  1  0  2  0  1  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1 -1  1  0 -1  1 -1  0  1  0 -1  1 -1] (Indices: [1, 5, 8, 10, 11, 13, 16, 17, 19]), Candidate: [3 0 1 0 2 0 1 1 0 2 0 0 2 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 115900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1 -1  1 -1  1 -1  0  1  0 -1  1  0 -1] (Indices: [1, 5, 8, 10, 12, 15, 16, 18, 19]), Candidate: [ 3  0  1  0  2  0  1  1  0  2 -1  2  0  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1 -1  0  1  0 -1  1 -1  1  0  0 -1  0] (Indices: [1, 5, 8, 11, 12, 14, 16, 17, 18]), Candidate: [ 3  0  1  0  2  0  1  1  0  1  1  1  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1 -1  0  0  1 -1  0  1  0  0  0  0 -1] (Indices: [1, 5, 8, 12, 15, 16, 17, 18, 19]), Candidate: [3 0 1 0 2 0 1 1 0 1 0 2 0 1 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 116050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  1  0  0 -1  1  0 -1  0  1  0 -1  0] (Indices: [1, 5, 9, 10, 11, 13, 14, 17, 18]), Candidate: [ 3  0  1  0  2  0  1  0  2  1  0  0  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  1  0 -1  1 -1  1  0  0 -1  0  1 -1] (Indices: [1, 5, 9, 10, 12, 14, 15, 16, 19]), Candidate: [ 3  0  1  0  2  0  1  0  2  1 -1  2  0  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  1 -1  1  0  0 -1  0  1  0  0 -1  0] (Indices: [1, 5, 9, 11, 12, 13, 16, 17, 18]), Candidate: [3 0 1 0 2 0 1 0 2 0 1 1 1 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 116200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  1 -1  0  1  0 -1  1  0  0  0 -1  0] (Indices: [1, 5, 9, 12, 13, 15, 16, 17, 18]), Candidate: [3 0 1 0 2 0 1 0 2 0 0 2 1 0 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 116250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  0  1  0  0 -1  0  1  0 -1  1  0 -1] (Indices: [1, 5, 10, 11, 12, 15, 16, 18, 19]), Candidate: [3 0 1 0 2 0 1 0 1 2 0 1 0 1 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 116300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  0  1 -1  0  1 -1  1  0  0  0  0 -1] (Indices: [1, 5, 10, 13, 15, 16, 17, 18, 19]), Candidate: [ 3  0  1  0  2  0  1  0  1  2 -1  1  2  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0  0  0  0 -1  1 -1  0  0  0  0  1 -1] (Indices: [1, 6, 7, 8, 9, 10, 11, 13, 19]), Candidate: [3 0 1 0 1 2 1 0 1 1 0 0 2 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 116400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0  0  0 -1  0  1 -1  0  0  1 -1  1 -1] (Indices: [1, 6, 7, 8, 9, 10, 13, 17, 19]), Candidate: [ 3  0  1  0  1  2  1  0  1  1 -1  1  2  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0  0 -1  1 -1  1 -1  1 -1  0  1 -1  0] (Indices: [1, 6, 7, 8, 9, 11, 13, 15, 18]), Candidate: [3 0 1 0 1 2 1 0 1 0 1 0 2 0 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 116500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0  0 -1  0  1 -1  1 -1  0  1  0 -1  0] (Indices: [1, 6, 7, 8, 9, 12, 14, 17, 18]), Candidate: [ 3  0  1  0  1  2  1  0  1  0  0  2  0  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0 -1  1  0  0  0 -1  0  1 -1  0  0  0] (Indices: [1, 6, 7, 8, 10, 11, 12, 13, 16]), Candidate: [3 0 1 0 1 2 1 0 0 2 0 1 1 0 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 116600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0 -1  1  0 -1  0  0  0  1  0  0 -1  0] (Indices: [1, 6, 7, 8, 10, 11, 16, 17, 18]), Candidate: [3 0 1 0 1 2 1 0 0 2 0 0 1 1 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 116650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0 -1  1 -1  0  1 -1  1  0 -1  1 -1  0] (Indices: [1, 6, 7, 8, 10, 13, 15, 16, 18]), Candidate: [ 3  0  1  0  1  2  1  0  0  2 -1  1  2  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0 -1  0  1  0 -1  0  1  0 -1  1 -1  0] (Indices: [1, 6, 7, 8, 11, 12, 15, 16, 18]), Candidate: [3 0 1 0 1 2 1 0 0 1 1 1 0 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 116750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0 -1  0  0  1  0  0 -1  1 -1  0  1 -1] (Indices: [1, 6, 7, 8, 12, 13, 14, 16, 19]), Candidate: [ 3  0  1  0  1  2  1  0  0  1  0  2  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  1  0  0  0  0  0 -1  0  0  0  0  0] (Indices: [1, 6, 7, 9, 10, 11, 12, 13, 14]), Candidate: [ 3  0  1  0  1  2  1 -1  2  1  0  1  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 116850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  1  0  0 -1  0  0  1 -1  1 -1  1 -1] (Indices: [1, 6, 7, 9, 10, 11, 15, 17, 19]), Candidate: [ 3  0  1  0  1  2  1 -1  2  1  0  0  1  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  1  0 -1  0  1  0 -1  0  0  1  0 -1] (Indices: [1, 6, 7, 9, 10, 13, 14, 18, 19]), Candidate: [ 3  0  1  0  1  2  1 -1  2  1 -1  1  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 116950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  1 -1  1  0 -1  1 -1  0  0  1  0 -1] (Indices: [1, 6, 7, 9, 11, 12, 14, 18, 19]), Candidate: [ 3  0  1  0  1  2  1 -1  2  0  1  1  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 117000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  1 -1  0  1  0  0 -1  1  0 -1  0  0] (Indices: [1, 6, 7, 9, 12, 13, 14, 16, 17]), Candidate: [ 3  0  1  0  1  2  1 -1  2  0  0  2  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 117050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  1 -1  0  0  0  1 -1  1  0  0  0 -1] (Indices: [1, 6, 7, 9, 14, 16, 17, 18, 19]), Candidate: [ 3  0  1  0  1  2  1 -1  2  0  0  1  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 117100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  0  1  0 -1  1 -1  1 -1  1  0 -1  0] (Indices: [1, 6, 7, 10, 11, 13, 15, 17, 18]), Candidate: [ 3  0  1  0  1  2  1 -1  1  2  0  0  2  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  0  1 -1  1 -1  1 -1  1 -1  1  0 -1] (Indices: [1, 6, 7, 10, 12, 14, 16, 18, 19]), Candidate: [ 3  0  1  0  1  2  1 -1  1  2 -1  2  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 117200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  0  0  1  0 -1  1  0  0 -1  0  1 -1] (Indices: [1, 6, 7, 11, 12, 14, 15, 16, 19]), Candidate: [ 3  0  1  0  1  2  1 -1  1  1  1  1  0  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  0  0  0  1 -1  1  0  0  0 -1  1 -1] (Indices: [1, 6, 7, 12, 14, 15, 16, 17, 19]), Candidate: [ 3  0  1  0  1  2  1 -1  1  1  0  2  0  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1  0  0  0 -1  0  1  0 -1  0  1 -1  0] (Indices: [1, 6, 8, 9, 10, 11, 14, 15, 18]), Candidate: [3 0 1 0 1 2 0 1 1 1 0 0 1 2 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 117350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1  0  0 -1  1 -1  0  0  1  0 -1  1 -1] (Indices: [1, 6, 8, 9, 10, 12, 16, 17, 19]), Candidate: [ 3  0  1  0  1  2  0  1  1  1 -1  2  0  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1  0 -1  1  0  0 -1  0  0  1  0 -1  0] (Indices: [1, 6, 8, 9, 11, 12, 13, 17, 18]), Candidate: [3 0 1 0 1 2 0 1 1 0 1 1 1 0 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 117450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1  0 -1  1 -1  0  1 -1  1  0 -1  1 -1] (Indices: [1, 6, 8, 9, 11, 14, 16, 17, 19]), Candidate: [ 3  0  1  0  1  2  0  1  1  0  1  0  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1  0 -1  0  0  1  0 -1  1  0 -1  1 -1] (Indices: [1, 6, 8, 9, 13, 14, 16, 17, 19]), Candidate: [ 3  0  1  0  1  2  0  1  1  0  0  1  2  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1 -1  1  0 -1  1  0  0 -1  1 -1  0  0] (Indices: [1, 6, 8, 10, 11, 13, 14, 15, 17]), Candidate: [3 0 1 0 1 2 0 1 0 2 0 0 2 1 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 117600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1 -1  1 -1  1  0 -1  0  1  0  0 -1  0] (Indices: [1, 6, 8, 10, 12, 13, 16, 17, 18]), Candidate: [ 3  0  1  0  1  2  0  1  0  2 -1  2  1  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1 -1  0  1  0  0 -1  1  0  0 -1  0  0] (Indices: [1, 6, 8, 11, 12, 13, 15, 16, 17]), Candidate: [3 0 1 0 1 2 0 1 0 1 1 1 1 0 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 117700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1 -1  0  0  1  0  0  0 -1  1 -1  1 -1] (Indices: [1, 6, 8, 12, 13, 14, 15, 17, 19]), Candidate: [3 0 1 0 1 2 0 1 0 1 0 2 1 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 117750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  1  0  0  0 -1  0  1  0 -1  1 -1  0] (Indices: [1, 6, 9, 10, 11, 12, 15, 16, 18]), Candidate: [3 0 1 0 1 2 0 0 2 1 0 1 0 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 117800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  1  0 -1  1  0  0 -1  1 -1  0  1 -1] (Indices: [1, 6, 9, 10, 12, 13, 14, 16, 19]), Candidate: [ 3  0  1  0  1  2  0  0  2  1 -1  2  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 117850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  1 -1  1  0  0  0  0  0 -1  0  0  0] (Indices: [1, 6, 9, 11, 12, 13, 14, 15, 16]), Candidate: [3 0 1 0 1 2 0 0 2 0 1 1 1 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 117900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  1 -1  1 -1  0  1  0  0  0  0 -1  0] (Indices: [1, 6, 9, 11, 14, 15, 16, 17, 18]), Candidate: [3 0 1 0 1 2 0 0 2 0 1 0 1 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 117950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  0  1  0  0  0 -1  0  1  0  0 -1  0] (Indices: [1, 6, 10, 11, 12, 13, 16, 17, 18]), Candidate: [3 0 1 0 1 2 0 0 1 2 0 1 1 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 118000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  0  1 -1  1  0 -1  1  0  0  0 -1  0] (Indices: [1, 6, 10, 12, 13, 15, 16, 17, 18]), Candidate: [ 3  0  1  0  1  2  0  0  1  2 -1  2  1  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  0  0  0  1  0  0 -1  1  0  0  0 -1] (Indices: [1, 6, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  0  1  0  1  2  0  0  1  1  0  2  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0  0  0  0 -1  0  0  1  0  0 -1  0  0] (Indices: [1, 7, 8, 9, 10, 11, 15, 16, 17]), Candidate: [3 0 1 0 1 1 2 0 1 1 0 0 1 1 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 118150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0  0  0 -1  0  1  0 -1  1 -1  1 -1  0] (Indices: [1, 7, 8, 9, 10, 13, 14, 16, 18]), Candidate: [ 3  0  1  0  1  1  2  0  1  1 -1  1  2  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 118200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0  0 -1  1  0 -1  1 -1  1 -1  1 -1  0] (Indices: [1, 7, 8, 9, 11, 12, 14, 16, 18]), Candidate: [ 3  0  1  0  1  1  2  0  1  0  1  1  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0  0 -1  0  1  0  0  0  0 -1  0  0  0] (Indices: [1, 7, 8, 9, 12, 13, 14, 15, 16]), Candidate: [3 0 1 0 1 1 2 0 1 0 0 2 1 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 118300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0  0 -1  0  0  0  1  0  0  0  0 -1  0] (Indices: [1, 7, 8, 9, 14, 15, 16, 17, 18]), Candidate: [3 0 1 0 1 1 2 0 1 0 0 1 1 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 118350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0 -1  1  0 -1  1  0 -1  0  0  1  0 -1] (Indices: [1, 7, 8, 10, 11, 13, 14, 18, 19]), Candidate: [ 3  0  1  0  1  1  2  0  0  2  0  0  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0 -1  1 -1  1 -1  1  0 -1  1 -1  1 -1] (Indices: [1, 7, 8, 10, 12, 14, 15, 17, 19]), Candidate: [ 3  0  1  0  1  1  2  0  0  2 -1  2  0  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0 -1  0  1  0  0 -1  0  1 -1  1  0 -1] (Indices: [1, 7, 8, 11, 12, 13, 16, 18, 19]), Candidate: [3 0 1 0 1 1 2 0 0 1 1 1 1 0 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 118500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0 -1  0  0  1  0 -1  1  0 -1  1  0 -1] (Indices: [1, 7, 8, 12, 13, 15, 16, 18, 19]), Candidate: [3 0 1 0 1 1 2 0 0 1 0 2 1 0 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 118550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  1  0  0  0 -1  0  0  0  1  0  0 -1] (Indices: [1, 7, 9, 10, 11, 12, 17, 18, 19]), Candidate: [ 3  0  1  0  1  1  2 -1  2  1  0  1  0  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  1  0 -1  1  0 -1  1 -1  1 -1  1 -1] (Indices: [1, 7, 9, 10, 12, 13, 15, 17, 19]), Candidate: [ 3  0  1  0  1  1  2 -1  2  1 -1  2  1  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 118650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  1 -1  1  0  0  0 -1  0  1 -1  1 -1] (Indices: [1, 7, 9, 11, 12, 13, 14, 17, 19]), Candidate: [ 3  0  1  0  1  1  2 -1  2  0  1  1  1  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 118700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  1 -1  0  1  0  0  0  0 -1  0  1 -1] (Indices: [1, 7, 9, 12, 13, 14, 15, 16, 19]), Candidate: [ 3  0  1  0  1  1  2 -1  2  0  0  2  1  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  0  1  0  0 -1  1  0 -1  1 -1  1 -1] (Indices: [1, 7, 10, 11, 12, 14, 15, 17, 19]), Candidate: [ 3  0  1  0  1  1  2 -1  1  2  0  1  0  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  0  1 -1  1 -1  1  0 -1  1  0  0 -1] (Indices: [1, 7, 10, 12, 14, 15, 17, 18, 19]), Candidate: [ 3  0  1  0  1  1  2 -1  1  2 -1  2  0  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 118850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1  0  0  0  0  0  0 -1  0  0  0  1 -1] (Indices: [1, 8, 9, 10, 11, 12, 13, 14, 19]), Candidate: [ 3  0  1  0  1  1  1  1  1  1  0  1  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1  0  0  0 -1  1 -1  0  0  1  0  0 -1] (Indices: [1, 8, 9, 10, 11, 13, 17, 18, 19]), Candidate: [3 0 1 0 1 1 1 1 1 1 0 0 2 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 118950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1  0  0 -1  1 -1  0  0  1  0  0  0 -1] (Indices: [1, 8, 9, 10, 12, 16, 17, 18, 19]), Candidate: [ 3  0  1  0  1  1  1  1  1  1 -1  2  0  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1  0 -1  1  0 -1  1 -1  1 -1  1  0 -1] (Indices: [1, 8, 9, 11, 12, 14, 16, 18, 19]), Candidate: [ 3  0  1  0  1  1  1  1  1  0  1  1  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1  0 -1  0  0  1  0  0  0  0 -1  1 -1] (Indices: [1, 8, 9, 13, 14, 15, 16, 17, 19]), Candidate: [3 0 1 0 1 1 1 1 1 0 0 1 2 1 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 119100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1 -1  1  0 -1  1  0 -1  0  1  0  0 -1] (Indices: [1, 8, 10, 11, 13, 14, 17, 18, 19]), Candidate: [ 3  0  1  0  1  1  1  1  0  2  0  0  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1 -1  0  1  0  0 -1  1  0  0  0 -1  0] (Indices: [1, 8, 11, 12, 13, 15, 16, 17, 18]), Candidate: [3 0 1 0 1 1 1 1 0 1 1 1 1 0 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 119200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  1  0  0  0 -1  1  0 -1  1 -1  1 -1] (Indices: [1, 9, 10, 11, 12, 14, 15, 17, 19]), Candidate: [3 0 1 0 1 1 1 0 2 1 0 1 0 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 119250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  1  0 -1  1 -1  1  0 -1  1  0  0 -1] (Indices: [1, 9, 10, 12, 14, 15, 17, 18, 19]), Candidate: [ 3  0  1  0  1  1  1  0  2  1 -1  2  0  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  0  1  0  0  0  0  0 -1  1 -1  1 -1] (Indices: [1, 10, 11, 12, 13, 14, 15, 17, 19]), Candidate: [3 0 1 0 1 1 1 0 1 2 0 1 1 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 119350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0  0 -1  0  0  0  0  0  0  0  0  1 -1] (Indices: [2, 3, 4, 5, 6, 7, 8, 9, 19]), Candidate: [2 2 1 0 1 1 1 0 1 0 0 1 1 1 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 119400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  1  0 -1  0  0  0  1 -1  0  0  0  0] (Indices: [2, 3, 4, 5, 6, 7, 9, 10, 15]), Candidate: [ 2  2  1  0  1  1  1 -1  2  1 -1  1  1  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 119450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  0  1 -1  1 -1  1 -1  0  0  0  0  0] (Indices: [2, 3, 4, 5, 6, 7, 10, 12, 14]), Candidate: [ 2  2  1  0  1  1  1 -1  1  2 -1  2  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 119500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  0  0  1 -1  0  0  0  1 -1  1 -1  0] (Indices: [2, 3, 4, 5, 6, 7, 11, 16, 18]), Candidate: [ 2  2  1  0  1  1  1 -1  1  1  1  0  1  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  0  0  0  0  0  1 -1  0  0  1  0 -1] (Indices: [2, 3, 4, 5, 6, 7, 14, 18, 19]), Candidate: [ 2  2  1  0  1  1  1 -1  1  1  0  1  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 119600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1  0 -1  0  0  0  0  0  1  0 -1  0  0] (Indices: [2, 3, 4, 5, 6, 8, 9, 16, 17]), Candidate: [2 2 1 0 1 1 0 1 1 0 0 1 1 1 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 119650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1 -1  0  1 -1  1 -1  1 -1  0  0  0  0] (Indices: [2, 3, 4, 5, 6, 8, 11, 13, 15]), Candidate: [2 2 1 0 1 1 0 1 0 1 1 0 2 0 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 119700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1 -1  0  0  0  1 -1  0  1  0 -1  0  0] (Indices: [2, 3, 4, 5, 6, 8, 13, 16, 17]), Candidate: [2 2 1 0 1 1 0 1 0 1 0 1 2 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 119750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  1  0 -1  0  0  1 -1  0  0  1 -1  0] (Indices: [2, 3, 4, 5, 6, 9, 10, 14, 18]), Candidate: [ 2  2  1  0  1  1  0  0  2  1 -1  1  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 119800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  1 -1  0  1 -1  1 -1  0  0  0  1 -1] (Indices: [2, 3, 4, 5, 6, 9, 12, 14, 19]), Candidate: [ 2  2  1  0  1  1  0  0  2  0  0  2  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  0  1  0  0 -1  0  0  0  1 -1  0  0] (Indices: [2, 3, 4, 5, 6, 10, 11, 12, 17]), Candidate: [2 2 1 0 1 1 0 0 1 2 0 1 0 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 119900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  0  1 -1  0  1 -1  1  0 -1  0  0  0] (Indices: [2, 3, 4, 5, 6, 10, 13, 15, 16]), Candidate: [ 2  2  1  0  1  1  0  0  1  2 -1  1  2  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  0  0  1  0 -1  0  0  0  0  1  0 -1] (Indices: [2, 3, 4, 5, 6, 11, 12, 18, 19]), Candidate: [2 2 1 0 1 1 0 0 1 1 1 1 0 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 120000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  0  0  0  1  0 -1  0  0  0  1  0 -1] (Indices: [2, 3, 4, 5, 6, 12, 13, 18, 19]), Candidate: [2 2 1 0 1 1 0 0 1 1 0 2 1 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 120050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  0  0  0  0  0  1 -1  0  1  0  0 -1] (Indices: [2, 3, 4, 5, 6, 14, 17, 18, 19]), Candidate: [ 2  2  1  0  1  1  0  0  1  1  0  1  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0  0 -1  0  0  0  0  0  0  0  1  0 -1] (Indices: [2, 3, 4, 5, 7, 8, 9, 18, 19]), Candidate: [2 2 1 0 1 0 2 0 1 0 0 1 1 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 120150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0 -1  0  1 -1  0  1  0 -1  0  0  0  0] (Indices: [2, 3, 4, 5, 7, 8, 11, 14, 15]), Candidate: [2 2 1 0 1 0 2 0 0 1 1 0 1 2 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 120200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0 -1  0  0  0  1 -1  0  0  0  1  0 -1] (Indices: [2, 3, 4, 5, 7, 8, 13, 18, 19]), Candidate: [2 2 1 0 1 0 2 0 0 1 0 1 2 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 120250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  1  0 -1  0  0  0  1 -1  0  0  1 -1] (Indices: [2, 3, 4, 5, 7, 9, 10, 15, 19]), Candidate: [ 2  2  1  0  1  0  2 -1  2  1 -1  1  1  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 120300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  1 -1  0  1 -1  0  0  1  0 -1  0  0] (Indices: [2, 3, 4, 5, 7, 9, 12, 16, 17]), Candidate: [ 2  2  1  0  1  0  2 -1  2  0  0  2  0  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  0  1  0 -1  1 -1  0  1 -1  0  0  0] (Indices: [2, 3, 4, 5, 7, 10, 11, 13, 16]), Candidate: [ 2  2  1  0  1  0  2 -1  1  2  0  0  2  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  0  1 -1  0  1 -1  0  1 -1  1 -1  0] (Indices: [2, 3, 4, 5, 7, 10, 13, 16, 18]), Candidate: [ 2  2  1  0  1  0  2 -1  1  2 -1  1  2  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 120450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  0  0  1 -1  1  0 -1  0  0  0  1 -1] (Indices: [2, 3, 4, 5, 7, 11, 13, 14, 19]), Candidate: [ 2  2  1  0  1  0  2 -1  1  1  1  0  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 120500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  0  0  0  1 -1  1 -1  1  0 -1  0  0] (Indices: [2, 3, 4, 5, 7, 12, 14, 16, 17]), Candidate: [ 2  2  1  0  1  0  2 -1  1  1  0  2  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 120550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  0  0  0  0  0  0  0  1  0  0  0 -1] (Indices: [2, 3, 4, 5, 7, 16, 17, 18, 19]), Candidate: [ 2  2  1  0  1  0  2 -1  1  1  0  1  1  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1  0 -1  1 -1  0  1  0 -1  0  0  0  0] (Indices: [2, 3, 4, 5, 8, 9, 11, 14, 15]), Candidate: [2 2 1 0 1 0 1 1 1 0 1 0 1 2 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 120650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1  0 -1  0  0  1 -1  0  0  0  1  0 -1] (Indices: [2, 3, 4, 5, 8, 9, 13, 18, 19]), Candidate: [2 2 1 0 1 0 1 1 1 0 0 1 2 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 120700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1 -1  1 -1  1  0 -1  1 -1  0  0  0  0] (Indices: [2, 3, 4, 5, 8, 10, 12, 13, 15]), Candidate: [ 2  2  1  0  1  0  1  1  0  2 -1  2  1  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1 -1  1 -1  0  0  0  1 -1  0  1  0 -1] (Indices: [2, 3, 4, 5, 8, 10, 15, 18, 19]), Candidate: [ 2  2  1  0  1  0  1  1  0  2 -1  1  1  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1 -1  0  1 -1  0  1 -1  0  0  1  0 -1] (Indices: [2, 3, 4, 5, 8, 11, 14, 18, 19]), Candidate: [ 2  2  1  0  1  0  1  1  0  1  1  0  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1 -1  0  0  0  1  0 -1  1  0 -1  0  0] (Indices: [2, 3, 4, 5, 8, 13, 14, 16, 17]), Candidate: [ 2  2  1  0  1  0  1  1  0  1  0  1  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  1  0  0 -1  0  0  1 -1  1 -1  0  0] (Indices: [2, 3, 4, 5, 9, 10, 11, 15, 17]), Candidate: [2 2 1 0 1 0 1 0 2 1 0 0 1 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 120950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  1  0 -1  0  0  1 -1  1 -1  1 -1  0] (Indices: [2, 3, 4, 5, 9, 10, 14, 16, 18]), Candidate: [ 2  2  1  0  1  0  1  0  2  1 -1  1  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 121000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  1 -1  1 -1  1 -1  0  0  0  1  0 -1] (Indices: [2, 3, 4, 5, 9, 11, 13, 18, 19]), Candidate: [2 2 1 0 1 0 1 0 2 0 1 0 2 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 121050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  1 -1  0  1 -1  0  1 -1  1 -1  1 -1] (Indices: [2, 3, 4, 5, 9, 12, 15, 17, 19]), Candidate: [2 2 1 0 1 0 1 0 2 0 0 2 0 1 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 121100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  0  1  0  0 -1  1 -1  0  0  1 -1  0] (Indices: [2, 3, 4, 5, 10, 11, 12, 14, 18]), Candidate: [ 2  2  1  0  1  0  1  0  1  2  0  1  0  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  0  1 -1  1  0  0 -1  0  0  1 -1  0] (Indices: [2, 3, 4, 5, 10, 12, 13, 14, 18]), Candidate: [ 2  2  1  0  1  0  1  0  1  2 -1  2  1  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 121200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  0  1 -1  0  1 -1  0  1 -1  1  0 -1] (Indices: [2, 3, 4, 5, 10, 13, 16, 18, 19]), Candidate: [ 2  2  1  0  1  0  1  0  1  2 -1  1  2  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  0  0  1  0 -1  0  0  1 -1  1  0 -1] (Indices: [2, 3, 4, 5, 11, 12, 16, 18, 19]), Candidate: [2 2 1 0 1 0 1 0 1 1 1 1 0 1 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 121300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  0  0  0  1  0 -1  1 -1  1  0 -1  0] (Indices: [2, 3, 4, 5, 12, 13, 15, 17, 18]), Candidate: [2 2 1 0 1 0 1 0 1 1 0 2 1 0 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 121350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0  0  0 -1  0  0  0  0  0  0  1 -1  0] (Indices: [2, 3, 4, 6, 7, 8, 9, 10, 18]), Candidate: [ 2  2  1  0  0  2  1  0  1  1 -1  1  1  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0 -1  1 -1  1 -1  0  0  0  1 -1  0  0] (Indices: [2, 3, 4, 6, 7, 8, 10, 12, 17]), Candidate: [ 2  2  1  0  0  2  1  0  0  2 -1  2  0  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0 -1  0  1 -1  0  0  0  0  1 -1  1 -1] (Indices: [2, 3, 4, 6, 7, 8, 11, 17, 19]), Candidate: [2 2 1 0 0 2 1 0 0 1 1 0 1 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 121500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0 -1  0  0  0  0  0  1  0 -1  0  1 -1] (Indices: [2, 3, 4, 6, 7, 8, 15, 16, 19]), Candidate: [2 2 1 0 0 2 1 0 0 1 0 1 1 1 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 121550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  1 -1  1  0 -1  0  0  0  0  0  1 -1] (Indices: [2, 3, 4, 6, 7, 9, 11, 12, 19]), Candidate: [ 2  2  1  0  0  2  1 -1  2  0  1  1  0  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  1 -1  0  0  1 -1  1 -1  0  1 -1  0] (Indices: [2, 3, 4, 6, 7, 9, 13, 15, 18]), Candidate: [ 2  2  1  0  0  2  1 -1  2  0  0  1  2  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  0  1  0 -1  0  0  0  1  0 -1  0  0] (Indices: [2, 3, 4, 6, 7, 10, 11, 16, 17]), Candidate: [ 2  2  1  0  0  2  1 -1  1  2  0  0  1  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  0  1 -1  0  0  1 -1  0  1 -1  1 -1] (Indices: [2, 3, 4, 6, 7, 10, 14, 17, 19]), Candidate: [ 2  2  1  0  0  2  1 -1  1  2 -1  1  1  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 121750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  0  0  1 -1  0  1  0 -1  0  1 -1  0] (Indices: [2, 3, 4, 6, 7, 11, 14, 15, 18]), Candidate: [ 2  2  1  0  0  2  1 -1  1  1  1  0  1  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  0  0  0  1 -1  0  0  1  0 -1  1 -1] (Indices: [2, 3, 4, 6, 7, 12, 16, 17, 19]), Candidate: [ 2  2  1  0  0  2  1 -1  1  1  0  2  0  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1  0  0 -1  1 -1  0  0  0  1 -1  0  0] (Indices: [2, 3, 4, 6, 8, 9, 10, 12, 17]), Candidate: [ 2  2  1  0  0  2  0  1  1  1 -1  2  0  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1  0 -1  1 -1  0  0  0  0  1 -1  1 -1] (Indices: [2, 3, 4, 6, 8, 9, 11, 17, 19]), Candidate: [2 2 1 0 0 2 0 1 1 0 1 0 1 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 121950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1  0 -1  0  0  0  0  1  0 -1  0  1 -1] (Indices: [2, 3, 4, 6, 8, 9, 15, 16, 19]), Candidate: [2 2 1 0 0 2 0 1 1 0 0 1 1 1 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 122000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1 -1  1 -1  1 -1  0  1 -1  0  0  1 -1] (Indices: [2, 3, 4, 6, 8, 10, 12, 15, 19]), Candidate: [ 2  2  1  0  0  2  0  1  0  2 -1  2  0  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1 -1  0  1  0 -1  1 -1  0  1 -1  0  0] (Indices: [2, 3, 4, 6, 8, 11, 12, 14, 17]), Candidate: [ 2  2  1  0  0  2  0  1  0  1  1  1  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1 -1  0  0  1  0  0 -1  0  1 -1  0  0] (Indices: [2, 3, 4, 6, 8, 12, 13, 14, 17]), Candidate: [ 2  2  1  0  0  2  0  1  0  1  0  2  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1 -1  0  0  0  1 -1  0  1  0 -1  1 -1] (Indices: [2, 3, 4, 6, 8, 13, 16, 17, 19]), Candidate: [2 2 1 0 0 2 0 1 0 1 0 1 2 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 122200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  1  0 -1  1  0 -1  0  0  0  1 -1  0] (Indices: [2, 3, 4, 6, 9, 10, 12, 13, 18]), Candidate: [ 2  2  1  0  0  2  0  0  2  1 -1  2  1  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  1  0 -1  0  0  0  0  1 -1  1  0 -1] (Indices: [2, 3, 4, 6, 9, 10, 16, 18, 19]), Candidate: [ 2  2  1  0  0  2  0  0  2  1 -1  1  1  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  1 -1  1 -1  0  0  1  0 -1  0  1 -1] (Indices: [2, 3, 4, 6, 9, 11, 15, 16, 19]), Candidate: [2 2 1 0 0 2 0 0 2 0 1 0 1 1 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 122350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  1 -1  0  0  1  0 -1  0  1  0 -1  0] (Indices: [2, 3, 4, 6, 9, 13, 14, 17, 18]), Candidate: [ 2  2  1  0  0  2  0  0  2  0  0  1  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  0  1  0 -1  1  0 -1  1 -1  0  0  0] (Indices: [2, 3, 4, 6, 10, 11, 13, 14, 16]), Candidate: [ 2  2  1  0  0  2  0  0  1  2  0  0  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  0  1 -1  1 -1  1  0 -1  1 -1  0  0] (Indices: [2, 3, 4, 6, 10, 12, 14, 15, 17]), Candidate: [ 2  2  1  0  0  2  0  0  1  2 -1  2  0  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  0  1 -1  0  0  0  1  0  0 -1  1 -1] (Indices: [2, 3, 4, 6, 10, 15, 16, 17, 19]), Candidate: [ 2  2  1  0  0  2  0  0  1  2 -1  1  1  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  0  0  1 -1  1 -1  1  0 -1  1 -1  0] (Indices: [2, 3, 4, 6, 11, 13, 15, 16, 18]), Candidate: [2 2 1 0 0 2 0 0 1 1 1 0 2 0 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 122600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  0  0  0  1 -1  1 -1  1  0  0 -1  0] (Indices: [2, 3, 4, 6, 12, 14, 16, 17, 18]), Candidate: [ 2  2  1  0  0  2  0  0  1  1  0  2  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0  0  0 -1  0  1 -1  0  0  0  0  1 -1] (Indices: [2, 3, 4, 7, 8, 9, 10, 13, 19]), Candidate: [ 2  2  1  0  0  1  2  0  1  1 -1  1  2  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0  0 -1  0  1 -1  1  0 -1  0  0  0  0] (Indices: [2, 3, 4, 7, 8, 9, 12, 14, 15]), Candidate: [2 2 1 0 0 1 2 0 1 0 0 2 0 2 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 122750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0 -1  1  0  0  0 -1  0  0  0  0  0  0] (Indices: [2, 3, 4, 7, 8, 10, 11, 12, 13]), Candidate: [2 2 1 0 0 1 2 0 0 2 0 1 1 0 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 122800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0 -1  1 -1  0  1  0 -1  1 -1  0  0  0] (Indices: [2, 3, 4, 7, 8, 10, 13, 14, 16]), Candidate: [ 2  2  1  0  0  1  2  0  0  2 -1  1  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 122850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0 -1  0  1  0 -1  0  0  1 -1  1 -1  0] (Indices: [2, 3, 4, 7, 8, 11, 12, 16, 18]), Candidate: [2 2 1 0 0 1 2 0 0 1 1 1 0 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 122900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0 -1  0  0  1  0 -1  0  1 -1  1 -1  0] (Indices: [2, 3, 4, 7, 8, 12, 13, 16, 18]), Candidate: [2 2 1 0 0 1 2 0 0 1 0 2 1 0 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 122950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0 -1  0  0  0  0  1  0 -1  0  1  0 -1] (Indices: [2, 3, 4, 7, 8, 14, 15, 18, 19]), Candidate: [2 2 1 0 0 1 2 0 0 1 0 1 1 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 123000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  1  0 -1  1 -1  0  1 -1  1 -1  0  0] (Indices: [2, 3, 4, 7, 9, 10, 12, 15, 17]), Candidate: [ 2  2  1  0  0  1  2 -1  2  1 -1  2  0  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 123050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  1 -1  1  0 -1  1  0 -1  0  0  0  0] (Indices: [2, 3, 4, 7, 9, 11, 12, 14, 15]), Candidate: [ 2  2  1  0  0  1  2 -1  2  0  1  1  0  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  1 -1  0  1  0  0  0 -1  0  0  0  0] (Indices: [2, 3, 4, 7, 9, 12, 13, 14, 15]), Candidate: [ 2  2  1  0  0  1  2 -1  2  0  0  2  1  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  1 -1  0  0  1 -1  1 -1  0  1  0 -1] (Indices: [2, 3, 4, 7, 9, 13, 15, 18, 19]), Candidate: [ 2  2  1  0  0  1  2 -1  2  0  0  1  2  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  0  1  0 -1  1 -1  0  1  0 -1  0  0] (Indices: [2, 3, 4, 7, 10, 11, 13, 16, 17]), Candidate: [ 2  2  1  0  0  1  2 -1  1  2  0  0  2  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  0  1 -1  1 -1  1 -1  0  0  1  0 -1] (Indices: [2, 3, 4, 7, 10, 12, 14, 18, 19]), Candidate: [ 2  2  1  0  0  1  2 -1  1  2 -1  2  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 123300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  0  0  1  0  0  0 -1  0  0  0  1 -1] (Indices: [2, 3, 4, 7, 11, 12, 13, 14, 19]), Candidate: [ 2  2  1  0  0  1  2 -1  1  1  1  1  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 123350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  0  0  1 -1  1 -1  0  0  1  0  0 -1] (Indices: [2, 3, 4, 7, 11, 13, 17, 18, 19]), Candidate: [ 2  2  1  0  0  1  2 -1  1  1  1  0  2  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  0  0  0  1 -1  0  0  1  0  0  0 -1] (Indices: [2, 3, 4, 7, 12, 16, 17, 18, 19]), Candidate: [ 2  2  1  0  0  1  2 -1  1  1  0  2  0  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1  0  0 -1  1  0  0 -1  0  0  0  0  0] (Indices: [2, 3, 4, 8, 9, 10, 12, 13, 14]), Candidate: [ 2  2  1  0  0  1  1  1  1  1 -1  2  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 123500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1  0  0 -1  0  0  0  1 -1  1 -1  1 -1] (Indices: [2, 3, 4, 8, 9, 10, 15, 17, 19]), Candidate: [ 2  2  1  0  0  1  1  1  1  1 -1  1  1  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1  0 -1  1 -1  0  1 -1  0  1 -1  1 -1] (Indices: [2, 3, 4, 8, 9, 11, 14, 17, 19]), Candidate: [ 2  2  1  0  0  1  1  1  1  0  1  0  1  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1  0 -1  0  0  1  0  0 -1  0  0  1 -1] (Indices: [2, 3, 4, 8, 9, 13, 14, 15, 19]), Candidate: [2 2 1 0 0 1 1 1 1 0 0 1 2 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 123650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1 -1  1  0  0 -1  0  0  0  1  0 -1  0] (Indices: [2, 3, 4, 8, 10, 11, 12, 17, 18]), Candidate: [2 2 1 0 0 1 1 1 0 2 0 1 0 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 123700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1 -1  1 -1  1  0 -1  0  0  1  0 -1  0] (Indices: [2, 3, 4, 8, 10, 12, 13, 17, 18]), Candidate: [ 2  2  1  0  0  1  1  1  0  2 -1  2  1  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1 -1  1 -1  0  0  1 -1  1  0 -1  1 -1] (Indices: [2, 3, 4, 8, 10, 14, 16, 17, 19]), Candidate: [ 2  2  1  0  0  1  1  1  0  2 -1  1  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 123800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1 -1  0  1 -1  1  0 -1  0  1  0 -1  0] (Indices: [2, 3, 4, 8, 11, 13, 14, 17, 18]), Candidate: [ 2  2  1  0  0  1  1  1  0  1  1  0  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1 -1  0  0  1 -1  1  0  0 -1  0  1 -1] (Indices: [2, 3, 4, 8, 12, 14, 15, 16, 19]), Candidate: [2 2 1 0 0 1 1 1 0 1 0 2 0 2 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 123900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  1  0  0  0 -1  0  0  1 -1  1 -1  0] (Indices: [2, 3, 4, 9, 10, 11, 12, 16, 18]), Candidate: [2 2 1 0 0 1 1 0 2 1 0 1 0 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 123950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  1  0 -1  1  0 -1  0  1 -1  1 -1  0] (Indices: [2, 3, 4, 9, 10, 12, 13, 16, 18]), Candidate: [ 2  2  1  0  0  1  1  0  2  1 -1  2  1  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 124000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  1  0 -1  0  0  1  0 -1  0  1  0 -1] (Indices: [2, 3, 4, 9, 10, 14, 15, 18, 19]), Candidate: [ 2  2  1  0  0  1  1  0  2  1 -1  1  1  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 124050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  1 -1  1 -1  1  0 -1  1 -1  1 -1  0] (Indices: [2, 3, 4, 9, 11, 13, 14, 16, 18]), Candidate: [ 2  2  1  0  0  1  1  0  2  0  1  0  2  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 124100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  1 -1  0  1 -1  1  0  0  0 -1  0  0] (Indices: [2, 3, 4, 9, 12, 14, 15, 16, 17]), Candidate: [2 2 1 0 0 1 1 0 2 0 0 2 0 2 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 124150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  0  1  0  0  0 -1  0  0  0  1  0 -1] (Indices: [2, 3, 4, 10, 11, 12, 13, 18, 19]), Candidate: [2 2 1 0 0 1 1 0 1 2 0 1 1 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 124200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  0  1  0 -1  0  1 -1  0  1  0  0 -1] (Indices: [2, 3, 4, 10, 11, 14, 17, 18, 19]), Candidate: [ 2  2  1  0  0  1  1  0  1  2  0  0  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 124250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  0  1 -1  0  1  0 -1  0  1  0  0 -1] (Indices: [2, 3, 4, 10, 13, 14, 17, 18, 19]), Candidate: [ 2  2  1  0  0  1  1  0  1  2 -1  1  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  0  0  1 -1  1  0  0 -1  1  0 -1  0] (Indices: [2, 3, 4, 11, 13, 14, 15, 17, 18]), Candidate: [2 2 1 0 0 1 1 0 1 1 1 0 2 1 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 124350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0  0  0 -1  0  0  0  1 -1  0  0  0  0] (Indices: [2, 3, 5, 6, 7, 8, 9, 10, 15]), Candidate: [ 2  2  1 -1  2  1  1  0  1  1 -1  1  1  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0 -1  1 -1  1 -1  1 -1  0  0  0  0  0] (Indices: [2, 3, 5, 6, 7, 8, 10, 12, 14]), Candidate: [ 2  2  1 -1  2  1  1  0  0  2 -1  2  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 124450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0 -1  0  1 -1  0  0  0  1 -1  1 -1  0] (Indices: [2, 3, 5, 6, 7, 8, 11, 16, 18]), Candidate: [ 2  2  1 -1  2  1  1  0  0  1  1  0  1  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 124500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0 -1  0  0  0  0  1 -1  0  0  1  0 -1] (Indices: [2, 3, 5, 6, 7, 8, 14, 18, 19]), Candidate: [ 2  2  1 -1  2  1  1  0  0  1  0  1  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  1 -1  1  0 -1  0  0  1 -1  0  0  0] (Indices: [2, 3, 5, 6, 7, 9, 11, 12, 16]), Candidate: [ 2  2  1 -1  2  1  1 -1  2  0  1  1  0  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  1 -1  0  0  1  0 -1  0  0  0  1 -1] (Indices: [2, 3, 5, 6, 7, 9, 13, 14, 19]), Candidate: [ 2  2  1 -1  2  1  1 -1  2  0  0  1  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 124650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  0  1  0 -1  0  0  1 -1  1 -1  0  0] (Indices: [2, 3, 5, 6, 7, 10, 11, 15, 17]), Candidate: [ 2  2  1 -1  2  1  1 -1  1  2  0  0  1  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  0  1 -1  0  0  1 -1  1 -1  1 -1  0] (Indices: [2, 3, 5, 6, 7, 10, 14, 16, 18]), Candidate: [ 2  2  1 -1  2  1  1 -1  1  2 -1  1  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 124750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  0  0  1 -1  1 -1  0  0  0  1  0 -1] (Indices: [2, 3, 5, 6, 7, 11, 13, 18, 19]), Candidate: [ 2  2  1 -1  2  1  1 -1  1  1  1  0  2  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  0  0  0  1 -1  0  1 -1  1 -1  1 -1] (Indices: [2, 3, 5, 6, 7, 12, 15, 17, 19]), Candidate: [ 2  2  1 -1  2  1  1 -1  1  1  0  2  0  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1  0  0 -1  1 -1  1 -1  0  0  0  0  0] (Indices: [2, 3, 5, 6, 8, 9, 10, 12, 14]), Candidate: [ 2  2  1 -1  2  1  0  1  1  1 -1  2  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 124900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1  0 -1  1 -1  0  0  0  1 -1  1 -1  0] (Indices: [2, 3, 5, 6, 8, 9, 11, 16, 18]), Candidate: [ 2  2  1 -1  2  1  0  1  1  0  1  0  1  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 124950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1  0 -1  0  0  0  1 -1  0  0  1  0 -1] (Indices: [2, 3, 5, 6, 8, 9, 14, 18, 19]), Candidate: [ 2  2  1 -1  2  1  0  1  1  0  0  1  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1 -1  1 -1  1 -1  0  1  0 -1  0  0  0] (Indices: [2, 3, 5, 6, 8, 10, 12, 15, 16]), Candidate: [ 2  2  1 -1  2  1  0  1  0  2 -1  2  0  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1 -1  0  1  0  0 -1  0  0  0  0  1 -1] (Indices: [2, 3, 5, 6, 8, 11, 12, 13, 19]), Candidate: [ 2  2  1 -1  2  1  0  1  0  1  1  1  1  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 125100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1 -1  0  1 -1  0  0  0  0  1  0  0 -1] (Indices: [2, 3, 5, 6, 8, 11, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  1  0  1  0  1  1  0  1  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 125150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1 -1  0  0  0  1 -1  1 -1  1 -1  1 -1] (Indices: [2, 3, 5, 6, 8, 13, 15, 17, 19]), Candidate: [ 2  2  1 -1  2  1  0  1  0  1  0  1  2  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 125200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  1  0 -1  1  0 -1  1 -1  0  0  0  0] (Indices: [2, 3, 5, 6, 9, 10, 12, 13, 15]), Candidate: [ 2  2  1 -1  2  1  0  0  2  1 -1  2  1  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  1  0 -1  0  0  0  1 -1  0  1  0 -1] (Indices: [2, 3, 5, 6, 9, 10, 15, 18, 19]), Candidate: [ 2  2  1 -1  2  1  0  0  2  1 -1  1  1  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  1 -1  1 -1  0  1 -1  0  0  1  0 -1] (Indices: [2, 3, 5, 6, 9, 11, 14, 18, 19]), Candidate: [ 2  2  1 -1  2  1  0  0  2  0  1  0  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  1 -1  0  0  1  0 -1  1  0 -1  0  0] (Indices: [2, 3, 5, 6, 9, 13, 14, 16, 17]), Candidate: [ 2  2  1 -1  2  1  0  0  2  0  0  1  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  0  1  0  0 -1  0  0  0  1 -1  1 -1] (Indices: [2, 3, 5, 6, 10, 11, 12, 17, 19]), Candidate: [ 2  2  1 -1  2  1  0  0  1  2  0  1  0  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 125450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  0  1 -1  1  0 -1  0  0  1 -1  1 -1] (Indices: [2, 3, 5, 6, 10, 12, 13, 17, 19]), Candidate: [ 2  2  1 -1  2  1  0  0  1  2 -1  2  1  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  0  1 -1  0  0  1 -1  1 -1  1  0 -1] (Indices: [2, 3, 5, 6, 10, 14, 16, 18, 19]), Candidate: [ 2  2  1 -1  2  1  0  0  1  2 -1  1  1  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 125550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  0  0  1 -1  1  0 -1  0  1 -1  1 -1] (Indices: [2, 3, 5, 6, 11, 13, 14, 17, 19]), Candidate: [ 2  2  1 -1  2  1  0  0  1  1  1  0  2  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  0  0  0  1 -1  1  0 -1  1  0 -1  0] (Indices: [2, 3, 5, 6, 12, 14, 15, 17, 18]), Candidate: [ 2  2  1 -1  2  1  0  0  1  1  0  2  0  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 125650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0  0  0 -1  0  1 -1  0  1 -1  0  0  0] (Indices: [2, 3, 5, 7, 8, 9, 10, 13, 16]), Candidate: [ 2  2  1 -1  2  0  2  0  1  1 -1  1  2  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0  0 -1  0  1  0 -1  0  0  1 -1  0  0] (Indices: [2, 3, 5, 7, 8, 9, 12, 13, 17]), Candidate: [ 2  2  1 -1  2  0  2  0  1  0  0  2  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 125750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0  0 -1  0  0  0  0  0  1  0 -1  1 -1] (Indices: [2, 3, 5, 7, 8, 9, 16, 17, 19]), Candidate: [ 2  2  1 -1  2  0  2  0  1  0  0  1  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 125800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0 -1  1 -1  1 -1  0  0  0  1 -1  1 -1] (Indices: [2, 3, 5, 7, 8, 10, 12, 17, 19]), Candidate: [ 2  2  1 -1  2  0  2  0  0  2 -1  2  0  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0 -1  0  1  0 -1  0  1 -1  0  1 -1  0] (Indices: [2, 3, 5, 7, 8, 11, 12, 15, 18]), Candidate: [ 2  2  1 -1  2  0  2  0  0  1  1  1  0  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 125900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0 -1  0  0  1  0 -1  1 -1  0  1 -1  0] (Indices: [2, 3, 5, 7, 8, 12, 13, 15, 18]), Candidate: [ 2  2  1 -1  2  0  2  0  0  1  0  2  1  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 125950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0 -1  0  0  0  0  1  0  0 -1  0  1 -1] (Indices: [2, 3, 5, 7, 8, 14, 15, 16, 19]), Candidate: [ 2  2  1 -1  2  0  2  0  0  1  0  1  1  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 126000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  1  0 -1  1 -1  1 -1  0  0  1 -1  0] (Indices: [2, 3, 5, 7, 9, 10, 12, 14, 18]), Candidate: [ 2  2  1 -1  2  0  2 -1  2  1 -1  2  0  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 126050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  1 -1  1  0  0 -1  0  0  1 -1  0  0] (Indices: [2, 3, 5, 7, 9, 11, 12, 13, 17]), Candidate: [ 2  2  1 -1  2  0  2 -1  2  0  1  1  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 126100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  1 -1  1 -1  0  0  0  1  0 -1  1 -1] (Indices: [2, 3, 5, 7, 9, 11, 16, 17, 19]), Candidate: [ 2  2  1 -1  2  0  2 -1  2  0  1  0  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 126150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  1 -1  0  0  1 -1  1  0 -1  0  1 -1] (Indices: [2, 3, 5, 7, 9, 13, 15, 16, 19]), Candidate: [ 2  2  1 -1  2  0  2 -1  2  0  0  1  2  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 126200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  0  1  0 -1  1 -1  1 -1  1 -1  0  0] (Indices: [2, 3, 5, 7, 10, 11, 13, 15, 17]), Candidate: [ 2  2  1 -1  2  0  2 -1  1  2  0  0  2  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 126250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  0  1 -1  1 -1  1 -1  1 -1  0  1 -1] (Indices: [2, 3, 5, 7, 10, 12, 14, 16, 19]), Candidate: [ 2  2  1 -1  2  0  2 -1  1  2 -1  2  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 126300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  0  0  1  0  0  0 -1  1 -1  0  0  0] (Indices: [2, 3, 5, 7, 11, 12, 13, 14, 16]), Candidate: [ 2  2  1 -1  2  0  2 -1  1  1  1  1  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 126350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  0  0  1 -1  1 -1  0  1  0  0 -1  0] (Indices: [2, 3, 5, 7, 11, 13, 16, 17, 18]), Candidate: [ 2  2  1 -1  2  0  2 -1  1  1  1  0  2  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 126400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  0  0  0  1 -1  0  1  0  0 -1  1 -1] (Indices: [2, 3, 5, 7, 12, 15, 16, 17, 19]), Candidate: [ 2  2  1 -1  2  0  2 -1  1  1  0  2  0  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 126450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1  0  0  0 -1  0  0  0  0  1  0 -1  0] (Indices: [2, 3, 5, 8, 9, 10, 11, 17, 18]), Candidate: [ 2  2  1 -1  2  0  1  1  1  1  0  0  1  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 126500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1  0  0 -1  0  0  0  1  0 -1  1 -1  0] (Indices: [2, 3, 5, 8, 9, 10, 15, 16, 18]), Candidate: [ 2  2  1 -1  2  0  1  1  1  1 -1  1  1  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 126550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1  0 -1  1 -1  0  1 -1  1 -1  1 -1  0] (Indices: [2, 3, 5, 8, 9, 11, 14, 16, 18]), Candidate: [ 2  2  1 -1  2  0  1  1  1  0  1  0  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 126600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1  0 -1  0  0  1  0  0  0 -1  0  0  0] (Indices: [2, 3, 5, 8, 9, 13, 14, 15, 16]), Candidate: [ 2  2  1 -1  2  0  1  1  1  0  0  1  2  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 126650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1 -1  1  0  0 -1  0  0  1  0 -1  0  0] (Indices: [2, 3, 5, 8, 10, 11, 12, 16, 17]), Candidate: [ 2  2  1 -1  2  0  1  1  0  2  0  1  0  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 126700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1 -1  1 -1  1  0 -1  0  1  0 -1  0  0] (Indices: [2, 3, 5, 8, 10, 12, 13, 16, 17]), Candidate: [ 2  2  1 -1  2  0  1  1  0  2 -1  2  1  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 126750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1 -1  1 -1  0  0  1  0 -1  1 -1  1 -1] (Indices: [2, 3, 5, 8, 10, 14, 15, 17, 19]), Candidate: [ 2  2  1 -1  2  0  1  1  0  2 -1  1  1  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 126800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1 -1  0  1 -1  1  0 -1  1  0 -1  0  0] (Indices: [2, 3, 5, 8, 11, 13, 14, 16, 17]), Candidate: [ 2  2  1 -1  2  0  1  1  0  1  1  0  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 126850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1 -1  0  0  1  0 -1  0  0  1  0  0 -1] (Indices: [2, 3, 5, 8, 12, 13, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  0  1  1  0  1  0  2  1  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 126900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  1  0  0  0 -1  0  1 -1  0  1 -1  0] (Indices: [2, 3, 5, 9, 10, 11, 12, 15, 18]), Candidate: [ 2  2  1 -1  2  0  1  0  2  1  0  1  0  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 126950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  1  0 -1  1  0 -1  1 -1  0  1 -1  0] (Indices: [2, 3, 5, 9, 10, 12, 13, 15, 18]), Candidate: [ 2  2  1 -1  2  0  1  0  2  1 -1  2  1  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 127000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  1  0 -1  0  0  1  0  0 -1  0  1 -1] (Indices: [2, 3, 5, 9, 10, 14, 15, 16, 19]), Candidate: [ 2  2  1 -1  2  0  1  0  2  1 -1  1  1  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 127050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  1 -1  1 -1  1  0  0 -1  0  1 -1  0] (Indices: [2, 3, 5, 9, 11, 13, 14, 15, 18]), Candidate: [ 2  2  1 -1  2  0  1  0  2  0  1  0  2  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 127100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  1 -1  0  1  0 -1  0  1  0 -1  1 -1] (Indices: [2, 3, 5, 9, 12, 13, 16, 17, 19]), Candidate: [ 2  2  1 -1  2  0  1  0  2  0  0  2  1  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 127150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  0  1  0  0  0 -1  0  1 -1  0  1 -1] (Indices: [2, 3, 5, 10, 11, 12, 13, 16, 19]), Candidate: [ 2  2  1 -1  2  0  1  0  1  2  0  1  1  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 127200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  0  1  0 -1  0  1 -1  1  0  0 -1  0] (Indices: [2, 3, 5, 10, 11, 14, 16, 17, 18]), Candidate: [ 2  2  1 -1  2  0  1  0  1  2  0  0  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 127250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  0  1 -1  0  1  0 -1  1  0  0 -1  0] (Indices: [2, 3, 5, 10, 13, 14, 16, 17, 18]), Candidate: [ 2  2  1 -1  2  0  1  0  1  2 -1  1  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 127300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  0  0  1 -1  1  0  0  0  0 -1  0  0] (Indices: [2, 3, 5, 11, 13, 14, 15, 16, 17]), Candidate: [ 2  2  1 -1  2  0  1  0  1  1  1  0  2  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 127350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0  0  0  0 -1  1 -1  0  0  0  0  0  0] (Indices: [2, 3, 6, 7, 8, 9, 10, 11, 13]), Candidate: [ 2  2  1 -1  1  2  1  0  1  1  0  0  2  0  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 127400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0  0 -1  1 -1  0  1 -1  0  1 -1  0  0] (Indices: [2, 3, 6, 7, 8, 9, 11, 14, 17]), Candidate: [ 2  2  1 -1  1  2  1  0  1  0  1  0  1  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 127450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0  0 -1  0  0  0  1  0 -1  1 -1  0  0] (Indices: [2, 3, 6, 7, 8, 9, 14, 15, 17]), Candidate: [ 2  2  1 -1  1  2  1  0  1  0  0  1  1  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 127500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0 -1  1 -1  1  0 -1  0  0  1 -1  0  0] (Indices: [2, 3, 6, 7, 8, 10, 12, 13, 17]), Candidate: [ 2  2  1 -1  1  2  1  0  0  2 -1  2  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 127550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0 -1  1 -1  0  0  0  0  1  0 -1  1 -1] (Indices: [2, 3, 6, 7, 8, 10, 16, 17, 19]), Candidate: [ 2  2  1 -1  1  2  1  0  0  2 -1  1  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 127600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0 -1  0  1 -1  0  0  1  0 -1  1 -1  0] (Indices: [2, 3, 6, 7, 8, 11, 15, 16, 18]), Candidate: [ 2  2  1 -1  1  2  1  0  0  1  1  0  1  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 127650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0 -1  0  0  0  1  0 -1  1 -1  0  1 -1] (Indices: [2, 3, 6, 7, 8, 13, 14, 16, 19]), Candidate: [ 2  2  1 -1  1  2  1  0  0  1  0  1  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 127700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  1  0  0 -1  0  0  1 -1  0  0  1 -1] (Indices: [2, 3, 6, 7, 9, 10, 11, 15, 19]), Candidate: [ 2  2  1 -1  1  2  1 -1  2  1  0  0  1  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 127750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  1  0 -1  0  0  1 -1  0  1  0 -1  0] (Indices: [2, 3, 6, 7, 9, 10, 14, 17, 18]), Candidate: [ 2  2  1 -1  1  2  1 -1  2  1 -1  1  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 127800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  1 -1  1 -1  0  1  0 -1  1 -1  0  0] (Indices: [2, 3, 6, 7, 9, 11, 14, 15, 17]), Candidate: [ 2  2  1 -1  1  2  1 -1  2  0  1  0  1  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 127850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  1 -1  0  1 -1  0  0  1  0  0 -1  0] (Indices: [2, 3, 6, 7, 9, 12, 16, 17, 18]), Candidate: [ 2  2  1 -1  1  2  1 -1  2  0  0  2  0  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 127900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  0  1  0  0 -1  0  1  0 -1  0  0  0] (Indices: [2, 3, 6, 7, 10, 11, 12, 15, 16]), Candidate: [ 2  2  1 -1  1  2  1 -1  1  2  0  1  0  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 127950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  0  1 -1  1  0 -1  1  0 -1  0  0  0] (Indices: [2, 3, 6, 7, 10, 12, 13, 15, 16]), Candidate: [ 2  2  1 -1  1  2  1 -1  1  2 -1  2  1  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 128000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  0  1 -1  0  0  1  0  0  0 -1  0  0] (Indices: [2, 3, 6, 7, 10, 14, 15, 16, 17]), Candidate: [ 2  2  1 -1  1  2  1 -1  1  2 -1  1  1  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 128050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  0  0  1 -1  1  0  0  0 -1  0  0  0] (Indices: [2, 3, 6, 7, 11, 13, 14, 15, 16]), Candidate: [ 2  2  1 -1  1  2  1 -1  1  1  1  0  2  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 128100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  0  0  0  1  0 -1  1 -1  0  1  0 -1] (Indices: [2, 3, 6, 7, 12, 13, 15, 18, 19]), Candidate: [ 2  2  1 -1  1  2  1 -1  1  1  0  2  1  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 128150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1  0  0  0 -1  1 -1  0  1 -1  0  0  0] (Indices: [2, 3, 6, 8, 9, 10, 11, 13, 16]), Candidate: [ 2  2  1 -1  1  2  0  1  1  1  0  0  2  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 128200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1  0  0 -1  0  1 -1  0  1 -1  1 -1  0] (Indices: [2, 3, 6, 8, 9, 10, 13, 16, 18]), Candidate: [ 2  2  1 -1  1  2  0  1  1  1 -1  1  2  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 128250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1  0 -1  1 -1  1  0 -1  0  0  0  1 -1] (Indices: [2, 3, 6, 8, 9, 11, 13, 14, 19]), Candidate: [ 2  2  1 -1  1  2  0  1  1  0  1  0  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 128300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1  0 -1  0  1 -1  1 -1  1  0 -1  0  0] (Indices: [2, 3, 6, 8, 9, 12, 14, 16, 17]), Candidate: [ 2  2  1 -1  1  2  0  1  1  0  0  2  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 128350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1  0 -1  0  0  0  0  0  1  0  0  0 -1] (Indices: [2, 3, 6, 8, 9, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  1  2  0  1  1  0  0  1  1  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 128400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1 -1  1  0 -1  0  0  1 -1  1  0 -1  0] (Indices: [2, 3, 6, 8, 10, 11, 15, 17, 18]), Candidate: [ 2  2  1 -1  1  2  0  1  0  2  0  0  1  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 128450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1 -1  1 -1  0  1  0 -1  0  1 -1  1 -1] (Indices: [2, 3, 6, 8, 10, 13, 14, 17, 19]), Candidate: [ 2  2  1 -1  1  2  0  1  0  2 -1  1  2  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 128500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1 -1  0  1  0 -1  1 -1  0  1 -1  1 -1] (Indices: [2, 3, 6, 8, 11, 12, 14, 17, 19]), Candidate: [ 2  2  1 -1  1  2  0  1  0  1  1  1  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 128550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1 -1  0  0  1  0  0  0 -1  0  0  1 -1] (Indices: [2, 3, 6, 8, 12, 13, 14, 15, 19]), Candidate: [ 2  2  1 -1  1  2  0  1  0  1  0  2  1  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 128600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1 -1  0  0  0  0  1  0 -1  1  0  0 -1] (Indices: [2, 3, 6, 8, 14, 15, 17, 18, 19]), Candidate: [ 2  2  1 -1  1  2  0  1  0  1  0  1  1  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 128650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  1  0  0 -1  0  0  1  0 -1  1 -1  0] (Indices: [2, 3, 6, 9, 10, 11, 15, 16, 18]), Candidate: [ 2  2  1 -1  1  2  0  0  2  1  0  0  1  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 128700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  1  0 -1  0  1  0 -1  1 -1  0  1 -1] (Indices: [2, 3, 6, 9, 10, 13, 14, 16, 19]), Candidate: [ 2  2  1 -1  1  2  0  0  2  1 -1  1  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 128750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  1 -1  1  0 -1  1 -1  1 -1  0  1 -1] (Indices: [2, 3, 6, 9, 11, 12, 14, 16, 19]), Candidate: [ 2  2  1 -1  1  2  0  0  2  0  1  1  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 128800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  1 -1  0  1  0  0  0 -1  1 -1  0  0] (Indices: [2, 3, 6, 9, 12, 13, 14, 15, 17]), Candidate: [ 2  2  1 -1  1  2  0  0  2  0  0  2  1  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 128850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  1 -1  0  0  0  1  0  0  0 -1  1 -1] (Indices: [2, 3, 6, 9, 14, 15, 16, 17, 19]), Candidate: [ 2  2  1 -1  1  2  0  0  2  0  0  1  1  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 128900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  0  1  0 -1  1 -1  1  0  0 -1  0  0] (Indices: [2, 3, 6, 10, 11, 13, 15, 16, 17]), Candidate: [ 2  2  1 -1  1  2  0  0  1  2  0  0  2  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 128950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  0  1 -1  1 -1  1  0 -1  0  1  0 -1] (Indices: [2, 3, 6, 10, 12, 14, 15, 18, 19]), Candidate: [ 2  2  1 -1  1  2  0  0  1  2 -1  2  0  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 129000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  0  0  1  0  0 -1  0  0  1  0  0 -1] (Indices: [2, 3, 6, 11, 12, 13, 17, 18, 19]), Candidate: [ 2  2  1 -1  1  2  0  0  1  1  1  1  1  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 129050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  0  0  0  1  0 -1  1 -1  1  0  0 -1] (Indices: [2, 3, 6, 12, 13, 15, 17, 18, 19]), Candidate: [ 2  2  1 -1  1  2  0  0  1  1  0  2  1  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 129100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0  0  0 -1  1 -1  1 -1  1 -1  0  0  0] (Indices: [2, 3, 7, 8, 9, 10, 12, 14, 16]), Candidate: [ 2  2  1 -1  1  1  2  0  1  1 -1  2  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 129150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0  0 -1  1  0  0 -1  1 -1  0  0  0  0] (Indices: [2, 3, 7, 8, 9, 11, 12, 13, 15]), Candidate: [ 2  2  1 -1  1  1  2  0  1  0  1  1  1  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 129200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0  0 -1  1 -1  0  0  1 -1  0  1  0 -1] (Indices: [2, 3, 7, 8, 9, 11, 15, 18, 19]), Candidate: [ 2  2  1 -1  1  1  2  0  1  0  1  0  1  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 129250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0  0 -1  0  0  1 -1  1  0  0 -1  0  0] (Indices: [2, 3, 7, 8, 9, 13, 15, 16, 17]), Candidate: [ 2  2  1 -1  1  1  2  0  1  0  0  1  2  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 129300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0 -1  1  0 -1  1  0 -1  0  0  0  1 -1] (Indices: [2, 3, 7, 8, 10, 11, 13, 14, 19]), Candidate: [ 2  2  1 -1  1  1  2  0  0  2  0  0  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 129350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0 -1  1 -1  1 -1  1 -1  1  0 -1  0  0] (Indices: [2, 3, 7, 8, 10, 12, 14, 16, 17]), Candidate: [ 2  2  1 -1  1  1  2  0  0  2 -1  2  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 129400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0 -1  1 -1  0  0  0  0  1  0  0  0 -1] (Indices: [2, 3, 7, 8, 10, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  1  1  2  0  0  2 -1  1  1  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 129450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0 -1  0  1 -1  1 -1  1 -1  1 -1  1 -1] (Indices: [2, 3, 7, 8, 11, 13, 15, 17, 19]), Candidate: [ 2  2  1 -1  1  1  2  0  0  1  1  0  2  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 129500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0 -1  0  0  1 -1  1 -1  0  1  0  0 -1] (Indices: [2, 3, 7, 8, 12, 14, 17, 18, 19]), Candidate: [ 2  2  1 -1  1  1  2  0  0  1  0  2  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 129550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  1  0  0 -1  1  0 -1  0  1 -1  0  0] (Indices: [2, 3, 7, 9, 10, 11, 13, 14, 17]), Candidate: [ 2  2  1 -1  1  1  2 -1  2  1  0  0  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 129600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  1  0 -1  1 -1  1  0 -1  0  1 -1  0] (Indices: [2, 3, 7, 9, 10, 12, 14, 15, 18]), Candidate: [ 2  2  1 -1  1  1  2 -1  2  1 -1  2  0  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 129650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  1  0 -1  0  0  0  1  0 -1  1  0 -1] (Indices: [2, 3, 7, 9, 10, 15, 16, 18, 19]), Candidate: [ 2  2  1 -1  1  1  2 -1  2  1 -1  1  1  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 129700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  1 -1  1 -1  1 -1  1  0 -1  0  1 -1] (Indices: [2, 3, 7, 9, 11, 13, 15, 16, 19]), Candidate: [ 2  2  1 -1  1  1  2 -1  2  0  1  0  2  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 129750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  1 -1  0  1 -1  1 -1  1  0 -1  1 -1] (Indices: [2, 3, 7, 9, 12, 14, 16, 17, 19]), Candidate: [ 2  2  1 -1  1  1  2 -1  2  0  0  2  0  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 129800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  0  1  0  0 -1  1 -1  1 -1  0  1 -1] (Indices: [2, 3, 7, 10, 11, 12, 14, 16, 19]), Candidate: [ 2  2  1 -1  1  1  2 -1  1  2  0  1  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 129850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  0  1 -1  1  0  0  0 -1  1 -1  0  0] (Indices: [2, 3, 7, 10, 12, 13, 14, 15, 17]), Candidate: [ 2  2  1 -1  1  1  2 -1  1  2 -1  2  1  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 129900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  0  1 -1  0  0  1  0  0  0 -1  1 -1] (Indices: [2, 3, 7, 10, 14, 15, 16, 17, 19]), Candidate: [ 2  2  1 -1  1  1  2 -1  1  2 -1  1  1  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 129950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  0  0  1 -1  1 -1  1  0  0  0 -1  0] (Indices: [2, 3, 7, 11, 13, 15, 16, 17, 18]), Candidate: [ 2  2  1 -1  1  1  2 -1  1  1  1  0  2  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 130000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1  0  0  0  0 -1  0  1  0 -1  0  0  0] (Indices: [2, 3, 8, 9, 10, 11, 12, 15, 16]), Candidate: [ 2  2  1 -1  1  1  1  1  1  1  0  1  0  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 130050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1  0  0 -1  1  0 -1  1  0 -1  0  0  0] (Indices: [2, 3, 8, 9, 10, 12, 13, 15, 16]), Candidate: [ 2  2  1 -1  1  1  1  1  1  1 -1  2  1  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 130100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1  0  0 -1  0  0  1  0  0  0 -1  0  0] (Indices: [2, 3, 8, 9, 10, 14, 15, 16, 17]), Candidate: [ 2  2  1 -1  1  1  1  1  1  1 -1  1  1  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 130150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1  0 -1  1 -1  1  0  0  0 -1  0  0  0] (Indices: [2, 3, 8, 9, 11, 13, 14, 15, 16]), Candidate: [ 2  2  1 -1  1  1  1  1  1  0  1  0  2  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 130200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1  0 -1  0  1  0 -1  1 -1  0  1  0 -1] (Indices: [2, 3, 8, 9, 12, 13, 15, 18, 19]), Candidate: [ 2  2  1 -1  1  1  1  1  1  0  0  2  1  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 130250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1 -1  1  0  0  0 -1  0  1  0 -1  0  0] (Indices: [2, 3, 8, 10, 11, 12, 13, 16, 17]), Candidate: [ 2  2  1 -1  1  1  1  1  0  2  0  1  1  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 130300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1 -1  1  0 -1  0  1  0 -1  1 -1  1 -1] (Indices: [2, 3, 8, 10, 11, 14, 15, 17, 19]), Candidate: [ 2  2  1 -1  1  1  1  1  0  2  0  0  1  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 130350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1 -1  1 -1  0  1  0  0 -1  1 -1  1 -1] (Indices: [2, 3, 8, 10, 13, 14, 15, 17, 19]), Candidate: [ 2  2  1 -1  1  1  1  1  0  2 -1  1  2  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 130400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1 -1  0  1  0 -1  0  1 -1  1  0  0 -1] (Indices: [2, 3, 8, 11, 12, 15, 17, 18, 19]), Candidate: [ 2  2  1 -1  1  1  1  1  0  1  1  1  0  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 130450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1 -1  0  0  0  0  1  0  0  0  0  0 -1] (Indices: [2, 3, 8, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  1  1  1  1  0  1  0  1  1  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 130500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  1  0  0 -1  1 -1  1 -1  1 -1  1 -1] (Indices: [2, 3, 9, 10, 11, 13, 15, 17, 19]), Candidate: [ 2  2  1 -1  1  1  1  0  2  1  0  0  2  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 130550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  1  0 -1  1 -1  1 -1  0  1  0  0 -1] (Indices: [2, 3, 9, 10, 12, 14, 17, 18, 19]), Candidate: [ 2  2  1 -1  1  1  1  0  2  1 -1  2  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 130600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  1 -1  1  0 -1  1  0 -1  1  0 -1  0] (Indices: [2, 3, 9, 11, 12, 14, 15, 17, 18]), Candidate: [ 2  2  1 -1  1  1  1  0  2  0  1  1  0  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 130650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  1 -1  0  1 -1  1  0  0 -1  1  0 -1] (Indices: [2, 3, 9, 12, 14, 15, 16, 18, 19]), Candidate: [ 2  2  1 -1  1  1  1  0  2  0  0  2  0  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 130700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  0  1  0 -1  1  0  0 -1  1 -1  1 -1] (Indices: [2, 3, 10, 11, 13, 14, 15, 17, 19]), Candidate: [ 2  2  1 -1  1  1  1  0  1  2  0  0  2  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 130750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  0  0  1  0  0  0  0 -1  0  1  0 -1] (Indices: [2, 3, 11, 12, 13, 14, 15, 18, 19]), Candidate: [ 2  2  1 -1  1  1  1  0  1  1  1  1  1  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 130800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0  0 -1  0  1 -1  0  1 -1  0  0  0  0] (Indices: [2, 4, 5, 6, 7, 8, 9, 12, 15]), Candidate: [2 2 0 1 1 1 1 0 1 0 0 2 0 1 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 130850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0 -1  1 -1  0  0  1 -1  0  0  1 -1  0] (Indices: [2, 4, 5, 6, 7, 8, 10, 14, 18]), Candidate: [ 2  2  0  1  1  1  1  0  0  2 -1  1  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 130900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0 -1  0  0  1 -1  1 -1  0  0  0  1 -1] (Indices: [2, 4, 5, 6, 7, 8, 12, 14, 19]), Candidate: [ 2  2  0  1  1  1  1  0  0  1  0  2  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 130950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  1  0  0 -1  0  0  0  1 -1  0  0  0] (Indices: [2, 4, 5, 6, 7, 9, 10, 11, 16]), Candidate: [ 2  2  0  1  1  1  1 -1  2  1  0  0  1  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 131000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  1 -1  1 -1  0  0  1  0 -1  0  0  0] (Indices: [2, 4, 5, 6, 7, 9, 11, 15, 16]), Candidate: [ 2  2  0  1  1  1  1 -1  2  0  1  0  1  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 131050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  1 -1  0  0  0  1 -1  1  0 -1  0  0] (Indices: [2, 4, 5, 6, 7, 9, 14, 16, 17]), Candidate: [ 2  2  0  1  1  1  1 -1  2  0  0  1  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 131100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  0  1 -1  1 -1  1  0 -1  0  0  0  0] (Indices: [2, 4, 5, 6, 7, 10, 12, 14, 15]), Candidate: [ 2  2  0  1  1  1  1 -1  1  2 -1  2  0  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 131150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  0  0  1  0  0  0 -1  0  0  0  0  0] (Indices: [2, 4, 5, 6, 7, 11, 12, 13, 14]), Candidate: [ 2  2  0  1  1  1  1 -1  1  1  1  1  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 131200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  0  0  1 -1  0  0  1 -1  1 -1  1 -1] (Indices: [2, 4, 5, 6, 7, 11, 15, 17, 19]), Candidate: [ 2  2  0  1  1  1  1 -1  1  1  1  0  1  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 131250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  0  0  0  0  1  0 -1  0  0  1  0 -1] (Indices: [2, 4, 5, 6, 7, 13, 14, 18, 19]), Candidate: [ 2  2  0  1  1  1  1 -1  1  1  0  1  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 131300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1  0  0 -1  0  0  1 -1  0  0  1 -1  0] (Indices: [2, 4, 5, 6, 8, 9, 10, 14, 18]), Candidate: [ 2  2  0  1  1  1  0  1  1  1 -1  1  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 131350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1  0 -1  0  1 -1  1 -1  0  0  0  1 -1] (Indices: [2, 4, 5, 6, 8, 9, 12, 14, 19]), Candidate: [ 2  2  0  1  1  1  0  1  1  0  0  2  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 131400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1 -1  1  0  0 -1  0  0  0  1 -1  0  0] (Indices: [2, 4, 5, 6, 8, 10, 11, 12, 17]), Candidate: [2 2 0 1 1 1 0 1 0 2 0 1 0 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 131450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1 -1  1 -1  0  1 -1  1  0 -1  0  0  0] (Indices: [2, 4, 5, 6, 8, 10, 13, 15, 16]), Candidate: [ 2  2  0  1  1  1  0  1  0  2 -1  1  2  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 131500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1 -1  0  1  0 -1  0  0  0  0  1  0 -1] (Indices: [2, 4, 5, 6, 8, 11, 12, 18, 19]), Candidate: [2 2 0 1 1 1 0 1 0 1 1 1 0 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 131550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1 -1  0  0  1  0 -1  0  0  0  1  0 -1] (Indices: [2, 4, 5, 6, 8, 12, 13, 18, 19]), Candidate: [2 2 0 1 1 1 0 1 0 1 0 2 1 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 131600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1 -1  0  0  0  0  1 -1  0  1  0  0 -1] (Indices: [2, 4, 5, 6, 8, 14, 17, 18, 19]), Candidate: [ 2  2  0  1  1  1  0  1  0  1  0  1  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 131650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  1  0 -1  1 -1  0  0  1 -1  1 -1  0] (Indices: [2, 4, 5, 6, 9, 10, 12, 16, 18]), Candidate: [ 2  2  0  1  1  1  0  0  2  1 -1  2  0  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 131700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  1 -1  1  0 -1  1 -1  0  0  0  1 -1] (Indices: [2, 4, 5, 6, 9, 11, 12, 14, 19]), Candidate: [ 2  2  0  1  1  1  0  0  2  0  1  1  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 131750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  1 -1  0  1  0  0 -1  0  0  0  1 -1] (Indices: [2, 4, 5, 6, 9, 12, 13, 14, 19]), Candidate: [ 2  2  0  1  1  1  0  0  2  0  0  2  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 131800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  1 -1  0  0  1 -1  0  0  1  0  0 -1] (Indices: [2, 4, 5, 6, 9, 13, 17, 18, 19]), Candidate: [2 2 0 1 1 1 0 0 2 0 0 1 2 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 131850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  0  1  0 -1  1 -1  0  0  1 -1  1 -1] (Indices: [2, 4, 5, 6, 10, 11, 13, 17, 19]), Candidate: [2 2 0 1 1 1 0 0 1 2 0 0 2 0 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 131900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  0  1 -1  1 -1  0  1 -1  1  0 -1  0] (Indices: [2, 4, 5, 6, 10, 12, 15, 17, 18]), Candidate: [ 2  2  0  1  1  1  0  0  1  2 -1  2  0  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 131950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  0  0  1  0  0 -1  1 -1  0  0  1 -1] (Indices: [2, 4, 5, 6, 11, 12, 13, 15, 19]), Candidate: [2 2 0 1 1 1 0 0 1 1 1 1 1 0 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 132000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  0  0  1 -1  0  1  0 -1  1  0 -1  0] (Indices: [2, 4, 5, 6, 11, 14, 15, 17, 18]), Candidate: [2 2 0 1 1 1 0 0 1 1 1 0 1 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 132050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  0  0  0  0  1  0  0 -1  1  0 -1  0] (Indices: [2, 4, 5, 6, 13, 14, 15, 17, 18]), Candidate: [2 2 0 1 1 1 0 0 1 1 0 1 2 1 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 132100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0  0  0 -1  0  0  0  0  1 -1  0  1 -1] (Indices: [2, 4, 5, 7, 8, 9, 10, 16, 19]), Candidate: [ 2  2  0  1  1  0  2  0  1  1 -1  1  1  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 132150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0  0 -1  0  1 -1  0  0  0  1  0 -1  0] (Indices: [2, 4, 5, 7, 8, 9, 12, 17, 18]), Candidate: [2 2 0 1 1 0 2 0 1 0 0 2 0 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 132200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0 -1  1  0 -1  1 -1  0  0  0  0  1 -1] (Indices: [2, 4, 5, 7, 8, 10, 11, 13, 19]), Candidate: [2 2 0 1 1 0 2 0 0 2 0 0 2 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 132250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0 -1  1 -1  0  1 -1  0  0  1 -1  1 -1] (Indices: [2, 4, 5, 7, 8, 10, 13, 17, 19]), Candidate: [ 2  2  0  1  1  0  2  0  0  2 -1  1  2  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 132300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0 -1  0  1 -1  1 -1  1 -1  0  1 -1  0] (Indices: [2, 4, 5, 7, 8, 11, 13, 15, 18]), Candidate: [2 2 0 1 1 0 2 0 0 1 1 0 2 0 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 132350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0 -1  0  0  1 -1  1 -1  0  1  0 -1  0] (Indices: [2, 4, 5, 7, 8, 12, 14, 17, 18]), Candidate: [ 2  2  0  1  1  0  2  0  0  1  0  2  0  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 132400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  1  0  0  0 -1  0  1 -1  0  0  0  0] (Indices: [2, 4, 5, 7, 9, 10, 11, 12, 15]), Candidate: [ 2  2  0  1  1  0  2 -1  2  1  0  1  0  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 132450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  1  0 -1  0  1  0 -1  0  0  1 -1  0] (Indices: [2, 4, 5, 7, 9, 10, 13, 14, 18]), Candidate: [ 2  2  0  1  1  0  2 -1  2  1 -1  1  2  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 132500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  1 -1  1  0 -1  0  0  0  1  0 -1  0] (Indices: [2, 4, 5, 7, 9, 11, 12, 17, 18]), Candidate: [ 2  2  0  1  1  0  2 -1  2  0  1  1  0  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 132550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  1 -1  0  1  0 -1  0  0  1  0 -1  0] (Indices: [2, 4, 5, 7, 9, 12, 13, 17, 18]), Candidate: [ 2  2  0  1  1  0  2 -1  2  0  0  2  1  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 132600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  1 -1  0  0  0  1 -1  1  0 -1  1 -1] (Indices: [2, 4, 5, 7, 9, 14, 16, 17, 19]), Candidate: [ 2  2  0  1  1  0  2 -1  2  0  0  1  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 132650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  0  1  0 -1  0  1 -1  1 -1  0  1 -1] (Indices: [2, 4, 5, 7, 10, 11, 14, 16, 19]), Candidate: [ 2  2  0  1  1  0  2 -1  1  2  0  0  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 132700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  0  1 -1  0  1  0  0 -1  1 -1  0  0] (Indices: [2, 4, 5, 7, 10, 13, 14, 15, 17]), Candidate: [ 2  2  0  1  1  0  2 -1  1  2 -1  1  2  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 132750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  0  0  1  0 -1  1  0 -1  1 -1  0  0] (Indices: [2, 4, 5, 7, 11, 12, 14, 15, 17]), Candidate: [ 2  2  0  1  1  0  2 -1  1  1  1  1  0  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 132800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  0  0  1 -1  0  0  1  0  0 -1  1 -1] (Indices: [2, 4, 5, 7, 11, 15, 16, 17, 19]), Candidate: [ 2  2  0  1  1  0  2 -1  1  1  1  0  1  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 132850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  0  0  0  0  1 -1  1  0  0 -1  1 -1] (Indices: [2, 4, 5, 7, 13, 15, 16, 17, 19]), Candidate: [ 2  2  0  1  1  0  2 -1  1  1  0  1  2  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 132900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1  0  0 -1  1 -1  0  1 -1  1 -1  0  0] (Indices: [2, 4, 5, 8, 9, 10, 12, 15, 17]), Candidate: [ 2  2  0  1  1  0  1  1  1  1 -1  2  0  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 132950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1  0 -1  1  0 -1  1  0 -1  0  0  0  0] (Indices: [2, 4, 5, 8, 9, 11, 12, 14, 15]), Candidate: [2 2 0 1 1 0 1 1 1 0 1 1 0 2 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 133000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1  0 -1  0  1  0  0  0 -1  0  0  0  0] (Indices: [2, 4, 5, 8, 9, 12, 13, 14, 15]), Candidate: [2 2 0 1 1 0 1 1 1 0 0 2 1 1 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 133050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1  0 -1  0  0  1 -1  1 -1  0  1  0 -1] (Indices: [2, 4, 5, 8, 9, 13, 15, 18, 19]), Candidate: [2 2 0 1 1 0 1 1 1 0 0 1 2 0 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 133100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1 -1  1  0 -1  1 -1  0  1  0 -1  0  0] (Indices: [2, 4, 5, 8, 10, 11, 13, 16, 17]), Candidate: [2 2 0 1 1 0 1 1 0 2 0 0 2 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 133150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1 -1  1 -1  1 -1  1 -1  0  0  1  0 -1] (Indices: [2, 4, 5, 8, 10, 12, 14, 18, 19]), Candidate: [ 2  2  0  1  1  0  1  1  0  2 -1  2  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 133200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1 -1  0  1  0  0  0 -1  0  0  0  1 -1] (Indices: [2, 4, 5, 8, 11, 12, 13, 14, 19]), Candidate: [ 2  2  0  1  1  0  1  1  0  1  1  1  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 133250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1 -1  0  1 -1  1 -1  0  0  1  0  0 -1] (Indices: [2, 4, 5, 8, 11, 13, 17, 18, 19]), Candidate: [2 2 0 1 1 0 1 1 0 1 1 0 2 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 133300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1 -1  0  0  1 -1  0  0  1  0  0  0 -1] (Indices: [2, 4, 5, 8, 12, 16, 17, 18, 19]), Candidate: [2 2 0 1 1 0 1 1 0 1 0 2 0 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 133350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  1  0  0 -1  1 -1  1 -1  0  1 -1  0] (Indices: [2, 4, 5, 9, 10, 11, 13, 15, 18]), Candidate: [2 2 0 1 1 0 1 0 2 1 0 0 2 0 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 133400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  1  0 -1  1 -1  1 -1  0  1  0 -1  0] (Indices: [2, 4, 5, 9, 10, 12, 14, 17, 18]), Candidate: [ 2  2  0  1  1  0  1  0  2  1 -1  2  0  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 133450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  1 -1  1  0  0  0 -1  0  1 -1  0  0] (Indices: [2, 4, 5, 9, 11, 12, 13, 14, 17]), Candidate: [ 2  2  0  1  1  0  1  0  2  0  1  1  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 133500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  1 -1  1 -1  1 -1  0  1  0 -1  1 -1] (Indices: [2, 4, 5, 9, 11, 13, 16, 17, 19]), Candidate: [2 2 0 1 1 0 1 0 2 0 1 0 2 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 133550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  1 -1  0  1 -1  0  1  0 -1  1  0 -1] (Indices: [2, 4, 5, 9, 12, 15, 16, 18, 19]), Candidate: [2 2 0 1 1 0 1 0 2 0 0 2 0 1 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 133600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  0  1  0  0 -1  0  1  0 -1  1 -1  0] (Indices: [2, 4, 5, 10, 11, 12, 15, 16, 18]), Candidate: [2 2 0 1 1 0 1 0 1 2 0 1 0 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 133650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  0  1 -1  1  0  0 -1  1 -1  0  1 -1] (Indices: [2, 4, 5, 10, 12, 13, 14, 16, 19]), Candidate: [ 2  2  0  1  1  0  1  0  1  2 -1  2  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 133700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  0  0  1  0  0  0  0  0 -1  0  0  0] (Indices: [2, 4, 5, 11, 12, 13, 14, 15, 16]), Candidate: [2 2 0 1 1 0 1 0 1 1 1 1 1 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 133750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  0  0  1 -1  0  1  0  0  0  0 -1  0] (Indices: [2, 4, 5, 11, 14, 15, 16, 17, 18]), Candidate: [2 2 0 1 1 0 1 0 1 1 1 0 1 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 133800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0  0  0 -1  0  1 -1  1 -1  0  0  0  0] (Indices: [2, 4, 6, 7, 8, 9, 10, 13, 15]), Candidate: [ 2  2  0  1  0  2  1  0  1  1 -1  1  2  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 133850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0  0 -1  0  1  0 -1  0  1 -1  0  0  0] (Indices: [2, 4, 6, 7, 8, 9, 12, 13, 16]), Candidate: [2 2 0 1 0 2 1 0 1 0 0 2 1 0 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 133900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0  0 -1  0  0  0  0  0  1  0  0 -1  0] (Indices: [2, 4, 6, 7, 8, 9, 16, 17, 18]), Candidate: [2 2 0 1 0 2 1 0 1 0 0 1 1 1 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 133950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0 -1  1 -1  1 -1  0  0  0  1  0 -1  0] (Indices: [2, 4, 6, 7, 8, 10, 12, 17, 18]), Candidate: [ 2  2  0  1  0  2  1  0  0  2 -1  2  0  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 134000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0 -1  0  1  0 -1  0  1 -1  1 -1  0  0] (Indices: [2, 4, 6, 7, 8, 11, 12, 15, 17]), Candidate: [2 2 0 1 0 2 1 0 0 1 1 1 0 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 134050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0 -1  0  0  1  0 -1  1 -1  1 -1  0  0] (Indices: [2, 4, 6, 7, 8, 12, 13, 15, 17]), Candidate: [2 2 0 1 0 2 1 0 0 1 0 2 1 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 134100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0 -1  0  0  0  0  1  0  0 -1  1 -1  0] (Indices: [2, 4, 6, 7, 8, 14, 15, 16, 18]), Candidate: [2 2 0 1 0 2 1 0 0 1 0 1 1 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 134150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  1  0 -1  1 -1  1 -1  0  1 -1  0  0] (Indices: [2, 4, 6, 7, 9, 10, 12, 14, 17]), Candidate: [ 2  2  0  1  0  2  1 -1  2  1 -1  2  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 134200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  1 -1  1  0  0 -1  0  1 -1  0  0  0] (Indices: [2, 4, 6, 7, 9, 11, 12, 13, 16]), Candidate: [ 2  2  0  1  0  2  1 -1  2  0  1  1  1  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 134250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  1 -1  1 -1  0  0  0  1  0  0 -1  0] (Indices: [2, 4, 6, 7, 9, 11, 16, 17, 18]), Candidate: [ 2  2  0  1  0  2  1 -1  2  0  1  0  1  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 134300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  1 -1  0  0  1 -1  1  0 -1  1 -1  0] (Indices: [2, 4, 6, 7, 9, 13, 15, 16, 18]), Candidate: [ 2  2  0  1  0  2  1 -1  2  0  0  1  2  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 134350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  0  1  0 -1  1 -1  1  0 -1  0  0  0] (Indices: [2, 4, 6, 7, 10, 11, 13, 15, 16]), Candidate: [ 2  2  0  1  0  2  1 -1  1  2  0  0  2  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 134400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  0  1 -1  1 -1  1 -1  1 -1  1 -1  0] (Indices: [2, 4, 6, 7, 10, 12, 14, 16, 18]), Candidate: [ 2  2  0  1  0  2  1 -1  1  2 -1  2  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 134450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  0  0  1  0  0  0  0 -1  0  0  0  0] (Indices: [2, 4, 6, 7, 11, 12, 13, 14, 15]), Candidate: [ 2  2  0  1  0  2  1 -1  1  1  1  1  1  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 134500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  0  0  1 -1  1 -1  1 -1  0  1  0 -1] (Indices: [2, 4, 6, 7, 11, 13, 15, 18, 19]), Candidate: [ 2  2  0  1  0  2  1 -1  1  1  1  0  2  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 134550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  0  0  0  1 -1  0  1  0  0  0 -1  0] (Indices: [2, 4, 6, 7, 12, 15, 16, 17, 18]), Candidate: [ 2  2  0  1  0  2  1 -1  1  1  0  2  0  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 134600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1  0  0  0 -1  0  0  0  1 -1  0  1 -1] (Indices: [2, 4, 6, 8, 9, 10, 11, 16, 19]), Candidate: [2 2 0 1 0 2 0 1 1 1 0 0 1 1 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 134650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1  0  0 -1  0  0  0  1  0  0 -1  0  0] (Indices: [2, 4, 6, 8, 9, 10, 15, 16, 17]), Candidate: [ 2  2  0  1  0  2  0  1  1  1 -1  1  1  1  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 134700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1  0 -1  1 -1  0  1 -1  1  0 -1  0  0] (Indices: [2, 4, 6, 8, 9, 11, 14, 16, 17]), Candidate: [ 2  2  0  1  0  2  0  1  1  0  1  0  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 134750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1  0 -1  0  1 -1  0  0  0  1  0  0 -1] (Indices: [2, 4, 6, 8, 9, 12, 17, 18, 19]), Candidate: [2 2 0 1 0 2 0 1 1 0 0 2 0 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 134800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1 -1  1  0  0 -1  0  1 -1  0  0  1 -1] (Indices: [2, 4, 6, 8, 10, 11, 12, 15, 19]), Candidate: [2 2 0 1 0 2 0 1 0 2 0 1 0 1 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 134850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1 -1  1 -1  1  0 -1  1 -1  0  0  1 -1] (Indices: [2, 4, 6, 8, 10, 12, 13, 15, 19]), Candidate: [ 2  2  0  1  0  2  0  1  0  2 -1  2  1  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 134900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1 -1  1 -1  0  0  1  0 -1  1  0 -1  0] (Indices: [2, 4, 6, 8, 10, 14, 15, 17, 18]), Candidate: [ 2  2  0  1  0  2  0  1  0  2 -1  1  1  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 134950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1 -1  0  1 -1  1  0  0 -1  0  0  1 -1] (Indices: [2, 4, 6, 8, 11, 13, 14, 15, 19]), Candidate: [2 2 0 1 0 2 0 1 0 1 1 0 2 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 135000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1 -1  0  0  1  0 -1  0  1 -1  1  0 -1] (Indices: [2, 4, 6, 8, 12, 13, 16, 18, 19]), Candidate: [2 2 0 1 0 2 0 1 0 1 0 2 1 0 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 135050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  1  0  0  0 -1  0  1 -1  1 -1  0  0] (Indices: [2, 4, 6, 9, 10, 11, 12, 15, 17]), Candidate: [2 2 0 1 0 2 0 0 2 1 0 1 0 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 135100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  1  0 -1  1  0 -1  1 -1  1 -1  0  0] (Indices: [2, 4, 6, 9, 10, 12, 13, 15, 17]), Candidate: [ 2  2  0  1  0  2  0  0  2  1 -1  2  1  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 135150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  1  0 -1  0  0  1  0  0 -1  1 -1  0] (Indices: [2, 4, 6, 9, 10, 14, 15, 16, 18]), Candidate: [ 2  2  0  1  0  2  0  0  2  1 -1  1  1  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 135200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  1 -1  1 -1  1  0  0 -1  1 -1  0  0] (Indices: [2, 4, 6, 9, 11, 13, 14, 15, 17]), Candidate: [2 2 0 1 0 2 0 0 2 0 1 0 2 1 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 135250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  1 -1  0  1  0 -1  0  1  0  0 -1  0] (Indices: [2, 4, 6, 9, 12, 13, 16, 17, 18]), Candidate: [2 2 0 1 0 2 0 0 2 0 0 2 1 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 135300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  0  1  0  0  0 -1  0  1 -1  1 -1  0] (Indices: [2, 4, 6, 10, 11, 12, 13, 16, 18]), Candidate: [2 2 0 1 0 2 0 0 1 2 0 1 1 0 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 135350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  0  1  0 -1  0  1  0 -1  0  1  0 -1] (Indices: [2, 4, 6, 10, 11, 14, 15, 18, 19]), Candidate: [2 2 0 1 0 2 0 0 1 2 0 0 1 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 135400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  0  1 -1  0  1  0  0 -1  0  1  0 -1] (Indices: [2, 4, 6, 10, 13, 14, 15, 18, 19]), Candidate: [ 2  2  0  1  0  2  0  0  1  2 -1  1  2  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 135450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  0  0  1  0 -1  0  0  1  0  0  0 -1] (Indices: [2, 4, 6, 11, 12, 16, 17, 18, 19]), Candidate: [2 2 0 1 0 2 0 0 1 1 1 1 0 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 135500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0  0  0  0  0  0 -1  0  0  0  0  0  0] (Indices: [2, 4, 7, 8, 9, 10, 11, 12, 13]), Candidate: [2 2 0 1 0 1 2 0 1 1 0 1 1 0 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 135550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0  0  0 -1  0  1  0 -1  1 -1  0  0  0] (Indices: [2, 4, 7, 8, 9, 10, 13, 14, 16]), Candidate: [ 2  2  0  1  0  1  2  0  1  1 -1  1  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 135600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0  0 -1  1  0 -1  0  0  1 -1  1 -1  0] (Indices: [2, 4, 7, 8, 9, 11, 12, 16, 18]), Candidate: [2 2 0 1 0 1 2 0 1 0 1 1 0 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 135650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0  0 -1  0  1  0 -1  0  1 -1  1 -1  0] (Indices: [2, 4, 7, 8, 9, 12, 13, 16, 18]), Candidate: [2 2 0 1 0 1 2 0 1 0 0 2 1 0 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 135700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0  0 -1  0  0  0  1  0 -1  0  1  0 -1] (Indices: [2, 4, 7, 8, 9, 14, 15, 18, 19]), Candidate: [2 2 0 1 0 1 2 0 1 0 0 1 1 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 135750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0 -1  1  0 -1  0  1 -1  1  0 -1  0  0] (Indices: [2, 4, 7, 8, 10, 11, 14, 16, 17]), Candidate: [ 2  2  0  1  0  1  2  0  0  2  0  0  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 135800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0 -1  1 -1  1 -1  0  0  0  1  0  0 -1] (Indices: [2, 4, 7, 8, 10, 12, 17, 18, 19]), Candidate: [ 2  2  0  1  0  1  2  0  0  2 -1  2  0  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 135850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0 -1  0  1  0  0 -1  0  0  0  1  0 -1] (Indices: [2, 4, 7, 8, 11, 12, 13, 18, 19]), Candidate: [2 2 0 1 0 1 2 0 0 1 1 1 1 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 135900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0 -1  0  1 -1  0  1 -1  0  1  0  0 -1] (Indices: [2, 4, 7, 8, 11, 14, 17, 18, 19]), Candidate: [ 2  2  0  1  0  1  2  0  0  1  1  0  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 135950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0 -1  0  0  0  1  0 -1  0  1  0  0 -1] (Indices: [2, 4, 7, 8, 13, 14, 17, 18, 19]), Candidate: [ 2  2  0  1  0  1  2  0  0  1  0  1  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 136000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  1  0  0 -1  0  1  0 -1  0  1 -1  0] (Indices: [2, 4, 7, 9, 10, 11, 14, 15, 18]), Candidate: [ 2  2  0  1  0  1  2 -1  2  1  0  0  1  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 136050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  1  0 -1  1 -1  0  0  1  0 -1  1 -1] (Indices: [2, 4, 7, 9, 10, 12, 16, 17, 19]), Candidate: [ 2  2  0  1  0  1  2 -1  2  1 -1  2  0  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 136100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  1 -1  1  0  0 -1  0  0  1  0 -1  0] (Indices: [2, 4, 7, 9, 11, 12, 13, 17, 18]), Candidate: [ 2  2  0  1  0  1  2 -1  2  0  1  1  1  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 136150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  1 -1  1 -1  0  1 -1  1  0 -1  1 -1] (Indices: [2, 4, 7, 9, 11, 14, 16, 17, 19]), Candidate: [ 2  2  0  1  0  1  2 -1  2  0  1  0  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 136200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  1 -1  0  0  1  0 -1  1  0 -1  1 -1] (Indices: [2, 4, 7, 9, 13, 14, 16, 17, 19]), Candidate: [ 2  2  0  1  0  1  2 -1  2  0  0  1  2  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 136250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  0  1  0 -1  1  0  0 -1  1 -1  0  0] (Indices: [2, 4, 7, 10, 11, 13, 14, 15, 17]), Candidate: [ 2  2  0  1  0  1  2 -1  1  2  0  0  2  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 136300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  0  1 -1  1  0 -1  0  1  0  0 -1  0] (Indices: [2, 4, 7, 10, 12, 13, 16, 17, 18]), Candidate: [ 2  2  0  1  0  1  2 -1  1  2 -1  2  1  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 136350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  0  0  1  0  0 -1  1  0  0 -1  0  0] (Indices: [2, 4, 7, 11, 12, 13, 15, 16, 17]), Candidate: [ 2  2  0  1  0  1  2 -1  1  1  1  1  1  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 136400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  0  0  0  1  0  0  0 -1  1 -1  1 -1] (Indices: [2, 4, 7, 12, 13, 14, 15, 17, 19]), Candidate: [ 2  2  0  1  0  1  2 -1  1  1  0  2  1  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 136450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1  0  0  0 -1  1 -1  1  0 -1  0  0  0] (Indices: [2, 4, 8, 9, 10, 11, 13, 15, 16]), Candidate: [2 2 0 1 0 1 1 1 1 1 0 0 2 0 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 136500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1  0  0 -1  1 -1  1 -1  1 -1  1 -1  0] (Indices: [2, 4, 8, 9, 10, 12, 14, 16, 18]), Candidate: [ 2  2  0  1  0  1  1  1  1  1 -1  2  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 136550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1  0 -1  1  0  0  0  0 -1  0  0  0  0] (Indices: [2, 4, 8, 9, 11, 12, 13, 14, 15]), Candidate: [2 2 0 1 0 1 1 1 1 0 1 1 1 1 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 136600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1  0 -1  1 -1  1 -1  1 -1  0  1  0 -1] (Indices: [2, 4, 8, 9, 11, 13, 15, 18, 19]), Candidate: [2 2 0 1 0 1 1 1 1 0 1 0 2 0 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 136650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1  0 -1  0  1 -1  0  1  0  0  0 -1  0] (Indices: [2, 4, 8, 9, 12, 15, 16, 17, 18]), Candidate: [2 2 0 1 0 1 1 1 1 0 0 2 0 1 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 136700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1 -1  1  0  0 -1  1 -1  0  0  1  0 -1] (Indices: [2, 4, 8, 10, 11, 12, 14, 18, 19]), Candidate: [ 2  2  0  1  0  1  1  1  0  2  0  1  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 136750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1 -1  1 -1  1  0  0 -1  1  0 -1  0  0] (Indices: [2, 4, 8, 10, 12, 13, 14, 16, 17]), Candidate: [ 2  2  0  1  0  1  1  1  0  2 -1  2  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 136800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1 -1  1 -1  0  0  1 -1  1  0  0  0 -1] (Indices: [2, 4, 8, 10, 14, 16, 17, 18, 19]), Candidate: [ 2  2  0  1  0  1  1  1  0  2 -1  1  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 136850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1 -1  0  1 -1  1 -1  1 -1  1  0  0 -1] (Indices: [2, 4, 8, 11, 13, 15, 17, 18, 19]), Candidate: [2 2 0 1 0 1 1 1 0 1 1 0 2 0 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 136900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  1  0  0  0  0 -1  0  0  0  1  0 -1] (Indices: [2, 4, 9, 10, 11, 12, 13, 18, 19]), Candidate: [2 2 0 1 0 1 1 0 2 1 0 1 1 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 136950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  1  0  0 -1  0  1 -1  0  1  0  0 -1] (Indices: [2, 4, 9, 10, 11, 14, 17, 18, 19]), Candidate: [ 2  2  0  1  0  1  1  0  2  1  0  0  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 137000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  1  0 -1  0  1  0 -1  0  1  0  0 -1] (Indices: [2, 4, 9, 10, 13, 14, 17, 18, 19]), Candidate: [ 2  2  0  1  0  1  1  0  2  1 -1  1  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 137050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  1 -1  1 -1  1  0  0 -1  1  0 -1  0] (Indices: [2, 4, 9, 11, 13, 14, 15, 17, 18]), Candidate: [2 2 0 1 0 1 1 0 2 0 1 0 2 1 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 137100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  0  1  0  0  0  0 -1  1  0 -1  0  0] (Indices: [2, 4, 10, 11, 12, 13, 14, 16, 17]), Candidate: [ 2  2  0  1  0  1  1  0  1  2  0  1  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 137150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  0  1  0 -1  0  1 -1  1  0  0  0 -1] (Indices: [2, 4, 10, 11, 14, 16, 17, 18, 19]), Candidate: [ 2  2  0  1  0  1  1  0  1  2  0  0  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 137200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  0  0  1  0 -1  0  1  0  0  0  0 -1] (Indices: [2, 4, 11, 12, 15, 16, 17, 18, 19]), Candidate: [2 2 0 1 0 1 1 0 1 1 1 1 0 1 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 137250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0  0  0 -1  0  0  0  0  0  1 -1  1 -1] (Indices: [2, 5, 6, 7, 8, 9, 10, 17, 19]), Candidate: [ 2  2  0  0  2  1  1  0  1  1 -1  1  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 137300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0  0 -1  0  1 -1  0  0  0  0  1  0 -1] (Indices: [2, 5, 6, 7, 8, 9, 12, 18, 19]), Candidate: [2 2 0 0 2 1 1 0 1 0 0 2 0 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 137350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0 -1  1  0 -1  0  1 -1  1 -1  0  0  0] (Indices: [2, 5, 6, 7, 8, 10, 11, 14, 16]), Candidate: [ 2  2  0  0  2  1  1  0  0  2  0  0  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 137400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0 -1  1 -1  0  0  1  0  0 -1  0  0  0] (Indices: [2, 5, 6, 7, 8, 10, 14, 15, 16]), Candidate: [ 2  2  0  0  2  1  1  0  0  2 -1  1  1  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 137450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0 -1  0  1 -1  1 -1  0  1  0 -1  0  0] (Indices: [2, 5, 6, 7, 8, 11, 13, 16, 17]), Candidate: [2 2 0 0 2 1 1 0 0 1 1 0 2 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 137500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0 -1  0  0  1 -1  1 -1  0  0  1  0 -1] (Indices: [2, 5, 6, 7, 8, 12, 14, 18, 19]), Candidate: [ 2  2  0  0  2  1  1  0  0  1  0  2  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 137550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  1  0  0  0 -1  0  0  0  1 -1  0  0] (Indices: [2, 5, 6, 7, 9, 10, 11, 12, 17]), Candidate: [ 2  2  0  0  2  1  1 -1  2  1  0  1  0  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 137600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  1  0 -1  0  1 -1  1  0 -1  0  0  0] (Indices: [2, 5, 6, 7, 9, 10, 13, 15, 16]), Candidate: [ 2  2  0  0  2  1  1 -1  2  1 -1  1  2  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 137650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  1 -1  1  0 -1  0  0  0  0  1  0 -1] (Indices: [2, 5, 6, 7, 9, 11, 12, 18, 19]), Candidate: [ 2  2  0  0  2  1  1 -1  2  0  1  1  0  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 137700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  1 -1  0  1  0 -1  0  0  0  1  0 -1] (Indices: [2, 5, 6, 7, 9, 12, 13, 18, 19]), Candidate: [ 2  2  0  0  2  1  1 -1  2  0  0  2  1  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 137750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  1 -1  0  0  0  1 -1  0  1  0  0 -1] (Indices: [2, 5, 6, 7, 9, 14, 17, 18, 19]), Candidate: [ 2  2  0  0  2  1  1 -1  2  0  0  1  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 137800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  0  1  0 -1  0  1 -1  0  1 -1  1 -1] (Indices: [2, 5, 6, 7, 10, 11, 14, 17, 19]), Candidate: [ 2  2  0  0  2  1  1 -1  1  2  0  0  1  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 137850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  0  1 -1  0  1  0  0 -1  0  0  1 -1] (Indices: [2, 5, 6, 7, 10, 13, 14, 15, 19]), Candidate: [ 2  2  0  0  2  1  1 -1  1  2 -1  1  2  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 137900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  0  0  1  0 -1  1  0 -1  0  0  1 -1] (Indices: [2, 5, 6, 7, 11, 12, 14, 15, 19]), Candidate: [ 2  2  0  0  2  1  1 -1  1  1  1  1  0  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 137950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  0  0  1 -1  0  0  1 -1  1  0  0 -1] (Indices: [2, 5, 6, 7, 11, 15, 17, 18, 19]), Candidate: [ 2  2  0  0  2  1  1 -1  1  1  1  0  1  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 138000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  0  0  0  0  1 -1  1 -1  1  0  0 -1] (Indices: [2, 5, 6, 7, 13, 15, 17, 18, 19]), Candidate: [ 2  2  0  0  2  1  1 -1  1  1  0  1  2  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 138050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1  0  0 -1  1 -1  0  1 -1  0  0  1 -1] (Indices: [2, 5, 6, 8, 9, 10, 12, 15, 19]), Candidate: [ 2  2  0  0  2  1  0  1  1  1 -1  2  0  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 138100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1  0 -1  1  0 -1  1 -1  0  1 -1  0  0] (Indices: [2, 5, 6, 8, 9, 11, 12, 14, 17]), Candidate: [ 2  2  0  0  2  1  0  1  1  0  1  1  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 138150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1  0 -1  0  1  0  0 -1  0  1 -1  0  0] (Indices: [2, 5, 6, 8, 9, 12, 13, 14, 17]), Candidate: [ 2  2  0  0  2  1  0  1  1  0  0  2  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 138200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1  0 -1  0  0  1 -1  0  1  0 -1  1 -1] (Indices: [2, 5, 6, 8, 9, 13, 16, 17, 19]), Candidate: [2 2 0 0 2 1 0 1 1 0 0 1 2 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 138250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1 -1  1  0 -1  1 -1  0  1 -1  0  1 -1] (Indices: [2, 5, 6, 8, 10, 11, 13, 16, 19]), Candidate: [2 2 0 0 2 1 0 1 0 2 0 0 2 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 138300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1 -1  1 -1  1 -1  0  1  0 -1  1 -1  0] (Indices: [2, 5, 6, 8, 10, 12, 15, 16, 18]), Candidate: [ 2  2  0  0  2  1  0  1  0  2 -1  2  0  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 138350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1 -1  0  1  0  0 -1  1 -1  1 -1  0  0] (Indices: [2, 5, 6, 8, 11, 12, 13, 15, 17]), Candidate: [2 2 0 0 2 1 0 1 0 1 1 1 1 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 138400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1 -1  0  1 -1  0  1  0  0 -1  1 -1  0] (Indices: [2, 5, 6, 8, 11, 14, 15, 16, 18]), Candidate: [2 2 0 0 2 1 0 1 0 1 1 0 1 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 138450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1 -1  0  0  0  1  0  0  0 -1  1 -1  0] (Indices: [2, 5, 6, 8, 13, 14, 15, 16, 18]), Candidate: [2 2 0 0 2 1 0 1 0 1 0 1 2 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 138500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  1  0  0 -1  1 -1  0  1  0 -1  0  0] (Indices: [2, 5, 6, 9, 10, 11, 13, 16, 17]), Candidate: [2 2 0 0 2 1 0 0 2 1 0 0 2 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 138550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  1  0 -1  1 -1  1 -1  0  0  1  0 -1] (Indices: [2, 5, 6, 9, 10, 12, 14, 18, 19]), Candidate: [ 2  2  0  0  2  1  0  0  2  1 -1  2  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 138600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  1 -1  1  0  0  0 -1  0  0  0  1 -1] (Indices: [2, 5, 6, 9, 11, 12, 13, 14, 19]), Candidate: [ 2  2  0  0  2  1  0  0  2  0  1  1  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 138650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  1 -1  1 -1  1 -1  0  0  1  0  0 -1] (Indices: [2, 5, 6, 9, 11, 13, 17, 18, 19]), Candidate: [2 2 0 0 2 1 0 0 2 0 1 0 2 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 138700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  1 -1  0  1 -1  0  0  1  0  0  0 -1] (Indices: [2, 5, 6, 9, 12, 16, 17, 18, 19]), Candidate: [2 2 0 0 2 1 0 0 2 0 0 2 0 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 138750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  0  1  0  0 -1  0  1 -1  1  0 -1  0] (Indices: [2, 5, 6, 10, 11, 12, 15, 17, 18]), Candidate: [2 2 0 0 2 1 0 0 1 2 0 1 0 1 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 138800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  0  1 -1  1  0  0 -1  0  1 -1  1 -1] (Indices: [2, 5, 6, 10, 12, 13, 14, 17, 19]), Candidate: [ 2  2  0  0  2  1  0  0  1  2 -1  2  1  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 138850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  0  0  1  0  0  0  0 -1  0  1 -1  0] (Indices: [2, 5, 6, 11, 12, 13, 14, 15, 18]), Candidate: [2 2 0 0 2 1 0 0 1 1 1 1 1 1 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 138900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  0  0  1 -1  0  1  0  0 -1  1  0 -1] (Indices: [2, 5, 6, 11, 14, 15, 16, 18, 19]), Candidate: [2 2 0 0 2 1 0 0 1 1 1 0 1 2 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 138950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0  0  0  0 -1  0  0  1  0 -1  0  0  0] (Indices: [2, 5, 7, 8, 9, 10, 11, 15, 16]), Candidate: [2 2 0 0 2 0 2 0 1 1 0 0 1 1 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 139000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0  0  0 -1  0  0  1 -1  1  0 -1  0  0] (Indices: [2, 5, 7, 8, 9, 10, 14, 16, 17]), Candidate: [ 2  2  0  0  2  0  2  0  1  1 -1  1  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 139050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0  0 -1  1 -1  1 -1  0  0  1 -1  1 -1] (Indices: [2, 5, 7, 8, 9, 11, 13, 17, 19]), Candidate: [2 2 0 0 2 0 2 0 1 0 1 0 2 0 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 139100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0  0 -1  0  1 -1  0  1 -1  1  0 -1  0] (Indices: [2, 5, 7, 8, 9, 12, 15, 17, 18]), Candidate: [2 2 0 0 2 0 2 0 1 0 0 2 0 1 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 139150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0 -1  1  0  0 -1  1 -1  0  1 -1  0  0] (Indices: [2, 5, 7, 8, 10, 11, 12, 14, 17]), Candidate: [ 2  2  0  0  2  0  2  0  0  2  0  1  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 139200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0 -1  1 -1  1  0  0 -1  0  1 -1  0  0] (Indices: [2, 5, 7, 8, 10, 12, 13, 14, 17]), Candidate: [ 2  2  0  0  2  0  2  0  0  2 -1  2  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 139250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0 -1  1 -1  0  1 -1  0  1  0 -1  1 -1] (Indices: [2, 5, 7, 8, 10, 13, 16, 17, 19]), Candidate: [ 2  2  0  0  2  0  2  0  0  2 -1  1  2  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 139300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0 -1  0  1  0 -1  0  0  1  0 -1  1 -1] (Indices: [2, 5, 7, 8, 11, 12, 16, 17, 19]), Candidate: [2 2 0 0 2 0 2 0 0 1 1 1 0 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 139350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0 -1  0  0  1  0 -1  1  0 -1  0  1 -1] (Indices: [2, 5, 7, 8, 12, 13, 15, 16, 19]), Candidate: [2 2 0 0 2 0 2 0 0 1 0 2 1 0 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 139400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  1  0  0  0 -1  1  0 -1  0  0  0  0] (Indices: [2, 5, 7, 9, 10, 11, 12, 14, 15]), Candidate: [ 2  2  0  0  2  0  2 -1  2  1  0  1  0  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 139450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  1  0 -1  1  0  0  0 -1  0  0  0  0] (Indices: [2, 5, 7, 9, 10, 12, 13, 14, 15]), Candidate: [ 2  2  0  0  2  0  2 -1  2  1 -1  2  1  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 139500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  1  0 -1  0  1 -1  1 -1  0  1  0 -1] (Indices: [2, 5, 7, 9, 10, 13, 15, 18, 19]), Candidate: [ 2  2  0  0  2  0  2 -1  2  1 -1  1  2  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 139550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  1 -1  1  0 -1  0  1 -1  0  1  0 -1] (Indices: [2, 5, 7, 9, 11, 12, 15, 18, 19]), Candidate: [ 2  2  0  0  2  0  2 -1  2  0  1  1  0  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 139600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  1 -1  0  1  0 -1  1  0  0 -1  0  0] (Indices: [2, 5, 7, 9, 12, 13, 15, 16, 17]), Candidate: [ 2  2  0  0  2  0  2 -1  2  0  0  2  1  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 139650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  0  1  0  0  0  0 -1  0  0  0  1 -1] (Indices: [2, 5, 7, 10, 11, 12, 13, 14, 19]), Candidate: [ 2  2  0  0  2  0  2 -1  1  2  0  1  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 139700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  0  1  0 -1  1 -1  0  0  1  0  0 -1] (Indices: [2, 5, 7, 10, 11, 13, 17, 18, 19]), Candidate: [ 2  2  0  0  2  0  2 -1  1  2  0  0  2  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 139750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  0  1 -1  1 -1  0  0  1  0  0  0 -1] (Indices: [2, 5, 7, 10, 12, 16, 17, 18, 19]), Candidate: [ 2  2  0  0  2  0  2 -1  1  2 -1  2  0  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 139800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  0  0  1  0 -1  1 -1  1 -1  1  0 -1] (Indices: [2, 5, 7, 11, 12, 14, 16, 18, 19]), Candidate: [ 2  2  0  0  2  0  2 -1  1  1  1  1  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 139850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  0  0  0  0  1  0  0  0  0 -1  1 -1] (Indices: [2, 5, 7, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  2  0  0  2  0  2 -1  1  1  0  1  2  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 139900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1  0  0  0 -1  0  1 -1  0  1 -1  1 -1] (Indices: [2, 5, 8, 9, 10, 11, 14, 17, 19]), Candidate: [ 2  2  0  0  2  0  1  1  1  1  0  0  1  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 139950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1  0  0 -1  0  1  0  0 -1  0  0  1 -1] (Indices: [2, 5, 8, 9, 10, 13, 14, 15, 19]), Candidate: [ 2  2  0  0  2  0  1  1  1  1 -1  1  2  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 140000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1  0 -1  1  0 -1  1  0 -1  0  0  1 -1] (Indices: [2, 5, 8, 9, 11, 12, 14, 15, 19]), Candidate: [2 2 0 0 2 0 1 1 1 0 1 1 0 2 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 140050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1  0 -1  1 -1  0  0  1 -1  1  0  0 -1] (Indices: [2, 5, 8, 9, 11, 15, 17, 18, 19]), Candidate: [2 2 0 0 2 0 1 1 1 0 1 0 1 1 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 140100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1  0 -1  0  0  1 -1  1 -1  1  0  0 -1] (Indices: [2, 5, 8, 9, 13, 15, 17, 18, 19]), Candidate: [2 2 0 0 2 0 1 1 1 0 0 1 2 0 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 140150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1 -1  1  0 -1  1  0 -1  0  1  0 -1  0] (Indices: [2, 5, 8, 10, 11, 13, 14, 17, 18]), Candidate: [ 2  2  0  0  2  0  1  1  0  2  0  0  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 140200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1 -1  1 -1  1 -1  1  0  0 -1  0  1 -1] (Indices: [2, 5, 8, 10, 12, 14, 15, 16, 19]), Candidate: [ 2  2  0  0  2  0  1  1  0  2 -1  2  0  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 140250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1 -1  0  1  0  0 -1  0  1  0  0 -1  0] (Indices: [2, 5, 8, 11, 12, 13, 16, 17, 18]), Candidate: [2 2 0 0 2 0 1 1 0 1 1 1 1 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 140300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1 -1  0  0  1  0 -1  1  0  0  0 -1  0] (Indices: [2, 5, 8, 12, 13, 15, 16, 17, 18]), Candidate: [2 2 0 0 2 0 1 1 0 1 0 2 1 0 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 140350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  1  0  0  0 -1  0  0  1  0 -1  1 -1] (Indices: [2, 5, 9, 10, 11, 12, 16, 17, 19]), Candidate: [2 2 0 0 2 0 1 0 2 1 0 1 0 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 140400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  1  0 -1  1  0 -1  1  0 -1  0  1 -1] (Indices: [2, 5, 9, 10, 12, 13, 15, 16, 19]), Candidate: [ 2  2  0  0  2  0  1  0  2  1 -1  2  1  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 140450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  1 -1  1  0  0  0 -1  1 -1  0  1 -1] (Indices: [2, 5, 9, 11, 12, 13, 14, 16, 19]), Candidate: [ 2  2  0  0  2  0  1  0  2  0  1  1  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 140500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  1 -1  0  1  0  0  0  0  0 -1  0  0] (Indices: [2, 5, 9, 12, 13, 14, 15, 16, 17]), Candidate: [2 2 0 0 2 0 1 0 2 0 0 2 1 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 140550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  0  1  0  0 -1  1  0  0 -1  0  1 -1] (Indices: [2, 5, 10, 11, 12, 14, 15, 16, 19]), Candidate: [2 2 0 0 2 0 1 0 1 2 0 1 0 2 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 140600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  0  1 -1  1 -1  1  0  0  0 -1  1 -1] (Indices: [2, 5, 10, 12, 14, 15, 16, 17, 19]), Candidate: [ 2  2  0  0  2  0  1  0  1  2 -1  2  0  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 140650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0  0  0  0  0 -1  0  1 -1  0  0  0  0] (Indices: [2, 6, 7, 8, 9, 10, 11, 12, 15]), Candidate: [2 2 0 0 1 2 1 0 1 1 0 1 0 1 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 140700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0  0  0 -1  0  1  0 -1  0  0  1 -1  0] (Indices: [2, 6, 7, 8, 9, 10, 13, 14, 18]), Candidate: [ 2  2  0  0  1  2  1  0  1  1 -1  1  2  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 140750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0  0 -1  1  0 -1  0  0  0  1  0 -1  0] (Indices: [2, 6, 7, 8, 9, 11, 12, 17, 18]), Candidate: [2 2 0 0 1 2 1 0 1 0 1 1 0 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 140800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0  0 -1  0  1  0 -1  0  0  1  0 -1  0] (Indices: [2, 6, 7, 8, 9, 12, 13, 17, 18]), Candidate: [2 2 0 0 1 2 1 0 1 0 0 2 1 0 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 140850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0  0 -1  0  0  0  1 -1  1  0 -1  1 -1] (Indices: [2, 6, 7, 8, 9, 14, 16, 17, 19]), Candidate: [ 2  2  0  0  1  2  1  0  1  0  0  1  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 140900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0 -1  1  0 -1  0  1 -1  1 -1  0  1 -1] (Indices: [2, 6, 7, 8, 10, 11, 14, 16, 19]), Candidate: [ 2  2  0  0  1  2  1  0  0  2  0  0  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 140950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0 -1  1 -1  0  1  0  0 -1  1 -1  0  0] (Indices: [2, 6, 7, 8, 10, 13, 14, 15, 17]), Candidate: [ 2  2  0  0  1  2  1  0  0  2 -1  1  2  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 141000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0 -1  0  1  0 -1  1  0 -1  1 -1  0  0] (Indices: [2, 6, 7, 8, 11, 12, 14, 15, 17]), Candidate: [2 2 0 0 1 2 1 0 0 1 1 1 0 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 141050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0 -1  0  1 -1  0  0  1  0  0 -1  1 -1] (Indices: [2, 6, 7, 8, 11, 15, 16, 17, 19]), Candidate: [2 2 0 0 1 2 1 0 0 1 1 0 1 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 141100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0 -1  0  0  0  1 -1  1  0  0 -1  1 -1] (Indices: [2, 6, 7, 8, 13, 15, 16, 17, 19]), Candidate: [2 2 0 0 1 2 1 0 0 1 0 1 2 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 141150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  1  0  0 -1  0  1 -1  1  0 -1  0  0] (Indices: [2, 6, 7, 9, 10, 11, 14, 16, 17]), Candidate: [ 2  2  0  0  1  2  1 -1  2  1  0  0  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 141200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  1  0 -1  1 -1  0  0  0  1  0  0 -1] (Indices: [2, 6, 7, 9, 10, 12, 17, 18, 19]), Candidate: [ 2  2  0  0  1  2  1 -1  2  1 -1  2  0  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 141250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  1 -1  1  0  0 -1  0  0  0  1  0 -1] (Indices: [2, 6, 7, 9, 11, 12, 13, 18, 19]), Candidate: [ 2  2  0  0  1  2  1 -1  2  0  1  1  1  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 141300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  1 -1  1 -1  0  1 -1  0  1  0  0 -1] (Indices: [2, 6, 7, 9, 11, 14, 17, 18, 19]), Candidate: [ 2  2  0  0  1  2  1 -1  2  0  1  0  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 141350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  1 -1  0  0  1  0 -1  0  1  0  0 -1] (Indices: [2, 6, 7, 9, 13, 14, 17, 18, 19]), Candidate: [ 2  2  0  0  1  2  1 -1  2  0  0  1  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 141400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  0  1  0 -1  1  0  0 -1  0  0  1 -1] (Indices: [2, 6, 7, 10, 11, 13, 14, 15, 19]), Candidate: [ 2  2  0  0  1  2  1 -1  1  2  0  0  2  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 141450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  0  1 -1  1  0 -1  0  1 -1  1  0 -1] (Indices: [2, 6, 7, 10, 12, 13, 16, 18, 19]), Candidate: [ 2  2  0  0  1  2  1 -1  1  2 -1  2  1  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 141500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  0  0  1  0  0 -1  1  0 -1  0  1 -1] (Indices: [2, 6, 7, 11, 12, 13, 15, 16, 19]), Candidate: [ 2  2  0  0  1  2  1 -1  1  1  1  1  1  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 141550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  0  0  0  1  0  0 -1  1  0  0 -1  0] (Indices: [2, 6, 7, 12, 13, 14, 16, 17, 18]), Candidate: [ 2  2  0  0  1  2  1 -1  1  1  0  2  1  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 141600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1  0  0  0 -1  1 -1  1 -1  0  1 -1  0] (Indices: [2, 6, 8, 9, 10, 11, 13, 15, 18]), Candidate: [2 2 0 0 1 2 0 1 1 1 0 0 2 0 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 141650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1  0  0 -1  1 -1  1 -1  0  1  0 -1  0] (Indices: [2, 6, 8, 9, 10, 12, 14, 17, 18]), Candidate: [ 2  2  0  0  1  2  0  1  1  1 -1  2  0  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 141700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1  0 -1  1  0  0  0 -1  0  1 -1  0  0] (Indices: [2, 6, 8, 9, 11, 12, 13, 14, 17]), Candidate: [ 2  2  0  0  1  2  0  1  1  0  1  1  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 141750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1  0 -1  1 -1  1 -1  0  1  0 -1  1 -1] (Indices: [2, 6, 8, 9, 11, 13, 16, 17, 19]), Candidate: [2 2 0 0 1 2 0 1 1 0 1 0 2 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 141800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1  0 -1  0  1 -1  0  1  0 -1  1  0 -1] (Indices: [2, 6, 8, 9, 12, 15, 16, 18, 19]), Candidate: [2 2 0 0 1 2 0 1 1 0 0 2 0 1 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 141850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1 -1  1  0  0 -1  0  1  0 -1  1 -1  0] (Indices: [2, 6, 8, 10, 11, 12, 15, 16, 18]), Candidate: [2 2 0 0 1 2 0 1 0 2 0 1 0 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 141900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1 -1  1 -1  1  0  0 -1  1 -1  0  1 -1] (Indices: [2, 6, 8, 10, 12, 13, 14, 16, 19]), Candidate: [ 2  2  0  0  1  2  0  1  0  2 -1  2  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 141950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1 -1  0  1  0  0  0  0  0 -1  0  0  0] (Indices: [2, 6, 8, 11, 12, 13, 14, 15, 16]), Candidate: [2 2 0 0 1 2 0 1 0 1 1 1 1 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 142000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1 -1  0  1 -1  0  1  0  0  0  0 -1  0] (Indices: [2, 6, 8, 11, 14, 15, 16, 17, 18]), Candidate: [2 2 0 0 1 2 0 1 0 1 1 0 1 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 142050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  1  0  0  0 -1  1  0 -1  1 -1  0  0] (Indices: [2, 6, 9, 10, 11, 12, 14, 15, 17]), Candidate: [2 2 0 0 1 2 0 0 2 1 0 1 0 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 142100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  1  0  0 -1  0  0  1  0  0 -1  1 -1] (Indices: [2, 6, 9, 10, 11, 15, 16, 17, 19]), Candidate: [2 2 0 0 1 2 0 0 2 1 0 0 1 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 142150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  1  0 -1  0  1 -1  1  0  0 -1  1 -1] (Indices: [2, 6, 9, 10, 13, 15, 16, 17, 19]), Candidate: [ 2  2  0  0  1  2  0  0  2  1 -1  1  2  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 142200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  1 -1  1 -1  1  0  0 -1  0  1  0 -1] (Indices: [2, 6, 9, 11, 13, 14, 15, 18, 19]), Candidate: [2 2 0 0 1 2 0 0 2 0 1 0 2 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 142250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  0  1  0  0  0  0 -1  1 -1  0  1 -1] (Indices: [2, 6, 10, 11, 12, 13, 14, 16, 19]), Candidate: [ 2  2  0  0  1  2  0  0  1  2  0  1  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 142300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  0  1 -1  1  0  0  0  0  0 -1  0  0] (Indices: [2, 6, 10, 12, 13, 14, 15, 16, 17]), Candidate: [ 2  2  0  0  1  2  0  0  1  2 -1  2  1  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 142350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  0  0  1 -1  1  0  0  0  0 -1  1 -1] (Indices: [2, 6, 11, 13, 14, 15, 16, 17, 19]), Candidate: [2 2 0 0 1 2 0 0 1 1 1 0 2 1 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 142400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0  0  0  0 -1  0  1  0  0 -1  0  0  0] (Indices: [2, 7, 8, 9, 10, 11, 14, 15, 16]), Candidate: [2 2 0 0 1 1 2 0 1 1 0 0 1 2 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 142450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0  0  0 -1  1 -1  0  1 -1  0  1  0 -1] (Indices: [2, 7, 8, 9, 10, 12, 15, 18, 19]), Candidate: [ 2  2  0  0  1  1  2  0  1  1 -1  2  0  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 142500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0  0 -1  1  0  0 -1  0  1 -1  1 -1  0] (Indices: [2, 7, 8, 9, 11, 12, 13, 16, 18]), Candidate: [2 2 0 0 1 1 2 0 1 0 1 1 1 0 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 142550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0  0 -1  1 -1  0  1  0 -1  0  1  0 -1] (Indices: [2, 7, 8, 9, 11, 14, 15, 18, 19]), Candidate: [2 2 0 0 1 1 2 0 1 0 1 0 1 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 142600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0  0 -1  0  0  1  0  0 -1  0  1  0 -1] (Indices: [2, 7, 8, 9, 13, 14, 15, 18, 19]), Candidate: [2 2 0 0 1 1 2 0 1 0 0 1 2 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 142650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0 -1  1  0  0 -1  0  0  0  1  0  0 -1] (Indices: [2, 7, 8, 10, 11, 12, 17, 18, 19]), Candidate: [2 2 0 0 1 1 2 0 0 2 0 1 0 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 142700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0 -1  1 -1  1  0 -1  1 -1  1 -1  1 -1] (Indices: [2, 7, 8, 10, 12, 13, 15, 17, 19]), Candidate: [ 2  2  0  0  1  1  2  0  0  2 -1  2  1  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 142750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0 -1  0  1  0  0  0 -1  0  1 -1  1 -1] (Indices: [2, 7, 8, 11, 12, 13, 14, 17, 19]), Candidate: [ 2  2  0  0  1  1  2  0  0  1  1  1  1  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 142800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0 -1  0  0  1  0  0  0  0 -1  0  1 -1] (Indices: [2, 7, 8, 12, 13, 14, 15, 16, 19]), Candidate: [2 2 0 0 1 1 2 0 0 1 0 2 1 1 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 142850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  1  0  0  0 -1  1 -1  0  0  1  0 -1] (Indices: [2, 7, 9, 10, 11, 12, 14, 18, 19]), Candidate: [ 2  2  0  0  1  1  2 -1  2  1  0  1  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 142900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  1  0 -1  1  0  0 -1  1  0 -1  0  0] (Indices: [2, 7, 9, 10, 12, 13, 14, 16, 17]), Candidate: [ 2  2  0  0  1  1  2 -1  2  1 -1  2  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 142950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  1  0 -1  0  0  1 -1  1  0  0  0 -1] (Indices: [2, 7, 9, 10, 14, 16, 17, 18, 19]), Candidate: [ 2  2  0  0  1  1  2 -1  2  1 -1  1  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 143000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  1 -1  1 -1  1 -1  1 -1  1  0  0 -1] (Indices: [2, 7, 9, 11, 13, 15, 17, 18, 19]), Candidate: [ 2  2  0  0  1  1  2 -1  2  0  1  0  2  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 143050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  0  1  0  0  0 -1  1 -1  1 -1  1 -1] (Indices: [2, 7, 10, 11, 12, 13, 15, 17, 19]), Candidate: [ 2  2  0  0  1  1  2 -1  1  2  0  1  1  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 143100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  0  1 -1  1  0  0 -1  1 -1  1  0 -1] (Indices: [2, 7, 10, 12, 13, 14, 16, 18, 19]), Candidate: [ 2  2  0  0  1  1  2 -1  1  2 -1  2  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 143150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  0  0  0  1  0  0  0  0 -1  1  0 -1] (Indices: [2, 7, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  2  0  0  1  1  2 -1  1  1  0  2  1  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 143200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1  0  0  0 -1  1  0 -1  0  0  1  0 -1] (Indices: [2, 8, 9, 10, 11, 13, 14, 18, 19]), Candidate: [ 2  2  0  0  1  1  1  1  1  1  0  0  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 143250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1  0  0 -1  1 -1  1  0 -1  1 -1  1 -1] (Indices: [2, 8, 9, 10, 12, 14, 15, 17, 19]), Candidate: [ 2  2  0  0  1  1  1  1  1  1 -1  2  0  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 143300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1  0 -1  1  0  0 -1  0  1 -1  1  0 -1] (Indices: [2, 8, 9, 11, 12, 13, 16, 18, 19]), Candidate: [2 2 0 0 1 1 1 1 1 0 1 1 1 0 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 143350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1  0 -1  0  1  0 -1  1  0 -1  1  0 -1] (Indices: [2, 8, 9, 12, 13, 15, 16, 18, 19]), Candidate: [2 2 0 0 1 1 1 1 1 0 0 2 1 0 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 143400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1 -1  1  0  0 -1  0  0  1  0  0  0 -1] (Indices: [2, 8, 10, 11, 12, 16, 17, 18, 19]), Candidate: [2 2 0 0 1 1 1 1 0 2 0 1 0 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 143450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1 -1  0  1  0  0  0  0  0  0 -1  0  0] (Indices: [2, 8, 11, 12, 13, 14, 15, 16, 17]), Candidate: [2 2 0 0 1 1 1 1 0 1 1 1 1 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 143500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  1  0  0  0  0 -1  1 -1  1 -1  1 -1] (Indices: [2, 9, 10, 11, 12, 13, 15, 17, 19]), Candidate: [2 2 0 0 1 1 1 0 2 1 0 1 1 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 143550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  1  0 -1  1  0  0 -1  1 -1  1  0 -1] (Indices: [2, 9, 10, 12, 13, 14, 16, 18, 19]), Candidate: [ 2  2  0  0  1  1  1  0  2  1 -1  2  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 143600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  1 -1  0  1  0  0  0  0 -1  1  0 -1] (Indices: [2, 9, 12, 13, 14, 15, 16, 18, 19]), Candidate: [2 2 0 0 1 1 1 0 2 0 0 2 1 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 143650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 -1] (Indices: [2, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 2 0 0 1 1 1 0 1 1 0 2 1 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 143700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0 -1  1  0 -1  0  0  0  1 -1  0  0  0] (Indices: [3, 4, 5, 6, 7, 8, 10, 11, 16]), Candidate: [2 1 2 0 1 1 1 0 0 2 0 0 1 1 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 143750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0 -1  0  1 -1  0  0  1  0 -1  0  0  0] (Indices: [3, 4, 5, 6, 7, 8, 11, 15, 16]), Candidate: [2 1 2 0 1 1 1 0 0 1 1 0 1 1 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 143800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0 -1  0  0  0  0  1 -1  1  0 -1  0  0] (Indices: [3, 4, 5, 6, 7, 8, 14, 16, 17]), Candidate: [ 2  1  2  0  1  1  1  0  0  1  0  1  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 143850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  1  0 -1  0  0  0  0  0  1 -1  1 -1] (Indices: [3, 4, 5, 6, 7, 9, 10, 17, 19]), Candidate: [ 2  1  2  0  1  1  1 -1  2  1 -1  1  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 143900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  1 -1  0  1 -1  0  0  0  0  1  0 -1] (Indices: [3, 4, 5, 6, 7, 9, 12, 18, 19]), Candidate: [ 2  1  2  0  1  1  1 -1  2  0  0  2  0  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 143950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  0  1  0 -1  0  1 -1  1 -1  0  0  0] (Indices: [3, 4, 5, 6, 7, 10, 11, 14, 16]), Candidate: [ 2  1  2  0  1  1  1 -1  1  2  0  0  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 144000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  0  1 -1  0  0  1  0  0 -1  0  0  0] (Indices: [3, 4, 5, 6, 7, 10, 14, 15, 16]), Candidate: [ 2  1  2  0  1  1  1 -1  1  2 -1  1  1  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 144050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  0  0  1 -1  1 -1  0  1  0 -1  0  0] (Indices: [3, 4, 5, 6, 7, 11, 13, 16, 17]), Candidate: [ 2  1  2  0  1  1  1 -1  1  1  1  0  2  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 144100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  0  0  0  1 -1  1 -1  0  0  1  0 -1] (Indices: [3, 4, 5, 6, 7, 12, 14, 18, 19]), Candidate: [ 2  1  2  0  1  1  1 -1  1  1  0  2  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 144150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1  0  0  0 -1  0  0  0  1 -1  0  0  0] (Indices: [3, 4, 5, 6, 8, 9, 10, 11, 16]), Candidate: [2 1 2 0 1 1 0 1 1 1 0 0 1 1 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 144200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1  0 -1  1 -1  0  0  1  0 -1  0  0  0] (Indices: [3, 4, 5, 6, 8, 9, 11, 15, 16]), Candidate: [2 1 2 0 1 1 0 1 1 0 1 0 1 1 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 144250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1  0 -1  0  0  0  1 -1  1  0 -1  0  0] (Indices: [3, 4, 5, 6, 8, 9, 14, 16, 17]), Candidate: [ 2  1  2  0  1  1  0  1  1  0  0  1  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 144300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1 -1  1 -1  1 -1  1  0 -1  0  0  0  0] (Indices: [3, 4, 5, 6, 8, 10, 12, 14, 15]), Candidate: [ 2  1  2  0  1  1  0  1  0  2 -1  2  0  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 144350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1 -1  0  1  0  0  0 -1  0  0  0  0  0] (Indices: [3, 4, 5, 6, 8, 11, 12, 13, 14]), Candidate: [ 2  1  2  0  1  1  0  1  0  1  1  1  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 144400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1 -1  0  1 -1  0  0  1 -1  1 -1  1 -1] (Indices: [3, 4, 5, 6, 8, 11, 15, 17, 19]), Candidate: [2 1 2 0 1 1 0 1 0 1 1 0 1 1 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 144450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1 -1  0  0  0  1  0 -1  0  0  1  0 -1] (Indices: [3, 4, 5, 6, 8, 13, 14, 18, 19]), Candidate: [ 2  1  2  0  1  1  0  1  0  1  0  1  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 144500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  1  0  0 -1  0  0  0  1 -1  0  1 -1] (Indices: [3, 4, 5, 6, 9, 10, 11, 16, 19]), Candidate: [2 1 2 0 1 1 0 0 2 1 0 0 1 1 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 144550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  1  0 -1  0  0  0  1  0  0 -1  0  0] (Indices: [3, 4, 5, 6, 9, 10, 15, 16, 17]), Candidate: [ 2  1  2  0  1  1  0  0  2  1 -1  1  1  1  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 144600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  1 -1  1 -1  0  1 -1  1  0 -1  0  0] (Indices: [3, 4, 5, 6, 9, 11, 14, 16, 17]), Candidate: [ 2  1  2  0  1  1  0  0  2  0  1  0  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 144650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  1 -1  0  1 -1  0  0  0  1  0  0 -1] (Indices: [3, 4, 5, 6, 9, 12, 17, 18, 19]), Candidate: [2 1 2 0 1 1 0 0 2 0 0 2 0 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 144700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  0  1  0  0 -1  0  1 -1  0  0  1 -1] (Indices: [3, 4, 5, 6, 10, 11, 12, 15, 19]), Candidate: [2 1 2 0 1 1 0 0 1 2 0 1 0 1 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 144750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  0  1 -1  1  0 -1  1 -1  0  0  1 -1] (Indices: [3, 4, 5, 6, 10, 12, 13, 15, 19]), Candidate: [ 2  1  2  0  1  1  0  0  1  2 -1  2  1  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 144800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  0  1 -1  0  0  1  0 -1  1  0 -1  0] (Indices: [3, 4, 5, 6, 10, 14, 15, 17, 18]), Candidate: [ 2  1  2  0  1  1  0  0  1  2 -1  1  1  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 144850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  0  0  1 -1  1  0  0 -1  0  0  1 -1] (Indices: [3, 4, 5, 6, 11, 13, 14, 15, 19]), Candidate: [2 1 2 0 1 1 0 0 1 1 1 0 2 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 144900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  0  0  0  1  0 -1  0  1 -1  1  0 -1] (Indices: [3, 4, 5, 6, 12, 13, 16, 18, 19]), Candidate: [2 1 2 0 1 1 0 0 1 1 0 2 1 0 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 144950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0  0  0 -1  1 -1  0  0  0  1 -1  0  0] (Indices: [3, 4, 5, 7, 8, 9, 10, 12, 17]), Candidate: [ 2  1  2  0  1  0  2  0  1  1 -1  2  0  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 145000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0  0 -1  1 -1  0  0  0  0  1 -1  1 -1] (Indices: [3, 4, 5, 7, 8, 9, 11, 17, 19]), Candidate: [2 1 2 0 1 0 2 0 1 0 1 0 1 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 145050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0  0 -1  0  0  0  0  1  0 -1  0  1 -1] (Indices: [3, 4, 5, 7, 8, 9, 15, 16, 19]), Candidate: [2 1 2 0 1 0 2 0 1 0 0 1 1 1 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 145100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0 -1  1 -1  1 -1  0  1 -1  0  0  1 -1] (Indices: [3, 4, 5, 7, 8, 10, 12, 15, 19]), Candidate: [ 2  1  2  0  1  0  2  0  0  2 -1  2  0  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 145150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0 -1  0  1  0 -1  1 -1  0  1 -1  0  0] (Indices: [3, 4, 5, 7, 8, 11, 12, 14, 17]), Candidate: [ 2  1  2  0  1  0  2  0  0  1  1  1  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 145200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0 -1  0  0  1  0  0 -1  0  1 -1  0  0] (Indices: [3, 4, 5, 7, 8, 12, 13, 14, 17]), Candidate: [ 2  1  2  0  1  0  2  0  0  1  0  2  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 145250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0 -1  0  0  0  1 -1  0  1  0 -1  1 -1] (Indices: [3, 4, 5, 7, 8, 13, 16, 17, 19]), Candidate: [2 1 2 0 1 0 2 0 0 1 0 1 2 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 145300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  1  0 -1  1  0 -1  0  0  0  1 -1  0] (Indices: [3, 4, 5, 7, 9, 10, 12, 13, 18]), Candidate: [ 2  1  2  0  1  0  2 -1  2  1 -1  2  1  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 145350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  1  0 -1  0  0  0  0  1 -1  1  0 -1] (Indices: [3, 4, 5, 7, 9, 10, 16, 18, 19]), Candidate: [ 2  1  2  0  1  0  2 -1  2  1 -1  1  1  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 145400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  1 -1  1 -1  0  0  1  0 -1  0  1 -1] (Indices: [3, 4, 5, 7, 9, 11, 15, 16, 19]), Candidate: [ 2  1  2  0  1  0  2 -1  2  0  1  0  1  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 145450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  1 -1  0  0  1  0 -1  0  1  0 -1  0] (Indices: [3, 4, 5, 7, 9, 13, 14, 17, 18]), Candidate: [ 2  1  2  0  1  0  2 -1  2  0  0  1  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 145500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  0  1  0 -1  1  0 -1  1 -1  0  0  0] (Indices: [3, 4, 5, 7, 10, 11, 13, 14, 16]), Candidate: [ 2  1  2  0  1  0  2 -1  1  2  0  0  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 145550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  0  1 -1  1 -1  1  0 -1  1 -1  0  0] (Indices: [3, 4, 5, 7, 10, 12, 14, 15, 17]), Candidate: [ 2  1  2  0  1  0  2 -1  1  2 -1  2  0  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 145600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  0  1 -1  0  0  0  1  0  0 -1  1 -1] (Indices: [3, 4, 5, 7, 10, 15, 16, 17, 19]), Candidate: [ 2  1  2  0  1  0  2 -1  1  2 -1  1  1  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 145650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  0  0  1 -1  1 -1  1  0 -1  1 -1  0] (Indices: [3, 4, 5, 7, 11, 13, 15, 16, 18]), Candidate: [ 2  1  2  0  1  0  2 -1  1  1  1  0  2  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 145700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  0  0  0  1 -1  1 -1  1  0  0 -1  0] (Indices: [3, 4, 5, 7, 12, 14, 16, 17, 18]), Candidate: [ 2  1  2  0  1  0  2 -1  1  1  0  2  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 145750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1  0  0  0 -1  0  0  1 -1  0  1 -1  0] (Indices: [3, 4, 5, 8, 9, 10, 11, 15, 18]), Candidate: [2 1 2 0 1 0 1 1 1 1 0 0 1 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 145800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1  0  0 -1  0  0  1 -1  1 -1  0  1 -1] (Indices: [3, 4, 5, 8, 9, 10, 14, 16, 19]), Candidate: [ 2  1  2  0  1  0  1  1  1  1 -1  1  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 145850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1  0 -1  1 -1  0  1  0  0 -1  0  0  0] (Indices: [3, 4, 5, 8, 9, 11, 14, 15, 16]), Candidate: [2 1 2 0 1 0 1 1 1 0 1 0 1 2 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 145900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1  0 -1  0  1 -1  0  1 -1  0  1  0 -1] (Indices: [3, 4, 5, 8, 9, 12, 15, 18, 19]), Candidate: [2 1 2 0 1 0 1 1 1 0 0 2 0 1 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 145950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1 -1  1  0  0 -1  1 -1  0  0  0  1 -1] (Indices: [3, 4, 5, 8, 10, 11, 12, 14, 19]), Candidate: [ 2  1  2  0  1  0  1  1  0  2  0  1  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 146000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1 -1  1 -1  1  0  0 -1  0  0  0  1 -1] (Indices: [3, 4, 5, 8, 10, 12, 13, 14, 19]), Candidate: [ 2  1  2  0  1  0  1  1  0  2 -1  2  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 146050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1 -1  1 -1  0  1 -1  0  0  1  0  0 -1] (Indices: [3, 4, 5, 8, 10, 13, 17, 18, 19]), Candidate: [ 2  1  2  0  1  0  1  1  0  2 -1  1  2  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 146100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1 -1  0  1  0 -1  0  0  0  1  0  0 -1] (Indices: [3, 4, 5, 8, 11, 12, 17, 18, 19]), Candidate: [2 1 2 0 1 0 1 1 0 1 1 1 0 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 146150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1 -1  0  0  1  0 -1  1 -1  1 -1  1 -1] (Indices: [3, 4, 5, 8, 12, 13, 15, 17, 19]), Candidate: [2 1 2 0 1 0 1 1 0 1 0 2 1 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 146200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  1  0  0  0 -1  1 -1  0  1 -1  0  0] (Indices: [3, 4, 5, 9, 10, 11, 12, 14, 17]), Candidate: [ 2  1  2  0  1  0  1  0  2  1  0  1  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 146250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  1  0 -1  1  0  0 -1  0  1 -1  0  0] (Indices: [3, 4, 5, 9, 10, 12, 13, 14, 17]), Candidate: [ 2  1  2  0  1  0  1  0  2  1 -1  2  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 146300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  1  0 -1  0  1 -1  0  1  0 -1  1 -1] (Indices: [3, 4, 5, 9, 10, 13, 16, 17, 19]), Candidate: [ 2  1  2  0  1  0  1  0  2  1 -1  1  2  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 146350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  1 -1  1  0 -1  0  0  1  0 -1  1 -1] (Indices: [3, 4, 5, 9, 11, 12, 16, 17, 19]), Candidate: [2 1 2 0 1 0 1 0 2 0 1 1 0 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 146400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  1 -1  0  1  0 -1  1  0 -1  0  1 -1] (Indices: [3, 4, 5, 9, 12, 13, 15, 16, 19]), Candidate: [2 1 2 0 1 0 1 0 2 0 0 2 1 0 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 146450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  0  1  0  0  0 -1  1 -1  1 -1  0  0] (Indices: [3, 4, 5, 10, 11, 12, 13, 15, 17]), Candidate: [2 1 2 0 1 0 1 0 1 2 0 1 1 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 146500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  0  1  0 -1  0  1  0  0 -1  1 -1  0] (Indices: [3, 4, 5, 10, 11, 14, 15, 16, 18]), Candidate: [2 1 2 0 1 0 1 0 1 2 0 0 1 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 146550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  0  1 -1  0  1  0  0  0 -1  1 -1  0] (Indices: [3, 4, 5, 10, 13, 14, 15, 16, 18]), Candidate: [ 2  1  2  0  1  0  1  0  1  2 -1  1  2  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 146600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  0  0  1  0 -1  0  1  0  0  0 -1  0] (Indices: [3, 4, 5, 11, 12, 15, 16, 17, 18]), Candidate: [2 1 2 0 1 0 1 0 1 1 1 1 0 1 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 146650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  0  0  0  0  1  0  0 -1  1  0  0 -1] (Indices: [3, 4, 5, 13, 14, 15, 17, 18, 19]), Candidate: [2 1 2 0 1 0 1 0 1 1 0 1 2 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 146700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0  0 -1  1 -1  1 -1  0  0  1 -1  0  0] (Indices: [3, 4, 6, 7, 8, 9, 11, 13, 17]), Candidate: [2 1 2 0 0 2 1 0 1 0 1 0 2 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 146750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0  0 -1  0  0  1 -1  0  1 -1  0  1 -1] (Indices: [3, 4, 6, 7, 8, 9, 13, 16, 19]), Candidate: [2 1 2 0 0 2 1 0 1 0 0 1 2 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 146800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0 -1  1  0 -1  0  0  0  0  1 -1  1 -1] (Indices: [3, 4, 6, 7, 8, 10, 11, 17, 19]), Candidate: [2 1 2 0 0 2 1 0 0 2 0 0 1 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 146850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0 -1  1 -1  0  0  0  1  0 -1  0  1 -1] (Indices: [3, 4, 6, 7, 8, 10, 15, 16, 19]), Candidate: [ 2  1  2  0  0  2  1  0  0  2 -1  1  1  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 146900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0 -1  0  1 -1  0  1 -1  1 -1  0  1 -1] (Indices: [3, 4, 6, 7, 8, 11, 14, 16, 19]), Candidate: [ 2  1  2  0  0  2  1  0  0  1  1  0  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 146950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0 -1  0  0  0  1  0  0 -1  1 -1  0  0] (Indices: [3, 4, 6, 7, 8, 13, 14, 15, 17]), Candidate: [2 1 2 0 0 2 1 0 0 1 0 1 2 1 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 147000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  1  0  0 -1  0  1 -1  0  0  1 -1  0] (Indices: [3, 4, 6, 7, 9, 10, 11, 14, 18]), Candidate: [ 2  1  2  0  0  2  1 -1  2  1  0  0  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 147050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  1  0 -1  0  0  1  0 -1  0  1 -1  0] (Indices: [3, 4, 6, 7, 9, 10, 14, 15, 18]), Candidate: [ 2  1  2  0  0  2  1 -1  2  1 -1  1  1  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 147100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  1 -1  1 -1  1 -1  0  1 -1  0  1 -1] (Indices: [3, 4, 6, 7, 9, 11, 13, 16, 19]), Candidate: [ 2  1  2  0  0  2  1 -1  2  0  1  0  2  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 147150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  1 -1  0  1 -1  0  1  0 -1  1 -1  0] (Indices: [3, 4, 6, 7, 9, 12, 15, 16, 18]), Candidate: [ 2  1  2  0  0  2  1 -1  2  0  0  2  0  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 147200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  0  1  0  0 -1  1  0 -1  0  0  0  0] (Indices: [3, 4, 6, 7, 10, 11, 12, 14, 15]), Candidate: [ 2  1  2  0  0  2  1 -1  1  2  0  1  0  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 147250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  0  1 -1  1  0  0  0 -1  0  0  0  0] (Indices: [3, 4, 6, 7, 10, 12, 13, 14, 15]), Candidate: [ 2  1  2  0  0  2  1 -1  1  2 -1  2  1  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 147300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  0  1 -1  0  1 -1  1 -1  0  1  0 -1] (Indices: [3, 4, 6, 7, 10, 13, 15, 18, 19]), Candidate: [ 2  1  2  0  0  2  1 -1  1  2 -1  1  2  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 147350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  0  0  1  0 -1  0  1 -1  0  1  0 -1] (Indices: [3, 4, 6, 7, 11, 12, 15, 18, 19]), Candidate: [ 2  1  2  0  0  2  1 -1  1  1  1  1  0  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 147400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  0  0  0  1  0 -1  1  0  0 -1  0  0] (Indices: [3, 4, 6, 7, 12, 13, 15, 16, 17]), Candidate: [ 2  1  2  0  0  2  1 -1  1  1  0  2  1  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 147450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1  0  0  0  0 -1  0  0  0  1 -1  0  0] (Indices: [3, 4, 6, 8, 9, 10, 11, 12, 17]), Candidate: [2 1 2 0 0 2 0 1 1 1 0 1 0 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 147500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1  0  0 -1  0  1 -1  1  0 -1  0  0  0] (Indices: [3, 4, 6, 8, 9, 10, 13, 15, 16]), Candidate: [ 2  1  2  0  0  2  0  1  1  1 -1  1  2  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 147550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1  0 -1  1  0 -1  0  0  0  0  1  0 -1] (Indices: [3, 4, 6, 8, 9, 11, 12, 18, 19]), Candidate: [2 1 2 0 0 2 0 1 1 0 1 1 0 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 147600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1  0 -1  0  1  0 -1  0  0  0  1  0 -1] (Indices: [3, 4, 6, 8, 9, 12, 13, 18, 19]), Candidate: [2 1 2 0 0 2 0 1 1 0 0 2 1 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 147650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1  0 -1  0  0  0  1 -1  0  1  0  0 -1] (Indices: [3, 4, 6, 8, 9, 14, 17, 18, 19]), Candidate: [ 2  1  2  0  0  2  0  1  1  0  0  1  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 147700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1 -1  1  0 -1  0  1 -1  0  1 -1  1 -1] (Indices: [3, 4, 6, 8, 10, 11, 14, 17, 19]), Candidate: [ 2  1  2  0  0  2  0  1  0  2  0  0  1  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 147750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1 -1  1 -1  0  1  0  0 -1  0  0  1 -1] (Indices: [3, 4, 6, 8, 10, 13, 14, 15, 19]), Candidate: [ 2  1  2  0  0  2  0  1  0  2 -1  1  2  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 147800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1 -1  0  1  0 -1  1  0 -1  0  0  1 -1] (Indices: [3, 4, 6, 8, 11, 12, 14, 15, 19]), Candidate: [2 1 2 0 0 2 0 1 0 1 1 1 0 2 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 147850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1 -1  0  1 -1  0  0  1 -1  1  0  0 -1] (Indices: [3, 4, 6, 8, 11, 15, 17, 18, 19]), Candidate: [2 1 2 0 0 2 0 1 0 1 1 0 1 1 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 147900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1 -1  0  0  0  1 -1  1 -1  1  0  0 -1] (Indices: [3, 4, 6, 8, 13, 15, 17, 18, 19]), Candidate: [2 1 2 0 0 2 0 1 0 1 0 1 2 0 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 147950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  1  0  0 -1  0  1 -1  1 -1  0  1 -1] (Indices: [3, 4, 6, 9, 10, 11, 14, 16, 19]), Candidate: [ 2  1  2  0  0  2  0  0  2  1  0  0  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 148000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  1  0 -1  0  1  0  0 -1  1 -1  0  0] (Indices: [3, 4, 6, 9, 10, 13, 14, 15, 17]), Candidate: [ 2  1  2  0  0  2  0  0  2  1 -1  1  2  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 148050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  1 -1  1  0 -1  1  0 -1  1 -1  0  0] (Indices: [3, 4, 6, 9, 11, 12, 14, 15, 17]), Candidate: [2 1 2 0 0 2 0 0 2 0 1 1 0 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 148100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  1 -1  1 -1  0  0  1  0  0 -1  1 -1] (Indices: [3, 4, 6, 9, 11, 15, 16, 17, 19]), Candidate: [2 1 2 0 0 2 0 0 2 0 1 0 1 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 148150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  1 -1  0  0  1 -1  1  0  0 -1  1 -1] (Indices: [3, 4, 6, 9, 13, 15, 16, 17, 19]), Candidate: [2 1 2 0 0 2 0 0 2 0 0 1 2 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 148200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  0  1  0 -1  1  0 -1  1 -1  1 -1  0] (Indices: [3, 4, 6, 10, 11, 13, 14, 16, 18]), Candidate: [ 2  1  2  0  0  2  0  0  1  2  0  0  2  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 148250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  0  1 -1  1 -1  1  0  0  0 -1  0  0] (Indices: [3, 4, 6, 10, 12, 14, 15, 16, 17]), Candidate: [ 2  1  2  0  0  2  0  0  1  2 -1  2  0  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 148300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  0  0  1  0  0 -1  1 -1  1 -1  1 -1] (Indices: [3, 4, 6, 11, 12, 13, 15, 17, 19]), Candidate: [2 1 2 0 0 2 0 0 1 1 1 1 1 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 148350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  0  0  0  1  0  0 -1  1 -1  1  0 -1] (Indices: [3, 4, 6, 12, 13, 14, 16, 18, 19]), Candidate: [ 2  1  2  0  0  2  0  0  1  1  0  2  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 148400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0  0  0 -1  1  0 -1  0  1 -1  0  0  0] (Indices: [3, 4, 7, 8, 9, 10, 12, 13, 16]), Candidate: [ 2  1  2  0  0  1  2  0  1  1 -1  2  1  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 148450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0  0  0 -1  0  0  0  0  1  0  0 -1  0] (Indices: [3, 4, 7, 8, 9, 10, 16, 17, 18]), Candidate: [ 2  1  2  0  0  1  2  0  1  1 -1  1  1  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 148500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0  0 -1  1 -1  0  0  1  0  0 -1  0  0] (Indices: [3, 4, 7, 8, 9, 11, 15, 16, 17]), Candidate: [2 1 2 0 0 1 2 0 1 0 1 0 1 1 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 148550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0  0 -1  0  0  1  0 -1  1 -1  1 -1  0] (Indices: [3, 4, 7, 8, 9, 13, 14, 16, 18]), Candidate: [ 2  1  2  0  0  1  2  0  1  0  0  1  2  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 148600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0 -1  1  0  0 -1  0  0  0  0  1  0 -1] (Indices: [3, 4, 7, 8, 10, 11, 12, 18, 19]), Candidate: [2 1 2 0 0 1 2 0 0 2 0 1 0 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 148650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0 -1  1 -1  1  0 -1  0  0  0  1  0 -1] (Indices: [3, 4, 7, 8, 10, 12, 13, 18, 19]), Candidate: [ 2  1  2  0  0  1  2  0  0  2 -1  2  1  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 148700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0 -1  1 -1  0  0  1 -1  0  1  0  0 -1] (Indices: [3, 4, 7, 8, 10, 14, 17, 18, 19]), Candidate: [ 2  1  2  0  0  1  2  0  0  2 -1  1  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 148750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0 -1  0  1 -1  1  0 -1  0  0  1  0 -1] (Indices: [3, 4, 7, 8, 11, 13, 14, 18, 19]), Candidate: [ 2  1  2  0  0  1  2  0  0  1  1  0  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 148800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0 -1  0  0  1 -1  1  0 -1  1 -1  1 -1] (Indices: [3, 4, 7, 8, 12, 14, 15, 17, 19]), Candidate: [2 1 2 0 0 1 2 0 0 1 0 2 0 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 148850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  1  0  0  0 -1  0  0  0  1  0 -1  0] (Indices: [3, 4, 7, 9, 10, 11, 12, 17, 18]), Candidate: [ 2  1  2  0  0  1  2 -1  2  1  0  1  0  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 148900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  1  0 -1  1  0 -1  0  0  1  0 -1  0] (Indices: [3, 4, 7, 9, 10, 12, 13, 17, 18]), Candidate: [ 2  1  2  0  0  1  2 -1  2  1 -1  2  1  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 148950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  1  0 -1  0  0  1 -1  1  0 -1  1 -1] (Indices: [3, 4, 7, 9, 10, 14, 16, 17, 19]), Candidate: [ 2  1  2  0  0  1  2 -1  2  1 -1  1  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 149000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  1 -1  1 -1  1  0 -1  0  1  0 -1  0] (Indices: [3, 4, 7, 9, 11, 13, 14, 17, 18]), Candidate: [ 2  1  2  0  0  1  2 -1  2  0  1  0  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 149050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  1 -1  0  1 -1  1  0  0 -1  0  1 -1] (Indices: [3, 4, 7, 9, 12, 14, 15, 16, 19]), Candidate: [ 2  1  2  0  0  1  2 -1  2  0  0  2  0  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 149100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  0  1  0  0 -1  1  0 -1  1 -1  0  0] (Indices: [3, 4, 7, 10, 11, 12, 14, 15, 17]), Candidate: [ 2  1  2  0  0  1  2 -1  1  2  0  1  0  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 149150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  0  1  0 -1  0  0  1  0  0 -1  1 -1] (Indices: [3, 4, 7, 10, 11, 15, 16, 17, 19]), Candidate: [ 2  1  2  0  0  1  2 -1  1  2  0  0  1  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 149200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  0  1 -1  0  1 -1  1  0  0 -1  1 -1] (Indices: [3, 4, 7, 10, 13, 15, 16, 17, 19]), Candidate: [ 2  1  2  0  0  1  2 -1  1  2 -1  1  2  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 149250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  0  0  1 -1  1  0  0 -1  0  1  0 -1] (Indices: [3, 4, 7, 11, 13, 14, 15, 18, 19]), Candidate: [ 2  1  2  0  0  1  2 -1  1  1  1  0  2  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 149300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1  0  0  0  0 -1  1  0 -1  0  0  0  0] (Indices: [3, 4, 8, 9, 10, 11, 12, 14, 15]), Candidate: [2 1 2 0 0 1 1 1 1 1 0 1 0 2 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 149350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1  0  0 -1  1  0  0  0 -1  0  0  0  0] (Indices: [3, 4, 8, 9, 10, 12, 13, 14, 15]), Candidate: [ 2  1  2  0  0  1  1  1  1  1 -1  2  1  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 149400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1  0  0 -1  0  1 -1  1 -1  0  1  0 -1] (Indices: [3, 4, 8, 9, 10, 13, 15, 18, 19]), Candidate: [ 2  1  2  0  0  1  1  1  1  1 -1  1  2  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 149450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1  0 -1  1  0 -1  0  1 -1  0  1  0 -1] (Indices: [3, 4, 8, 9, 11, 12, 15, 18, 19]), Candidate: [2 1 2 0 0 1 1 1 1 0 1 1 0 1 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 149500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1  0 -1  0  1  0 -1  1  0  0 -1  0  0] (Indices: [3, 4, 8, 9, 12, 13, 15, 16, 17]), Candidate: [2 1 2 0 0 1 1 1 1 0 0 2 1 0 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 149550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1 -1  1  0  0  0  0 -1  0  0  0  1 -1] (Indices: [3, 4, 8, 10, 11, 12, 13, 14, 19]), Candidate: [ 2  1  2  0  0  1  1  1  0  2  0  1  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 149600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1 -1  1  0 -1  1 -1  0  0  1  0  0 -1] (Indices: [3, 4, 8, 10, 11, 13, 17, 18, 19]), Candidate: [2 1 2 0 0 1 1 1 0 2 0 0 2 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 149650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1 -1  1 -1  1 -1  0  0  1  0  0  0 -1] (Indices: [3, 4, 8, 10, 12, 16, 17, 18, 19]), Candidate: [ 2  1  2  0  0  1  1  1  0  2 -1  2  0  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 149700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1 -1  0  1  0 -1  1 -1  1 -1  1  0 -1] (Indices: [3, 4, 8, 11, 12, 14, 16, 18, 19]), Candidate: [ 2  1  2  0  0  1  1  1  0  1  1  1  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 149750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1 -1  0  0  0  1  0  0  0  0 -1  1 -1] (Indices: [3, 4, 8, 13, 14, 15, 16, 17, 19]), Candidate: [2 1 2 0 0 1 1 1 0 1 0 1 2 1 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 149800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  1  0  0 -1  1  0 -1  0  0  1  0 -1] (Indices: [3, 4, 9, 10, 11, 13, 14, 18, 19]), Candidate: [ 2  1  2  0  0  1  1  0  2  1  0  0  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 149850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  1  0 -1  1 -1  1  0 -1  1 -1  1 -1] (Indices: [3, 4, 9, 10, 12, 14, 15, 17, 19]), Candidate: [ 2  1  2  0  0  1  1  0  2  1 -1  2  0  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 149900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  1 -1  1  0  0 -1  0  1 -1  1  0 -1] (Indices: [3, 4, 9, 11, 12, 13, 16, 18, 19]), Candidate: [2 1 2 0 0 1 1 0 2 0 1 1 1 0 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 149950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  1 -1  0  1  0 -1  1  0 -1  1  0 -1] (Indices: [3, 4, 9, 12, 13, 15, 16, 18, 19]), Candidate: [2 1 2 0 0 1 1 0 2 0 0 2 1 0 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 150000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  0  1  0  0 -1  0  0  1  0  0  0 -1] (Indices: [3, 4, 10, 11, 12, 16, 17, 18, 19]), Candidate: [2 1 2 0 0 1 1 0 1 2 0 1 0 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 150050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  0  0  1  0  0  0  0  0  0 -1  0  0] (Indices: [3, 4, 11, 12, 13, 14, 15, 16, 17]), Candidate: [2 1 2 0 0 1 1 0 1 1 1 1 1 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 150100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0  0  0 -1  1 -1  0  0  0  0  0  1 -1] (Indices: [3, 5, 6, 7, 8, 9, 10, 12, 19]), Candidate: [ 2  1  2 -1  2  1  1  0  1  1 -1  2  0  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 150150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0  0 -1  0  1  0  0 -1  0  0  0  0  0] (Indices: [3, 5, 6, 7, 8, 9, 12, 13, 14]), Candidate: [ 2  1  2 -1  2  1  1  0  1  0  0  2  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 150200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0  0 -1  0  0  0  0  1 -1  1 -1  1 -1] (Indices: [3, 5, 6, 7, 8, 9, 15, 17, 19]), Candidate: [ 2  1  2 -1  2  1  1  0  1  0  0  1  1  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 150250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0 -1  1 -1  1 -1  0  0  1 -1  1 -1  0] (Indices: [3, 5, 6, 7, 8, 10, 12, 16, 18]), Candidate: [ 2  1  2 -1  2  1  1  0  0  2 -1  2  0  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 150300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0 -1  0  1  0 -1  1 -1  0  0  0  1 -1] (Indices: [3, 5, 6, 7, 8, 11, 12, 14, 19]), Candidate: [ 2  1  2 -1  2  1  1  0  0  1  1  1  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 150350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0 -1  0  0  1  0  0 -1  0  0  0  1 -1] (Indices: [3, 5, 6, 7, 8, 12, 13, 14, 19]), Candidate: [ 2  1  2 -1  2  1  1  0  0  1  0  2  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 150400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0 -1  0  0  0  1 -1  0  0  1  0  0 -1] (Indices: [3, 5, 6, 7, 8, 13, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  1  1  0  0  1  0  1  2  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 150450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  1  0 -1  1 -1  1  0 -1  0  0  0  0] (Indices: [3, 5, 6, 7, 9, 10, 12, 14, 15]), Candidate: [ 2  1  2 -1  2  1  1 -1  2  1 -1  2  0  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 150500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  1 -1  1  0  0  0 -1  0  0  0  0  0] (Indices: [3, 5, 6, 7, 9, 11, 12, 13, 14]), Candidate: [ 2  1  2 -1  2  1  1 -1  2  0  1  1  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 150550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  1 -1  1 -1  0  0  1 -1  1 -1  1 -1] (Indices: [3, 5, 6, 7, 9, 11, 15, 17, 19]), Candidate: [ 2  1  2 -1  2  1  1 -1  2  0  1  0  1  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 150600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  1 -1  0  0  1  0 -1  0  0  1  0 -1] (Indices: [3, 5, 6, 7, 9, 13, 14, 18, 19]), Candidate: [ 2  1  2 -1  2  1  1 -1  2  0  0  1  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 150650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  0  1  0 -1  1  0 -1  0  0  1 -1  0] (Indices: [3, 5, 6, 7, 10, 11, 13, 14, 18]), Candidate: [ 2  1  2 -1  2  1  1 -1  1  2  0  0  2  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 150700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  0  1 -1  1 -1  1  0 -1  0  0  1 -1] (Indices: [3, 5, 6, 7, 10, 12, 14, 15, 19]), Candidate: [ 2  1  2 -1  2  1  1 -1  1  2 -1  2  0  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 150750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  0  1 -1  0  0  0  1 -1  1  0  0 -1] (Indices: [3, 5, 6, 7, 10, 15, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  1  1 -1  1  2 -1  1  1  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 150800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  0  0  1 -1  1 -1  1 -1  1  0 -1  0] (Indices: [3, 5, 6, 7, 11, 13, 15, 17, 18]), Candidate: [ 2  1  2 -1  2  1  1 -1  1  1  1  0  2  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 150850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  0  0  0  1 -1  1 -1  1 -1  1  0 -1] (Indices: [3, 5, 6, 7, 12, 14, 16, 18, 19]), Candidate: [ 2  1  2 -1  2  1  1 -1  1  1  0  2  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 150900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1  0  0  0 -1  0  0  0  1  0 -1  0  0] (Indices: [3, 5, 6, 8, 9, 10, 11, 16, 17]), Candidate: [ 2  1  2 -1  2  1  0  1  1  1  0  0  1  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 150950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1  0  0 -1  0  0  1 -1  0  1 -1  1 -1] (Indices: [3, 5, 6, 8, 9, 10, 14, 17, 19]), Candidate: [ 2  1  2 -1  2  1  0  1  1  1 -1  1  1  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 151000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1  0 -1  1 -1  0  1  0 -1  0  1 -1  0] (Indices: [3, 5, 6, 8, 9, 11, 14, 15, 18]), Candidate: [ 2  1  2 -1  2  1  0  1  1  0  1  0  1  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 151050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1  0 -1  0  1 -1  0  0  1  0 -1  1 -1] (Indices: [3, 5, 6, 8, 9, 12, 16, 17, 19]), Candidate: [ 2  1  2 -1  2  1  0  1  1  0  0  2  0  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 151100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1 -1  1  0  0 -1  0  1 -1  1 -1  0  0] (Indices: [3, 5, 6, 8, 10, 11, 12, 15, 17]), Candidate: [ 2  1  2 -1  2  1  0  1  0  2  0  1  0  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 151150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1 -1  1 -1  1  0 -1  1 -1  1 -1  0  0] (Indices: [3, 5, 6, 8, 10, 12, 13, 15, 17]), Candidate: [ 2  1  2 -1  2  1  0  1  0  2 -1  2  1  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 151200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1 -1  1 -1  0  0  1  0  0 -1  1 -1  0] (Indices: [3, 5, 6, 8, 10, 14, 15, 16, 18]), Candidate: [ 2  1  2 -1  2  1  0  1  0  2 -1  1  1  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 151250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1 -1  0  1 -1  1  0  0 -1  1 -1  0  0] (Indices: [3, 5, 6, 8, 11, 13, 14, 15, 17]), Candidate: [ 2  1  2 -1  2  1  0  1  0  1  1  0  2  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 151300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1 -1  0  0  1  0 -1  0  1  0  0 -1  0] (Indices: [3, 5, 6, 8, 12, 13, 16, 17, 18]), Candidate: [ 2  1  2 -1  2  1  0  1  0  1  0  2  1  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 151350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  1  0  0  0 -1  1 -1  0  0  0  1 -1] (Indices: [3, 5, 6, 9, 10, 11, 12, 14, 19]), Candidate: [ 2  1  2 -1  2  1  0  0  2  1  0  1  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 151400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  1  0 -1  1  0  0 -1  0  0  0  1 -1] (Indices: [3, 5, 6, 9, 10, 12, 13, 14, 19]), Candidate: [ 2  1  2 -1  2  1  0  0  2  1 -1  2  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 151450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  1  0 -1  0  1 -1  0  0  1  0  0 -1] (Indices: [3, 5, 6, 9, 10, 13, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  1  0  0  2  1 -1  1  2  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 151500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  1 -1  1  0 -1  0  0  0  1  0  0 -1] (Indices: [3, 5, 6, 9, 11, 12, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  1  0  0  2  0  1  1  0  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 151550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  1 -1  0  1  0 -1  1 -1  1 -1  1 -1] (Indices: [3, 5, 6, 9, 12, 13, 15, 17, 19]), Candidate: [ 2  1  2 -1  2  1  0  0  2  0  0  2  1  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 151600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  0  1  0  0  0 -1  1 -1  0  0  1 -1] (Indices: [3, 5, 6, 10, 11, 12, 13, 15, 19]), Candidate: [ 2  1  2 -1  2  1  0  0  1  2  0  1  1  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 151650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  0  1  0 -1  0  1  0 -1  1  0 -1  0] (Indices: [3, 5, 6, 10, 11, 14, 15, 17, 18]), Candidate: [ 2  1  2 -1  2  1  0  0  1  2  0  0  1  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 151700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  0  1 -1  0  1  0  0 -1  1  0 -1  0] (Indices: [3, 5, 6, 10, 13, 14, 15, 17, 18]), Candidate: [ 2  1  2 -1  2  1  0  0  1  2 -1  1  2  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 151750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  0  0  1  0 -1  0  1  0 -1  1  0 -1] (Indices: [3, 5, 6, 11, 12, 15, 16, 18, 19]), Candidate: [ 2  1  2 -1  2  1  0  0  1  1  1  1  0  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 151800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  0  0  0  0  1 -1  1  0  0  0  0 -1] (Indices: [3, 5, 6, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  1  0  0  1  1  0  1  2  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 151850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0  0  0 -1  1 -1  0  0  0  0  1  0 -1] (Indices: [3, 5, 7, 8, 9, 10, 12, 18, 19]), Candidate: [ 2  1  2 -1  2  0  2  0  1  1 -1  2  0  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 151900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0  0 -1  1  0 -1  0  1 -1  0  0  1 -1] (Indices: [3, 5, 7, 8, 9, 11, 12, 15, 19]), Candidate: [ 2  1  2 -1  2  0  2  0  1  0  1  1  0  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 151950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0  0 -1  0  1  0 -1  1 -1  0  0  1 -1] (Indices: [3, 5, 7, 8, 9, 12, 13, 15, 19]), Candidate: [ 2  1  2 -1  2  0  2  0  1  0  0  2  1  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 152000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0  0 -1  0  0  0  1  0 -1  1  0 -1  0] (Indices: [3, 5, 7, 8, 9, 14, 15, 17, 18]), Candidate: [ 2  1  2 -1  2  0  2  0  1  0  0  1  1  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 152050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0 -1  1  0 -1  0  1  0 -1  0  1 -1  0] (Indices: [3, 5, 7, 8, 10, 11, 14, 15, 18]), Candidate: [ 2  1  2 -1  2  0  2  0  0  2  0  0  1  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 152100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0 -1  1 -1  1 -1  0  0  1  0 -1  1 -1] (Indices: [3, 5, 7, 8, 10, 12, 16, 17, 19]), Candidate: [ 2  1  2 -1  2  0  2  0  0  2 -1  2  0  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 152150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0 -1  0  1  0  0 -1  0  0  1  0 -1  0] (Indices: [3, 5, 7, 8, 11, 12, 13, 17, 18]), Candidate: [ 2  1  2 -1  2  0  2  0  0  1  1  1  1  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 152200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0 -1  0  1 -1  0  1 -1  1  0 -1  1 -1] (Indices: [3, 5, 7, 8, 11, 14, 16, 17, 19]), Candidate: [ 2  1  2 -1  2  0  2  0  0  1  1  0  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 152250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0 -1  0  0  0  1  0 -1  1  0 -1  1 -1] (Indices: [3, 5, 7, 8, 13, 14, 16, 17, 19]), Candidate: [ 2  1  2 -1  2  0  2  0  0  1  0  1  2  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 152300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  1  0  0 -1  0  1  0  0 -1  0  0  0] (Indices: [3, 5, 7, 9, 10, 11, 14, 15, 16]), Candidate: [ 2  1  2 -1  2  0  2 -1  2  1  0  0  1  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 152350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  1  0 -1  1 -1  0  1 -1  0  1  0 -1] (Indices: [3, 5, 7, 9, 10, 12, 15, 18, 19]), Candidate: [ 2  1  2 -1  2  0  2 -1  2  1 -1  2  0  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 152400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  1 -1  1  0  0 -1  0  1 -1  1 -1  0] (Indices: [3, 5, 7, 9, 11, 12, 13, 16, 18]), Candidate: [ 2  1  2 -1  2  0  2 -1  2  0  1  1  1  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 152450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  1 -1  1 -1  0  1  0 -1  0  1  0 -1] (Indices: [3, 5, 7, 9, 11, 14, 15, 18, 19]), Candidate: [ 2  1  2 -1  2  0  2 -1  2  0  1  0  1  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 152500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  1 -1  0  0  1  0  0 -1  0  1  0 -1] (Indices: [3, 5, 7, 9, 13, 14, 15, 18, 19]), Candidate: [ 2  1  2 -1  2  0  2 -1  2  0  0  1  2  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 152550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  0  1  0  0 -1  0  0  0  1  0  0 -1] (Indices: [3, 5, 7, 10, 11, 12, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  0  2 -1  1  2  0  1  0  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 152600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  0  1 -1  1  0 -1  1 -1  1 -1  1 -1] (Indices: [3, 5, 7, 10, 12, 13, 15, 17, 19]), Candidate: [ 2  1  2 -1  2  0  2 -1  1  2 -1  2  1  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 152650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  0  0  1  0  0  0 -1  0  1 -1  1 -1] (Indices: [3, 5, 7, 11, 12, 13, 14, 17, 19]), Candidate: [ 2  1  2 -1  2  0  2 -1  1  1  1  1  1  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 152700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  0  0  0  1  0  0  0  0 -1  0  1 -1] (Indices: [3, 5, 7, 12, 13, 14, 15, 16, 19]), Candidate: [ 2  1  2 -1  2  0  2 -1  1  1  0  2  1  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 152750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1  0  0  0 -1  1  0 -1  0  0  1 -1  0] (Indices: [3, 5, 8, 9, 10, 11, 13, 14, 18]), Candidate: [ 2  1  2 -1  2  0  1  1  1  1  0  0  2  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 152800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1  0  0 -1  1 -1  1  0 -1  0  0  1 -1] (Indices: [3, 5, 8, 9, 10, 12, 14, 15, 19]), Candidate: [ 2  1  2 -1  2  0  1  1  1  1 -1  2  0  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 152850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1  0  0 -1  0  0  0  1 -1  1  0  0 -1] (Indices: [3, 5, 8, 9, 10, 15, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  0  1  1  1  1 -1  1  1  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 152900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1  0 -1  1 -1  1 -1  1 -1  1  0 -1  0] (Indices: [3, 5, 8, 9, 11, 13, 15, 17, 18]), Candidate: [ 2  1  2 -1  2  0  1  1  1  0  1  0  2  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 152950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1  0 -1  0  1 -1  1 -1  1 -1  1  0 -1] (Indices: [3, 5, 8, 9, 12, 14, 16, 18, 19]), Candidate: [ 2  1  2 -1  2  0  1  1  1  0  0  2  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 153000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1 -1  1  0  0 -1  1 -1  0  1  0 -1  0] (Indices: [3, 5, 8, 10, 11, 12, 14, 17, 18]), Candidate: [ 2  1  2 -1  2  0  1  1  0  2  0  1  0  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 153050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1 -1  1 -1  1  0  0  0 -1  0  1 -1  0] (Indices: [3, 5, 8, 10, 12, 13, 14, 15, 18]), Candidate: [ 2  1  2 -1  2  0  1  1  0  2 -1  2  1  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 153100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1 -1  1 -1  0  0  1  0  0 -1  1  0 -1] (Indices: [3, 5, 8, 10, 14, 15, 16, 18, 19]), Candidate: [ 2  1  2 -1  2  0  1  1  0  2 -1  1  1  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 153150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1 -1  0  1 -1  1 -1  1  0  0 -1  1 -1] (Indices: [3, 5, 8, 11, 13, 15, 16, 17, 19]), Candidate: [ 2  1  2 -1  2  0  1  1  0  1  1  0  2  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 153200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  1  0  0  0  0 -1  0  0  1  0 -1  0] (Indices: [3, 5, 9, 10, 11, 12, 13, 17, 18]), Candidate: [ 2  1  2 -1  2  0  1  0  2  1  0  1  1  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 153250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  1  0  0 -1  0  1 -1  1  0 -1  1 -1] (Indices: [3, 5, 9, 10, 11, 14, 16, 17, 19]), Candidate: [ 2  1  2 -1  2  0  1  0  2  1  0  0  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 153300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  1  0 -1  0  1  0 -1  1  0 -1  1 -1] (Indices: [3, 5, 9, 10, 13, 14, 16, 17, 19]), Candidate: [ 2  1  2 -1  2  0  1  0  2  1 -1  1  2  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 153350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  1 -1  1 -1  1  0  0  0 -1  1 -1  0] (Indices: [3, 5, 9, 11, 13, 14, 15, 16, 18]), Candidate: [ 2  1  2 -1  2  0  1  0  2  0  1  0  2  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 153400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  0  1  0  0  0  0  0 -1  0  1 -1  0] (Indices: [3, 5, 10, 11, 12, 13, 14, 15, 18]), Candidate: [ 2  1  2 -1  2  0  1  0  1  2  0  1  1  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 153450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  0  1  0 -1  0  1  0  0 -1  1  0 -1] (Indices: [3, 5, 10, 11, 14, 15, 16, 18, 19]), Candidate: [ 2  1  2 -1  2  0  1  0  1  2  0  0  1  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 153500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  0  0  1  0 -1  1  0 -1  1  0  0 -1] (Indices: [3, 5, 11, 12, 14, 15, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  0  1  0  1  1  1  1  0  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 153550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0  0  0 -1  1  0 -1  0  0  0  1 -1  0] (Indices: [3, 6, 7, 8, 9, 10, 12, 13, 18]), Candidate: [ 2  1  2 -1  1  2  1  0  1  1 -1  2  1  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 153600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0  0  0 -1  0  0  0  0  1 -1  1  0 -1] (Indices: [3, 6, 7, 8, 9, 10, 16, 18, 19]), Candidate: [ 2  1  2 -1  1  2  1  0  1  1 -1  1  1  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 153650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0  0 -1  1 -1  0  0  1  0 -1  0  1 -1] (Indices: [3, 6, 7, 8, 9, 11, 15, 16, 19]), Candidate: [ 2  1  2 -1  1  2  1  0  1  0  1  0  1  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 153700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0  0 -1  0  0  1  0 -1  0  1  0 -1  0] (Indices: [3, 6, 7, 8, 9, 13, 14, 17, 18]), Candidate: [ 2  1  2 -1  1  2  1  0  1  0  0  1  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 153750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0 -1  1  0 -1  1  0 -1  1 -1  0  0  0] (Indices: [3, 6, 7, 8, 10, 11, 13, 14, 16]), Candidate: [ 2  1  2 -1  1  2  1  0  0  2  0  0  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 153800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0 -1  1 -1  1 -1  1  0 -1  1 -1  0  0] (Indices: [3, 6, 7, 8, 10, 12, 14, 15, 17]), Candidate: [ 2  1  2 -1  1  2  1  0  0  2 -1  2  0  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 153850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0 -1  1 -1  0  0  0  1  0  0 -1  1 -1] (Indices: [3, 6, 7, 8, 10, 15, 16, 17, 19]), Candidate: [ 2  1  2 -1  1  2  1  0  0  2 -1  1  1  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 153900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0 -1  0  1 -1  1 -1  1  0 -1  1 -1  0] (Indices: [3, 6, 7, 8, 11, 13, 15, 16, 18]), Candidate: [ 2  1  2 -1  1  2  1  0  0  1  1  0  2  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 153950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0 -1  0  0  1 -1  1 -1  1  0  0 -1  0] (Indices: [3, 6, 7, 8, 12, 14, 16, 17, 18]), Candidate: [ 2  1  2 -1  1  2  1  0  0  1  0  2  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 154000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  1  0  0  0 -1  0  0  0  0  1  0 -1] (Indices: [3, 6, 7, 9, 10, 11, 12, 18, 19]), Candidate: [ 2  1  2 -1  1  2  1 -1  2  1  0  1  0  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 154050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  1  0 -1  1  0 -1  0  0  0  1  0 -1] (Indices: [3, 6, 7, 9, 10, 12, 13, 18, 19]), Candidate: [ 2  1  2 -1  1  2  1 -1  2  1 -1  2  1  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 154100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  1  0 -1  0  0  1 -1  0  1  0  0 -1] (Indices: [3, 6, 7, 9, 10, 14, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  2  1 -1  2  1 -1  1  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 154150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  1 -1  1 -1  1  0 -1  0  0  1  0 -1] (Indices: [3, 6, 7, 9, 11, 13, 14, 18, 19]), Candidate: [ 2  1  2 -1  1  2  1 -1  2  0  1  0  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 154200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  1 -1  0  1 -1  1  0 -1  1 -1  1 -1] (Indices: [3, 6, 7, 9, 12, 14, 15, 17, 19]), Candidate: [ 2  1  2 -1  1  2  1 -1  2  0  0  2  0  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 154250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  0  1  0  0 -1  1  0 -1  0  0  1 -1] (Indices: [3, 6, 7, 10, 11, 12, 14, 15, 19]), Candidate: [ 2  1  2 -1  1  2  1 -1  1  2  0  1  0  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 154300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  0  1  0 -1  0  0  1 -1  1  0  0 -1] (Indices: [3, 6, 7, 10, 11, 15, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  2  1 -1  1  2  0  0  1  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 154350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  0  1 -1  0  1 -1  1 -1  1  0  0 -1] (Indices: [3, 6, 7, 10, 13, 15, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  2  1 -1  1  2 -1  1  2  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 154400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  0  0  1 -1  1  0 -1  1  0 -1  1 -1] (Indices: [3, 6, 7, 11, 13, 14, 16, 17, 19]), Candidate: [ 2  1  2 -1  1  2  1 -1  1  1  1  0  2  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 154450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1  0  0  0  0 -1  1 -1  0  1 -1  0  0] (Indices: [3, 6, 8, 9, 10, 11, 12, 14, 17]), Candidate: [ 2  1  2 -1  1  2  0  1  1  1  0  1  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 154500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1  0  0 -1  1  0  0 -1  0  1 -1  0  0] (Indices: [3, 6, 8, 9, 10, 12, 13, 14, 17]), Candidate: [ 2  1  2 -1  1  2  0  1  1  1 -1  2  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 154550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1  0  0 -1  0  1 -1  0  1  0 -1  1 -1] (Indices: [3, 6, 8, 9, 10, 13, 16, 17, 19]), Candidate: [ 2  1  2 -1  1  2  0  1  1  1 -1  1  2  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 154600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1  0 -1  1  0 -1  0  0  1  0 -1  1 -1] (Indices: [3, 6, 8, 9, 11, 12, 16, 17, 19]), Candidate: [ 2  1  2 -1  1  2  0  1  1  0  1  1  0  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 154650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1  0 -1  0  1  0 -1  1  0 -1  0  1 -1] (Indices: [3, 6, 8, 9, 12, 13, 15, 16, 19]), Candidate: [ 2  1  2 -1  1  2  0  1  1  0  0  2  1  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 154700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1 -1  1  0  0  0 -1  1 -1  1 -1  0  0] (Indices: [3, 6, 8, 10, 11, 12, 13, 15, 17]), Candidate: [ 2  1  2 -1  1  2  0  1  0  2  0  1  1  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 154750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1 -1  1  0 -1  0  1  0  0 -1  1 -1  0] (Indices: [3, 6, 8, 10, 11, 14, 15, 16, 18]), Candidate: [ 2  1  2 -1  1  2  0  1  0  2  0  0  1  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 154800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1 -1  1 -1  0  1  0  0  0 -1  1 -1  0] (Indices: [3, 6, 8, 10, 13, 14, 15, 16, 18]), Candidate: [ 2  1  2 -1  1  2  0  1  0  2 -1  1  2  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 154850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1 -1  0  1  0 -1  0  1  0  0  0 -1  0] (Indices: [3, 6, 8, 11, 12, 15, 16, 17, 18]), Candidate: [ 2  1  2 -1  1  2  0  1  0  1  1  1  0  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 154900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1 -1  0  0  0  1  0  0 -1  1  0  0 -1] (Indices: [3, 6, 8, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  2  0  1  0  1  0  1  2  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 154950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  1  0  0 -1  1 -1  1  0 -1  1 -1  0] (Indices: [3, 6, 9, 10, 11, 13, 15, 16, 18]), Candidate: [ 2  1  2 -1  1  2  0  0  2  1  0  0  2  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 155000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  1  0 -1  1 -1  1 -1  1  0  0 -1  0] (Indices: [3, 6, 9, 10, 12, 14, 16, 17, 18]), Candidate: [ 2  1  2 -1  1  2  0  0  2  1 -1  2  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 155050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  1 -1  1  0 -1  1  0  0  0 -1  0  0] (Indices: [3, 6, 9, 11, 12, 14, 15, 16, 17]), Candidate: [ 2  1  2 -1  1  2  0  0  2  0  1  1  0  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 155100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  1 -1  0  1  0 -1  0  1  0  0  0 -1] (Indices: [3, 6, 9, 12, 13, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  2  0  0  2  0  0  2  1  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 155150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  0  1  0 -1  1  0  0  0 -1  1 -1  0] (Indices: [3, 6, 10, 11, 13, 14, 15, 16, 18]), Candidate: [ 2  1  2 -1  1  2  0  0  1  2  0  0  2  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 155200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  0  0  1  0  0  0  0  0 -1  0  1 -1] (Indices: [3, 6, 11, 12, 13, 14, 15, 16, 19]), Candidate: [ 2  1  2 -1  1  2  0  0  1  1  1  1  1  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 155250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0  0  0  0  0 -1  0  0  1 -1  1 -1  0] (Indices: [3, 7, 8, 9, 10, 11, 12, 16, 18]), Candidate: [ 2  1  2 -1  1  1  2  0  1  1  0  1  0  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 155300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0  0  0 -1  1  0 -1  0  1 -1  1 -1  0] (Indices: [3, 7, 8, 9, 10, 12, 13, 16, 18]), Candidate: [ 2  1  2 -1  1  1  2  0  1  1 -1  2  1  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 155350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0  0  0 -1  0  0  1  0 -1  0  1  0 -1] (Indices: [3, 7, 8, 9, 10, 14, 15, 18, 19]), Candidate: [ 2  1  2 -1  1  1  2  0  1  1 -1  1  1  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 155400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0  0 -1  1 -1  1  0 -1  1 -1  1 -1  0] (Indices: [3, 7, 8, 9, 11, 13, 14, 16, 18]), Candidate: [ 2  1  2 -1  1  1  2  0  1  0  1  0  2  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 155450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0  0 -1  0  1 -1  1  0  0  0 -1  0  0] (Indices: [3, 7, 8, 9, 12, 14, 15, 16, 17]), Candidate: [ 2  1  2 -1  1  1  2  0  1  0  0  2  0  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 155500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0 -1  1  0  0  0 -1  0  0  0  1  0 -1] (Indices: [3, 7, 8, 10, 11, 12, 13, 18, 19]), Candidate: [ 2  1  2 -1  1  1  2  0  0  2  0  1  1  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 155550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0 -1  1  0 -1  0  1 -1  0  1  0  0 -1] (Indices: [3, 7, 8, 10, 11, 14, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  1  2  0  0  2  0  0  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 155600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0 -1  1 -1  0  1  0 -1  0  1  0  0 -1] (Indices: [3, 7, 8, 10, 13, 14, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  1  2  0  0  2 -1  1  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 155650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0 -1  0  1 -1  1  0  0 -1  1  0 -1  0] (Indices: [3, 7, 8, 11, 13, 14, 15, 17, 18]), Candidate: [ 2  1  2 -1  1  1  2  0  0  1  1  0  2  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 155700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  1  0  0  0  0  0 -1  0  0  0  1 -1] (Indices: [3, 7, 9, 10, 11, 12, 13, 14, 19]), Candidate: [ 2  1  2 -1  1  1  2 -1  2  1  0  1  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 155750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  1  0  0 -1  1 -1  0  0  1  0  0 -1] (Indices: [3, 7, 9, 10, 11, 13, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  1  2 -1  2  1  0  0  2  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 155800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  1  0 -1  1 -1  0  0  1  0  0  0 -1] (Indices: [3, 7, 9, 10, 12, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  1  2 -1  2  1 -1  2  0  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 155850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  1 -1  1  0 -1  1 -1  1 -1  1  0 -1] (Indices: [3, 7, 9, 11, 12, 14, 16, 18, 19]), Candidate: [ 2  1  2 -1  1  1  2 -1  2  0  1  1  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 155900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  1 -1  0  0  1  0  0  0  0 -1  1 -1] (Indices: [3, 7, 9, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  1  2 -1  1  1  2 -1  2  0  0  1  2  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 155950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  0  1  0 -1  1  0 -1  0  1  0  0 -1] (Indices: [3, 7, 10, 11, 13, 14, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  1  2 -1  1  2  0  0  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 156000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  0  0  1  0  0 -1  1  0  0  0 -1  0] (Indices: [3, 7, 11, 12, 13, 15, 16, 17, 18]), Candidate: [ 2  1  2 -1  1  1  2 -1  1  1  1  1  1  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 156050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1  0  0  0  0 -1  1 -1  0  0  1  0 -1] (Indices: [3, 8, 9, 10, 11, 12, 14, 18, 19]), Candidate: [ 2  1  2 -1  1  1  1  1  1  1  0  1  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 156100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1  0  0 -1  1  0  0 -1  1  0 -1  0  0] (Indices: [3, 8, 9, 10, 12, 13, 14, 16, 17]), Candidate: [ 2  1  2 -1  1  1  1  1  1  1 -1  2  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 156150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1  0  0 -1  0  0  1 -1  1  0  0  0 -1] (Indices: [3, 8, 9, 10, 14, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  1  1  1  1  1 -1  1  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 156200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1  0 -1  1 -1  1 -1  1 -1  1  0  0 -1] (Indices: [3, 8, 9, 11, 13, 15, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  1  1  1  1  0  1  0  2  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 156250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1 -1  1  0  0  0 -1  1 -1  1 -1  1 -1] (Indices: [3, 8, 10, 11, 12, 13, 15, 17, 19]), Candidate: [ 2  1  2 -1  1  1  1  1  0  2  0  1  1  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 156300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1 -1  1 -1  1  0  0 -1  1 -1  1  0 -1] (Indices: [3, 8, 10, 12, 13, 14, 16, 18, 19]), Candidate: [ 2  1  2 -1  1  1  1  1  0  2 -1  2  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 156350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1 -1  0  0  1  0  0  0  0 -1  1  0 -1] (Indices: [3, 8, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  1  2 -1  1  1  1  1  0  1  0  2  1  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 156400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  1  0  0 -1  1  0 -1  0  1  0  0 -1] (Indices: [3, 9, 10, 11, 13, 14, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  1  1  0  2  1  0  0  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 156450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  1 -1  1  0  0 -1  1  0  0  0 -1  0] (Indices: [3, 9, 11, 12, 13, 15, 16, 17, 18]), Candidate: [ 2  1  2 -1  1  1  1  0  2  0  1  1  1  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 156500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  0  1  0 -1  1  0  0 -1  1  0  0 -1] (Indices: [3, 10, 11, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  1  1  0  1  2  0  0  2  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 156550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0  0  0 -1  0  0  0  1 -1  0  0  1 -1] (Indices: [4, 5, 6, 7, 8, 9, 10, 15, 19]), Candidate: [ 2  1  1  1  1  1  1  0  1  1 -1  1  1  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 156600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0  0 -1  0  1 -1  0  0  1  0 -1  0  0] (Indices: [4, 5, 6, 7, 8, 9, 12, 16, 17]), Candidate: [2 1 1 1 1 1 1 0 1 0 0 2 0 1 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 156650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0 -1  1  0 -1  1 -1  0  1 -1  0  0  0] (Indices: [4, 5, 6, 7, 8, 10, 11, 13, 16]), Candidate: [2 1 1 1 1 1 1 0 0 2 0 0 2 0 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 156700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0 -1  1 -1  0  1 -1  0  1 -1  1 -1  0] (Indices: [4, 5, 6, 7, 8, 10, 13, 16, 18]), Candidate: [ 2  1  1  1  1  1  1  0  0  2 -1  1  2  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 156750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0 -1  0  1 -1  1  0 -1  0  0  0  1 -1] (Indices: [4, 5, 6, 7, 8, 11, 13, 14, 19]), Candidate: [ 2  1  1  1  1  1  1  0  0  1  1  0  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 156800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0 -1  0  0  1 -1  1 -1  1  0 -1  0  0] (Indices: [4, 5, 6, 7, 8, 12, 14, 16, 17]), Candidate: [ 2  1  1  1  1  1  1  0  0  1  0  2  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 156850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0 -1  0  0  0  0  0  0  1  0  0  0 -1] (Indices: [4, 5, 6, 7, 8, 16, 17, 18, 19]), Candidate: [2 1 1 1 1 1 1 0 0 1 0 1 1 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 156900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  1  0 -1  0  1  0  0 -1  0  0  0  0] (Indices: [4, 5, 6, 7, 9, 10, 13, 14, 15]), Candidate: [ 2  1  1  1  1  1  1 -1  2  1 -1  1  2  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 156950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  1 -1  1  0 -1  0  0  1  0 -1  0  0] (Indices: [4, 5, 6, 7, 9, 11, 12, 16, 17]), Candidate: [ 2  1  1  1  1  1  1 -1  2  0  1  1  0  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 157000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  1 -1  0  1  0 -1  0  1  0 -1  0  0] (Indices: [4, 5, 6, 7, 9, 12, 13, 16, 17]), Candidate: [ 2  1  1  1  1  1  1 -1  2  0  0  2  1  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 157050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  1 -1  0  0  0  1  0 -1  1 -1  1 -1] (Indices: [4, 5, 6, 7, 9, 14, 15, 17, 19]), Candidate: [ 2  1  1  1  1  1  1 -1  2  0  0  1  1  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 157100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  0  1  0 -1  0  1  0 -1  0  0  1 -1] (Indices: [4, 5, 6, 7, 10, 11, 14, 15, 19]), Candidate: [ 2  1  1  1  1  1  1 -1  1  2  0  0  1  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 157150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  0  1 -1  1 -1  0  0  1 -1  1  0 -1] (Indices: [4, 5, 6, 7, 10, 12, 16, 18, 19]), Candidate: [ 2  1  1  1  1  1  1 -1  1  2 -1  2  0  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 157200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  0  0  1  0  0 -1  0  0  1 -1  1 -1] (Indices: [4, 5, 6, 7, 11, 12, 13, 17, 19]), Candidate: [ 2  1  1  1  1  1  1 -1  1  1  1  1  1  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 157250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  0  0  1 -1  0  1 -1  1 -1  1  0 -1] (Indices: [4, 5, 6, 7, 11, 14, 16, 18, 19]), Candidate: [ 2  1  1  1  1  1  1 -1  1  1  1  0  1  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 157300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  0  0  0  0  1  0 -1  1 -1  1  0 -1] (Indices: [4, 5, 6, 7, 13, 14, 16, 18, 19]), Candidate: [ 2  1  1  1  1  1  1 -1  1  1  0  1  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 157350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1  0  0 -1  1 -1  1 -1  0  0  1 -1  0] (Indices: [4, 5, 6, 8, 9, 10, 12, 14, 18]), Candidate: [ 2  1  1  1  1  1  0  1  1  1 -1  2  0  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 157400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1  0 -1  1  0  0 -1  0  0  1 -1  0  0] (Indices: [4, 5, 6, 8, 9, 11, 12, 13, 17]), Candidate: [2 1 1 1 1 1 0 1 1 0 1 1 1 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 157450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1  0 -1  1 -1  0  0  0  1  0 -1  1 -1] (Indices: [4, 5, 6, 8, 9, 11, 16, 17, 19]), Candidate: [2 1 1 1 1 1 0 1 1 0 1 0 1 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 157500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1  0 -1  0  0  1 -1  1  0 -1  0  1 -1] (Indices: [4, 5, 6, 8, 9, 13, 15, 16, 19]), Candidate: [2 1 1 1 1 1 0 1 1 0 0 1 2 0 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 157550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1 -1  1  0 -1  1 -1  1 -1  1 -1  0  0] (Indices: [4, 5, 6, 8, 10, 11, 13, 15, 17]), Candidate: [2 1 1 1 1 1 0 1 0 2 0 0 2 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 157600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1 -1  1 -1  1 -1  1 -1  1 -1  0  1 -1] (Indices: [4, 5, 6, 8, 10, 12, 14, 16, 19]), Candidate: [ 2  1  1  1  1  1  0  1  0  2 -1  2  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 157650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1 -1  0  1  0  0  0 -1  1 -1  0  0  0] (Indices: [4, 5, 6, 8, 11, 12, 13, 14, 16]), Candidate: [ 2  1  1  1  1  1  0  1  0  1  1  1  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 157700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1 -1  0  1 -1  1 -1  0  1  0  0 -1  0] (Indices: [4, 5, 6, 8, 11, 13, 16, 17, 18]), Candidate: [2 1 1 1 1 1 0 1 0 1 1 0 2 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 157750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1 -1  0  0  1 -1  0  1  0  0 -1  1 -1] (Indices: [4, 5, 6, 8, 12, 15, 16, 17, 19]), Candidate: [2 1 1 1 1 1 0 1 0 1 0 2 0 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 157800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  1  0  0 -1  1  0 -1  0  0  0  1 -1] (Indices: [4, 5, 6, 9, 10, 11, 13, 14, 19]), Candidate: [ 2  1  1  1  1  1  0  0  2  1  0  0  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 157850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  1  0 -1  1 -1  1 -1  1  0 -1  0  0] (Indices: [4, 5, 6, 9, 10, 12, 14, 16, 17]), Candidate: [ 2  1  1  1  1  1  0  0  2  1 -1  2  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 157900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  1  0 -1  0  0  0  0  1  0  0  0 -1] (Indices: [4, 5, 6, 9, 10, 16, 17, 18, 19]), Candidate: [ 2  1  1  1  1  1  0  0  2  1 -1  1  1  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 157950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  1 -1  1 -1  1 -1  1 -1  1 -1  1 -1] (Indices: [4, 5, 6, 9, 11, 13, 15, 17, 19]), Candidate: [2 1 1 1 1 1 0 0 2 0 1 0 2 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 158000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  1 -1  0  1 -1  1 -1  0  1  0  0 -1] (Indices: [4, 5, 6, 9, 12, 14, 17, 18, 19]), Candidate: [ 2  1  1  1  1  1  0  0  2  0  0  2  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 158050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  0  1  0  0 -1  1 -1  0  1 -1  1 -1] (Indices: [4, 5, 6, 10, 11, 12, 14, 17, 19]), Candidate: [ 2  1  1  1  1  1  0  0  1  2  0  1  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 158100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  0  1 -1  1  0  0  0 -1  0  0  1 -1] (Indices: [4, 5, 6, 10, 12, 13, 14, 15, 19]), Candidate: [ 2  1  1  1  1  1  0  0  1  2 -1  2  1  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 158150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  0  1 -1  0  0  1  0 -1  1  0  0 -1] (Indices: [4, 5, 6, 10, 14, 15, 17, 18, 19]), Candidate: [ 2  1  1  1  1  1  0  0  1  2 -1  1  1  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 158200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  0  0  1 -1  1 -1  1  0 -1  1  0 -1] (Indices: [4, 5, 6, 11, 13, 15, 16, 18, 19]), Candidate: [2 1 1 1 1 1 0 0 1 1 1 0 2 0 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 158250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0  0  0  0 -1  0  1  0 -1  0  0  0  0] (Indices: [4, 5, 7, 8, 9, 10, 11, 14, 15]), Candidate: [2 1 1 1 1 0 2 0 1 1 0 0 1 2 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 158300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0  0  0 -1  0  1 -1  0  0  0  1  0 -1] (Indices: [4, 5, 7, 8, 9, 10, 13, 18, 19]), Candidate: [ 2  1  1  1  1  0  2  0  1  1 -1  1  2  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 158350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0  0 -1  1 -1  1 -1  1 -1  0  0  1 -1] (Indices: [4, 5, 7, 8, 9, 11, 13, 15, 19]), Candidate: [2 1 1 1 1 0 2 0 1 0 1 0 2 0 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 158400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0  0 -1  0  1 -1  1 -1  0  1 -1  1 -1] (Indices: [4, 5, 7, 8, 9, 12, 14, 17, 19]), Candidate: [ 2  1  1  1  1  0  2  0  1  0  0  2  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 158450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0 -1  1  0  0  0 -1  0  0  1 -1  0  0] (Indices: [4, 5, 7, 8, 10, 11, 12, 13, 17]), Candidate: [2 1 1 1 1 0 2 0 0 2 0 1 1 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 158500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0 -1  1  0 -1  0  0  0  1  0 -1  1 -1] (Indices: [4, 5, 7, 8, 10, 11, 16, 17, 19]), Candidate: [2 1 1 1 1 0 2 0 0 2 0 0 1 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 158550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0 -1  1 -1  0  1 -1  1  0 -1  0  1 -1] (Indices: [4, 5, 7, 8, 10, 13, 15, 16, 19]), Candidate: [ 2  1  1  1  1  0  2  0  0  2 -1  1  2  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 158600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0 -1  0  1  0 -1  0  1  0 -1  0  1 -1] (Indices: [4, 5, 7, 8, 11, 12, 15, 16, 19]), Candidate: [2 1 1 1 1 0 2 0 0 1 1 1 0 1 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 158650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0 -1  0  0  1  0  0 -1  0  1  0 -1  0] (Indices: [4, 5, 7, 8, 12, 13, 14, 17, 18]), Candidate: [ 2  1  1  1  1  0  2  0  0  1  0  2  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 158700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  1  0  0  0  0 -1  1 -1  0  0  0  0] (Indices: [4, 5, 7, 9, 10, 11, 12, 13, 15]), Candidate: [ 2  1  1  1  1  0  2 -1  2  1  0  1  1  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 158750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  1  0  0 -1  0  0  1 -1  0  1  0 -1] (Indices: [4, 5, 7, 9, 10, 11, 15, 18, 19]), Candidate: [ 2  1  1  1  1  0  2 -1  2  1  0  0  1  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 158800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  1  0 -1  0  1 -1  1  0  0 -1  0  0] (Indices: [4, 5, 7, 9, 10, 13, 15, 16, 17]), Candidate: [ 2  1  1  1  1  0  2 -1  2  1 -1  1  2  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 158850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  1 -1  1  0 -1  0  1  0  0 -1  0  0] (Indices: [4, 5, 7, 9, 11, 12, 15, 16, 17]), Candidate: [ 2  1  1  1  1  0  2 -1  2  0  1  1  0  1  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 158900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  1 -1  0  1  0  0 -1  1 -1  1 -1  0] (Indices: [4, 5, 7, 9, 12, 13, 14, 16, 18]), Candidate: [ 2  1  1  1  1  0  2 -1  2  0  0  2  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 158950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  1 -1  0  0  0  0  1  0  0  0  0 -1] (Indices: [4, 5, 7, 9, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1  1  1  0  2 -1  2  0  0  1  1  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 159000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  0  1  0 -1  1 -1  1 -1  1 -1  1 -1] (Indices: [4, 5, 7, 10, 11, 13, 15, 17, 19]), Candidate: [ 2  1  1  1  1  0  2 -1  1  2  0  0  2  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 159050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  0  1 -1  1 -1  1 -1  0  1  0  0 -1] (Indices: [4, 5, 7, 10, 12, 14, 17, 18, 19]), Candidate: [ 2  1  1  1  1  0  2 -1  1  2 -1  2  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 159100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  0  0  1  0 -1  1  0 -1  1  0 -1  0] (Indices: [4, 5, 7, 11, 12, 14, 15, 17, 18]), Candidate: [ 2  1  1  1  1  0  2 -1  1  1  1  1  0  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 159150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  0  0  0  1 -1  1  0  0 -1  1  0 -1] (Indices: [4, 5, 7, 12, 14, 15, 16, 18, 19]), Candidate: [ 2  1  1  1  1  0  2 -1  1  1  0  2  0  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 159200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1  0  0  0 -1  0  1  0 -1  0  0  1 -1] (Indices: [4, 5, 8, 9, 10, 11, 14, 15, 19]), Candidate: [2 1 1 1 1 0 1 1 1 1 0 0 1 2 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 159250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1  0  0 -1  1 -1  0  0  1 -1  1  0 -1] (Indices: [4, 5, 8, 9, 10, 12, 16, 18, 19]), Candidate: [ 2  1  1  1  1  0  1  1  1  1 -1  2  0  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 159300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1  0 -1  1  0  0 -1  0  0  1 -1  1 -1] (Indices: [4, 5, 8, 9, 11, 12, 13, 17, 19]), Candidate: [2 1 1 1 1 0 1 1 1 0 1 1 1 0 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 159350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1  0 -1  1 -1  0  1 -1  1 -1  1  0 -1] (Indices: [4, 5, 8, 9, 11, 14, 16, 18, 19]), Candidate: [ 2  1  1  1  1  0  1  1  1  0  1  0  1  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 159400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1  0 -1  0  0  1  0 -1  1 -1  1  0 -1] (Indices: [4, 5, 8, 9, 13, 14, 16, 18, 19]), Candidate: [ 2  1  1  1  1  0  1  1  1  0  0  1  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 159450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1 -1  1  0 -1  1  0  0 -1  0  1 -1  0] (Indices: [4, 5, 8, 10, 11, 13, 14, 15, 18]), Candidate: [2 1 1 1 1 0 1 1 0 2 0 0 2 1 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 159500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1 -1  1 -1  1  0 -1  0  1  0 -1  1 -1] (Indices: [4, 5, 8, 10, 12, 13, 16, 17, 19]), Candidate: [ 2  1  1  1  1  0  1  1  0  2 -1  2  1  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 159550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1 -1  0  1  0  0 -1  1  0 -1  1 -1  0] (Indices: [4, 5, 8, 11, 12, 13, 15, 16, 18]), Candidate: [2 1 1 1 1 0 1 1 0 1 1 1 1 0 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 159600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1 -1  0  0  1  0  0  0 -1  0  1  0 -1] (Indices: [4, 5, 8, 12, 13, 14, 15, 18, 19]), Candidate: [2 1 1 1 1 0 1 1 0 1 0 2 1 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 159650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  1  0  0  0 -1  0  1  0 -1  0  1 -1] (Indices: [4, 5, 9, 10, 11, 12, 15, 16, 19]), Candidate: [2 1 1 1 1 0 1 0 2 1 0 1 0 1 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 159700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  1  0 -1  1  0  0 -1  0  1  0 -1  0] (Indices: [4, 5, 9, 10, 12, 13, 14, 17, 18]), Candidate: [ 2  1  1  1  1  0  1  0  2  1 -1  2  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 159750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  1 -1  1  0  0  0  0 -1  1 -1  0  0] (Indices: [4, 5, 9, 11, 12, 13, 14, 15, 17]), Candidate: [2 1 1 1 1 0 1 0 2 0 1 1 1 1 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 159800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  1 -1  1 -1  0  1  0  0  0 -1  1 -1] (Indices: [4, 5, 9, 11, 14, 15, 16, 17, 19]), Candidate: [2 1 1 1 1 0 1 0 2 0 1 0 1 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 159850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  0  1  0  0  0 -1  0  1  0 -1  1 -1] (Indices: [4, 5, 10, 11, 12, 13, 16, 17, 19]), Candidate: [2 1 1 1 1 0 1 0 1 2 0 1 1 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 159900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  0  1 -1  1  0 -1  1  0  0 -1  1 -1] (Indices: [4, 5, 10, 12, 13, 15, 16, 17, 19]), Candidate: [ 2  1  1  1  1  0  1  0  1  2 -1  2  1  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 159950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  0  0  0  1  0 -1  1  0  0  0  0 -1] (Indices: [4, 5, 12, 13, 15, 16, 17, 18, 19]), Candidate: [2 1 1 1 1 0 1 0 1 1 0 2 1 0 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 160000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0  0  0 -1  1 -1  0  0  0  1 -1  1 -1] (Indices: [4, 6, 7, 8, 9, 10, 12, 17, 19]), Candidate: [ 2  1  1  1  0  2  1  0  1  1 -1  2  0  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 160050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0  0 -1  1  0 -1  0  1 -1  0  1 -1  0] (Indices: [4, 6, 7, 8, 9, 11, 12, 15, 18]), Candidate: [2 1 1 1 0 2 1 0 1 0 1 1 0 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 160100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0  0 -1  0  1  0 -1  1 -1  0  1 -1  0] (Indices: [4, 6, 7, 8, 9, 12, 13, 15, 18]), Candidate: [2 1 1 1 0 2 1 0 1 0 0 2 1 0 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 160150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0  0 -1  0  0  0  1  0  0 -1  0  1 -1] (Indices: [4, 6, 7, 8, 9, 14, 15, 16, 19]), Candidate: [2 1 1 1 0 2 1 0 1 0 0 1 1 2 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 160200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0 -1  1  0 -1  0  1  0 -1  1 -1  0  0] (Indices: [4, 6, 7, 8, 10, 11, 14, 15, 17]), Candidate: [2 1 1 1 0 2 1 0 0 2 0 0 1 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 160250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0 -1  1 -1  1 -1  0  0  1  0  0 -1  0] (Indices: [4, 6, 7, 8, 10, 12, 16, 17, 18]), Candidate: [ 2  1  1  1  0  2  1  0  0  2 -1  2  0  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 160300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0 -1  0  1  0  0 -1  0  1 -1  0  1 -1] (Indices: [4, 6, 7, 8, 11, 12, 13, 16, 19]), Candidate: [2 1 1 1 0 2 1 0 0 1 1 1 1 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 160350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0 -1  0  1 -1  0  1 -1  1  0  0 -1  0] (Indices: [4, 6, 7, 8, 11, 14, 16, 17, 18]), Candidate: [ 2  1  1  1  0  2  1  0  0  1  1  0  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 160400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0 -1  0  0  0  1  0 -1  1  0  0 -1  0] (Indices: [4, 6, 7, 8, 13, 14, 16, 17, 18]), Candidate: [ 2  1  1  1  0  2  1  0  0  1  0  1  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 160450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  1  0  0 -1  1 -1  0  0  0  1  0 -1] (Indices: [4, 6, 7, 9, 10, 11, 13, 18, 19]), Candidate: [ 2  1  1  1  0  2  1 -1  2  1  0  0  2  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 160500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  1  0 -1  1 -1  0  1 -1  1 -1  1 -1] (Indices: [4, 6, 7, 9, 10, 12, 15, 17, 19]), Candidate: [ 2  1  1  1  0  2  1 -1  2  1 -1  2  0  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 160550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  1 -1  1  0  0 -1  0  1  0 -1  0  0] (Indices: [4, 6, 7, 9, 11, 12, 13, 16, 17]), Candidate: [ 2  1  1  1  0  2  1 -1  2  0  1  1  1  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 160600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  1 -1  1 -1  0  1  0 -1  1 -1  1 -1] (Indices: [4, 6, 7, 9, 11, 14, 15, 17, 19]), Candidate: [ 2  1  1  1  0  2  1 -1  2  0  1  0  1  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 160650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  1 -1  0  0  1  0  0 -1  1 -1  1 -1] (Indices: [4, 6, 7, 9, 13, 14, 15, 17, 19]), Candidate: [ 2  1  1  1  0  2  1 -1  2  0  0  1  2  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 160700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  0  1  0  0 -1  0  0  1 -1  1  0 -1] (Indices: [4, 6, 7, 10, 11, 12, 16, 18, 19]), Candidate: [ 2  1  1  1  0  2  1 -1  1  2  0  1  0  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 160750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  0  1 -1  1  0 -1  1 -1  1  0 -1  0] (Indices: [4, 6, 7, 10, 12, 13, 15, 17, 18]), Candidate: [ 2  1  1  1  0  2  1 -1  1  2 -1  2  1  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 160800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  0  0  1  0  0  0 -1  0  1  0 -1  0] (Indices: [4, 6, 7, 11, 12, 13, 14, 17, 18]), Candidate: [ 2  1  1  1  0  2  1 -1  1  1  1  1  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 160850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  0  0  0  1  0  0  0  0 -1  1 -1  0] (Indices: [4, 6, 7, 12, 13, 14, 15, 16, 18]), Candidate: [ 2  1  1  1  0  2  1 -1  1  1  0  2  1  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 160900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1  0  0  0 -1  1  0 -1  0  1 -1  0  0] (Indices: [4, 6, 8, 9, 10, 11, 13, 14, 17]), Candidate: [ 2  1  1  1  0  2  0  1  1  1  0  0  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 160950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1  0  0 -1  1 -1  1  0 -1  0  1 -1  0] (Indices: [4, 6, 8, 9, 10, 12, 14, 15, 18]), Candidate: [ 2  1  1  1  0  2  0  1  1  1 -1  2  0  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 161000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1  0  0 -1  0  0  0  1  0 -1  1  0 -1] (Indices: [4, 6, 8, 9, 10, 15, 16, 18, 19]), Candidate: [ 2  1  1  1  0  2  0  1  1  1 -1  1  1  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 161050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1  0 -1  1 -1  1 -1  1  0 -1  0  1 -1] (Indices: [4, 6, 8, 9, 11, 13, 15, 16, 19]), Candidate: [2 1 1 1 0 2 0 1 1 0 1 0 2 0 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 161100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1  0 -1  0  1 -1  1 -1  1  0 -1  1 -1] (Indices: [4, 6, 8, 9, 12, 14, 16, 17, 19]), Candidate: [ 2  1  1  1  0  2  0  1  1  0  0  2  0  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 161150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1 -1  1  0  0 -1  1 -1  1 -1  0  1 -1] (Indices: [4, 6, 8, 10, 11, 12, 14, 16, 19]), Candidate: [ 2  1  1  1  0  2  0  1  0  2  0  1  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 161200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1 -1  1 -1  1  0  0  0 -1  1 -1  0  0] (Indices: [4, 6, 8, 10, 12, 13, 14, 15, 17]), Candidate: [ 2  1  1  1  0  2  0  1  0  2 -1  2  1  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 161250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1 -1  1 -1  0  0  1  0  0  0 -1  1 -1] (Indices: [4, 6, 8, 10, 14, 15, 16, 17, 19]), Candidate: [ 2  1  1  1  0  2  0  1  0  2 -1  1  1  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 161300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1 -1  0  1 -1  1 -1  1  0  0  0 -1  0] (Indices: [4, 6, 8, 11, 13, 15, 16, 17, 18]), Candidate: [2 1 1 1 0 2 0 1 0 1 1 0 2 0 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 161350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  1  0  0  0  0 -1  0  1 -1  0  1 -1] (Indices: [4, 6, 9, 10, 11, 12, 13, 16, 19]), Candidate: [2 1 1 1 0 2 0 0 2 1 0 1 1 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 161400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  1  0  0 -1  0  1 -1  1  0  0 -1  0] (Indices: [4, 6, 9, 10, 11, 14, 16, 17, 18]), Candidate: [ 2  1  1  1  0  2  0  0  2  1  0  0  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 161450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  1  0 -1  0  1  0 -1  1  0  0 -1  0] (Indices: [4, 6, 9, 10, 13, 14, 16, 17, 18]), Candidate: [ 2  1  1  1  0  2  0  0  2  1 -1  1  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 161500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  1 -1  1 -1  1  0  0  0  0 -1  0  0] (Indices: [4, 6, 9, 11, 13, 14, 15, 16, 17]), Candidate: [2 1 1 1 0 2 0 0 2 0 1 0 2 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 161550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  0  1  0  0  0  0  0 -1  1 -1  0  0] (Indices: [4, 6, 10, 11, 12, 13, 14, 15, 17]), Candidate: [2 1 1 1 0 2 0 0 1 2 0 1 1 1 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 161600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  0  1  0 -1  0  1  0  0  0 -1  1 -1] (Indices: [4, 6, 10, 11, 14, 15, 16, 17, 19]), Candidate: [2 1 1 1 0 2 0 0 1 2 0 0 1 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 161650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  0  0  1  0 -1  1  0  0 -1  1  0 -1] (Indices: [4, 6, 11, 12, 14, 15, 16, 18, 19]), Candidate: [2 1 1 1 0 2 0 0 1 1 1 1 0 2 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 161700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0  0  0  0 -1  1 -1  0  1 -1  1 -1  0] (Indices: [4, 7, 8, 9, 10, 11, 13, 16, 18]), Candidate: [2 1 1 1 0 1 2 0 1 1 0 0 2 0 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 161750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0  0  0 -1  1 -1  0  1  0  0 -1  0  0] (Indices: [4, 7, 8, 9, 10, 12, 15, 16, 17]), Candidate: [ 2  1  1  1  0  1  2  0  1  1 -1  2  0  1  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 161800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0  0 -1  1  0  0 -1  1  0 -1  0  0  0] (Indices: [4, 7, 8, 9, 11, 12, 13, 15, 16]), Candidate: [2 1 1 1 0 1 2 0 1 0 1 1 1 0 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 161850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0  0 -1  1 -1  0  1  0  0  0 -1  0  0] (Indices: [4, 7, 8, 9, 11, 14, 15, 16, 17]), Candidate: [2 1 1 1 0 1 2 0 1 0 1 0 1 2 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 161900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0  0 -1  0  0  1  0  0  0  0 -1  0  0] (Indices: [4, 7, 8, 9, 13, 14, 15, 16, 17]), Candidate: [2 1 1 1 0 1 2 0 1 0 0 1 2 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 161950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0 -1  1  0  0 -1  0  1 -1  1 -1  1 -1] (Indices: [4, 7, 8, 10, 11, 12, 15, 17, 19]), Candidate: [2 1 1 1 0 1 2 0 0 2 0 1 0 1 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 162000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0 -1  1 -1  1  0  0 -1  0  0  1  0 -1] (Indices: [4, 7, 8, 10, 12, 13, 14, 18, 19]), Candidate: [ 2  1  1  1  0  1  2  0  0  2 -1  2  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 162050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0 -1  0  1  0  0  0  0 -1  0  0  1 -1] (Indices: [4, 7, 8, 11, 12, 13, 14, 15, 19]), Candidate: [2 1 1 1 0 1 2 0 0 1 1 1 1 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 162100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0 -1  0  1 -1  0  1  0 -1  1  0  0 -1] (Indices: [4, 7, 8, 11, 14, 15, 17, 18, 19]), Candidate: [2 1 1 1 0 1 2 0 0 1 1 0 1 2 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 162150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  1  0  0  0 -1  1 -1  1  0 -1  0  0] (Indices: [4, 7, 9, 10, 11, 12, 14, 16, 17]), Candidate: [ 2  1  1  1  0  1  2 -1  2  1  0  1  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 162200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  1  0  0 -1  0  0  0  1  0  0  0 -1] (Indices: [4, 7, 9, 10, 11, 16, 17, 18, 19]), Candidate: [ 2  1  1  1  0  1  2 -1  2  1  0  0  1  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 162250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  1  0 -1  0  1 -1  0  1  0  0  0 -1] (Indices: [4, 7, 9, 10, 13, 16, 17, 18, 19]), Candidate: [ 2  1  1  1  0  1  2 -1  2  1 -1  1  2  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 162300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  1 -1  1 -1  1  0 -1  1 -1  1  0 -1] (Indices: [4, 7, 9, 11, 13, 14, 16, 18, 19]), Candidate: [ 2  1  1  1  0  1  2 -1  2  0  1  0  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 162350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  0  1  0  0  0  0 -1  0  0  1  0 -1] (Indices: [4, 7, 10, 11, 12, 13, 14, 18, 19]), Candidate: [ 2  1  1  1  0  1  2 -1  1  2  0  1  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 162400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  0  1 -1  1  0  0  0 -1  1  0 -1  0] (Indices: [4, 7, 10, 12, 13, 14, 15, 17, 18]), Candidate: [ 2  1  1  1  0  1  2 -1  1  2 -1  2  1  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 162450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  0  0  1 -1  1  0 -1  1  0  0  0 -1] (Indices: [4, 7, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  1  0  1  2 -1  1  1  1  0  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 162500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1  0  0  0 -1  1  0 -1  1  0 -1  0  0] (Indices: [4, 8, 9, 10, 11, 13, 14, 16, 17]), Candidate: [ 2  1  1  1  0  1  1  1  1  1  0  0  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 162550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1  0  0 -1  1  0 -1  0  0  1  0  0 -1] (Indices: [4, 8, 9, 10, 12, 13, 17, 18, 19]), Candidate: [ 2  1  1  1  0  1  1  1  1  1 -1  2  1  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 162600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1  0 -1  1  0  0 -1  1 -1  1  0 -1  0] (Indices: [4, 8, 9, 11, 12, 13, 15, 17, 18]), Candidate: [2 1 1 1 0 1 1 1 1 0 1 1 1 0 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 162650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1  0 -1  0  1  0  0 -1  1  0 -1  1 -1] (Indices: [4, 8, 9, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  1  1  1  0  1  1  1  1  0  0  2  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 162700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1 -1  1  0  0 -1  1 -1  0  1  0  0 -1] (Indices: [4, 8, 10, 11, 12, 14, 17, 18, 19]), Candidate: [ 2  1  1  1  0  1  1  1  0  2  0  1  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 162750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1 -1  1 -1  0  1  0  0  0 -1  1  0 -1] (Indices: [4, 8, 10, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  1  1  1  0  1  1  1  0  2 -1  1  2  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 162800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  1  0  0  0  0  0 -1  0  0  1  0 -1] (Indices: [4, 9, 10, 11, 12, 13, 14, 18, 19]), Candidate: [ 2  1  1  1  0  1  1  0  2  1  0  1  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 162850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  1  0 -1  1  0  0  0 -1  1  0 -1  0] (Indices: [4, 9, 10, 12, 13, 14, 15, 17, 18]), Candidate: [ 2  1  1  1  0  1  1  0  2  1 -1  2  1  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 162900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  1 -1  1 -1  1  0 -1  1  0  0  0 -1] (Indices: [4, 9, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  1  0  1  1  0  2  0  1  0  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 162950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  0  0  1  0  0  0  0 -1  1  0  0 -1] (Indices: [4, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [2 1 1 1 0 1 1 0 1 1 1 1 1 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 163000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0  0  0 -1  1 -1  0  0  1 -1  1 -1  0] (Indices: [5, 6, 7, 8, 9, 10, 12, 16, 18]), Candidate: [ 2  1  1  0  2  1  1  0  1  1 -1  2  0  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 163050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0  0 -1  1  0 -1  1 -1  0  0  0  1 -1] (Indices: [5, 6, 7, 8, 9, 11, 12, 14, 19]), Candidate: [ 2  1  1  0  2  1  1  0  1  0  1  1  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 163100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0  0 -1  0  1  0  0 -1  0  0  0  1 -1] (Indices: [5, 6, 7, 8, 9, 12, 13, 14, 19]), Candidate: [ 2  1  1  0  2  1  1  0  1  0  0  2  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 163150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0  0 -1  0  0  1 -1  0  0  1  0  0 -1] (Indices: [5, 6, 7, 8, 9, 13, 17, 18, 19]), Candidate: [2 1 1 0 2 1 1 0 1 0 0 1 2 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 163200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0 -1  1  0 -1  1 -1  0  0  1 -1  1 -1] (Indices: [5, 6, 7, 8, 10, 11, 13, 17, 19]), Candidate: [2 1 1 0 2 1 1 0 0 2 0 0 2 0 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 163250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0 -1  1 -1  1 -1  0  1 -1  1  0 -1  0] (Indices: [5, 6, 7, 8, 10, 12, 15, 17, 18]), Candidate: [ 2  1  1  0  2  1  1  0  0  2 -1  2  0  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 163300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0 -1  0  1  0  0 -1  1 -1  0  0  1 -1] (Indices: [5, 6, 7, 8, 11, 12, 13, 15, 19]), Candidate: [2 1 1 0 2 1 1 0 0 1 1 1 1 0 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 163350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0 -1  0  1 -1  0  1  0 -1  1  0 -1  0] (Indices: [5, 6, 7, 8, 11, 14, 15, 17, 18]), Candidate: [2 1 1 0 2 1 1 0 0 1 1 0 1 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 163400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0 -1  0  0  0  1  0  0 -1  1  0 -1  0] (Indices: [5, 6, 7, 8, 13, 14, 15, 17, 18]), Candidate: [2 1 1 0 2 1 1 0 0 1 0 1 2 1 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 163450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  1  0  0 -1  1 -1  0  1 -1  0  1 -1] (Indices: [5, 6, 7, 9, 10, 11, 13, 16, 19]), Candidate: [ 2  1  1  0  2  1  1 -1  2  1  0  0  2  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 163500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  1  0 -1  1 -1  0  1  0 -1  1 -1  0] (Indices: [5, 6, 7, 9, 10, 12, 15, 16, 18]), Candidate: [ 2  1  1  0  2  1  1 -1  2  1 -1  2  0  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 163550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  1 -1  1  0  0 -1  1 -1  1 -1  0  0] (Indices: [5, 6, 7, 9, 11, 12, 13, 15, 17]), Candidate: [ 2  1  1  0  2  1  1 -1  2  0  1  1  1  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 163600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  1 -1  1 -1  0  1  0  0 -1  1 -1  0] (Indices: [5, 6, 7, 9, 11, 14, 15, 16, 18]), Candidate: [ 2  1  1  0  2  1  1 -1  2  0  1  0  1  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 163650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  1 -1  0  0  1  0  0  0 -1  1 -1  0] (Indices: [5, 6, 7, 9, 13, 14, 15, 16, 18]), Candidate: [ 2  1  1  0  2  1  1 -1  2  0  0  1  2  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 163700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  0  1  0  0 -1  0  1 -1  0  1  0 -1] (Indices: [5, 6, 7, 10, 11, 12, 15, 18, 19]), Candidate: [ 2  1  1  0  2  1  1 -1  1  2  0  1  0  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 163750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  0  1 -1  1  0 -1  1  0  0 -1  0  0] (Indices: [5, 6, 7, 10, 12, 13, 15, 16, 17]), Candidate: [ 2  1  1  0  2  1  1 -1  1  2 -1  2  1  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 163800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  0  0  1  0  0  0 -1  1  0 -1  0  0] (Indices: [5, 6, 7, 11, 12, 13, 14, 16, 17]), Candidate: [ 2  1  1  0  2  1  1 -1  1  1  1  1  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 163850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  0  0  1 -1  0  1 -1  1  0  0  0 -1] (Indices: [5, 6, 7, 11, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  2  1  1 -1  1  1  1  0  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 163900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1  0  0  0  0 -1  0  0  0  0  1  0 -1] (Indices: [5, 6, 8, 9, 10, 11, 12, 18, 19]), Candidate: [2 1 1 0 2 1 0 1 1 1 0 1 0 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 163950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1  0  0 -1  1  0 -1  0  0  0  1  0 -1] (Indices: [5, 6, 8, 9, 10, 12, 13, 18, 19]), Candidate: [ 2  1  1  0  2  1  0  1  1  1 -1  2  1  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 164000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1  0  0 -1  0  0  1 -1  0  1  0  0 -1] (Indices: [5, 6, 8, 9, 10, 14, 17, 18, 19]), Candidate: [ 2  1  1  0  2  1  0  1  1  1 -1  1  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 164050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1  0 -1  1 -1  1  0 -1  0  0  1  0 -1] (Indices: [5, 6, 8, 9, 11, 13, 14, 18, 19]), Candidate: [ 2  1  1  0  2  1  0  1  1  0  1  0  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 164100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1  0 -1  0  1 -1  1  0 -1  1 -1  1 -1] (Indices: [5, 6, 8, 9, 12, 14, 15, 17, 19]), Candidate: [2 1 1 0 2 1 0 1 1 0 0 2 0 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 164150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1 -1  1  0  0 -1  1  0 -1  0  0  1 -1] (Indices: [5, 6, 8, 10, 11, 12, 14, 15, 19]), Candidate: [2 1 1 0 2 1 0 1 0 2 0 1 0 2 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 164200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1 -1  1  0 -1  0  0  1 -1  1  0  0 -1] (Indices: [5, 6, 8, 10, 11, 15, 17, 18, 19]), Candidate: [2 1 1 0 2 1 0 1 0 2 0 0 1 1 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 164250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1 -1  1 -1  0  1 -1  1 -1  1  0  0 -1] (Indices: [5, 6, 8, 10, 13, 15, 17, 18, 19]), Candidate: [ 2  1  1  0  2  1  0  1  0  2 -1  1  2  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 164300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1 -1  0  1 -1  1  0 -1  1  0 -1  1 -1] (Indices: [5, 6, 8, 11, 13, 14, 16, 17, 19]), Candidate: [ 2  1  1  0  2  1  0  1  0  1  1  0  2  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 164350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  1  0  0  0  0 -1  1 -1  0  0  1 -1] (Indices: [5, 6, 9, 10, 11, 12, 13, 15, 19]), Candidate: [2 1 1 0 2 1 0 0 2 1 0 1 1 0 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 164400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  1  0  0 -1  0  1  0 -1  1  0 -1  0] (Indices: [5, 6, 9, 10, 11, 14, 15, 17, 18]), Candidate: [2 1 1 0 2 1 0 0 2 1 0 0 1 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 164450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  1  0 -1  0  1  0  0 -1  1  0 -1  0] (Indices: [5, 6, 9, 10, 13, 14, 15, 17, 18]), Candidate: [ 2  1  1  0  2  1  0  0  2  1 -1  1  2  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 164500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  1 -1  1  0 -1  0  1  0 -1  1  0 -1] (Indices: [5, 6, 9, 11, 12, 15, 16, 18, 19]), Candidate: [2 1 1 0 2 1 0 0 2 0 1 1 0 1 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 164550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  1 -1  0  0  1 -1  1  0  0  0  0 -1] (Indices: [5, 6, 9, 13, 15, 16, 17, 18, 19]), Candidate: [2 1 1 0 2 1 0 0 2 0 0 1 2 0 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 164600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  0  1  0 -1  1 -1  1 -1  1  0  0 -1] (Indices: [5, 6, 10, 11, 13, 15, 17, 18, 19]), Candidate: [2 1 1 0 2 1 0 0 1 2 0 0 2 0 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 164650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  0  0  1  0  0 -1  0  1  0  0  0 -1] (Indices: [5, 6, 11, 12, 13, 16, 17, 18, 19]), Candidate: [2 1 1 0 2 1 0 0 1 1 1 1 1 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 164700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0  0  0  0 -1  1 -1  1 -1  0  1 -1  0] (Indices: [5, 7, 8, 9, 10, 11, 13, 15, 18]), Candidate: [2 1 1 0 2 0 2 0 1 1 0 0 2 0 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 164750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0  0  0 -1  1 -1  1 -1  0  1  0 -1  0] (Indices: [5, 7, 8, 9, 10, 12, 14, 17, 18]), Candidate: [ 2  1  1  0  2  0  2  0  1  1 -1  2  0  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 164800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0  0 -1  1  0  0  0 -1  0  1 -1  0  0] (Indices: [5, 7, 8, 9, 11, 12, 13, 14, 17]), Candidate: [ 2  1  1  0  2  0  2  0  1  0  1  1  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 164850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0  0 -1  1 -1  1 -1  0  1  0 -1  1 -1] (Indices: [5, 7, 8, 9, 11, 13, 16, 17, 19]), Candidate: [2 1 1 0 2 0 2 0 1 0 1 0 2 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 164900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0  0 -1  0  1 -1  0  1  0 -1  1  0 -1] (Indices: [5, 7, 8, 9, 12, 15, 16, 18, 19]), Candidate: [2 1 1 0 2 0 2 0 1 0 0 2 0 1 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 164950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0 -1  1  0  0 -1  0  1  0 -1  1 -1  0] (Indices: [5, 7, 8, 10, 11, 12, 15, 16, 18]), Candidate: [2 1 1 0 2 0 2 0 0 2 0 1 0 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 165000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0 -1  1 -1  1  0  0 -1  1 -1  0  1 -1] (Indices: [5, 7, 8, 10, 12, 13, 14, 16, 19]), Candidate: [ 2  1  1  0  2  0  2  0  0  2 -1  2  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 165050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0 -1  0  1  0  0  0  0  0 -1  0  0  0] (Indices: [5, 7, 8, 11, 12, 13, 14, 15, 16]), Candidate: [2 1 1 0 2 0 2 0 0 1 1 1 1 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 165100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0 -1  0  1 -1  0  1  0  0  0  0 -1  0] (Indices: [5, 7, 8, 11, 14, 15, 16, 17, 18]), Candidate: [2 1 1 0 2 0 2 0 0 1 1 0 1 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 165150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  1  0  0  0 -1  1  0 -1  1 -1  0  0] (Indices: [5, 7, 9, 10, 11, 12, 14, 15, 17]), Candidate: [ 2  1  1  0  2  0  2 -1  2  1  0  1  0  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 165200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  1  0  0 -1  0  0  1  0  0 -1  1 -1] (Indices: [5, 7, 9, 10, 11, 15, 16, 17, 19]), Candidate: [ 2  1  1  0  2  0  2 -1  2  1  0  0  1  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 165250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  1  0 -1  0  1 -1  1  0  0 -1  1 -1] (Indices: [5, 7, 9, 10, 13, 15, 16, 17, 19]), Candidate: [ 2  1  1  0  2  0  2 -1  2  1 -1  1  2  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 165300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  1 -1  1 -1  1  0  0 -1  0  1  0 -1] (Indices: [5, 7, 9, 11, 13, 14, 15, 18, 19]), Candidate: [ 2  1  1  0  2  0  2 -1  2  0  1  0  2  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 165350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  0  1  0  0  0  0 -1  1 -1  0  1 -1] (Indices: [5, 7, 10, 11, 12, 13, 14, 16, 19]), Candidate: [ 2  1  1  0  2  0  2 -1  1  2  0  1  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 165400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  0  1 -1  1  0  0  0  0  0 -1  0  0] (Indices: [5, 7, 10, 12, 13, 14, 15, 16, 17]), Candidate: [ 2  1  1  0  2  0  2 -1  1  2 -1  2  1  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 165450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  0  0  1 -1  1  0  0  0  0 -1  1 -1] (Indices: [5, 7, 11, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  1  1  0  2  0  2 -1  1  1  1  0  2  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 165500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1  0  0  0 -1  1  0  0 -1  1 -1  0  0] (Indices: [5, 8, 9, 10, 11, 13, 14, 15, 17]), Candidate: [2 1 1 0 2 0 1 1 1 1 0 0 2 1 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 165550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1  0  0 -1  1  0 -1  0  1  0  0 -1  0] (Indices: [5, 8, 9, 10, 12, 13, 16, 17, 18]), Candidate: [ 2  1  1  0  2  0  1  1  1  1 -1  2  1  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 165600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1  0 -1  1  0  0 -1  1  0  0 -1  0  0] (Indices: [5, 8, 9, 11, 12, 13, 15, 16, 17]), Candidate: [2 1 1 0 2 0 1 1 1 0 1 1 1 0 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 165650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1  0 -1  0  1  0  0  0 -1  1 -1  1 -1] (Indices: [5, 8, 9, 12, 13, 14, 15, 17, 19]), Candidate: [2 1 1 0 2 0 1 1 1 0 0 2 1 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 165700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1 -1  1  0  0 -1  1 -1  1  0  0 -1  0] (Indices: [5, 8, 10, 11, 12, 14, 16, 17, 18]), Candidate: [ 2  1  1  0  2  0  1  1  0  2  0  1  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 165750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1 -1  1 -1  1 -1  0  1  0  0  0  0 -1] (Indices: [5, 8, 10, 12, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  2  0  1  1  0  2 -1  2  0  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 165800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  1  0  0  0  0  0 -1  1 -1  0  1 -1] (Indices: [5, 9, 10, 11, 12, 13, 14, 16, 19]), Candidate: [ 2  1  1  0  2  0  1  0  2  1  0  1  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 165850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  1  0 -1  1  0  0  0  0  0 -1  0  0] (Indices: [5, 9, 10, 12, 13, 14, 15, 16, 17]), Candidate: [ 2  1  1  0  2  0  1  0  2  1 -1  2  1  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 165900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  1 -1  1 -1  1  0  0  0  0 -1  1 -1] (Indices: [5, 9, 11, 13, 14, 15, 16, 17, 19]), Candidate: [2 1 1 0 2 0 1 0 2 0 1 0 2 1 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 165950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  0  0  1  0  0  0  0  0  0  0 -1  0] (Indices: [5, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [2 1 1 0 2 0 1 0 1 1 1 1 1 1 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 166000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0  0  0  0 -1  0  1 -1  1 -1  1 -1  0] (Indices: [6, 7, 8, 9, 10, 11, 14, 16, 18]), Candidate: [ 2  1  1  0  1  2  1  0  1  1  0  0  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 166050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0  0  0 -1  0  1  0  0  0 -1  0  0  0] (Indices: [6, 7, 8, 9, 10, 13, 14, 15, 16]), Candidate: [ 2  1  1  0  1  2  1  0  1  1 -1  1  2  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 166100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0  0 -1  1  0 -1  1  0  0 -1  0  0  0] (Indices: [6, 7, 8, 9, 11, 12, 14, 15, 16]), Candidate: [2 1 1 0 1 2 1 0 1 0 1 1 0 2 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 166150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0  0 -1  1 -1  0  0  1  0  0  0 -1  0] (Indices: [6, 7, 8, 9, 11, 15, 16, 17, 18]), Candidate: [2 1 1 0 1 2 1 0 1 0 1 0 1 1 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 166200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0  0 -1  0  0  1 -1  1  0  0  0 -1  0] (Indices: [6, 7, 8, 9, 13, 15, 16, 17, 18]), Candidate: [2 1 1 0 1 2 1 0 1 0 0 1 2 0 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 166250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0 -1  1  0 -1  1  0 -1  1  0 -1  0  0] (Indices: [6, 7, 8, 10, 11, 13, 14, 16, 17]), Candidate: [ 2  1  1  0  1  2  1  0  0  2  0  0  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 166300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0 -1  1 -1  1  0 -1  0  0  1  0  0 -1] (Indices: [6, 7, 8, 10, 12, 13, 17, 18, 19]), Candidate: [ 2  1  1  0  1  2  1  0  0  2 -1  2  1  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 166350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0 -1  0  1  0  0 -1  1 -1  1  0 -1  0] (Indices: [6, 7, 8, 11, 12, 13, 15, 17, 18]), Candidate: [2 1 1 0 1 2 1 0 0 1 1 1 1 0 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 166400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0 -1  0  0  1  0  0 -1  1  0 -1  1 -1] (Indices: [6, 7, 8, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  1  1  0  1  2  1  0  0  1  0  2  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 166450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  1  0  0  0 -1  0  1 -1  1 -1  1 -1] (Indices: [6, 7, 9, 10, 11, 12, 15, 17, 19]), Candidate: [ 2  1  1  0  1  2  1 -1  2  1  0  1  0  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 166500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  1  0 -1  1  0  0 -1  0  0  1  0 -1] (Indices: [6, 7, 9, 10, 12, 13, 14, 18, 19]), Candidate: [ 2  1  1  0  1  2  1 -1  2  1 -1  2  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 166550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  1 -1  1  0  0  0  0 -1  0  0  1 -1] (Indices: [6, 7, 9, 11, 12, 13, 14, 15, 19]), Candidate: [ 2  1  1  0  1  2  1 -1  2  0  1  1  1  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 166600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  1 -1  1 -1  0  1  0 -1  1  0  0 -1] (Indices: [6, 7, 9, 11, 14, 15, 17, 18, 19]), Candidate: [ 2  1  1  0  1  2  1 -1  2  0  1  0  1  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 166650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  0  1  0  0  0 -1  0  0  1  0  0 -1] (Indices: [6, 7, 10, 11, 12, 13, 17, 18, 19]), Candidate: [ 2  1  1  0  1  2  1 -1  1  2  0  1  1  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 166700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  0  1 -1  1  0 -1  1 -1  1  0  0 -1] (Indices: [6, 7, 10, 12, 13, 15, 17, 18, 19]), Candidate: [ 2  1  1  0  1  2  1 -1  1  2 -1  2  1  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 166750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  0  0  0  0  1  0  0  0  0  0  0 -1] (Indices: [6, 7, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  1  2  1 -1  1  1  0  1  2  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 166800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1  0  0  0 -1  1 -1  1 -1  1 -1  1 -1] (Indices: [6, 8, 9, 10, 11, 13, 15, 17, 19]), Candidate: [2 1 1 0 1 2 0 1 1 1 0 0 2 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 166850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1  0  0 -1  1 -1  1 -1  0  1  0  0 -1] (Indices: [6, 8, 9, 10, 12, 14, 17, 18, 19]), Candidate: [ 2  1  1  0  1  2  0  1  1  1 -1  2  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 166900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1  0 -1  1  0 -1  1  0 -1  1  0 -1  0] (Indices: [6, 8, 9, 11, 12, 14, 15, 17, 18]), Candidate: [2 1 1 0 1 2 0 1 1 0 1 1 0 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 166950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1  0 -1  0  1 -1  1  0  0 -1  1  0 -1] (Indices: [6, 8, 9, 12, 14, 15, 16, 18, 19]), Candidate: [2 1 1 0 1 2 0 1 1 0 0 2 0 2 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 167000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1 -1  1  0 -1  1  0  0 -1  1 -1  1 -1] (Indices: [6, 8, 10, 11, 13, 14, 15, 17, 19]), Candidate: [2 1 1 0 1 2 0 1 0 2 0 0 2 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 167050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1 -1  0  1  0  0  0  0 -1  0  1  0 -1] (Indices: [6, 8, 11, 12, 13, 14, 15, 18, 19]), Candidate: [2 1 1 0 1 2 0 1 0 1 1 1 1 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 167100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  1  0  0  0  0 -1  0  0  1  0  0 -1] (Indices: [6, 9, 10, 11, 12, 13, 17, 18, 19]), Candidate: [2 1 1 0 1 2 0 0 2 1 0 1 1 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 167150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  1  0 -1  1  0 -1  1 -1  1  0  0 -1] (Indices: [6, 9, 10, 12, 13, 15, 17, 18, 19]), Candidate: [ 2  1  1  0  1  2  0  0  2  1 -1  2  1  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 167200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  1 -1  0  0  1  0  0  0  0  0  0 -1] (Indices: [6, 9, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 1 1 0 1 2 0 0 2 0 0 1 2 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 167250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0  0  0  0  0  0  0 -1  0  0  0  1 -1] (Indices: [7, 8, 9, 10, 11, 12, 13, 14, 19]), Candidate: [ 2  1  1  0  1  1  2  0  1  1  0  1  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 167300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0  0  0  0 -1  1 -1  0  0  1  0  0 -1] (Indices: [7, 8, 9, 10, 11, 13, 17, 18, 19]), Candidate: [2 1 1 0 1 1 2 0 1 1 0 0 2 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 167350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0  0  0 -1  1 -1  0  0  1  0  0  0 -1] (Indices: [7, 8, 9, 10, 12, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  1  1  2  0  1  1 -1  2  0  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 167400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0  0 -1  1  0 -1  1 -1  1 -1  1  0 -1] (Indices: [7, 8, 9, 11, 12, 14, 16, 18, 19]), Candidate: [ 2  1  1  0  1  1  2  0  1  0  1  1  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 167450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0  0 -1  0  0  1  0  0  0  0 -1  1 -1] (Indices: [7, 8, 9, 13, 14, 15, 16, 17, 19]), Candidate: [2 1 1 0 1 1 2 0 1 0 0 1 2 1 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 167500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0 -1  1  0 -1  1  0 -1  0  1  0  0 -1] (Indices: [7, 8, 10, 11, 13, 14, 17, 18, 19]), Candidate: [ 2  1  1  0  1  1  2  0  0  2  0  0  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 167550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0 -1  0  1  0  0 -1  1  0  0  0 -1  0] (Indices: [7, 8, 11, 12, 13, 15, 16, 17, 18]), Candidate: [2 1 1 0 1 1 2 0 0 1 1 1 1 0 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 167600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  1  0  0  0 -1  1  0 -1  1 -1  1 -1] (Indices: [7, 9, 10, 11, 12, 14, 15, 17, 19]), Candidate: [ 2  1  1  0  1  1  2 -1  2  1  0  1  0  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 167650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  1  0 -1  1 -1  1  0 -1  1  0  0 -1] (Indices: [7, 9, 10, 12, 14, 15, 17, 18, 19]), Candidate: [ 2  1  1  0  1  1  2 -1  2  1 -1  2  0  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 167700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  0  1  0  0  0  0  0 -1  1 -1  1 -1] (Indices: [7, 10, 11, 12, 13, 14, 15, 17, 19]), Candidate: [ 2  1  1  0  1  1  2 -1  1  2  0  1  1  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 167750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1  0  0  0  0  0  0 -1  0  0  1  0 -1] (Indices: [8, 9, 10, 11, 12, 13, 14, 18, 19]), Candidate: [ 2  1  1  0  1  1  1  1  1  1  0  1  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 167800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1  0  0 -1  1  0  0  0 -1  1  0 -1  0] (Indices: [8, 9, 10, 12, 13, 14, 15, 17, 18]), Candidate: [ 2  1  1  0  1  1  1  1  1  1 -1  2  1  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 167850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1  0 -1  1 -1  1  0 -1  1  0  0  0 -1] (Indices: [8, 9, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  1  1  1  1  1  0  1  0  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 167900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1 -1  0  1  0  0  0  0 -1  1  0  0 -1] (Indices: [8, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [2 1 1 0 1 1 1 1 0 1 1 1 1 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 167950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  1 -1  0  1  0  0  0  0  0  0  0 -1] (Indices: [9, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 1 1 0 1 1 1 0 2 0 0 2 1 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Finished generating neighbors. Total valid neighbors found: 50348
  Size of neighborhood t=9: 50348
  Using 'fork' start method for multiprocessing.
  No improvement found for t=9 after processing 50348 neighbors.
No improving solution found or error occurred for t=9.

Attempting neighborhood t=10 (current best cost: 98.4663)
  Exploring neighborhood t=10 in parallel (current cost: 98.4663)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Attempt 50: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  0  0  0  0  1 -1  0  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 13, 18]), Candidate: [ 2  1  1  0  1  1  1 -1  1  1  0  1  2  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1 -1  0  0  1 -1  0  0  0  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 12, 19]), Candidate: [2 1 1 0 1 1 0 1 0 1 0 2 0 1 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  1 -1  0  0  1 -1  0  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 9, 13, 18]), Candidate: [2 1 1 0 1 1 0 0 2 0 0 1 2 0 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  0  1 -1  0  0  0  0  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 10, 17, 18]), Candidate: [ 2  1  1  0  1  1  0  0  1  2 -1  1  1  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  0  0  0  1 -1  0  0  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 12, 17, 19]), Candidate: [2 1 1 0 1 1 0 0 1 1 0 2 0 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0 -1  1 -1  0  0  1 -1  0  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 10, 14]), Candidate: [ 2  1  1  0  1  0  2  0  0  2 -1  1  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  1  0 -1  0  0  0  0  0  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 9, 10, 19]), Candidate: [ 2  1  1  0  1  0  2 -1  2  1 -1  1  1  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  0  1 -1  1 -1  0  0  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 10, 12, 18]), Candidate: [ 2  1  1  0  1  0  2 -1  1  2 -1  2  0  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  0  0  1 -1  0  0  0  0  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 11, 18, 19]), Candidate: [ 2  1  1  0  1  0  2 -1  1  1  1  0  1  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  0  0  0  0  0  0  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 15, 17, 18]), Candidate: [ 2  1  1  0  1  0  2 -1  1  1  0  1  1  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1  0 -1  0  0  0  0  0  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 8, 9, 17, 19]), Candidate: [2 1 1 0 1 0 1 1 1 0 0 1 1 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1 -1  0  1 -1  1 -1  0  0  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 8, 11, 13, 19]), Candidate: [2 1 1 0 1 0 1 1 0 1 1 0 2 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1 -1  0  0  0  1 -1  0  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 8, 13, 17, 19]), Candidate: [2 1 1 0 1 0 1 1 0 1 0 1 2 0 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  1  0 -1  0  0  0  1 -1  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 9, 10, 15, 18]), Candidate: [ 2  1  1  0  1  0  1  0  2  1 -1  1  1  1  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  1 -1  0  1 -1  0  1 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 9, 12, 15, 19]), Candidate: [2 1 1 0 1 0 1 0 2 0 0 2 0 1 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  0  1  0 -1  1 -1  1 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 5, 10, 11, 13, 15]), Candidate: [2 1 1 0 1 0 1 0 1 2 0 0 2 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  0  1 -1  0  1 -1  0  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 10, 13, 16, 17]), Candidate: [ 2  1  1  0  1  0  1  0  1  2 -1  1  2  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  0  0  1 -1  1  0 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 11, 13, 14, 18]), Candidate: [ 2  1  1  0  1  0  1  0  1  1  1  0  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  0  0  0  1 -1  1  0 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 12, 14, 15, 19]), Candidate: [2 1 1 0 1 0 1 0 1 1 0 2 0 2 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 1000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  0  0  0  0  0  0  1 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 15, 17, 18, 19]), Candidate: [2 1 1 0 1 0 1 0 1 1 0 1 1 1 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 1050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0 -1  0  0  0  0  0  1 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 15, 19]), Candidate: [2 1 1 0 0 2 1 0 0 1 0 1 1 1 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 1100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  1 -1  0  0  0  0  0  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 9, 17, 19]), Candidate: [ 2  1  1  0  0  2  1 -1  2  0  0  1  1  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  0  0  1 -1  1 -1  0  0  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 11, 13, 19]), Candidate: [ 2  1  1  0  0  2  1 -1  1  1  1  0  2  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  0  0  0  0  1 -1  0  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 13, 17, 19]), Candidate: [ 2  1  1  0  0  2  1 -1  1  1  0  1  2  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1  0 -1  0  0  1 -1  0  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 8, 9, 13, 18]), Candidate: [2 1 1 0 0 2 0 1 1 0 0 1 2 0 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 1300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1 -1  1 -1  0  0  0  0  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 8, 10, 17, 18]), Candidate: [ 2  1  1  0  0  2  0  1  0  2 -1  1  1  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1 -1  0  0  1 -1  0  0  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 6, 8, 12, 17, 19]), Candidate: [2 1 1 0 0 2 0 1 0 1 0 2 0 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 1400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  1  0 -1  1 -1  0  0  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 9, 10, 12, 18]), Candidate: [ 2  1  1  0  0  2  0  0  2  1 -1  2  0  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  1 -1  1 -1  0  0  0  0  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 6, 9, 11, 18, 19]), Candidate: [2 1 1 0 0 2 0 0 2 0 1 0 1 1 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 1500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  1 -1  0  0  0  0  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 9, 15, 17, 18]), Candidate: [2 1 1 0 0 2 0 0 2 0 0 1 1 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 1550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  0  1 -1  1 -1  0  0  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 6, 10, 12, 16, 17]), Candidate: [ 2  1  1  0  0  2  0  0  1  2 -1  2  0  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  0  0  1  0 -1  1 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 11, 12, 14, 18]), Candidate: [ 2  1  1  0  0  2  0  0  1  1  1  1  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  0  0  0  1  0  0 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 12, 13, 14, 18]), Candidate: [ 2  1  1  0  0  2  0  0  1  1  0  2  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  0  0  0  0  1 -1  0  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 6, 13, 16, 18, 19]), Candidate: [2 1 1 0 0 2 0 0 1 1 0 1 2 0 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 1750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0  0 -1  0  0  0  1 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 7, 8, 9, 14, 18]), Candidate: [ 2  1  1  0  0  1  2  0  1  0  0  1  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0 -1  0  1  0 -1  0  1 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 7, 8, 11, 12, 15]), Candidate: [2 1 1 0 0 1 2 0 0 1 1 1 0 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 1850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0 -1  0  0  0  1  0 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 7, 8, 13, 14, 18]), Candidate: [ 2  1  1  0  0  1  2  0  0  1  0  1  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  1  0 -1  0  1 -1  0  0  1 -1  0  1] (Indices: [0, 1, 2, 3, 4, 7, 9, 10, 13, 17]), Candidate: [ 2  1  1  0  0  1  2 -1  2  1 -1  1  2  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  1 -1  0  1  0 -1  0  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 7, 9, 12, 13, 18]), Candidate: [ 2  1  1  0  0  1  2 -1  2  0  0  2  1  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  1 -1  0  0  0  0  0  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 7, 9, 16, 18, 19]), Candidate: [ 2  1  1  0  0  1  2 -1  2  0  0  1  1  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  0  1 -1  1 -1  0  0  0  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 7, 10, 12, 18, 19]), Candidate: [ 2  1  1  0  0  1  2 -1  1  2 -1  2  0  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  0  0  1  0 -1  0  1 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 7, 11, 12, 15, 19]), Candidate: [ 2  1  1  0  0  1  2 -1  1  1  1  1  0  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  0  0  0  1  0 -1  1 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 7, 12, 13, 15, 19]), Candidate: [ 2  1  1  0  0  1  2 -1  1  1  0  2  1  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  0  0  0  0  0  1  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 4, 7, 14, 15, 17, 18]), Candidate: [ 2  1  1  0  0  1  2 -1  1  1  0  1  1  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1  0 -1  1  0 -1  0  1 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 8, 9, 11, 12, 15]), Candidate: [2 1 1 0 0 1 1 1 1 0 1 1 0 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 2300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1  0 -1  0  0  1  0 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 8, 9, 13, 14, 18]), Candidate: [ 2  1  1  0  0  1  1  1  1  0  0  1  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1 -1  1  0 -1  0  0  1  0 -1  0  0  1] (Indices: [0, 1, 2, 3, 4, 8, 10, 11, 15, 16]), Candidate: [2 1 1 0 0 1 1 1 0 2 0 0 1 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 2400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1 -1  1 -1  0  0  1 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 8, 10, 14, 16, 17]), Candidate: [ 2  1  1  0  0  1  1  1  0  2 -1  1  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1 -1  0  1 -1  1 -1  0  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 8, 11, 13, 17, 19]), Candidate: [2 1 1 0 0 1 1 1 0 1 1 0 2 0 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 2500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1 -1  0  0  1 -1  0  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 4, 8, 12, 15, 17, 18]), Candidate: [2 1 1 0 0 1 1 1 0 1 0 2 0 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 2550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  1  0  0 -1  1 -1  1 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 9, 10, 11, 13, 15]), Candidate: [2 1 1 0 0 1 1 0 2 1 0 0 2 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 2600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  1  0 -1  0  1 -1  0  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 9, 10, 13, 16, 17]), Candidate: [ 2  1  1  0  0  1  1  0  2  1 -1  1  2  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  1 -1  1 -1  1  0 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 9, 11, 13, 14, 18]), Candidate: [ 2  1  1  0  0  1  1  0  2  0  1  0  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  1 -1  0  1 -1  1  0 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 9, 12, 14, 15, 19]), Candidate: [2 1 1 0 0 1 1 0 2 0 0 2 0 2 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 2750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  1 -1  0  0  0  0  1 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 9, 15, 17, 18, 19]), Candidate: [2 1 1 0 0 1 1 0 2 0 0 1 1 1 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 2800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  0  1  0 -1  0  0  1  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 10, 11, 15, 16, 19]), Candidate: [2 1 1 0 0 1 1 0 1 2 0 0 1 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 2850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  0  1 -1  0  1  0 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 4, 10, 13, 14, 17, 18]), Candidate: [ 2  1  1  0  0  1  1  0  1  2 -1  1  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  0  0  1  0 -1  1 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 4, 11, 12, 14, 17, 18]), Candidate: [ 2  1  1  0  0  1  1  0  1  1  1  1  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  0  0  0  1  0  0  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 12, 13, 14, 15, 18]), Candidate: [2 1 1 0 0 1 1 0 1 1 0 2 1 1 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 3000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  0  0  0  0  0  1  0  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 14, 15, 16, 18, 19]), Candidate: [2 1 1 0 0 1 1 0 1 1 0 1 1 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 3050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0 -1  0  0  0  0  0  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 15, 17]), Candidate: [ 2  1  1 -1  2  1  1  0  0  1  0  1  1  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  1 -1  0  0  0  0  0  1 -1  0  1  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 9, 16, 19]), Candidate: [ 2  1  1 -1  2  1  1 -1  2  0  0  1  1  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  0  0  1 -1  1 -1  0  0  1 -1  0  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 11, 13, 17]), Candidate: [ 2  1  1 -1  2  1  1 -1  1  1  1  0  2  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  0  0  0  0  1 -1  0  1 -1  0  1  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 13, 16, 19]), Candidate: [ 2  1  1 -1  2  1  1 -1  1  1  0  1  2  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1  0 -1  0  0  1 -1  0  1 -1  0  0  1] (Indices: [0, 1, 2, 3, 5, 6, 8, 9, 13, 16]), Candidate: [ 2  1  1 -1  2  1  0  1  1  0  0  1  2  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1 -1  1 -1  0  0  0  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 8, 10, 16, 18]), Candidate: [ 2  1  1 -1  2  1  0  1  0  2 -1  1  1  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1 -1  0  0  1 -1  0  0  1 -1  0  1  0] (Indices: [0, 1, 2, 3, 5, 6, 8, 12, 16, 19]), Candidate: [ 2  1  1 -1  2  1  0  1  0  1  0  2  0  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  1  0 -1  1 -1  0  0  1 -1  0  0  1] (Indices: [0, 1, 2, 3, 5, 6, 9, 10, 12, 16]), Candidate: [ 2  1  1 -1  2  1  0  0  2  1 -1  2  0  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  1 -1  1 -1  0  0  0  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 9, 11, 17, 18]), Candidate: [ 2  1  1 -1  2  1  0  0  2  0  1  0  1  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  1 -1  0  0  0  0  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 9, 15, 16, 18]), Candidate: [ 2  1  1 -1  2  1  0  0  2  0  0  1  1  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  0  1 -1  1 -1  0  1 -1  0  1 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 10, 12, 15, 18]), Candidate: [ 2  1  1 -1  2  1  0  0  1  2 -1  2  0  1  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  0  0  1  0 -1  1 -1  1 -1  0  0  1] (Indices: [0, 1, 2, 3, 5, 6, 11, 12, 14, 16]), Candidate: [ 2  1  1 -1  2  1  0  0  1  1  1  1  0  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  0  0  0  1  0  0 -1  1 -1  0  0  1] (Indices: [0, 1, 2, 3, 5, 6, 12, 13, 14, 16]), Candidate: [ 2  1  1 -1  2  1  0  0  1  1  0  2  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  0  0  0  0  1 -1  0  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 13, 16, 17, 18]), Candidate: [ 2  1  1 -1  2  1  0  0  1  1  0  1  2  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0  0 -1  0  0  0  1 -1  1 -1  0  0  1] (Indices: [0, 1, 2, 3, 5, 7, 8, 9, 14, 16]), Candidate: [ 2  1  1 -1  2  0  2  0  1  0  0  1  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0 -1  0  1  0  0 -1  0  0  0  0  0  1] (Indices: [0, 1, 2, 3, 5, 7, 8, 11, 12, 13]), Candidate: [ 2  1  1 -1  2  0  2  0  0  1  1  1  1  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0 -1  0  0  0  1  0 -1  1 -1  0  0  1] (Indices: [0, 1, 2, 3, 5, 7, 8, 13, 14, 16]), Candidate: [ 2  1  1 -1  2  0  2  0  0  1  0  1  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  1  0 -1  0  1 -1  1 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 5, 7, 9, 10, 13, 15]), Candidate: [ 2  1  1 -1  2  0  2 -1  2  1 -1  1  2  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 3950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  1 -1  0  1  0 -1  0  1 -1  0  0  1] (Indices: [0, 1, 2, 3, 5, 7, 9, 12, 13, 16]), Candidate: [ 2  1  1 -1  2  0  2 -1  2  0  0  2  1  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  1 -1  0  0  0  0  0  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 5, 7, 9, 16, 17, 18]), Candidate: [ 2  1  1 -1  2  0  2 -1  2  0  0  1  1  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  0  1 -1  1 -1  0  0  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 5, 7, 10, 12, 17, 18]), Candidate: [ 2  1  1 -1  2  0  2 -1  1  2 -1  2  0  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 4100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  0  0  1  0 -1  0  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 5, 7, 11, 12, 15, 17]), Candidate: [ 2  1  1 -1  2  0  2 -1  1  1  1  1  0  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  0  0  0  1  0 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 5, 7, 12, 13, 15, 17]), Candidate: [ 2  1  1 -1  2  0  2 -1  1  1  0  2  1  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  0  0  0  0  0  1  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 5, 7, 14, 15, 16, 18]), Candidate: [ 2  1  1 -1  2  0  2 -1  1  1  0  1  1  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1  0 -1  1  0  0 -1  0  0  0  0  0  1] (Indices: [0, 1, 2, 3, 5, 8, 9, 11, 12, 13]), Candidate: [ 2  1  1 -1  2  0  1  1  1  0  1  1  1  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1  0 -1  0  0  1  0 -1  1 -1  0  0  1] (Indices: [0, 1, 2, 3, 5, 8, 9, 13, 14, 16]), Candidate: [ 2  1  1 -1  2  0  1  1  1  0  0  1  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1 -1  1  0 -1  0  1 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 5, 8, 10, 11, 14, 18]), Candidate: [ 2  1  1 -1  2  0  1  1  0  2  0  0  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1 -1  1 -1  0  0  1  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 3, 5, 8, 10, 14, 15, 18]), Candidate: [ 2  1  1 -1  2  0  1  1  0  2 -1  1  1  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1 -1  0  1 -1  1 -1  0  1 -1  0  1  0] (Indices: [0, 1, 2, 3, 5, 8, 11, 13, 16, 19]), Candidate: [ 2  1  1 -1  2  0  1  1  0  1  1  0  2  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1 -1  0  0  1 -1  0  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 5, 8, 12, 15, 16, 18]), Candidate: [ 2  1  1 -1  2  0  1  1  0  1  0  2  0  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  1  0  0  0 -1  0  0  0  0  0  1  0] (Indices: [0, 1, 2, 3, 5, 9, 10, 11, 12, 19]), Candidate: [ 2  1  1 -1  2  0  1  0  2  1  0  1  0  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  1  0 -1  0  1 -1  1 -1  0  1 -1  1] (Indices: [0, 1, 2, 3, 5, 9, 10, 13, 15, 18]), Candidate: [ 2  1  1 -1  2  0  1  0  2  1 -1  1  2  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  1 -1  1 -1  1  0 -1  1 -1  0  0  1] (Indices: [0, 1, 2, 3, 5, 9, 11, 13, 14, 16]), Candidate: [ 2  1  1 -1  2  0  1  0  2  0  1  0  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  1 -1  0  1 -1  1  0 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 5, 9, 12, 14, 15, 17]), Candidate: [ 2  1  1 -1  2  0  1  0  2  0  0  2  0  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  1 -1  0  0  0  0  1  0  0 -1  1  0] (Indices: [0, 1, 2, 3, 5, 9, 15, 16, 17, 19]), Candidate: [ 2  1  1 -1  2  0  1  0  2  0  0  1  1  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  0  1  0 -1  0  0  1  0  0 -1  0  1] (Indices: [0, 1, 2, 3, 5, 10, 11, 15, 16, 17]), Candidate: [ 2  1  1 -1  2  0  1  0  1  2  0  0  1  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  0  1 -1  0  1  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 3, 5, 10, 13, 14, 16, 18]), Candidate: [ 2  1  1 -1  2  0  1  0  1  2 -1  1  2  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 4900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  0  0  1  0 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 3, 5, 11, 12, 14, 16, 18]), Candidate: [ 2  1  1 -1  2  0  1  0  1  1  1  1  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  0  0  0  1  0  0  0  0 -1  0  0  1] (Indices: [0, 1, 2, 3, 5, 12, 13, 14, 15, 16]), Candidate: [ 2  1  1 -1  2  0  1  0  1  1  0  2  1  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  0  0  0  0  0  1  0  0  0  0 -1  1] (Indices: [0, 1, 2, 3, 5, 14, 15, 16, 17, 18]), Candidate: [ 2  1  1 -1  2  0  1  0  1  1  0  1  1  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0  0 -1  0  0  0  0  0  0  0  1  0  0] (Indices: [0, 1, 2, 3, 6, 7, 8, 9, 18, 19]), Candidate: [ 2  1  1 -1  1  2  1  0  1  0  0  1  1  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0 -1  0  1 -1  0  1  0 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 6, 7, 8, 11, 14, 15]), Candidate: [ 2  1  1 -1  1  2  1  0  0  1  1  0  1  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0 -1  0  0  0  1 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 3, 6, 7, 8, 13, 18, 19]), Candidate: [ 2  1  1 -1  1  2  1  0  0  1  0  1  2  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  1  0 -1  0  0  0  1 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 6, 7, 9, 10, 15, 19]), Candidate: [ 2  1  1 -1  1  2  1 -1  2  1 -1  1  1  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 5250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  1 -1  0  1 -1  0  0  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 6, 7, 9, 12, 16, 17]), Candidate: [ 2  1  1 -1  1  2  1 -1  2  0  0  2  0  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  0  1  0 -1  1 -1  0  1 -1  0  0  1] (Indices: [0, 1, 2, 3, 6, 7, 10, 11, 13, 16]), Candidate: [ 2  1  1 -1  1  2  1 -1  1  2  0  0  2  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  0  1 -1  0  1 -1  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 3, 6, 7, 10, 13, 16, 18]), Candidate: [ 2  1  1 -1  1  2  1 -1  1  2 -1  1  2  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 5400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  0  0  1 -1  1  0 -1  0  0  0  1  0] (Indices: [0, 1, 2, 3, 6, 7, 11, 13, 14, 19]), Candidate: [ 2  1  1 -1  1  2  1 -1  1  1  1  0  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 5450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  0  0  0  1 -1  1 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 6, 7, 12, 14, 16, 17]), Candidate: [ 2  1  1 -1  1  2  1 -1  1  1  0  2  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 5500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  0  0  0  0  0  0  0  1  0  0  0  0] (Indices: [0, 1, 2, 3, 6, 7, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  2  1 -1  1  1  0  1  1  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1  0 -1  1 -1  0  1  0 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 6, 8, 9, 11, 14, 15]), Candidate: [ 2  1  1 -1  1  2  0  1  1  0  1  0  1  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1  0 -1  0  0  1 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 3, 6, 8, 9, 13, 18, 19]), Candidate: [ 2  1  1 -1  1  2  0  1  1  0  0  1  2  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1 -1  1 -1  1  0 -1  1 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 6, 8, 10, 12, 13, 15]), Candidate: [ 2  1  1 -1  1  2  0  1  0  2 -1  2  1  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1 -1  1 -1  0  0  0  1 -1  0  1  0  0] (Indices: [0, 1, 2, 3, 6, 8, 10, 15, 18, 19]), Candidate: [ 2  1  1 -1  1  2  0  1  0  2 -1  1  1  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1 -1  0  1 -1  0  1 -1  0  0  1  0  0] (Indices: [0, 1, 2, 3, 6, 8, 11, 14, 18, 19]), Candidate: [ 2  1  1 -1  1  2  0  1  0  1  1  0  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1 -1  0  0  0  1  0 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 6, 8, 13, 14, 16, 17]), Candidate: [ 2  1  1 -1  1  2  0  1  0  1  0  1  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  1  0  0 -1  0  0  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 6, 9, 10, 11, 15, 17]), Candidate: [ 2  1  1 -1  1  2  0  0  2  1  0  0  1  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  1  0 -1  0  0  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 3, 6, 9, 10, 14, 16, 18]), Candidate: [ 2  1  1 -1  1  2  0  0  2  1 -1  1  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 5950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  1 -1  1 -1  1 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 3, 6, 9, 11, 13, 18, 19]), Candidate: [ 2  1  1 -1  1  2  0  0  2  0  1  0  2  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  1 -1  0  1 -1  0  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 6, 9, 12, 15, 17, 19]), Candidate: [ 2  1  1 -1  1  2  0  0  2  0  0  2  0  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  0  1  0  0 -1  1 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 6, 10, 11, 12, 14, 18]), Candidate: [ 2  1  1 -1  1  2  0  0  1  2  0  1  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  0  1 -1  1  0  0 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 6, 10, 12, 13, 14, 18]), Candidate: [ 2  1  1 -1  1  2  0  0  1  2 -1  2  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 6150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  0  1 -1  0  1 -1  0  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 6, 10, 13, 16, 18, 19]), Candidate: [ 2  1  1 -1  1  2  0  0  1  2 -1  1  2  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  0  0  1  0 -1  0  0  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 6, 11, 12, 16, 18, 19]), Candidate: [ 2  1  1 -1  1  2  0  0  1  1  1  1  0  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  0  0  0  1  0 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 6, 12, 13, 15, 17, 18]), Candidate: [ 2  1  1 -1  1  2  0  0  1  1  0  2  1  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0  0  0  0 -1  0  0  0  0  0  0  1  0] (Indices: [0, 1, 2, 3, 7, 8, 9, 10, 11, 19]), Candidate: [ 2  1  1 -1  1  1  2  0  1  1  0  0  1  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0  0 -1  1 -1  0  0  1 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 7, 8, 9, 11, 15, 19]), Candidate: [ 2  1  1 -1  1  1  2  0  1  0  1  0  1  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0  0 -1  0  0  0  1 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 7, 8, 9, 14, 17, 18]), Candidate: [ 2  1  1 -1  1  1  2  0  1  0  0  1  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0 -1  1 -1  1 -1  1 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 7, 8, 10, 12, 14, 18]), Candidate: [ 2  1  1 -1  1  1  2  0  0  2 -1  2  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 6500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0 -1  0  1  0  0 -1  0  0  1 -1  0  1] (Indices: [0, 1, 2, 3, 7, 8, 11, 12, 13, 17]), Candidate: [ 2  1  1 -1  1  1  2  0  0  1  1  1  1  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0 -1  0  1 -1  0  0  0  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 7, 8, 11, 16, 17, 19]), Candidate: [ 2  1  1 -1  1  1  2  0  0  1  1  0  1  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0 -1  0  0  0  1 -1  1  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 7, 8, 13, 15, 16, 19]), Candidate: [ 2  1  1 -1  1  1  2  0  0  1  0  1  2  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  1  0  0 -1  0  0  0  0  0  1  0  0] (Indices: [0, 1, 2, 3, 7, 9, 10, 11, 18, 19]), Candidate: [ 2  1  1 -1  1  1  2 -1  2  1  0  0  1  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  1  0 -1  0  0  0  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 7, 9, 10, 15, 17, 18]), Candidate: [ 2  1  1 -1  1  1  2 -1  2  1 -1  1  1  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 6750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  1 -1  1 -1  0  1 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 7, 9, 11, 14, 17, 18]), Candidate: [ 2  1  1 -1  1  1  2 -1  2  0  1  0  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 6800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  1 -1  0  0  1  0  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 3, 7, 9, 13, 14, 15, 18]), Candidate: [ 2  1  1 -1  1  1  2 -1  2  0  0  1  2  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  0  1  0  0 -1  0  0  1 -1  0  1  0] (Indices: [0, 1, 2, 3, 7, 10, 11, 12, 16, 19]), Candidate: [ 2  1  1 -1  1  1  2 -1  1  2  0  1  0  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  0  1 -1  1  0 -1  0  1 -1  0  1  0] (Indices: [0, 1, 2, 3, 7, 10, 12, 13, 16, 19]), Candidate: [ 2  1  1 -1  1  1  2 -1  1  2 -1  2  1  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 6950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  0  1 -1  0  0  1 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 7, 10, 14, 16, 17, 18]), Candidate: [ 2  1  1 -1  1  1  2 -1  1  2 -1  1  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 7000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  0  0  1 -1  1  0 -1  1 -1  0  1  0] (Indices: [0, 1, 2, 3, 7, 11, 13, 14, 16, 19]), Candidate: [ 2  1  1 -1  1  1  2 -1  1  1  1  0  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 7050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  0  0  0  1 -1  1  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 7, 12, 14, 15, 16, 18]), Candidate: [ 2  1  1 -1  1  1  2 -1  1  1  0  2  0  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1  0  0  0 -1  0  1 -1  0  1 -1  0  1] (Indices: [0, 1, 2, 3, 8, 9, 10, 11, 14, 17]), Candidate: [ 2  1  1 -1  1  1  1  1  1  1  0  0  1  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1  0  0 -1  0  0  1  0 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 8, 9, 10, 14, 15, 17]), Candidate: [ 2  1  1 -1  1  1  1  1  1  1 -1  1  1  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1  0 -1  1 -1  1 -1  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 3, 8, 9, 11, 13, 16, 18]), Candidate: [ 2  1  1 -1  1  1  1  1  1  0  1  0  2  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1  0 -1  0  1 -1  0  1  0  0 -1  0  1] (Indices: [0, 1, 2, 3, 8, 9, 12, 15, 16, 17]), Candidate: [ 2  1  1 -1  1  1  1  1  1  0  0  2  0  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1 -1  1  0  0  0 -1  0  0  0  0  1  0] (Indices: [0, 1, 2, 3, 8, 10, 11, 12, 13, 19]), Candidate: [ 2  1  1 -1  1  1  1  1  0  2  0  1  1  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1 -1  1  0 -1  0  0  0  0  1  0  0  0] (Indices: [0, 1, 2, 3, 8, 10, 11, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  1  1  1  0  2  0  0  1  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1 -1  1 -1  0  1 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 8, 10, 13, 15, 17, 19]), Candidate: [ 2  1  1 -1  1  1  1  1  0  2 -1  1  2  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1 -1  0  1  0 -1  0  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 8, 11, 12, 15, 17, 19]), Candidate: [ 2  1  1 -1  1  1  1  1  0  1  1  1  0  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1 -1  0  0  1  0  0 -1  0  0  1  0  0] (Indices: [0, 1, 2, 3, 8, 12, 13, 14, 18, 19]), Candidate: [ 2  1  1 -1  1  1  1  1  0  1  0  2  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  1  0  0  0  0 -1  0  0  1 -1  0  1] (Indices: [0, 1, 2, 3, 9, 10, 11, 12, 13, 17]), Candidate: [ 2  1  1 -1  1  1  1  0  2  1  0  1  1  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  1  0  0 -1  0  0  0  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 9, 10, 11, 16, 17, 19]), Candidate: [ 2  1  1 -1  1  1  1  0  2  1  0  0  1  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  1  0 -1  0  1 -1  1  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 9, 10, 13, 15, 16, 19]), Candidate: [ 2  1  1 -1  1  1  1  0  2  1 -1  1  2  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  1 -1  1  0 -1  0  1  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 9, 11, 12, 15, 16, 19]), Candidate: [ 2  1  1 -1  1  1  1  0  2  0  1  1  0  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  1 -1  0  1  0  0 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 9, 12, 13, 14, 17, 18]), Candidate: [ 2  1  1 -1  1  1  1  0  2  0  0  2  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  0  1  0  0  0  0 -1  1 -1  0  0  1] (Indices: [0, 1, 2, 3, 10, 11, 12, 13, 14, 16]), Candidate: [ 2  1  1 -1  1  1  1  0  1  2  0  1  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  0  1  0 -1  1 -1  0  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 10, 11, 13, 16, 17, 18]), Candidate: [ 2  1  1 -1  1  1  1  0  1  2  0  0  2  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  0  1 -1  1 -1  0  1  0  0 -1  1  0] (Indices: [0, 1, 2, 3, 10, 12, 15, 16, 17, 19]), Candidate: [ 2  1  1 -1  1  1  1  0  1  2 -1  2  0  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  0  0  1  0 -1  1  0 -1  0  1  0  0] (Indices: [0, 1, 2, 3, 11, 12, 14, 15, 18, 19]), Candidate: [ 2  1  1 -1  1  1  1  0  1  1  1  1  0  2  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  0  0  0  1 -1  1 -1  1  0  0  0  0] (Indices: [0, 1, 2, 3, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  1  1  0  1  1  0  2  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0 -1  0  0  0  0  1 -1  1 -1  0  0  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 14, 16]), Candidate: [ 2  1  0  1  1  1  1  0  0  1  0  1  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  1 -1  0  0  0  0  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 9, 15, 17]), Candidate: [ 2  1  0  1  1  1  1 -1  2  0  0  1  1  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  0  0  1  0 -1  0  0  0  0  1 -1  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 11, 12, 18]), Candidate: [ 2  1  0  1  1  1  1 -1  1  1  1  1  0  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  0  0  0  0  1 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 13, 15, 17]), Candidate: [ 2  1  0  1  1  1  1 -1  1  1  0  1  2  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1  0 -1  0  1 -1  0  0  0  1 -1  0  1] (Indices: [0, 1, 2, 4, 5, 6, 8, 9, 12, 17]), Candidate: [2 1 0 1 1 1 0 1 1 0 0 2 0 1 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 8300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1 -1  1 -1  0  0  0  1  0 -1  0  0  1] (Indices: [0, 1, 2, 4, 5, 6, 8, 10, 15, 16]), Candidate: [ 2  1  0  1  1  1  0  1  0  2 -1  1  1  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1 -1  0  0  1 -1  0  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 4, 5, 6, 8, 12, 15, 17]), Candidate: [2 1 0 1 1 1 0 1 0 1 0 2 0 1 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 8400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  1  0  0 -1  0  0  0  0  0  1 -1  1] (Indices: [0, 1, 2, 4, 5, 6, 9, 10, 11, 18]), Candidate: [2 1 0 1 1 1 0 0 2 1 0 0 1 1 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 8450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  1 -1  1 -1  0  0  1 -1  0  1 -1  1] (Indices: [0, 1, 2, 4, 5, 6, 9, 11, 15, 18]), Candidate: [2 1 0 1 1 1 0 0 2 0 1 0 1 1 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 8500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  1 -1  0  0  0  1 -1  1 -1  0  1  0] (Indices: [0, 1, 2, 4, 5, 6, 9, 14, 16, 19]), Candidate: [ 2  1  0  1  1  1  0  0  2  0  0  1  1  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  0  1 -1  1 -1  1 -1  0  1 -1  0  1] (Indices: [0, 1, 2, 4, 5, 6, 10, 12, 14, 17]), Candidate: [ 2  1  0  1  1  1  0  0  1  2 -1  2  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  0  0  1  0  0 -1  0  1 -1  0  0  1] (Indices: [0, 1, 2, 4, 5, 6, 11, 12, 13, 16]), Candidate: [2 1 0 1 1 1 0 0 1 1 1 1 1 0 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 8650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  0  0  1 -1  0  0  0  1  0  0 -1  1] (Indices: [0, 1, 2, 4, 5, 6, 11, 16, 17, 18]), Candidate: [2 1 0 1 1 1 0 0 1 1 1 0 1 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 8700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  0  0  0  0  1 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 4, 5, 6, 13, 15, 16, 18]), Candidate: [2 1 0 1 1 1 0 0 1 1 0 1 2 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 8750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0  0 -1  0  0  1 -1  0  1 -1  0  0  1] (Indices: [0, 1, 2, 4, 5, 7, 8, 9, 13, 16]), Candidate: [2 1 0 1 1 0 2 0 1 0 0 1 2 0 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 8800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0 -1  1 -1  0  0  0  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 4, 5, 7, 8, 10, 16, 18]), Candidate: [ 2  1  0  1  1  0  2  0  0  2 -1  1  1  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0 -1  0  0  1 -1  0  0  1 -1  0  1  0] (Indices: [0, 1, 2, 4, 5, 7, 8, 12, 16, 19]), Candidate: [2 1 0 1 1 0 2 0 0 1 0 2 0 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 8900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  1  0 -1  1 -1  0  0  1 -1  0  0  1] (Indices: [0, 1, 2, 4, 5, 7, 9, 10, 12, 16]), Candidate: [ 2  1  0  1  1  0  2 -1  2  1 -1  2  0  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  1 -1  1 -1  0  0  0  0  1  0 -1  1] (Indices: [0, 1, 2, 4, 5, 7, 9, 11, 17, 18]), Candidate: [ 2  1  0  1  1  0  2 -1  2  0  1  0  1  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  1 -1  0  0  0  0  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 4, 5, 7, 9, 15, 16, 18]), Candidate: [ 2  1  0  1  1  0  2 -1  2  0  0  1  1  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  0  1 -1  1 -1  0  1 -1  0  1 -1  1] (Indices: [0, 1, 2, 4, 5, 7, 10, 12, 15, 18]), Candidate: [ 2  1  0  1  1  0  2 -1  1  2 -1  2  0  1  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  0  0  1  0 -1  1 -1  1 -1  0  0  1] (Indices: [0, 1, 2, 4, 5, 7, 11, 12, 14, 16]), Candidate: [ 2  1  0  1  1  0  2 -1  1  1  1  1  0  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  0  0  0  1  0  0 -1  1 -1  0  0  1] (Indices: [0, 1, 2, 4, 5, 7, 12, 13, 14, 16]), Candidate: [ 2  1  0  1  1  0  2 -1  1  1  0  2  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  0  0  0  0  1 -1  0  1  0  0 -1  1] (Indices: [0, 1, 2, 4, 5, 7, 13, 16, 17, 18]), Candidate: [ 2  1  0  1  1  0  2 -1  1  1  0  1  2  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1  0  0 -1  0  0  0  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 4, 5, 8, 9, 10, 16, 18]), Candidate: [ 2  1  0  1  1  0  1  1  1  1 -1  1  1  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1  0 -1  0  1 -1  0  0  1 -1  0  1  0] (Indices: [0, 1, 2, 4, 5, 8, 9, 12, 16, 19]), Candidate: [2 1 0 1 1 0 1 1 1 0 0 2 0 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 9350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1 -1  1  0 -1  1 -1  0  0  0  1 -1  1] (Indices: [0, 1, 2, 4, 5, 8, 10, 11, 13, 18]), Candidate: [2 1 0 1 1 0 1 1 0 2 0 0 2 0 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 9400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1 -1  1 -1  0  1 -1  0  0  1  0 -1  1] (Indices: [0, 1, 2, 4, 5, 8, 10, 13, 17, 18]), Candidate: [ 2  1  0  1  1  0  1  1  0  2 -1  1  2  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1 -1  0  1 -1  1 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 4, 5, 8, 11, 13, 15, 17]), Candidate: [2 1 0 1 1 0 1 1 0 1 1 0 2 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 9500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1 -1  0  0  1 -1  1 -1  1 -1  0  1  0] (Indices: [0, 1, 2, 4, 5, 8, 12, 14, 16, 19]), Candidate: [ 2  1  0  1  1  0  1  1  0  1  0  2  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  1  0  0  0 -1  1 -1  0  0  0  0  1] (Indices: [0, 1, 2, 4, 5, 9, 10, 11, 12, 14]), Candidate: [ 2  1  0  1  1  0  1  0  2  1  0  1  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  1  0 -1  0  1  0 -1  0  1 -1  0  1] (Indices: [0, 1, 2, 4, 5, 9, 10, 13, 14, 17]), Candidate: [ 2  1  0  1  1  0  1  0  2  1 -1  1  2  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  1 -1  1  0 -1  0  0  1 -1  0  1  0] (Indices: [0, 1, 2, 4, 5, 9, 11, 12, 16, 19]), Candidate: [2 1 0 1 1 0 1 0 2 0 1 1 0 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 9700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  1 -1  0  1  0 -1  0  1 -1  0  1  0] (Indices: [0, 1, 2, 4, 5, 9, 12, 13, 16, 19]), Candidate: [2 1 0 1 1 0 1 0 2 0 0 2 1 0 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 9750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  1 -1  0  0  0  1 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 4, 5, 9, 14, 16, 17, 18]), Candidate: [ 2  1  0  1  1  0  1  0  2  0  0  1  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  0  1  0 -1  0  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 4, 5, 10, 11, 14, 16, 18]), Candidate: [ 2  1  0  1  1  0  1  0  1  2  0  0  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  0  1 -1  0  1  0  0  0 -1  0  0  1] (Indices: [0, 1, 2, 4, 5, 10, 13, 14, 15, 16]), Candidate: [ 2  1  0  1  1  0  1  0  1  2 -1  1  2  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  0  0  1  0 -1  1  0  0 -1  0  0  1] (Indices: [0, 1, 2, 4, 5, 11, 12, 14, 15, 16]), Candidate: [2 1 0 1 1 0 1 0 1 1 1 1 0 2 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 9950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  0  0  1 -1  0  0  1  0  0  0 -1  1] (Indices: [0, 1, 2, 4, 5, 11, 15, 16, 17, 18]), Candidate: [2 1 0 1 1 0 1 0 1 1 1 0 1 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 10000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  0  0  0  0  1 -1  1  0  0  0 -1  1] (Indices: [0, 1, 2, 4, 5, 13, 15, 16, 17, 18]), Candidate: [2 1 0 1 1 0 1 0 1 1 0 1 2 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 10050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0  0 -1  0  0  0  0  0  1  0 -1  0  1] (Indices: [0, 1, 2, 4, 6, 7, 8, 9, 16, 17]), Candidate: [2 1 0 1 0 2 1 0 1 0 0 1 1 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 10100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0 -1  0  1 -1  1 -1  1 -1  0  0  0  1] (Indices: [0, 1, 2, 4, 6, 7, 8, 11, 13, 15]), Candidate: [2 1 0 1 0 2 1 0 0 1 1 0 2 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 10150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0 -1  0  0  0  1 -1  0  1  0 -1  0  1] (Indices: [0, 1, 2, 4, 6, 7, 8, 13, 16, 17]), Candidate: [2 1 0 1 0 2 1 0 0 1 0 1 2 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 10200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  1  0 -1  0  0  1 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 4, 6, 7, 9, 10, 14, 18]), Candidate: [ 2  1  0  1  0  2  1 -1  2  1 -1  1  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 10250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  1 -1  0  1 -1  1 -1  0  0  0  1  0] (Indices: [0, 1, 2, 4, 6, 7, 9, 12, 14, 19]), Candidate: [ 2  1  0  1  0  2  1 -1  2  0  0  2  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  0  1  0  0 -1  0  0  0  1 -1  0  1] (Indices: [0, 1, 2, 4, 6, 7, 10, 11, 12, 17]), Candidate: [ 2  1  0  1  0  2  1 -1  1  2  0  1  0  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  0  1 -1  0  1 -1  1  0 -1  0  0  1] (Indices: [0, 1, 2, 4, 6, 7, 10, 13, 15, 16]), Candidate: [ 2  1  0  1  0  2  1 -1  1  2 -1  1  2  0  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  0  0  1  0 -1  0  0  0  0  1  0  0] (Indices: [0, 1, 2, 4, 6, 7, 11, 12, 18, 19]), Candidate: [ 2  1  0  1  0  2  1 -1  1  1  1  1  0  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  0  0  0  1  0 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 4, 6, 7, 12, 13, 18, 19]), Candidate: [ 2  1  0  1  0  2  1 -1  1  1  0  2  1  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  0  0  0  0  0  1 -1  0  1  0  0  0] (Indices: [0, 1, 2, 4, 6, 7, 14, 17, 18, 19]), Candidate: [ 2  1  0  1  0  2  1 -1  1  1  0  1  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1  0 -1  1 -1  1 -1  1 -1  0  0  0  1] (Indices: [0, 1, 2, 4, 6, 8, 9, 11, 13, 15]), Candidate: [2 1 0 1 0 2 0 1 1 0 1 0 2 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 10600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1  0 -1  0  0  1 -1  0  1  0 -1  0  1] (Indices: [0, 1, 2, 4, 6, 8, 9, 13, 16, 17]), Candidate: [2 1 0 1 0 2 0 1 1 0 0 1 2 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 10650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1 -1  1  0 -1  0  0  0  1 -1  0  1  0] (Indices: [0, 1, 2, 4, 6, 8, 10, 11, 16, 19]), Candidate: [2 1 0 1 0 2 0 1 0 2 0 0 1 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 10700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1 -1  1 -1  0  0  0  1  0  0 -1  0  1] (Indices: [0, 1, 2, 4, 6, 8, 10, 15, 16, 17]), Candidate: [ 2  1  0  1  0  2  0  1  0  2 -1  1  1  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1 -1  0  1 -1  0  1 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 4, 6, 8, 11, 14, 16, 17]), Candidate: [ 2  1  0  1  0  2  0  1  0  1  1  0  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1 -1  0  0  1 -1  0  0  0  1  0  0  0] (Indices: [0, 1, 2, 4, 6, 8, 12, 17, 18, 19]), Candidate: [2 1 0 1 0 2 0 1 0 1 0 2 0 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 10850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  1  0  0 -1  0  1 -1  1 -1  0  0  1] (Indices: [0, 1, 2, 4, 6, 9, 10, 11, 14, 16]), Candidate: [ 2  1  0  1  0  2  0  0  2  1  0  0  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  1  0 -1  0  0  1  0  0 -1  0  0  1] (Indices: [0, 1, 2, 4, 6, 9, 10, 14, 15, 16]), Candidate: [ 2  1  0  1  0  2  0  0  2  1 -1  1  1  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  1 -1  1 -1  1 -1  0  1  0 -1  0  1] (Indices: [0, 1, 2, 4, 6, 9, 11, 13, 16, 17]), Candidate: [2 1 0 1 0 2 0 0 2 0 1 0 2 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 11000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  1 -1  0  1 -1  1 -1  0  0  1  0  0] (Indices: [0, 1, 2, 4, 6, 9, 12, 14, 18, 19]), Candidate: [ 2  1  0  1  0  2  0  0  2  0  0  2  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  0  1  0  0  0 -1  0  0  0  1 -1  1] (Indices: [0, 1, 2, 4, 6, 10, 11, 12, 13, 18]), Candidate: [2 1 0 1 0 2 0 0 1 2 0 1 1 0 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 11100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  0  1  0 -1  0  0  0  1 -1  1  0  0] (Indices: [0, 1, 2, 4, 6, 10, 11, 16, 18, 19]), Candidate: [2 1 0 1 0 2 0 0 1 2 0 0 1 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 11150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  0  1 -1  0  1 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 4, 6, 10, 13, 15, 17, 18]), Candidate: [ 2  1  0  1  0  2  0  0  1  2 -1  1  2  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  0  0  1  0 -1  0  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 4, 6, 11, 12, 15, 17, 18]), Candidate: [2 1 0 1 0 2 0 0 1 1 1 1 0 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 11250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  0  0  0  1  0  0 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 4, 6, 12, 13, 14, 17, 19]), Candidate: [ 2  1  0  1  0  2  0  0  1  1  0  2  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0  0  0  0 -1  0  1 -1  0  0  0  0  1] (Indices: [0, 1, 2, 4, 7, 8, 9, 10, 11, 14]), Candidate: [ 2  1  0  1  0  1  2  0  1  1  0  0  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0  0 -1  1 -1  0  1 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 4, 7, 8, 9, 11, 14, 18]), Candidate: [ 2  1  0  1  0  1  2  0  1  0  1  0  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0  0 -1  0  0  0  1  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 4, 7, 8, 9, 14, 15, 18]), Candidate: [2 1 0 1 0 1 2 0 1 0 0 1 1 2 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 11450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0 -1  1 -1  1  0 -1  0  0  0  1 -1  1] (Indices: [0, 1, 2, 4, 7, 8, 10, 12, 13, 18]), Candidate: [ 2  1  0  1  0  1  2  0  0  2 -1  2  1  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0 -1  1 -1  0  0  0  0  1 -1  1  0  0] (Indices: [0, 1, 2, 4, 7, 8, 10, 16, 18, 19]), Candidate: [ 2  1  0  1  0  1  2  0  0  2 -1  1  1  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0 -1  0  1 -1  0  0  1  0 -1  0  1  0] (Indices: [0, 1, 2, 4, 7, 8, 11, 15, 16, 19]), Candidate: [2 1 0 1 0 1 2 0 0 1 1 0 1 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 11600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0 -1  0  0  0  1  0 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 4, 7, 8, 13, 14, 17, 18]), Candidate: [ 2  1  0  1  0  1  2  0  0  1  0  1  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  1  0  0 -1  0  0  0  1  0 -1  0  1] (Indices: [0, 1, 2, 4, 7, 9, 10, 11, 16, 17]), Candidate: [ 2  1  0  1  0  1  2 -1  2  1  0  0  1  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  1  0 -1  0  0  1 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 4, 7, 9, 10, 14, 17, 19]), Candidate: [ 2  1  0  1  0  1  2 -1  2  1 -1  1  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 11750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  1 -1  1 -1  0  1  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 4, 7, 9, 11, 14, 15, 18]), Candidate: [ 2  1  0  1  0  1  2 -1  2  0  1  0  1  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  1 -1  0  1 -1  0  0  1  0 -1  1  0] (Indices: [0, 1, 2, 4, 7, 9, 12, 16, 17, 19]), Candidate: [ 2  1  0  1  0  1  2 -1  2  0  0  2  0  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  0  1  0  0 -1  0  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 4, 7, 10, 11, 12, 15, 17]), Candidate: [ 2  1  0  1  0  1  2 -1  1  2  0  1  0  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  0  1 -1  1  0 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 4, 7, 10, 12, 13, 15, 17]), Candidate: [ 2  1  0  1  0  1  2 -1  1  2 -1  2  1  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 11950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  0  1 -1  0  0  1  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 4, 7, 10, 14, 15, 16, 18]), Candidate: [ 2  1  0  1  0  1  2 -1  1  2 -1  1  1  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 12000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  0  0  1 -1  1  0  0 -1  1 -1  0  1] (Indices: [0, 1, 2, 4, 7, 11, 13, 14, 15, 17]), Candidate: [ 2  1  0  1  0  1  2 -1  1  1  1  0  2  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  0  0  0  1  0 -1  0  1  0  0 -1  1] (Indices: [0, 1, 2, 4, 7, 12, 13, 16, 17, 18]), Candidate: [ 2  1  0  1  0  1  2 -1  1  1  0  2  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1  0  0  0 -1  1 -1  0  0  1 -1  0  1] (Indices: [0, 1, 2, 4, 8, 9, 10, 11, 13, 17]), Candidate: [2 1 0 1 0 1 1 1 1 1 0 0 2 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 12150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1  0  0 -1  0  1 -1  0  1 -1  0  1  0] (Indices: [0, 1, 2, 4, 8, 9, 10, 13, 16, 19]), Candidate: [ 2  1  0  1  0  1  1  1  1  1 -1  1  2  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1  0 -1  1 -1  1 -1  1  0 -1  0  0  1] (Indices: [0, 1, 2, 4, 8, 9, 11, 13, 15, 16]), Candidate: [2 1 0 1 0 1 1 1 1 0 1 0 2 0 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 12250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1  0 -1  0  1 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 4, 8, 9, 12, 14, 16, 18]), Candidate: [ 2  1  0  1  0  1  1  1  1  0  0  2  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1 -1  1  0  0  0  0 -1  0  0  0  0  1] (Indices: [0, 1, 2, 4, 8, 10, 11, 12, 13, 14]), Candidate: [ 2  1  0  1  0  1  1  1  0  2  0  1  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1 -1  1  0 -1  0  0  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 4, 8, 10, 11, 15, 17, 19]), Candidate: [2 1 0 1 0 1 1 1 0 2 0 0 1 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 12400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1 -1  1 -1  0  1  0 -1  0  0  1  0  0] (Indices: [0, 1, 2, 4, 8, 10, 13, 14, 18, 19]), Candidate: [ 2  1  0  1  0  1  1  1  0  2 -1  1  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 12450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1 -1  0  1  0 -1  1 -1  0  0  1  0  0] (Indices: [0, 1, 2, 4, 8, 11, 12, 14, 18, 19]), Candidate: [ 2  1  0  1  0  1  1  1  0  1  1  1  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1 -1  0  0  1  0  0 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 4, 8, 12, 13, 14, 16, 17]), Candidate: [ 2  1  0  1  0  1  1  1  0  1  0  2  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1 -1  0  0  0  0  1 -1  1  0  0  0  0] (Indices: [0, 1, 2, 4, 8, 14, 16, 17, 18, 19]), Candidate: [ 2  1  0  1  0  1  1  1  0  1  0  1  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  1  0  0 -1  0  0  1  0 -1  0  1  0] (Indices: [0, 1, 2, 4, 9, 10, 11, 15, 16, 19]), Candidate: [2 1 0 1 0 1 1 0 2 1 0 0 1 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 12650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  1  0 -1  0  1  0 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 4, 9, 10, 13, 14, 17, 18]), Candidate: [ 2  1  0  1  0  1  1  0  2  1 -1  1  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 12700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  1 -1  1  0 -1  1 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 4, 9, 11, 12, 14, 17, 18]), Candidate: [ 2  1  0  1  0  1  1  0  2  0  1  1  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  1 -1  0  1  0  0  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 4, 9, 12, 13, 14, 15, 18]), Candidate: [2 1 0 1 0 1 1 0 2 0 0 2 1 1 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 12800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  1 -1  0  0  0  1  0  0 -1  1  0  0] (Indices: [0, 1, 2, 4, 9, 14, 15, 16, 18, 19]), Candidate: [2 1 0 1 0 1 1 0 2 0 0 1 1 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 12850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  0  1  0 -1  1 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 4, 10, 11, 13, 15, 16, 18]), Candidate: [2 1 0 1 0 1 1 0 1 2 0 0 2 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 12900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  0  1 -1  1 -1  1 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 4, 10, 12, 14, 16, 17, 18]), Candidate: [ 2  1  0  1  0  1  1  0  1  2 -1  2  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 12950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  0  0  1  0 -1  1  0  0  0 -1  0  1] (Indices: [0, 1, 2, 4, 11, 12, 14, 15, 16, 17]), Candidate: [2 1 0 1 0 1 1 0 1 1 1 1 0 2 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 13000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  0  0  0  1  0 -1  0  1  0  0  0  0] (Indices: [0, 1, 2, 4, 12, 13, 16, 17, 18, 19]), Candidate: [2 1 0 1 0 1 1 0 1 1 0 2 1 0 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 13050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0  0 -1  0  0  0  0  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 5, 6, 7, 8, 9, 15, 17]), Candidate: [2 1 0 0 2 1 1 0 1 0 0 1 1 1 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 13100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0 -1  0  1  0 -1  0  0  0  0  1 -1  1] (Indices: [0, 1, 2, 5, 6, 7, 8, 11, 12, 18]), Candidate: [2 1 0 0 2 1 1 0 0 1 1 1 0 1 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 13150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0 -1  0  0  0  1 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 5, 6, 7, 8, 13, 15, 17]), Candidate: [2 1 0 0 2 1 1 0 0 1 0 1 2 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 13200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  1  0 -1  0  0  1  0 -1  0  0  0  1] (Indices: [0, 1, 2, 5, 6, 7, 9, 10, 14, 15]), Candidate: [ 2  1  0  0  2  1  1 -1  2  1 -1  1  1  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 13250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  1 -1  0  1 -1  1 -1  1 -1  0  0  1] (Indices: [0, 1, 2, 5, 6, 7, 9, 12, 14, 16]), Candidate: [ 2  1  0  0  2  1  1 -1  2  0  0  2  0  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 13300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  0  1  0  0 -1  1 -1  0  0  0  0  1] (Indices: [0, 1, 2, 5, 6, 7, 10, 11, 12, 14]), Candidate: [ 2  1  0  0  2  1  1 -1  1  2  0  1  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 13350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  0  1 -1  0  1  0 -1  0  1 -1  0  1] (Indices: [0, 1, 2, 5, 6, 7, 10, 13, 14, 17]), Candidate: [ 2  1  0  0  2  1  1 -1  1  2 -1  1  2  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 13400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  0  0  1  0 -1  0  0  1 -1  0  1  0] (Indices: [0, 1, 2, 5, 6, 7, 11, 12, 16, 19]), Candidate: [ 2  1  0  0  2  1  1 -1  1  1  1  1  0  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  0  0  0  1  0 -1  0  1 -1  0  1  0] (Indices: [0, 1, 2, 5, 6, 7, 12, 13, 16, 19]), Candidate: [ 2  1  0  0  2  1  1 -1  1  1  0  2  1  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  0  0  0  0  0  1 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 5, 6, 7, 14, 16, 17, 18]), Candidate: [ 2  1  0  0  2  1  1 -1  1  1  0  1  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 13550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1  0 -1  1  0 -1  0  0  0  0  1 -1  1] (Indices: [0, 1, 2, 5, 6, 8, 9, 11, 12, 18]), Candidate: [2 1 0 0 2 1 0 1 1 0 1 1 0 1 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 13600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1  0 -1  0  0  1 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 5, 6, 8, 9, 13, 15, 17]), Candidate: [2 1 0 0 2 1 0 1 1 0 0 1 2 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 13650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1 -1  1  0 -1  0  0  1 -1  0  0  1  0] (Indices: [0, 1, 2, 5, 6, 8, 10, 11, 15, 19]), Candidate: [2 1 0 0 2 1 0 1 0 2 0 0 1 1 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 13700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1 -1  1 -1  0  0  1 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 5, 6, 8, 10, 14, 17, 18]), Candidate: [ 2  1  0  0  2  1  0  1  0  2 -1  1  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 13750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1 -1  0  1 -1  0  1  0 -1  1 -1  0  1] (Indices: [0, 1, 2, 5, 6, 8, 11, 14, 15, 17]), Candidate: [2 1 0 0 2 1 0 1 0 1 1 0 1 2 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 13800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1 -1  0  0  1 -1  0  0  1  0  0 -1  1] (Indices: [0, 1, 2, 5, 6, 8, 12, 16, 17, 18]), Candidate: [2 1 0 0 2 1 0 1 0 1 0 2 0 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 13850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  1  0  0 -1  1 -1  0  0  0  1 -1  1] (Indices: [0, 1, 2, 5, 6, 9, 10, 11, 13, 18]), Candidate: [2 1 0 0 2 1 0 0 2 1 0 0 2 0 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 13900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  1  0 -1  0  1 -1  0  0  1  0 -1  1] (Indices: [0, 1, 2, 5, 6, 9, 10, 13, 17, 18]), Candidate: [ 2  1  0  0  2  1  0  0  2  1 -1  1  2  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  1 -1  1 -1  1 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 5, 6, 9, 11, 13, 15, 17]), Candidate: [2 1 0 0 2 1 0 0 2 0 1 0 2 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 14000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  1 -1  0  1 -1  1 -1  1 -1  0  1  0] (Indices: [0, 1, 2, 5, 6, 9, 12, 14, 16, 19]), Candidate: [ 2  1  0  0  2  1  0  0  2  0  0  2  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  0  1  0  0  0 -1  1 -1  0  0  0  1] (Indices: [0, 1, 2, 5, 6, 10, 11, 12, 13, 15]), Candidate: [2 1 0 0 2 1 0 0 1 2 0 1 1 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 14100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  0  1  0 -1  0  0  1 -1  0  1  0  0] (Indices: [0, 1, 2, 5, 6, 10, 11, 15, 18, 19]), Candidate: [2 1 0 0 2 1 0 0 1 2 0 0 1 1 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 14150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  0  1 -1  0  1 -1  1  0  0 -1  0  1] (Indices: [0, 1, 2, 5, 6, 10, 13, 15, 16, 17]), Candidate: [ 2  1  0  0  2  1  0  0  1  2 -1  1  2  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  0  0  1  0 -1  0  1  0  0 -1  0  1] (Indices: [0, 1, 2, 5, 6, 11, 12, 15, 16, 17]), Candidate: [2 1 0 0 2 1 0 0 1 1 1 1 0 1 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 14250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  0  0  0  1  0  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 5, 6, 12, 13, 14, 16, 18]), Candidate: [ 2  1  0  0  2  1  0  0  1  1  0  2  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  0  0  0  0  0  0  1  0  0  0  0  0] (Indices: [0, 1, 2, 5, 6, 15, 16, 17, 18, 19]), Candidate: [2 1 0 0 2 1 0 0 1 1 0 1 1 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 14350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0  0 -1  1 -1  0  1  0 -1  0  0  0  1] (Indices: [0, 1, 2, 5, 7, 8, 9, 11, 14, 15]), Candidate: [2 1 0 0 2 0 2 0 1 0 1 0 1 2 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 14400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0  0 -1  0  0  1 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 5, 7, 8, 9, 13, 18, 19]), Candidate: [2 1 0 0 2 0 2 0 1 0 0 1 2 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 14450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0 -1  1 -1  1  0 -1  1 -1  0  0  0  1] (Indices: [0, 1, 2, 5, 7, 8, 10, 12, 13, 15]), Candidate: [ 2  1  0  0  2  0  2  0  0  2 -1  2  1  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0 -1  1 -1  0  0  0  1 -1  0  1  0  0] (Indices: [0, 1, 2, 5, 7, 8, 10, 15, 18, 19]), Candidate: [ 2  1  0  0  2  0  2  0  0  2 -1  1  1  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0 -1  0  1 -1  0  1 -1  0  0  1  0  0] (Indices: [0, 1, 2, 5, 7, 8, 11, 14, 18, 19]), Candidate: [ 2  1  0  0  2  0  2  0  0  1  1  0  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0 -1  0  0  0  1  0 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 5, 7, 8, 13, 14, 16, 17]), Candidate: [ 2  1  0  0  2  0  2  0  0  1  0  1  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  1  0  0 -1  0  0  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 5, 7, 9, 10, 11, 15, 17]), Candidate: [ 2  1  0  0  2  0  2 -1  2  1  0  0  1  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  1  0 -1  0  0  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 5, 7, 9, 10, 14, 16, 18]), Candidate: [ 2  1  0  0  2  0  2 -1  2  1 -1  1  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 14750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  1 -1  1 -1  1 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 5, 7, 9, 11, 13, 18, 19]), Candidate: [ 2  1  0  0  2  0  2 -1  2  0  1  0  2  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  1 -1  0  1 -1  0  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 5, 7, 9, 12, 15, 17, 19]), Candidate: [ 2  1  0  0  2  0  2 -1  2  0  0  2  0  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  0  1  0  0 -1  1 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 5, 7, 10, 11, 12, 14, 18]), Candidate: [ 2  1  0  0  2  0  2 -1  1  2  0  1  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 14900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  0  1 -1  1  0  0 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 5, 7, 10, 12, 13, 14, 18]), Candidate: [ 2  1  0  0  2  0  2 -1  1  2 -1  2  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 14950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  0  1 -1  0  1 -1  0  1 -1  1  0  0] (Indices: [0, 1, 2, 5, 7, 10, 13, 16, 18, 19]), Candidate: [ 2  1  0  0  2  0  2 -1  1  2 -1  1  2  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  0  0  1  0 -1  0  0  1 -1  1  0  0] (Indices: [0, 1, 2, 5, 7, 11, 12, 16, 18, 19]), Candidate: [ 2  1  0  0  2  0  2 -1  1  1  1  1  0  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  0  0  0  1  0 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 5, 7, 12, 13, 15, 17, 18]), Candidate: [ 2  1  0  0  2  0  2 -1  1  1  0  2  1  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1  0  0  0 -1  1  0 -1  0  0  0  0  1] (Indices: [0, 1, 2, 5, 8, 9, 10, 11, 13, 14]), Candidate: [ 2  1  0  0  2  0  1  1  1  1  0  0  2  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1  0  0 -1  0  1 -1  1 -1  0  0  1  0] (Indices: [0, 1, 2, 5, 8, 9, 10, 13, 15, 19]), Candidate: [ 2  1  0  0  2  0  1  1  1  1 -1  1  2  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1  0 -1  1 -1  1  0 -1  0  1 -1  0  1] (Indices: [0, 1, 2, 5, 8, 9, 11, 13, 14, 17]), Candidate: [ 2  1  0  0  2  0  1  1  1  0  1  0  2  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1  0 -1  0  1 -1  1  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 5, 8, 9, 12, 14, 15, 18]), Candidate: [2 1 0 0 2 0 1 1 1 0 0 2 0 2 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 15300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1  0 -1  0  0  0  0  1  0 -1  1  0  0] (Indices: [0, 1, 2, 5, 8, 9, 15, 16, 18, 19]), Candidate: [2 1 0 0 2 0 1 1 1 0 0 1 1 1 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 15350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1 -1  1  0 -1  0  0  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 5, 8, 10, 11, 15, 16, 18]), Candidate: [2 1 0 0 2 0 1 1 0 2 0 0 1 1 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 15400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1 -1  1 -1  0  1  0 -1  1 -1  0  1  0] (Indices: [0, 1, 2, 5, 8, 10, 13, 14, 16, 19]), Candidate: [ 2  1  0  0  2  0  1  1  0  2 -1  1  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1 -1  0  1  0 -1  1 -1  1 -1  0  1  0] (Indices: [0, 1, 2, 5, 8, 11, 12, 14, 16, 19]), Candidate: [ 2  1  0  0  2  0  1  1  0  1  1  1  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1 -1  0  0  1  0  0  0 -1  1 -1  0  1] (Indices: [0, 1, 2, 5, 8, 12, 13, 14, 15, 17]), Candidate: [2 1 0 0 2 0 1 1 0 1 0 2 1 1 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 15550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1 -1  0  0  0  0  1  0  0  0 -1  1  0] (Indices: [0, 1, 2, 5, 8, 14, 15, 16, 17, 19]), Candidate: [2 1 0 0 2 0 1 1 0 1 0 1 1 2 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 15600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  1  0  0 -1  0  1 -1  0  0  1  0  0] (Indices: [0, 1, 2, 5, 9, 10, 11, 14, 18, 19]), Candidate: [ 2  1  0  0  2  0  1  0  2  1  0  0  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  1  0 -1  0  1  0 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 5, 9, 10, 13, 14, 16, 17]), Candidate: [ 2  1  0  0  2  0  1  0  2  1 -1  1  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  1 -1  1  0 -1  1 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 5, 9, 11, 12, 14, 16, 17]), Candidate: [ 2  1  0  0  2  0  1  0  2  0  1  1  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  1 -1  1 -1  0  0  0  1  0  0  0  0] (Indices: [0, 1, 2, 5, 9, 11, 16, 17, 18, 19]), Candidate: [2 1 0 0 2 0 1 0 2 0 1 0 1 1 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 15800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  1 -1  0  0  1 -1  0  1  0  0  0  0] (Indices: [0, 1, 2, 5, 9, 13, 16, 17, 18, 19]), Candidate: [2 1 0 0 2 0 1 0 2 0 0 1 2 0 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 15850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  0  1  0 -1  1  0 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 5, 10, 11, 13, 14, 17, 19]), Candidate: [ 2  1  0  0  2  0  1  0  1  2  0  0  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  0  1 -1  1 -1  1  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 5, 10, 12, 14, 15, 17, 18]), Candidate: [ 2  1  0  0  2  0  1  0  1  2 -1  2  0  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  0  0  1  0  0 -1  0  1  0 -1  1  0] (Indices: [0, 1, 2, 5, 11, 12, 13, 16, 17, 19]), Candidate: [2 1 0 0 2 0 1 0 1 1 1 1 1 0 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 16000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  0  0  0  1  0 -1  1  0  0 -1  1  0] (Indices: [0, 1, 2, 5, 12, 13, 15, 16, 17, 19]), Candidate: [2 1 0 0 2 0 1 0 1 1 0 2 1 0 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 16050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0  0  0 -1  0  0  0  0  0  1  0 -1  1] (Indices: [0, 1, 2, 6, 7, 8, 9, 10, 17, 18]), Candidate: [ 2  1  0  0  1  2  1  0  1  1 -1  1  1  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0  0 -1  0  1 -1  0  0  0  1 -1  1  0] (Indices: [0, 1, 2, 6, 7, 8, 9, 12, 17, 19]), Candidate: [2 1 0 0 1 2 1 0 1 0 0 2 0 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 16150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0 -1  1  0 -1  0  1  0 -1  0  0  0  1] (Indices: [0, 1, 2, 6, 7, 8, 10, 11, 14, 15]), Candidate: [2 1 0 0 1 2 1 0 0 2 0 0 1 2 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 16200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0 -1  1 -1  0  1 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 6, 7, 8, 10, 13, 18, 19]), Candidate: [ 2  1  0  0  1  2  1  0  0  2 -1  1  2  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0 -1  0  1 -1  1 -1  1 -1  0  0  1  0] (Indices: [0, 1, 2, 6, 7, 8, 11, 13, 15, 19]), Candidate: [2 1 0 0 1 2 1 0 0 1 1 0 2 0 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 16300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0 -1  0  0  1 -1  1 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 6, 7, 8, 12, 14, 17, 19]), Candidate: [ 2  1  0  0  1  2  1  0  0  1  0  2  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  1  0  0  0 -1  0  0  1 -1  0  0  1] (Indices: [0, 1, 2, 6, 7, 9, 10, 11, 12, 16]), Candidate: [ 2  1  0  0  1  2  1 -1  2  1  0  1  0  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  1  0 -1  0  1  0 -1  0  0  0  1  0] (Indices: [0, 1, 2, 6, 7, 9, 10, 13, 14, 19]), Candidate: [ 2  1  0  0  1  2  1 -1  2  1 -1  1  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 16450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  1 -1  1  0 -1  0  0  0  1 -1  1  0] (Indices: [0, 1, 2, 6, 7, 9, 11, 12, 17, 19]), Candidate: [ 2  1  0  0  1  2  1 -1  2  0  1  1  0  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  1 -1  0  1  0 -1  0  0  1 -1  1  0] (Indices: [0, 1, 2, 6, 7, 9, 12, 13, 17, 19]), Candidate: [ 2  1  0  0  1  2  1 -1  2  0  0  2  1  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  1 -1  0  0  0  1 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 6, 7, 9, 14, 16, 18, 19]), Candidate: [ 2  1  0  0  1  2  1 -1  2  0  0  1  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  0  1  0 -1  0  1 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 6, 7, 10, 11, 14, 17, 18]), Candidate: [ 2  1  0  0  1  2  1 -1  1  2  0  0  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  0  1 -1  0  1  0  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 6, 7, 10, 13, 14, 15, 18]), Candidate: [ 2  1  0  0  1  2  1 -1  1  2 -1  1  2  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  0  0  1  0 -1  1  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 6, 7, 11, 12, 14, 15, 18]), Candidate: [ 2  1  0  0  1  2  1 -1  1  1  1  1  0  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  0  0  1 -1  0  0  1  0 -1  1  0  0] (Indices: [0, 1, 2, 6, 7, 11, 15, 16, 18, 19]), Candidate: [ 2  1  0  0  1  2  1 -1  1  1  1  0  1  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  0  0  0  0  1 -1  1  0 -1  1  0  0] (Indices: [0, 1, 2, 6, 7, 13, 15, 16, 18, 19]), Candidate: [ 2  1  0  0  1  2  1 -1  1  1  0  1  2  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1  0  0 -1  1 -1  0  1 -1  0  1 -1  1] (Indices: [0, 1, 2, 6, 8, 9, 10, 12, 15, 18]), Candidate: [ 2  1  0  0  1  2  0  1  1  1 -1  2  0  1  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1  0 -1  1  0 -1  1 -1  1 -1  0  0  1] (Indices: [0, 1, 2, 6, 8, 9, 11, 12, 14, 16]), Candidate: [ 2  1  0  0  1  2  0  1  1  0  1  1  0  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1  0 -1  0  1  0  0 -1  1 -1  0  0  1] (Indices: [0, 1, 2, 6, 8, 9, 12, 13, 14, 16]), Candidate: [ 2  1  0  0  1  2  0  1  1  0  0  2  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1  0 -1  0  0  1 -1  0  1  0  0 -1  1] (Indices: [0, 1, 2, 6, 8, 9, 13, 16, 17, 18]), Candidate: [2 1 0 0 1 2 0 1 1 0 0 1 2 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 17050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1 -1  1  0 -1  1 -1  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 6, 8, 10, 11, 13, 16, 18]), Candidate: [2 1 0 0 1 2 0 1 0 2 0 0 2 0 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 17100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1 -1  1 -1  1 -1  0  1  0  0 -1  0  1] (Indices: [0, 1, 2, 6, 8, 10, 12, 15, 16, 17]), Candidate: [ 2  1  0  0  1  2  0  1  0  2 -1  2  0  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1 -1  0  1  0  0 -1  1  0 -1  0  0  1] (Indices: [0, 1, 2, 6, 8, 11, 12, 13, 15, 16]), Candidate: [2 1 0 0 1 2 0 1 0 1 1 1 1 0 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 17200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1 -1  0  1 -1  0  1  0  0  0 -1  0  1] (Indices: [0, 1, 2, 6, 8, 11, 14, 15, 16, 17]), Candidate: [2 1 0 0 1 2 0 1 0 1 1 0 1 2 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 17250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1 -1  0  0  0  1  0  0  0  0 -1  0  1] (Indices: [0, 1, 2, 6, 8, 13, 14, 15, 16, 17]), Candidate: [2 1 0 0 1 2 0 1 0 1 0 1 2 1 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 17300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  1  0  0 -1  1 -1  1 -1  0  0  1  0] (Indices: [0, 1, 2, 6, 9, 10, 11, 13, 15, 19]), Candidate: [2 1 0 0 1 2 0 0 2 1 0 0 2 0 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 17350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  1  0 -1  1 -1  1 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 6, 9, 10, 12, 14, 17, 19]), Candidate: [ 2  1  0  0  1  2  0  0  2  1 -1  2  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 17400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  1 -1  1  0  0  0 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 6, 9, 11, 12, 13, 14, 18]), Candidate: [ 2  1  0  0  1  2  0  0  2  0  1  1  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  1 -1  1 -1  1 -1  0  1 -1  1  0  0] (Indices: [0, 1, 2, 6, 9, 11, 13, 16, 18, 19]), Candidate: [2 1 0 0 1 2 0 0 2 0 1 0 2 0 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 17500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  1 -1  0  1 -1  0  1 -1  1  0  0  0] (Indices: [0, 1, 2, 6, 9, 12, 15, 17, 18, 19]), Candidate: [2 1 0 0 1 2 0 0 2 0 0 2 0 1 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 17550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  0  1  0  0 -1  0  1  0 -1  0  1  0] (Indices: [0, 1, 2, 6, 10, 11, 12, 15, 16, 19]), Candidate: [2 1 0 0 1 2 0 0 1 2 0 1 0 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 17600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  0  1 -1  1  0  0 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 6, 10, 12, 13, 14, 17, 18]), Candidate: [ 2  1  0  0  1  2  0  0  1  2 -1  2  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 17650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  0  0  1  0  0  0  0 -1  1 -1  0  1] (Indices: [0, 1, 2, 6, 11, 12, 13, 14, 15, 17]), Candidate: [2 1 0 0 1 2 0 0 1 1 1 1 1 1 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 17700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  0  0  1 -1  0  1  0  0  0 -1  1  0] (Indices: [0, 1, 2, 6, 11, 14, 15, 16, 17, 19]), Candidate: [2 1 0 0 1 2 0 0 1 1 1 0 1 2 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 17750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0  0  0  0 -1  0  1 -1  0  0  0  1  0] (Indices: [0, 1, 2, 7, 8, 9, 10, 11, 14, 19]), Candidate: [ 2  1  0  0  1  1  2  0  1  1  0  0  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0  0  0 -1  0  0  1  0 -1  0  0  1  0] (Indices: [0, 1, 2, 7, 8, 9, 10, 14, 15, 19]), Candidate: [ 2  1  0  0  1  1  2  0  1  1 -1  1  1  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0  0 -1  1 -1  1 -1  0  0  1  0 -1  1] (Indices: [0, 1, 2, 7, 8, 9, 11, 13, 17, 18]), Candidate: [2 1 0 0 1 1 2 0 1 0 1 0 2 0 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 17900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0  0 -1  0  1 -1  0  1  0 -1  0  1  0] (Indices: [0, 1, 2, 7, 8, 9, 12, 15, 16, 19]), Candidate: [2 1 0 0 1 1 2 0 1 0 0 2 0 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 17950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0 -1  1  0  0 -1  1 -1  1 -1  0  0  1] (Indices: [0, 1, 2, 7, 8, 10, 11, 12, 14, 16]), Candidate: [ 2  1  0  0  1  1  2  0  0  2  0  1  0  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0 -1  1 -1  1  0  0 -1  1 -1  0  0  1] (Indices: [0, 1, 2, 7, 8, 10, 12, 13, 14, 16]), Candidate: [ 2  1  0  0  1  1  2  0  0  2 -1  2  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0 -1  1 -1  0  1 -1  0  1  0  0 -1  1] (Indices: [0, 1, 2, 7, 8, 10, 13, 16, 17, 18]), Candidate: [ 2  1  0  0  1  1  2  0  0  2 -1  1  2  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0 -1  0  1  0 -1  0  0  1  0  0 -1  1] (Indices: [0, 1, 2, 7, 8, 11, 12, 16, 17, 18]), Candidate: [2 1 0 0 1 1 2 0 0 1 1 1 0 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 18150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0 -1  0  0  1  0 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 7, 8, 12, 13, 15, 16, 18]), Candidate: [2 1 0 0 1 1 2 0 0 1 0 2 1 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 18200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  1  0  0  0  0 -1  0  0  0  0  1  0] (Indices: [0, 1, 2, 7, 9, 10, 11, 12, 13, 19]), Candidate: [ 2  1  0  0  1  1  2 -1  2  1  0  1  1  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  1  0  0 -1  0  0  0  0  1  0  0  0] (Indices: [0, 1, 2, 7, 9, 10, 11, 17, 18, 19]), Candidate: [ 2  1  0  0  1  1  2 -1  2  1  0  0  1  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  1  0 -1  0  1 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 7, 9, 10, 13, 15, 17, 19]), Candidate: [ 2  1  0  0  1  1  2 -1  2  1 -1  1  2  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  1 -1  1  0 -1  0  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 7, 9, 11, 12, 15, 17, 19]), Candidate: [ 2  1  0  0  1  1  2 -1  2  0  1  1  0  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  1 -1  0  1  0  0 -1  0  0  1  0  0] (Indices: [0, 1, 2, 7, 9, 12, 13, 14, 18, 19]), Candidate: [ 2  1  0  0  1  1  2 -1  2  0  0  2  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  0  1  0  0  0  0 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 7, 10, 11, 12, 13, 14, 18]), Candidate: [ 2  1  0  0  1  1  2 -1  1  2  0  1  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  0  1  0 -1  1 -1  0  1 -1  1  0  0] (Indices: [0, 1, 2, 7, 10, 11, 13, 16, 18, 19]), Candidate: [ 2  1  0  0  1  1  2 -1  1  2  0  0  2  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  0  1 -1  1 -1  0  1 -1  1  0  0  0] (Indices: [0, 1, 2, 7, 10, 12, 15, 17, 18, 19]), Candidate: [ 2  1  0  0  1  1  2 -1  1  2 -1  2  0  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  0  0  1  0 -1  1 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 7, 11, 12, 14, 16, 17, 19]), Candidate: [ 2  1  0  0  1  1  2 -1  1  1  1  1  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  0  0  0  0  1  0  0  0  0  0 -1  1] (Indices: [0, 1, 2, 7, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  1  0  0  1  1  2 -1  1  1  0  1  2  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1  0  0  0 -1  0  1 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 8, 9, 10, 11, 14, 17, 18]), Candidate: [ 2  1  0  0  1  1  1  1  1  1  0  0  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1  0  0 -1  0  1  0  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 8, 9, 10, 13, 14, 15, 18]), Candidate: [ 2  1  0  0  1  1  1  1  1  1 -1  1  2  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1  0 -1  1  0 -1  1  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 8, 9, 11, 12, 14, 15, 18]), Candidate: [2 1 0 0 1 1 1 1 1 0 1 1 0 2 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 18850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1  0 -1  1 -1  0  0  1  0 -1  1  0  0] (Indices: [0, 1, 2, 8, 9, 11, 15, 16, 18, 19]), Candidate: [2 1 0 0 1 1 1 1 1 0 1 0 1 1 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 18900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1  0 -1  0  0  1 -1  1  0 -1  1  0  0] (Indices: [0, 1, 2, 8, 9, 13, 15, 16, 18, 19]), Candidate: [2 1 0 0 1 1 1 1 1 0 0 1 2 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 18950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1 -1  1  0 -1  1  0 -1  1 -1  0  1  0] (Indices: [0, 1, 2, 8, 10, 11, 13, 14, 16, 19]), Candidate: [ 2  1  0  0  1  1  1  1  0  2  0  0  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1 -1  1 -1  1 -1  1  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 8, 10, 12, 14, 15, 16, 18]), Candidate: [ 2  1  0  0  1  1  1  1  0  2 -1  2  0  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1 -1  0  1  0  0 -1  1 -1  0  1  0  0] (Indices: [0, 1, 2, 8, 11, 12, 13, 15, 18, 19]), Candidate: [2 1 0 0 1 1 1 1 0 1 1 1 1 0 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 19100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1 -1  0  0  1  0  0 -1  0  1  0  0  0] (Indices: [0, 1, 2, 8, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  1  0  0  1  1  1  1  0  1  0  2  1  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  1  0  0  0 -1  0  0  1  0  0 -1  1] (Indices: [0, 1, 2, 9, 10, 11, 12, 16, 17, 18]), Candidate: [2 1 0 0 1 1 1 0 2 1 0 1 0 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 19200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  1  0 -1  1  0 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 9, 10, 12, 13, 15, 16, 18]), Candidate: [ 2  1  0  0  1  1  1  0  2  1 -1  2  1  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  1 -1  1  0  0  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 9, 11, 12, 13, 14, 16, 18]), Candidate: [ 2  1  0  0  1  1  1  0  2  0  1  1  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  1 -1  1 -1  0  0  1  0  0  0  0  0] (Indices: [0, 1, 2, 9, 11, 15, 16, 17, 18, 19]), Candidate: [2 1 0 0 1 1 1 0 2 0 1 0 1 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 19350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  0  1  0  0 -1  1  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 10, 11, 12, 14, 15, 16, 18]), Candidate: [2 1 0 0 1 1 1 0 1 2 0 1 0 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 19400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  0  1 -1  1 -1  1  0  0  0  0 -1  1] (Indices: [0, 1, 2, 10, 12, 14, 15, 16, 17, 18]), Candidate: [ 2  1  0  0  1  1  1  0  1  2 -1  2  0  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0  0 -1  1 -1  0  0  0  0  0  0  0  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 9, 11]), Candidate: [2 0 2 0 1 1 1 0 1 0 1 0 1 1 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 19500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0 -1  0  0  0  0  0  0  1 -1  0  1  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 16, 19]), Candidate: [2 0 2 0 1 1 1 0 0 1 0 1 1 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 19550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  0  1  0 -1  1 -1  0  0  0  0  0  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 10, 11, 13]), Candidate: [ 2  0  2  0  1  1  1 -1  1  2  0  0  2  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  0  0  1 -1  0  1 -1  0  1 -1  0  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 11, 14, 17]), Candidate: [ 2  0  2  0  1  1  1 -1  1  1  1  0  1  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 19650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  0  0  0  0  0  1  0 -1  1 -1  0  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 14, 15, 17]), Candidate: [ 2  0  2  0  1  1  1 -1  1  1  0  1  1  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1  0 -1  0  0  0  1 -1  1 -1  0  0  1] (Indices: [0, 1, 3, 4, 5, 6, 8, 9, 14, 16]), Candidate: [ 2  0  2  0  1  1  0  1  1  0  0  1  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1 -1  0  1  0  0 -1  0  0  0  0  0  1] (Indices: [0, 1, 3, 4, 5, 6, 8, 11, 12, 13]), Candidate: [2 0 2 0 1 1 0 1 0 1 1 1 1 0 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 19800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1 -1  0  0  0  1  0 -1  1 -1  0  0  1] (Indices: [0, 1, 3, 4, 5, 6, 8, 13, 14, 16]), Candidate: [ 2  0  2  0  1  1  0  1  0  1  0  1  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  1  0 -1  0  1 -1  1 -1  0  0  0  1] (Indices: [0, 1, 3, 4, 5, 6, 9, 10, 13, 15]), Candidate: [ 2  0  2  0  1  1  0  0  2  1 -1  1  2  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  1 -1  0  1  0 -1  0  1 -1  0  0  1] (Indices: [0, 1, 3, 4, 5, 6, 9, 12, 13, 16]), Candidate: [2 0 2 0 1 1 0 0 2 0 0 2 1 0 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 19950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  1 -1  0  0  0  0  0  1  0  0 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 9, 16, 17, 18]), Candidate: [2 0 2 0 1 1 0 0 2 0 0 1 1 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 20000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  0  1 -1  1 -1  0  0  0  1  0 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 10, 12, 17, 18]), Candidate: [ 2  0  2  0  1  1  0  0  1  2 -1  2  0  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  0  0  1  0 -1  0  1 -1  1 -1  0  1] (Indices: [0, 1, 3, 4, 5, 6, 11, 12, 15, 17]), Candidate: [2 0 2 0 1 1 0 0 1 1 1 1 0 1 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 20100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  0  0  0  1  0 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 3, 4, 5, 6, 12, 13, 15, 17]), Candidate: [2 0 2 0 1 1 0 0 1 1 0 2 1 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 20150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  0  0  0  0  0  1  0  0 -1  1 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 14, 15, 16, 18]), Candidate: [2 0 2 0 1 1 0 0 1 1 0 1 1 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 20200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0  0 -1  0  0  0  0  1 -1  1 -1  0  1] (Indices: [0, 1, 3, 4, 5, 7, 8, 9, 15, 17]), Candidate: [2 0 2 0 1 0 2 0 1 0 0 1 1 1 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 20250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0 -1  0  1  0 -1  0  0  0  0  1 -1  1] (Indices: [0, 1, 3, 4, 5, 7, 8, 11, 12, 18]), Candidate: [2 0 2 0 1 0 2 0 0 1 1 1 0 1 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 20300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0 -1  0  0  0  1 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 3, 4, 5, 7, 8, 13, 15, 17]), Candidate: [2 0 2 0 1 0 2 0 0 1 0 1 2 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 20350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  1  0 -1  0  0  1  0 -1  0  0  0  1] (Indices: [0, 1, 3, 4, 5, 7, 9, 10, 14, 15]), Candidate: [ 2  0  2  0  1  0  2 -1  2  1 -1  1  1  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  1 -1  0  1 -1  1 -1  1 -1  0  0  1] (Indices: [0, 1, 3, 4, 5, 7, 9, 12, 14, 16]), Candidate: [ 2  0  2  0  1  0  2 -1  2  0  0  2  0  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  0  1  0  0 -1  1 -1  0  0  0  0  1] (Indices: [0, 1, 3, 4, 5, 7, 10, 11, 12, 14]), Candidate: [ 2  0  2  0  1  0  2 -1  1  2  0  1  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  0  1 -1  0  1  0 -1  0  1 -1  0  1] (Indices: [0, 1, 3, 4, 5, 7, 10, 13, 14, 17]), Candidate: [ 2  0  2  0  1  0  2 -1  1  2 -1  1  2  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 20550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  0  0  1  0 -1  0  0  1 -1  0  1  0] (Indices: [0, 1, 3, 4, 5, 7, 11, 12, 16, 19]), Candidate: [ 2  0  2  0  1  0  2 -1  1  1  1  1  0  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  0  0  0  1  0 -1  0  1 -1  0  1  0] (Indices: [0, 1, 3, 4, 5, 7, 12, 13, 16, 19]), Candidate: [ 2  0  2  0  1  0  2 -1  1  1  0  2  1  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  0  0  0  0  0  1 -1  1  0  0 -1  1] (Indices: [0, 1, 3, 4, 5, 7, 14, 16, 17, 18]), Candidate: [ 2  0  2  0  1  0  2 -1  1  1  0  1  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1  0 -1  1  0 -1  0  0  0  0  1 -1  1] (Indices: [0, 1, 3, 4, 5, 8, 9, 11, 12, 18]), Candidate: [2 0 2 0 1 0 1 1 1 0 1 1 0 1 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 20750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1  0 -1  0  0  1 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 3, 4, 5, 8, 9, 13, 15, 17]), Candidate: [2 0 2 0 1 0 1 1 1 0 0 1 2 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 20800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1 -1  1  0 -1  0  0  1 -1  0  0  1  0] (Indices: [0, 1, 3, 4, 5, 8, 10, 11, 15, 19]), Candidate: [2 0 2 0 1 0 1 1 0 2 0 0 1 1 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 20850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1 -1  1 -1  0  0  1 -1  0  1  0 -1  1] (Indices: [0, 1, 3, 4, 5, 8, 10, 14, 17, 18]), Candidate: [ 2  0  2  0  1  0  1  1  0  2 -1  1  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1 -1  0  1 -1  0  1  0 -1  1 -1  0  1] (Indices: [0, 1, 3, 4, 5, 8, 11, 14, 15, 17]), Candidate: [2 0 2 0 1 0 1 1 0 1 1 0 1 2 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 20950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1 -1  0  0  1 -1  0  0  1  0  0 -1  1] (Indices: [0, 1, 3, 4, 5, 8, 12, 16, 17, 18]), Candidate: [2 0 2 0 1 0 1 1 0 1 0 2 0 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 21000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  1  0  0 -1  1 -1  0  0  0  1 -1  1] (Indices: [0, 1, 3, 4, 5, 9, 10, 11, 13, 18]), Candidate: [2 0 2 0 1 0 1 0 2 1 0 0 2 0 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 21050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  1  0 -1  0  1 -1  0  0  1  0 -1  1] (Indices: [0, 1, 3, 4, 5, 9, 10, 13, 17, 18]), Candidate: [ 2  0  2  0  1  0  1  0  2  1 -1  1  2  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  1 -1  1 -1  1 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 3, 4, 5, 9, 11, 13, 15, 17]), Candidate: [2 0 2 0 1 0 1 0 2 0 1 0 2 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 21150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  1 -1  0  1 -1  1 -1  1 -1  0  1  0] (Indices: [0, 1, 3, 4, 5, 9, 12, 14, 16, 19]), Candidate: [ 2  0  2  0  1  0  1  0  2  0  0  2  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  0  1  0  0  0 -1  1 -1  0  0  0  1] (Indices: [0, 1, 3, 4, 5, 10, 11, 12, 13, 15]), Candidate: [2 0 2 0 1 0 1 0 1 2 0 1 1 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 21250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  0  1  0 -1  0  0  1 -1  0  1  0  0] (Indices: [0, 1, 3, 4, 5, 10, 11, 15, 18, 19]), Candidate: [2 0 2 0 1 0 1 0 1 2 0 0 1 1 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 21300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  0  1 -1  0  1 -1  1  0  0 -1  0  1] (Indices: [0, 1, 3, 4, 5, 10, 13, 15, 16, 17]), Candidate: [ 2  0  2  0  1  0  1  0  1  2 -1  1  2  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  0  0  1  0 -1  0  1  0  0 -1  0  1] (Indices: [0, 1, 3, 4, 5, 11, 12, 15, 16, 17]), Candidate: [2 0 2 0 1 0 1 0 1 1 1 1 0 1 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 21400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  0  0  0  1  0  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 3, 4, 5, 12, 13, 14, 16, 18]), Candidate: [ 2  0  2  0  1  0  1  0  1  1  0  2  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  0  0  0  0  0  0  1  0  0  0  0  0] (Indices: [0, 1, 3, 4, 5, 15, 16, 17, 18, 19]), Candidate: [2 0 2 0 1 0 1 0 1 1 0 1 1 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 21500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0 -1  1  0 -1  0  0  0  1 -1  0  0  1] (Indices: [0, 1, 3, 4, 6, 7, 8, 10, 11, 16]), Candidate: [2 0 2 0 0 2 1 0 0 2 0 0 1 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 21550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0 -1  0  1 -1  0  0  1  0 -1  0  0  1] (Indices: [0, 1, 3, 4, 6, 7, 8, 11, 15, 16]), Candidate: [2 0 2 0 0 2 1 0 0 1 1 0 1 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 21600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0 -1  0  0  0  0  1 -1  1  0 -1  0  1] (Indices: [0, 1, 3, 4, 6, 7, 8, 14, 16, 17]), Candidate: [ 2  0  2  0  0  2  1  0  0  1  0  1  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  1  0 -1  0  0  0  0  0  1 -1  1  0] (Indices: [0, 1, 3, 4, 6, 7, 9, 10, 17, 19]), Candidate: [ 2  0  2  0  0  2  1 -1  2  1 -1  1  1  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  1 -1  0  1 -1  0  0  0  0  1  0  0] (Indices: [0, 1, 3, 4, 6, 7, 9, 12, 18, 19]), Candidate: [ 2  0  2  0  0  2  1 -1  2  0  0  2  0  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  0  1  0 -1  0  1 -1  1 -1  0  0  1] (Indices: [0, 1, 3, 4, 6, 7, 10, 11, 14, 16]), Candidate: [ 2  0  2  0  0  2  1 -1  1  2  0  0  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  0  1 -1  0  0  1  0  0 -1  0  0  1] (Indices: [0, 1, 3, 4, 6, 7, 10, 14, 15, 16]), Candidate: [ 2  0  2  0  0  2  1 -1  1  2 -1  1  1  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  0  0  1 -1  1 -1  0  1  0 -1  0  1] (Indices: [0, 1, 3, 4, 6, 7, 11, 13, 16, 17]), Candidate: [ 2  0  2  0  0  2  1 -1  1  1  1  0  2  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  0  0  0  1 -1  1 -1  0  0  1  0  0] (Indices: [0, 1, 3, 4, 6, 7, 12, 14, 18, 19]), Candidate: [ 2  0  2  0  0  2  1 -1  1  1  0  2  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1  0  0  0 -1  0  0  0  1 -1  0  0  1] (Indices: [0, 1, 3, 4, 6, 8, 9, 10, 11, 16]), Candidate: [2 0 2 0 0 2 0 1 1 1 0 0 1 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 22000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1  0 -1  1 -1  0  0  1  0 -1  0  0  1] (Indices: [0, 1, 3, 4, 6, 8, 9, 11, 15, 16]), Candidate: [2 0 2 0 0 2 0 1 1 0 1 0 1 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 22050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1  0 -1  0  0  0  1 -1  1  0 -1  0  1] (Indices: [0, 1, 3, 4, 6, 8, 9, 14, 16, 17]), Candidate: [ 2  0  2  0  0  2  0  1  1  0  0  1  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1 -1  1 -1  1 -1  1  0 -1  0  0  0  1] (Indices: [0, 1, 3, 4, 6, 8, 10, 12, 14, 15]), Candidate: [ 2  0  2  0  0  2  0  1  0  2 -1  2  0  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1 -1  0  1  0  0  0 -1  0  0  0  0  1] (Indices: [0, 1, 3, 4, 6, 8, 11, 12, 13, 14]), Candidate: [ 2  0  2  0  0  2  0  1  0  1  1  1  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1 -1  0  1 -1  0  0  1 -1  1 -1  1  0] (Indices: [0, 1, 3, 4, 6, 8, 11, 15, 17, 19]), Candidate: [2 0 2 0 0 2 0 1 0 1 1 0 1 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 22250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1 -1  0  0  0  1  0 -1  0  0  1  0  0] (Indices: [0, 1, 3, 4, 6, 8, 13, 14, 18, 19]), Candidate: [ 2  0  2  0  0  2  0  1  0  1  0  1  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  1  0  0 -1  0  0  0  1 -1  0  1  0] (Indices: [0, 1, 3, 4, 6, 9, 10, 11, 16, 19]), Candidate: [2 0 2 0 0 2 0 0 2 1 0 0 1 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 22350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  1  0 -1  0  0  0  1  0  0 -1  0  1] (Indices: [0, 1, 3, 4, 6, 9, 10, 15, 16, 17]), Candidate: [ 2  0  2  0  0  2  0  0  2  1 -1  1  1  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  1 -1  1 -1  0  1 -1  1  0 -1  0  1] (Indices: [0, 1, 3, 4, 6, 9, 11, 14, 16, 17]), Candidate: [ 2  0  2  0  0  2  0  0  2  0  1  0  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  1 -1  0  1 -1  0  0  0  1  0  0  0] (Indices: [0, 1, 3, 4, 6, 9, 12, 17, 18, 19]), Candidate: [2 0 2 0 0 2 0 0 2 0 0 2 0 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 22500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  0  1  0  0 -1  0  1 -1  0  0  1  0] (Indices: [0, 1, 3, 4, 6, 10, 11, 12, 15, 19]), Candidate: [2 0 2 0 0 2 0 0 1 2 0 1 0 1 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 22550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  0  1 -1  1  0 -1  1 -1  0  0  1  0] (Indices: [0, 1, 3, 4, 6, 10, 12, 13, 15, 19]), Candidate: [ 2  0  2  0  0  2  0  0  1  2 -1  2  1  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  0  1 -1  0  0  1  0 -1  1  0 -1  1] (Indices: [0, 1, 3, 4, 6, 10, 14, 15, 17, 18]), Candidate: [ 2  0  2  0  0  2  0  0  1  2 -1  1  1  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  0  0  1 -1  1  0  0 -1  0  0  1  0] (Indices: [0, 1, 3, 4, 6, 11, 13, 14, 15, 19]), Candidate: [2 0 2 0 0 2 0 0 1 1 1 0 2 1 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 22700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  0  0  0  1  0 -1  0  1 -1  1  0  0] (Indices: [0, 1, 3, 4, 6, 12, 13, 16, 18, 19]), Candidate: [2 0 2 0 0 2 0 0 1 1 0 2 1 0 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 22750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0  0  0 -1  1 -1  0  0  0  1 -1  0  1] (Indices: [0, 1, 3, 4, 7, 8, 9, 10, 12, 17]), Candidate: [ 2  0  2  0  0  1  2  0  1  1 -1  2  0  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0  0 -1  1 -1  0  0  0  0  1 -1  1  0] (Indices: [0, 1, 3, 4, 7, 8, 9, 11, 17, 19]), Candidate: [2 0 2 0 0 1 2 0 1 0 1 0 1 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 22850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0  0 -1  0  0  0  0  1  0 -1  0  1  0] (Indices: [0, 1, 3, 4, 7, 8, 9, 15, 16, 19]), Candidate: [2 0 2 0 0 1 2 0 1 0 0 1 1 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 22900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0 -1  1 -1  1 -1  0  1 -1  0  0  1  0] (Indices: [0, 1, 3, 4, 7, 8, 10, 12, 15, 19]), Candidate: [ 2  0  2  0  0  1  2  0  0  2 -1  2  0  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0 -1  0  1  0 -1  1 -1  0  1 -1  0  1] (Indices: [0, 1, 3, 4, 7, 8, 11, 12, 14, 17]), Candidate: [ 2  0  2  0  0  1  2  0  0  1  1  1  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0 -1  0  0  1  0  0 -1  0  1 -1  0  1] (Indices: [0, 1, 3, 4, 7, 8, 12, 13, 14, 17]), Candidate: [ 2  0  2  0  0  1  2  0  0  1  0  2  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0 -1  0  0  0  1 -1  0  1  0 -1  1  0] (Indices: [0, 1, 3, 4, 7, 8, 13, 16, 17, 19]), Candidate: [2 0 2 0 0 1 2 0 0 1 0 1 2 0 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 23100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  1  0 -1  1  0 -1  0  0  0  1 -1  1] (Indices: [0, 1, 3, 4, 7, 9, 10, 12, 13, 18]), Candidate: [ 2  0  2  0  0  1  2 -1  2  1 -1  2  1  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 23150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  1  0 -1  0  0  0  0  1 -1  1  0  0] (Indices: [0, 1, 3, 4, 7, 9, 10, 16, 18, 19]), Candidate: [ 2  0  2  0  0  1  2 -1  2  1 -1  1  1  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 23200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  1 -1  1 -1  0  0  1  0 -1  0  1  0] (Indices: [0, 1, 3, 4, 7, 9, 11, 15, 16, 19]), Candidate: [ 2  0  2  0  0  1  2 -1  2  0  1  0  1  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  1 -1  0  0  1  0 -1  0  1  0 -1  1] (Indices: [0, 1, 3, 4, 7, 9, 13, 14, 17, 18]), Candidate: [ 2  0  2  0  0  1  2 -1  2  0  0  1  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 23300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  0  1  0 -1  1  0 -1  1 -1  0  0  1] (Indices: [0, 1, 3, 4, 7, 10, 11, 13, 14, 16]), Candidate: [ 2  0  2  0  0  1  2 -1  1  2  0  0  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 23350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  0  1 -1  1 -1  1  0 -1  1 -1  0  1] (Indices: [0, 1, 3, 4, 7, 10, 12, 14, 15, 17]), Candidate: [ 2  0  2  0  0  1  2 -1  1  2 -1  2  0  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 23400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  0  1 -1  0  0  0  1  0  0 -1  1  0] (Indices: [0, 1, 3, 4, 7, 10, 15, 16, 17, 19]), Candidate: [ 2  0  2  0  0  1  2 -1  1  2 -1  1  1  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 23450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  0  0  1 -1  1 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 3, 4, 7, 11, 13, 15, 16, 18]), Candidate: [ 2  0  2  0  0  1  2 -1  1  1  1  0  2  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  0  0  0  1 -1  1 -1  1  0  0 -1  1] (Indices: [0, 1, 3, 4, 7, 12, 14, 16, 17, 18]), Candidate: [ 2  0  2  0  0  1  2 -1  1  1  0  2  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 23550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1  0  0  0 -1  0  0  1 -1  0  1 -1  1] (Indices: [0, 1, 3, 4, 8, 9, 10, 11, 15, 18]), Candidate: [2 0 2 0 0 1 1 1 1 1 0 0 1 1 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 23600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1  0  0 -1  0  0  1 -1  1 -1  0  1  0] (Indices: [0, 1, 3, 4, 8, 9, 10, 14, 16, 19]), Candidate: [ 2  0  2  0  0  1  1  1  1  1 -1  1  1  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 23650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1  0 -1  1 -1  0  1  0  0 -1  0  0  1] (Indices: [0, 1, 3, 4, 8, 9, 11, 14, 15, 16]), Candidate: [2 0 2 0 0 1 1 1 1 0 1 0 1 2 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 23700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1  0 -1  0  1 -1  0  1 -1  0  1  0  0] (Indices: [0, 1, 3, 4, 8, 9, 12, 15, 18, 19]), Candidate: [2 0 2 0 0 1 1 1 1 0 0 2 0 1 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 23750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1 -1  1  0  0 -1  1 -1  0  0  0  1  0] (Indices: [0, 1, 3, 4, 8, 10, 11, 12, 14, 19]), Candidate: [ 2  0  2  0  0  1  1  1  0  2  0  1  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1 -1  1 -1  1  0  0 -1  0  0  0  1  0] (Indices: [0, 1, 3, 4, 8, 10, 12, 13, 14, 19]), Candidate: [ 2  0  2  0  0  1  1  1  0  2 -1  2  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 23850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1 -1  1 -1  0  1 -1  0  0  1  0  0  0] (Indices: [0, 1, 3, 4, 8, 10, 13, 17, 18, 19]), Candidate: [ 2  0  2  0  0  1  1  1  0  2 -1  1  2  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1 -1  0  1  0 -1  0  0  0  1  0  0  0] (Indices: [0, 1, 3, 4, 8, 11, 12, 17, 18, 19]), Candidate: [2 0 2 0 0 1 1 1 0 1 1 1 0 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 23950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1 -1  0  0  1  0 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 3, 4, 8, 12, 13, 15, 17, 19]), Candidate: [2 0 2 0 0 1 1 1 0 1 0 2 1 0 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 24000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  1  0  0  0 -1  1 -1  0  1 -1  0  1] (Indices: [0, 1, 3, 4, 9, 10, 11, 12, 14, 17]), Candidate: [ 2  0  2  0  0  1  1  0  2  1  0  1  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  1  0 -1  1  0  0 -1  0  1 -1  0  1] (Indices: [0, 1, 3, 4, 9, 10, 12, 13, 14, 17]), Candidate: [ 2  0  2  0  0  1  1  0  2  1 -1  2  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 24100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  1  0 -1  0  1 -1  0  1  0 -1  1  0] (Indices: [0, 1, 3, 4, 9, 10, 13, 16, 17, 19]), Candidate: [ 2  0  2  0  0  1  1  0  2  1 -1  1  2  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  1 -1  1  0 -1  0  0  1  0 -1  1  0] (Indices: [0, 1, 3, 4, 9, 11, 12, 16, 17, 19]), Candidate: [2 0 2 0 0 1 1 0 2 0 1 1 0 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 24200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  1 -1  0  1  0 -1  1  0 -1  0  1  0] (Indices: [0, 1, 3, 4, 9, 12, 13, 15, 16, 19]), Candidate: [2 0 2 0 0 1 1 0 2 0 0 2 1 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 24250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  0  1  0  0  0 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 3, 4, 10, 11, 12, 13, 15, 17]), Candidate: [2 0 2 0 0 1 1 0 1 2 0 1 1 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 24300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  0  1  0 -1  0  1  0  0 -1  1 -1  1] (Indices: [0, 1, 3, 4, 10, 11, 14, 15, 16, 18]), Candidate: [2 0 2 0 0 1 1 0 1 2 0 0 1 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 24350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  0  1 -1  0  1  0  0  0 -1  1 -1  1] (Indices: [0, 1, 3, 4, 10, 13, 14, 15, 16, 18]), Candidate: [ 2  0  2  0  0  1  1  0  1  2 -1  1  2  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  0  0  1  0 -1  0  1  0  0  0 -1  1] (Indices: [0, 1, 3, 4, 11, 12, 15, 16, 17, 18]), Candidate: [2 0 2 0 0 1 1 0 1 1 1 1 0 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 24450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  0  0  0  0  1  0  0 -1  1  0  0  0] (Indices: [0, 1, 3, 4, 13, 14, 15, 17, 18, 19]), Candidate: [2 0 2 0 0 1 1 0 1 1 0 1 2 1 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 24500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0 -1  1  0 -1  1 -1  0  0  0  0  0  1] (Indices: [0, 1, 3, 5, 6, 7, 8, 10, 11, 13]), Candidate: [ 2  0  2 -1  2  1  1  0  0  2  0  0  2  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0 -1  0  1 -1  0  1 -1  0  1 -1  0  1] (Indices: [0, 1, 3, 5, 6, 7, 8, 11, 14, 17]), Candidate: [ 2  0  2 -1  2  1  1  0  0  1  1  0  1  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 24600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0 -1  0  0  0  0  1  0 -1  1 -1  0  1] (Indices: [0, 1, 3, 5, 6, 7, 8, 14, 15, 17]), Candidate: [ 2  0  2 -1  2  1  1  0  0  1  0  1  1  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  1  0 -1  0  0  0  0  1 -1  1 -1  1] (Indices: [0, 1, 3, 5, 6, 7, 9, 10, 16, 18]), Candidate: [ 2  0  2 -1  2  1  1 -1  2  1 -1  1  1  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 24700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  1 -1  0  1 -1  0  0  1 -1  0  1  0] (Indices: [0, 1, 3, 5, 6, 7, 9, 12, 16, 19]), Candidate: [ 2  0  2 -1  2  1  1 -1  2  0  0  2  0  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 24750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  0  1  0 -1  1 -1  0  0  0  1 -1  1] (Indices: [0, 1, 3, 5, 6, 7, 10, 11, 13, 18]), Candidate: [ 2  0  2 -1  2  1  1 -1  1  2  0  0  2  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 24800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  0  1 -1  0  1 -1  0  0  1  0 -1  1] (Indices: [0, 1, 3, 5, 6, 7, 10, 13, 17, 18]), Candidate: [ 2  0  2 -1  2  1  1 -1  1  2 -1  1  2  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 24850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  0  0  1 -1  1 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 3, 5, 6, 7, 11, 13, 15, 17]), Candidate: [ 2  0  2 -1  2  1  1 -1  1  1  1  0  2  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 24900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  0  0  0  1 -1  1 -1  1 -1  0  1  0] (Indices: [0, 1, 3, 5, 6, 7, 12, 14, 16, 19]), Candidate: [ 2  0  2 -1  2  1  1 -1  1  1  0  2  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 24950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1  0  0  0 -1  1 -1  0  0  0  0  0  1] (Indices: [0, 1, 3, 5, 6, 8, 9, 10, 11, 13]), Candidate: [ 2  0  2 -1  2  1  0  1  1  1  0  0  2  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1  0 -1  1 -1  0  1 -1  0  1 -1  0  1] (Indices: [0, 1, 3, 5, 6, 8, 9, 11, 14, 17]), Candidate: [ 2  0  2 -1  2  1  0  1  1  0  1  0  1  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 25050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1  0 -1  0  0  0  1  0 -1  1 -1  0  1] (Indices: [0, 1, 3, 5, 6, 8, 9, 14, 15, 17]), Candidate: [ 2  0  2 -1  2  1  0  1  1  0  0  1  1  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1 -1  1 -1  1  0 -1  0  0  1 -1  0  1] (Indices: [0, 1, 3, 5, 6, 8, 10, 12, 13, 17]), Candidate: [ 2  0  2 -1  2  1  0  1  0  2 -1  2  1  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 25150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1 -1  1 -1  0  0  0  0  1  0 -1  1  0] (Indices: [0, 1, 3, 5, 6, 8, 10, 16, 17, 19]), Candidate: [ 2  0  2 -1  2  1  0  1  0  2 -1  1  1  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 25200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1 -1  0  1 -1  0  0  1  0 -1  1 -1  1] (Indices: [0, 1, 3, 5, 6, 8, 11, 15, 16, 18]), Candidate: [ 2  0  2 -1  2  1  0  1  0  1  1  0  1  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1 -1  0  0  0  1  0 -1  1 -1  0  1  0] (Indices: [0, 1, 3, 5, 6, 8, 13, 14, 16, 19]), Candidate: [ 2  0  2 -1  2  1  0  1  0  1  0  1  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 25300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  1  0  0 -1  0  0  1 -1  0  0  1  0] (Indices: [0, 1, 3, 5, 6, 9, 10, 11, 15, 19]), Candidate: [ 2  0  2 -1  2  1  0  0  2  1  0  0  1  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  1  0 -1  0  0  1 -1  0  1  0 -1  1] (Indices: [0, 1, 3, 5, 6, 9, 10, 14, 17, 18]), Candidate: [ 2  0  2 -1  2  1  0  0  2  1 -1  1  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 25400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  1 -1  1 -1  0  1  0 -1  1 -1  0  1] (Indices: [0, 1, 3, 5, 6, 9, 11, 14, 15, 17]), Candidate: [ 2  0  2 -1  2  1  0  0  2  0  1  0  1  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  1 -1  0  1 -1  0  0  1  0  0 -1  1] (Indices: [0, 1, 3, 5, 6, 9, 12, 16, 17, 18]), Candidate: [ 2  0  2 -1  2  1  0  0  2  0  0  2  0  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  0  1  0  0 -1  0  1  0 -1  0  0  1] (Indices: [0, 1, 3, 5, 6, 10, 11, 12, 15, 16]), Candidate: [ 2  0  2 -1  2  1  0  0  1  2  0  1  0  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  0  1 -1  1  0 -1  1  0 -1  0  0  1] (Indices: [0, 1, 3, 5, 6, 10, 12, 13, 15, 16]), Candidate: [ 2  0  2 -1  2  1  0  0  1  2 -1  2  1  0  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 25600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  0  1 -1  0  0  1  0  0  0 -1  0  1] (Indices: [0, 1, 3, 5, 6, 10, 14, 15, 16, 17]), Candidate: [ 2  0  2 -1  2  1  0  0  1  2 -1  1  1  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 25650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  0  0  1 -1  1  0  0  0 -1  0  0  1] (Indices: [0, 1, 3, 5, 6, 11, 13, 14, 15, 16]), Candidate: [ 2  0  2 -1  2  1  0  0  1  1  1  0  2  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  0  0  0  1  0 -1  1 -1  0  1  0  0] (Indices: [0, 1, 3, 5, 6, 12, 13, 15, 18, 19]), Candidate: [ 2  0  2 -1  2  1  0  0  1  1  0  2  1  0  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0  0  0 -1  1 -1  1 -1  0  0  0  0  1] (Indices: [0, 1, 3, 5, 7, 8, 9, 10, 12, 14]), Candidate: [ 2  0  2 -1  2  0  2  0  1  1 -1  2  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 25800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0  0 -1  1 -1  0  0  0  1 -1  1 -1  1] (Indices: [0, 1, 3, 5, 7, 8, 9, 11, 16, 18]), Candidate: [ 2  0  2 -1  2  0  2  0  1  0  1  0  1  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0  0 -1  0  0  0  1 -1  0  0  1  0  0] (Indices: [0, 1, 3, 5, 7, 8, 9, 14, 18, 19]), Candidate: [ 2  0  2 -1  2  0  2  0  1  0  0  1  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 25900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0 -1  1 -1  1 -1  0  1  0 -1  0  0  1] (Indices: [0, 1, 3, 5, 7, 8, 10, 12, 15, 16]), Candidate: [ 2  0  2 -1  2  0  2  0  0  2 -1  2  0  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 25950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0 -1  0  1  0  0 -1  0  0  0  0  1  0] (Indices: [0, 1, 3, 5, 7, 8, 11, 12, 13, 19]), Candidate: [ 2  0  2 -1  2  0  2  0  0  1  1  1  1  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0 -1  0  1 -1  0  0  0  0  1  0  0  0] (Indices: [0, 1, 3, 5, 7, 8, 11, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  0  2  0  0  1  1  0  1  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0 -1  0  0  0  1 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 3, 5, 7, 8, 13, 15, 17, 19]), Candidate: [ 2  0  2 -1  2  0  2  0  0  1  0  1  2  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  1  0 -1  1  0 -1  1 -1  0  0  0  1] (Indices: [0, 1, 3, 5, 7, 9, 10, 12, 13, 15]), Candidate: [ 2  0  2 -1  2  0  2 -1  2  1 -1  2  1  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 26150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  1  0 -1  0  0  0  1 -1  0  1  0  0] (Indices: [0, 1, 3, 5, 7, 9, 10, 15, 18, 19]), Candidate: [ 2  0  2 -1  2  0  2 -1  2  1 -1  1  1  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 26200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  1 -1  1 -1  0  1 -1  0  0  1  0  0] (Indices: [0, 1, 3, 5, 7, 9, 11, 14, 18, 19]), Candidate: [ 2  0  2 -1  2  0  2 -1  2  0  1  0  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 26250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  1 -1  0  0  1  0 -1  1  0 -1  0  1] (Indices: [0, 1, 3, 5, 7, 9, 13, 14, 16, 17]), Candidate: [ 2  0  2 -1  2  0  2 -1  2  0  0  1  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 26300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  0  1  0  0 -1  0  0  0  1 -1  1  0] (Indices: [0, 1, 3, 5, 7, 10, 11, 12, 17, 19]), Candidate: [ 2  0  2 -1  2  0  2 -1  1  2  0  1  0  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 26350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  0  1 -1  1  0 -1  0  0  1 -1  1  0] (Indices: [0, 1, 3, 5, 7, 10, 12, 13, 17, 19]), Candidate: [ 2  0  2 -1  2  0  2 -1  1  2 -1  2  1  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 26400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  0  1 -1  0  0  1 -1  1 -1  1  0  0] (Indices: [0, 1, 3, 5, 7, 10, 14, 16, 18, 19]), Candidate: [ 2  0  2 -1  2  0  2 -1  1  2 -1  1  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 26450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  0  0  1 -1  1  0 -1  0  1 -1  1  0] (Indices: [0, 1, 3, 5, 7, 11, 13, 14, 17, 19]), Candidate: [ 2  0  2 -1  2  0  2 -1  1  1  1  0  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 26500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  0  0  0  1 -1  1  0 -1  1  0 -1  1] (Indices: [0, 1, 3, 5, 7, 12, 14, 15, 17, 18]), Candidate: [ 2  0  2 -1  2  0  2 -1  1  1  0  2  0  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 26550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1  0  0  0 -1  0  1 -1  0  0  0  1  0] (Indices: [0, 1, 3, 5, 8, 9, 10, 11, 14, 19]), Candidate: [ 2  0  2 -1  2  0  1  1  1  1  0  0  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 26600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1  0  0 -1  0  0  1  0 -1  0  0  1  0] (Indices: [0, 1, 3, 5, 8, 9, 10, 14, 15, 19]), Candidate: [ 2  0  2 -1  2  0  1  1  1  1 -1  1  1  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 26650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1  0 -1  1 -1  1 -1  0  0  1  0 -1  1] (Indices: [0, 1, 3, 5, 8, 9, 11, 13, 17, 18]), Candidate: [ 2  0  2 -1  2  0  1  1  1  0  1  0  2  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1  0 -1  0  1 -1  0  1  0 -1  0  1  0] (Indices: [0, 1, 3, 5, 8, 9, 12, 15, 16, 19]), Candidate: [ 2  0  2 -1  2  0  1  1  1  0  0  2  0  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1 -1  1  0  0 -1  1 -1  1 -1  0  0  1] (Indices: [0, 1, 3, 5, 8, 10, 11, 12, 14, 16]), Candidate: [ 2  0  2 -1  2  0  1  1  0  2  0  1  0  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 26800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1 -1  1 -1  1  0  0 -1  1 -1  0  0  1] (Indices: [0, 1, 3, 5, 8, 10, 12, 13, 14, 16]), Candidate: [ 2  0  2 -1  2  0  1  1  0  2 -1  2  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 26850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1 -1  1 -1  0  1 -1  0  1  0  0 -1  1] (Indices: [0, 1, 3, 5, 8, 10, 13, 16, 17, 18]), Candidate: [ 2  0  2 -1  2  0  1  1  0  2 -1  1  2  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 26900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1 -1  0  1  0 -1  0  0  1  0  0 -1  1] (Indices: [0, 1, 3, 5, 8, 11, 12, 16, 17, 18]), Candidate: [ 2  0  2 -1  2  0  1  1  0  1  1  1  0  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1 -1  0  0  1  0 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 3, 5, 8, 12, 13, 15, 16, 18]), Candidate: [ 2  0  2 -1  2  0  1  1  0  1  0  2  1  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  1  0  0  0  0 -1  0  0  0  0  1  0] (Indices: [0, 1, 3, 5, 9, 10, 11, 12, 13, 19]), Candidate: [ 2  0  2 -1  2  0  1  0  2  1  0  1  1  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  1  0  0 -1  0  0  0  0  1  0  0  0] (Indices: [0, 1, 3, 5, 9, 10, 11, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  0  1  0  2  1  0  0  1  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  1  0 -1  0  1 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 3, 5, 9, 10, 13, 15, 17, 19]), Candidate: [ 2  0  2 -1  2  0  1  0  2  1 -1  1  2  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  1 -1  1  0 -1  0  1 -1  1 -1  1  0] (Indices: [0, 1, 3, 5, 9, 11, 12, 15, 17, 19]), Candidate: [ 2  0  2 -1  2  0  1  0  2  0  1  1  0  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  1 -1  0  1  0  0 -1  0  0  1  0  0] (Indices: [0, 1, 3, 5, 9, 12, 13, 14, 18, 19]), Candidate: [ 2  0  2 -1  2  0  1  0  2  0  0  2  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  0  1  0  0  0  0 -1  0  0  1 -1  1] (Indices: [0, 1, 3, 5, 10, 11, 12, 13, 14, 18]), Candidate: [ 2  0  2 -1  2  0  1  0  1  2  0  1  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  0  1  0 -1  1 -1  0  1 -1  1  0  0] (Indices: [0, 1, 3, 5, 10, 11, 13, 16, 18, 19]), Candidate: [ 2  0  2 -1  2  0  1  0  1  2  0  0  2  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  0  1 -1  1 -1  0  1 -1  1  0  0  0] (Indices: [0, 1, 3, 5, 10, 12, 15, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  0  1  0  1  2 -1  2  0  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  0  0  1  0 -1  1 -1  1  0 -1  1  0] (Indices: [0, 1, 3, 5, 11, 12, 14, 16, 17, 19]), Candidate: [ 2  0  2 -1  2  0  1  0  1  1  1  1  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  0  0  0  0  1  0  0  0  0  0 -1  1] (Indices: [0, 1, 3, 5, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  0  2 -1  2  0  1  0  1  1  0  1  2  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0  0 -1  1 -1  1  0 -1  0  0  0  0  1] (Indices: [0, 1, 3, 6, 7, 8, 9, 11, 13, 14]), Candidate: [ 2  0  2 -1  1  2  1  0  1  0  1  0  2  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0  0 -1  0  0  1 -1  1 -1  0  0  1  0] (Indices: [0, 1, 3, 6, 7, 8, 9, 13, 15, 19]), Candidate: [ 2  0  2 -1  1  2  1  0  1  0  0  1  2  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0 -1  1  0 -1  0  0  0  1 -1  1 -1  1] (Indices: [0, 1, 3, 6, 7, 8, 10, 11, 16, 18]), Candidate: [ 2  0  2 -1  1  2  1  0  0  2  0  0  1  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0 -1  1 -1  0  0  1 -1  0  0  1  0  0] (Indices: [0, 1, 3, 6, 7, 8, 10, 14, 18, 19]), Candidate: [ 2  0  2 -1  1  2  1  0  0  2 -1  1  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 27700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0 -1  0  1 -1  0  1  0 -1  0  0  1  0] (Indices: [0, 1, 3, 6, 7, 8, 11, 14, 15, 19]), Candidate: [ 2  0  2 -1  1  2  1  0  0  1  1  0  1  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0 -1  0  0  1 -1  0  0  1 -1  1  0  0] (Indices: [0, 1, 3, 6, 7, 8, 12, 16, 18, 19]), Candidate: [ 2  0  2 -1  1  2  1  0  0  1  0  2  0  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  1  0  0 -1  0  1  0 -1  0  0  0  1] (Indices: [0, 1, 3, 6, 7, 9, 10, 11, 14, 15]), Candidate: [ 2  0  2 -1  1  2  1 -1  2  1  0  0  1  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  1  0 -1  0  1 -1  0  0  0  1  0  0] (Indices: [0, 1, 3, 6, 7, 9, 10, 13, 18, 19]), Candidate: [ 2  0  2 -1  1  2  1 -1  2  1 -1  1  2  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 27900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  1 -1  1 -1  1 -1  1 -1  0  0  1  0] (Indices: [0, 1, 3, 6, 7, 9, 11, 13, 15, 19]), Candidate: [ 2  0  2 -1  1  2  1 -1  2  0  1  0  2  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  1 -1  0  1 -1  1 -1  0  1 -1  1  0] (Indices: [0, 1, 3, 6, 7, 9, 12, 14, 17, 19]), Candidate: [ 2  0  2 -1  1  2  1 -1  2  0  0  2  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 28000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  0  1  0  0  0 -1  0  0  1 -1  0  1] (Indices: [0, 1, 3, 6, 7, 10, 11, 12, 13, 17]), Candidate: [ 2  0  2 -1  1  2  1 -1  1  2  0  1  1  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  0  1  0 -1  0  0  0  1  0 -1  1  0] (Indices: [0, 1, 3, 6, 7, 10, 11, 16, 17, 19]), Candidate: [ 2  0  2 -1  1  2  1 -1  1  2  0  0  1  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  0  1 -1  0  1 -1  1  0 -1  0  1  0] (Indices: [0, 1, 3, 6, 7, 10, 13, 15, 16, 19]), Candidate: [ 2  0  2 -1  1  2  1 -1  1  2 -1  1  2  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 28150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  0  0  1  0 -1  0  1  0 -1  0  1  0] (Indices: [0, 1, 3, 6, 7, 11, 12, 15, 16, 19]), Candidate: [ 2  0  2 -1  1  2  1 -1  1  1  1  1  0  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  0  0  0  1  0  0 -1  0  1  0 -1  1] (Indices: [0, 1, 3, 6, 7, 12, 13, 14, 17, 18]), Candidate: [ 2  0  2 -1  1  2  1 -1  1  1  0  2  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 28250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1  0  0  0  0 -1  1 -1  0  0  0  0  1] (Indices: [0, 1, 3, 6, 8, 9, 10, 11, 12, 14]), Candidate: [ 2  0  2 -1  1  2  0  1  1  1  0  1  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1  0  0 -1  0  1  0 -1  0  1 -1  0  1] (Indices: [0, 1, 3, 6, 8, 9, 10, 13, 14, 17]), Candidate: [ 2  0  2 -1  1  2  0  1  1  1 -1  1  2  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 28350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1  0 -1  1  0 -1  0  0  1 -1  0  1  0] (Indices: [0, 1, 3, 6, 8, 9, 11, 12, 16, 19]), Candidate: [ 2  0  2 -1  1  2  0  1  1  0  1  1  0  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1  0 -1  0  1  0 -1  0  1 -1  0  1  0] (Indices: [0, 1, 3, 6, 8, 9, 12, 13, 16, 19]), Candidate: [ 2  0  2 -1  1  2  0  1  1  0  0  2  1  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1  0 -1  0  0  0  1 -1  1  0  0 -1  1] (Indices: [0, 1, 3, 6, 8, 9, 14, 16, 17, 18]), Candidate: [ 2  0  2 -1  1  2  0  1  1  0  0  1  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1 -1  1  0 -1  0  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 3, 6, 8, 10, 11, 14, 16, 18]), Candidate: [ 2  0  2 -1  1  2  0  1  0  2  0  0  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1 -1  1 -1  0  1  0  0  0 -1  0  0  1] (Indices: [0, 1, 3, 6, 8, 10, 13, 14, 15, 16]), Candidate: [ 2  0  2 -1  1  2  0  1  0  2 -1  1  2  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1 -1  0  1  0 -1  1  0  0 -1  0  0  1] (Indices: [0, 1, 3, 6, 8, 11, 12, 14, 15, 16]), Candidate: [ 2  0  2 -1  1  2  0  1  0  1  1  1  0  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1 -1  0  1 -1  0  0  1  0  0  0 -1  1] (Indices: [0, 1, 3, 6, 8, 11, 15, 16, 17, 18]), Candidate: [ 2  0  2 -1  1  2  0  1  0  1  1  0  1  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1 -1  0  0  0  1 -1  1  0  0  0 -1  1] (Indices: [0, 1, 3, 6, 8, 13, 15, 16, 17, 18]), Candidate: [ 2  0  2 -1  1  2  0  1  0  1  0  1  2  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  1  0  0 -1  0  1  0 -1  0  0  1  0] (Indices: [0, 1, 3, 6, 9, 10, 11, 14, 15, 19]), Candidate: [ 2  0  2 -1  1  2  0  0  2  1  0  0  1  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  1  0 -1  1 -1  0  0  1 -1  1  0  0] (Indices: [0, 1, 3, 6, 9, 10, 12, 16, 18, 19]), Candidate: [ 2  0  2 -1  1  2  0  0  2  1 -1  2  0  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  1 -1  1  0  0 -1  0  0  1 -1  1  0] (Indices: [0, 1, 3, 6, 9, 11, 12, 13, 17, 19]), Candidate: [ 2  0  2 -1  1  2  0  0  2  0  1  1  1  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  1 -1  1 -1  0  1 -1  1 -1  1  0  0] (Indices: [0, 1, 3, 6, 9, 11, 14, 16, 18, 19]), Candidate: [ 2  0  2 -1  1  2  0  0  2  0  1  0  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  1 -1  0  0  1  0 -1  1 -1  1  0  0] (Indices: [0, 1, 3, 6, 9, 13, 14, 16, 18, 19]), Candidate: [ 2  0  2 -1  1  2  0  0  2  0  0  1  2  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  0  1  0 -1  1  0  0 -1  0  1 -1  1] (Indices: [0, 1, 3, 6, 10, 11, 13, 14, 15, 18]), Candidate: [ 2  0  2 -1  1  2  0  0  1  2  0  0  2  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  0  1 -1  1  0 -1  0  1  0 -1  1  0] (Indices: [0, 1, 3, 6, 10, 12, 13, 16, 17, 19]), Candidate: [ 2  0  2 -1  1  2  0  0  1  2 -1  2  1  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  0  0  1  0  0 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 3, 6, 11, 12, 13, 15, 16, 18]), Candidate: [ 2  0  2 -1  1  2  0  0  1  1  1  1  1  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  0  0  0  1  0  0  0 -1  0  1  0  0] (Indices: [0, 1, 3, 6, 12, 13, 14, 15, 18, 19]), Candidate: [ 2  0  2 -1  1  2  0  0  1  1  0  2  1  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0  0  0  0 -1  0  0  0  0  0  1  0  0] (Indices: [0, 1, 3, 7, 8, 9, 10, 11, 18, 19]), Candidate: [ 2  0  2 -1  1  1  2  0  1  1  0  0  1  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0  0  0 -1  0  0  0  1 -1  1  0 -1  1] (Indices: [0, 1, 3, 7, 8, 9, 10, 15, 17, 18]), Candidate: [ 2  0  2 -1  1  1  2  0  1  1 -1  1  1  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0  0 -1  1 -1  0  1 -1  0  1  0 -1  1] (Indices: [0, 1, 3, 7, 8, 9, 11, 14, 17, 18]), Candidate: [ 2  0  2 -1  1  1  2  0  1  0  1  0  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0  0 -1  0  0  1  0  0 -1  0  1 -1  1] (Indices: [0, 1, 3, 7, 8, 9, 13, 14, 15, 18]), Candidate: [ 2  0  2 -1  1  1  2  0  1  0  0  1  2  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0 -1  1  0  0 -1  0  0  1 -1  0  1  0] (Indices: [0, 1, 3, 7, 8, 10, 11, 12, 16, 19]), Candidate: [ 2  0  2 -1  1  1  2  0  0  2  0  1  0  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0 -1  1 -1  1  0 -1  0  1 -1  0  1  0] (Indices: [0, 1, 3, 7, 8, 10, 12, 13, 16, 19]), Candidate: [ 2  0  2 -1  1  1  2  0  0  2 -1  2  1  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0 -1  1 -1  0  0  1 -1  1  0  0 -1  1] (Indices: [0, 1, 3, 7, 8, 10, 14, 16, 17, 18]), Candidate: [ 2  0  2 -1  1  1  2  0  0  2 -1  1  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 29550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0 -1  0  1 -1  1  0 -1  1 -1  0  1  0] (Indices: [0, 1, 3, 7, 8, 11, 13, 14, 16, 19]), Candidate: [ 2  0  2 -1  1  1  2  0  0  1  1  0  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0 -1  0  0  1 -1  1  0  0 -1  1 -1  1] (Indices: [0, 1, 3, 7, 8, 12, 14, 15, 16, 18]), Candidate: [ 2  0  2 -1  1  1  2  0  0  1  0  2  0  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  1  0  0  0 -1  0  0  1  0 -1  0  1] (Indices: [0, 1, 3, 7, 9, 10, 11, 12, 16, 17]), Candidate: [ 2  0  2 -1  1  1  2 -1  2  1  0  1  0  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  1  0 -1  1  0 -1  0  1  0 -1  0  1] (Indices: [0, 1, 3, 7, 9, 10, 12, 13, 16, 17]), Candidate: [ 2  0  2 -1  1  1  2 -1  2  1 -1  2  1  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 29750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  1  0 -1  0  0  1  0 -1  1 -1  1  0] (Indices: [0, 1, 3, 7, 9, 10, 14, 15, 17, 19]), Candidate: [ 2  0  2 -1  1  1  2 -1  2  1 -1  1  1  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 29800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  1 -1  1 -1  1  0 -1  1  0 -1  0  1] (Indices: [0, 1, 3, 7, 9, 11, 13, 14, 16, 17]), Candidate: [ 2  0  2 -1  1  1  2 -1  2  0  1  0  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 29850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  1 -1  0  1  0 -1  0  0  1  0  0  0] (Indices: [0, 1, 3, 7, 9, 12, 13, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  2 -1  2  0  0  2  1  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  0  1  0  0  0 -1  0  0  1 -1  1  0] (Indices: [0, 1, 3, 7, 10, 11, 12, 13, 17, 19]), Candidate: [ 2  0  2 -1  1  1  2 -1  1  2  0  1  1  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  0  1  0 -1  0  1 -1  1 -1  1  0  0] (Indices: [0, 1, 3, 7, 10, 11, 14, 16, 18, 19]), Candidate: [ 2  0  2 -1  1  1  2 -1  1  2  0  0  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 30000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  0  1 -1  0  1  0 -1  1 -1  1  0  0] (Indices: [0, 1, 3, 7, 10, 13, 14, 16, 18, 19]), Candidate: [ 2  0  2 -1  1  1  2 -1  1  2 -1  1  2  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 30050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  0  0  1 -1  1  0  0  0 -1  0  1  0] (Indices: [0, 1, 3, 7, 11, 13, 14, 15, 16, 19]), Candidate: [ 2  0  2 -1  1  1  2 -1  1  1  1  0  2  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 30100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1  0  0  0  0  0 -1  0  0  1 -1  0  1] (Indices: [0, 1, 3, 8, 9, 10, 11, 12, 13, 17]), Candidate: [ 2  0  2 -1  1  1  1  1  1  1  0  1  1  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1  0  0  0 -1  0  0  0  1  0 -1  1  0] (Indices: [0, 1, 3, 8, 9, 10, 11, 16, 17, 19]), Candidate: [ 2  0  2 -1  1  1  1  1  1  1  0  0  1  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1  0  0 -1  0  1 -1  1  0 -1  0  1  0] (Indices: [0, 1, 3, 8, 9, 10, 13, 15, 16, 19]), Candidate: [ 2  0  2 -1  1  1  1  1  1  1 -1  1  2  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 30250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1  0 -1  1  0 -1  0  1  0 -1  0  1  0] (Indices: [0, 1, 3, 8, 9, 11, 12, 15, 16, 19]), Candidate: [ 2  0  2 -1  1  1  1  1  1  0  1  1  0  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1  0 -1  0  1  0  0 -1  0  1  0 -1  1] (Indices: [0, 1, 3, 8, 9, 12, 13, 14, 17, 18]), Candidate: [ 2  0  2 -1  1  1  1  1  1  0  0  2  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 30350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1 -1  1  0  0  0  0 -1  1 -1  0  0  1] (Indices: [0, 1, 3, 8, 10, 11, 12, 13, 14, 16]), Candidate: [ 2  0  2 -1  1  1  1  1  0  2  0  1  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 30400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1 -1  1  0 -1  1 -1  0  1  0  0 -1  1] (Indices: [0, 1, 3, 8, 10, 11, 13, 16, 17, 18]), Candidate: [ 2  0  2 -1  1  1  1  1  0  2  0  0  2  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1 -1  1 -1  1 -1  0  1  0  0 -1  1  0] (Indices: [0, 1, 3, 8, 10, 12, 15, 16, 17, 19]), Candidate: [ 2  0  2 -1  1  1  1  1  0  2 -1  2  0  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 30500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1 -1  0  1  0 -1  1  0 -1  0  1  0  0] (Indices: [0, 1, 3, 8, 11, 12, 14, 15, 18, 19]), Candidate: [ 2  0  2 -1  1  1  1  1  0  1  1  1  0  2  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1 -1  0  0  1 -1  1 -1  1  0  0  0  0] (Indices: [0, 1, 3, 8, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  1  1  0  1  0  2  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 30600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  1  0  0 -1  1  0 -1  1 -1  0  1  0] (Indices: [0, 1, 3, 9, 10, 11, 13, 14, 16, 19]), Candidate: [ 2  0  2 -1  1  1  1  0  2  1  0  0  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 30650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  1  0 -1  1 -1  1  0  0 -1  1 -1  1] (Indices: [0, 1, 3, 9, 10, 12, 14, 15, 16, 18]), Candidate: [ 2  0  2 -1  1  1  1  0  2  1 -1  2  0  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 30700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  1 -1  1  0  0 -1  1 -1  0  1  0  0] (Indices: [0, 1, 3, 9, 11, 12, 13, 15, 18, 19]), Candidate: [ 2  0  2 -1  1  1  1  0  2  0  1  1  1  0  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  1 -1  0  1  0  0 -1  0  1  0  0  0] (Indices: [0, 1, 3, 9, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  1  0  2  0  0  2  1  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 30800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  0  1  0  0 -1  0  1  0  0 -1  1  0] (Indices: [0, 1, 3, 10, 11, 12, 15, 16, 17, 19]), Candidate: [ 2  0  2 -1  1  1  1  0  1  2  0  1  0  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  0  1 -1  0  1  0 -1  1  0  0  0  0] (Indices: [0, 1, 3, 10, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  1  0  1  2 -1  1  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 30900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0  0 -1  1 -1  0  1 -1  0  0  0  0  1] (Indices: [0, 1, 4, 5, 6, 7, 8, 9, 11, 14]), Candidate: [ 2  0  1  1  1  1  1  0  1  0  1  0  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0 -1  1 -1  0  1 -1  1 -1  0  0  0  1] (Indices: [0, 1, 4, 5, 6, 7, 8, 10, 13, 15]), Candidate: [ 2  0  1  1  1  1  1  0  0  2 -1  1  2  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0 -1  0  0  1  0 -1  0  1 -1  0  0  1] (Indices: [0, 1, 4, 5, 6, 7, 8, 12, 13, 16]), Candidate: [2 0 1 1 1 1 1 0 0 1 0 2 1 0 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 31050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0 -1  0  0  0  0  0  0  1  0  0 -1  1] (Indices: [0, 1, 4, 5, 6, 7, 8, 16, 17, 18]), Candidate: [2 0 1 1 1 1 1 0 0 1 0 1 1 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 31100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  1 -1  1 -1  1 -1  0  0  1 -1  0  1] (Indices: [0, 1, 4, 5, 6, 7, 9, 11, 13, 17]), Candidate: [ 2  0  1  1  1  1  1 -1  2  0  1  0  2  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  1 -1  0  0  1 -1  0  1 -1  0  1  0] (Indices: [0, 1, 4, 5, 6, 7, 9, 13, 16, 19]), Candidate: [ 2  0  1  1  1  1  1 -1  2  0  0  1  2  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  0  1  0 -1  0  0  0  0  1 -1  1  0] (Indices: [0, 1, 4, 5, 6, 7, 10, 11, 17, 19]), Candidate: [ 2  0  1  1  1  1  1 -1  1  2  0  0  1  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  0  1 -1  0  0  0  1  0 -1  0  1  0] (Indices: [0, 1, 4, 5, 6, 7, 10, 15, 16, 19]), Candidate: [ 2  0  1  1  1  1  1 -1  1  2 -1  1  1  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  0  0  1 -1  0  1 -1  1 -1  0  1  0] (Indices: [0, 1, 4, 5, 6, 7, 11, 14, 16, 19]), Candidate: [ 2  0  1  1  1  1  1 -1  1  1  1  0  1  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  0  0  0  0  1  0  0 -1  1 -1  0  1] (Indices: [0, 1, 4, 5, 6, 7, 13, 14, 15, 17]), Candidate: [ 2  0  1  1  1  1  1 -1  1  1  0  1  2  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1  0  0 -1  0  1 -1  1 -1  0  0  0  1] (Indices: [0, 1, 4, 5, 6, 8, 9, 10, 13, 15]), Candidate: [ 2  0  1  1  1  1  0  1  1  1 -1  1  2  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1  0 -1  0  1  0 -1  0  1 -1  0  0  1] (Indices: [0, 1, 4, 5, 6, 8, 9, 12, 13, 16]), Candidate: [2 0 1 1 1 1 0 1 1 0 0 2 1 0 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 31500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1  0 -1  0  0  0  0  0  1  0  0 -1  1] (Indices: [0, 1, 4, 5, 6, 8, 9, 16, 17, 18]), Candidate: [2 0 1 1 1 1 0 1 1 0 0 1 1 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 31550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1 -1  1 -1  1 -1  0  0  0  1  0 -1  1] (Indices: [0, 1, 4, 5, 6, 8, 10, 12, 17, 18]), Candidate: [ 2  0  1  1  1  1  0  1  0  2 -1  2  0  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1 -1  0  1  0 -1  0  1 -1  1 -1  0  1] (Indices: [0, 1, 4, 5, 6, 8, 11, 12, 15, 17]), Candidate: [2 0 1 1 1 1 0 1 0 1 1 1 0 1 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 31650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1 -1  0  0  1  0 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 4, 5, 6, 8, 12, 13, 15, 17]), Candidate: [2 0 1 1 1 1 0 1 0 1 0 2 1 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 31700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1 -1  0  0  0  0  1  0  0 -1  1 -1  1] (Indices: [0, 1, 4, 5, 6, 8, 14, 15, 16, 18]), Candidate: [2 0 1 1 1 1 0 1 0 1 0 1 1 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 31750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  1  0 -1  1 -1  1 -1  0  1 -1  0  1] (Indices: [0, 1, 4, 5, 6, 9, 10, 12, 14, 17]), Candidate: [ 2  0  1  1  1  1  0  0  2  1 -1  2  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  1 -1  1  0  0 -1  0  1 -1  0  0  1] (Indices: [0, 1, 4, 5, 6, 9, 11, 12, 13, 16]), Candidate: [2 0 1 1 1 1 0 0 2 0 1 1 1 0 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 31850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  1 -1  1 -1  0  0  0  1  0  0 -1  1] (Indices: [0, 1, 4, 5, 6, 9, 11, 16, 17, 18]), Candidate: [2 0 1 1 1 1 0 0 2 0 1 0 1 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 31900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  1 -1  0  0  1 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 4, 5, 6, 9, 13, 15, 16, 18]), Candidate: [2 0 1 1 1 1 0 0 2 0 0 1 2 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 31950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  0  1  0 -1  1 -1  1  0 -1  0  0  1] (Indices: [0, 1, 4, 5, 6, 10, 11, 13, 15, 16]), Candidate: [2 0 1 1 1 1 0 0 1 2 0 0 2 0 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 32000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  0  1 -1  1 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 4, 5, 6, 10, 12, 14, 16, 18]), Candidate: [ 2  0  1  1  1  1  0  0  1  2 -1  2  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  0  0  1  0  0  0  0 -1  0  0  0  1] (Indices: [0, 1, 4, 5, 6, 11, 12, 13, 14, 15]), Candidate: [2 0 1 1 1 1 0 0 1 1 1 1 1 1 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 32100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  0  0  1 -1  1 -1  1 -1  0  1  0  0] (Indices: [0, 1, 4, 5, 6, 11, 13, 15, 18, 19]), Candidate: [2 0 1 1 1 1 0 0 1 1 1 0 2 0 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 32150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  0  0  0  1 -1  0  1  0  0  0 -1  1] (Indices: [0, 1, 4, 5, 6, 12, 15, 16, 17, 18]), Candidate: [2 0 1 1 1 1 0 0 1 1 0 2 0 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 32200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0  0  0 -1  0  0  1 -1  0  0  1 -1  1] (Indices: [0, 1, 4, 5, 7, 8, 9, 10, 14, 18]), Candidate: [ 2  0  1  1  1  0  2  0  1  1 -1  1  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0  0 -1  0  1 -1  1 -1  0  0  0  1  0] (Indices: [0, 1, 4, 5, 7, 8, 9, 12, 14, 19]), Candidate: [ 2  0  1  1  1  0  2  0  1  0  0  2  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0 -1  1  0  0 -1  0  0  0  1 -1  0  1] (Indices: [0, 1, 4, 5, 7, 8, 10, 11, 12, 17]), Candidate: [2 0 1 1 1 0 2 0 0 2 0 1 0 1 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 32350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0 -1  1 -1  0  1 -1  1  0 -1  0  0  1] (Indices: [0, 1, 4, 5, 7, 8, 10, 13, 15, 16]), Candidate: [ 2  0  1  1  1  0  2  0  0  2 -1  1  2  0  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0 -1  0  1  0 -1  0  0  0  0  1  0  0] (Indices: [0, 1, 4, 5, 7, 8, 11, 12, 18, 19]), Candidate: [2 0 1 1 1 0 2 0 0 1 1 1 0 1 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 32450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0 -1  0  0  1  0 -1  0  0  0  1  0  0] (Indices: [0, 1, 4, 5, 7, 8, 12, 13, 18, 19]), Candidate: [2 0 1 1 1 0 2 0 0 1 0 2 1 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 32500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0 -1  0  0  0  0  1 -1  0  1  0  0  0] (Indices: [0, 1, 4, 5, 7, 8, 14, 17, 18, 19]), Candidate: [ 2  0  1  1  1  0  2  0  0  1  0  1  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  1  0 -1  1 -1  0  0  1 -1  1 -1  1] (Indices: [0, 1, 4, 5, 7, 9, 10, 12, 16, 18]), Candidate: [ 2  0  1  1  1  0  2 -1  2  1 -1  2  0  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  1 -1  1  0 -1  1 -1  0  0  0  1  0] (Indices: [0, 1, 4, 5, 7, 9, 11, 12, 14, 19]), Candidate: [ 2  0  1  1  1  0  2 -1  2  0  1  1  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  1 -1  0  1  0  0 -1  0  0  0  1  0] (Indices: [0, 1, 4, 5, 7, 9, 12, 13, 14, 19]), Candidate: [ 2  0  1  1  1  0  2 -1  2  0  0  2  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  1 -1  0  0  1 -1  0  0  1  0  0  0] (Indices: [0, 1, 4, 5, 7, 9, 13, 17, 18, 19]), Candidate: [ 2  0  1  1  1  0  2 -1  2  0  0  1  2  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  0  1  0 -1  1 -1  0  0  1 -1  1  0] (Indices: [0, 1, 4, 5, 7, 10, 11, 13, 17, 19]), Candidate: [ 2  0  1  1  1  0  2 -1  1  2  0  0  2  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  0  1 -1  1 -1  0  1 -1  1  0 -1  1] (Indices: [0, 1, 4, 5, 7, 10, 12, 15, 17, 18]), Candidate: [ 2  0  1  1  1  0  2 -1  1  2 -1  2  0  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  0  0  1  0  0 -1  1 -1  0  0  1  0] (Indices: [0, 1, 4, 5, 7, 11, 12, 13, 15, 19]), Candidate: [ 2  0  1  1  1  0  2 -1  1  1  1  1  1  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  0  0  1 -1  0  1  0 -1  1  0 -1  1] (Indices: [0, 1, 4, 5, 7, 11, 14, 15, 17, 18]), Candidate: [ 2  0  1  1  1  0  2 -1  1  1  1  0  1  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  0  0  0  0  1  0  0 -1  1  0 -1  1] (Indices: [0, 1, 4, 5, 7, 13, 14, 15, 17, 18]), Candidate: [ 2  0  1  1  1  0  2 -1  1  1  0  1  2  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1  0  0 -1  1  0 -1  0  0  0  1 -1  1] (Indices: [0, 1, 4, 5, 8, 9, 10, 12, 13, 18]), Candidate: [ 2  0  1  1  1  0  1  1  1  1 -1  2  1  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1  0  0 -1  0  0  0  0  1 -1  1  0  0] (Indices: [0, 1, 4, 5, 8, 9, 10, 16, 18, 19]), Candidate: [ 2  0  1  1  1  0  1  1  1  1 -1  1  1  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1  0 -1  1 -1  0  0  1  0 -1  0  1  0] (Indices: [0, 1, 4, 5, 8, 9, 11, 15, 16, 19]), Candidate: [2 0 1 1 1 0 1 1 1 0 1 0 1 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 33150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1  0 -1  0  0  1  0 -1  0  1  0 -1  1] (Indices: [0, 1, 4, 5, 8, 9, 13, 14, 17, 18]), Candidate: [ 2  0  1  1  1  0  1  1  1  0  0  1  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1 -1  1  0 -1  1  0 -1  1 -1  0  0  1] (Indices: [0, 1, 4, 5, 8, 10, 11, 13, 14, 16]), Candidate: [ 2  0  1  1  1  0  1  1  0  2  0  0  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1 -1  1 -1  1 -1  1  0 -1  1 -1  0  1] (Indices: [0, 1, 4, 5, 8, 10, 12, 14, 15, 17]), Candidate: [ 2  0  1  1  1  0  1  1  0  2 -1  2  0  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1 -1  1 -1  0  0  0  1  0  0 -1  1  0] (Indices: [0, 1, 4, 5, 8, 10, 15, 16, 17, 19]), Candidate: [ 2  0  1  1  1  0  1  1  0  2 -1  1  1  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1 -1  0  1 -1  1 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 4, 5, 8, 11, 13, 15, 16, 18]), Candidate: [2 0 1 1 1 0 1 1 0 1 1 0 2 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 33400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1 -1  0  0  1 -1  1 -1  1  0  0 -1  1] (Indices: [0, 1, 4, 5, 8, 12, 14, 16, 17, 18]), Candidate: [ 2  0  1  1  1  0  1  1  0  1  0  2  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  1  0  0  0 -1  0  0  0  0  1  0  0] (Indices: [0, 1, 4, 5, 9, 10, 11, 12, 18, 19]), Candidate: [2 0 1 1 1 0 1 0 2 1 0 1 0 1 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 33500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  1  0 -1  1  0 -1  0  0  0  1  0  0] (Indices: [0, 1, 4, 5, 9, 10, 12, 13, 18, 19]), Candidate: [ 2  0  1  1  1  0  1  0  2  1 -1  2  1  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  1  0 -1  0  0  1 -1  0  1  0  0  0] (Indices: [0, 1, 4, 5, 9, 10, 14, 17, 18, 19]), Candidate: [ 2  0  1  1  1  0  1  0  2  1 -1  1  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 33600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  1 -1  1 -1  1  0 -1  0  0  1  0  0] (Indices: [0, 1, 4, 5, 9, 11, 13, 14, 18, 19]), Candidate: [ 2  0  1  1  1  0  1  0  2  0  1  0  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  1 -1  0  1 -1  1  0 -1  1 -1  1  0] (Indices: [0, 1, 4, 5, 9, 12, 14, 15, 17, 19]), Candidate: [2 0 1 1 1 0 1 0 2 0 0 2 0 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 33700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  0  1  0  0 -1  1  0 -1  0  0  1  0] (Indices: [0, 1, 4, 5, 10, 11, 12, 14, 15, 19]), Candidate: [2 0 1 1 1 0 1 0 1 2 0 1 0 2 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 33750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  0  1  0 -1  0  0  1 -1  1  0  0  0] (Indices: [0, 1, 4, 5, 10, 11, 15, 17, 18, 19]), Candidate: [2 0 1 1 1 0 1 0 1 2 0 0 1 1 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 33800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  0  1 -1  0  1 -1  1 -1  1  0  0  0] (Indices: [0, 1, 4, 5, 10, 13, 15, 17, 18, 19]), Candidate: [ 2  0  1  1  1  0  1  0  1  2 -1  1  2  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  0  0  1 -1  1  0 -1  1  0 -1  1  0] (Indices: [0, 1, 4, 5, 11, 13, 14, 16, 17, 19]), Candidate: [ 2  0  1  1  1  0  1  0  1  1  1  0  2  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0  0  0 -1  1  0 -1  0  0  0  0  0  1] (Indices: [0, 1, 4, 6, 7, 8, 9, 10, 12, 13]), Candidate: [ 2  0  1  1  0  2  1  0  1  1 -1  2  1  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0  0 -1  1 -1  0  0  0  1  0 -1  0  1] (Indices: [0, 1, 4, 6, 7, 8, 9, 11, 16, 17]), Candidate: [2 0 1 1 0 2 1 0 1 0 1 0 1 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 34000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0  0 -1  0  0  0  1 -1  0  1 -1  1  0] (Indices: [0, 1, 4, 6, 7, 8, 9, 14, 17, 19]), Candidate: [ 2  0  1  1  0  2  1  0  1  0  0  1  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0 -1  1 -1  1 -1  1 -1  0  0  0  1  0] (Indices: [0, 1, 4, 6, 7, 8, 10, 12, 14, 19]), Candidate: [ 2  0  1  1  0  2  1  0  0  2 -1  2  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0 -1  0  1  0  0 -1  0  0  0  1 -1  1] (Indices: [0, 1, 4, 6, 7, 8, 11, 12, 13, 18]), Candidate: [2 0 1 1 0 2 1 0 0 1 1 1 1 0 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 34150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0 -1  0  1 -1  0  0  0  1 -1  1  0  0] (Indices: [0, 1, 4, 6, 7, 8, 11, 16, 18, 19]), Candidate: [2 0 1 1 0 2 1 0 0 1 1 0 1 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 34200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0 -1  0  0  0  1 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 4, 6, 7, 8, 13, 15, 17, 18]), Candidate: [2 0 1 1 0 2 1 0 0 1 0 1 2 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 34250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  1  0 -1  1  0  0 -1  0  0  0  0  1] (Indices: [0, 1, 4, 6, 7, 9, 10, 12, 13, 14]), Candidate: [ 2  0  1  1  0  2  1 -1  2  1 -1  2  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 34300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  1  0 -1  0  0  0  1 -1  1 -1  1  0] (Indices: [0, 1, 4, 6, 7, 9, 10, 15, 17, 19]), Candidate: [ 2  0  1  1  0  2  1 -1  2  1 -1  1  1  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  1 -1  1 -1  0  1 -1  0  1 -1  1  0] (Indices: [0, 1, 4, 6, 7, 9, 11, 14, 17, 19]), Candidate: [ 2  0  1  1  0  2  1 -1  2  0  1  0  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  1 -1  0  0  1  0  0 -1  0  0  1  0] (Indices: [0, 1, 4, 6, 7, 9, 13, 14, 15, 19]), Candidate: [ 2  0  1  1  0  2  1 -1  2  0  0  1  2  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  0  1  0  0 -1  0  0  0  1  0 -1  1] (Indices: [0, 1, 4, 6, 7, 10, 11, 12, 17, 18]), Candidate: [ 2  0  1  1  0  2  1 -1  1  2  0  1  0  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  0  1 -1  1  0 -1  0  0  1  0 -1  1] (Indices: [0, 1, 4, 6, 7, 10, 12, 13, 17, 18]), Candidate: [ 2  0  1  1  0  2  1 -1  1  2 -1  2  1  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  0  1 -1  0  0  1 -1  1  0 -1  1  0] (Indices: [0, 1, 4, 6, 7, 10, 14, 16, 17, 19]), Candidate: [ 2  0  1  1  0  2  1 -1  1  2 -1  1  1  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 34600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  0  0  1 -1  1  0 -1  0  1  0 -1  1] (Indices: [0, 1, 4, 6, 7, 11, 13, 14, 17, 18]), Candidate: [ 2  0  1  1  0  2  1 -1  1  1  1  0  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  0  0  0  1 -1  1  0  0 -1  0  1  0] (Indices: [0, 1, 4, 6, 7, 12, 14, 15, 16, 19]), Candidate: [ 2  0  1  1  0  2  1 -1  1  1  0  2  0  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1  0  0  0 -1  0  1 -1  0  0  1 -1  1] (Indices: [0, 1, 4, 6, 8, 9, 10, 11, 14, 18]), Candidate: [ 2  0  1  1  0  2  0  1  1  1  0  0  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1  0  0 -1  0  0  1  0 -1  0  1 -1  1] (Indices: [0, 1, 4, 6, 8, 9, 10, 14, 15, 18]), Candidate: [ 2  0  1  1  0  2  0  1  1  1 -1  1  1  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1  0 -1  1 -1  1 -1  0  1 -1  0  1  0] (Indices: [0, 1, 4, 6, 8, 9, 11, 13, 16, 19]), Candidate: [2 0 1 1 0 2 0 1 1 0 1 0 2 0 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 34850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1  0 -1  0  1 -1  0  1  0 -1  1 -1  1] (Indices: [0, 1, 4, 6, 8, 9, 12, 15, 16, 18]), Candidate: [2 0 1 1 0 2 0 1 1 0 0 2 0 1 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 34900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1 -1  1  0  0 -1  1  0 -1  0  0  0  1] (Indices: [0, 1, 4, 6, 8, 10, 11, 12, 14, 15]), Candidate: [2 0 1 1 0 2 0 1 0 2 0 1 0 2 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 34950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1 -1  1 -1  1  0  0  0 -1  0  0  0  1] (Indices: [0, 1, 4, 6, 8, 10, 12, 13, 14, 15]), Candidate: [ 2  0  1  1  0  2  0  1  0  2 -1  2  1  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1 -1  1 -1  0  1 -1  1 -1  0  1  0  0] (Indices: [0, 1, 4, 6, 8, 10, 13, 15, 18, 19]), Candidate: [ 2  0  1  1  0  2  0  1  0  2 -1  1  2  0  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1 -1  0  1  0 -1  0  1 -1  0  1  0  0] (Indices: [0, 1, 4, 6, 8, 11, 12, 15, 18, 19]), Candidate: [2 0 1 1 0 2 0 1 0 1 1 1 0 1 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 35100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1 -1  0  0  1  0 -1  1  0  0 -1  0  1] (Indices: [0, 1, 4, 6, 8, 12, 13, 15, 16, 17]), Candidate: [2 0 1 1 0 2 0 1 0 1 0 2 1 0 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 35150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  1  0  0  0  0 -1  0  0  0  1 -1  1] (Indices: [0, 1, 4, 6, 9, 10, 11, 12, 13, 18]), Candidate: [2 0 1 1 0 2 0 0 2 1 0 1 1 0 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 35200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  1  0  0 -1  0  0  0  1 -1  1  0  0] (Indices: [0, 1, 4, 6, 9, 10, 11, 16, 18, 19]), Candidate: [2 0 1 1 0 2 0 0 2 1 0 0 1 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 35250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  1  0 -1  0  1 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 4, 6, 9, 10, 13, 15, 17, 18]), Candidate: [ 2  0  1  1  0  2  0  0  2  1 -1  1  2  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  1 -1  1  0 -1  0  1 -1  1  0 -1  1] (Indices: [0, 1, 4, 6, 9, 11, 12, 15, 17, 18]), Candidate: [2 0 1 1 0 2 0 0 2 0 1 1 0 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 35350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  1 -1  0  1  0  0 -1  0  1 -1  1  0] (Indices: [0, 1, 4, 6, 9, 12, 13, 14, 17, 19]), Candidate: [ 2  0  1  1  0  2  0  0  2  0  0  2  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  0  1  0  0  0  0 -1  0  1 -1  0  1] (Indices: [0, 1, 4, 6, 10, 11, 12, 13, 14, 17]), Candidate: [ 2  0  1  1  0  2  0  0  1  2  0  1  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  0  1  0 -1  1 -1  0  1  0 -1  1  0] (Indices: [0, 1, 4, 6, 10, 11, 13, 16, 17, 19]), Candidate: [2 0 1 1 0 2 0 0 1 2 0 0 2 0 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 35500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  0  1 -1  1 -1  0  1  0 -1  1  0  0] (Indices: [0, 1, 4, 6, 10, 12, 15, 16, 18, 19]), Candidate: [ 2  0  1  1  0  2  0  0  1  2 -1  2  0  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  0  0  1  0 -1  1 -1  1  0  0 -1  1] (Indices: [0, 1, 4, 6, 11, 12, 14, 16, 17, 18]), Candidate: [ 2  0  1  1  0  2  0  0  1  1  1  1  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  0  0  0  1 -1  0  1  0  0  0  0  0] (Indices: [0, 1, 4, 6, 12, 15, 16, 17, 18, 19]), Candidate: [2 0 1 1 0 2 0 0 1 1 0 2 0 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 35650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0  0  0 -1  1 -1  0  1 -1  0  0  1  0] (Indices: [0, 1, 4, 7, 8, 9, 10, 12, 15, 19]), Candidate: [ 2  0  1  1  0  1  2  0  1  1 -1  2  0  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0  0 -1  1  0 -1  1 -1  0  1 -1  0  1] (Indices: [0, 1, 4, 7, 8, 9, 11, 12, 14, 17]), Candidate: [ 2  0  1  1  0  1  2  0  1  0  1  1  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0  0 -1  0  1  0  0 -1  0  1 -1  0  1] (Indices: [0, 1, 4, 7, 8, 9, 12, 13, 14, 17]), Candidate: [ 2  0  1  1  0  1  2  0  1  0  0  2  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0  0 -1  0  0  1 -1  0  1  0 -1  1  0] (Indices: [0, 1, 4, 7, 8, 9, 13, 16, 17, 19]), Candidate: [2 0 1 1 0 1 2 0 1 0 0 1 2 0 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 35850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0 -1  1  0 -1  1 -1  0  1 -1  0  1  0] (Indices: [0, 1, 4, 7, 8, 10, 11, 13, 16, 19]), Candidate: [2 0 1 1 0 1 2 0 0 2 0 0 2 0 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 35900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0 -1  1 -1  1 -1  0  1  0 -1  1 -1  1] (Indices: [0, 1, 4, 7, 8, 10, 12, 15, 16, 18]), Candidate: [ 2  0  1  1  0  1  2  0  0  2 -1  2  0  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0 -1  0  1  0  0 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 4, 7, 8, 11, 12, 13, 15, 17]), Candidate: [2 0 1 1 0 1 2 0 0 1 1 1 1 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 36000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0 -1  0  1 -1  0  1  0  0 -1  1 -1  1] (Indices: [0, 1, 4, 7, 8, 11, 14, 15, 16, 18]), Candidate: [2 0 1 1 0 1 2 0 0 1 1 0 1 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 36050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0 -1  0  0  0  1  0  0  0 -1  1 -1  1] (Indices: [0, 1, 4, 7, 8, 13, 14, 15, 16, 18]), Candidate: [2 0 1 1 0 1 2 0 0 1 0 1 2 1 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 36100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  1  0  0 -1  1 -1  0  1  0 -1  0  1] (Indices: [0, 1, 4, 7, 9, 10, 11, 13, 16, 17]), Candidate: [ 2  0  1  1  0  1  2 -1  2  1  0  0  2  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  1  0 -1  1 -1  1 -1  0  0  1  0  0] (Indices: [0, 1, 4, 7, 9, 10, 12, 14, 18, 19]), Candidate: [ 2  0  1  1  0  1  2 -1  2  1 -1  2  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 36200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  1 -1  1  0  0  0 -1  0  0  0  1  0] (Indices: [0, 1, 4, 7, 9, 11, 12, 13, 14, 19]), Candidate: [ 2  0  1  1  0  1  2 -1  2  0  1  1  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  1 -1  1 -1  1 -1  0  0  1  0  0  0] (Indices: [0, 1, 4, 7, 9, 11, 13, 17, 18, 19]), Candidate: [ 2  0  1  1  0  1  2 -1  2  0  1  0  2  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  1 -1  0  1 -1  0  0  1  0  0  0  0] (Indices: [0, 1, 4, 7, 9, 12, 16, 17, 18, 19]), Candidate: [ 2  0  1  1  0  1  2 -1  2  0  0  2  0  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  0  1  0  0 -1  0  1 -1  1  0 -1  1] (Indices: [0, 1, 4, 7, 10, 11, 12, 15, 17, 18]), Candidate: [ 2  0  1  1  0  1  2 -1  1  2  0  1  0  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  0  1 -1  1  0  0 -1  0  1 -1  1  0] (Indices: [0, 1, 4, 7, 10, 12, 13, 14, 17, 19]), Candidate: [ 2  0  1  1  0  1  2 -1  1  2 -1  2  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 36450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  0  0  1  0  0  0  0 -1  0  1 -1  1] (Indices: [0, 1, 4, 7, 11, 12, 13, 14, 15, 18]), Candidate: [ 2  0  1  1  0  1  2 -1  1  1  1  1  1  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  0  0  1 -1  0  1  0  0 -1  1  0  0] (Indices: [0, 1, 4, 7, 11, 14, 15, 16, 18, 19]), Candidate: [ 2  0  1  1  0  1  2 -1  1  1  1  0  1  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1  0  0  0  0 -1  0  0  0  1  0 -1  1] (Indices: [0, 1, 4, 8, 9, 10, 11, 12, 17, 18]), Candidate: [2 0 1 1 0 1 1 1 1 1 0 1 0 1 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 36600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1  0  0 -1  1  0 -1  0  0  1  0 -1  1] (Indices: [0, 1, 4, 8, 9, 10, 12, 13, 17, 18]), Candidate: [ 2  0  1  1  0  1  1  1  1  1 -1  2  1  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1  0  0 -1  0  0  1 -1  1  0 -1  1  0] (Indices: [0, 1, 4, 8, 9, 10, 14, 16, 17, 19]), Candidate: [ 2  0  1  1  0  1  1  1  1  1 -1  1  1  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1  0 -1  1 -1  1  0 -1  0  1  0 -1  1] (Indices: [0, 1, 4, 8, 9, 11, 13, 14, 17, 18]), Candidate: [ 2  0  1  1  0  1  1  1  1  0  1  0  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1  0 -1  0  1 -1  1  0  0 -1  0  1  0] (Indices: [0, 1, 4, 8, 9, 12, 14, 15, 16, 19]), Candidate: [2 0 1 1 0 1 1 1 1 0 0 2 0 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 36800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1 -1  1  0  0 -1  1  0 -1  1 -1  0  1] (Indices: [0, 1, 4, 8, 10, 11, 12, 14, 15, 17]), Candidate: [2 0 1 1 0 1 1 1 0 2 0 1 0 2 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 36850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1 -1  1  0 -1  0  0  1  0  0 -1  1  0] (Indices: [0, 1, 4, 8, 10, 11, 15, 16, 17, 19]), Candidate: [2 0 1 1 0 1 1 1 0 2 0 0 1 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 36900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1 -1  1 -1  0  1 -1  1  0  0 -1  1  0] (Indices: [0, 1, 4, 8, 10, 13, 15, 16, 17, 19]), Candidate: [ 2  0  1  1  0  1  1  1  0  2 -1  1  2  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1 -1  0  1 -1  1  0  0 -1  0  1  0  0] (Indices: [0, 1, 4, 8, 11, 13, 14, 15, 18, 19]), Candidate: [2 0 1 1 0 1 1 1 0 1 1 0 2 1 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 37000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  1  0  0  0  0 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 4, 9, 10, 11, 12, 13, 15, 17]), Candidate: [2 0 1 1 0 1 1 0 2 1 0 1 1 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 37050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  1  0  0 -1  0  1  0  0 -1  1 -1  1] (Indices: [0, 1, 4, 9, 10, 11, 14, 15, 16, 18]), Candidate: [2 0 1 1 0 1 1 0 2 1 0 0 1 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 37100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  1  0 -1  0  1  0  0  0 -1  1 -1  1] (Indices: [0, 1, 4, 9, 10, 13, 14, 15, 16, 18]), Candidate: [ 2  0  1  1  0  1  1  0  2  1 -1  1  2  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  1 -1  1  0 -1  0  1  0  0  0 -1  1] (Indices: [0, 1, 4, 9, 11, 12, 15, 16, 17, 18]), Candidate: [2 0 1 1 0 1 1 0 2 0 1 1 0 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 37200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  1 -1  0  0  1  0  0 -1  1  0  0  0] (Indices: [0, 1, 4, 9, 13, 14, 15, 17, 18, 19]), Candidate: [2 0 1 1 0 1 1 0 2 0 0 1 2 1 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 37250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  0  1  0 -1  1 -1  1  0  0 -1  1  0] (Indices: [0, 1, 4, 10, 11, 13, 15, 16, 17, 19]), Candidate: [2 0 1 1 0 1 1 0 1 2 0 0 2 0 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 37300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  0  0  1  0  0 -1  1  0 -1  1  0  0] (Indices: [0, 1, 4, 11, 12, 13, 15, 16, 18, 19]), Candidate: [2 0 1 1 0 1 1 0 1 1 1 1 1 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 37350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0  0  0 -1  0  0  0  1  0 -1  0  0  1] (Indices: [0, 1, 5, 6, 7, 8, 9, 10, 15, 16]), Candidate: [ 2  0  1  0  2  1  1  0  1  1 -1  1  1  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0  0 -1  0  1 -1  0  1 -1  1 -1  0  1] (Indices: [0, 1, 5, 6, 7, 8, 9, 12, 15, 17]), Candidate: [2 0 1 0 2 1 1 0 1 0 0 2 0 1 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 37450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0 -1  1  0  0 -1  0  0  0  0  0  1  0] (Indices: [0, 1, 5, 6, 7, 8, 10, 11, 12, 19]), Candidate: [2 0 1 0 2 1 1 0 0 2 0 1 0 1 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 37500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0 -1  1 -1  0  1 -1  1 -1  0  1 -1  1] (Indices: [0, 1, 5, 6, 7, 8, 10, 13, 15, 18]), Candidate: [ 2  0  1  0  2  1  1  0  0  2 -1  1  2  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0 -1  0  1 -1  1  0 -1  1 -1  0  0  1] (Indices: [0, 1, 5, 6, 7, 8, 11, 13, 14, 16]), Candidate: [ 2  0  1  0  2  1  1  0  0  1  1  0  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0 -1  0  0  1 -1  1  0 -1  1 -1  0  1] (Indices: [0, 1, 5, 6, 7, 8, 12, 14, 15, 17]), Candidate: [2 0 1 0 2 1 1 0 0 1 0 2 0 2 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 37650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0 -1  0  0  0  0  0  1  0  0 -1  1  0] (Indices: [0, 1, 5, 6, 7, 8, 15, 16, 17, 19]), Candidate: [2 0 1 0 2 1 1 0 0 1 0 1 1 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 37700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  1  0 -1  1 -1  0  0  0  1  0 -1  1] (Indices: [0, 1, 5, 6, 7, 9, 10, 12, 17, 18]), Candidate: [ 2  0  1  0  2  1  1 -1  2  1 -1  2  0  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  1 -1  1  0 -1  0  1 -1  1 -1  0  1] (Indices: [0, 1, 5, 6, 7, 9, 11, 12, 15, 17]), Candidate: [ 2  0  1  0  2  1  1 -1  2  0  1  1  0  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  1 -1  0  1  0 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 5, 6, 7, 9, 12, 13, 15, 17]), Candidate: [ 2  0  1  0  2  1  1 -1  2  0  0  2  1  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  1 -1  0  0  0  1  0  0 -1  1 -1  1] (Indices: [0, 1, 5, 6, 7, 9, 14, 15, 16, 18]), Candidate: [ 2  0  1  0  2  1  1 -1  2  0  0  1  1  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  0  1  0 -1  0  1  0  0 -1  0  0  1] (Indices: [0, 1, 5, 6, 7, 10, 11, 14, 15, 16]), Candidate: [ 2  0  1  0  2  1  1 -1  1  2  0  0  1  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  0  1 -1  1 -1  0  1 -1  0  1  0  0] (Indices: [0, 1, 5, 6, 7, 10, 12, 15, 18, 19]), Candidate: [ 2  0  1  0  2  1  1 -1  1  2 -1  2  0  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  0  0  1  0  0 -1  0  1 -1  1 -1  1] (Indices: [0, 1, 5, 6, 7, 11, 12, 13, 16, 18]), Candidate: [ 2  0  1  0  2  1  1 -1  1  1  1  1  1  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  0  0  1 -1  0  1  0 -1  0  1  0  0] (Indices: [0, 1, 5, 6, 7, 11, 14, 15, 18, 19]), Candidate: [ 2  0  1  0  2  1  1 -1  1  1  1  0  1  2  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  0  0  0  0  1  0  0 -1  0  1  0  0] (Indices: [0, 1, 5, 6, 7, 13, 14, 15, 18, 19]), Candidate: [ 2  0  1  0  2  1  1 -1  1  1  0  1  2  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1  0  0 -1  1 -1  1  0 -1  0  0  0  1] (Indices: [0, 1, 5, 6, 8, 9, 10, 12, 14, 15]), Candidate: [ 2  0  1  0  2  1  0  1  1  1 -1  2  0  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1  0 -1  1  0  0  0 -1  0  0  0  0  1] (Indices: [0, 1, 5, 6, 8, 9, 11, 12, 13, 14]), Candidate: [ 2  0  1  0  2  1  0  1  1  0  1  1  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1  0 -1  1 -1  0  0  1 -1  1 -1  1  0] (Indices: [0, 1, 5, 6, 8, 9, 11, 15, 17, 19]), Candidate: [2 0 1 0 2 1 0 1 1 0 1 0 1 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 38300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1  0 -1  0  0  1  0 -1  0  0  1  0  0] (Indices: [0, 1, 5, 6, 8, 9, 13, 14, 18, 19]), Candidate: [ 2  0  1  0  2  1  0  1  1  0  0  1  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1 -1  1  0 -1  1  0 -1  0  0  1 -1  1] (Indices: [0, 1, 5, 6, 8, 10, 11, 13, 14, 18]), Candidate: [ 2  0  1  0  2  1  0  1  0  2  0  0  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1 -1  1 -1  1 -1  1  0 -1  0  0  1  0] (Indices: [0, 1, 5, 6, 8, 10, 12, 14, 15, 19]), Candidate: [ 2  0  1  0  2  1  0  1  0  2 -1  2  0  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1 -1  1 -1  0  0  0  1 -1  1  0  0  0] (Indices: [0, 1, 5, 6, 8, 10, 15, 17, 18, 19]), Candidate: [ 2  0  1  0  2  1  0  1  0  2 -1  1  1  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1 -1  0  1 -1  1 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 5, 6, 8, 11, 13, 15, 17, 18]), Candidate: [2 0 1 0 2 1 0 1 0 1 1 0 2 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 38550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1 -1  0  0  1 -1  1 -1  1 -1  1  0  0] (Indices: [0, 1, 5, 6, 8, 12, 14, 16, 18, 19]), Candidate: [ 2  0  1  0  2  1  0  1  0  1  0  2  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  1  0  0 -1  1  0 -1  1 -1  0  0  1] (Indices: [0, 1, 5, 6, 9, 10, 11, 13, 14, 16]), Candidate: [ 2  0  1  0  2  1  0  0  2  1  0  0  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  1  0 -1  1 -1  1  0 -1  1 -1  0  1] (Indices: [0, 1, 5, 6, 9, 10, 12, 14, 15, 17]), Candidate: [ 2  0  1  0  2  1  0  0  2  1 -1  2  0  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  1  0 -1  0  0  0  1  0  0 -1  1  0] (Indices: [0, 1, 5, 6, 9, 10, 15, 16, 17, 19]), Candidate: [ 2  0  1  0  2  1  0  0  2  1 -1  1  1  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  1 -1  1 -1  1 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 5, 6, 9, 11, 13, 15, 16, 18]), Candidate: [2 0 1 0 2 1 0 0 2 0 1 0 2 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 38800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  1 -1  0  1 -1  1 -1  1  0  0 -1  1] (Indices: [0, 1, 5, 6, 9, 12, 14, 16, 17, 18]), Candidate: [ 2  0  1  0  2  1  0  0  2  0  0  2  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  0  1  0  0 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 5, 6, 10, 11, 12, 14, 16, 18]), Candidate: [ 2  0  1  0  2  1  0  0  1  2  0  1  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  0  1 -1  1  0  0  0  0 -1  0  0  1] (Indices: [0, 1, 5, 6, 10, 12, 13, 14, 15, 16]), Candidate: [ 2  0  1  0  2  1  0  0  1  2 -1  2  1  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  0  1 -1  0  0  1  0  0  0  0 -1  1] (Indices: [0, 1, 5, 6, 10, 14, 15, 16, 17, 18]), Candidate: [ 2  0  1  0  2  1  0  0  1  2 -1  1  1  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  0  0  1 -1  1  0 -1  0  1  0  0  0] (Indices: [0, 1, 5, 6, 11, 13, 14, 17, 18, 19]), Candidate: [ 2  0  1  0  2  1  0  0  1  1  1  0  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0  0  0  0 -1  1 -1  0  0  1 -1  0  1] (Indices: [0, 1, 5, 7, 8, 9, 10, 11, 13, 17]), Candidate: [2 0 1 0 2 0 2 0 1 1 0 0 2 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 39100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0  0  0 -1  0  1 -1  0  1 -1  0  1  0] (Indices: [0, 1, 5, 7, 8, 9, 10, 13, 16, 19]), Candidate: [ 2  0  1  0  2  0  2  0  1  1 -1  1  2  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0  0 -1  1 -1  1 -1  1  0 -1  0  0  1] (Indices: [0, 1, 5, 7, 8, 9, 11, 13, 15, 16]), Candidate: [2 0 1 0 2 0 2 0 1 0 1 0 2 0 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 39200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0  0 -1  0  1 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 5, 7, 8, 9, 12, 14, 16, 18]), Candidate: [ 2  0  1  0  2  0  2  0  1  0  0  2  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0 -1  1  0  0  0  0 -1  0  0  0  0  1] (Indices: [0, 1, 5, 7, 8, 10, 11, 12, 13, 14]), Candidate: [ 2  0  1  0  2  0  2  0  0  2  0  1  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0 -1  1  0 -1  0  0  1 -1  1 -1  1  0] (Indices: [0, 1, 5, 7, 8, 10, 11, 15, 17, 19]), Candidate: [2 0 1 0 2 0 2 0 0 2 0 0 1 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 39350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0 -1  1 -1  0  1  0 -1  0  0  1  0  0] (Indices: [0, 1, 5, 7, 8, 10, 13, 14, 18, 19]), Candidate: [ 2  0  1  0  2  0  2  0  0  2 -1  1  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0 -1  0  1  0 -1  1 -1  0  0  1  0  0] (Indices: [0, 1, 5, 7, 8, 11, 12, 14, 18, 19]), Candidate: [ 2  0  1  0  2  0  2  0  0  1  1  1  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0 -1  0  0  1  0  0 -1  1  0 -1  0  1] (Indices: [0, 1, 5, 7, 8, 12, 13, 14, 16, 17]), Candidate: [ 2  0  1  0  2  0  2  0  0  1  0  2  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0 -1  0  0  0  0  1 -1  1  0  0  0  0] (Indices: [0, 1, 5, 7, 8, 14, 16, 17, 18, 19]), Candidate: [ 2  0  1  0  2  0  2  0  0  1  0  1  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  1  0  0 -1  0  0  1  0 -1  0  1  0] (Indices: [0, 1, 5, 7, 9, 10, 11, 15, 16, 19]), Candidate: [ 2  0  1  0  2  0  2 -1  2  1  0  0  1  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  1  0 -1  0  1  0 -1  0  1  0 -1  1] (Indices: [0, 1, 5, 7, 9, 10, 13, 14, 17, 18]), Candidate: [ 2  0  1  0  2  0  2 -1  2  1 -1  1  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 39650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  1 -1  1  0 -1  1 -1  0  1  0 -1  1] (Indices: [0, 1, 5, 7, 9, 11, 12, 14, 17, 18]), Candidate: [ 2  0  1  0  2  0  2 -1  2  0  1  1  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  1 -1  0  1  0  0  0 -1  0  1 -1  1] (Indices: [0, 1, 5, 7, 9, 12, 13, 14, 15, 18]), Candidate: [ 2  0  1  0  2  0  2 -1  2  0  0  2  1  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  1 -1  0  0  0  1  0  0 -1  1  0  0] (Indices: [0, 1, 5, 7, 9, 14, 15, 16, 18, 19]), Candidate: [ 2  0  1  0  2  0  2 -1  2  0  0  1  1  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  0  1  0 -1  1 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 5, 7, 10, 11, 13, 15, 16, 18]), Candidate: [ 2  0  1  0  2  0  2 -1  1  2  0  0  2  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  0  1 -1  1 -1  1 -1  1  0  0 -1  1] (Indices: [0, 1, 5, 7, 10, 12, 14, 16, 17, 18]), Candidate: [ 2  0  1  0  2  0  2 -1  1  2 -1  2  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 39900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  0  0  1  0 -1  1  0  0  0 -1  0  1] (Indices: [0, 1, 5, 7, 11, 12, 14, 15, 16, 17]), Candidate: [ 2  0  1  0  2  0  2 -1  1  1  1  1  0  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  0  0  0  1  0 -1  0  1  0  0  0  0] (Indices: [0, 1, 5, 7, 12, 13, 16, 17, 18, 19]), Candidate: [ 2  0  1  0  2  0  2 -1  1  1  0  2  1  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1  0  0  0 -1  0  1  0  0 -1  0  0  1] (Indices: [0, 1, 5, 8, 9, 10, 11, 14, 15, 16]), Candidate: [2 0 1 0 2 0 1 1 1 1 0 0 1 2 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 40050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1  0  0 -1  1 -1  0  1 -1  0  1  0  0] (Indices: [0, 1, 5, 8, 9, 10, 12, 15, 18, 19]), Candidate: [ 2  0  1  0  2  0  1  1  1  1 -1  2  0  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1  0 -1  1  0  0 -1  0  1 -1  1 -1  1] (Indices: [0, 1, 5, 8, 9, 11, 12, 13, 16, 18]), Candidate: [2 0 1 0 2 0 1 1 1 0 1 1 1 0 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 40150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1  0 -1  1 -1  0  1  0 -1  0  1  0  0] (Indices: [0, 1, 5, 8, 9, 11, 14, 15, 18, 19]), Candidate: [2 0 1 0 2 0 1 1 1 0 1 0 1 2 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 40200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1  0 -1  0  0  1  0  0 -1  0  1  0  0] (Indices: [0, 1, 5, 8, 9, 13, 14, 15, 18, 19]), Candidate: [2 0 1 0 2 0 1 1 1 0 0 1 2 1 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 40250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1 -1  1  0  0 -1  0  0  0  1  0  0  0] (Indices: [0, 1, 5, 8, 10, 11, 12, 17, 18, 19]), Candidate: [2 0 1 0 2 0 1 1 0 2 0 1 0 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 40300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1 -1  1 -1  1  0 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 5, 8, 10, 12, 13, 15, 17, 19]), Candidate: [ 2  0  1  0  2  0  1  1  0  2 -1  2  1  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1 -1  0  1  0  0  0 -1  0  1 -1  1  0] (Indices: [0, 1, 5, 8, 11, 12, 13, 14, 17, 19]), Candidate: [ 2  0  1  0  2  0  1  1  0  1  1  1  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1 -1  0  0  1  0  0  0  0 -1  0  1  0] (Indices: [0, 1, 5, 8, 12, 13, 14, 15, 16, 19]), Candidate: [2 0 1 0 2 0 1 1 0 1 0 2 1 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 40450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  1  0  0  0 -1  1 -1  0  0  1  0  0] (Indices: [0, 1, 5, 9, 10, 11, 12, 14, 18, 19]), Candidate: [ 2  0  1  0  2  0  1  0  2  1  0  1  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  1  0 -1  1  0  0 -1  1  0 -1  0  1] (Indices: [0, 1, 5, 9, 10, 12, 13, 14, 16, 17]), Candidate: [ 2  0  1  0  2  0  1  0  2  1 -1  2  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 40550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  1  0 -1  0  0  1 -1  1  0  0  0  0] (Indices: [0, 1, 5, 9, 10, 14, 16, 17, 18, 19]), Candidate: [ 2  0  1  0  2  0  1  0  2  1 -1  1  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 40600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  1 -1  1 -1  1 -1  1 -1  1  0  0  0] (Indices: [0, 1, 5, 9, 11, 13, 15, 17, 18, 19]), Candidate: [2 0 1 0 2 0 1 0 2 0 1 0 2 0 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 40650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  0  1  0  0  0 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 5, 10, 11, 12, 13, 15, 17, 19]), Candidate: [2 0 1 0 2 0 1 0 1 2 0 1 1 0 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 40700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  0  1 -1  1  0  0 -1  1 -1  1  0  0] (Indices: [0, 1, 5, 10, 12, 13, 14, 16, 18, 19]), Candidate: [ 2  0  1  0  2  0  1  0  1  2 -1  2  1  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 40750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  0  0  0  1  0  0  0  0 -1  1  0  0] (Indices: [0, 1, 5, 12, 13, 14, 15, 16, 18, 19]), Candidate: [2 0 1 0 2 0 1 0 1 1 0 2 1 1 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 40800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0  0  0 -1  1 -1  0  0  1 -1  1 -1  1] (Indices: [0, 1, 6, 7, 8, 9, 10, 12, 16, 18]), Candidate: [ 2  0  1  0  1  2  1  0  1  1 -1  2  0  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0  0 -1  1  0 -1  1 -1  0  0  0  1  0] (Indices: [0, 1, 6, 7, 8, 9, 11, 12, 14, 19]), Candidate: [ 2  0  1  0  1  2  1  0  1  0  1  1  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0  0 -1  0  1  0  0 -1  0  0  0  1  0] (Indices: [0, 1, 6, 7, 8, 9, 12, 13, 14, 19]), Candidate: [ 2  0  1  0  1  2  1  0  1  0  0  2  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0  0 -1  0  0  1 -1  0  0  1  0  0  0] (Indices: [0, 1, 6, 7, 8, 9, 13, 17, 18, 19]), Candidate: [2 0 1 0 1 2 1 0 1 0 0 1 2 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 41000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0 -1  1  0 -1  1 -1  0  0  1 -1  1  0] (Indices: [0, 1, 6, 7, 8, 10, 11, 13, 17, 19]), Candidate: [2 0 1 0 1 2 1 0 0 2 0 0 2 0 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 41050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0 -1  1 -1  1 -1  0  1 -1  1  0 -1  1] (Indices: [0, 1, 6, 7, 8, 10, 12, 15, 17, 18]), Candidate: [ 2  0  1  0  1  2  1  0  0  2 -1  2  0  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0 -1  0  1  0  0 -1  1 -1  0  0  1  0] (Indices: [0, 1, 6, 7, 8, 11, 12, 13, 15, 19]), Candidate: [2 0 1 0 1 2 1 0 0 1 1 1 1 0 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 41150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0 -1  0  1 -1  0  1  0 -1  1  0 -1  1] (Indices: [0, 1, 6, 7, 8, 11, 14, 15, 17, 18]), Candidate: [2 0 1 0 1 2 1 0 0 1 1 0 1 2 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 41200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0 -1  0  0  0  1  0  0 -1  1  0 -1  1] (Indices: [0, 1, 6, 7, 8, 13, 14, 15, 17, 18]), Candidate: [2 0 1 0 1 2 1 0 0 1 0 1 2 1 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 41250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  1  0  0 -1  1 -1  0  1 -1  0  1  0] (Indices: [0, 1, 6, 7, 9, 10, 11, 13, 16, 19]), Candidate: [ 2  0  1  0  1  2  1 -1  2  1  0  0  2  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  1  0 -1  1 -1  0  1  0 -1  1 -1  1] (Indices: [0, 1, 6, 7, 9, 10, 12, 15, 16, 18]), Candidate: [ 2  0  1  0  1  2  1 -1  2  1 -1  2  0  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 41350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  1 -1  1  0  0 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 6, 7, 9, 11, 12, 13, 15, 17]), Candidate: [ 2  0  1  0  1  2  1 -1  2  0  1  1  1  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  1 -1  1 -1  0  1  0  0 -1  1 -1  1] (Indices: [0, 1, 6, 7, 9, 11, 14, 15, 16, 18]), Candidate: [ 2  0  1  0  1  2  1 -1  2  0  1  0  1  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  1 -1  0  0  1  0  0  0 -1  1 -1  1] (Indices: [0, 1, 6, 7, 9, 13, 14, 15, 16, 18]), Candidate: [ 2  0  1  0  1  2  1 -1  2  0  0  1  2  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  0  1  0  0 -1  0  1 -1  0  1  0  0] (Indices: [0, 1, 6, 7, 10, 11, 12, 15, 18, 19]), Candidate: [ 2  0  1  0  1  2  1 -1  1  2  0  1  0  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  0  1 -1  1  0 -1  1  0  0 -1  0  1] (Indices: [0, 1, 6, 7, 10, 12, 13, 15, 16, 17]), Candidate: [ 2  0  1  0  1  2  1 -1  1  2 -1  2  1  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 41600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  0  0  1  0  0  0 -1  1  0 -1  0  1] (Indices: [0, 1, 6, 7, 11, 12, 13, 14, 16, 17]), Candidate: [ 2  0  1  0  1  2  1 -1  1  1  1  1  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 41650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  0  0  1 -1  0  1 -1  1  0  0  0  0] (Indices: [0, 1, 6, 7, 11, 14, 16, 17, 18, 19]), Candidate: [ 2  0  1  0  1  2  1 -1  1  1  1  0  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 41700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1  0  0  0  0 -1  0  0  0  0  1  0  0] (Indices: [0, 1, 6, 8, 9, 10, 11, 12, 18, 19]), Candidate: [2 0 1 0 1 2 0 1 1 1 0 1 0 1 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 41750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1  0  0 -1  1  0 -1  0  0  0  1  0  0] (Indices: [0, 1, 6, 8, 9, 10, 12, 13, 18, 19]), Candidate: [ 2  0  1  0  1  2  0  1  1  1 -1  2  1  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1  0  0 -1  0  0  1 -1  0  1  0  0  0] (Indices: [0, 1, 6, 8, 9, 10, 14, 17, 18, 19]), Candidate: [ 2  0  1  0  1  2  0  1  1  1 -1  1  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 41850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1  0 -1  1 -1  1  0 -1  0  0  1  0  0] (Indices: [0, 1, 6, 8, 9, 11, 13, 14, 18, 19]), Candidate: [ 2  0  1  0  1  2  0  1  1  0  1  0  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1  0 -1  0  1 -1  1  0 -1  1 -1  1  0] (Indices: [0, 1, 6, 8, 9, 12, 14, 15, 17, 19]), Candidate: [2 0 1 0 1 2 0 1 1 0 0 2 0 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 41950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1 -1  1  0  0 -1  1  0 -1  0  0  1  0] (Indices: [0, 1, 6, 8, 10, 11, 12, 14, 15, 19]), Candidate: [2 0 1 0 1 2 0 1 0 2 0 1 0 2 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 42000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1 -1  1  0 -1  0  0  1 -1  1  0  0  0] (Indices: [0, 1, 6, 8, 10, 11, 15, 17, 18, 19]), Candidate: [2 0 1 0 1 2 0 1 0 2 0 0 1 1 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 42050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1 -1  1 -1  0  1 -1  1 -1  1  0  0  0] (Indices: [0, 1, 6, 8, 10, 13, 15, 17, 18, 19]), Candidate: [ 2  0  1  0  1  2  0  1  0  2 -1  1  2  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1 -1  0  1 -1  1  0 -1  1  0 -1  1  0] (Indices: [0, 1, 6, 8, 11, 13, 14, 16, 17, 19]), Candidate: [ 2  0  1  0  1  2  0  1  0  1  1  0  2  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  1  0  0  0  0 -1  1 -1  0  0  1  0] (Indices: [0, 1, 6, 9, 10, 11, 12, 13, 15, 19]), Candidate: [2 0 1 0 1 2 0 0 2 1 0 1 1 0 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 42200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  1  0  0 -1  0  1  0 -1  1  0 -1  1] (Indices: [0, 1, 6, 9, 10, 11, 14, 15, 17, 18]), Candidate: [2 0 1 0 1 2 0 0 2 1 0 0 1 2 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 42250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  1  0 -1  0  1  0  0 -1  1  0 -1  1] (Indices: [0, 1, 6, 9, 10, 13, 14, 15, 17, 18]), Candidate: [ 2  0  1  0  1  2  0  0  2  1 -1  1  2  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  1 -1  1  0 -1  0  1  0 -1  1  0  0] (Indices: [0, 1, 6, 9, 11, 12, 15, 16, 18, 19]), Candidate: [2 0 1 0 1 2 0 0 2 0 1 1 0 1 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 42350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  1 -1  0  0  1 -1  1  0  0  0  0  0] (Indices: [0, 1, 6, 9, 13, 15, 16, 17, 18, 19]), Candidate: [2 0 1 0 1 2 0 0 2 0 0 1 2 0 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 42400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  0  1  0 -1  1 -1  1 -1  1  0  0  0] (Indices: [0, 1, 6, 10, 11, 13, 15, 17, 18, 19]), Candidate: [2 0 1 0 1 2 0 0 1 2 0 0 2 0 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 42450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  0  0  1  0  0 -1  0  1  0  0  0  0] (Indices: [0, 1, 6, 11, 12, 13, 16, 17, 18, 19]), Candidate: [2 0 1 0 1 2 0 0 1 1 1 1 1 0 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 42500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0  0  0  0 -1  1 -1  1 -1  0  1 -1  1] (Indices: [0, 1, 7, 8, 9, 10, 11, 13, 15, 18]), Candidate: [2 0 1 0 1 1 2 0 1 1 0 0 2 0 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 42550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0  0  0 -1  1 -1  1 -1  0  1  0 -1  1] (Indices: [0, 1, 7, 8, 9, 10, 12, 14, 17, 18]), Candidate: [ 2  0  1  0  1  1  2  0  1  1 -1  2  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 42600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0  0 -1  1  0  0  0 -1  0  1 -1  0  1] (Indices: [0, 1, 7, 8, 9, 11, 12, 13, 14, 17]), Candidate: [ 2  0  1  0  1  1  2  0  1  0  1  1  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0  0 -1  1 -1  1 -1  0  1  0 -1  1  0] (Indices: [0, 1, 7, 8, 9, 11, 13, 16, 17, 19]), Candidate: [2 0 1 0 1 1 2 0 1 0 1 0 2 0 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 42700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0  0 -1  0  1 -1  0  1  0 -1  1  0  0] (Indices: [0, 1, 7, 8, 9, 12, 15, 16, 18, 19]), Candidate: [2 0 1 0 1 1 2 0 1 0 0 2 0 1 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 42750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0 -1  1  0  0 -1  0  1  0 -1  1 -1  1] (Indices: [0, 1, 7, 8, 10, 11, 12, 15, 16, 18]), Candidate: [2 0 1 0 1 1 2 0 0 2 0 1 0 1 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 42800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0 -1  1 -1  1  0  0 -1  1 -1  0  1  0] (Indices: [0, 1, 7, 8, 10, 12, 13, 14, 16, 19]), Candidate: [ 2  0  1  0  1  1  2  0  0  2 -1  2  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 42850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0 -1  0  1  0  0  0  0  0 -1  0  0  1] (Indices: [0, 1, 7, 8, 11, 12, 13, 14, 15, 16]), Candidate: [2 0 1 0 1 1 2 0 0 1 1 1 1 1 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 42900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0 -1  0  1 -1  0  1  0  0  0  0 -1  1] (Indices: [0, 1, 7, 8, 11, 14, 15, 16, 17, 18]), Candidate: [2 0 1 0 1 1 2 0 0 1 1 0 1 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 42950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  1  0  0  0 -1  1  0 -1  1 -1  0  1] (Indices: [0, 1, 7, 9, 10, 11, 12, 14, 15, 17]), Candidate: [ 2  0  1  0  1  1  2 -1  2  1  0  1  0  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  1  0  0 -1  0  0  1  0  0 -1  1  0] (Indices: [0, 1, 7, 9, 10, 11, 15, 16, 17, 19]), Candidate: [ 2  0  1  0  1  1  2 -1  2  1  0  0  1  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  1  0 -1  0  1 -1  1  0  0 -1  1  0] (Indices: [0, 1, 7, 9, 10, 13, 15, 16, 17, 19]), Candidate: [ 2  0  1  0  1  1  2 -1  2  1 -1  1  2  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 43100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  1 -1  1 -1  1  0  0 -1  0  1  0  0] (Indices: [0, 1, 7, 9, 11, 13, 14, 15, 18, 19]), Candidate: [ 2  0  1  0  1  1  2 -1  2  0  1  0  2  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  0  1  0  0  0  0 -1  1 -1  0  1  0] (Indices: [0, 1, 7, 10, 11, 12, 13, 14, 16, 19]), Candidate: [ 2  0  1  0  1  1  2 -1  1  2  0  1  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 43200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  0  1 -1  1  0  0  0  0  0 -1  0  1] (Indices: [0, 1, 7, 10, 12, 13, 14, 15, 16, 17]), Candidate: [ 2  0  1  0  1  1  2 -1  1  2 -1  2  1  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 43250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  0  0  1 -1  1  0  0  0  0 -1  1  0] (Indices: [0, 1, 7, 11, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  0  1  0  1  1  2 -1  1  1  1  0  2  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1  0  0  0 -1  1  0  0 -1  1 -1  0  1] (Indices: [0, 1, 8, 9, 10, 11, 13, 14, 15, 17]), Candidate: [2 0 1 0 1 1 1 1 1 1 0 0 2 1 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 43350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1  0  0 -1  1  0 -1  0  1  0  0 -1  1] (Indices: [0, 1, 8, 9, 10, 12, 13, 16, 17, 18]), Candidate: [ 2  0  1  0  1  1  1  1  1  1 -1  2  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1  0 -1  1  0  0 -1  1  0  0 -1  0  1] (Indices: [0, 1, 8, 9, 11, 12, 13, 15, 16, 17]), Candidate: [2 0 1 0 1 1 1 1 1 0 1 1 1 0 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 43450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1  0 -1  0  1  0  0  0 -1  1 -1  1  0] (Indices: [0, 1, 8, 9, 12, 13, 14, 15, 17, 19]), Candidate: [2 0 1 0 1 1 1 1 1 0 0 2 1 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 43500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1 -1  1  0  0 -1  1 -1  1  0  0 -1  1] (Indices: [0, 1, 8, 10, 11, 12, 14, 16, 17, 18]), Candidate: [ 2  0  1  0  1  1  1  1  0  2  0  1  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1 -1  1 -1  1 -1  0  1  0  0  0  0  0] (Indices: [0, 1, 8, 10, 12, 15, 16, 17, 18, 19]), Candidate: [ 2  0  1  0  1  1  1  1  0  2 -1  2  0  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  1  0  0  0  0  0 -1  1 -1  0  1  0] (Indices: [0, 1, 9, 10, 11, 12, 13, 14, 16, 19]), Candidate: [ 2  0  1  0  1  1  1  0  2  1  0  1  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  1  0 -1  1  0  0  0  0  0 -1  0  1] (Indices: [0, 1, 9, 10, 12, 13, 14, 15, 16, 17]), Candidate: [ 2  0  1  0  1  1  1  0  2  1 -1  2  1  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  1 -1  1 -1  1  0  0  0  0 -1  1  0] (Indices: [0, 1, 9, 11, 13, 14, 15, 16, 17, 19]), Candidate: [2 0 1 0 1 1 1 0 2 0 1 0 2 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 43750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 -1  1] (Indices: [0, 1, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [2 0 1 0 1 1 1 0 1 1 1 1 1 1 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 43800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0 -1  0  0  0  0  1 -1  1 -1  0  0  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 14, 16]), Candidate: [ 1  2  1  0  1  1  1  0  0  1  0  1  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  1 -1  0  0  0  0  1 -1  1 -1  0  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 9, 15, 17]), Candidate: [ 1  2  1  0  1  1  1 -1  2  0  0  1  1  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  0  0  1  0 -1  0  0  0  0  1 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 11, 12, 18]), Candidate: [ 1  2  1  0  1  1  1 -1  1  1  1  1  0  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  0  0  0  0  1 -1  1 -1  1 -1  0  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 13, 15, 17]), Candidate: [ 1  2  1  0  1  1  1 -1  1  1  0  1  2  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1  0 -1  0  1 -1  0  0  0  1 -1  0  1] (Indices: [0, 2, 3, 4, 5, 6, 8, 9, 12, 17]), Candidate: [1 2 1 0 1 1 0 1 1 0 0 2 0 1 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 44050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1 -1  1 -1  0  0  0  1  0 -1  0  0  1] (Indices: [0, 2, 3, 4, 5, 6, 8, 10, 15, 16]), Candidate: [ 1  2  1  0  1  1  0  1  0  2 -1  1  1  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1 -1  0  0  1 -1  0  1 -1  1 -1  0  1] (Indices: [0, 2, 3, 4, 5, 6, 8, 12, 15, 17]), Candidate: [1 2 1 0 1 1 0 1 0 1 0 2 0 1 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 44150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  1  0  0 -1  0  0  0  0  0  1 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 9, 10, 11, 18]), Candidate: [1 2 1 0 1 1 0 0 2 1 0 0 1 1 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 44200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  1 -1  1 -1  0  0  1 -1  0  1 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 9, 11, 15, 18]), Candidate: [1 2 1 0 1 1 0 0 2 0 1 0 1 1 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 44250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  1 -1  0  0  0  1 -1  1 -1  0  1  0] (Indices: [0, 2, 3, 4, 5, 6, 9, 14, 16, 19]), Candidate: [ 1  2  1  0  1  1  0  0  2  0  0  1  1  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  0  1 -1  1 -1  1 -1  0  1 -1  0  1] (Indices: [0, 2, 3, 4, 5, 6, 10, 12, 14, 17]), Candidate: [ 1  2  1  0  1  1  0  0  1  2 -1  2  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 44350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  0  0  1  0  0 -1  0  1 -1  0  0  1] (Indices: [0, 2, 3, 4, 5, 6, 11, 12, 13, 16]), Candidate: [1 2 1 0 1 1 0 0 1 1 1 1 1 0 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 44400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  0  0  1 -1  0  0  0  1  0  0 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 11, 16, 17, 18]), Candidate: [1 2 1 0 1 1 0 0 1 1 1 0 1 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 44450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  0  0  0  0  1 -1  1  0 -1  1 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 13, 15, 16, 18]), Candidate: [1 2 1 0 1 1 0 0 1 1 0 1 2 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 44500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0  0 -1  0  0  1 -1  0  1 -1  0  0  1] (Indices: [0, 2, 3, 4, 5, 7, 8, 9, 13, 16]), Candidate: [1 2 1 0 1 0 2 0 1 0 0 1 2 0 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 44550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0 -1  1 -1  0  0  0  0  1 -1  1 -1  1] (Indices: [0, 2, 3, 4, 5, 7, 8, 10, 16, 18]), Candidate: [ 1  2  1  0  1  0  2  0  0  2 -1  1  1  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0 -1  0  0  1 -1  0  0  1 -1  0  1  0] (Indices: [0, 2, 3, 4, 5, 7, 8, 12, 16, 19]), Candidate: [1 2 1 0 1 0 2 0 0 1 0 2 0 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 44650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  1  0 -1  1 -1  0  0  1 -1  0  0  1] (Indices: [0, 2, 3, 4, 5, 7, 9, 10, 12, 16]), Candidate: [ 1  2  1  0  1  0  2 -1  2  1 -1  2  0  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 44700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  1 -1  1 -1  0  0  0  0  1  0 -1  1] (Indices: [0, 2, 3, 4, 5, 7, 9, 11, 17, 18]), Candidate: [ 1  2  1  0  1  0  2 -1  2  0  1  0  1  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  1 -1  0  0  0  0  1  0 -1  1 -1  1] (Indices: [0, 2, 3, 4, 5, 7, 9, 15, 16, 18]), Candidate: [ 1  2  1  0  1  0  2 -1  2  0  0  1  1  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  0  1 -1  1 -1  0  1 -1  0  1 -1  1] (Indices: [0, 2, 3, 4, 5, 7, 10, 12, 15, 18]), Candidate: [ 1  2  1  0  1  0  2 -1  1  2 -1  2  0  1  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 44850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  0  0  1  0 -1  1 -1  1 -1  0  0  1] (Indices: [0, 2, 3, 4, 5, 7, 11, 12, 14, 16]), Candidate: [ 1  2  1  0  1  0  2 -1  1  1  1  1  0  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 44900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  0  0  0  1  0  0 -1  1 -1  0  0  1] (Indices: [0, 2, 3, 4, 5, 7, 12, 13, 14, 16]), Candidate: [ 1  2  1  0  1  0  2 -1  1  1  0  2  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 44950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  0  0  0  0  1 -1  0  1  0  0 -1  1] (Indices: [0, 2, 3, 4, 5, 7, 13, 16, 17, 18]), Candidate: [ 1  2  1  0  1  0  2 -1  1  1  0  1  2  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1  0  0 -1  0  0  0  0  1 -1  1 -1  1] (Indices: [0, 2, 3, 4, 5, 8, 9, 10, 16, 18]), Candidate: [ 1  2  1  0  1  0  1  1  1  1 -1  1  1  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1  0 -1  0  1 -1  0  0  1 -1  0  1  0] (Indices: [0, 2, 3, 4, 5, 8, 9, 12, 16, 19]), Candidate: [1 2 1 0 1 0 1 1 1 0 0 2 0 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 45100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1 -1  1  0 -1  1 -1  0  0  0  1 -1  1] (Indices: [0, 2, 3, 4, 5, 8, 10, 11, 13, 18]), Candidate: [1 2 1 0 1 0 1 1 0 2 0 0 2 0 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 45150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1 -1  1 -1  0  1 -1  0  0  1  0 -1  1] (Indices: [0, 2, 3, 4, 5, 8, 10, 13, 17, 18]), Candidate: [ 1  2  1  0  1  0  1  1  0  2 -1  1  2  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1 -1  0  1 -1  1 -1  1 -1  1 -1  0  1] (Indices: [0, 2, 3, 4, 5, 8, 11, 13, 15, 17]), Candidate: [1 2 1 0 1 0 1 1 0 1 1 0 2 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 45250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1 -1  0  0  1 -1  1 -1  1 -1  0  1  0] (Indices: [0, 2, 3, 4, 5, 8, 12, 14, 16, 19]), Candidate: [ 1  2  1  0  1  0  1  1  0  1  0  2  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  1  0  0  0 -1  1 -1  0  0  0  0  1] (Indices: [0, 2, 3, 4, 5, 9, 10, 11, 12, 14]), Candidate: [ 1  2  1  0  1  0  1  0  2  1  0  1  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  1  0 -1  0  1  0 -1  0  1 -1  0  1] (Indices: [0, 2, 3, 4, 5, 9, 10, 13, 14, 17]), Candidate: [ 1  2  1  0  1  0  1  0  2  1 -1  1  2  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 45400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  1 -1  1  0 -1  0  0  1 -1  0  1  0] (Indices: [0, 2, 3, 4, 5, 9, 11, 12, 16, 19]), Candidate: [1 2 1 0 1 0 1 0 2 0 1 1 0 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 45450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  1 -1  0  1  0 -1  0  1 -1  0  1  0] (Indices: [0, 2, 3, 4, 5, 9, 12, 13, 16, 19]), Candidate: [1 2 1 0 1 0 1 0 2 0 0 2 1 0 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 45500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  1 -1  0  0  0  1 -1  1  0  0 -1  1] (Indices: [0, 2, 3, 4, 5, 9, 14, 16, 17, 18]), Candidate: [ 1  2  1  0  1  0  1  0  2  0  0  1  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  0  1  0 -1  0  1 -1  1 -1  1 -1  1] (Indices: [0, 2, 3, 4, 5, 10, 11, 14, 16, 18]), Candidate: [ 1  2  1  0  1  0  1  0  1  2  0  0  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  0  1 -1  0  1  0  0  0 -1  0  0  1] (Indices: [0, 2, 3, 4, 5, 10, 13, 14, 15, 16]), Candidate: [ 1  2  1  0  1  0  1  0  1  2 -1  1  2  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  0  0  1  0 -1  1  0  0 -1  0  0  1] (Indices: [0, 2, 3, 4, 5, 11, 12, 14, 15, 16]), Candidate: [1 2 1 0 1 0 1 0 1 1 1 1 0 2 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 45700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  0  0  1 -1  0  0  1  0  0  0 -1  1] (Indices: [0, 2, 3, 4, 5, 11, 15, 16, 17, 18]), Candidate: [1 2 1 0 1 0 1 0 1 1 1 0 1 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 45750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  0  0  0  0  1 -1  1  0  0  0 -1  1] (Indices: [0, 2, 3, 4, 5, 13, 15, 16, 17, 18]), Candidate: [1 2 1 0 1 0 1 0 1 1 0 1 2 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 45800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0  0 -1  0  0  0  0  0  1  0 -1  0  1] (Indices: [0, 2, 3, 4, 6, 7, 8, 9, 16, 17]), Candidate: [1 2 1 0 0 2 1 0 1 0 0 1 1 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 45850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0 -1  0  1 -1  1 -1  1 -1  0  0  0  1] (Indices: [0, 2, 3, 4, 6, 7, 8, 11, 13, 15]), Candidate: [1 2 1 0 0 2 1 0 0 1 1 0 2 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 45900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0 -1  0  0  0  1 -1  0  1  0 -1  0  1] (Indices: [0, 2, 3, 4, 6, 7, 8, 13, 16, 17]), Candidate: [1 2 1 0 0 2 1 0 0 1 0 1 2 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 45950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  1  0 -1  0  0  1 -1  0  0  1 -1  1] (Indices: [0, 2, 3, 4, 6, 7, 9, 10, 14, 18]), Candidate: [ 1  2  1  0  0  2  1 -1  2  1 -1  1  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 46000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  1 -1  0  1 -1  1 -1  0  0  0  1  0] (Indices: [0, 2, 3, 4, 6, 7, 9, 12, 14, 19]), Candidate: [ 1  2  1  0  0  2  1 -1  2  0  0  2  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 46050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  0  1  0  0 -1  0  0  0  1 -1  0  1] (Indices: [0, 2, 3, 4, 6, 7, 10, 11, 12, 17]), Candidate: [ 1  2  1  0  0  2  1 -1  1  2  0  1  0  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  0  1 -1  0  1 -1  1  0 -1  0  0  1] (Indices: [0, 2, 3, 4, 6, 7, 10, 13, 15, 16]), Candidate: [ 1  2  1  0  0  2  1 -1  1  2 -1  1  2  0  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 46150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  0  0  1  0 -1  0  0  0  0  1  0  0] (Indices: [0, 2, 3, 4, 6, 7, 11, 12, 18, 19]), Candidate: [ 1  2  1  0  0  2  1 -1  1  1  1  1  0  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  0  0  0  1  0 -1  0  0  0  1  0  0] (Indices: [0, 2, 3, 4, 6, 7, 12, 13, 18, 19]), Candidate: [ 1  2  1  0  0  2  1 -1  1  1  0  2  1  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  0  0  0  0  0  1 -1  0  1  0  0  0] (Indices: [0, 2, 3, 4, 6, 7, 14, 17, 18, 19]), Candidate: [ 1  2  1  0  0  2  1 -1  1  1  0  1  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 46300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1  0 -1  1 -1  1 -1  1 -1  0  0  0  1] (Indices: [0, 2, 3, 4, 6, 8, 9, 11, 13, 15]), Candidate: [1 2 1 0 0 2 0 1 1 0 1 0 2 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 46350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1  0 -1  0  0  1 -1  0  1  0 -1  0  1] (Indices: [0, 2, 3, 4, 6, 8, 9, 13, 16, 17]), Candidate: [1 2 1 0 0 2 0 1 1 0 0 1 2 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 46400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1 -1  1  0 -1  0  0  0  1 -1  0  1  0] (Indices: [0, 2, 3, 4, 6, 8, 10, 11, 16, 19]), Candidate: [1 2 1 0 0 2 0 1 0 2 0 0 1 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 46450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1 -1  1 -1  0  0  0  1  0  0 -1  0  1] (Indices: [0, 2, 3, 4, 6, 8, 10, 15, 16, 17]), Candidate: [ 1  2  1  0  0  2  0  1  0  2 -1  1  1  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1 -1  0  1 -1  0  1 -1  1  0 -1  0  1] (Indices: [0, 2, 3, 4, 6, 8, 11, 14, 16, 17]), Candidate: [ 1  2  1  0  0  2  0  1  0  1  1  0  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1 -1  0  0  1 -1  0  0  0  1  0  0  0] (Indices: [0, 2, 3, 4, 6, 8, 12, 17, 18, 19]), Candidate: [1 2 1 0 0 2 0 1 0 1 0 2 0 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 46600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  1  0  0 -1  0  1 -1  1 -1  0  0  1] (Indices: [0, 2, 3, 4, 6, 9, 10, 11, 14, 16]), Candidate: [ 1  2  1  0  0  2  0  0  2  1  0  0  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  1  0 -1  0  0  1  0  0 -1  0  0  1] (Indices: [0, 2, 3, 4, 6, 9, 10, 14, 15, 16]), Candidate: [ 1  2  1  0  0  2  0  0  2  1 -1  1  1  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  1 -1  1 -1  1 -1  0  1  0 -1  0  1] (Indices: [0, 2, 3, 4, 6, 9, 11, 13, 16, 17]), Candidate: [1 2 1 0 0 2 0 0 2 0 1 0 2 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 46750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  1 -1  0  1 -1  1 -1  0  0  1  0  0] (Indices: [0, 2, 3, 4, 6, 9, 12, 14, 18, 19]), Candidate: [ 1  2  1  0  0  2  0  0  2  0  0  2  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  0  1  0  0  0 -1  0  0  0  1 -1  1] (Indices: [0, 2, 3, 4, 6, 10, 11, 12, 13, 18]), Candidate: [1 2 1 0 0 2 0 0 1 2 0 1 1 0 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 46850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  0  1  0 -1  0  0  0  1 -1  1  0  0] (Indices: [0, 2, 3, 4, 6, 10, 11, 16, 18, 19]), Candidate: [1 2 1 0 0 2 0 0 1 2 0 0 1 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 46900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  0  1 -1  0  1 -1  1 -1  1  0 -1  1] (Indices: [0, 2, 3, 4, 6, 10, 13, 15, 17, 18]), Candidate: [ 1  2  1  0  0  2  0  0  1  2 -1  1  2  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  0  0  1  0 -1  0  1 -1  1  0 -1  1] (Indices: [0, 2, 3, 4, 6, 11, 12, 15, 17, 18]), Candidate: [1 2 1 0 0 2 0 0 1 1 1 1 0 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 47000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  0  0  0  1  0  0 -1  0  1 -1  1  0] (Indices: [0, 2, 3, 4, 6, 12, 13, 14, 17, 19]), Candidate: [ 1  2  1  0  0  2  0  0  1  1  0  2  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0  0  0  0 -1  0  1 -1  0  0  0  0  1] (Indices: [0, 2, 3, 4, 7, 8, 9, 10, 11, 14]), Candidate: [ 1  2  1  0  0  1  2  0  1  1  0  0  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0  0 -1  1 -1  0  1 -1  0  0  1 -1  1] (Indices: [0, 2, 3, 4, 7, 8, 9, 11, 14, 18]), Candidate: [ 1  2  1  0  0  1  2  0  1  0  1  0  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0  0 -1  0  0  0  1  0 -1  0  1 -1  1] (Indices: [0, 2, 3, 4, 7, 8, 9, 14, 15, 18]), Candidate: [1 2 1 0 0 1 2 0 1 0 0 1 1 2 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 47200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0 -1  1 -1  1  0 -1  0  0  0  1 -1  1] (Indices: [0, 2, 3, 4, 7, 8, 10, 12, 13, 18]), Candidate: [ 1  2  1  0  0  1  2  0  0  2 -1  2  1  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0 -1  1 -1  0  0  0  0  1 -1  1  0  0] (Indices: [0, 2, 3, 4, 7, 8, 10, 16, 18, 19]), Candidate: [ 1  2  1  0  0  1  2  0  0  2 -1  1  1  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0 -1  0  1 -1  0  0  1  0 -1  0  1  0] (Indices: [0, 2, 3, 4, 7, 8, 11, 15, 16, 19]), Candidate: [1 2 1 0 0 1 2 0 0 1 1 0 1 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 47350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0 -1  0  0  0  1  0 -1  0  1  0 -1  1] (Indices: [0, 2, 3, 4, 7, 8, 13, 14, 17, 18]), Candidate: [ 1  2  1  0  0  1  2  0  0  1  0  1  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  1  0  0 -1  0  0  0  1  0 -1  0  1] (Indices: [0, 2, 3, 4, 7, 9, 10, 11, 16, 17]), Candidate: [ 1  2  1  0  0  1  2 -1  2  1  0  0  1  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  1  0 -1  0  0  1 -1  0  1 -1  1  0] (Indices: [0, 2, 3, 4, 7, 9, 10, 14, 17, 19]), Candidate: [ 1  2  1  0  0  1  2 -1  2  1 -1  1  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 47500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  1 -1  1 -1  0  1  0 -1  0  1 -1  1] (Indices: [0, 2, 3, 4, 7, 9, 11, 14, 15, 18]), Candidate: [ 1  2  1  0  0  1  2 -1  2  0  1  0  1  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  1 -1  0  1 -1  0  0  1  0 -1  1  0] (Indices: [0, 2, 3, 4, 7, 9, 12, 16, 17, 19]), Candidate: [ 1  2  1  0  0  1  2 -1  2  0  0  2  0  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  0  1  0  0 -1  0  1 -1  1 -1  0  1] (Indices: [0, 2, 3, 4, 7, 10, 11, 12, 15, 17]), Candidate: [ 1  2  1  0  0  1  2 -1  1  2  0  1  0  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  0  1 -1  1  0 -1  1 -1  1 -1  0  1] (Indices: [0, 2, 3, 4, 7, 10, 12, 13, 15, 17]), Candidate: [ 1  2  1  0  0  1  2 -1  1  2 -1  2  1  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 47700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  0  1 -1  0  0  1  0  0 -1  1 -1  1] (Indices: [0, 2, 3, 4, 7, 10, 14, 15, 16, 18]), Candidate: [ 1  2  1  0  0  1  2 -1  1  2 -1  1  1  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 47750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  0  0  1 -1  1  0  0 -1  1 -1  0  1] (Indices: [0, 2, 3, 4, 7, 11, 13, 14, 15, 17]), Candidate: [ 1  2  1  0  0  1  2 -1  1  1  1  0  2  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  0  0  0  1  0 -1  0  1  0  0 -1  1] (Indices: [0, 2, 3, 4, 7, 12, 13, 16, 17, 18]), Candidate: [ 1  2  1  0  0  1  2 -1  1  1  0  2  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1  0  0  0 -1  1 -1  0  0  1 -1  0  1] (Indices: [0, 2, 3, 4, 8, 9, 10, 11, 13, 17]), Candidate: [1 2 1 0 0 1 1 1 1 1 0 0 2 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 47900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1  0  0 -1  0  1 -1  0  1 -1  0  1  0] (Indices: [0, 2, 3, 4, 8, 9, 10, 13, 16, 19]), Candidate: [ 1  2  1  0  0  1  1  1  1  1 -1  1  2  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1  0 -1  1 -1  1 -1  1  0 -1  0  0  1] (Indices: [0, 2, 3, 4, 8, 9, 11, 13, 15, 16]), Candidate: [1 2 1 0 0 1 1 1 1 0 1 0 2 0 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 48000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1  0 -1  0  1 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 2, 3, 4, 8, 9, 12, 14, 16, 18]), Candidate: [ 1  2  1  0  0  1  1  1  1  0  0  2  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1 -1  1  0  0  0  0 -1  0  0  0  0  1] (Indices: [0, 2, 3, 4, 8, 10, 11, 12, 13, 14]), Candidate: [ 1  2  1  0  0  1  1  1  0  2  0  1  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1 -1  1  0 -1  0  0  1 -1  1 -1  1  0] (Indices: [0, 2, 3, 4, 8, 10, 11, 15, 17, 19]), Candidate: [1 2 1 0 0 1 1 1 0 2 0 0 1 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 48150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1 -1  1 -1  0  1  0 -1  0  0  1  0  0] (Indices: [0, 2, 3, 4, 8, 10, 13, 14, 18, 19]), Candidate: [ 1  2  1  0  0  1  1  1  0  2 -1  1  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 48200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1 -1  0  1  0 -1  1 -1  0  0  1  0  0] (Indices: [0, 2, 3, 4, 8, 11, 12, 14, 18, 19]), Candidate: [ 1  2  1  0  0  1  1  1  0  1  1  1  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1 -1  0  0  1  0  0 -1  1  0 -1  0  1] (Indices: [0, 2, 3, 4, 8, 12, 13, 14, 16, 17]), Candidate: [ 1  2  1  0  0  1  1  1  0  1  0  2  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1 -1  0  0  0  0  1 -1  1  0  0  0  0] (Indices: [0, 2, 3, 4, 8, 14, 16, 17, 18, 19]), Candidate: [ 1  2  1  0  0  1  1  1  0  1  0  1  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  1  0  0 -1  0  0  1  0 -1  0  1  0] (Indices: [0, 2, 3, 4, 9, 10, 11, 15, 16, 19]), Candidate: [1 2 1 0 0 1 1 0 2 1 0 0 1 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 48400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  1  0 -1  0  1  0 -1  0  1  0 -1  1] (Indices: [0, 2, 3, 4, 9, 10, 13, 14, 17, 18]), Candidate: [ 1  2  1  0  0  1  1  0  2  1 -1  1  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 48450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  1 -1  1  0 -1  1 -1  0  1  0 -1  1] (Indices: [0, 2, 3, 4, 9, 11, 12, 14, 17, 18]), Candidate: [ 1  2  1  0  0  1  1  0  2  0  1  1  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  1 -1  0  1  0  0  0 -1  0  1 -1  1] (Indices: [0, 2, 3, 4, 9, 12, 13, 14, 15, 18]), Candidate: [1 2 1 0 0 1 1 0 2 0 0 2 1 1 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 48550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  1 -1  0  0  0  1  0  0 -1  1  0  0] (Indices: [0, 2, 3, 4, 9, 14, 15, 16, 18, 19]), Candidate: [1 2 1 0 0 1 1 0 2 0 0 1 1 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 48600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  0  1  0 -1  1 -1  1  0 -1  1 -1  1] (Indices: [0, 2, 3, 4, 10, 11, 13, 15, 16, 18]), Candidate: [1 2 1 0 0 1 1 0 1 2 0 0 2 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 48650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  0  1 -1  1 -1  1 -1  1  0  0 -1  1] (Indices: [0, 2, 3, 4, 10, 12, 14, 16, 17, 18]), Candidate: [ 1  2  1  0  0  1  1  0  1  2 -1  2  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 48700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  0  0  1  0 -1  1  0  0  0 -1  0  1] (Indices: [0, 2, 3, 4, 11, 12, 14, 15, 16, 17]), Candidate: [1 2 1 0 0 1 1 0 1 1 1 1 0 2 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 48750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  0  0  0  1  0 -1  0  1  0  0  0  0] (Indices: [0, 2, 3, 4, 12, 13, 16, 17, 18, 19]), Candidate: [1 2 1 0 0 1 1 0 1 1 0 2 1 0 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 48800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0  0 -1  0  0  0  0  1 -1  1 -1  0  1] (Indices: [0, 2, 3, 5, 6, 7, 8, 9, 15, 17]), Candidate: [ 1  2  1 -1  2  1  1  0  1  0  0  1  1  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0 -1  0  1  0 -1  0  0  0  0  1 -1  1] (Indices: [0, 2, 3, 5, 6, 7, 8, 11, 12, 18]), Candidate: [ 1  2  1 -1  2  1  1  0  0  1  1  1  0  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0 -1  0  0  0  1 -1  1 -1  1 -1  0  1] (Indices: [0, 2, 3, 5, 6, 7, 8, 13, 15, 17]), Candidate: [ 1  2  1 -1  2  1  1  0  0  1  0  1  2  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  1  0 -1  0  0  1  0 -1  0  0  0  1] (Indices: [0, 2, 3, 5, 6, 7, 9, 10, 14, 15]), Candidate: [ 1  2  1 -1  2  1  1 -1  2  1 -1  1  1  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 49000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  1 -1  0  1 -1  1 -1  1 -1  0  0  1] (Indices: [0, 2, 3, 5, 6, 7, 9, 12, 14, 16]), Candidate: [ 1  2  1 -1  2  1  1 -1  2  0  0  2  0  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 49050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  0  1  0  0 -1  1 -1  0  0  0  0  1] (Indices: [0, 2, 3, 5, 6, 7, 10, 11, 12, 14]), Candidate: [ 1  2  1 -1  2  1  1 -1  1  2  0  1  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 49100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  0  1 -1  0  1  0 -1  0  1 -1  0  1] (Indices: [0, 2, 3, 5, 6, 7, 10, 13, 14, 17]), Candidate: [ 1  2  1 -1  2  1  1 -1  1  2 -1  1  2  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 49150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  0  0  1  0 -1  0  0  1 -1  0  1  0] (Indices: [0, 2, 3, 5, 6, 7, 11, 12, 16, 19]), Candidate: [ 1  2  1 -1  2  1  1 -1  1  1  1  1  0  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 49200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  0  0  0  1  0 -1  0  1 -1  0  1  0] (Indices: [0, 2, 3, 5, 6, 7, 12, 13, 16, 19]), Candidate: [ 1  2  1 -1  2  1  1 -1  1  1  0  2  1  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 49250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  0  0  0  0  0  1 -1  1  0  0 -1  1] (Indices: [0, 2, 3, 5, 6, 7, 14, 16, 17, 18]), Candidate: [ 1  2  1 -1  2  1  1 -1  1  1  0  1  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 49300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1  0 -1  1  0 -1  0  0  0  0  1 -1  1] (Indices: [0, 2, 3, 5, 6, 8, 9, 11, 12, 18]), Candidate: [ 1  2  1 -1  2  1  0  1  1  0  1  1  0  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1  0 -1  0  0  1 -1  1 -1  1 -1  0  1] (Indices: [0, 2, 3, 5, 6, 8, 9, 13, 15, 17]), Candidate: [ 1  2  1 -1  2  1  0  1  1  0  0  1  2  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1 -1  1  0 -1  0  0  1 -1  0  0  1  0] (Indices: [0, 2, 3, 5, 6, 8, 10, 11, 15, 19]), Candidate: [ 1  2  1 -1  2  1  0  1  0  2  0  0  1  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1 -1  1 -1  0  0  1 -1  0  1  0 -1  1] (Indices: [0, 2, 3, 5, 6, 8, 10, 14, 17, 18]), Candidate: [ 1  2  1 -1  2  1  0  1  0  2 -1  1  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 49500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1 -1  0  1 -1  0  1  0 -1  1 -1  0  1] (Indices: [0, 2, 3, 5, 6, 8, 11, 14, 15, 17]), Candidate: [ 1  2  1 -1  2  1  0  1  0  1  1  0  1  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1 -1  0  0  1 -1  0  0  1  0  0 -1  1] (Indices: [0, 2, 3, 5, 6, 8, 12, 16, 17, 18]), Candidate: [ 1  2  1 -1  2  1  0  1  0  1  0  2  0  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  1  0  0 -1  1 -1  0  0  0  1 -1  1] (Indices: [0, 2, 3, 5, 6, 9, 10, 11, 13, 18]), Candidate: [ 1  2  1 -1  2  1  0  0  2  1  0  0  2  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  1  0 -1  0  1 -1  0  0  1  0 -1  1] (Indices: [0, 2, 3, 5, 6, 9, 10, 13, 17, 18]), Candidate: [ 1  2  1 -1  2  1  0  0  2  1 -1  1  2  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 49700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  1 -1  1 -1  1 -1  1 -1  1 -1  0  1] (Indices: [0, 2, 3, 5, 6, 9, 11, 13, 15, 17]), Candidate: [ 1  2  1 -1  2  1  0  0  2  0  1  0  2  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  1 -1  0  1 -1  1 -1  1 -1  0  1  0] (Indices: [0, 2, 3, 5, 6, 9, 12, 14, 16, 19]), Candidate: [ 1  2  1 -1  2  1  0  0  2  0  0  2  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 49800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  0  1  0  0  0 -1  1 -1  0  0  0  1] (Indices: [0, 2, 3, 5, 6, 10, 11, 12, 13, 15]), Candidate: [ 1  2  1 -1  2  1  0  0  1  2  0  1  1  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  0  1  0 -1  0  0  1 -1  0  1  0  0] (Indices: [0, 2, 3, 5, 6, 10, 11, 15, 18, 19]), Candidate: [ 1  2  1 -1  2  1  0  0  1  2  0  0  1  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  0  1 -1  0  1 -1  1  0  0 -1  0  1] (Indices: [0, 2, 3, 5, 6, 10, 13, 15, 16, 17]), Candidate: [ 1  2  1 -1  2  1  0  0  1  2 -1  1  2  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 49950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  0  0  1  0 -1  0  1  0  0 -1  0  1] (Indices: [0, 2, 3, 5, 6, 11, 12, 15, 16, 17]), Candidate: [ 1  2  1 -1  2  1  0  0  1  1  1  1  0  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  0  0  0  1  0  0 -1  1 -1  1 -1  1] (Indices: [0, 2, 3, 5, 6, 12, 13, 14, 16, 18]), Candidate: [ 1  2  1 -1  2  1  0  0  1  1  0  2  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 50050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  0  0  0  0  0  0  1  0  0  0  0  0] (Indices: [0, 2, 3, 5, 6, 15, 16, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  1  0  0  1  1  0  1  1  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0  0 -1  1 -1  0  1  0 -1  0  0  0  1] (Indices: [0, 2, 3, 5, 7, 8, 9, 11, 14, 15]), Candidate: [ 1  2  1 -1  2  0  2  0  1  0  1  0  1  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0  0 -1  0  0  1 -1  0  0  0  1  0  0] (Indices: [0, 2, 3, 5, 7, 8, 9, 13, 18, 19]), Candidate: [ 1  2  1 -1  2  0  2  0  1  0  0  1  2  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0 -1  1 -1  1  0 -1  1 -1  0  0  0  1] (Indices: [0, 2, 3, 5, 7, 8, 10, 12, 13, 15]), Candidate: [ 1  2  1 -1  2  0  2  0  0  2 -1  2  1  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 50250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0 -1  1 -1  0  0  0  1 -1  0  1  0  0] (Indices: [0, 2, 3, 5, 7, 8, 10, 15, 18, 19]), Candidate: [ 1  2  1 -1  2  0  2  0  0  2 -1  1  1  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 50300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0 -1  0  1 -1  0  1 -1  0  0  1  0  0] (Indices: [0, 2, 3, 5, 7, 8, 11, 14, 18, 19]), Candidate: [ 1  2  1 -1  2  0  2  0  0  1  1  0  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 50350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0 -1  0  0  0  1  0 -1  1  0 -1  0  1] (Indices: [0, 2, 3, 5, 7, 8, 13, 14, 16, 17]), Candidate: [ 1  2  1 -1  2  0  2  0  0  1  0  1  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 50400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  1  0  0 -1  0  0  1 -1  1 -1  0  1] (Indices: [0, 2, 3, 5, 7, 9, 10, 11, 15, 17]), Candidate: [ 1  2  1 -1  2  0  2 -1  2  1  0  0  1  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 50450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  1  0 -1  0  0  1 -1  1 -1  1 -1  1] (Indices: [0, 2, 3, 5, 7, 9, 10, 14, 16, 18]), Candidate: [ 1  2  1 -1  2  0  2 -1  2  1 -1  1  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 50500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  1 -1  1 -1  1 -1  0  0  0  1  0  0] (Indices: [0, 2, 3, 5, 7, 9, 11, 13, 18, 19]), Candidate: [ 1  2  1 -1  2  0  2 -1  2  0  1  0  2  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 50550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  1 -1  0  1 -1  0  1 -1  1 -1  1  0] (Indices: [0, 2, 3, 5, 7, 9, 12, 15, 17, 19]), Candidate: [ 1  2  1 -1  2  0  2 -1  2  0  0  2  0  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 50600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  0  1  0  0 -1  1 -1  0  0  1 -1  1] (Indices: [0, 2, 3, 5, 7, 10, 11, 12, 14, 18]), Candidate: [ 1  2  1 -1  2  0  2 -1  1  2  0  1  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 50650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  0  1 -1  1  0  0 -1  0  0  1 -1  1] (Indices: [0, 2, 3, 5, 7, 10, 12, 13, 14, 18]), Candidate: [ 1  2  1 -1  2  0  2 -1  1  2 -1  2  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 50700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  0  1 -1  0  1 -1  0  1 -1  1  0  0] (Indices: [0, 2, 3, 5, 7, 10, 13, 16, 18, 19]), Candidate: [ 1  2  1 -1  2  0  2 -1  1  2 -1  1  2  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 50750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  0  0  1  0 -1  0  0  1 -1  1  0  0] (Indices: [0, 2, 3, 5, 7, 11, 12, 16, 18, 19]), Candidate: [ 1  2  1 -1  2  0  2 -1  1  1  1  1  0  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 50800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  0  0  0  1  0 -1  1 -1  1  0 -1  1] (Indices: [0, 2, 3, 5, 7, 12, 13, 15, 17, 18]), Candidate: [ 1  2  1 -1  2  0  2 -1  1  1  0  2  1  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 50850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1  0  0  0 -1  1  0 -1  0  0  0  0  1] (Indices: [0, 2, 3, 5, 8, 9, 10, 11, 13, 14]), Candidate: [ 1  2  1 -1  2  0  1  1  1  1  0  0  2  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 50900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1  0  0 -1  0  1 -1  1 -1  0  0  1  0] (Indices: [0, 2, 3, 5, 8, 9, 10, 13, 15, 19]), Candidate: [ 1  2  1 -1  2  0  1  1  1  1 -1  1  2  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 50950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1  0 -1  1 -1  1  0 -1  0  1 -1  0  1] (Indices: [0, 2, 3, 5, 8, 9, 11, 13, 14, 17]), Candidate: [ 1  2  1 -1  2  0  1  1  1  0  1  0  2  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 51000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1  0 -1  0  1 -1  1  0 -1  0  1 -1  1] (Indices: [0, 2, 3, 5, 8, 9, 12, 14, 15, 18]), Candidate: [ 1  2  1 -1  2  0  1  1  1  0  0  2  0  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1  0 -1  0  0  0  0  1  0 -1  1  0  0] (Indices: [0, 2, 3, 5, 8, 9, 15, 16, 18, 19]), Candidate: [ 1  2  1 -1  2  0  1  1  1  0  0  1  1  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1 -1  1  0 -1  0  0  1  0 -1  1 -1  1] (Indices: [0, 2, 3, 5, 8, 10, 11, 15, 16, 18]), Candidate: [ 1  2  1 -1  2  0  1  1  0  2  0  0  1  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1 -1  1 -1  0  1  0 -1  1 -1  0  1  0] (Indices: [0, 2, 3, 5, 8, 10, 13, 14, 16, 19]), Candidate: [ 1  2  1 -1  2  0  1  1  0  2 -1  1  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 51200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1 -1  0  1  0 -1  1 -1  1 -1  0  1  0] (Indices: [0, 2, 3, 5, 8, 11, 12, 14, 16, 19]), Candidate: [ 1  2  1 -1  2  0  1  1  0  1  1  1  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 51250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1 -1  0  0  1  0  0  0 -1  1 -1  0  1] (Indices: [0, 2, 3, 5, 8, 12, 13, 14, 15, 17]), Candidate: [ 1  2  1 -1  2  0  1  1  0  1  0  2  1  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1 -1  0  0  0  0  1  0  0  0 -1  1  0] (Indices: [0, 2, 3, 5, 8, 14, 15, 16, 17, 19]), Candidate: [ 1  2  1 -1  2  0  1  1  0  1  0  1  1  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  1  0  0 -1  0  1 -1  0  0  1  0  0] (Indices: [0, 2, 3, 5, 9, 10, 11, 14, 18, 19]), Candidate: [ 1  2  1 -1  2  0  1  0  2  1  0  0  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 51400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  1  0 -1  0  1  0 -1  1  0 -1  0  1] (Indices: [0, 2, 3, 5, 9, 10, 13, 14, 16, 17]), Candidate: [ 1  2  1 -1  2  0  1  0  2  1 -1  1  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 51450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  1 -1  1  0 -1  1 -1  1  0 -1  0  1] (Indices: [0, 2, 3, 5, 9, 11, 12, 14, 16, 17]), Candidate: [ 1  2  1 -1  2  0  1  0  2  0  1  1  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 51500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  1 -1  1 -1  0  0  0  1  0  0  0  0] (Indices: [0, 2, 3, 5, 9, 11, 16, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  0  1  0  2  0  1  0  1  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  1 -1  0  0  1 -1  0  1  0  0  0  0] (Indices: [0, 2, 3, 5, 9, 13, 16, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  0  1  0  2  0  0  1  2  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  0  1  0 -1  1  0 -1  0  1 -1  1  0] (Indices: [0, 2, 3, 5, 10, 11, 13, 14, 17, 19]), Candidate: [ 1  2  1 -1  2  0  1  0  1  2  0  0  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 51650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  0  1 -1  1 -1  1  0 -1  1  0 -1  1] (Indices: [0, 2, 3, 5, 10, 12, 14, 15, 17, 18]), Candidate: [ 1  2  1 -1  2  0  1  0  1  2 -1  2  0  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 51700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  0  0  1  0  0 -1  0  1  0 -1  1  0] (Indices: [0, 2, 3, 5, 11, 12, 13, 16, 17, 19]), Candidate: [ 1  2  1 -1  2  0  1  0  1  1  1  1  1  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  0  0  0  1  0 -1  1  0  0 -1  1  0] (Indices: [0, 2, 3, 5, 12, 13, 15, 16, 17, 19]), Candidate: [ 1  2  1 -1  2  0  1  0  1  1  0  2  1  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0  0  0 -1  0  0  0  0  0  1  0 -1  1] (Indices: [0, 2, 3, 6, 7, 8, 9, 10, 17, 18]), Candidate: [ 1  2  1 -1  1  2  1  0  1  1 -1  1  1  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 51850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0  0 -1  0  1 -1  0  0  0  1 -1  1  0] (Indices: [0, 2, 3, 6, 7, 8, 9, 12, 17, 19]), Candidate: [ 1  2  1 -1  1  2  1  0  1  0  0  2  0  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0 -1  1  0 -1  0  1  0 -1  0  0  0  1] (Indices: [0, 2, 3, 6, 7, 8, 10, 11, 14, 15]), Candidate: [ 1  2  1 -1  1  2  1  0  0  2  0  0  1  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0 -1  1 -1  0  1 -1  0  0  0  1  0  0] (Indices: [0, 2, 3, 6, 7, 8, 10, 13, 18, 19]), Candidate: [ 1  2  1 -1  1  2  1  0  0  2 -1  1  2  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0 -1  0  1 -1  1 -1  1 -1  0  0  1  0] (Indices: [0, 2, 3, 6, 7, 8, 11, 13, 15, 19]), Candidate: [ 1  2  1 -1  1  2  1  0  0  1  1  0  2  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0 -1  0  0  1 -1  1 -1  0  1 -1  1  0] (Indices: [0, 2, 3, 6, 7, 8, 12, 14, 17, 19]), Candidate: [ 1  2  1 -1  1  2  1  0  0  1  0  2  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  1  0  0  0 -1  0  0  1 -1  0  0  1] (Indices: [0, 2, 3, 6, 7, 9, 10, 11, 12, 16]), Candidate: [ 1  2  1 -1  1  2  1 -1  2  1  0  1  0  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  1  0 -1  0  1  0 -1  0  0  0  1  0] (Indices: [0, 2, 3, 6, 7, 9, 10, 13, 14, 19]), Candidate: [ 1  2  1 -1  1  2  1 -1  2  1 -1  1  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 52200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  1 -1  1  0 -1  0  0  0  1 -1  1  0] (Indices: [0, 2, 3, 6, 7, 9, 11, 12, 17, 19]), Candidate: [ 1  2  1 -1  1  2  1 -1  2  0  1  1  0  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  1 -1  0  1  0 -1  0  0  1 -1  1  0] (Indices: [0, 2, 3, 6, 7, 9, 12, 13, 17, 19]), Candidate: [ 1  2  1 -1  1  2  1 -1  2  0  0  2  1  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  1 -1  0  0  0  1 -1  1 -1  1  0  0] (Indices: [0, 2, 3, 6, 7, 9, 14, 16, 18, 19]), Candidate: [ 1  2  1 -1  1  2  1 -1  2  0  0  1  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 52350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  0  1  0 -1  0  1 -1  0  1  0 -1  1] (Indices: [0, 2, 3, 6, 7, 10, 11, 14, 17, 18]), Candidate: [ 1  2  1 -1  1  2  1 -1  1  2  0  0  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 52400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  0  1 -1  0  1  0  0 -1  0  1 -1  1] (Indices: [0, 2, 3, 6, 7, 10, 13, 14, 15, 18]), Candidate: [ 1  2  1 -1  1  2  1 -1  1  2 -1  1  2  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 52450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  0  0  1  0 -1  1  0 -1  0  1 -1  1] (Indices: [0, 2, 3, 6, 7, 11, 12, 14, 15, 18]), Candidate: [ 1  2  1 -1  1  2  1 -1  1  1  1  1  0  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  0  0  1 -1  0  0  1  0 -1  1  0  0] (Indices: [0, 2, 3, 6, 7, 11, 15, 16, 18, 19]), Candidate: [ 1  2  1 -1  1  2  1 -1  1  1  1  0  1  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  0  0  0  0  1 -1  1  0 -1  1  0  0] (Indices: [0, 2, 3, 6, 7, 13, 15, 16, 18, 19]), Candidate: [ 1  2  1 -1  1  2  1 -1  1  1  0  1  2  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1  0  0 -1  1 -1  0  1 -1  0  1 -1  1] (Indices: [0, 2, 3, 6, 8, 9, 10, 12, 15, 18]), Candidate: [ 1  2  1 -1  1  2  0  1  1  1 -1  2  0  1  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1  0 -1  1  0 -1  1 -1  1 -1  0  0  1] (Indices: [0, 2, 3, 6, 8, 9, 11, 12, 14, 16]), Candidate: [ 1  2  1 -1  1  2  0  1  1  0  1  1  0  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1  0 -1  0  1  0  0 -1  1 -1  0  0  1] (Indices: [0, 2, 3, 6, 8, 9, 12, 13, 14, 16]), Candidate: [ 1  2  1 -1  1  2  0  1  1  0  0  2  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1  0 -1  0  0  1 -1  0  1  0  0 -1  1] (Indices: [0, 2, 3, 6, 8, 9, 13, 16, 17, 18]), Candidate: [ 1  2  1 -1  1  2  0  1  1  0  0  1  2  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1 -1  1  0 -1  1 -1  0  1 -1  1 -1  1] (Indices: [0, 2, 3, 6, 8, 10, 11, 13, 16, 18]), Candidate: [ 1  2  1 -1  1  2  0  1  0  2  0  0  2  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1 -1  1 -1  1 -1  0  1  0  0 -1  0  1] (Indices: [0, 2, 3, 6, 8, 10, 12, 15, 16, 17]), Candidate: [ 1  2  1 -1  1  2  0  1  0  2 -1  2  0  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1 -1  0  1  0  0 -1  1  0 -1  0  0  1] (Indices: [0, 2, 3, 6, 8, 11, 12, 13, 15, 16]), Candidate: [ 1  2  1 -1  1  2  0  1  0  1  1  1  1  0  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1 -1  0  1 -1  0  1  0  0  0 -1  0  1] (Indices: [0, 2, 3, 6, 8, 11, 14, 15, 16, 17]), Candidate: [ 1  2  1 -1  1  2  0  1  0  1  1  0  1  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1 -1  0  0  0  1  0  0  0  0 -1  0  1] (Indices: [0, 2, 3, 6, 8, 13, 14, 15, 16, 17]), Candidate: [ 1  2  1 -1  1  2  0  1  0  1  0  1  2  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  1  0  0 -1  1 -1  1 -1  0  0  1  0] (Indices: [0, 2, 3, 6, 9, 10, 11, 13, 15, 19]), Candidate: [ 1  2  1 -1  1  2  0  0  2  1  0  0  2  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  1  0 -1  1 -1  1 -1  0  1 -1  1  0] (Indices: [0, 2, 3, 6, 9, 10, 12, 14, 17, 19]), Candidate: [ 1  2  1 -1  1  2  0  0  2  1 -1  2  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 53150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  1 -1  1  0  0  0 -1  0  0  1 -1  1] (Indices: [0, 2, 3, 6, 9, 11, 12, 13, 14, 18]), Candidate: [ 1  2  1 -1  1  2  0  0  2  0  1  1  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 53200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  1 -1  1 -1  1 -1  0  1 -1  1  0  0] (Indices: [0, 2, 3, 6, 9, 11, 13, 16, 18, 19]), Candidate: [ 1  2  1 -1  1  2  0  0  2  0  1  0  2  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  1 -1  0  1 -1  0  1 -1  1  0  0  0] (Indices: [0, 2, 3, 6, 9, 12, 15, 17, 18, 19]), Candidate: [ 1  2  1 -1  1  2  0  0  2  0  0  2  0  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  0  1  0  0 -1  0  1  0 -1  0  1  0] (Indices: [0, 2, 3, 6, 10, 11, 12, 15, 16, 19]), Candidate: [ 1  2  1 -1  1  2  0  0  1  2  0  1  0  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  0  1 -1  1  0  0 -1  0  1  0 -1  1] (Indices: [0, 2, 3, 6, 10, 12, 13, 14, 17, 18]), Candidate: [ 1  2  1 -1  1  2  0  0  1  2 -1  2  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 53400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  0  0  1  0  0  0  0 -1  1 -1  0  1] (Indices: [0, 2, 3, 6, 11, 12, 13, 14, 15, 17]), Candidate: [ 1  2  1 -1  1  2  0  0  1  1  1  1  1  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  0  0  1 -1  0  1  0  0  0 -1  1  0] (Indices: [0, 2, 3, 6, 11, 14, 15, 16, 17, 19]), Candidate: [ 1  2  1 -1  1  2  0  0  1  1  1  0  1  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0  0  0  0 -1  0  1 -1  0  0  0  1  0] (Indices: [0, 2, 3, 7, 8, 9, 10, 11, 14, 19]), Candidate: [ 1  2  1 -1  1  1  2  0  1  1  0  0  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 53550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0  0  0 -1  0  0  1  0 -1  0  0  1  0] (Indices: [0, 2, 3, 7, 8, 9, 10, 14, 15, 19]), Candidate: [ 1  2  1 -1  1  1  2  0  1  1 -1  1  1  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 53600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0  0 -1  1 -1  1 -1  0  0  1  0 -1  1] (Indices: [0, 2, 3, 7, 8, 9, 11, 13, 17, 18]), Candidate: [ 1  2  1 -1  1  1  2  0  1  0  1  0  2  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0  0 -1  0  1 -1  0  1  0 -1  0  1  0] (Indices: [0, 2, 3, 7, 8, 9, 12, 15, 16, 19]), Candidate: [ 1  2  1 -1  1  1  2  0  1  0  0  2  0  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0 -1  1  0  0 -1  1 -1  1 -1  0  0  1] (Indices: [0, 2, 3, 7, 8, 10, 11, 12, 14, 16]), Candidate: [ 1  2  1 -1  1  1  2  0  0  2  0  1  0  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 53750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0 -1  1 -1  1  0  0 -1  1 -1  0  0  1] (Indices: [0, 2, 3, 7, 8, 10, 12, 13, 14, 16]), Candidate: [ 1  2  1 -1  1  1  2  0  0  2 -1  2  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 53800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0 -1  1 -1  0  1 -1  0  1  0  0 -1  1] (Indices: [0, 2, 3, 7, 8, 10, 13, 16, 17, 18]), Candidate: [ 1  2  1 -1  1  1  2  0  0  2 -1  1  2  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 53850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0 -1  0  1  0 -1  0  0  1  0  0 -1  1] (Indices: [0, 2, 3, 7, 8, 11, 12, 16, 17, 18]), Candidate: [ 1  2  1 -1  1  1  2  0  0  1  1  1  0  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0 -1  0  0  1  0 -1  1  0 -1  1 -1  1] (Indices: [0, 2, 3, 7, 8, 12, 13, 15, 16, 18]), Candidate: [ 1  2  1 -1  1  1  2  0  0  1  0  2  1  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  1  0  0  0  0 -1  0  0  0  0  1  0] (Indices: [0, 2, 3, 7, 9, 10, 11, 12, 13, 19]), Candidate: [ 1  2  1 -1  1  1  2 -1  2  1  0  1  1  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 54000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  1  0  0 -1  0  0  0  0  1  0  0  0] (Indices: [0, 2, 3, 7, 9, 10, 11, 17, 18, 19]), Candidate: [ 1  2  1 -1  1  1  2 -1  2  1  0  0  1  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 54050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  1  0 -1  0  1 -1  1 -1  1 -1  1  0] (Indices: [0, 2, 3, 7, 9, 10, 13, 15, 17, 19]), Candidate: [ 1  2  1 -1  1  1  2 -1  2  1 -1  1  2  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 54100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  1 -1  1  0 -1  0  1 -1  1 -1  1  0] (Indices: [0, 2, 3, 7, 9, 11, 12, 15, 17, 19]), Candidate: [ 1  2  1 -1  1  1  2 -1  2  0  1  1  0  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 54150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  1 -1  0  1  0  0 -1  0  0  1  0  0] (Indices: [0, 2, 3, 7, 9, 12, 13, 14, 18, 19]), Candidate: [ 1  2  1 -1  1  1  2 -1  2  0  0  2  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 54200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  0  1  0  0  0  0 -1  0  0  1 -1  1] (Indices: [0, 2, 3, 7, 10, 11, 12, 13, 14, 18]), Candidate: [ 1  2  1 -1  1  1  2 -1  1  2  0  1  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 54250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  0  1  0 -1  1 -1  0  1 -1  1  0  0] (Indices: [0, 2, 3, 7, 10, 11, 13, 16, 18, 19]), Candidate: [ 1  2  1 -1  1  1  2 -1  1  2  0  0  2  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 54300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  0  1 -1  1 -1  0  1 -1  1  0  0  0] (Indices: [0, 2, 3, 7, 10, 12, 15, 17, 18, 19]), Candidate: [ 1  2  1 -1  1  1  2 -1  1  2 -1  2  0  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 54350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  0  0  1  0 -1  1 -1  1  0 -1  1  0] (Indices: [0, 2, 3, 7, 11, 12, 14, 16, 17, 19]), Candidate: [ 1  2  1 -1  1  1  2 -1  1  1  1  1  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 54400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  0  0  0  0  1  0  0  0  0  0 -1  1] (Indices: [0, 2, 3, 7, 13, 14, 15, 16, 17, 18]), Candidate: [ 1  2  1 -1  1  1  2 -1  1  1  0  1  2  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 54450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1  0  0  0 -1  0  1 -1  0  1  0 -1  1] (Indices: [0, 2, 3, 8, 9, 10, 11, 14, 17, 18]), Candidate: [ 1  2  1 -1  1  1  1  1  1  1  0  0  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 54500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1  0  0 -1  0  1  0  0 -1  0  1 -1  1] (Indices: [0, 2, 3, 8, 9, 10, 13, 14, 15, 18]), Candidate: [ 1  2  1 -1  1  1  1  1  1  1 -1  1  2  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 54550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1  0 -1  1  0 -1  1  0 -1  0  1 -1  1] (Indices: [0, 2, 3, 8, 9, 11, 12, 14, 15, 18]), Candidate: [ 1  2  1 -1  1  1  1  1  1  0  1  1  0  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1  0 -1  1 -1  0  0  1  0 -1  1  0  0] (Indices: [0, 2, 3, 8, 9, 11, 15, 16, 18, 19]), Candidate: [ 1  2  1 -1  1  1  1  1  1  0  1  0  1  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1  0 -1  0  0  1 -1  1  0 -1  1  0  0] (Indices: [0, 2, 3, 8, 9, 13, 15, 16, 18, 19]), Candidate: [ 1  2  1 -1  1  1  1  1  1  0  0  1  2  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1 -1  1  0 -1  1  0 -1  1 -1  0  1  0] (Indices: [0, 2, 3, 8, 10, 11, 13, 14, 16, 19]), Candidate: [ 1  2  1 -1  1  1  1  1  0  2  0  0  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 54750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1 -1  1 -1  1 -1  1  0  0 -1  1 -1  1] (Indices: [0, 2, 3, 8, 10, 12, 14, 15, 16, 18]), Candidate: [ 1  2  1 -1  1  1  1  1  0  2 -1  2  0  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 54800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1 -1  0  1  0  0 -1  1 -1  0  1  0  0] (Indices: [0, 2, 3, 8, 11, 12, 13, 15, 18, 19]), Candidate: [ 1  2  1 -1  1  1  1  1  0  1  1  1  1  0  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1 -1  0  0  1  0  0 -1  0  1  0  0  0] (Indices: [0, 2, 3, 8, 12, 13, 14, 17, 18, 19]), Candidate: [ 1  2  1 -1  1  1  1  1  0  1  0  2  1  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 54900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  1  0  0  0 -1  0  0  1  0  0 -1  1] (Indices: [0, 2, 3, 9, 10, 11, 12, 16, 17, 18]), Candidate: [ 1  2  1 -1  1  1  1  0  2  1  0  1  0  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  1  0 -1  1  0 -1  1  0 -1  1 -1  1] (Indices: [0, 2, 3, 9, 10, 12, 13, 15, 16, 18]), Candidate: [ 1  2  1 -1  1  1  1  0  2  1 -1  2  1  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  1 -1  1  0  0  0 -1  1 -1  1 -1  1] (Indices: [0, 2, 3, 9, 11, 12, 13, 14, 16, 18]), Candidate: [ 1  2  1 -1  1  1  1  0  2  0  1  1  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  1 -1  1 -1  0  0  1  0  0  0  0  0] (Indices: [0, 2, 3, 9, 11, 15, 16, 17, 18, 19]), Candidate: [ 1  2  1 -1  1  1  1  0  2  0  1  0  1  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  0  1  0  0 -1  1  0  0 -1  1 -1  1] (Indices: [0, 2, 3, 10, 11, 12, 14, 15, 16, 18]), Candidate: [ 1  2  1 -1  1  1  1  0  1  2  0  1  0  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  0  1 -1  1 -1  1  0  0  0  0 -1  1] (Indices: [0, 2, 3, 10, 12, 14, 15, 16, 17, 18]), Candidate: [ 1  2  1 -1  1  1  1  0  1  2 -1  2  0  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0  0  0 -1  1 -1  0  0  0  0  0  0  1] (Indices: [0, 2, 4, 5, 6, 7, 8, 9, 10, 12]), Candidate: [ 1  2  0  1  1  1  1  0  1  1 -1  2  0  1  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0 -1  1  0 -1  0  0  0  0  0  1 -1  1] (Indices: [0, 2, 4, 5, 6, 7, 8, 10, 11, 18]), Candidate: [1 2 0 1 1 1 1 0 0 2 0 0 1 1 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 55300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0 -1  0  1 -1  0  0  1 -1  0  1 -1  1] (Indices: [0, 2, 4, 5, 6, 7, 8, 11, 15, 18]), Candidate: [1 2 0 1 1 1 1 0 0 1 1 0 1 1 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 55350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0 -1  0  0  0  0  1 -1  1 -1  0  1  0] (Indices: [0, 2, 4, 5, 6, 7, 8, 14, 16, 19]), Candidate: [ 1  2  0  1  1  1  1  0  0  1  0  1  1  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  1 -1  1  0  0 -1  0  0  0  0  0  1] (Indices: [0, 2, 4, 5, 6, 7, 9, 11, 12, 13]), Candidate: [ 1  2  0  1  1  1  1 -1  2  0  1  1  1  0  0  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  1 -1  0  0  1  0 -1  1 -1  0  0  1] (Indices: [0, 2, 4, 5, 6, 7, 9, 13, 14, 16]), Candidate: [ 1  2  0  1  1  1  1 -1  2  0  0  1  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  0  1  0 -1  0  1 -1  0  0  1 -1  1] (Indices: [0, 2, 4, 5, 6, 7, 10, 11, 14, 18]), Candidate: [ 1  2  0  1  1  1  1 -1  1  2  0  0  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  0  1 -1  0  0  1  0 -1  0  1 -1  1] (Indices: [0, 2, 4, 5, 6, 7, 10, 14, 15, 18]), Candidate: [ 1  2  0  1  1  1  1 -1  1  2 -1  1  1  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  0  0  1 -1  1 -1  0  1 -1  0  1  0] (Indices: [0, 2, 4, 5, 6, 7, 11, 13, 16, 19]), Candidate: [ 1  2  0  1  1  1  1 -1  1  1  1  0  2  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  0  0  0  1 -1  0  1  0 -1  1 -1  1] (Indices: [0, 2, 4, 5, 6, 7, 12, 15, 16, 18]), Candidate: [ 1  2  0  1  1  1  1 -1  1  1  0  2  0  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1  0  0  0 -1  0  0  0  0  0  1 -1  1] (Indices: [0, 2, 4, 5, 6, 8, 9, 10, 11, 18]), Candidate: [1 2 0 1 1 1 0 1 1 1 0 0 1 1 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 55750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1  0 -1  1 -1  0  0  1 -1  0  1 -1  1] (Indices: [0, 2, 4, 5, 6, 8, 9, 11, 15, 18]), Candidate: [1 2 0 1 1 1 0 1 1 0 1 0 1 1 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 55800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1  0 -1  0  0  0  1 -1  1 -1  0  1  0] (Indices: [0, 2, 4, 5, 6, 8, 9, 14, 16, 19]), Candidate: [ 1  2  0  1  1  1  0  1  1  0  0  1  1  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1 -1  1 -1  1 -1  1 -1  0  1 -1  0  1] (Indices: [0, 2, 4, 5, 6, 8, 10, 12, 14, 17]), Candidate: [ 1  2  0  1  1  1  0  1  0  2 -1  2  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1 -1  0  1  0  0 -1  0  1 -1  0  0  1] (Indices: [0, 2, 4, 5, 6, 8, 11, 12, 13, 16]), Candidate: [1 2 0 1 1 1 0 1 0 1 1 1 1 0 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 55950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1 -1  0  1 -1  0  0  0  1  0  0 -1  1] (Indices: [0, 2, 4, 5, 6, 8, 11, 16, 17, 18]), Candidate: [1 2 0 1 1 1 0 1 0 1 1 0 1 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 56000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1 -1  0  0  0  1 -1  1  0 -1  1 -1  1] (Indices: [0, 2, 4, 5, 6, 8, 13, 15, 16, 18]), Candidate: [1 2 0 1 1 1 0 1 0 1 0 1 2 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 56050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  1  0  0 -1  0  0  0  0  1 -1  1  0] (Indices: [0, 2, 4, 5, 6, 9, 10, 11, 17, 19]), Candidate: [1 2 0 1 1 1 0 0 2 1 0 0 1 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 56100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  1  0 -1  0  0  0  1  0 -1  0  1  0] (Indices: [0, 2, 4, 5, 6, 9, 10, 15, 16, 19]), Candidate: [ 1  2  0  1  1  1  0  0  2  1 -1  1  1  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  1 -1  1 -1  0  1 -1  1 -1  0  1  0] (Indices: [0, 2, 4, 5, 6, 9, 11, 14, 16, 19]), Candidate: [ 1  2  0  1  1  1  0  0  2  0  1  0  1  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  1 -1  0  0  1  0  0 -1  1 -1  0  1] (Indices: [0, 2, 4, 5, 6, 9, 13, 14, 15, 17]), Candidate: [1 2 0 1 1 1 0 0 2 0 0 1 2 1 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 56250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  0  1  0  0 -1  0  0  1 -1  1 -1  1] (Indices: [0, 2, 4, 5, 6, 10, 11, 12, 16, 18]), Candidate: [1 2 0 1 1 1 0 0 1 2 0 1 0 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 56300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  0  1 -1  1  0 -1  0  1 -1  1 -1  1] (Indices: [0, 2, 4, 5, 6, 10, 12, 13, 16, 18]), Candidate: [ 1  2  0  1  1  1  0  0  1  2 -1  2  1  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  0  1 -1  0  0  1  0 -1  0  1  0  0] (Indices: [0, 2, 4, 5, 6, 10, 14, 15, 18, 19]), Candidate: [ 1  2  0  1  1  1  0  0  1  2 -1  1  1  2  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  0  0  1 -1  1  0 -1  1 -1  1 -1  1] (Indices: [0, 2, 4, 5, 6, 11, 13, 14, 16, 18]), Candidate: [ 1  2  0  1  1  1  0  0  1  1  1  0  2  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  0  0  0  1 -1  1  0  0  0 -1  0  1] (Indices: [0, 2, 4, 5, 6, 12, 14, 15, 16, 17]), Candidate: [1 2 0 1 1 1 0 0 1 1 0 2 0 2 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 56500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0  0  0 -1  1 -1  0  0  0  0  0  1  0] (Indices: [0, 2, 4, 5, 7, 8, 9, 10, 12, 19]), Candidate: [ 1  2  0  1  1  0  2  0  1  1 -1  2  0  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0  0 -1  0  1  0  0 -1  0  0  0  0  1] (Indices: [0, 2, 4, 5, 7, 8, 9, 12, 13, 14]), Candidate: [ 1  2  0  1  1  0  2  0  1  0  0  2  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0  0 -1  0  0  0  0  1 -1  1 -1  1  0] (Indices: [0, 2, 4, 5, 7, 8, 9, 15, 17, 19]), Candidate: [1 2 0 1 1 0 2 0 1 0 0 1 1 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 56650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0 -1  1 -1  1 -1  0  0  1 -1  1 -1  1] (Indices: [0, 2, 4, 5, 7, 8, 10, 12, 16, 18]), Candidate: [ 1  2  0  1  1  0  2  0  0  2 -1  2  0  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0 -1  0  1  0 -1  1 -1  0  0  0  1  0] (Indices: [0, 2, 4, 5, 7, 8, 11, 12, 14, 19]), Candidate: [ 1  2  0  1  1  0  2  0  0  1  1  1  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0 -1  0  0  1  0  0 -1  0  0  0  1  0] (Indices: [0, 2, 4, 5, 7, 8, 12, 13, 14, 19]), Candidate: [ 1  2  0  1  1  0  2  0  0  1  0  2  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0 -1  0  0  0  1 -1  0  0  1  0  0  0] (Indices: [0, 2, 4, 5, 7, 8, 13, 17, 18, 19]), Candidate: [1 2 0 1 1 0 2 0 0 1 0 1 2 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 56850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  1  0 -1  1 -1  1  0 -1  0  0  0  1] (Indices: [0, 2, 4, 5, 7, 9, 10, 12, 14, 15]), Candidate: [ 1  2  0  1  1  0  2 -1  2  1 -1  2  0  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  1 -1  1  0  0  0 -1  0  0  0  0  1] (Indices: [0, 2, 4, 5, 7, 9, 11, 12, 13, 14]), Candidate: [ 1  2  0  1  1  0  2 -1  2  0  1  1  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  1 -1  1 -1  0  0  1 -1  1 -1  1  0] (Indices: [0, 2, 4, 5, 7, 9, 11, 15, 17, 19]), Candidate: [ 1  2  0  1  1  0  2 -1  2  0  1  0  1  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  1 -1  0  0  1  0 -1  0  0  1  0  0] (Indices: [0, 2, 4, 5, 7, 9, 13, 14, 18, 19]), Candidate: [ 1  2  0  1  1  0  2 -1  2  0  0  1  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  0  1  0 -1  1  0 -1  0  0  1 -1  1] (Indices: [0, 2, 4, 5, 7, 10, 11, 13, 14, 18]), Candidate: [ 1  2  0  1  1  0  2 -1  1  2  0  0  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  0  1 -1  1 -1  1  0 -1  0  0  1  0] (Indices: [0, 2, 4, 5, 7, 10, 12, 14, 15, 19]), Candidate: [ 1  2  0  1  1  0  2 -1  1  2 -1  2  0  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  0  1 -1  0  0  0  1 -1  1  0  0  0] (Indices: [0, 2, 4, 5, 7, 10, 15, 17, 18, 19]), Candidate: [ 1  2  0  1  1  0  2 -1  1  2 -1  1  1  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  0  0  1 -1  1 -1  1 -1  1  0 -1  1] (Indices: [0, 2, 4, 5, 7, 11, 13, 15, 17, 18]), Candidate: [ 1  2  0  1  1  0  2 -1  1  1  1  0  2  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  0  0  0  1 -1  1 -1  1 -1  1  0  0] (Indices: [0, 2, 4, 5, 7, 12, 14, 16, 18, 19]), Candidate: [ 1  2  0  1  1  0  2 -1  1  1  0  2  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1  0  0  0 -1  0  0  0  1  0 -1  0  1] (Indices: [0, 2, 4, 5, 8, 9, 10, 11, 16, 17]), Candidate: [1 2 0 1 1 0 1 1 1 1 0 0 1 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 57350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1  0  0 -1  0  0  1 -1  0  1 -1  1  0] (Indices: [0, 2, 4, 5, 8, 9, 10, 14, 17, 19]), Candidate: [ 1  2  0  1  1  0  1  1  1  1 -1  1  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1  0 -1  1 -1  0  1  0 -1  0  1 -1  1] (Indices: [0, 2, 4, 5, 8, 9, 11, 14, 15, 18]), Candidate: [1 2 0 1 1 0 1 1 1 0 1 0 1 2 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 57450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1  0 -1  0  1 -1  0  0  1  0 -1  1  0] (Indices: [0, 2, 4, 5, 8, 9, 12, 16, 17, 19]), Candidate: [1 2 0 1 1 0 1 1 1 0 0 2 0 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 57500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1 -1  1  0  0 -1  0  1 -1  1 -1  0  1] (Indices: [0, 2, 4, 5, 8, 10, 11, 12, 15, 17]), Candidate: [1 2 0 1 1 0 1 1 0 2 0 1 0 1 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 57550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1 -1  1 -1  1  0 -1  1 -1  1 -1  0  1] (Indices: [0, 2, 4, 5, 8, 10, 12, 13, 15, 17]), Candidate: [ 1  2  0  1  1  0  1  1  0  2 -1  2  1  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1 -1  1 -1  0  0  1  0  0 -1  1 -1  1] (Indices: [0, 2, 4, 5, 8, 10, 14, 15, 16, 18]), Candidate: [ 1  2  0  1  1  0  1  1  0  2 -1  1  1  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1 -1  0  1 -1  1  0  0 -1  1 -1  0  1] (Indices: [0, 2, 4, 5, 8, 11, 13, 14, 15, 17]), Candidate: [1 2 0 1 1 0 1 1 0 1 1 0 2 1 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 57700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1 -1  0  0  1  0 -1  0  1  0  0 -1  1] (Indices: [0, 2, 4, 5, 8, 12, 13, 16, 17, 18]), Candidate: [1 2 0 1 1 0 1 1 0 1 0 2 1 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 57750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  1  0  0  0 -1  1 -1  0  0  0  1  0] (Indices: [0, 2, 4, 5, 9, 10, 11, 12, 14, 19]), Candidate: [ 1  2  0  1  1  0  1  0  2  1  0  1  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  1  0 -1  1  0  0 -1  0  0  0  1  0] (Indices: [0, 2, 4, 5, 9, 10, 12, 13, 14, 19]), Candidate: [ 1  2  0  1  1  0  1  0  2  1 -1  2  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  1  0 -1  0  1 -1  0  0  1  0  0  0] (Indices: [0, 2, 4, 5, 9, 10, 13, 17, 18, 19]), Candidate: [ 1  2  0  1  1  0  1  0  2  1 -1  1  2  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  1 -1  1  0 -1  0  0  0  1  0  0  0] (Indices: [0, 2, 4, 5, 9, 11, 12, 17, 18, 19]), Candidate: [1 2 0 1 1 0 1 0 2 0 1 1 0 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 57950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  1 -1  0  1  0 -1  1 -1  1 -1  1  0] (Indices: [0, 2, 4, 5, 9, 12, 13, 15, 17, 19]), Candidate: [1 2 0 1 1 0 1 0 2 0 0 2 1 0 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 58000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  0  1  0  0  0 -1  1 -1  0  0  1  0] (Indices: [0, 2, 4, 5, 10, 11, 12, 13, 15, 19]), Candidate: [1 2 0 1 1 0 1 0 1 2 0 1 1 0 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 58050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  0  1  0 -1  0  1  0 -1  1  0 -1  1] (Indices: [0, 2, 4, 5, 10, 11, 14, 15, 17, 18]), Candidate: [1 2 0 1 1 0 1 0 1 2 0 0 1 2 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 58100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  0  1 -1  0  1  0  0 -1  1  0 -1  1] (Indices: [0, 2, 4, 5, 10, 13, 14, 15, 17, 18]), Candidate: [ 1  2  0  1  1  0  1  0  1  2 -1  1  2  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  0  0  1  0 -1  0  1  0 -1  1  0  0] (Indices: [0, 2, 4, 5, 11, 12, 15, 16, 18, 19]), Candidate: [1 2 0 1 1 0 1 0 1 1 1 1 0 1 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 58200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  0  0  0  0  1 -1  1  0  0  0  0  0] (Indices: [0, 2, 4, 5, 13, 15, 16, 17, 18, 19]), Candidate: [1 2 0 1 1 0 1 0 1 1 0 1 2 0 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 58250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0  0 -1  1 -1  1 -1  0  0  0  0  1  0] (Indices: [0, 2, 4, 6, 7, 8, 9, 11, 13, 19]), Candidate: [1 2 0 1 0 2 1 0 1 0 1 0 2 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 58300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0  0 -1  0  0  1 -1  0  0  1 -1  1  0] (Indices: [0, 2, 4, 6, 7, 8, 9, 13, 17, 19]), Candidate: [1 2 0 1 0 2 1 0 1 0 0 1 2 0 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 58350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0 -1  1 -1  1  0  0 -1  0  0  0  0  1] (Indices: [0, 2, 4, 6, 7, 8, 10, 12, 13, 14]), Candidate: [ 1  2  0  1  0  2  1  0  0  2 -1  2  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0 -1  1 -1  0  0  0  1 -1  1 -1  1  0] (Indices: [0, 2, 4, 6, 7, 8, 10, 15, 17, 19]), Candidate: [ 1  2  0  1  0  2  1  0  0  2 -1  1  1  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0 -1  0  1 -1  0  1 -1  0  1 -1  1  0] (Indices: [0, 2, 4, 6, 7, 8, 11, 14, 17, 19]), Candidate: [ 1  2  0  1  0  2  1  0  0  1  1  0  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0 -1  0  0  0  1  0  0 -1  0  0  1  0] (Indices: [0, 2, 4, 6, 7, 8, 13, 14, 15, 19]), Candidate: [1 2 0 1 0 2 1 0 0 1 0 1 2 1 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 58550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  1  0  0 -1  0  0  1  0 -1  0  0  1] (Indices: [0, 2, 4, 6, 7, 9, 10, 11, 15, 16]), Candidate: [ 1  2  0  1  0  2  1 -1  2  1  0  0  1  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  1  0 -1  0  0  1 -1  1  0 -1  0  1] (Indices: [0, 2, 4, 6, 7, 9, 10, 14, 16, 17]), Candidate: [ 1  2  0  1  0  2  1 -1  2  1 -1  1  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 58650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  1 -1  1 -1  1 -1  0  0  1 -1  1  0] (Indices: [0, 2, 4, 6, 7, 9, 11, 13, 17, 19]), Candidate: [ 1  2  0  1  0  2  1 -1  2  0  1  0  2  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  1 -1  0  1 -1  0  1 -1  1  0 -1  1] (Indices: [0, 2, 4, 6, 7, 9, 12, 15, 17, 18]), Candidate: [ 1  2  0  1  0  2  1 -1  2  0  0  2  0  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  0  1  0  0 -1  1 -1  0  1 -1  0  1] (Indices: [0, 2, 4, 6, 7, 10, 11, 12, 14, 17]), Candidate: [ 1  2  0  1  0  2  1 -1  1  2  0  1  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  0  1 -1  1  0  0 -1  0  1 -1  0  1] (Indices: [0, 2, 4, 6, 7, 10, 12, 13, 14, 17]), Candidate: [ 1  2  0  1  0  2  1 -1  1  2 -1  2  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 58850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  0  1 -1  0  1 -1  0  1  0 -1  1  0] (Indices: [0, 2, 4, 6, 7, 10, 13, 16, 17, 19]), Candidate: [ 1  2  0  1  0  2  1 -1  1  2 -1  1  2  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  0  0  1  0 -1  0  0  1  0 -1  1  0] (Indices: [0, 2, 4, 6, 7, 11, 12, 16, 17, 19]), Candidate: [ 1  2  0  1  0  2  1 -1  1  1  1  1  0  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  0  0  0  1  0 -1  1  0 -1  0  1  0] (Indices: [0, 2, 4, 6, 7, 12, 13, 15, 16, 19]), Candidate: [ 1  2  0  1  0  2  1 -1  1  1  0  2  1  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1  0  0  0  0 -1  0  0  0  0  0  1  0] (Indices: [0, 2, 4, 6, 8, 9, 10, 11, 12, 19]), Candidate: [1 2 0 1 0 2 0 1 1 1 0 1 0 1 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 59050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1  0  0 -1  0  1 -1  1 -1  0  1 -1  1] (Indices: [0, 2, 4, 6, 8, 9, 10, 13, 15, 18]), Candidate: [ 1  2  0  1  0  2  0  1  1  1 -1  1  2  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1  0 -1  1 -1  1  0 -1  1 -1  0  0  1] (Indices: [0, 2, 4, 6, 8, 9, 11, 13, 14, 16]), Candidate: [ 1  2  0  1  0  2  0  1  1  0  1  0  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1  0 -1  0  1 -1  1  0 -1  1 -1  0  1] (Indices: [0, 2, 4, 6, 8, 9, 12, 14, 15, 17]), Candidate: [1 2 0 1 0 2 0 1 1 0 0 2 0 2 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 59200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1  0 -1  0  0  0  0  1  0  0 -1  1  0] (Indices: [0, 2, 4, 6, 8, 9, 15, 16, 17, 19]), Candidate: [1 2 0 1 0 2 0 1 1 0 0 1 1 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 59250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1 -1  1  0 -1  0  0  1  0  0 -1  0  1] (Indices: [0, 2, 4, 6, 8, 10, 11, 15, 16, 17]), Candidate: [1 2 0 1 0 2 0 1 0 2 0 0 1 1 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 59300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1 -1  1 -1  0  1  0 -1  1 -1  1 -1  1] (Indices: [0, 2, 4, 6, 8, 10, 13, 14, 16, 18]), Candidate: [ 1  2  0  1  0  2  0  1  0  2 -1  1  2  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 59350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1 -1  0  1  0 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 2, 4, 6, 8, 11, 12, 14, 16, 18]), Candidate: [ 1  2  0  1  0  2  0  1  0  1  1  1  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1 -1  0  0  1  0  0  0  0 -1  0  0  1] (Indices: [0, 2, 4, 6, 8, 12, 13, 14, 15, 16]), Candidate: [1 2 0 1 0 2 0 1 0 1 0 2 1 1 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 59450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1 -1  0  0  0  0  1  0  0  0  0 -1  1] (Indices: [0, 2, 4, 6, 8, 14, 15, 16, 17, 18]), Candidate: [1 2 0 1 0 2 0 1 0 1 0 1 1 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 59500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  1  0  0 -1  0  1 -1  0  1 -1  1  0] (Indices: [0, 2, 4, 6, 9, 10, 11, 14, 17, 19]), Candidate: [ 1  2  0  1  0  2  0  0  2  1  0  0  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  1  0 -1  0  1  0  0 -1  0  0  1  0] (Indices: [0, 2, 4, 6, 9, 10, 13, 14, 15, 19]), Candidate: [ 1  2  0  1  0  2  0  0  2  1 -1  1  2  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  1 -1  1  0 -1  1  0 -1  0  0  1  0] (Indices: [0, 2, 4, 6, 9, 11, 12, 14, 15, 19]), Candidate: [1 2 0 1 0 2 0 0 2 0 1 1 0 2 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 59650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  1 -1  1 -1  0  0  1 -1  1  0  0  0] (Indices: [0, 2, 4, 6, 9, 11, 15, 17, 18, 19]), Candidate: [1 2 0 1 0 2 0 0 2 0 1 0 1 1 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 59700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  1 -1  0  0  1 -1  1 -1  1  0  0  0] (Indices: [0, 2, 4, 6, 9, 13, 15, 17, 18, 19]), Candidate: [1 2 0 1 0 2 0 0 2 0 0 1 2 0 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 59750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  0  1  0 -1  1  0 -1  0  1  0 -1  1] (Indices: [0, 2, 4, 6, 10, 11, 13, 14, 17, 18]), Candidate: [ 1  2  0  1  0  2  0  0  1  2  0  0  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  0  1 -1  1 -1  1  0  0 -1  0  1  0] (Indices: [0, 2, 4, 6, 10, 12, 14, 15, 16, 19]), Candidate: [ 1  2  0  1  0  2  0  0  1  2 -1  2  0  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  0  0  1  0  0 -1  0  1  0  0 -1  1] (Indices: [0, 2, 4, 6, 11, 12, 13, 16, 17, 18]), Candidate: [1 2 0 1 0 2 0 0 1 1 1 1 1 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 59900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  0  0  0  1  0 -1  1  0  0  0 -1  1] (Indices: [0, 2, 4, 6, 12, 13, 15, 16, 17, 18]), Candidate: [1 2 0 1 0 2 0 0 1 1 0 2 1 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 59950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0  0  0 -1  1  0 -1  0  0  0  1 -1  1] (Indices: [0, 2, 4, 7, 8, 9, 10, 12, 13, 18]), Candidate: [ 1  2  0  1  0  1  2  0  1  1 -1  2  1  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0  0  0 -1  0  0  0  0  1 -1  1  0  0] (Indices: [0, 2, 4, 7, 8, 9, 10, 16, 18, 19]), Candidate: [ 1  2  0  1  0  1  2  0  1  1 -1  1  1  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0  0 -1  1 -1  0  0  1  0 -1  0  1  0] (Indices: [0, 2, 4, 7, 8, 9, 11, 15, 16, 19]), Candidate: [1 2 0 1 0 1 2 0 1 0 1 0 1 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 60100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0  0 -1  0  0  1  0 -1  0  1  0 -1  1] (Indices: [0, 2, 4, 7, 8, 9, 13, 14, 17, 18]), Candidate: [ 1  2  0  1  0  1  2  0  1  0  0  1  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0 -1  1  0 -1  1  0 -1  1 -1  0  0  1] (Indices: [0, 2, 4, 7, 8, 10, 11, 13, 14, 16]), Candidate: [ 1  2  0  1  0  1  2  0  0  2  0  0  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0 -1  1 -1  1 -1  1  0 -1  1 -1  0  1] (Indices: [0, 2, 4, 7, 8, 10, 12, 14, 15, 17]), Candidate: [ 1  2  0  1  0  1  2  0  0  2 -1  2  0  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0 -1  1 -1  0  0  0  1  0  0 -1  1  0] (Indices: [0, 2, 4, 7, 8, 10, 15, 16, 17, 19]), Candidate: [ 1  2  0  1  0  1  2  0  0  2 -1  1  1  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0 -1  0  1 -1  1 -1  1  0 -1  1 -1  1] (Indices: [0, 2, 4, 7, 8, 11, 13, 15, 16, 18]), Candidate: [1 2 0 1 0 1 2 0 0 1 1 0 2 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 60350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0 -1  0  0  1 -1  1 -1  1  0  0 -1  1] (Indices: [0, 2, 4, 7, 8, 12, 14, 16, 17, 18]), Candidate: [ 1  2  0  1  0  1  2  0  0  1  0  2  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  1  0  0  0 -1  0  0  0  0  1  0  0] (Indices: [0, 2, 4, 7, 9, 10, 11, 12, 18, 19]), Candidate: [ 1  2  0  1  0  1  2 -1  2  1  0  1  0  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  1  0 -1  1  0 -1  0  0  0  1  0  0] (Indices: [0, 2, 4, 7, 9, 10, 12, 13, 18, 19]), Candidate: [ 1  2  0  1  0  1  2 -1  2  1 -1  2  1  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 60500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  1  0 -1  0  0  1 -1  0  1  0  0  0] (Indices: [0, 2, 4, 7, 9, 10, 14, 17, 18, 19]), Candidate: [ 1  2  0  1  0  1  2 -1  2  1 -1  1  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 60550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  1 -1  1 -1  1  0 -1  0  0  1  0  0] (Indices: [0, 2, 4, 7, 9, 11, 13, 14, 18, 19]), Candidate: [ 1  2  0  1  0  1  2 -1  2  0  1  0  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 60600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  1 -1  0  1 -1  1  0 -1  1 -1  1  0] (Indices: [0, 2, 4, 7, 9, 12, 14, 15, 17, 19]), Candidate: [ 1  2  0  1  0  1  2 -1  2  0  0  2  0  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  0  1  0  0 -1  1  0 -1  0  0  1  0] (Indices: [0, 2, 4, 7, 10, 11, 12, 14, 15, 19]), Candidate: [ 1  2  0  1  0  1  2 -1  1  2  0  1  0  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  0  1  0 -1  0  0  1 -1  1  0  0  0] (Indices: [0, 2, 4, 7, 10, 11, 15, 17, 18, 19]), Candidate: [ 1  2  0  1  0  1  2 -1  1  2  0  0  1  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  0  1 -1  0  1 -1  1 -1  1  0  0  0] (Indices: [0, 2, 4, 7, 10, 13, 15, 17, 18, 19]), Candidate: [ 1  2  0  1  0  1  2 -1  1  2 -1  1  2  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 60800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  0  0  1 -1  1  0 -1  1  0 -1  1  0] (Indices: [0, 2, 4, 7, 11, 13, 14, 16, 17, 19]), Candidate: [ 1  2  0  1  0  1  2 -1  1  1  1  0  2  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 60850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1  0  0  0  0 -1  1 -1  0  1 -1  0  1] (Indices: [0, 2, 4, 8, 9, 10, 11, 12, 14, 17]), Candidate: [ 1  2  0  1  0  1  1  1  1  1  0  1  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1  0  0 -1  1  0  0 -1  0  1 -1  0  1] (Indices: [0, 2, 4, 8, 9, 10, 12, 13, 14, 17]), Candidate: [ 1  2  0  1  0  1  1  1  1  1 -1  2  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 60950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1  0  0 -1  0  1 -1  0  1  0 -1  1  0] (Indices: [0, 2, 4, 8, 9, 10, 13, 16, 17, 19]), Candidate: [ 1  2  0  1  0  1  1  1  1  1 -1  1  2  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1  0 -1  1  0 -1  0  0  1  0 -1  1  0] (Indices: [0, 2, 4, 8, 9, 11, 12, 16, 17, 19]), Candidate: [1 2 0 1 0 1 1 1 1 0 1 1 0 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 61050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1  0 -1  0  1  0 -1  1  0 -1  0  1  0] (Indices: [0, 2, 4, 8, 9, 12, 13, 15, 16, 19]), Candidate: [1 2 0 1 0 1 1 1 1 0 0 2 1 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 61100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1 -1  1  0  0  0 -1  1 -1  1 -1  0  1] (Indices: [0, 2, 4, 8, 10, 11, 12, 13, 15, 17]), Candidate: [1 2 0 1 0 1 1 1 0 2 0 1 1 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 61150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1 -1  1  0 -1  0  1  0  0 -1  1 -1  1] (Indices: [0, 2, 4, 8, 10, 11, 14, 15, 16, 18]), Candidate: [1 2 0 1 0 1 1 1 0 2 0 0 1 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 61200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1 -1  1 -1  0  1  0  0  0 -1  1 -1  1] (Indices: [0, 2, 4, 8, 10, 13, 14, 15, 16, 18]), Candidate: [ 1  2  0  1  0  1  1  1  0  2 -1  1  2  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1 -1  0  1  0 -1  0  1  0  0  0 -1  1] (Indices: [0, 2, 4, 8, 11, 12, 15, 16, 17, 18]), Candidate: [1 2 0 1 0 1 1 1 0 1 1 1 0 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 61300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1 -1  0  0  0  1  0  0 -1  1  0  0  0] (Indices: [0, 2, 4, 8, 13, 14, 15, 17, 18, 19]), Candidate: [1 2 0 1 0 1 1 1 0 1 0 1 2 1 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 61350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  1  0  0 -1  1 -1  1  0 -1  1 -1  1] (Indices: [0, 2, 4, 9, 10, 11, 13, 15, 16, 18]), Candidate: [1 2 0 1 0 1 1 0 2 1 0 0 2 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 61400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  1  0 -1  1 -1  1 -1  1  0  0 -1  1] (Indices: [0, 2, 4, 9, 10, 12, 14, 16, 17, 18]), Candidate: [ 1  2  0  1  0  1  1  0  2  1 -1  2  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 61450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  1 -1  1  0 -1  1  0  0  0 -1  0  1] (Indices: [0, 2, 4, 9, 11, 12, 14, 15, 16, 17]), Candidate: [1 2 0 1 0 1 1 0 2 0 1 1 0 2 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 61500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  1 -1  0  1  0 -1  0  1  0  0  0  0] (Indices: [0, 2, 4, 9, 12, 13, 16, 17, 18, 19]), Candidate: [1 2 0 1 0 1 1 0 2 0 0 2 1 0 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 61550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  0  1  0 -1  1  0  0  0 -1  1 -1  1] (Indices: [0, 2, 4, 10, 11, 13, 14, 15, 16, 18]), Candidate: [1 2 0 1 0 1 1 0 1 2 0 0 2 1 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 61600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  0  0  1  0  0  0  0  0 -1  0  1  0] (Indices: [0, 2, 4, 11, 12, 13, 14, 15, 16, 19]), Candidate: [1 2 0 1 0 1 1 0 1 1 1 1 1 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 61650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0  0  0 -1  0  1 -1  1 -1  0  0  0  1] (Indices: [0, 2, 5, 6, 7, 8, 9, 10, 13, 15]), Candidate: [ 1  2  0  0  2  1  1  0  1  1 -1  1  2  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0  0 -1  0  1  0 -1  0  1 -1  0  0  1] (Indices: [0, 2, 5, 6, 7, 8, 9, 12, 13, 16]), Candidate: [1 2 0 0 2 1 1 0 1 0 0 2 1 0 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 61750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0  0 -1  0  0  0  0  0  1  0  0 -1  1] (Indices: [0, 2, 5, 6, 7, 8, 9, 16, 17, 18]), Candidate: [1 2 0 0 2 1 1 0 1 0 0 1 1 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 61800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0 -1  1 -1  1 -1  0  0  0  1  0 -1  1] (Indices: [0, 2, 5, 6, 7, 8, 10, 12, 17, 18]), Candidate: [ 1  2  0  0  2  1  1  0  0  2 -1  2  0  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0 -1  0  1  0 -1  0  1 -1  1 -1  0  1] (Indices: [0, 2, 5, 6, 7, 8, 11, 12, 15, 17]), Candidate: [1 2 0 0 2 1 1 0 0 1 1 1 0 1 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 61900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0 -1  0  0  1  0 -1  1 -1  1 -1  0  1] (Indices: [0, 2, 5, 6, 7, 8, 12, 13, 15, 17]), Candidate: [1 2 0 0 2 1 1 0 0 1 0 2 1 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 61950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0 -1  0  0  0  0  1  0  0 -1  1 -1  1] (Indices: [0, 2, 5, 6, 7, 8, 14, 15, 16, 18]), Candidate: [1 2 0 0 2 1 1 0 0 1 0 1 1 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 62000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  1  0 -1  1 -1  1 -1  0  1 -1  0  1] (Indices: [0, 2, 5, 6, 7, 9, 10, 12, 14, 17]), Candidate: [ 1  2  0  0  2  1  1 -1  2  1 -1  2  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 62050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  1 -1  1  0  0 -1  0  1 -1  0  0  1] (Indices: [0, 2, 5, 6, 7, 9, 11, 12, 13, 16]), Candidate: [ 1  2  0  0  2  1  1 -1  2  0  1  1  1  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  1 -1  1 -1  0  0  0  1  0  0 -1  1] (Indices: [0, 2, 5, 6, 7, 9, 11, 16, 17, 18]), Candidate: [ 1  2  0  0  2  1  1 -1  2  0  1  0  1  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  1 -1  0  0  1 -1  1  0 -1  1 -1  1] (Indices: [0, 2, 5, 6, 7, 9, 13, 15, 16, 18]), Candidate: [ 1  2  0  0  2  1  1 -1  2  0  0  1  2  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  0  1  0 -1  1 -1  1  0 -1  0  0  1] (Indices: [0, 2, 5, 6, 7, 10, 11, 13, 15, 16]), Candidate: [ 1  2  0  0  2  1  1 -1  1  2  0  0  2  0  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  0  1 -1  1 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 2, 5, 6, 7, 10, 12, 14, 16, 18]), Candidate: [ 1  2  0  0  2  1  1 -1  1  2 -1  2  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 62300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  0  0  1  0  0  0  0 -1  0  0  0  1] (Indices: [0, 2, 5, 6, 7, 11, 12, 13, 14, 15]), Candidate: [ 1  2  0  0  2  1  1 -1  1  1  1  1  1  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  0  0  1 -1  1 -1  1 -1  0  1  0  0] (Indices: [0, 2, 5, 6, 7, 11, 13, 15, 18, 19]), Candidate: [ 1  2  0  0  2  1  1 -1  1  1  1  0  2  0  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  0  0  0  1 -1  0  1  0  0  0 -1  1] (Indices: [0, 2, 5, 6, 7, 12, 15, 16, 17, 18]), Candidate: [ 1  2  0  0  2  1  1 -1  1  1  0  2  0  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1  0  0  0 -1  0  0  0  1 -1  0  1  0] (Indices: [0, 2, 5, 6, 8, 9, 10, 11, 16, 19]), Candidate: [1 2 0 0 2 1 0 1 1 1 0 0 1 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 62500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1  0  0 -1  0  0  0  1  0  0 -1  0  1] (Indices: [0, 2, 5, 6, 8, 9, 10, 15, 16, 17]), Candidate: [ 1  2  0  0  2  1  0  1  1  1 -1  1  1  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1  0 -1  1 -1  0  1 -1  1  0 -1  0  1] (Indices: [0, 2, 5, 6, 8, 9, 11, 14, 16, 17]), Candidate: [ 1  2  0  0  2  1  0  1  1  0  1  0  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1  0 -1  0  1 -1  0  0  0  1  0  0  0] (Indices: [0, 2, 5, 6, 8, 9, 12, 17, 18, 19]), Candidate: [1 2 0 0 2 1 0 1 1 0 0 2 0 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 62650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1 -1  1  0  0 -1  0  1 -1  0  0  1  0] (Indices: [0, 2, 5, 6, 8, 10, 11, 12, 15, 19]), Candidate: [1 2 0 0 2 1 0 1 0 2 0 1 0 1 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 62700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1 -1  1 -1  1  0 -1  1 -1  0  0  1  0] (Indices: [0, 2, 5, 6, 8, 10, 12, 13, 15, 19]), Candidate: [ 1  2  0  0  2  1  0  1  0  2 -1  2  1  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1 -1  1 -1  0  0  1  0 -1  1  0 -1  1] (Indices: [0, 2, 5, 6, 8, 10, 14, 15, 17, 18]), Candidate: [ 1  2  0  0  2  1  0  1  0  2 -1  1  1  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1 -1  0  1 -1  1  0  0 -1  0  0  1  0] (Indices: [0, 2, 5, 6, 8, 11, 13, 14, 15, 19]), Candidate: [1 2 0 0 2 1 0 1 0 1 1 0 2 1 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 62850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1 -1  0  0  1  0 -1  0  1 -1  1  0  0] (Indices: [0, 2, 5, 6, 8, 12, 13, 16, 18, 19]), Candidate: [1 2 0 0 2 1 0 1 0 1 0 2 1 0 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 62900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  1  0  0  0 -1  0  1 -1  1 -1  0  1] (Indices: [0, 2, 5, 6, 9, 10, 11, 12, 15, 17]), Candidate: [1 2 0 0 2 1 0 0 2 1 0 1 0 1 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 62950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  1  0 -1  1  0 -1  1 -1  1 -1  0  1] (Indices: [0, 2, 5, 6, 9, 10, 12, 13, 15, 17]), Candidate: [ 1  2  0  0  2  1  0  0  2  1 -1  2  1  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  1  0 -1  0  0  1  0  0 -1  1 -1  1] (Indices: [0, 2, 5, 6, 9, 10, 14, 15, 16, 18]), Candidate: [ 1  2  0  0  2  1  0  0  2  1 -1  1  1  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  1 -1  1 -1  1  0  0 -1  1 -1  0  1] (Indices: [0, 2, 5, 6, 9, 11, 13, 14, 15, 17]), Candidate: [1 2 0 0 2 1 0 0 2 0 1 0 2 1 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 63100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  1 -1  0  1  0 -1  0  1  0  0 -1  1] (Indices: [0, 2, 5, 6, 9, 12, 13, 16, 17, 18]), Candidate: [1 2 0 0 2 1 0 0 2 0 0 2 1 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 63150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  0  1  0  0  0 -1  0  1 -1  1 -1  1] (Indices: [0, 2, 5, 6, 10, 11, 12, 13, 16, 18]), Candidate: [1 2 0 0 2 1 0 0 1 2 0 1 1 0 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 63200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  0  1  0 -1  0  1  0 -1  0  1  0  0] (Indices: [0, 2, 5, 6, 10, 11, 14, 15, 18, 19]), Candidate: [1 2 0 0 2 1 0 0 1 2 0 0 1 2 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 63250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  0  1 -1  0  1  0  0 -1  0  1  0  0] (Indices: [0, 2, 5, 6, 10, 13, 14, 15, 18, 19]), Candidate: [ 1  2  0  0  2  1  0  0  1  2 -1  1  2  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  0  0  1  0 -1  0  0  1  0  0  0  0] (Indices: [0, 2, 5, 6, 11, 12, 16, 17, 18, 19]), Candidate: [1 2 0 0 2 1 0 0 1 1 1 1 0 1 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 63350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0  0  0  0  0  0 -1  0  0  0  0  0  1] (Indices: [0, 2, 5, 7, 8, 9, 10, 11, 12, 13]), Candidate: [1 2 0 0 2 0 2 0 1 1 0 1 1 0 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 63400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0  0  0 -1  0  1  0 -1  1 -1  0  0  1] (Indices: [0, 2, 5, 7, 8, 9, 10, 13, 14, 16]), Candidate: [ 1  2  0  0  2  0  2  0  1  1 -1  1  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 63450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0  0 -1  1  0 -1  0  0  1 -1  1 -1  1] (Indices: [0, 2, 5, 7, 8, 9, 11, 12, 16, 18]), Candidate: [1 2 0 0 2 0 2 0 1 0 1 1 0 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 63500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0  0 -1  0  1  0 -1  0  1 -1  1 -1  1] (Indices: [0, 2, 5, 7, 8, 9, 12, 13, 16, 18]), Candidate: [1 2 0 0 2 0 2 0 1 0 0 2 1 0 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 63550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0  0 -1  0  0  0  1  0 -1  0  1  0  0] (Indices: [0, 2, 5, 7, 8, 9, 14, 15, 18, 19]), Candidate: [1 2 0 0 2 0 2 0 1 0 0 1 1 2 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 63600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0 -1  1  0 -1  0  1 -1  1  0 -1  0  1] (Indices: [0, 2, 5, 7, 8, 10, 11, 14, 16, 17]), Candidate: [ 1  2  0  0  2  0  2  0  0  2  0  0  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0 -1  1 -1  1 -1  0  0  0  1  0  0  0] (Indices: [0, 2, 5, 7, 8, 10, 12, 17, 18, 19]), Candidate: [ 1  2  0  0  2  0  2  0  0  2 -1  2  0  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0 -1  0  1  0  0 -1  0  0  0  1  0  0] (Indices: [0, 2, 5, 7, 8, 11, 12, 13, 18, 19]), Candidate: [1 2 0 0 2 0 2 0 0 1 1 1 1 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 63750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0 -1  0  1 -1  0  1 -1  0  1  0  0  0] (Indices: [0, 2, 5, 7, 8, 11, 14, 17, 18, 19]), Candidate: [ 1  2  0  0  2  0  2  0  0  1  1  0  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0 -1  0  0  0  1  0 -1  0  1  0  0  0] (Indices: [0, 2, 5, 7, 8, 13, 14, 17, 18, 19]), Candidate: [ 1  2  0  0  2  0  2  0  0  1  0  1  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  1  0  0 -1  0  1  0 -1  0  1 -1  1] (Indices: [0, 2, 5, 7, 9, 10, 11, 14, 15, 18]), Candidate: [ 1  2  0  0  2  0  2 -1  2  1  0  0  1  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  1  0 -1  1 -1  0  0  1  0 -1  1  0] (Indices: [0, 2, 5, 7, 9, 10, 12, 16, 17, 19]), Candidate: [ 1  2  0  0  2  0  2 -1  2  1 -1  2  0  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 63950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  1 -1  1  0  0 -1  0  0  1  0 -1  1] (Indices: [0, 2, 5, 7, 9, 11, 12, 13, 17, 18]), Candidate: [ 1  2  0  0  2  0  2 -1  2  0  1  1  1  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  1 -1  1 -1  0  1 -1  1  0 -1  1  0] (Indices: [0, 2, 5, 7, 9, 11, 14, 16, 17, 19]), Candidate: [ 1  2  0  0  2  0  2 -1  2  0  1  0  1  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 64050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  1 -1  0  0  1  0 -1  1  0 -1  1  0] (Indices: [0, 2, 5, 7, 9, 13, 14, 16, 17, 19]), Candidate: [ 1  2  0  0  2  0  2 -1  2  0  0  1  2  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 64100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  0  1  0 -1  1  0  0 -1  1 -1  0  1] (Indices: [0, 2, 5, 7, 10, 11, 13, 14, 15, 17]), Candidate: [ 1  2  0  0  2  0  2 -1  1  2  0  0  2  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  0  1 -1  1  0 -1  0  1  0  0 -1  1] (Indices: [0, 2, 5, 7, 10, 12, 13, 16, 17, 18]), Candidate: [ 1  2  0  0  2  0  2 -1  1  2 -1  2  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 64200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  0  0  1  0  0 -1  1  0  0 -1  0  1] (Indices: [0, 2, 5, 7, 11, 12, 13, 15, 16, 17]), Candidate: [ 1  2  0  0  2  0  2 -1  1  1  1  1  1  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  0  0  0  1  0  0  0 -1  1 -1  1  0] (Indices: [0, 2, 5, 7, 12, 13, 14, 15, 17, 19]), Candidate: [ 1  2  0  0  2  0  2 -1  1  1  0  2  1  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1  0  0  0 -1  1 -1  1  0 -1  0  0  1] (Indices: [0, 2, 5, 8, 9, 10, 11, 13, 15, 16]), Candidate: [1 2 0 0 2 0 1 1 1 1 0 0 2 0 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 64350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1  0  0 -1  1 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 2, 5, 8, 9, 10, 12, 14, 16, 18]), Candidate: [ 1  2  0  0  2  0  1  1  1  1 -1  2  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 64400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1  0 -1  1  0  0  0  0 -1  0  0  0  1] (Indices: [0, 2, 5, 8, 9, 11, 12, 13, 14, 15]), Candidate: [1 2 0 0 2 0 1 1 1 0 1 1 1 1 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 64450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1  0 -1  1 -1  1 -1  1 -1  0  1  0  0] (Indices: [0, 2, 5, 8, 9, 11, 13, 15, 18, 19]), Candidate: [1 2 0 0 2 0 1 1 1 0 1 0 2 0 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 64500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1  0 -1  0  1 -1  0  1  0  0  0 -1  1] (Indices: [0, 2, 5, 8, 9, 12, 15, 16, 17, 18]), Candidate: [1 2 0 0 2 0 1 1 1 0 0 2 0 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 64550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1 -1  1  0  0 -1  1 -1  0  0  1  0  0] (Indices: [0, 2, 5, 8, 10, 11, 12, 14, 18, 19]), Candidate: [ 1  2  0  0  2  0  1  1  0  2  0  1  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1 -1  1 -1  1  0  0 -1  1  0 -1  0  1] (Indices: [0, 2, 5, 8, 10, 12, 13, 14, 16, 17]), Candidate: [ 1  2  0  0  2  0  1  1  0  2 -1  2  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 64650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1 -1  1 -1  0  0  1 -1  1  0  0  0  0] (Indices: [0, 2, 5, 8, 10, 14, 16, 17, 18, 19]), Candidate: [ 1  2  0  0  2  0  1  1  0  2 -1  1  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 64700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1 -1  0  1 -1  1 -1  1 -1  1  0  0  0] (Indices: [0, 2, 5, 8, 11, 13, 15, 17, 18, 19]), Candidate: [1 2 0 0 2 0 1 1 0 1 1 0 2 0 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 64750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  1  0  0  0  0 -1  0  0  0  1  0  0] (Indices: [0, 2, 5, 9, 10, 11, 12, 13, 18, 19]), Candidate: [1 2 0 0 2 0 1 0 2 1 0 1 1 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 64800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  1  0  0 -1  0  1 -1  0  1  0  0  0] (Indices: [0, 2, 5, 9, 10, 11, 14, 17, 18, 19]), Candidate: [ 1  2  0  0  2  0  1  0  2  1  0  0  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  1  0 -1  0  1  0 -1  0  1  0  0  0] (Indices: [0, 2, 5, 9, 10, 13, 14, 17, 18, 19]), Candidate: [ 1  2  0  0  2  0  1  0  2  1 -1  1  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 64900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  1 -1  1 -1  1  0  0 -1  1  0 -1  1] (Indices: [0, 2, 5, 9, 11, 13, 14, 15, 17, 18]), Candidate: [1 2 0 0 2 0 1 0 2 0 1 0 2 1 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 64950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  0  1  0  0  0  0 -1  1  0 -1  0  1] (Indices: [0, 2, 5, 10, 11, 12, 13, 14, 16, 17]), Candidate: [ 1  2  0  0  2  0  1  0  1  2  0  1  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  0  1  0 -1  0  1 -1  1  0  0  0  0] (Indices: [0, 2, 5, 10, 11, 14, 16, 17, 18, 19]), Candidate: [ 1  2  0  0  2  0  1  0  1  2  0  0  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  0  0  1  0 -1  0  1  0  0  0  0  0] (Indices: [0, 2, 5, 11, 12, 15, 16, 17, 18, 19]), Candidate: [1 2 0 0 2 0 1 0 1 1 1 1 0 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 65100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0  0  0 -1  1 -1  1  0 -1  0  0  0  1] (Indices: [0, 2, 6, 7, 8, 9, 10, 12, 14, 15]), Candidate: [ 1  2  0  0  1  2  1  0  1  1 -1  2  0  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0  0 -1  1  0  0  0 -1  0  0  0  0  1] (Indices: [0, 2, 6, 7, 8, 9, 11, 12, 13, 14]), Candidate: [ 1  2  0  0  1  2  1  0  1  0  1  1  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0  0 -1  1 -1  0  0  1 -1  1 -1  1  0] (Indices: [0, 2, 6, 7, 8, 9, 11, 15, 17, 19]), Candidate: [1 2 0 0 1 2 1 0 1 0 1 0 1 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 65250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0  0 -1  0  0  1  0 -1  0  0  1  0  0] (Indices: [0, 2, 6, 7, 8, 9, 13, 14, 18, 19]), Candidate: [ 1  2  0  0  1  2  1  0  1  0  0  1  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0 -1  1  0 -1  1  0 -1  0  0  1 -1  1] (Indices: [0, 2, 6, 7, 8, 10, 11, 13, 14, 18]), Candidate: [ 1  2  0  0  1  2  1  0  0  2  0  0  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0 -1  1 -1  1 -1  1  0 -1  0  0  1  0] (Indices: [0, 2, 6, 7, 8, 10, 12, 14, 15, 19]), Candidate: [ 1  2  0  0  1  2  1  0  0  2 -1  2  0  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0 -1  1 -1  0  0  0  1 -1  1  0  0  0] (Indices: [0, 2, 6, 7, 8, 10, 15, 17, 18, 19]), Candidate: [ 1  2  0  0  1  2  1  0  0  2 -1  1  1  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0 -1  0  1 -1  1 -1  1 -1  1  0 -1  1] (Indices: [0, 2, 6, 7, 8, 11, 13, 15, 17, 18]), Candidate: [1 2 0 0 1 2 1 0 0 1 1 0 2 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 65500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0 -1  0  0  1 -1  1 -1  1 -1  1  0  0] (Indices: [0, 2, 6, 7, 8, 12, 14, 16, 18, 19]), Candidate: [ 1  2  0  0  1  2  1  0  0  1  0  2  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  1  0  0 -1  1  0 -1  1 -1  0  0  1] (Indices: [0, 2, 6, 7, 9, 10, 11, 13, 14, 16]), Candidate: [ 1  2  0  0  1  2  1 -1  2  1  0  0  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 65600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  1  0 -1  1 -1  1  0 -1  1 -1  0  1] (Indices: [0, 2, 6, 7, 9, 10, 12, 14, 15, 17]), Candidate: [ 1  2  0  0  1  2  1 -1  2  1 -1  2  0  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 65650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  1  0 -1  0  0  0  1  0  0 -1  1  0] (Indices: [0, 2, 6, 7, 9, 10, 15, 16, 17, 19]), Candidate: [ 1  2  0  0  1  2  1 -1  2  1 -1  1  1  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 65700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  1 -1  1 -1  1 -1  1  0 -1  1 -1  1] (Indices: [0, 2, 6, 7, 9, 11, 13, 15, 16, 18]), Candidate: [ 1  2  0  0  1  2  1 -1  2  0  1  0  2  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  1 -1  0  1 -1  1 -1  1  0  0 -1  1] (Indices: [0, 2, 6, 7, 9, 12, 14, 16, 17, 18]), Candidate: [ 1  2  0  0  1  2  1 -1  2  0  0  2  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 65800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  0  1  0  0 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 2, 6, 7, 10, 11, 12, 14, 16, 18]), Candidate: [ 1  2  0  0  1  2  1 -1  1  2  0  1  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 65850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  0  1 -1  1  0  0  0  0 -1  0  0  1] (Indices: [0, 2, 6, 7, 10, 12, 13, 14, 15, 16]), Candidate: [ 1  2  0  0  1  2  1 -1  1  2 -1  2  1  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 65900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  0  1 -1  0  0  1  0  0  0  0 -1  1] (Indices: [0, 2, 6, 7, 10, 14, 15, 16, 17, 18]), Candidate: [ 1  2  0  0  1  2  1 -1  1  2 -1  1  1  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 65950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  0  0  1 -1  1  0 -1  0  1  0  0  0] (Indices: [0, 2, 6, 7, 11, 13, 14, 17, 18, 19]), Candidate: [ 1  2  0  0  1  2  1 -1  1  1  1  0  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 66000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1  0  0  0  0 -1  1 -1  0  0  0  1  0] (Indices: [0, 2, 6, 8, 9, 10, 11, 12, 14, 19]), Candidate: [ 1  2  0  0  1  2  0  1  1  1  0  1  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1  0  0 -1  1  0  0 -1  0  0  0  1  0] (Indices: [0, 2, 6, 8, 9, 10, 12, 13, 14, 19]), Candidate: [ 1  2  0  0  1  2  0  1  1  1 -1  2  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 66100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1  0  0 -1  0  1 -1  0  0  1  0  0  0] (Indices: [0, 2, 6, 8, 9, 10, 13, 17, 18, 19]), Candidate: [ 1  2  0  0  1  2  0  1  1  1 -1  1  2  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1  0 -1  1  0 -1  0  0  0  1  0  0  0] (Indices: [0, 2, 6, 8, 9, 11, 12, 17, 18, 19]), Candidate: [1 2 0 0 1 2 0 1 1 0 1 1 0 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 66200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1  0 -1  0  1  0 -1  1 -1  1 -1  1  0] (Indices: [0, 2, 6, 8, 9, 12, 13, 15, 17, 19]), Candidate: [1 2 0 0 1 2 0 1 1 0 0 2 1 0 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 66250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1 -1  1  0  0  0 -1  1 -1  0  0  1  0] (Indices: [0, 2, 6, 8, 10, 11, 12, 13, 15, 19]), Candidate: [1 2 0 0 1 2 0 1 0 2 0 1 1 0 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 66300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1 -1  1  0 -1  0  1  0 -1  1  0 -1  1] (Indices: [0, 2, 6, 8, 10, 11, 14, 15, 17, 18]), Candidate: [1 2 0 0 1 2 0 1 0 2 0 0 1 2 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 66350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1 -1  1 -1  0  1  0  0 -1  1  0 -1  1] (Indices: [0, 2, 6, 8, 10, 13, 14, 15, 17, 18]), Candidate: [ 1  2  0  0  1  2  0  1  0  2 -1  1  2  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1 -1  0  1  0 -1  0  1  0 -1  1  0  0] (Indices: [0, 2, 6, 8, 11, 12, 15, 16, 18, 19]), Candidate: [1 2 0 0 1 2 0 1 0 1 1 1 0 1 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 66450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1 -1  0  0  0  1 -1  1  0  0  0  0  0] (Indices: [0, 2, 6, 8, 13, 15, 16, 17, 18, 19]), Candidate: [1 2 0 0 1 2 0 1 0 1 0 1 2 0 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 66500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  1  0  0 -1  1 -1  1 -1  1  0 -1  1] (Indices: [0, 2, 6, 9, 10, 11, 13, 15, 17, 18]), Candidate: [1 2 0 0 1 2 0 0 2 1 0 0 2 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 66550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  1  0 -1  1 -1  1 -1  1 -1  1  0  0] (Indices: [0, 2, 6, 9, 10, 12, 14, 16, 18, 19]), Candidate: [ 1  2  0  0  1  2  0  0  2  1 -1  2  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 66600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  1 -1  1  0 -1  1  0  0 -1  0  1  0] (Indices: [0, 2, 6, 9, 11, 12, 14, 15, 16, 19]), Candidate: [1 2 0 0 1 2 0 0 2 0 1 1 0 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 66650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  1 -1  0  1 -1  1  0  0  0 -1  1  0] (Indices: [0, 2, 6, 9, 12, 14, 15, 16, 17, 19]), Candidate: [1 2 0 0 1 2 0 0 2 0 0 2 0 2 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 66700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  0  1  0 -1  1  0  0 -1  1  0 -1  1] (Indices: [0, 2, 6, 10, 11, 13, 14, 15, 17, 18]), Candidate: [1 2 0 0 1 2 0 0 1 2 0 0 2 1 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 66750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  0  0  1  0  0  0  0 -1  1 -1  1  0] (Indices: [0, 2, 6, 11, 12, 13, 14, 15, 17, 19]), Candidate: [1 2 0 0 1 2 0 0 1 1 1 1 1 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 66800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0  0  0  0  0 -1  0  0  0  1  0 -1  1] (Indices: [0, 2, 7, 8, 9, 10, 11, 12, 17, 18]), Candidate: [1 2 0 0 1 1 2 0 1 1 0 1 0 1 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 66850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0  0  0 -1  1  0 -1  0  0  1  0 -1  1] (Indices: [0, 2, 7, 8, 9, 10, 12, 13, 17, 18]), Candidate: [ 1  2  0  0  1  1  2  0  1  1 -1  2  1  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0  0  0 -1  0  0  1 -1  1  0 -1  1  0] (Indices: [0, 2, 7, 8, 9, 10, 14, 16, 17, 19]), Candidate: [ 1  2  0  0  1  1  2  0  1  1 -1  1  1  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 66950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0  0 -1  1 -1  1  0 -1  0  1  0 -1  1] (Indices: [0, 2, 7, 8, 9, 11, 13, 14, 17, 18]), Candidate: [ 1  2  0  0  1  1  2  0  1  0  1  0  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0  0 -1  0  1 -1  1  0  0 -1  0  1  0] (Indices: [0, 2, 7, 8, 9, 12, 14, 15, 16, 19]), Candidate: [1 2 0 0 1 1 2 0 1 0 0 2 0 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 67050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0 -1  1  0  0 -1  1  0 -1  1 -1  0  1] (Indices: [0, 2, 7, 8, 10, 11, 12, 14, 15, 17]), Candidate: [1 2 0 0 1 1 2 0 0 2 0 1 0 2 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 67100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0 -1  1  0 -1  0  0  1  0  0 -1  1  0] (Indices: [0, 2, 7, 8, 10, 11, 15, 16, 17, 19]), Candidate: [1 2 0 0 1 1 2 0 0 2 0 0 1 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 67150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0 -1  1 -1  0  1 -1  1  0  0 -1  1  0] (Indices: [0, 2, 7, 8, 10, 13, 15, 16, 17, 19]), Candidate: [ 1  2  0  0  1  1  2  0  0  2 -1  1  2  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0 -1  0  1 -1  1  0  0 -1  0  1  0  0] (Indices: [0, 2, 7, 8, 11, 13, 14, 15, 18, 19]), Candidate: [1 2 0 0 1 1 2 0 0 1 1 0 2 1 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 67250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  1  0  0  0  0 -1  1 -1  1 -1  0  1] (Indices: [0, 2, 7, 9, 10, 11, 12, 13, 15, 17]), Candidate: [ 1  2  0  0  1  1  2 -1  2  1  0  1  1  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  1  0  0 -1  0  1  0  0 -1  1 -1  1] (Indices: [0, 2, 7, 9, 10, 11, 14, 15, 16, 18]), Candidate: [ 1  2  0  0  1  1  2 -1  2  1  0  0  1  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  1  0 -1  0  1  0  0  0 -1  1 -1  1] (Indices: [0, 2, 7, 9, 10, 13, 14, 15, 16, 18]), Candidate: [ 1  2  0  0  1  1  2 -1  2  1 -1  1  2  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 67400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  1 -1  1  0 -1  0  1  0  0  0 -1  1] (Indices: [0, 2, 7, 9, 11, 12, 15, 16, 17, 18]), Candidate: [ 1  2  0  0  1  1  2 -1  2  0  1  1  0  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  1 -1  0  0  1  0  0 -1  1  0  0  0] (Indices: [0, 2, 7, 9, 13, 14, 15, 17, 18, 19]), Candidate: [ 1  2  0  0  1  1  2 -1  2  0  0  1  2  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  0  1  0 -1  1 -1  1  0  0 -1  1  0] (Indices: [0, 2, 7, 10, 11, 13, 15, 16, 17, 19]), Candidate: [ 1  2  0  0  1  1  2 -1  1  2  0  0  2  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  0  0  1  0  0 -1  1  0 -1  1  0  0] (Indices: [0, 2, 7, 11, 12, 13, 15, 16, 18, 19]), Candidate: [ 1  2  0  0  1  1  2 -1  1  1  1  1  1  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1  0  0  0  0 -1  0  1  0 -1  1 -1  1] (Indices: [0, 2, 8, 9, 10, 11, 12, 15, 16, 18]), Candidate: [1 2 0 0 1 1 1 1 1 1 0 1 0 1 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 67650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1  0  0 -1  1  0  0 -1  1 -1  0  1  0] (Indices: [0, 2, 8, 9, 10, 12, 13, 14, 16, 19]), Candidate: [ 1  2  0  0  1  1  1  1  1  1 -1  2  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 67700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1  0 -1  1  0  0  0  0  0 -1  0  0  1] (Indices: [0, 2, 8, 9, 11, 12, 13, 14, 15, 16]), Candidate: [1 2 0 0 1 1 1 1 1 0 1 1 1 1 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 67750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1  0 -1  1 -1  0  1  0  0  0  0 -1  1] (Indices: [0, 2, 8, 9, 11, 14, 15, 16, 17, 18]), Candidate: [1 2 0 0 1 1 1 1 1 0 1 0 1 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 67800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1 -1  1  0  0  0 -1  0  1  0  0 -1  1] (Indices: [0, 2, 8, 10, 11, 12, 13, 16, 17, 18]), Candidate: [1 2 0 0 1 1 1 1 0 2 0 1 1 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 67850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1 -1  1 -1  1  0 -1  1  0  0  0 -1  1] (Indices: [0, 2, 8, 10, 12, 13, 15, 16, 17, 18]), Candidate: [ 1  2  0  0  1  1  1  1  0  2 -1  2  1  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1 -1  0  0  1  0  0 -1  1  0  0  0  0] (Indices: [0, 2, 8, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  2  0  0  1  1  1  1  0  1  0  2  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  1  0  0 -1  1 -1  1  0  0 -1  1  0] (Indices: [0, 2, 9, 10, 11, 13, 15, 16, 17, 19]), Candidate: [1 2 0 0 1 1 1 0 2 1 0 0 2 0 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 68000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  1 -1  1  0  0 -1  1  0 -1  1  0  0] (Indices: [0, 2, 9, 11, 12, 13, 15, 16, 18, 19]), Candidate: [1 2 0 0 1 1 1 0 2 0 1 1 1 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 68050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  0  1  0 -1  1 -1  1  0  0  0  0  0] (Indices: [0, 2, 10, 11, 13, 15, 16, 17, 18, 19]), Candidate: [1 2 0 0 1 1 1 0 1 2 0 0 2 0 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 68100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0  0 -1  0  0  0  1 -1  1 -1  0  0  1] (Indices: [0, 3, 4, 5, 6, 7, 8, 9, 14, 16]), Candidate: [ 1  1  2  0  1  1  1  0  1  0  0  1  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0 -1  0  1  0  0 -1  0  0  0  0  0  1] (Indices: [0, 3, 4, 5, 6, 7, 8, 11, 12, 13]), Candidate: [1 1 2 0 1 1 1 0 0 1 1 1 1 0 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 68200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0 -1  0  0  0  1  0 -1  1 -1  0  0  1] (Indices: [0, 3, 4, 5, 6, 7, 8, 13, 14, 16]), Candidate: [ 1  1  2  0  1  1  1  0  0  1  0  1  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  1  0 -1  0  1 -1  1 -1  0  0  0  1] (Indices: [0, 3, 4, 5, 6, 7, 9, 10, 13, 15]), Candidate: [ 1  1  2  0  1  1  1 -1  2  1 -1  1  2  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  1 -1  0  1  0 -1  0  1 -1  0  0  1] (Indices: [0, 3, 4, 5, 6, 7, 9, 12, 13, 16]), Candidate: [ 1  1  2  0  1  1  1 -1  2  0  0  2  1  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  1 -1  0  0  0  0  0  1  0  0 -1  1] (Indices: [0, 3, 4, 5, 6, 7, 9, 16, 17, 18]), Candidate: [ 1  1  2  0  1  1  1 -1  2  0  0  1  1  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  0  1 -1  1 -1  0  0  0  1  0 -1  1] (Indices: [0, 3, 4, 5, 6, 7, 10, 12, 17, 18]), Candidate: [ 1  1  2  0  1  1  1 -1  1  2 -1  2  0  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  0  0  1  0 -1  0  1 -1  1 -1  0  1] (Indices: [0, 3, 4, 5, 6, 7, 11, 12, 15, 17]), Candidate: [ 1  1  2  0  1  1  1 -1  1  1  1  1  0  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  0  0  0  1  0 -1  1 -1  1 -1  0  1] (Indices: [0, 3, 4, 5, 6, 7, 12, 13, 15, 17]), Candidate: [ 1  1  2  0  1  1  1 -1  1  1  0  2  1  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  0  0  0  0  0  1  0  0 -1  1 -1  1] (Indices: [0, 3, 4, 5, 6, 7, 14, 15, 16, 18]), Candidate: [ 1  1  2  0  1  1  1 -1  1  1  0  1  1  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1  0 -1  1  0  0 -1  0  0  0  0  0  1] (Indices: [0, 3, 4, 5, 6, 8, 9, 11, 12, 13]), Candidate: [1 1 2 0 1 1 0 1 1 0 1 1 1 0 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 68650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1  0 -1  0  0  1  0 -1  1 -1  0  0  1] (Indices: [0, 3, 4, 5, 6, 8, 9, 13, 14, 16]), Candidate: [ 1  1  2  0  1  1  0  1  1  0  0  1  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1 -1  1  0 -1  0  1 -1  0  0  1 -1  1] (Indices: [0, 3, 4, 5, 6, 8, 10, 11, 14, 18]), Candidate: [ 1  1  2  0  1  1  0  1  0  2  0  0  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1 -1  1 -1  0  0  1  0 -1  0  1 -1  1] (Indices: [0, 3, 4, 5, 6, 8, 10, 14, 15, 18]), Candidate: [ 1  1  2  0  1  1  0  1  0  2 -1  1  1  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1 -1  0  1 -1  1 -1  0  1 -1  0  1  0] (Indices: [0, 3, 4, 5, 6, 8, 11, 13, 16, 19]), Candidate: [1 1 2 0 1 1 0 1 0 1 1 0 2 0 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 68850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1 -1  0  0  1 -1  0  1  0 -1  1 -1  1] (Indices: [0, 3, 4, 5, 6, 8, 12, 15, 16, 18]), Candidate: [1 1 2 0 1 1 0 1 0 1 0 2 0 1 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 68900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  1  0  0  0 -1  0  0  0  0  0  1  0] (Indices: [0, 3, 4, 5, 6, 9, 10, 11, 12, 19]), Candidate: [1 1 2 0 1 1 0 0 2 1 0 1 0 1 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 68950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  1  0 -1  0  1 -1  1 -1  0  1 -1  1] (Indices: [0, 3, 4, 5, 6, 9, 10, 13, 15, 18]), Candidate: [ 1  1  2  0  1  1  0  0  2  1 -1  1  2  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  1 -1  1 -1  1  0 -1  1 -1  0  0  1] (Indices: [0, 3, 4, 5, 6, 9, 11, 13, 14, 16]), Candidate: [ 1  1  2  0  1  1  0  0  2  0  1  0  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  1 -1  0  1 -1  1  0 -1  1 -1  0  1] (Indices: [0, 3, 4, 5, 6, 9, 12, 14, 15, 17]), Candidate: [1 1 2 0 1 1 0 0 2 0 0 2 0 2 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 69100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  1 -1  0  0  0  0  1  0  0 -1  1  0] (Indices: [0, 3, 4, 5, 6, 9, 15, 16, 17, 19]), Candidate: [1 1 2 0 1 1 0 0 2 0 0 1 1 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 69150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  0  1  0 -1  0  0  1  0  0 -1  0  1] (Indices: [0, 3, 4, 5, 6, 10, 11, 15, 16, 17]), Candidate: [1 1 2 0 1 1 0 0 1 2 0 0 1 1 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 69200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  0  1 -1  0  1  0 -1  1 -1  1 -1  1] (Indices: [0, 3, 4, 5, 6, 10, 13, 14, 16, 18]), Candidate: [ 1  1  2  0  1  1  0  0  1  2 -1  1  2  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 69250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  0  0  1  0 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 3, 4, 5, 6, 11, 12, 14, 16, 18]), Candidate: [ 1  1  2  0  1  1  0  0  1  1  1  1  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  0  0  0  1  0  0  0  0 -1  0  0  1] (Indices: [0, 3, 4, 5, 6, 12, 13, 14, 15, 16]), Candidate: [1 1 2 0 1 1 0 0 1 1 0 2 1 1 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 69350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  0  0  0  0  0  1  0  0  0  0 -1  1] (Indices: [0, 3, 4, 5, 6, 14, 15, 16, 17, 18]), Candidate: [1 1 2 0 1 1 0 0 1 1 0 1 1 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 69400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0  0 -1  1 -1  1 -1  1 -1  0  0  0  1] (Indices: [0, 3, 4, 5, 7, 8, 9, 11, 13, 15]), Candidate: [1 1 2 0 1 0 2 0 1 0 1 0 2 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 69450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0  0 -1  0  0  1 -1  0  1  0 -1  0  1] (Indices: [0, 3, 4, 5, 7, 8, 9, 13, 16, 17]), Candidate: [1 1 2 0 1 0 2 0 1 0 0 1 2 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 69500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0 -1  1  0 -1  0  0  0  1 -1  0  1  0] (Indices: [0, 3, 4, 5, 7, 8, 10, 11, 16, 19]), Candidate: [1 1 2 0 1 0 2 0 0 2 0 0 1 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 69550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0 -1  1 -1  0  0  0  1  0  0 -1  0  1] (Indices: [0, 3, 4, 5, 7, 8, 10, 15, 16, 17]), Candidate: [ 1  1  2  0  1  0  2  0  0  2 -1  1  1  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0 -1  0  1 -1  0  1 -1  1  0 -1  0  1] (Indices: [0, 3, 4, 5, 7, 8, 11, 14, 16, 17]), Candidate: [ 1  1  2  0  1  0  2  0  0  1  1  0  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0 -1  0  0  1 -1  0  0  0  1  0  0  0] (Indices: [0, 3, 4, 5, 7, 8, 12, 17, 18, 19]), Candidate: [1 1 2 0 1 0 2 0 0 1 0 2 0 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 69700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  1  0  0 -1  0  1 -1  1 -1  0  0  1] (Indices: [0, 3, 4, 5, 7, 9, 10, 11, 14, 16]), Candidate: [ 1  1  2  0  1  0  2 -1  2  1  0  0  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 69750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  1  0 -1  0  0  1  0  0 -1  0  0  1] (Indices: [0, 3, 4, 5, 7, 9, 10, 14, 15, 16]), Candidate: [ 1  1  2  0  1  0  2 -1  2  1 -1  1  1  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 69800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  1 -1  1 -1  1 -1  0  1  0 -1  0  1] (Indices: [0, 3, 4, 5, 7, 9, 11, 13, 16, 17]), Candidate: [ 1  1  2  0  1  0  2 -1  2  0  1  0  2  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  1 -1  0  1 -1  1 -1  0  0  1  0  0] (Indices: [0, 3, 4, 5, 7, 9, 12, 14, 18, 19]), Candidate: [ 1  1  2  0  1  0  2 -1  2  0  0  2  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 69900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  0  1  0  0  0 -1  0  0  0  1 -1  1] (Indices: [0, 3, 4, 5, 7, 10, 11, 12, 13, 18]), Candidate: [ 1  1  2  0  1  0  2 -1  1  2  0  1  1  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  0  1  0 -1  0  0  0  1 -1  1  0  0] (Indices: [0, 3, 4, 5, 7, 10, 11, 16, 18, 19]), Candidate: [ 1  1  2  0  1  0  2 -1  1  2  0  0  1  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  0  1 -1  0  1 -1  1 -1  1  0 -1  1] (Indices: [0, 3, 4, 5, 7, 10, 13, 15, 17, 18]), Candidate: [ 1  1  2  0  1  0  2 -1  1  2 -1  1  2  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 70050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  0  0  1  0 -1  0  1 -1  1  0 -1  1] (Indices: [0, 3, 4, 5, 7, 11, 12, 15, 17, 18]), Candidate: [ 1  1  2  0  1  0  2 -1  1  1  1  1  0  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  0  0  0  1  0  0 -1  0  1 -1  1  0] (Indices: [0, 3, 4, 5, 7, 12, 13, 14, 17, 19]), Candidate: [ 1  1  2  0  1  0  2 -1  1  1  0  2  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 70150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1  0  0  0  0 -1  0  1 -1  0  0  0  1] (Indices: [0, 3, 4, 5, 8, 9, 10, 11, 12, 15]), Candidate: [1 1 2 0 1 0 1 1 1 1 0 1 0 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 70200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1  0  0 -1  0  1  0 -1  0  0  1 -1  1] (Indices: [0, 3, 4, 5, 8, 9, 10, 13, 14, 18]), Candidate: [ 1  1  2  0  1  0  1  1  1  1 -1  1  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 70250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1  0 -1  1  0 -1  0  0  0  1  0 -1  1] (Indices: [0, 3, 4, 5, 8, 9, 11, 12, 17, 18]), Candidate: [1 1 2 0 1 0 1 1 1 0 1 1 0 1 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 70300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1  0 -1  0  1  0 -1  0  0  1  0 -1  1] (Indices: [0, 3, 4, 5, 8, 9, 12, 13, 17, 18]), Candidate: [1 1 2 0 1 0 1 1 1 0 0 2 1 0 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 70350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1  0 -1  0  0  0  1 -1  1  0 -1  1  0] (Indices: [0, 3, 4, 5, 8, 9, 14, 16, 17, 19]), Candidate: [ 1  1  2  0  1  0  1  1  1  0  0  1  1  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1 -1  1  0 -1  0  1 -1  1 -1  0  1  0] (Indices: [0, 3, 4, 5, 8, 10, 11, 14, 16, 19]), Candidate: [ 1  1  2  0  1  0  1  1  0  2  0  0  1  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1 -1  1 -1  0  1  0  0 -1  1 -1  0  1] (Indices: [0, 3, 4, 5, 8, 10, 13, 14, 15, 17]), Candidate: [ 1  1  2  0  1  0  1  1  0  2 -1  1  2  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1 -1  0  1  0 -1  1  0 -1  1 -1  0  1] (Indices: [0, 3, 4, 5, 8, 11, 12, 14, 15, 17]), Candidate: [1 1 2 0 1 0 1 1 0 1 1 1 0 2 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 70550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1 -1  0  1 -1  0  0  1  0  0 -1  1  0] (Indices: [0, 3, 4, 5, 8, 11, 15, 16, 17, 19]), Candidate: [1 1 2 0 1 0 1 1 0 1 1 0 1 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 70600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1 -1  0  0  0  1 -1  1  0  0 -1  1  0] (Indices: [0, 3, 4, 5, 8, 13, 15, 16, 17, 19]), Candidate: [1 1 2 0 1 0 1 1 0 1 0 1 2 0 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 70650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  1  0  0 -1  0  1 -1  1  0 -1  0  1] (Indices: [0, 3, 4, 5, 9, 10, 11, 14, 16, 17]), Candidate: [ 1  1  2  0  1  0  1  0  2  1  0  0  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  1  0 -1  1 -1  0  0  0  1  0  0  0] (Indices: [0, 3, 4, 5, 9, 10, 12, 17, 18, 19]), Candidate: [ 1  1  2  0  1  0  1  0  2  1 -1  2  0  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  1 -1  1  0  0 -1  0  0  0  1  0  0] (Indices: [0, 3, 4, 5, 9, 11, 12, 13, 18, 19]), Candidate: [1 1 2 0 1 0 1 0 2 0 1 1 1 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 70800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  1 -1  1 -1  0  1 -1  0  1  0  0  0] (Indices: [0, 3, 4, 5, 9, 11, 14, 17, 18, 19]), Candidate: [ 1  1  2  0  1  0  1  0  2  0  1  0  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  1 -1  0  0  1  0 -1  0  1  0  0  0] (Indices: [0, 3, 4, 5, 9, 13, 14, 17, 18, 19]), Candidate: [ 1  1  2  0  1  0  1  0  2  0  0  1  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  0  1  0 -1  1  0  0 -1  0  0  1  0] (Indices: [0, 3, 4, 5, 10, 11, 13, 14, 15, 19]), Candidate: [1 1 2 0 1 0 1 0 1 2 0 0 2 1 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 70950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  0  1 -1  1  0 -1  0  1 -1  1  0  0] (Indices: [0, 3, 4, 5, 10, 12, 13, 16, 18, 19]), Candidate: [ 1  1  2  0  1  0  1  0  1  2 -1  2  1  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  0  0  1  0  0 -1  1  0 -1  0  1  0] (Indices: [0, 3, 4, 5, 11, 12, 13, 15, 16, 19]), Candidate: [1 1 2 0 1 0 1 0 1 1 1 1 1 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 71050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  0  0  0  1  0  0 -1  1  0  0 -1  1] (Indices: [0, 3, 4, 5, 12, 13, 14, 16, 17, 18]), Candidate: [ 1  1  2  0  1  0  1  0  1  1  0  2  1  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0  0  0 -1  0  0  0  1 -1  0  1 -1  1] (Indices: [0, 3, 4, 6, 7, 8, 9, 10, 15, 18]), Candidate: [ 1  1  2  0  0  2  1  0  1  1 -1  1  1  1  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0  0 -1  0  1 -1  0  1 -1  0  0  1  0] (Indices: [0, 3, 4, 6, 7, 8, 9, 12, 15, 19]), Candidate: [1 1 2 0 0 2 1 0 1 0 0 2 0 1 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 71200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0 -1  1  0 -1  1 -1  1 -1  0  0  0  1] (Indices: [0, 3, 4, 6, 7, 8, 10, 11, 13, 15]), Candidate: [1 1 2 0 0 2 1 0 0 2 0 0 2 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 71250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0 -1  1 -1  0  1 -1  0  1  0 -1  0  1] (Indices: [0, 3, 4, 6, 7, 8, 10, 13, 16, 17]), Candidate: [ 1  1  2  0  0  2  1  0  0  2 -1  1  2  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0 -1  0  1 -1  1  0 -1  0  0  1 -1  1] (Indices: [0, 3, 4, 6, 7, 8, 11, 13, 14, 18]), Candidate: [ 1  1  2  0  0  2  1  0  0  1  1  0  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0 -1  0  0  1 -1  1  0 -1  0  0  1  0] (Indices: [0, 3, 4, 6, 7, 8, 12, 14, 15, 19]), Candidate: [1 1 2 0 0 2 1 0 0 1 0 2 0 2 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 71400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0 -1  0  0  0  0  0  1 -1  1  0  0  0] (Indices: [0, 3, 4, 6, 7, 8, 15, 17, 18, 19]), Candidate: [1 1 2 0 0 2 1 0 0 1 0 1 1 1 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 71450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  1  0 -1  1 -1  0  0  0  0  1  0  0] (Indices: [0, 3, 4, 6, 7, 9, 10, 12, 18, 19]), Candidate: [ 1  1  2  0  0  2  1 -1  2  1 -1  2  0  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 71500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  1 -1  1  0 -1  0  1 -1  0  0  1  0] (Indices: [0, 3, 4, 6, 7, 9, 11, 12, 15, 19]), Candidate: [ 1  1  2  0  0  2  1 -1  2  0  1  1  0  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  1 -1  0  1  0 -1  1 -1  0  0  1  0] (Indices: [0, 3, 4, 6, 7, 9, 12, 13, 15, 19]), Candidate: [ 1  1  2  0  0  2  1 -1  2  0  0  2  1  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  1 -1  0  0  0  1  0 -1  1  0 -1  1] (Indices: [0, 3, 4, 6, 7, 9, 14, 15, 17, 18]), Candidate: [ 1  1  2  0  0  2  1 -1  2  0  0  1  1  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  0  1  0 -1  0  1  0 -1  0  1 -1  1] (Indices: [0, 3, 4, 6, 7, 10, 11, 14, 15, 18]), Candidate: [ 1  1  2  0  0  2  1 -1  1  2  0  0  1  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  0  1 -1  1 -1  0  0  1  0 -1  1  0] (Indices: [0, 3, 4, 6, 7, 10, 12, 16, 17, 19]), Candidate: [ 1  1  2  0  0  2  1 -1  1  2 -1  2  0  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 71750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  0  0  1  0  0 -1  0  0  1  0 -1  1] (Indices: [0, 3, 4, 6, 7, 11, 12, 13, 17, 18]), Candidate: [ 1  1  2  0  0  2  1 -1  1  1  1  1  1  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  0  0  1 -1  0  1 -1  1  0 -1  1  0] (Indices: [0, 3, 4, 6, 7, 11, 14, 16, 17, 19]), Candidate: [ 1  1  2  0  0  2  1 -1  1  1  1  0  1  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 71850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  0  0  0  0  1  0 -1  1  0 -1  1  0] (Indices: [0, 3, 4, 6, 7, 13, 14, 16, 17, 19]), Candidate: [ 1  1  2  0  0  2  1 -1  1  1  0  1  2  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 71900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1  0  0 -1  1 -1  1 -1  0  1 -1  0  1] (Indices: [0, 3, 4, 6, 8, 9, 10, 12, 14, 17]), Candidate: [ 1  1  2  0  0  2  0  1  1  1 -1  2  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 71950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1  0 -1  1  0  0 -1  0  1 -1  0  0  1] (Indices: [0, 3, 4, 6, 8, 9, 11, 12, 13, 16]), Candidate: [1 1 2 0 0 2 0 1 1 0 1 1 1 0 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 72000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1  0 -1  1 -1  0  0  0  1  0  0 -1  1] (Indices: [0, 3, 4, 6, 8, 9, 11, 16, 17, 18]), Candidate: [1 1 2 0 0 2 0 1 1 0 1 0 1 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 72050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1  0 -1  0  0  1 -1  1  0 -1  1 -1  1] (Indices: [0, 3, 4, 6, 8, 9, 13, 15, 16, 18]), Candidate: [1 1 2 0 0 2 0 1 1 0 0 1 2 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 72100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1 -1  1  0 -1  1 -1  1  0 -1  0  0  1] (Indices: [0, 3, 4, 6, 8, 10, 11, 13, 15, 16]), Candidate: [1 1 2 0 0 2 0 1 0 2 0 0 2 0 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 72150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1 -1  1 -1  1 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 3, 4, 6, 8, 10, 12, 14, 16, 18]), Candidate: [ 1  1  2  0  0  2  0  1  0  2 -1  2  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 72200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1 -1  0  1  0  0  0  0 -1  0  0  0  1] (Indices: [0, 3, 4, 6, 8, 11, 12, 13, 14, 15]), Candidate: [1 1 2 0 0 2 0 1 0 1 1 1 1 1 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 72250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1 -1  0  1 -1  1 -1  1 -1  0  1  0  0] (Indices: [0, 3, 4, 6, 8, 11, 13, 15, 18, 19]), Candidate: [1 1 2 0 0 2 0 1 0 1 1 0 2 0 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 72300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1 -1  0  0  1 -1  0  1  0  0  0 -1  1] (Indices: [0, 3, 4, 6, 8, 12, 15, 16, 17, 18]), Candidate: [1 1 2 0 0 2 0 1 0 1 0 2 0 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 72350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  1  0  0 -1  1  0 -1  0  0  1 -1  1] (Indices: [0, 3, 4, 6, 9, 10, 11, 13, 14, 18]), Candidate: [ 1  1  2  0  0  2  0  0  2  1  0  0  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  1  0 -1  1 -1  1  0 -1  0  0  1  0] (Indices: [0, 3, 4, 6, 9, 10, 12, 14, 15, 19]), Candidate: [ 1  1  2  0  0  2  0  0  2  1 -1  2  0  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  1  0 -1  0  0  0  1 -1  1  0  0  0] (Indices: [0, 3, 4, 6, 9, 10, 15, 17, 18, 19]), Candidate: [ 1  1  2  0  0  2  0  0  2  1 -1  1  1  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  1 -1  1 -1  1 -1  1 -1  1  0 -1  1] (Indices: [0, 3, 4, 6, 9, 11, 13, 15, 17, 18]), Candidate: [1 1 2 0 0 2 0 0 2 0 1 0 2 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 72550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  1 -1  0  1 -1  1 -1  1 -1  1  0  0] (Indices: [0, 3, 4, 6, 9, 12, 14, 16, 18, 19]), Candidate: [ 1  1  2  0  0  2  0  0  2  0  0  2  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  0  1  0  0 -1  1 -1  0  1  0 -1  1] (Indices: [0, 3, 4, 6, 10, 11, 12, 14, 17, 18]), Candidate: [ 1  1  2  0  0  2  0  0  1  2  0  1  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  0  1 -1  1  0  0  0 -1  0  1 -1  1] (Indices: [0, 3, 4, 6, 10, 12, 13, 14, 15, 18]), Candidate: [ 1  1  2  0  0  2  0  0  1  2 -1  2  1  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  0  1 -1  0  0  1  0  0 -1  1  0  0] (Indices: [0, 3, 4, 6, 10, 14, 15, 16, 18, 19]), Candidate: [ 1  1  2  0  0  2  0  0  1  2 -1  1  1  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  0  0  1 -1  1 -1  1  0  0 -1  1  0] (Indices: [0, 3, 4, 6, 11, 13, 15, 16, 17, 19]), Candidate: [1 1 2 0 0 2 0 0 1 1 1 0 2 0 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 72800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0  0  0  0 -1  1 -1  0  0  0  0  1  0] (Indices: [0, 3, 4, 7, 8, 9, 10, 11, 13, 19]), Candidate: [1 1 2 0 0 1 2 0 1 1 0 0 2 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 72850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0  0  0 -1  0  1 -1  0  0  1 -1  1  0] (Indices: [0, 3, 4, 7, 8, 9, 10, 13, 17, 19]), Candidate: [ 1  1  2  0  0  1  2  0  1  1 -1  1  2  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0  0 -1  1 -1  1 -1  1 -1  0  1 -1  1] (Indices: [0, 3, 4, 7, 8, 9, 11, 13, 15, 18]), Candidate: [1 1 2 0 0 1 2 0 1 0 1 0 2 0 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 72950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0  0 -1  0  1 -1  1 -1  0  1  0 -1  1] (Indices: [0, 3, 4, 7, 8, 9, 12, 14, 17, 18]), Candidate: [ 1  1  2  0  0  1  2  0  1  0  0  2  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0 -1  1  0  0  0 -1  0  1 -1  0  0  1] (Indices: [0, 3, 4, 7, 8, 10, 11, 12, 13, 16]), Candidate: [1 1 2 0 0 1 2 0 0 2 0 1 1 0 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 73050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0 -1  1  0 -1  0  0  0  1  0  0 -1  1] (Indices: [0, 3, 4, 7, 8, 10, 11, 16, 17, 18]), Candidate: [1 1 2 0 0 1 2 0 0 2 0 0 1 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 73100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0 -1  1 -1  0  1 -1  1  0 -1  1 -1  1] (Indices: [0, 3, 4, 7, 8, 10, 13, 15, 16, 18]), Candidate: [ 1  1  2  0  0  1  2  0  0  2 -1  1  2  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0 -1  0  1  0 -1  0  1  0 -1  1 -1  1] (Indices: [0, 3, 4, 7, 8, 11, 12, 15, 16, 18]), Candidate: [1 1 2 0 0 1 2 0 0 1 1 1 0 1 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 73200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0 -1  0  0  1  0  0 -1  1 -1  0  1  0] (Indices: [0, 3, 4, 7, 8, 12, 13, 14, 16, 19]), Candidate: [ 1  1  2  0  0  1  2  0  0  1  0  2  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  1  0  0  0  0  0 -1  0  0  0  0  1] (Indices: [0, 3, 4, 7, 9, 10, 11, 12, 13, 14]), Candidate: [ 1  1  2  0  0  1  2 -1  2  1  0  1  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 73300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  1  0  0 -1  0  0  1 -1  1 -1  1  0] (Indices: [0, 3, 4, 7, 9, 10, 11, 15, 17, 19]), Candidate: [ 1  1  2  0  0  1  2 -1  2  1  0  0  1  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  1  0 -1  0  1  0 -1  0  0  1  0  0] (Indices: [0, 3, 4, 7, 9, 10, 13, 14, 18, 19]), Candidate: [ 1  1  2  0  0  1  2 -1  2  1 -1  1  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 73400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  1 -1  1  0 -1  1 -1  0  0  1  0  0] (Indices: [0, 3, 4, 7, 9, 11, 12, 14, 18, 19]), Candidate: [ 1  1  2  0  0  1  2 -1  2  0  1  1  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 73450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  1 -1  0  1  0  0 -1  1  0 -1  0  1] (Indices: [0, 3, 4, 7, 9, 12, 13, 14, 16, 17]), Candidate: [ 1  1  2  0  0  1  2 -1  2  0  0  2  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 73500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  1 -1  0  0  0  1 -1  1  0  0  0  0] (Indices: [0, 3, 4, 7, 9, 14, 16, 17, 18, 19]), Candidate: [ 1  1  2  0  0  1  2 -1  2  0  0  1  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 73550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  0  1  0 -1  1 -1  1 -1  1  0 -1  1] (Indices: [0, 3, 4, 7, 10, 11, 13, 15, 17, 18]), Candidate: [ 1  1  2  0  0  1  2 -1  1  2  0  0  2  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  0  1 -1  1 -1  1 -1  1 -1  1  0  0] (Indices: [0, 3, 4, 7, 10, 12, 14, 16, 18, 19]), Candidate: [ 1  1  2  0  0  1  2 -1  1  2 -1  2  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 73650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  0  0  1  0 -1  1  0  0 -1  0  1  0] (Indices: [0, 3, 4, 7, 11, 12, 14, 15, 16, 19]), Candidate: [ 1  1  2  0  0  1  2 -1  1  1  1  1  0  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  0  0  0  1 -1  1  0  0  0 -1  1  0] (Indices: [0, 3, 4, 7, 12, 14, 15, 16, 17, 19]), Candidate: [ 1  1  2  0  0  1  2 -1  1  1  0  2  0  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1  0  0  0 -1  0  1  0 -1  0  1 -1  1] (Indices: [0, 3, 4, 8, 9, 10, 11, 14, 15, 18]), Candidate: [1 1 2 0 0 1 1 1 1 1 0 0 1 2 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 73800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1  0  0 -1  1 -1  0  0  1  0 -1  1  0] (Indices: [0, 3, 4, 8, 9, 10, 12, 16, 17, 19]), Candidate: [ 1  1  2  0  0  1  1  1  1  1 -1  2  0  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1  0 -1  1  0  0 -1  0  0  1  0 -1  1] (Indices: [0, 3, 4, 8, 9, 11, 12, 13, 17, 18]), Candidate: [1 1 2 0 0 1 1 1 1 0 1 1 1 0 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 73900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1  0 -1  1 -1  0  1 -1  1  0 -1  1  0] (Indices: [0, 3, 4, 8, 9, 11, 14, 16, 17, 19]), Candidate: [ 1  1  2  0  0  1  1  1  1  0  1  0  1  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1  0 -1  0  0  1  0 -1  1  0 -1  1  0] (Indices: [0, 3, 4, 8, 9, 13, 14, 16, 17, 19]), Candidate: [ 1  1  2  0  0  1  1  1  1  0  0  1  2  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1 -1  1  0 -1  1  0  0 -1  1 -1  0  1] (Indices: [0, 3, 4, 8, 10, 11, 13, 14, 15, 17]), Candidate: [1 1 2 0 0 1 1 1 0 2 0 0 2 1 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 74050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1 -1  1 -1  1  0 -1  0  1  0  0 -1  1] (Indices: [0, 3, 4, 8, 10, 12, 13, 16, 17, 18]), Candidate: [ 1  1  2  0  0  1  1  1  0  2 -1  2  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1 -1  0  1  0  0 -1  1  0  0 -1  0  1] (Indices: [0, 3, 4, 8, 11, 12, 13, 15, 16, 17]), Candidate: [1 1 2 0 0 1 1 1 0 1 1 1 1 0 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 74150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1 -1  0  0  1  0  0  0 -1  1 -1  1  0] (Indices: [0, 3, 4, 8, 12, 13, 14, 15, 17, 19]), Candidate: [1 1 2 0 0 1 1 1 0 1 0 2 1 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 74200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  1  0  0  0 -1  0  1  0 -1  1 -1  1] (Indices: [0, 3, 4, 9, 10, 11, 12, 15, 16, 18]), Candidate: [1 1 2 0 0 1 1 0 2 1 0 1 0 1 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 74250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  1  0 -1  1  0  0 -1  1 -1  0  1  0] (Indices: [0, 3, 4, 9, 10, 12, 13, 14, 16, 19]), Candidate: [ 1  1  2  0  0  1  1  0  2  1 -1  2  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 74300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  1 -1  1  0  0  0  0  0 -1  0  0  1] (Indices: [0, 3, 4, 9, 11, 12, 13, 14, 15, 16]), Candidate: [1 1 2 0 0 1 1 0 2 0 1 1 1 1 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 74350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  1 -1  1 -1  0  1  0  0  0  0 -1  1] (Indices: [0, 3, 4, 9, 11, 14, 15, 16, 17, 18]), Candidate: [1 1 2 0 0 1 1 0 2 0 1 0 1 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 74400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  0  1  0  0  0 -1  0  1  0  0 -1  1] (Indices: [0, 3, 4, 10, 11, 12, 13, 16, 17, 18]), Candidate: [1 1 2 0 0 1 1 0 1 2 0 1 1 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 74450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  0  1 -1  1  0 -1  1  0  0  0 -1  1] (Indices: [0, 3, 4, 10, 12, 13, 15, 16, 17, 18]), Candidate: [ 1  1  2  0  0  1  1  0  1  2 -1  2  1  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  0  0  0  1  0  0 -1  1  0  0  0  0] (Indices: [0, 3, 4, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  1  2  0  0  1  1  0  1  1  0  2  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0  0 -1  1 -1  1 -1  0  0  1 -1  0  1] (Indices: [0, 3, 5, 6, 7, 8, 9, 11, 13, 17]), Candidate: [ 1  1  2 -1  2  1  1  0  1  0  1  0  2  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0  0 -1  0  0  1 -1  0  1 -1  0  1  0] (Indices: [0, 3, 5, 6, 7, 8, 9, 13, 16, 19]), Candidate: [ 1  1  2 -1  2  1  1  0  1  0  0  1  2  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0 -1  1  0 -1  0  0  0  0  1 -1  1  0] (Indices: [0, 3, 5, 6, 7, 8, 10, 11, 17, 19]), Candidate: [ 1  1  2 -1  2  1  1  0  0  2  0  0  1  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0 -1  1 -1  0  0  0  1  0 -1  0  1  0] (Indices: [0, 3, 5, 6, 7, 8, 10, 15, 16, 19]), Candidate: [ 1  1  2 -1  2  1  1  0  0  2 -1  1  1  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 74750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0 -1  0  1 -1  0  1 -1  1 -1  0  1  0] (Indices: [0, 3, 5, 6, 7, 8, 11, 14, 16, 19]), Candidate: [ 1  1  2 -1  2  1  1  0  0  1  1  0  1  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 74800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0 -1  0  0  0  1  0  0 -1  1 -1  0  1] (Indices: [0, 3, 5, 6, 7, 8, 13, 14, 15, 17]), Candidate: [ 1  1  2 -1  2  1  1  0  0  1  0  1  2  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  1  0  0 -1  0  1 -1  0  0  1 -1  1] (Indices: [0, 3, 5, 6, 7, 9, 10, 11, 14, 18]), Candidate: [ 1  1  2 -1  2  1  1 -1  2  1  0  0  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 74900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  1  0 -1  0  0  1  0 -1  0  1 -1  1] (Indices: [0, 3, 5, 6, 7, 9, 10, 14, 15, 18]), Candidate: [ 1  1  2 -1  2  1  1 -1  2  1 -1  1  1  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 74950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  1 -1  1 -1  1 -1  0  1 -1  0  1  0] (Indices: [0, 3, 5, 6, 7, 9, 11, 13, 16, 19]), Candidate: [ 1  1  2 -1  2  1  1 -1  2  0  1  0  2  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 75000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  1 -1  0  1 -1  0  1  0 -1  1 -1  1] (Indices: [0, 3, 5, 6, 7, 9, 12, 15, 16, 18]), Candidate: [ 1  1  2 -1  2  1  1 -1  2  0  0  2  0  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 75050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  0  1  0  0 -1  1  0 -1  0  0  0  1] (Indices: [0, 3, 5, 6, 7, 10, 11, 12, 14, 15]), Candidate: [ 1  1  2 -1  2  1  1 -1  1  2  0  1  0  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 75100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  0  1 -1  1  0  0  0 -1  0  0  0  1] (Indices: [0, 3, 5, 6, 7, 10, 12, 13, 14, 15]), Candidate: [ 1  1  2 -1  2  1  1 -1  1  2 -1  2  1  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 75150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  0  1 -1  0  1 -1  1 -1  0  1  0  0] (Indices: [0, 3, 5, 6, 7, 10, 13, 15, 18, 19]), Candidate: [ 1  1  2 -1  2  1  1 -1  1  2 -1  1  2  0  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 75200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  0  0  1  0 -1  0  1 -1  0  1  0  0] (Indices: [0, 3, 5, 6, 7, 11, 12, 15, 18, 19]), Candidate: [ 1  1  2 -1  2  1  1 -1  1  1  1  1  0  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 75250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  0  0  0  1  0 -1  1  0  0 -1  0  1] (Indices: [0, 3, 5, 6, 7, 12, 13, 15, 16, 17]), Candidate: [ 1  1  2 -1  2  1  1 -1  1  1  0  2  1  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 75300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1  0  0  0  0 -1  0  0  0  1 -1  0  1] (Indices: [0, 3, 5, 6, 8, 9, 10, 11, 12, 17]), Candidate: [ 1  1  2 -1  2  1  0  1  1  1  0  1  0  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1  0  0 -1  0  1 -1  1  0 -1  0  0  1] (Indices: [0, 3, 5, 6, 8, 9, 10, 13, 15, 16]), Candidate: [ 1  1  2 -1  2  1  0  1  1  1 -1  1  2  0  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 75400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1  0 -1  1  0 -1  0  0  0  0  1  0  0] (Indices: [0, 3, 5, 6, 8, 9, 11, 12, 18, 19]), Candidate: [ 1  1  2 -1  2  1  0  1  1  0  1  1  0  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1  0 -1  0  1  0 -1  0  0  0  1  0  0] (Indices: [0, 3, 5, 6, 8, 9, 12, 13, 18, 19]), Candidate: [ 1  1  2 -1  2  1  0  1  1  0  0  2  1  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1  0 -1  0  0  0  1 -1  0  1  0  0  0] (Indices: [0, 3, 5, 6, 8, 9, 14, 17, 18, 19]), Candidate: [ 1  1  2 -1  2  1  0  1  1  0  0  1  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 75550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1 -1  1  0 -1  0  1 -1  0  1 -1  1  0] (Indices: [0, 3, 5, 6, 8, 10, 11, 14, 17, 19]), Candidate: [ 1  1  2 -1  2  1  0  1  0  2  0  0  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 75600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1 -1  1 -1  0  1  0  0 -1  0  0  1  0] (Indices: [0, 3, 5, 6, 8, 10, 13, 14, 15, 19]), Candidate: [ 1  1  2 -1  2  1  0  1  0  2 -1  1  2  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 75650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1 -1  0  1  0 -1  1  0 -1  0  0  1  0] (Indices: [0, 3, 5, 6, 8, 11, 12, 14, 15, 19]), Candidate: [ 1  1  2 -1  2  1  0  1  0  1  1  1  0  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1 -1  0  1 -1  0  0  1 -1  1  0  0  0] (Indices: [0, 3, 5, 6, 8, 11, 15, 17, 18, 19]), Candidate: [ 1  1  2 -1  2  1  0  1  0  1  1  0  1  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1 -1  0  0  0  1 -1  1 -1  1  0  0  0] (Indices: [0, 3, 5, 6, 8, 13, 15, 17, 18, 19]), Candidate: [ 1  1  2 -1  2  1  0  1  0  1  0  1  2  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  1  0  0 -1  0  1 -1  1 -1  0  1  0] (Indices: [0, 3, 5, 6, 9, 10, 11, 14, 16, 19]), Candidate: [ 1  1  2 -1  2  1  0  0  2  1  0  0  1  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 75850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  1  0 -1  0  1  0  0 -1  1 -1  0  1] (Indices: [0, 3, 5, 6, 9, 10, 13, 14, 15, 17]), Candidate: [ 1  1  2 -1  2  1  0  0  2  1 -1  1  2  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 75900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  1 -1  1  0 -1  1  0 -1  1 -1  0  1] (Indices: [0, 3, 5, 6, 9, 11, 12, 14, 15, 17]), Candidate: [ 1  1  2 -1  2  1  0  0  2  0  1  1  0  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  1 -1  1 -1  0  0  1  0  0 -1  1  0] (Indices: [0, 3, 5, 6, 9, 11, 15, 16, 17, 19]), Candidate: [ 1  1  2 -1  2  1  0  0  2  0  1  0  1  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  1 -1  0  0  1 -1  1  0  0 -1  1  0] (Indices: [0, 3, 5, 6, 9, 13, 15, 16, 17, 19]), Candidate: [ 1  1  2 -1  2  1  0  0  2  0  0  1  2  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  0  1  0 -1  1  0 -1  1 -1  1 -1  1] (Indices: [0, 3, 5, 6, 10, 11, 13, 14, 16, 18]), Candidate: [ 1  1  2 -1  2  1  0  0  1  2  0  0  2  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 76100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  0  1 -1  1 -1  1  0  0  0 -1  0  1] (Indices: [0, 3, 5, 6, 10, 12, 14, 15, 16, 17]), Candidate: [ 1  1  2 -1  2  1  0  0  1  2 -1  2  0  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 76150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  0  0  1  0  0 -1  1 -1  1 -1  1  0] (Indices: [0, 3, 5, 6, 11, 12, 13, 15, 17, 19]), Candidate: [ 1  1  2 -1  2  1  0  0  1  1  1  1  1  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  0  0  0  1  0  0 -1  1 -1  1  0  0] (Indices: [0, 3, 5, 6, 12, 13, 14, 16, 18, 19]), Candidate: [ 1  1  2 -1  2  1  0  0  1  1  0  2  1  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 76250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0  0  0 -1  1  0 -1  0  1 -1  0  0  1] (Indices: [0, 3, 5, 7, 8, 9, 10, 12, 13, 16]), Candidate: [ 1  1  2 -1  2  0  2  0  1  1 -1  2  1  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 76300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0  0  0 -1  0  0  0  0  1  0  0 -1  1] (Indices: [0, 3, 5, 7, 8, 9, 10, 16, 17, 18]), Candidate: [ 1  1  2 -1  2  0  2  0  1  1 -1  1  1  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 76350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0  0 -1  1 -1  0  0  1  0  0 -1  0  1] (Indices: [0, 3, 5, 7, 8, 9, 11, 15, 16, 17]), Candidate: [ 1  1  2 -1  2  0  2  0  1  0  1  0  1  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0  0 -1  0  0  1  0 -1  1 -1  1 -1  1] (Indices: [0, 3, 5, 7, 8, 9, 13, 14, 16, 18]), Candidate: [ 1  1  2 -1  2  0  2  0  1  0  0  1  2  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 76450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0 -1  1  0  0 -1  0  0  0  0  1  0  0] (Indices: [0, 3, 5, 7, 8, 10, 11, 12, 18, 19]), Candidate: [ 1  1  2 -1  2  0  2  0  0  2  0  1  0  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0 -1  1 -1  1  0 -1  0  0  0  1  0  0] (Indices: [0, 3, 5, 7, 8, 10, 12, 13, 18, 19]), Candidate: [ 1  1  2 -1  2  0  2  0  0  2 -1  2  1  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 76550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0 -1  1 -1  0  0  1 -1  0  1  0  0  0] (Indices: [0, 3, 5, 7, 8, 10, 14, 17, 18, 19]), Candidate: [ 1  1  2 -1  2  0  2  0  0  2 -1  1  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 76600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0 -1  0  1 -1  1  0 -1  0  0  1  0  0] (Indices: [0, 3, 5, 7, 8, 11, 13, 14, 18, 19]), Candidate: [ 1  1  2 -1  2  0  2  0  0  1  1  0  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 76650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0 -1  0  0  1 -1  1  0 -1  1 -1  1  0] (Indices: [0, 3, 5, 7, 8, 12, 14, 15, 17, 19]), Candidate: [ 1  1  2 -1  2  0  2  0  0  1  0  2  0  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  1  0  0  0 -1  0  0  0  1  0 -1  1] (Indices: [0, 3, 5, 7, 9, 10, 11, 12, 17, 18]), Candidate: [ 1  1  2 -1  2  0  2 -1  2  1  0  1  0  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 76750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  1  0 -1  1  0 -1  0  0  1  0 -1  1] (Indices: [0, 3, 5, 7, 9, 10, 12, 13, 17, 18]), Candidate: [ 1  1  2 -1  2  0  2 -1  2  1 -1  2  1  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 76800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  1  0 -1  0  0  1 -1  1  0 -1  1  0] (Indices: [0, 3, 5, 7, 9, 10, 14, 16, 17, 19]), Candidate: [ 1  1  2 -1  2  0  2 -1  2  1 -1  1  1  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 76850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  1 -1  1 -1  1  0 -1  0  1  0 -1  1] (Indices: [0, 3, 5, 7, 9, 11, 13, 14, 17, 18]), Candidate: [ 1  1  2 -1  2  0  2 -1  2  0  1  0  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 76900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  1 -1  0  1 -1  1  0  0 -1  0  1  0] (Indices: [0, 3, 5, 7, 9, 12, 14, 15, 16, 19]), Candidate: [ 1  1  2 -1  2  0  2 -1  2  0  0  2  0  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 76950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  0  1  0  0 -1  1  0 -1  1 -1  0  1] (Indices: [0, 3, 5, 7, 10, 11, 12, 14, 15, 17]), Candidate: [ 1  1  2 -1  2  0  2 -1  1  2  0  1  0  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 77000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  0  1  0 -1  0  0  1  0  0 -1  1  0] (Indices: [0, 3, 5, 7, 10, 11, 15, 16, 17, 19]), Candidate: [ 1  1  2 -1  2  0  2 -1  1  2  0  0  1  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 77050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  0  1 -1  0  1 -1  1  0  0 -1  1  0] (Indices: [0, 3, 5, 7, 10, 13, 15, 16, 17, 19]), Candidate: [ 1  1  2 -1  2  0  2 -1  1  2 -1  1  2  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 77100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  0  0  1 -1  1  0  0 -1  0  1  0  0] (Indices: [0, 3, 5, 7, 11, 13, 14, 15, 18, 19]), Candidate: [ 1  1  2 -1  2  0  2 -1  1  1  1  0  2  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 77150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1  0  0  0  0 -1  1  0 -1  0  0  0  1] (Indices: [0, 3, 5, 8, 9, 10, 11, 12, 14, 15]), Candidate: [ 1  1  2 -1  2  0  1  1  1  1  0  1  0  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1  0  0 -1  1  0  0  0 -1  0  0  0  1] (Indices: [0, 3, 5, 8, 9, 10, 12, 13, 14, 15]), Candidate: [ 1  1  2 -1  2  0  1  1  1  1 -1  2  1  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 77250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1  0  0 -1  0  1 -1  1 -1  0  1  0  0] (Indices: [0, 3, 5, 8, 9, 10, 13, 15, 18, 19]), Candidate: [ 1  1  2 -1  2  0  1  1  1  1 -1  1  2  0  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 77300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1  0 -1  1  0 -1  0  1 -1  0  1  0  0] (Indices: [0, 3, 5, 8, 9, 11, 12, 15, 18, 19]), Candidate: [ 1  1  2 -1  2  0  1  1  1  0  1  1  0  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1  0 -1  0  1  0 -1  1  0  0 -1  0  1] (Indices: [0, 3, 5, 8, 9, 12, 13, 15, 16, 17]), Candidate: [ 1  1  2 -1  2  0  1  1  1  0  0  2  1  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1 -1  1  0  0  0  0 -1  0  0  0  1  0] (Indices: [0, 3, 5, 8, 10, 11, 12, 13, 14, 19]), Candidate: [ 1  1  2 -1  2  0  1  1  0  2  0  1  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 77450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1 -1  1  0 -1  1 -1  0  0  1  0  0  0] (Indices: [0, 3, 5, 8, 10, 11, 13, 17, 18, 19]), Candidate: [ 1  1  2 -1  2  0  1  1  0  2  0  0  2  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1 -1  1 -1  1 -1  0  0  1  0  0  0  0] (Indices: [0, 3, 5, 8, 10, 12, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  2  0  1  1  0  2 -1  2  0  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 77550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1 -1  0  1  0 -1  1 -1  1 -1  1  0  0] (Indices: [0, 3, 5, 8, 11, 12, 14, 16, 18, 19]), Candidate: [ 1  1  2 -1  2  0  1  1  0  1  1  1  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 77600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1 -1  0  0  0  1  0  0  0  0 -1  1  0] (Indices: [0, 3, 5, 8, 13, 14, 15, 16, 17, 19]), Candidate: [ 1  1  2 -1  2  0  1  1  0  1  0  1  2  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  1  0  0 -1  1  0 -1  0  0  1  0  0] (Indices: [0, 3, 5, 9, 10, 11, 13, 14, 18, 19]), Candidate: [ 1  1  2 -1  2  0  1  0  2  1  0  0  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 77700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  1  0 -1  1 -1  1  0 -1  1 -1  1  0] (Indices: [0, 3, 5, 9, 10, 12, 14, 15, 17, 19]), Candidate: [ 1  1  2 -1  2  0  1  0  2  1 -1  2  0  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 77750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  1 -1  1  0  0 -1  0  1 -1  1  0  0] (Indices: [0, 3, 5, 9, 11, 12, 13, 16, 18, 19]), Candidate: [ 1  1  2 -1  2  0  1  0  2  0  1  1  1  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  1 -1  0  1  0 -1  1  0 -1  1  0  0] (Indices: [0, 3, 5, 9, 12, 13, 15, 16, 18, 19]), Candidate: [ 1  1  2 -1  2  0  1  0  2  0  0  2  1  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  0  1  0  0 -1  0  0  1  0  0  0  0] (Indices: [0, 3, 5, 10, 11, 12, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  2  0  1  0  1  2  0  1  0  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  0  0  1  0  0  0  0  0  0 -1  0  1] (Indices: [0, 3, 5, 11, 12, 13, 14, 15, 16, 17]), Candidate: [ 1  1  2 -1  2  0  1  0  1  1  1  1  1  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0  0  0  0 -1  0  1 -1  1 -1  0  0  1] (Indices: [0, 3, 6, 7, 8, 9, 10, 11, 14, 16]), Candidate: [ 1  1  2 -1  1  2  1  0  1  1  0  0  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 78000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0  0  0 -1  0  0  1  0  0 -1  0  0  1] (Indices: [0, 3, 6, 7, 8, 9, 10, 14, 15, 16]), Candidate: [ 1  1  2 -1  1  2  1  0  1  1 -1  1  1  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 78050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0  0 -1  1 -1  1 -1  0  1  0 -1  0  1] (Indices: [0, 3, 6, 7, 8, 9, 11, 13, 16, 17]), Candidate: [ 1  1  2 -1  1  2  1  0  1  0  1  0  2  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0  0 -1  0  1 -1  1 -1  0  0  1  0  0] (Indices: [0, 3, 6, 7, 8, 9, 12, 14, 18, 19]), Candidate: [ 1  1  2 -1  1  2  1  0  1  0  0  2  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 78150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0 -1  1  0  0  0 -1  0  0  0  1 -1  1] (Indices: [0, 3, 6, 7, 8, 10, 11, 12, 13, 18]), Candidate: [ 1  1  2 -1  1  2  1  0  0  2  0  1  1  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0 -1  1  0 -1  0  0  0  1 -1  1  0  0] (Indices: [0, 3, 6, 7, 8, 10, 11, 16, 18, 19]), Candidate: [ 1  1  2 -1  1  2  1  0  0  2  0  0  1  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0 -1  1 -1  0  1 -1  1 -1  1  0 -1  1] (Indices: [0, 3, 6, 7, 8, 10, 13, 15, 17, 18]), Candidate: [ 1  1  2 -1  1  2  1  0  0  2 -1  1  2  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 78300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0 -1  0  1  0 -1  0  1 -1  1  0 -1  1] (Indices: [0, 3, 6, 7, 8, 11, 12, 15, 17, 18]), Candidate: [ 1  1  2 -1  1  2  1  0  0  1  1  1  0  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0 -1  0  0  1  0  0 -1  0  1 -1  1  0] (Indices: [0, 3, 6, 7, 8, 12, 13, 14, 17, 19]), Candidate: [ 1  1  2 -1  1  2  1  0  0  1  0  2  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 78400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  1  0  0  0  0 -1  0  1 -1  0  0  1] (Indices: [0, 3, 6, 7, 9, 10, 11, 12, 13, 16]), Candidate: [ 1  1  2 -1  1  2  1 -1  2  1  0  1  1  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 78450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  1  0  0 -1  0  0  0  1  0  0 -1  1] (Indices: [0, 3, 6, 7, 9, 10, 11, 16, 17, 18]), Candidate: [ 1  1  2 -1  1  2  1 -1  2  1  0  0  1  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 78500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  1  0 -1  0  1 -1  1  0 -1  1 -1  1] (Indices: [0, 3, 6, 7, 9, 10, 13, 15, 16, 18]), Candidate: [ 1  1  2 -1  1  2  1 -1  2  1 -1  1  2  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 78550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  1 -1  1  0 -1  0  1  0 -1  1 -1  1] (Indices: [0, 3, 6, 7, 9, 11, 12, 15, 16, 18]), Candidate: [ 1  1  2 -1  1  2  1 -1  2  0  1  1  0  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 78600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  1 -1  0  1  0  0 -1  1 -1  0  1  0] (Indices: [0, 3, 6, 7, 9, 12, 13, 14, 16, 19]), Candidate: [ 1  1  2 -1  1  2  1 -1  2  0  0  2  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 78650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  0  1  0  0  0  0  0 -1  0  0  0  1] (Indices: [0, 3, 6, 7, 10, 11, 12, 13, 14, 15]), Candidate: [ 1  1  2 -1  1  2  1 -1  1  2  0  1  1  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 78700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  0  1  0 -1  1 -1  1 -1  0  1  0  0] (Indices: [0, 3, 6, 7, 10, 11, 13, 15, 18, 19]), Candidate: [ 1  1  2 -1  1  2  1 -1  1  2  0  0  2  0  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 78750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  0  1 -1  1 -1  0  1  0  0  0 -1  1] (Indices: [0, 3, 6, 7, 10, 12, 15, 16, 17, 18]), Candidate: [ 1  1  2 -1  1  2  1 -1  1  2 -1  2  0  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 78800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  0  0  1  0 -1  1  0 -1  1 -1  1  0] (Indices: [0, 3, 6, 7, 11, 12, 14, 15, 17, 19]), Candidate: [ 1  1  2 -1  1  2  1 -1  1  1  1  1  0  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 78850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  0  0  0  1 -1  1  0 -1  1  0  0  0] (Indices: [0, 3, 6, 7, 12, 14, 15, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  2  1 -1  1  1  0  2  0  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 78900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1  0  0  0 -1  0  1 -1  1  0 -1  0  1] (Indices: [0, 3, 6, 8, 9, 10, 11, 14, 16, 17]), Candidate: [ 1  1  2 -1  1  2  0  1  1  1  0  0  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 78950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1  0  0 -1  1 -1  0  0  0  1  0  0  0] (Indices: [0, 3, 6, 8, 9, 10, 12, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  2  0  1  1  1 -1  2  0  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 79000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1  0 -1  1  0  0 -1  0  0  0  1  0  0] (Indices: [0, 3, 6, 8, 9, 11, 12, 13, 18, 19]), Candidate: [ 1  1  2 -1  1  2  0  1  1  0  1  1  1  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1  0 -1  1 -1  0  1 -1  0  1  0  0  0] (Indices: [0, 3, 6, 8, 9, 11, 14, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  2  0  1  1  0  1  0  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 79100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1  0 -1  0  0  1  0 -1  0  1  0  0  0] (Indices: [0, 3, 6, 8, 9, 13, 14, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  2  0  1  1  0  0  1  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 79150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1 -1  1  0 -1  1  0  0 -1  0  0  1  0] (Indices: [0, 3, 6, 8, 10, 11, 13, 14, 15, 19]), Candidate: [ 1  1  2 -1  1  2  0  1  0  2  0  0  2  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1 -1  1 -1  1  0 -1  0  1 -1  1  0  0] (Indices: [0, 3, 6, 8, 10, 12, 13, 16, 18, 19]), Candidate: [ 1  1  2 -1  1  2  0  1  0  2 -1  2  1  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 79250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1 -1  0  1  0  0 -1  1  0 -1  0  1  0] (Indices: [0, 3, 6, 8, 11, 12, 13, 15, 16, 19]), Candidate: [ 1  1  2 -1  1  2  0  1  0  1  1  1  1  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1 -1  0  0  1  0  0 -1  1  0  0 -1  1] (Indices: [0, 3, 6, 8, 12, 13, 14, 16, 17, 18]), Candidate: [ 1  1  2 -1  1  2  0  1  0  1  0  2  1  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 79350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  1  0  0  0 -1  0  1 -1  1  0 -1  1] (Indices: [0, 3, 6, 9, 10, 11, 12, 15, 17, 18]), Candidate: [ 1  1  2 -1  1  2  0  0  2  1  0  1  0  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  1  0 -1  1  0  0 -1  0  1 -1  1  0] (Indices: [0, 3, 6, 9, 10, 12, 13, 14, 17, 19]), Candidate: [ 1  1  2 -1  1  2  0  0  2  1 -1  2  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 79450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  1 -1  1  0  0  0  0 -1  0  1 -1  1] (Indices: [0, 3, 6, 9, 11, 12, 13, 14, 15, 18]), Candidate: [ 1  1  2 -1  1  2  0  0  2  0  1  1  1  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  1 -1  1 -1  0  1  0  0 -1  1  0  0] (Indices: [0, 3, 6, 9, 11, 14, 15, 16, 18, 19]), Candidate: [ 1  1  2 -1  1  2  0  0  2  0  1  0  1  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  0  1  0  0  0 -1  0  1 -1  1  0  0] (Indices: [0, 3, 6, 10, 11, 12, 13, 16, 18, 19]), Candidate: [ 1  1  2 -1  1  2  0  0  1  2  0  1  1  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  0  1 -1  1  0 -1  1  0 -1  1  0  0] (Indices: [0, 3, 6, 10, 12, 13, 15, 16, 18, 19]), Candidate: [ 1  1  2 -1  1  2  0  0  1  2 -1  2  1  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 79650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  0  0  0  1 -1  1  0  0  0  0  0  0] (Indices: [0, 3, 6, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  2  0  0  1  1  0  2  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0  0  0  0 -1  0  0  1  0 -1  0  1  0] (Indices: [0, 3, 7, 8, 9, 10, 11, 15, 16, 19]), Candidate: [ 1  1  2 -1  1  1  2  0  1  1  0  0  1  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0  0  0 -1  0  1  0 -1  0  1  0 -1  1] (Indices: [0, 3, 7, 8, 9, 10, 13, 14, 17, 18]), Candidate: [ 1  1  2 -1  1  1  2  0  1  1 -1  1  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 79800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0  0 -1  1  0 -1  1 -1  0  1  0 -1  1] (Indices: [0, 3, 7, 8, 9, 11, 12, 14, 17, 18]), Candidate: [ 1  1  2 -1  1  1  2  0  1  0  1  1  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 79850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0  0 -1  0  1  0  0  0 -1  0  1 -1  1] (Indices: [0, 3, 7, 8, 9, 12, 13, 14, 15, 18]), Candidate: [ 1  1  2 -1  1  1  2  0  1  0  0  2  1  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0  0 -1  0  0  0  1  0  0 -1  1  0  0] (Indices: [0, 3, 7, 8, 9, 14, 15, 16, 18, 19]), Candidate: [ 1  1  2 -1  1  1  2  0  1  0  0  1  1  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0 -1  1  0 -1  1 -1  1  0 -1  1 -1  1] (Indices: [0, 3, 7, 8, 10, 11, 13, 15, 16, 18]), Candidate: [ 1  1  2 -1  1  1  2  0  0  2  0  0  2  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0 -1  1 -1  1 -1  1 -1  1  0  0 -1  1] (Indices: [0, 3, 7, 8, 10, 12, 14, 16, 17, 18]), Candidate: [ 1  1  2 -1  1  1  2  0  0  2 -1  2  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 80050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0 -1  0  1  0 -1  1  0  0  0 -1  0  1] (Indices: [0, 3, 7, 8, 11, 12, 14, 15, 16, 17]), Candidate: [ 1  1  2 -1  1  1  2  0  0  1  1  1  0  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0 -1  0  0  1  0 -1  0  1  0  0  0  0] (Indices: [0, 3, 7, 8, 12, 13, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  1  2  0  0  1  0  2  1  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  1  0  0 -1  1  0  0 -1  1 -1  0  1] (Indices: [0, 3, 7, 9, 10, 11, 13, 14, 15, 17]), Candidate: [ 1  1  2 -1  1  1  2 -1  2  1  0  0  2  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 80200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  1  0 -1  1  0 -1  0  1  0  0 -1  1] (Indices: [0, 3, 7, 9, 10, 12, 13, 16, 17, 18]), Candidate: [ 1  1  2 -1  1  1  2 -1  2  1 -1  2  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 80250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  1 -1  1  0  0 -1  1  0  0 -1  0  1] (Indices: [0, 3, 7, 9, 11, 12, 13, 15, 16, 17]), Candidate: [ 1  1  2 -1  1  1  2 -1  2  0  1  1  1  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 80300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  1 -1  0  1  0  0  0 -1  1 -1  1  0] (Indices: [0, 3, 7, 9, 12, 13, 14, 15, 17, 19]), Candidate: [ 1  1  2 -1  1  1  2 -1  2  0  0  2  1  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 80350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  0  1  0  0 -1  1 -1  1  0  0 -1  1] (Indices: [0, 3, 7, 10, 11, 12, 14, 16, 17, 18]), Candidate: [ 1  1  2 -1  1  1  2 -1  1  2  0  1  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 80400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  0  1 -1  1 -1  0  1  0  0  0  0  0] (Indices: [0, 3, 7, 10, 12, 15, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  1  2 -1  1  2 -1  2  0  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 80450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1  0  0  0  0  0 -1  1 -1  1 -1  0  1] (Indices: [0, 3, 8, 9, 10, 11, 12, 13, 15, 17]), Candidate: [ 1  1  2 -1  1  1  1  1  1  1  0  1  1  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1  0  0  0 -1  0  1  0  0 -1  1 -1  1] (Indices: [0, 3, 8, 9, 10, 11, 14, 15, 16, 18]), Candidate: [ 1  1  2 -1  1  1  1  1  1  1  0  0  1  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1  0  0 -1  0  1  0  0  0 -1  1 -1  1] (Indices: [0, 3, 8, 9, 10, 13, 14, 15, 16, 18]), Candidate: [ 1  1  2 -1  1  1  1  1  1  1 -1  1  2  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 80600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1  0 -1  1  0 -1  0  1  0  0  0 -1  1] (Indices: [0, 3, 8, 9, 11, 12, 15, 16, 17, 18]), Candidate: [ 1  1  2 -1  1  1  1  1  1  0  1  1  0  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1  0 -1  0  0  1  0  0 -1  1  0  0  0] (Indices: [0, 3, 8, 9, 13, 14, 15, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  1  1  1  1  0  0  1  2  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1 -1  1  0 -1  1 -1  1  0  0 -1  1  0] (Indices: [0, 3, 8, 10, 11, 13, 15, 16, 17, 19]), Candidate: [ 1  1  2 -1  1  1  1  1  0  2  0  0  2  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1 -1  0  1  0  0 -1  1  0 -1  1  0  0] (Indices: [0, 3, 8, 11, 12, 13, 15, 16, 18, 19]), Candidate: [ 1  1  2 -1  1  1  1  1  0  1  1  1  1  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  1  0  0  0 -1  1 -1  1  0  0 -1  1] (Indices: [0, 3, 9, 10, 11, 12, 14, 16, 17, 18]), Candidate: [ 1  1  2 -1  1  1  1  0  2  1  0  1  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 80850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  1  0 -1  1 -1  0  1  0  0  0  0  0] (Indices: [0, 3, 9, 10, 12, 15, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  1  1  0  2  1 -1  2  0  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 80900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  0  1  0  0  0  0 -1  1  0  0 -1  1] (Indices: [0, 3, 10, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 1  1  2 -1  1  1  1  0  1  2  0  1  1  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 80950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0  0  0 -1  1 -1  0  0  1 -1  0  0  1] (Indices: [0, 4, 5, 6, 7, 8, 9, 10, 12, 16]), Candidate: [ 1  1  1  1  1  1  1  0  1  1 -1  2  0  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0  0 -1  1 -1  0  0  0  0  1  0 -1  1] (Indices: [0, 4, 5, 6, 7, 8, 9, 11, 17, 18]), Candidate: [1 1 1 1 1 1 1 0 1 0 1 0 1 1 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 81050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0  0 -1  0  0  0  0  1  0 -1  1 -1  1] (Indices: [0, 4, 5, 6, 7, 8, 9, 15, 16, 18]), Candidate: [1 1 1 1 1 1 1 0 1 0 0 1 1 1 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 81100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0 -1  1 -1  1 -1  0  1 -1  0  1 -1  1] (Indices: [0, 4, 5, 6, 7, 8, 10, 12, 15, 18]), Candidate: [ 1  1  1  1  1  1  1  0  0  2 -1  2  0  1  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0 -1  0  1  0 -1  1 -1  1 -1  0  0  1] (Indices: [0, 4, 5, 6, 7, 8, 11, 12, 14, 16]), Candidate: [ 1  1  1  1  1  1  1  0  0  1  1  1  0  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0 -1  0  0  1  0  0 -1  1 -1  0  0  1] (Indices: [0, 4, 5, 6, 7, 8, 12, 13, 14, 16]), Candidate: [ 1  1  1  1  1  1  1  0  0  1  0  2  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0 -1  0  0  0  1 -1  0  1  0  0 -1  1] (Indices: [0, 4, 5, 6, 7, 8, 13, 16, 17, 18]), Candidate: [1 1 1 1 1 1 1 0 0 1 0 1 2 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 81300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  1  0 -1  1  0 -1  0  0  1 -1  0  1] (Indices: [0, 4, 5, 6, 7, 9, 10, 12, 13, 17]), Candidate: [ 1  1  1  1  1  1  1 -1  2  1 -1  2  1  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 81350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  1  0 -1  0  0  0  0  1  0 -1  1  0] (Indices: [0, 4, 5, 6, 7, 9, 10, 16, 17, 19]), Candidate: [ 1  1  1  1  1  1  1 -1  2  1 -1  1  1  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 81400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  1 -1  1 -1  0  0  1  0 -1  1 -1  1] (Indices: [0, 4, 5, 6, 7, 9, 11, 15, 16, 18]), Candidate: [ 1  1  1  1  1  1  1 -1  2  0  1  0  1  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  1 -1  0  0  1  0 -1  1 -1  0  1  0] (Indices: [0, 4, 5, 6, 7, 9, 13, 14, 16, 19]), Candidate: [ 1  1  1  1  1  1  1 -1  2  0  0  1  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 81500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  0  1  0 -1  1  0  0 -1  0  0  0  1] (Indices: [0, 4, 5, 6, 7, 10, 11, 13, 14, 15]), Candidate: [ 1  1  1  1  1  1  1 -1  1  2  0  0  2  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  0  1 -1  1 -1  1  0  0 -1  0  0  1] (Indices: [0, 4, 5, 6, 7, 10, 12, 14, 15, 16]), Candidate: [ 1  1  1  1  1  1  1 -1  1  2 -1  2  0  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 81600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  0  1 -1  0  0  0  1  0  0  0 -1  1] (Indices: [0, 4, 5, 6, 7, 10, 15, 16, 17, 18]), Candidate: [ 1  1  1  1  1  1  1 -1  1  2 -1  1  1  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 81650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  0  0  1 -1  1 -1  1  0  0 -1  0  1] (Indices: [0, 4, 5, 6, 7, 11, 13, 15, 16, 17]), Candidate: [ 1  1  1  1  1  1  1 -1  1  1  1  0  2  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  0  0  0  1 -1  1  0 -1  0  1  0  0] (Indices: [0, 4, 5, 6, 7, 12, 14, 15, 18, 19]), Candidate: [ 1  1  1  1  1  1  1 -1  1  1  0  2  0  2  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1  0  0  0 -1  0  0  1 -1  1 -1  0  1] (Indices: [0, 4, 5, 6, 8, 9, 10, 11, 15, 17]), Candidate: [1 1 1 1 1 1 0 1 1 1 0 0 1 1 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 81800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1  0  0 -1  0  0  1 -1  1 -1  1 -1  1] (Indices: [0, 4, 5, 6, 8, 9, 10, 14, 16, 18]), Candidate: [ 1  1  1  1  1  1  0  1  1  1 -1  1  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 81850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1  0 -1  1 -1  1 -1  0  0  0  1  0  0] (Indices: [0, 4, 5, 6, 8, 9, 11, 13, 18, 19]), Candidate: [1 1 1 1 1 1 0 1 1 0 1 0 2 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 81900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1  0 -1  0  1 -1  0  1 -1  1 -1  1  0] (Indices: [0, 4, 5, 6, 8, 9, 12, 15, 17, 19]), Candidate: [1 1 1 1 1 1 0 1 1 0 0 2 0 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 81950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1 -1  1  0  0 -1  1 -1  0  0  1 -1  1] (Indices: [0, 4, 5, 6, 8, 10, 11, 12, 14, 18]), Candidate: [ 1  1  1  1  1  1  0  1  0  2  0  1  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1 -1  1 -1  1  0  0 -1  0  0  1 -1  1] (Indices: [0, 4, 5, 6, 8, 10, 12, 13, 14, 18]), Candidate: [ 1  1  1  1  1  1  0  1  0  2 -1  2  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 82050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1 -1  1 -1  0  1 -1  0  1 -1  1  0  0] (Indices: [0, 4, 5, 6, 8, 10, 13, 16, 18, 19]), Candidate: [ 1  1  1  1  1  1  0  1  0  2 -1  1  2  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1 -1  0  1  0 -1  0  0  1 -1  1  0  0] (Indices: [0, 4, 5, 6, 8, 11, 12, 16, 18, 19]), Candidate: [1 1 1 1 1 1 0 1 0 1 1 1 0 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 82150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1 -1  0  0  1  0 -1  1 -1  1  0 -1  1] (Indices: [0, 4, 5, 6, 8, 12, 13, 15, 17, 18]), Candidate: [1 1 1 1 1 1 0 1 0 1 0 2 1 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 82200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  1  0  0  0 -1  1 -1  1 -1  0  0  1] (Indices: [0, 4, 5, 6, 9, 10, 11, 12, 14, 16]), Candidate: [ 1  1  1  1  1  1  0  0  2  1  0  1  0  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  1  0 -1  1  0  0 -1  1 -1  0  0  1] (Indices: [0, 4, 5, 6, 9, 10, 12, 13, 14, 16]), Candidate: [ 1  1  1  1  1  1  0  0  2  1 -1  2  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 82300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  1  0 -1  0  1 -1  0  1  0  0 -1  1] (Indices: [0, 4, 5, 6, 9, 10, 13, 16, 17, 18]), Candidate: [ 1  1  1  1  1  1  0  0  2  1 -1  1  2  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  1 -1  1  0 -1  0  0  1  0  0 -1  1] (Indices: [0, 4, 5, 6, 9, 11, 12, 16, 17, 18]), Candidate: [1 1 1 1 1 1 0 0 2 0 1 1 0 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 82400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  1 -1  0  1  0 -1  1  0 -1  1 -1  1] (Indices: [0, 4, 5, 6, 9, 12, 13, 15, 16, 18]), Candidate: [1 1 1 1 1 1 0 0 2 0 0 2 1 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 82450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  0  1  0  0  0 -1  1  0 -1  0  0  1] (Indices: [0, 4, 5, 6, 10, 11, 12, 13, 15, 16]), Candidate: [1 1 1 1 1 1 0 0 1 2 0 1 1 0 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 82500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  0  1  0 -1  0  1  0  0  0 -1  0  1] (Indices: [0, 4, 5, 6, 10, 11, 14, 15, 16, 17]), Candidate: [1 1 1 1 1 1 0 0 1 2 0 0 1 2 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 82550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  0  1 -1  0  1  0  0  0  0 -1  0  1] (Indices: [0, 4, 5, 6, 10, 13, 14, 15, 16, 17]), Candidate: [ 1  1  1  1  1  1  0  0  1  2 -1  1  2  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  0  0  1  0 -1  1 -1  0  1  0  0  0] (Indices: [0, 4, 5, 6, 11, 12, 14, 17, 18, 19]), Candidate: [ 1  1  1  1  1  1  0  0  1  1  1  1  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  0  0  0  0  1  0  0  0 -1  1  0  0] (Indices: [0, 4, 5, 6, 13, 14, 15, 16, 18, 19]), Candidate: [1 1 1 1 1 1 0 0 1 1 0 1 2 1 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 82700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0  0  0 -1  1 -1  0  0  1 -1  0  1  0] (Indices: [0, 4, 5, 7, 8, 9, 10, 12, 16, 19]), Candidate: [ 1  1  1  1  1  0  2  0  1  1 -1  2  0  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0  0 -1  1  0 -1  0  1  0 -1  0  0  1] (Indices: [0, 4, 5, 7, 8, 9, 11, 12, 15, 16]), Candidate: [1 1 1 1 1 0 2 0 1 0 1 1 0 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 82800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0  0 -1  0  1  0 -1  1  0 -1  0  0  1] (Indices: [0, 4, 5, 7, 8, 9, 12, 13, 15, 16]), Candidate: [1 1 1 1 1 0 2 0 1 0 0 2 1 0 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 82850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0  0 -1  0  0  0  1  0  0  0 -1  0  1] (Indices: [0, 4, 5, 7, 8, 9, 14, 15, 16, 17]), Candidate: [1 1 1 1 1 0 2 0 1 0 0 1 1 2 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 82900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0 -1  1  0 -1  1 -1  0  0  0  1  0  0] (Indices: [0, 4, 5, 7, 8, 10, 11, 13, 18, 19]), Candidate: [1 1 1 1 1 0 2 0 0 2 0 0 2 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 82950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0 -1  1 -1  1 -1  0  1 -1  1 -1  1  0] (Indices: [0, 4, 5, 7, 8, 10, 12, 15, 17, 19]), Candidate: [ 1  1  1  1  1  0  2  0  0  2 -1  2  0  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0 -1  0  1  0  0 -1  0  1  0 -1  0  1] (Indices: [0, 4, 5, 7, 8, 11, 12, 13, 16, 17]), Candidate: [1 1 1 1 1 0 2 0 0 1 1 1 1 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 83050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0 -1  0  1 -1  0  1  0 -1  1 -1  1  0] (Indices: [0, 4, 5, 7, 8, 11, 14, 15, 17, 19]), Candidate: [1 1 1 1 1 0 2 0 0 1 1 0 1 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 83100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0 -1  0  0  0  1  0  0 -1  1 -1  1  0] (Indices: [0, 4, 5, 7, 8, 13, 14, 15, 17, 19]), Candidate: [1 1 1 1 1 0 2 0 0 1 0 1 2 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 83150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  1  0  0 -1  1 -1  0  0  1  0 -1  1] (Indices: [0, 4, 5, 7, 9, 10, 11, 13, 17, 18]), Candidate: [ 1  1  1  1  1  0  2 -1  2  1  0  0  2  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  1  0 -1  1 -1  0  1  0 -1  0  1  0] (Indices: [0, 4, 5, 7, 9, 10, 12, 15, 16, 19]), Candidate: [ 1  1  1  1  1  0  2 -1  2  1 -1  2  0  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 83250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  1 -1  1  0  0 -1  1 -1  0  1 -1  1] (Indices: [0, 4, 5, 7, 9, 11, 12, 13, 15, 18]), Candidate: [ 1  1  1  1  1  0  2 -1  2  0  1  1  1  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  1 -1  1 -1  0  1  0  0 -1  0  1  0] (Indices: [0, 4, 5, 7, 9, 11, 14, 15, 16, 19]), Candidate: [ 1  1  1  1  1  0  2 -1  2  0  1  0  1  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  1 -1  0  0  1  0  0  0 -1  0  1  0] (Indices: [0, 4, 5, 7, 9, 13, 14, 15, 16, 19]), Candidate: [ 1  1  1  1  1  0  2 -1  2  0  0  1  2  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  0  1  0  0 -1  0  0  1  0  0 -1  1] (Indices: [0, 4, 5, 7, 10, 11, 12, 16, 17, 18]), Candidate: [ 1  1  1  1  1  0  2 -1  1  2  0  1  0  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  0  1 -1  1  0 -1  1  0 -1  1 -1  1] (Indices: [0, 4, 5, 7, 10, 12, 13, 15, 16, 18]), Candidate: [ 1  1  1  1  1  0  2 -1  1  2 -1  2  1  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 83500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  0  0  1  0  0  0 -1  1 -1  1 -1  1] (Indices: [0, 4, 5, 7, 11, 12, 13, 14, 16, 18]), Candidate: [ 1  1  1  1  1  0  2 -1  1  1  1  1  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 83550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  0  0  1 -1  0  0  1  0  0  0  0  0] (Indices: [0, 4, 5, 7, 11, 15, 16, 17, 18, 19]), Candidate: [ 1  1  1  1  1  0  2 -1  1  1  1  0  1  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1  0  0  0 -1  1  0  0 -1  0  0  0  1] (Indices: [0, 4, 5, 8, 9, 10, 11, 13, 14, 15]), Candidate: [1 1 1 1 1 0 1 1 1 1 0 0 2 1 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 83650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1  0  0 -1  1 -1  1  0  0 -1  0  0  1] (Indices: [0, 4, 5, 8, 9, 10, 12, 14, 15, 16]), Candidate: [ 1  1  1  1  1  0  1  1  1  1 -1  2  0  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1  0  0 -1  0  0  0  1  0  0  0 -1  1] (Indices: [0, 4, 5, 8, 9, 10, 15, 16, 17, 18]), Candidate: [ 1  1  1  1  1  0  1  1  1  1 -1  1  1  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1  0 -1  1 -1  1 -1  1  0  0 -1  0  1] (Indices: [0, 4, 5, 8, 9, 11, 13, 15, 16, 17]), Candidate: [1 1 1 1 1 0 1 1 1 0 1 0 2 0 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 83800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1  0 -1  0  1 -1  1  0 -1  0  1  0  0] (Indices: [0, 4, 5, 8, 9, 12, 14, 15, 18, 19]), Candidate: [1 1 1 1 1 0 1 1 1 0 0 2 0 2 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 83850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1 -1  1  0  0 -1  1 -1  1  0 -1  0  1] (Indices: [0, 4, 5, 8, 10, 11, 12, 14, 16, 17]), Candidate: [ 1  1  1  1  1  0  1  1  0  2  0  1  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1 -1  1  0 -1  0  0  0  1  0  0  0  0] (Indices: [0, 4, 5, 8, 10, 11, 16, 17, 18, 19]), Candidate: [1 1 1 1 1 0 1 1 0 2 0 0 1 1 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 83950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1 -1  1 -1  0  1 -1  0  1  0  0  0  0] (Indices: [0, 4, 5, 8, 10, 13, 16, 17, 18, 19]), Candidate: [ 1  1  1  1  1  0  1  1  0  2 -1  1  2  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1 -1  0  1 -1  1  0 -1  1 -1  1  0  0] (Indices: [0, 4, 5, 8, 11, 13, 14, 16, 18, 19]), Candidate: [ 1  1  1  1  1  0  1  1  0  1  1  0  2  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  1  0  0  0  0 -1  0  1  0 -1  0  1] (Indices: [0, 4, 5, 9, 10, 11, 12, 13, 16, 17]), Candidate: [1 1 1 1 1 0 1 0 2 1 0 1 1 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 84100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  1  0  0 -1  0  1  0 -1  1 -1  1  0] (Indices: [0, 4, 5, 9, 10, 11, 14, 15, 17, 19]), Candidate: [1 1 1 1 1 0 1 0 2 1 0 0 1 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 84150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  1  0 -1  0  1  0  0 -1  1 -1  1  0] (Indices: [0, 4, 5, 9, 10, 13, 14, 15, 17, 19]), Candidate: [ 1  1  1  1  1  0  1  0  2  1 -1  1  2  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  1 -1  1  0 -1  0  1 -1  1  0  0  0] (Indices: [0, 4, 5, 9, 11, 12, 15, 17, 18, 19]), Candidate: [1 1 1 1 1 0 1 0 2 0 1 1 0 1 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 84250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  1 -1  0  0  0  1  0  0  0  0  0  0] (Indices: [0, 4, 5, 9, 14, 15, 16, 17, 18, 19]), Candidate: [1 1 1 1 1 0 1 0 2 0 0 1 1 2 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 84300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  0  1  0 -1  1 -1  0  1  0  0  0  0] (Indices: [0, 4, 5, 10, 11, 13, 16, 17, 18, 19]), Candidate: [1 1 1 1 1 0 1 0 1 2 0 0 2 0 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 84350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  0  0  1  0 -1  1  0  0  0  0 -1  1] (Indices: [0, 4, 5, 11, 12, 14, 15, 16, 17, 18]), Candidate: [1 1 1 1 1 0 1 0 1 1 1 1 0 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 84400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0  0  0 -1  1  0 -1  1 -1  0  0  0  1] (Indices: [0, 4, 6, 7, 8, 9, 10, 12, 13, 15]), Candidate: [ 1  1  1  1  0  2  1  0  1  1 -1  2  1  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0  0  0 -1  0  0  0  1 -1  0  1  0  0] (Indices: [0, 4, 6, 7, 8, 9, 10, 15, 18, 19]), Candidate: [ 1  1  1  1  0  2  1  0  1  1 -1  1  1  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0  0 -1  1 -1  0  1 -1  0  0  1  0  0] (Indices: [0, 4, 6, 7, 8, 9, 11, 14, 18, 19]), Candidate: [ 1  1  1  1  0  2  1  0  1  0  1  0  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0  0 -1  0  0  1  0 -1  1  0 -1  0  1] (Indices: [0, 4, 6, 7, 8, 9, 13, 14, 16, 17]), Candidate: [ 1  1  1  1  0  2  1  0  1  0  0  1  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0 -1  1  0  0 -1  0  0  0  1 -1  1  0] (Indices: [0, 4, 6, 7, 8, 10, 11, 12, 17, 19]), Candidate: [1 1 1 1 0 2 1 0 0 2 0 1 0 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 84650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0 -1  1 -1  1  0 -1  0  0  1 -1  1  0] (Indices: [0, 4, 6, 7, 8, 10, 12, 13, 17, 19]), Candidate: [ 1  1  1  1  0  2  1  0  0  2 -1  2  1  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0 -1  1 -1  0  0  1 -1  1 -1  1  0  0] (Indices: [0, 4, 6, 7, 8, 10, 14, 16, 18, 19]), Candidate: [ 1  1  1  1  0  2  1  0  0  2 -1  1  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 84750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0 -1  0  1 -1  1  0 -1  0  1 -1  1  0] (Indices: [0, 4, 6, 7, 8, 11, 13, 14, 17, 19]), Candidate: [ 1  1  1  1  0  2  1  0  0  1  1  0  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0 -1  0  0  1 -1  1  0 -1  1  0 -1  1] (Indices: [0, 4, 6, 7, 8, 12, 14, 15, 17, 18]), Candidate: [1 1 1 1 0 2 1 0 0 1 0 2 0 2 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 84850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  1  0  0  0 -1  0  0  1 -1  0  1  0] (Indices: [0, 4, 6, 7, 9, 10, 11, 12, 16, 19]), Candidate: [ 1  1  1  1  0  2  1 -1  2  1  0  1  0  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  1  0 -1  1  0 -1  0  1 -1  0  1  0] (Indices: [0, 4, 6, 7, 9, 10, 12, 13, 16, 19]), Candidate: [ 1  1  1  1  0  2  1 -1  2  1 -1  2  1  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 84950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  1  0 -1  0  0  1 -1  1  0  0 -1  1] (Indices: [0, 4, 6, 7, 9, 10, 14, 16, 17, 18]), Candidate: [ 1  1  1  1  0  2  1 -1  2  1 -1  1  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 85000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  1 -1  1 -1  1  0 -1  1 -1  0  1  0] (Indices: [0, 4, 6, 7, 9, 11, 13, 14, 16, 19]), Candidate: [ 1  1  1  1  0  2  1 -1  2  0  1  0  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 85050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  1 -1  0  1 -1  1  0  0 -1  1 -1  1] (Indices: [0, 4, 6, 7, 9, 12, 14, 15, 16, 18]), Candidate: [ 1  1  1  1  0  2  1 -1  2  0  0  2  0  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  0  1  0  0 -1  1  0  0 -1  0  0  1] (Indices: [0, 4, 6, 7, 10, 11, 12, 14, 15, 16]), Candidate: [ 1  1  1  1  0  2  1 -1  1  2  0  1  0  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  0  1  0 -1  0  0  1  0  0  0 -1  1] (Indices: [0, 4, 6, 7, 10, 11, 15, 16, 17, 18]), Candidate: [ 1  1  1  1  0  2  1 -1  1  2  0  0  1  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  0  1 -1  0  1 -1  1  0  0  0 -1  1] (Indices: [0, 4, 6, 7, 10, 13, 15, 16, 17, 18]), Candidate: [ 1  1  1  1  0  2  1 -1  1  2 -1  1  2  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 85250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  0  0  1 -1  1  0  0 -1  1 -1  1  0] (Indices: [0, 4, 6, 7, 11, 13, 14, 15, 17, 19]), Candidate: [ 1  1  1  1  0  2  1 -1  1  1  1  0  2  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1  0  0  0  0  0 -1  0  0  0  0  1  0] (Indices: [0, 4, 6, 8, 9, 10, 11, 12, 13, 19]), Candidate: [1 1 1 1 0 2 0 1 1 1 0 1 1 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 85350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1  0  0  0 -1  0  0  0  0  1  0  0  0] (Indices: [0, 4, 6, 8, 9, 10, 11, 17, 18, 19]), Candidate: [1 1 1 1 0 2 0 1 1 1 0 0 1 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 85400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1  0  0 -1  0  1 -1  1 -1  1 -1  1  0] (Indices: [0, 4, 6, 8, 9, 10, 13, 15, 17, 19]), Candidate: [ 1  1  1  1  0  2  0  1  1  1 -1  1  2  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1  0 -1  1  0 -1  0  1 -1  1 -1  1  0] (Indices: [0, 4, 6, 8, 9, 11, 12, 15, 17, 19]), Candidate: [1 1 1 1 0 2 0 1 1 0 1 1 0 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 85500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1  0 -1  0  1  0  0 -1  0  0  1  0  0] (Indices: [0, 4, 6, 8, 9, 12, 13, 14, 18, 19]), Candidate: [ 1  1  1  1  0  2  0  1  1  0  0  2  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1 -1  1  0  0  0  0 -1  0  0  1 -1  1] (Indices: [0, 4, 6, 8, 10, 11, 12, 13, 14, 18]), Candidate: [ 1  1  1  1  0  2  0  1  0  2  0  1  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1 -1  1  0 -1  1 -1  0  1 -1  1  0  0] (Indices: [0, 4, 6, 8, 10, 11, 13, 16, 18, 19]), Candidate: [1 1 1 1 0 2 0 1 0 2 0 0 2 0 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 85650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1 -1  1 -1  1 -1  0  1 -1  1  0  0  0] (Indices: [0, 4, 6, 8, 10, 12, 15, 17, 18, 19]), Candidate: [ 1  1  1  1  0  2  0  1  0  2 -1  2  0  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1 -1  0  1  0 -1  1 -1  1  0 -1  1  0] (Indices: [0, 4, 6, 8, 11, 12, 14, 16, 17, 19]), Candidate: [ 1  1  1  1  0  2  0  1  0  1  1  1  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1 -1  0  0  0  1  0  0  0  0  0 -1  1] (Indices: [0, 4, 6, 8, 13, 14, 15, 16, 17, 18]), Candidate: [1 1 1 1 0 2 0 1 0 1 0 1 2 1 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 85800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  1  0  0 -1  1  0 -1  0  1 -1  1  0] (Indices: [0, 4, 6, 9, 10, 11, 13, 14, 17, 19]), Candidate: [ 1  1  1  1  0  2  0  0  2  1  0  0  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  1  0 -1  1 -1  1  0 -1  1  0 -1  1] (Indices: [0, 4, 6, 9, 10, 12, 14, 15, 17, 18]), Candidate: [ 1  1  1  1  0  2  0  0  2  1 -1  2  0  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  1 -1  1  0  0 -1  0  1  0 -1  1  0] (Indices: [0, 4, 6, 9, 11, 12, 13, 16, 17, 19]), Candidate: [1 1 1 1 0 2 0 0 2 0 1 1 1 0 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 85950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  1 -1  0  1  0 -1  1  0  0 -1  1  0] (Indices: [0, 4, 6, 9, 12, 13, 15, 16, 17, 19]), Candidate: [1 1 1 1 0 2 0 0 2 0 0 2 1 0 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 86000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  0  1  0  0 -1  0  1 -1  1  0  0  0] (Indices: [0, 4, 6, 10, 11, 12, 15, 17, 18, 19]), Candidate: [1 1 1 1 0 2 0 0 1 2 0 1 0 1 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 86050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  0  1 -1  0  0  1  0  0  0  0  0  0] (Indices: [0, 4, 6, 10, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  1  1  1  0  2  0  0  1  2 -1  1  1  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0  0  0  0  0 -1  0  1 -1  0  1 -1  1] (Indices: [0, 4, 7, 8, 9, 10, 11, 12, 15, 18]), Candidate: [1 1 1 1 0 1 2 0 1 1 0 1 0 1 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 86150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0  0  0 -1  1  0 -1  1 -1  0  1 -1  1] (Indices: [0, 4, 7, 8, 9, 10, 12, 13, 15, 18]), Candidate: [ 1  1  1  1  0  1  2  0  1  1 -1  2  1  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0  0  0 -1  0  0  1  0  0 -1  0  1  0] (Indices: [0, 4, 7, 8, 9, 10, 14, 15, 16, 19]), Candidate: [ 1  1  1  1  0  1  2  0  1  1 -1  1  1  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0  0 -1  1 -1  1  0  0 -1  0  1 -1  1] (Indices: [0, 4, 7, 8, 9, 11, 13, 14, 15, 18]), Candidate: [1 1 1 1 0 1 2 0 1 0 1 0 2 1 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 86300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0  0 -1  0  1  0 -1  0  1  0 -1  1  0] (Indices: [0, 4, 7, 8, 9, 12, 13, 16, 17, 19]), Candidate: [1 1 1 1 0 1 2 0 1 0 0 2 1 0 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 86350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0 -1  1  0  0  0 -1  0  1 -1  0  1  0] (Indices: [0, 4, 7, 8, 10, 11, 12, 13, 16, 19]), Candidate: [1 1 1 1 0 1 2 0 0 2 0 1 1 0 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 86400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0 -1  1  0 -1  0  1 -1  1  0  0 -1  1] (Indices: [0, 4, 7, 8, 10, 11, 14, 16, 17, 18]), Candidate: [ 1  1  1  1  0  1  2  0  0  2  0  0  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0 -1  1 -1  0  1  0 -1  1  0  0 -1  1] (Indices: [0, 4, 7, 8, 10, 13, 14, 16, 17, 18]), Candidate: [ 1  1  1  1  0  1  2  0  0  2 -1  1  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 86500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0 -1  0  1 -1  1  0  0  0  0 -1  0  1] (Indices: [0, 4, 7, 8, 11, 13, 14, 15, 16, 17]), Candidate: [1 1 1 1 0 1 2 0 0 1 1 0 2 1 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 86550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  1  0  0  0  0  0 -1  1 -1  0  0  1] (Indices: [0, 4, 7, 9, 10, 11, 12, 13, 14, 16]), Candidate: [ 1  1  1  1  0  1  2 -1  2  1  0  1  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 86600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  1  0  0 -1  1 -1  0  1  0  0 -1  1] (Indices: [0, 4, 7, 9, 10, 11, 13, 16, 17, 18]), Candidate: [ 1  1  1  1  0  1  2 -1  2  1  0  0  2  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  1  0 -1  1 -1  0  1  0  0 -1  1  0] (Indices: [0, 4, 7, 9, 10, 12, 15, 16, 17, 19]), Candidate: [ 1  1  1  1  0  1  2 -1  2  1 -1  2  0  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 86700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  1 -1  1  0 -1  1  0 -1  0  1  0  0] (Indices: [0, 4, 7, 9, 11, 12, 14, 15, 18, 19]), Candidate: [ 1  1  1  1  0  1  2 -1  2  0  1  1  0  2  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  1 -1  0  1 -1  1 -1  1  0  0  0  0] (Indices: [0, 4, 7, 9, 12, 14, 16, 17, 18, 19]), Candidate: [ 1  1  1  1  0  1  2 -1  2  0  0  2  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 86800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  0  1  0 -1  1  0 -1  1  0  0 -1  1] (Indices: [0, 4, 7, 10, 11, 13, 14, 16, 17, 18]), Candidate: [ 1  1  1  1  0  1  2 -1  1  2  0  0  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 86850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  0  0  1  0  0  0 -1  1  0 -1  1  0] (Indices: [0, 4, 7, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 1  1  1  1  0  1  2 -1  1  1  1  1  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 86900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1  0  0  0  0 -1  1 -1  1 -1  0  1  0] (Indices: [0, 4, 8, 9, 10, 11, 12, 14, 16, 19]), Candidate: [ 1  1  1  1  0  1  1  1  1  1  0  1  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1  0  0 -1  1  0  0  0 -1  1 -1  0  1] (Indices: [0, 4, 8, 9, 10, 12, 13, 14, 15, 17]), Candidate: [ 1  1  1  1  0  1  1  1  1  1 -1  2  1  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1  0  0 -1  0  0  1  0  0  0 -1  1  0] (Indices: [0, 4, 8, 9, 10, 14, 15, 16, 17, 19]), Candidate: [ 1  1  1  1  0  1  1  1  1  1 -1  1  1  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1  0 -1  1 -1  1 -1  1  0  0  0 -1  1] (Indices: [0, 4, 8, 9, 11, 13, 15, 16, 17, 18]), Candidate: [1 1 1 1 0 1 1 1 1 0 1 0 2 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 87100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1 -1  1  0  0  0 -1  1  0 -1  1 -1  1] (Indices: [0, 4, 8, 10, 11, 12, 13, 15, 16, 18]), Candidate: [1 1 1 1 0 1 1 1 0 2 0 1 1 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 87150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1 -1  1 -1  1  0  0  0 -1  0  1  0  0] (Indices: [0, 4, 8, 10, 12, 13, 14, 15, 18, 19]), Candidate: [ 1  1  1  1  0  1  1  1  0  2 -1  2  1  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1 -1  0  1 -1  0  1  0  0  0  0  0  0] (Indices: [0, 4, 8, 11, 14, 15, 16, 17, 18, 19]), Candidate: [1 1 1 1 0 1 1 1 0 1 1 0 1 2 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 87250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  1  0  0 -1  1  0 -1  1  0  0 -1  1] (Indices: [0, 4, 9, 10, 11, 13, 14, 16, 17, 18]), Candidate: [ 1  1  1  1  0  1  1  0  2  1  0  0  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  1 -1  1  0  0  0 -1  1  0 -1  1  0] (Indices: [0, 4, 9, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 1  1  1  1  0  1  1  0  2  0  1  1  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  0  1  0 -1  1  0  0  0  0  0 -1  1] (Indices: [0, 4, 10, 11, 13, 14, 15, 16, 17, 18]), Candidate: [1 1 1 1 0 1 1 0 1 2 0 0 2 1 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 87400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0  0  0  0 -1  0  0  0  0  1 -1  1  0] (Indices: [0, 5, 6, 7, 8, 9, 10, 11, 17, 19]), Candidate: [1 1 1 0 2 1 1 0 1 1 0 0 1 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 87450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0  0  0 -1  0  0  0  1  0 -1  0  1  0] (Indices: [0, 5, 6, 7, 8, 9, 10, 15, 16, 19]), Candidate: [ 1  1  1  0  2  1  1  0  1  1 -1  1  1  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0  0 -1  1 -1  0  1 -1  1 -1  0  1  0] (Indices: [0, 5, 6, 7, 8, 9, 11, 14, 16, 19]), Candidate: [ 1  1  1  0  2  1  1  0  1  0  1  0  1  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0  0 -1  0  0  1  0  0 -1  1 -1  0  1] (Indices: [0, 5, 6, 7, 8, 9, 13, 14, 15, 17]), Candidate: [1 1 1 0 2 1 1 0 1 0 0 1 2 1 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 87600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0 -1  1  0  0 -1  0  0  1 -1  1 -1  1] (Indices: [0, 5, 6, 7, 8, 10, 11, 12, 16, 18]), Candidate: [1 1 1 0 2 1 1 0 0 2 0 1 0 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 87650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0 -1  1 -1  1  0 -1  0  1 -1  1 -1  1] (Indices: [0, 5, 6, 7, 8, 10, 12, 13, 16, 18]), Candidate: [ 1  1  1  0  2  1  1  0  0  2 -1  2  1  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0 -1  1 -1  0  0  1  0 -1  0  1  0  0] (Indices: [0, 5, 6, 7, 8, 10, 14, 15, 18, 19]), Candidate: [ 1  1  1  0  2  1  1  0  0  2 -1  1  1  2  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0 -1  0  1 -1  1  0 -1  1 -1  1 -1  1] (Indices: [0, 5, 6, 7, 8, 11, 13, 14, 16, 18]), Candidate: [ 1  1  1  0  2  1  1  0  0  1  1  0  2  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0 -1  0  0  1 -1  1  0  0  0 -1  0  1] (Indices: [0, 5, 6, 7, 8, 12, 14, 15, 16, 17]), Candidate: [1 1 1 0 2 1 1 0 0 1 0 2 0 2 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 87850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  1  0  0  0 -1  0  1 -1  0  0  1  0] (Indices: [0, 5, 6, 7, 9, 10, 11, 12, 15, 19]), Candidate: [ 1  1  1  0  2  1  1 -1  2  1  0  1  0  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  1  0 -1  1  0 -1  1 -1  0  0  1  0] (Indices: [0, 5, 6, 7, 9, 10, 12, 13, 15, 19]), Candidate: [ 1  1  1  0  2  1  1 -1  2  1 -1  2  1  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 87950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  1  0 -1  0  0  1  0 -1  1  0 -1  1] (Indices: [0, 5, 6, 7, 9, 10, 14, 15, 17, 18]), Candidate: [ 1  1  1  0  2  1  1 -1  2  1 -1  1  1  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 88000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  1 -1  1 -1  1  0  0 -1  0  0  1  0] (Indices: [0, 5, 6, 7, 9, 11, 13, 14, 15, 19]), Candidate: [ 1  1  1  0  2  1  1 -1  2  0  1  0  2  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  1 -1  0  1  0 -1  0  1 -1  1  0  0] (Indices: [0, 5, 6, 7, 9, 12, 13, 16, 18, 19]), Candidate: [ 1  1  1  0  2  1  1 -1  2  0  0  2  1  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  0  1  0  0  0 -1  0  0  1  0 -1  1] (Indices: [0, 5, 6, 7, 10, 11, 12, 13, 17, 18]), Candidate: [ 1  1  1  0  2  1  1 -1  1  2  0  1  1  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  0  1  0 -1  0  1 -1  1  0 -1  1  0] (Indices: [0, 5, 6, 7, 10, 11, 14, 16, 17, 19]), Candidate: [ 1  1  1  0  2  1  1 -1  1  2  0  0  1  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 88200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  0  1 -1  0  1  0 -1  1  0 -1  1  0] (Indices: [0, 5, 6, 7, 10, 13, 14, 16, 17, 19]), Candidate: [ 1  1  1  0  2  1  1 -1  1  2 -1  1  2  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 88250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  0  0  1 -1  1  0  0  0 -1  1 -1  1] (Indices: [0, 5, 6, 7, 11, 13, 14, 15, 16, 18]), Candidate: [ 1  1  1  0  2  1  1 -1  1  1  1  0  2  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1  0  0  0  0  0 -1  0  1 -1  0  0  1] (Indices: [0, 5, 6, 8, 9, 10, 11, 12, 13, 16]), Candidate: [1 1 1 0 2 1 0 1 1 1 0 1 1 0 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 88350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1  0  0  0 -1  0  0  0  1  0  0 -1  1] (Indices: [0, 5, 6, 8, 9, 10, 11, 16, 17, 18]), Candidate: [1 1 1 0 2 1 0 1 1 1 0 0 1 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 88400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1  0  0 -1  0  1 -1  1  0 -1  1 -1  1] (Indices: [0, 5, 6, 8, 9, 10, 13, 15, 16, 18]), Candidate: [ 1  1  1  0  2  1  0  1  1  1 -1  1  2  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1  0 -1  1  0 -1  0  1  0 -1  1 -1  1] (Indices: [0, 5, 6, 8, 9, 11, 12, 15, 16, 18]), Candidate: [1 1 1 0 2 1 0 1 1 0 1 1 0 1 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 88500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1  0 -1  0  1  0  0 -1  1 -1  0  1  0] (Indices: [0, 5, 6, 8, 9, 12, 13, 14, 16, 19]), Candidate: [ 1  1  1  0  2  1  0  1  1  0  0  2  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1 -1  1  0  0  0  0  0 -1  0  0  0  1] (Indices: [0, 5, 6, 8, 10, 11, 12, 13, 14, 15]), Candidate: [1 1 1 0 2 1 0 1 0 2 0 1 1 1 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 88600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1 -1  1  0 -1  1 -1  1 -1  0  1  0  0] (Indices: [0, 5, 6, 8, 10, 11, 13, 15, 18, 19]), Candidate: [1 1 1 0 2 1 0 1 0 2 0 0 2 0 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 88650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1 -1  1 -1  1 -1  0  1  0  0  0 -1  1] (Indices: [0, 5, 6, 8, 10, 12, 15, 16, 17, 18]), Candidate: [ 1  1  1  0  2  1  0  1  0  2 -1  2  0  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1 -1  0  1  0 -1  1  0 -1  1 -1  1  0] (Indices: [0, 5, 6, 8, 11, 12, 14, 15, 17, 19]), Candidate: [1 1 1 0 2 1 0 1 0 1 1 1 0 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 88750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1 -1  0  0  1 -1  1  0 -1  1  0  0  0] (Indices: [0, 5, 6, 8, 12, 14, 15, 17, 18, 19]), Candidate: [1 1 1 0 2 1 0 1 0 1 0 2 0 2 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 88800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  1  0  0 -1  1  0 -1  1 -1  1 -1  1] (Indices: [0, 5, 6, 9, 10, 11, 13, 14, 16, 18]), Candidate: [ 1  1  1  0  2  1  0  0  2  1  0  0  2  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  1  0 -1  1 -1  1  0  0  0 -1  0  1] (Indices: [0, 5, 6, 9, 10, 12, 14, 15, 16, 17]), Candidate: [ 1  1  1  0  2  1  0  0  2  1 -1  2  0  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  1 -1  1  0  0 -1  1 -1  1 -1  1  0] (Indices: [0, 5, 6, 9, 11, 12, 13, 15, 17, 19]), Candidate: [1 1 1 0 2 1 0 0 2 0 1 1 1 0 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 88950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  1 -1  0  1  0  0 -1  1 -1  1  0  0] (Indices: [0, 5, 6, 9, 12, 13, 14, 16, 18, 19]), Candidate: [ 1  1  1  0  2  1  0  0  2  0  0  2  1  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  0  1  0  0 -1  0  1  0  0  0 -1  1] (Indices: [0, 5, 6, 10, 11, 12, 15, 16, 17, 18]), Candidate: [1 1 1 0 2 1 0 0 1 2 0 1 0 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 89050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  0  1 -1  0  1  0  0 -1  1  0  0  0] (Indices: [0, 5, 6, 10, 13, 14, 15, 17, 18, 19]), Candidate: [ 1  1  1  0  2  1  0  0  1  2 -1  1  2  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0  0  0  0  0 -1  1 -1  0  0  0  1  0] (Indices: [0, 5, 7, 8, 9, 10, 11, 12, 14, 19]), Candidate: [ 1  1  1  0  2  0  2  0  1  1  0  1  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0  0  0 -1  1  0  0 -1  0  0  0  1  0] (Indices: [0, 5, 7, 8, 9, 10, 12, 13, 14, 19]), Candidate: [ 1  1  1  0  2  0  2  0  1  1 -1  2  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 89200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0  0  0 -1  0  1 -1  0  0  1  0  0  0] (Indices: [0, 5, 7, 8, 9, 10, 13, 17, 18, 19]), Candidate: [ 1  1  1  0  2  0  2  0  1  1 -1  1  2  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0  0 -1  1  0 -1  0  0  0  1  0  0  0] (Indices: [0, 5, 7, 8, 9, 11, 12, 17, 18, 19]), Candidate: [1 1 1 0 2 0 2 0 1 0 1 1 0 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 89300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0  0 -1  0  1  0 -1  1 -1  1 -1  1  0] (Indices: [0, 5, 7, 8, 9, 12, 13, 15, 17, 19]), Candidate: [1 1 1 0 2 0 2 0 1 0 0 2 1 0 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 89350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0 -1  1  0  0  0 -1  1 -1  0  0  1  0] (Indices: [0, 5, 7, 8, 10, 11, 12, 13, 15, 19]), Candidate: [1 1 1 0 2 0 2 0 0 2 0 1 1 0 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 89400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0 -1  1  0 -1  0  1  0 -1  1  0 -1  1] (Indices: [0, 5, 7, 8, 10, 11, 14, 15, 17, 18]), Candidate: [1 1 1 0 2 0 2 0 0 2 0 0 1 2 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 89450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0 -1  1 -1  0  1  0  0 -1  1  0 -1  1] (Indices: [0, 5, 7, 8, 10, 13, 14, 15, 17, 18]), Candidate: [ 1  1  1  0  2  0  2  0  0  2 -1  1  2  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0 -1  0  1  0 -1  0  1  0 -1  1  0  0] (Indices: [0, 5, 7, 8, 11, 12, 15, 16, 18, 19]), Candidate: [1 1 1 0 2 0 2 0 0 1 1 1 0 1 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 89550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0 -1  0  0  0  1 -1  1  0  0  0  0  0] (Indices: [0, 5, 7, 8, 13, 15, 16, 17, 18, 19]), Candidate: [1 1 1 0 2 0 2 0 0 1 0 1 2 0 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 89600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  1  0  0 -1  1 -1  1 -1  1  0 -1  1] (Indices: [0, 5, 7, 9, 10, 11, 13, 15, 17, 18]), Candidate: [ 1  1  1  0  2  0  2 -1  2  1  0  0  2  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  1  0 -1  1 -1  1 -1  1 -1  1  0  0] (Indices: [0, 5, 7, 9, 10, 12, 14, 16, 18, 19]), Candidate: [ 1  1  1  0  2  0  2 -1  2  1 -1  2  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 89700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  1 -1  1  0 -1  1  0  0 -1  0  1  0] (Indices: [0, 5, 7, 9, 11, 12, 14, 15, 16, 19]), Candidate: [ 1  1  1  0  2  0  2 -1  2  0  1  1  0  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  1 -1  0  1 -1  1  0  0  0 -1  1  0] (Indices: [0, 5, 7, 9, 12, 14, 15, 16, 17, 19]), Candidate: [ 1  1  1  0  2  0  2 -1  2  0  0  2  0  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  0  1  0 -1  1  0  0 -1  1  0 -1  1] (Indices: [0, 5, 7, 10, 11, 13, 14, 15, 17, 18]), Candidate: [ 1  1  1  0  2  0  2 -1  1  2  0  0  2  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  0  0  1  0  0  0  0 -1  1 -1  1  0] (Indices: [0, 5, 7, 11, 12, 13, 14, 15, 17, 19]), Candidate: [ 1  1  1  0  2  0  2 -1  1  1  1  1  1  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1  0  0  0  0 -1  1  0 -1  0  0  1  0] (Indices: [0, 5, 8, 9, 10, 11, 12, 14, 15, 19]), Candidate: [1 1 1 0 2 0 1 1 1 1 0 1 0 2 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 89950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1  0  0  0 -1  0  0  1 -1  1  0  0  0] (Indices: [0, 5, 8, 9, 10, 11, 15, 17, 18, 19]), Candidate: [1 1 1 0 2 0 1 1 1 1 0 0 1 1 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 90000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1  0  0 -1  0  1 -1  1 -1  1  0  0  0] (Indices: [0, 5, 8, 9, 10, 13, 15, 17, 18, 19]), Candidate: [ 1  1  1  0  2  0  1  1  1  1 -1  1  2  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1  0 -1  1 -1  1  0 -1  1  0 -1  1  0] (Indices: [0, 5, 8, 9, 11, 13, 14, 16, 17, 19]), Candidate: [ 1  1  1  0  2  0  1  1  1  0  1  0  2  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1 -1  1  0  0  0  0 -1  0  1 -1  1  0] (Indices: [0, 5, 8, 10, 11, 12, 13, 14, 17, 19]), Candidate: [ 1  1  1  0  2  0  1  1  0  2  0  1  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1 -1  1 -1  1  0  0  0  0 -1  0  1  0] (Indices: [0, 5, 8, 10, 12, 13, 14, 15, 16, 19]), Candidate: [ 1  1  1  0  2  0  1  1  0  2 -1  2  1  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1 -1  0  1 -1  1  0  0 -1  1  0  0  0] (Indices: [0, 5, 8, 11, 13, 14, 15, 17, 18, 19]), Candidate: [1 1 1 0 2 0 1 1 0 1 1 0 2 1 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 90250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  1  0  0 -1  1  0  0 -1  1  0 -1  1] (Indices: [0, 5, 9, 10, 11, 13, 14, 15, 17, 18]), Candidate: [1 1 1 0 2 0 1 0 2 1 0 0 2 1 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 90300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  1 -1  1  0  0  0  0 -1  1 -1  1  0] (Indices: [0, 5, 9, 11, 12, 13, 14, 15, 17, 19]), Candidate: [1 1 1 0 2 0 1 0 2 0 1 1 1 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 90350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  0  1  0  0 -1  1  0 -1  1  0  0  0] (Indices: [0, 5, 10, 11, 12, 14, 15, 17, 18, 19]), Candidate: [1 1 1 0 2 0 1 0 1 2 0 1 0 2 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 90400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0  0  0  0 -1  1  0 -1  0  1 -1  0  1] (Indices: [0, 6, 7, 8, 9, 10, 11, 13, 14, 17]), Candidate: [ 1  1  1  0  1  2  1  0  1  1  0  0  2  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0  0  0 -1  1 -1  1  0 -1  0  1 -1  1] (Indices: [0, 6, 7, 8, 9, 10, 12, 14, 15, 18]), Candidate: [ 1  1  1  0  1  2  1  0  1  1 -1  2  0  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0  0  0 -1  0  0  0  1  0 -1  1  0  0] (Indices: [0, 6, 7, 8, 9, 10, 15, 16, 18, 19]), Candidate: [ 1  1  1  0  1  2  1  0  1  1 -1  1  1  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0  0 -1  1 -1  1 -1  1  0 -1  0  1  0] (Indices: [0, 6, 7, 8, 9, 11, 13, 15, 16, 19]), Candidate: [1 1 1 0 1 2 1 0 1 0 1 0 2 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 90600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0  0 -1  0  1 -1  1 -1  1  0 -1  1  0] (Indices: [0, 6, 7, 8, 9, 12, 14, 16, 17, 19]), Candidate: [ 1  1  1  0  1  2  1  0  1  0  0  2  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0 -1  1  0  0 -1  1 -1  1 -1  0  1  0] (Indices: [0, 6, 7, 8, 10, 11, 12, 14, 16, 19]), Candidate: [ 1  1  1  0  1  2  1  0  0  2  0  1  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0 -1  1 -1  1  0  0  0 -1  1 -1  0  1] (Indices: [0, 6, 7, 8, 10, 12, 13, 14, 15, 17]), Candidate: [ 1  1  1  0  1  2  1  0  0  2 -1  2  1  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0 -1  1 -1  0  0  1  0  0  0 -1  1  0] (Indices: [0, 6, 7, 8, 10, 14, 15, 16, 17, 19]), Candidate: [ 1  1  1  0  1  2  1  0  0  2 -1  1  1  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0 -1  0  1 -1  1 -1  1  0  0  0 -1  1] (Indices: [0, 6, 7, 8, 11, 13, 15, 16, 17, 18]), Candidate: [1 1 1 0 1 2 1 0 0 1 1 0 2 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 90850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  1  0  0  0  0 -1  0  1 -1  0  1  0] (Indices: [0, 6, 7, 9, 10, 11, 12, 13, 16, 19]), Candidate: [ 1  1  1  0  1  2  1 -1  2  1  0  1  1  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  1  0  0 -1  0  1 -1  1  0  0 -1  1] (Indices: [0, 6, 7, 9, 10, 11, 14, 16, 17, 18]), Candidate: [ 1  1  1  0  1  2  1 -1  2  1  0  0  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 90950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  1  0 -1  0  1  0 -1  1  0  0 -1  1] (Indices: [0, 6, 7, 9, 10, 13, 14, 16, 17, 18]), Candidate: [ 1  1  1  0  1  2  1 -1  2  1 -1  1  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 91000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  1 -1  1 -1  1  0  0  0  0 -1  0  1] (Indices: [0, 6, 7, 9, 11, 13, 14, 15, 16, 17]), Candidate: [ 1  1  1  0  1  2  1 -1  2  0  1  0  2  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  0  1  0  0  0  0  0 -1  1 -1  0  1] (Indices: [0, 6, 7, 10, 11, 12, 13, 14, 15, 17]), Candidate: [ 1  1  1  0  1  2  1 -1  1  2  0  1  1  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  0  1  0 -1  0  1  0  0  0 -1  1  0] (Indices: [0, 6, 7, 10, 11, 14, 15, 16, 17, 19]), Candidate: [ 1  1  1  0  1  2  1 -1  1  2  0  0  1  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  0  0  1  0 -1  1  0  0 -1  1  0  0] (Indices: [0, 6, 7, 11, 12, 14, 15, 16, 18, 19]), Candidate: [ 1  1  1  0  1  2  1 -1  1  1  1  1  0  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1  0  0  0  0 -1  0  0  1  0  0 -1  1] (Indices: [0, 6, 8, 9, 10, 11, 12, 16, 17, 18]), Candidate: [1 1 1 0 1 2 0 1 1 1 0 1 0 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 91250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1  0  0 -1  1  0 -1  1  0 -1  1 -1  1] (Indices: [0, 6, 8, 9, 10, 12, 13, 15, 16, 18]), Candidate: [ 1  1  1  0  1  2  0  1  1  1 -1  2  1  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1  0 -1  1  0  0  0 -1  1 -1  1 -1  1] (Indices: [0, 6, 8, 9, 11, 12, 13, 14, 16, 18]), Candidate: [ 1  1  1  0  1  2  0  1  1  0  1  1  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1  0 -1  1 -1  0  0  1  0  0  0  0  0] (Indices: [0, 6, 8, 9, 11, 15, 16, 17, 18, 19]), Candidate: [1 1 1 0 1 2 0 1 1 0 1 0 1 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 91400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1 -1  1  0  0 -1  1  0  0 -1  1 -1  1] (Indices: [0, 6, 8, 10, 11, 12, 14, 15, 16, 18]), Candidate: [1 1 1 0 1 2 0 1 0 2 0 1 0 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 91450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1 -1  1 -1  1 -1  1  0  0  0  0 -1  1] (Indices: [0, 6, 8, 10, 12, 14, 15, 16, 17, 18]), Candidate: [ 1  1  1  0  1  2  0  1  0  2 -1  2  0  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  1  0  0  0  0  0  0 -1  1 -1  0  1] (Indices: [0, 6, 9, 10, 11, 12, 13, 14, 15, 17]), Candidate: [1 1 1 0 1 2 0 0 2 1 0 1 1 1 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 91550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  1  0  0 -1  0  1  0  0  0 -1  1  0] (Indices: [0, 6, 9, 10, 11, 14, 15, 16, 17, 19]), Candidate: [1 1 1 0 1 2 0 0 2 1 0 0 1 2 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 91600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  1 -1  1  0 -1  1  0  0 -1  1  0  0] (Indices: [0, 6, 9, 11, 12, 14, 15, 16, 18, 19]), Candidate: [1 1 1 0 1 2 0 0 2 0 1 1 0 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 91650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  0  1 -1  1  0  0  0 -1  1  0  0  0] (Indices: [0, 6, 10, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 1  1  1  0  1  2  0  0  1  2 -1  2  1  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0  0  0  0 -1  1  0  0 -1  1 -1  0  1] (Indices: [0, 7, 8, 9, 10, 11, 13, 14, 15, 17]), Candidate: [1 1 1 0 1 1 2 0 1 1 0 0 2 1 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 91750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0  0  0 -1  1  0 -1  0  1  0  0 -1  1] (Indices: [0, 7, 8, 9, 10, 12, 13, 16, 17, 18]), Candidate: [ 1  1  1  0  1  1  2  0  1  1 -1  2  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0  0 -1  1  0  0 -1  1  0  0 -1  0  1] (Indices: [0, 7, 8, 9, 11, 12, 13, 15, 16, 17]), Candidate: [1 1 1 0 1 1 2 0 1 0 1 1 1 0 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 91850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0  0 -1  0  1  0  0  0 -1  1 -1  1  0] (Indices: [0, 7, 8, 9, 12, 13, 14, 15, 17, 19]), Candidate: [1 1 1 0 1 1 2 0 1 0 0 2 1 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 91900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0 -1  1  0  0 -1  1 -1  1  0  0 -1  1] (Indices: [0, 7, 8, 10, 11, 12, 14, 16, 17, 18]), Candidate: [ 1  1  1  0  1  1  2  0  0  2  0  1  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0 -1  1 -1  1 -1  0  1  0  0  0  0  0] (Indices: [0, 7, 8, 10, 12, 15, 16, 17, 18, 19]), Candidate: [ 1  1  1  0  1  1  2  0  0  2 -1  2  0  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  1  0  0  0  0  0 -1  1 -1  0  1  0] (Indices: [0, 7, 9, 10, 11, 12, 13, 14, 16, 19]), Candidate: [ 1  1  1  0  1  1  2 -1  2  1  0  1  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 92050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  1  0 -1  1  0  0  0  0  0 -1  0  1] (Indices: [0, 7, 9, 10, 12, 13, 14, 15, 16, 17]), Candidate: [ 1  1  1  0  1  1  2 -1  2  1 -1  2  1  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 92100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  1 -1  1 -1  1  0  0  0  0 -1  1  0] (Indices: [0, 7, 9, 11, 13, 14, 15, 16, 17, 19]), Candidate: [ 1  1  1  0  1  1  2 -1  2  0  1  0  2  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  0  0  1  0  0  0  0  0  0  0 -1  1] (Indices: [0, 7, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 1  1  1  0  1  1  2 -1  1  1  1  1  1  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1  0  0  0 -1  1  0 -1  1  0  0 -1  1] (Indices: [0, 8, 9, 10, 11, 13, 14, 16, 17, 18]), Candidate: [ 1  1  1  0  1  1  1  1  1  1  0  0  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1  0 -1  1  0  0  0 -1  1  0 -1  1  0] (Indices: [0, 8, 9, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 1  1  1  0  1  1  1  1  1  0  1  1  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1 -1  1  0 -1  1  0  0  0  0  0 -1  1] (Indices: [0, 8, 10, 11, 13, 14, 15, 16, 17, 18]), Candidate: [1 1 1 0 1 1 1 1 0 2 0 0 2 1 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 92350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  0  1  0  0 -1  1 -1  1  0  0  0  0  0] (Indices: [0, 9, 10, 11, 13, 15, 16, 17, 18, 19]), Candidate: [1 1 1 0 1 1 1 0 2 1 0 0 2 0 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 92400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0 -1  0  1 -1  0  1 -1  0  0  0  0  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 11, 14]), Candidate: [ 3  1  1  0  1  1  1  0  0  1  1  0  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  1 -1  1 -1  0  0  0  0  0  0  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 7, 9, 11, 19]), Candidate: [ 3  1  1  0  1  1  1 -1  2  0  1  0  1  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  0  1 -1  0  0  1  0 -1  0  0  0  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 10, 14, 15]), Candidate: [ 3  1  1  0  1  1  1 -1  1  2 -1  1  1  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 92550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  0  0  0  1 -1  1 -1  1 -1  0  0  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 12, 14, 16]), Candidate: [ 3  1  1  0  1  1  1 -1  1  1  0  2  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 92600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1  0  0 -1  1 -1  0  0  0  0  0  0  0] (Indices: [1, 2, 3, 4, 5, 6, 8, 9, 10, 12]), Candidate: [ 3  1  1  0  1  1  0  1  1  1 -1  2  0  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1 -1  1  0 -1  0  0  0  0  0  1 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 8, 10, 11, 18]), Candidate: [3 1 1 0 1 1 0 1 0 2 0 0 1 1 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 92700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1 -1  0  1 -1  0  0  1 -1  0  1 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 8, 11, 15, 18]), Candidate: [3 1 1 0 1 1 0 1 0 1 1 0 1 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 92750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1 -1  0  0  0  0  1 -1  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 8, 14, 16, 19]), Candidate: [ 3  1  1  0  1  1  0  1  0  1  0  1  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  1 -1  1  0  0 -1  0  0  0  0  0  0] (Indices: [1, 2, 3, 4, 5, 6, 9, 11, 12, 13]), Candidate: [3 1 1 0 1 1 0 0 2 0 1 1 1 0 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 92850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  1 -1  0  0  1  0 -1  1 -1  0  0  0] (Indices: [1, 2, 3, 4, 5, 6, 9, 13, 14, 16]), Candidate: [ 3  1  1  0  1  1  0  0  2  0  0  1  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  0  1  0 -1  0  1 -1  0  0  1 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 10, 11, 14, 18]), Candidate: [ 3  1  1  0  1  1  0  0  1  2  0  0  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  0  1 -1  0  0  1  0 -1  0  1 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 10, 14, 15, 18]), Candidate: [ 3  1  1  0  1  1  0  0  1  2 -1  1  1  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  0  0  1 -1  1 -1  0  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 11, 13, 16, 19]), Candidate: [3 1 1 0 1 1 0 0 1 1 1 0 2 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 93050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  0  0  0  1 -1  0  1  0 -1  1 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 12, 15, 16, 18]), Candidate: [3 1 1 0 1 1 0 0 1 1 0 2 0 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 93100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0  0  0 -1  0  0  0  0  0  1 -1  0  0] (Indices: [1, 2, 3, 4, 5, 7, 8, 9, 10, 17]), Candidate: [ 3  1  1  0  1  0  2  0  1  1 -1  1  1  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0 -1  1 -1  1 -1  0  0  1 -1  0  0  0] (Indices: [1, 2, 3, 4, 5, 7, 8, 10, 12, 16]), Candidate: [ 3  1  1  0  1  0  2  0  0  2 -1  2  0  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0 -1  0  1 -1  0  0  0  0  1  0 -1  0] (Indices: [1, 2, 3, 4, 5, 7, 8, 11, 17, 18]), Candidate: [3 1 1 0 1 0 2 0 0 1 1 0 1 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 93250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0 -1  0  0  0  0  0  1  0 -1  1 -1  0] (Indices: [1, 2, 3, 4, 5, 7, 8, 15, 16, 18]), Candidate: [3 1 1 0 1 0 2 0 0 1 0 1 1 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 93300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  1 -1  1  0 -1  0  0  0  0  1 -1  0] (Indices: [1, 2, 3, 4, 5, 7, 9, 11, 12, 18]), Candidate: [ 3  1  1  0  1  0  2 -1  2  0  1  1  0  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  1 -1  0  0  1 -1  1 -1  1 -1  0  0] (Indices: [1, 2, 3, 4, 5, 7, 9, 13, 15, 17]), Candidate: [ 3  1  1  0  1  0  2 -1  2  0  0  1  2  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  0  1  0 -1  0  0  1 -1  0  0  1 -1] (Indices: [1, 2, 3, 4, 5, 7, 10, 11, 15, 19]), Candidate: [ 3  1  1  0  1  0  2 -1  1  2  0  0  1  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  0  1 -1  0  0  1 -1  0  1  0 -1  0] (Indices: [1, 2, 3, 4, 5, 7, 10, 14, 17, 18]), Candidate: [ 3  1  1  0  1  0  2 -1  1  2 -1  1  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 93500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  0  0  1 -1  0  1  0 -1  1 -1  0  0] (Indices: [1, 2, 3, 4, 5, 7, 11, 14, 15, 17]), Candidate: [ 3  1  1  0  1  0  2 -1  1  1  1  0  1  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  0  0  0  1 -1  0  0  1  0  0 -1  0] (Indices: [1, 2, 3, 4, 5, 7, 12, 16, 17, 18]), Candidate: [ 3  1  1  0  1  0  2 -1  1  1  0  2  0  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1  0  0 -1  1 -1  0  0  1 -1  0  0  0] (Indices: [1, 2, 3, 4, 5, 8, 9, 10, 12, 16]), Candidate: [ 3  1  1  0  1  0  1  1  1  1 -1  2  0  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1  0 -1  1 -1  0  0  0  0  1  0 -1  0] (Indices: [1, 2, 3, 4, 5, 8, 9, 11, 17, 18]), Candidate: [3 1 1 0 1 0 1 1 1 0 1 0 1 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 93700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1  0 -1  0  0  0  0  1  0 -1  1 -1  0] (Indices: [1, 2, 3, 4, 5, 8, 9, 15, 16, 18]), Candidate: [3 1 1 0 1 0 1 1 1 0 0 1 1 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 93750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1 -1  1 -1  1 -1  0  1 -1  0  1 -1  0] (Indices: [1, 2, 3, 4, 5, 8, 10, 12, 15, 18]), Candidate: [ 3  1  1  0  1  0  1  1  0  2 -1  2  0  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1 -1  0  1  0 -1  1 -1  1 -1  0  0  0] (Indices: [1, 2, 3, 4, 5, 8, 11, 12, 14, 16]), Candidate: [ 3  1  1  0  1  0  1  1  0  1  1  1  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1 -1  0  0  1  0  0 -1  1 -1  0  0  0] (Indices: [1, 2, 3, 4, 5, 8, 12, 13, 14, 16]), Candidate: [ 3  1  1  0  1  0  1  1  0  1  0  2  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1 -1  0  0  0  1 -1  0  1  0  0 -1  0] (Indices: [1, 2, 3, 4, 5, 8, 13, 16, 17, 18]), Candidate: [3 1 1 0 1 0 1 1 0 1 0 1 2 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 93950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  1  0 -1  1  0 -1  0  0  1 -1  0  0] (Indices: [1, 2, 3, 4, 5, 9, 10, 12, 13, 17]), Candidate: [ 3  1  1  0  1  0  1  0  2  1 -1  2  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  1  0 -1  0  0  0  0  1  0 -1  1 -1] (Indices: [1, 2, 3, 4, 5, 9, 10, 16, 17, 19]), Candidate: [ 3  1  1  0  1  0  1  0  2  1 -1  1  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  1 -1  1 -1  0  0  1  0 -1  1 -1  0] (Indices: [1, 2, 3, 4, 5, 9, 11, 15, 16, 18]), Candidate: [3 1 1 0 1 0 1 0 2 0 1 0 1 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 94100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  1 -1  0  0  1  0 -1  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 5, 9, 13, 14, 16, 19]), Candidate: [ 3  1  1  0  1  0  1  0  2  0  0  1  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  0  1  0 -1  1  0  0 -1  0  0  0  0] (Indices: [1, 2, 3, 4, 5, 10, 11, 13, 14, 15]), Candidate: [3 1 1 0 1 0 1 0 1 2 0 0 2 1 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 94200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  0  1 -1  1 -1  1  0  0 -1  0  0  0] (Indices: [1, 2, 3, 4, 5, 10, 12, 14, 15, 16]), Candidate: [ 3  1  1  0  1  0  1  0  1  2 -1  2  0  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  0  1 -1  0  0  0  1  0  0  0 -1  0] (Indices: [1, 2, 3, 4, 5, 10, 15, 16, 17, 18]), Candidate: [ 3  1  1  0  1  0  1  0  1  2 -1  1  1  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  0  0  1 -1  1 -1  1  0  0 -1  0  0] (Indices: [1, 2, 3, 4, 5, 11, 13, 15, 16, 17]), Candidate: [3 1 1 0 1 0 1 0 1 1 1 0 2 0 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 94350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  0  0  0  1 -1  1  0 -1  0  1  0 -1] (Indices: [1, 2, 3, 4, 5, 12, 14, 15, 18, 19]), Candidate: [3 1 1 0 1 0 1 0 1 1 0 2 0 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 94400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0  0 -1  0  1 -1  0  1 -1  0  0  0  0] (Indices: [1, 2, 3, 4, 6, 7, 8, 9, 12, 15]), Candidate: [3 1 1 0 0 2 1 0 1 0 0 2 0 1 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 94450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0 -1  1 -1  0  0  1 -1  0  0  1 -1  0] (Indices: [1, 2, 3, 4, 6, 7, 8, 10, 14, 18]), Candidate: [ 3  1  1  0  0  2  1  0  0  2 -1  1  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 94500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0 -1  0  0  1 -1  1 -1  0  0  0  1 -1] (Indices: [1, 2, 3, 4, 6, 7, 8, 12, 14, 19]), Candidate: [ 3  1  1  0  0  2  1  0  0  1  0  2  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  1  0  0 -1  0  0  0  1 -1  0  0  0] (Indices: [1, 2, 3, 4, 6, 7, 9, 10, 11, 16]), Candidate: [ 3  1  1  0  0  2  1 -1  2  1  0  0  1  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  1 -1  1 -1  0  0  1  0 -1  0  0  0] (Indices: [1, 2, 3, 4, 6, 7, 9, 11, 15, 16]), Candidate: [ 3  1  1  0  0  2  1 -1  2  0  1  0  1  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  1 -1  0  0  0  1 -1  1  0 -1  0  0] (Indices: [1, 2, 3, 4, 6, 7, 9, 14, 16, 17]), Candidate: [ 3  1  1  0  0  2  1 -1  2  0  0  1  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 94700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  0  1 -1  1 -1  1  0 -1  0  0  0  0] (Indices: [1, 2, 3, 4, 6, 7, 10, 12, 14, 15]), Candidate: [ 3  1  1  0  0  2  1 -1  1  2 -1  2  0  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 94750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  0  0  1  0  0  0 -1  0  0  0  0  0] (Indices: [1, 2, 3, 4, 6, 7, 11, 12, 13, 14]), Candidate: [ 3  1  1  0  0  2  1 -1  1  1  1  1  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 94800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  0  0  1 -1  0  0  1 -1  1 -1  1 -1] (Indices: [1, 2, 3, 4, 6, 7, 11, 15, 17, 19]), Candidate: [ 3  1  1  0  0  2  1 -1  1  1  1  0  1  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  0  0  0  0  1  0 -1  0  0  1  0 -1] (Indices: [1, 2, 3, 4, 6, 7, 13, 14, 18, 19]), Candidate: [ 3  1  1  0  0  2  1 -1  1  1  0  1  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 94900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1  0  0 -1  0  0  1 -1  0  0  1 -1  0] (Indices: [1, 2, 3, 4, 6, 8, 9, 10, 14, 18]), Candidate: [ 3  1  1  0  0  2  0  1  1  1 -1  1  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 94950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1  0 -1  0  1 -1  1 -1  0  0  0  1 -1] (Indices: [1, 2, 3, 4, 6, 8, 9, 12, 14, 19]), Candidate: [ 3  1  1  0  0  2  0  1  1  0  0  2  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1 -1  1  0  0 -1  0  0  0  1 -1  0  0] (Indices: [1, 2, 3, 4, 6, 8, 10, 11, 12, 17]), Candidate: [3 1 1 0 0 2 0 1 0 2 0 1 0 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 95050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1 -1  1 -1  0  1 -1  1  0 -1  0  0  0] (Indices: [1, 2, 3, 4, 6, 8, 10, 13, 15, 16]), Candidate: [ 3  1  1  0  0  2  0  1  0  2 -1  1  2  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1 -1  0  1  0 -1  0  0  0  0  1  0 -1] (Indices: [1, 2, 3, 4, 6, 8, 11, 12, 18, 19]), Candidate: [3 1 1 0 0 2 0 1 0 1 1 1 0 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 95150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1 -1  0  0  1  0 -1  0  0  0  1  0 -1] (Indices: [1, 2, 3, 4, 6, 8, 12, 13, 18, 19]), Candidate: [3 1 1 0 0 2 0 1 0 1 0 2 1 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 95200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1 -1  0  0  0  0  1 -1  0  1  0  0 -1] (Indices: [1, 2, 3, 4, 6, 8, 14, 17, 18, 19]), Candidate: [ 3  1  1  0  0  2  0  1  0  1  0  1  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  1  0 -1  1 -1  0  0  1 -1  1 -1  0] (Indices: [1, 2, 3, 4, 6, 9, 10, 12, 16, 18]), Candidate: [ 3  1  1  0  0  2  0  0  2  1 -1  2  0  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  1 -1  1  0 -1  1 -1  0  0  0  1 -1] (Indices: [1, 2, 3, 4, 6, 9, 11, 12, 14, 19]), Candidate: [ 3  1  1  0  0  2  0  0  2  0  1  1  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  1 -1  0  1  0  0 -1  0  0  0  1 -1] (Indices: [1, 2, 3, 4, 6, 9, 12, 13, 14, 19]), Candidate: [ 3  1  1  0  0  2  0  0  2  0  0  2  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  1 -1  0  0  1 -1  0  0  1  0  0 -1] (Indices: [1, 2, 3, 4, 6, 9, 13, 17, 18, 19]), Candidate: [3 1 1 0 0 2 0 0 2 0 0 1 2 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 95450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  0  1  0 -1  1 -1  0  0  1 -1  1 -1] (Indices: [1, 2, 3, 4, 6, 10, 11, 13, 17, 19]), Candidate: [3 1 1 0 0 2 0 0 1 2 0 0 2 0 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 95500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  0  1 -1  1 -1  0  1 -1  1  0 -1  0] (Indices: [1, 2, 3, 4, 6, 10, 12, 15, 17, 18]), Candidate: [ 3  1  1  0  0  2  0  0  1  2 -1  2  0  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  0  0  1  0  0 -1  1 -1  0  0  1 -1] (Indices: [1, 2, 3, 4, 6, 11, 12, 13, 15, 19]), Candidate: [3 1 1 0 0 2 0 0 1 1 1 1 1 0 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 95600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  0  0  1 -1  0  1  0 -1  1  0 -1  0] (Indices: [1, 2, 3, 4, 6, 11, 14, 15, 17, 18]), Candidate: [3 1 1 0 0 2 0 0 1 1 1 0 1 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 95650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  0  0  0  0  1  0  0 -1  1  0 -1  0] (Indices: [1, 2, 3, 4, 6, 13, 14, 15, 17, 18]), Candidate: [3 1 1 0 0 2 0 0 1 1 0 1 2 1 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 95700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0  0  0 -1  0  0  0  0  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 7, 8, 9, 10, 16, 19]), Candidate: [ 3  1  1  0  0  1  2  0  1  1 -1  1  1  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0  0 -1  0  1 -1  0  0  0  1  0 -1  0] (Indices: [1, 2, 3, 4, 7, 8, 9, 12, 17, 18]), Candidate: [3 1 1 0 0 1 2 0 1 0 0 2 0 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 95800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0 -1  1  0 -1  1 -1  0  0  0  0  1 -1] (Indices: [1, 2, 3, 4, 7, 8, 10, 11, 13, 19]), Candidate: [3 1 1 0 0 1 2 0 0 2 0 0 2 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 95850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0 -1  1 -1  0  1 -1  0  0  1 -1  1 -1] (Indices: [1, 2, 3, 4, 7, 8, 10, 13, 17, 19]), Candidate: [ 3  1  1  0  0  1  2  0  0  2 -1  1  2  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0 -1  0  1 -1  1 -1  1 -1  0  1 -1  0] (Indices: [1, 2, 3, 4, 7, 8, 11, 13, 15, 18]), Candidate: [3 1 1 0 0 1 2 0 0 1 1 0 2 0 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 95950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0 -1  0  0  1 -1  1 -1  0  1  0 -1  0] (Indices: [1, 2, 3, 4, 7, 8, 12, 14, 17, 18]), Candidate: [ 3  1  1  0  0  1  2  0  0  1  0  2  0  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  1  0  0  0 -1  0  1 -1  0  0  0  0] (Indices: [1, 2, 3, 4, 7, 9, 10, 11, 12, 15]), Candidate: [ 3  1  1  0  0  1  2 -1  2  1  0  1  0  1  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  1  0 -1  0  1  0 -1  0  0  1 -1  0] (Indices: [1, 2, 3, 4, 7, 9, 10, 13, 14, 18]), Candidate: [ 3  1  1  0  0  1  2 -1  2  1 -1  1  2  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 96100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  1 -1  1  0 -1  0  0  0  1  0 -1  0] (Indices: [1, 2, 3, 4, 7, 9, 11, 12, 17, 18]), Candidate: [ 3  1  1  0  0  1  2 -1  2  0  1  1  0  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  1 -1  0  1  0 -1  0  0  1  0 -1  0] (Indices: [1, 2, 3, 4, 7, 9, 12, 13, 17, 18]), Candidate: [ 3  1  1  0  0  1  2 -1  2  0  0  2  1  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  1 -1  0  0  0  1 -1  1  0 -1  1 -1] (Indices: [1, 2, 3, 4, 7, 9, 14, 16, 17, 19]), Candidate: [ 3  1  1  0  0  1  2 -1  2  0  0  1  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 96250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  0  1  0 -1  0  1 -1  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 7, 10, 11, 14, 16, 19]), Candidate: [ 3  1  1  0  0  1  2 -1  1  2  0  0  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 96300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  0  1 -1  0  1  0  0 -1  1 -1  0  0] (Indices: [1, 2, 3, 4, 7, 10, 13, 14, 15, 17]), Candidate: [ 3  1  1  0  0  1  2 -1  1  2 -1  1  2  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 96350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  0  0  1  0 -1  1  0 -1  1 -1  0  0] (Indices: [1, 2, 3, 4, 7, 11, 12, 14, 15, 17]), Candidate: [ 3  1  1  0  0  1  2 -1  1  1  1  1  0  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  0  0  1 -1  0  0  1  0  0 -1  1 -1] (Indices: [1, 2, 3, 4, 7, 11, 15, 16, 17, 19]), Candidate: [ 3  1  1  0  0  1  2 -1  1  1  1  0  1  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  0  0  0  0  1 -1  1  0  0 -1  1 -1] (Indices: [1, 2, 3, 4, 7, 13, 15, 16, 17, 19]), Candidate: [ 3  1  1  0  0  1  2 -1  1  1  0  1  2  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1  0  0 -1  1 -1  0  1 -1  1 -1  0  0] (Indices: [1, 2, 3, 4, 8, 9, 10, 12, 15, 17]), Candidate: [ 3  1  1  0  0  1  1  1  1  1 -1  2  0  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1  0 -1  1  0 -1  1  0 -1  0  0  0  0] (Indices: [1, 2, 3, 4, 8, 9, 11, 12, 14, 15]), Candidate: [3 1 1 0 0 1 1 1 1 0 1 1 0 2 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 96600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1  0 -1  0  1  0  0  0 -1  0  0  0  0] (Indices: [1, 2, 3, 4, 8, 9, 12, 13, 14, 15]), Candidate: [3 1 1 0 0 1 1 1 1 0 0 2 1 1 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 96650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1  0 -1  0  0  1 -1  1 -1  0  1  0 -1] (Indices: [1, 2, 3, 4, 8, 9, 13, 15, 18, 19]), Candidate: [3 1 1 0 0 1 1 1 1 0 0 1 2 0 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 96700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1 -1  1  0 -1  1 -1  0  1  0 -1  0  0] (Indices: [1, 2, 3, 4, 8, 10, 11, 13, 16, 17]), Candidate: [3 1 1 0 0 1 1 1 0 2 0 0 2 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 96750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1 -1  1 -1  1 -1  1 -1  0  0  1  0 -1] (Indices: [1, 2, 3, 4, 8, 10, 12, 14, 18, 19]), Candidate: [ 3  1  1  0  0  1  1  1  0  2 -1  2  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 96800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1 -1  0  1  0  0  0 -1  0  0  0  1 -1] (Indices: [1, 2, 3, 4, 8, 11, 12, 13, 14, 19]), Candidate: [ 3  1  1  0  0  1  1  1  0  1  1  1  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1 -1  0  1 -1  1 -1  0  0  1  0  0 -1] (Indices: [1, 2, 3, 4, 8, 11, 13, 17, 18, 19]), Candidate: [3 1 1 0 0 1 1 1 0 1 1 0 2 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 96900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1 -1  0  0  1 -1  0  0  1  0  0  0 -1] (Indices: [1, 2, 3, 4, 8, 12, 16, 17, 18, 19]), Candidate: [3 1 1 0 0 1 1 1 0 1 0 2 0 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 96950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  1  0  0 -1  1 -1  1 -1  0  1 -1  0] (Indices: [1, 2, 3, 4, 9, 10, 11, 13, 15, 18]), Candidate: [3 1 1 0 0 1 1 0 2 1 0 0 2 0 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 97000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  1  0 -1  1 -1  1 -1  0  1  0 -1  0] (Indices: [1, 2, 3, 4, 9, 10, 12, 14, 17, 18]), Candidate: [ 3  1  1  0  0  1  1  0  2  1 -1  2  0  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 97050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  1 -1  1  0  0  0 -1  0  1 -1  0  0] (Indices: [1, 2, 3, 4, 9, 11, 12, 13, 14, 17]), Candidate: [ 3  1  1  0  0  1  1  0  2  0  1  1  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 97100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  1 -1  1 -1  1 -1  0  1  0 -1  1 -1] (Indices: [1, 2, 3, 4, 9, 11, 13, 16, 17, 19]), Candidate: [3 1 1 0 0 1 1 0 2 0 1 0 2 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 97150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  1 -1  0  1 -1  0  1  0 -1  1  0 -1] (Indices: [1, 2, 3, 4, 9, 12, 15, 16, 18, 19]), Candidate: [3 1 1 0 0 1 1 0 2 0 0 2 0 1 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 97200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  0  1  0  0 -1  0  1  0 -1  1 -1  0] (Indices: [1, 2, 3, 4, 10, 11, 12, 15, 16, 18]), Candidate: [3 1 1 0 0 1 1 0 1 2 0 1 0 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 97250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  0  1 -1  1  0  0 -1  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 10, 12, 13, 14, 16, 19]), Candidate: [ 3  1  1  0  0  1  1  0  1  2 -1  2  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 97300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  0  0  1  0  0  0  0  0 -1  0  0  0] (Indices: [1, 2, 3, 4, 11, 12, 13, 14, 15, 16]), Candidate: [3 1 1 0 0 1 1 0 1 1 1 1 1 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 97350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  0  0  1 -1  0  1  0  0  0  0 -1  0] (Indices: [1, 2, 3, 4, 11, 14, 15, 16, 17, 18]), Candidate: [3 1 1 0 0 1 1 0 1 1 1 0 1 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 97400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0  0 -1  1 -1  0  0  0  0  0  0  1 -1] (Indices: [1, 2, 3, 5, 6, 7, 8, 9, 11, 19]), Candidate: [ 3  1  1 -1  2  1  1  0  1  0  1  0  1  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 97450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0 -1  1 -1  0  0  1  0 -1  0  0  0  0] (Indices: [1, 2, 3, 5, 6, 7, 8, 10, 14, 15]), Candidate: [ 3  1  1 -1  2  1  1  0  0  2 -1  1  1  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 97500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0 -1  0  0  1 -1  1 -1  1 -1  0  0  0] (Indices: [1, 2, 3, 5, 6, 7, 8, 12, 14, 16]), Candidate: [ 3  1  1 -1  2  1  1  0  0  1  0  2  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 97550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  1  0  0 -1  1 -1  0  0  0  0  0  0] (Indices: [1, 2, 3, 5, 6, 7, 9, 10, 11, 13]), Candidate: [ 3  1  1 -1  2  1  1 -1  2  1  0  0  2  0  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 97600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  1 -1  1 -1  0  1 -1  0  1 -1  0  0] (Indices: [1, 2, 3, 5, 6, 7, 9, 11, 14, 17]), Candidate: [ 3  1  1 -1  2  1  1 -1  2  0  1  0  1  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 97650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  1 -1  0  0  0  1  0 -1  1 -1  0  0] (Indices: [1, 2, 3, 5, 6, 7, 9, 14, 15, 17]), Candidate: [ 3  1  1 -1  2  1  1 -1  2  0  0  1  1  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 97700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  0  1 -1  1  0 -1  0  0  1 -1  0  0] (Indices: [1, 2, 3, 5, 6, 7, 10, 12, 13, 17]), Candidate: [ 3  1  1 -1  2  1  1 -1  1  2 -1  2  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 97750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  0  1 -1  0  0  0  0  1  0 -1  1 -1] (Indices: [1, 2, 3, 5, 6, 7, 10, 16, 17, 19]), Candidate: [ 3  1  1 -1  2  1  1 -1  1  2 -1  1  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 97800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  0  0  1 -1  0  0  1  0 -1  1 -1  0] (Indices: [1, 2, 3, 5, 6, 7, 11, 15, 16, 18]), Candidate: [ 3  1  1 -1  2  1  1 -1  1  1  1  0  1  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 97850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  0  0  0  0  1  0 -1  1 -1  0  1 -1] (Indices: [1, 2, 3, 5, 6, 7, 13, 14, 16, 19]), Candidate: [ 3  1  1 -1  2  1  1 -1  1  1  0  1  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 97900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1  0  0 -1  0  0  1  0 -1  0  0  0  0] (Indices: [1, 2, 3, 5, 6, 8, 9, 10, 14, 15]), Candidate: [ 3  1  1 -1  2  1  0  1  1  1 -1  1  1  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 97950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1  0 -1  0  1 -1  1 -1  1 -1  0  0  0] (Indices: [1, 2, 3, 5, 6, 8, 9, 12, 14, 16]), Candidate: [ 3  1  1 -1  2  1  0  1  1  0  0  2  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 98000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1 -1  1  0  0 -1  1 -1  0  0  0  0  0] (Indices: [1, 2, 3, 5, 6, 8, 10, 11, 12, 14]), Candidate: [ 3  1  1 -1  2  1  0  1  0  2  0  1  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 98050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1 -1  1 -1  0  1  0 -1  0  1 -1  0  0] (Indices: [1, 2, 3, 5, 6, 8, 10, 13, 14, 17]), Candidate: [ 3  1  1 -1  2  1  0  1  0  2 -1  1  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 98100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1 -1  0  1  0 -1  0  0  1 -1  0  1 -1] (Indices: [1, 2, 3, 5, 6, 8, 11, 12, 16, 19]), Candidate: [ 3  1  1 -1  2  1  0  1  0  1  1  1  0  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1 -1  0  0  1  0 -1  0  1 -1  0  1 -1] (Indices: [1, 2, 3, 5, 6, 8, 12, 13, 16, 19]), Candidate: [ 3  1  1 -1  2  1  0  1  0  1  0  2  1  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1 -1  0  0  0  0  1 -1  1  0  0 -1  0] (Indices: [1, 2, 3, 5, 6, 8, 14, 16, 17, 18]), Candidate: [ 3  1  1 -1  2  1  0  1  0  1  0  1  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 98250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  1  0 -1  1 -1  0  1 -1  0  1 -1  0] (Indices: [1, 2, 3, 5, 6, 9, 10, 12, 15, 18]), Candidate: [ 3  1  1 -1  2  1  0  0  2  1 -1  2  0  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 98300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  1 -1  1  0 -1  1 -1  1 -1  0  0  0] (Indices: [1, 2, 3, 5, 6, 9, 11, 12, 14, 16]), Candidate: [ 3  1  1 -1  2  1  0  0  2  0  1  1  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 98350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  1 -1  0  1  0  0 -1  1 -1  0  0  0] (Indices: [1, 2, 3, 5, 6, 9, 12, 13, 14, 16]), Candidate: [ 3  1  1 -1  2  1  0  0  2  0  0  2  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 98400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  1 -1  0  0  1 -1  0  1  0  0 -1  0] (Indices: [1, 2, 3, 5, 6, 9, 13, 16, 17, 18]), Candidate: [ 3  1  1 -1  2  1  0  0  2  0  0  1  2  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  0  1  0 -1  1 -1  0  1 -1  1 -1  0] (Indices: [1, 2, 3, 5, 6, 10, 11, 13, 16, 18]), Candidate: [ 3  1  1 -1  2  1  0  0  1  2  0  0  2  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  0  1 -1  1 -1  0  1  0  0 -1  0  0] (Indices: [1, 2, 3, 5, 6, 10, 12, 15, 16, 17]), Candidate: [ 3  1  1 -1  2  1  0  0  1  2 -1  2  0  1  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 98550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  0  0  1  0  0 -1  1  0 -1  0  0  0] (Indices: [1, 2, 3, 5, 6, 11, 12, 13, 15, 16]), Candidate: [ 3  1  1 -1  2  1  0  0  1  1  1  1  1  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  0  0  1 -1  0  1  0  0  0 -1  0  0] (Indices: [1, 2, 3, 5, 6, 11, 14, 15, 16, 17]), Candidate: [ 3  1  1 -1  2  1  0  0  1  1  1  0  1  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  0  0  0  0  1  0  0  0  0 -1  0  0] (Indices: [1, 2, 3, 5, 6, 13, 14, 15, 16, 17]), Candidate: [ 3  1  1 -1  2  1  0  0  1  1  0  1  2  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0  0  0 -1  0  0  0  1 -1  0  0  1 -1] (Indices: [1, 2, 3, 5, 7, 8, 9, 10, 15, 19]), Candidate: [ 3  1  1 -1  2  0  2  0  1  1 -1  1  1  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 98750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0  0 -1  0  1 -1  0  0  1  0 -1  0  0] (Indices: [1, 2, 3, 5, 7, 8, 9, 12, 16, 17]), Candidate: [ 3  1  1 -1  2  0  2  0  1  0  0  2  0  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0 -1  1  0 -1  1 -1  0  1 -1  0  0  0] (Indices: [1, 2, 3, 5, 7, 8, 10, 11, 13, 16]), Candidate: [ 3  1  1 -1  2  0  2  0  0  2  0  0  2  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0 -1  1 -1  0  1 -1  0  1 -1  1 -1  0] (Indices: [1, 2, 3, 5, 7, 8, 10, 13, 16, 18]), Candidate: [ 3  1  1 -1  2  0  2  0  0  2 -1  1  2  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 98900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0 -1  0  1 -1  1  0 -1  0  0  0  1 -1] (Indices: [1, 2, 3, 5, 7, 8, 11, 13, 14, 19]), Candidate: [ 3  1  1 -1  2  0  2  0  0  1  1  0  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 98950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0 -1  0  0  1 -1  1 -1  1  0 -1  0  0] (Indices: [1, 2, 3, 5, 7, 8, 12, 14, 16, 17]), Candidate: [ 3  1  1 -1  2  0  2  0  0  1  0  2  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 99000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0 -1  0  0  0  0  0  0  1  0  0  0 -1] (Indices: [1, 2, 3, 5, 7, 8, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  0  2  0  0  1  0  1  1  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 99050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  1  0 -1  0  1  0  0 -1  0  0  0  0] (Indices: [1, 2, 3, 5, 7, 9, 10, 13, 14, 15]), Candidate: [ 3  1  1 -1  2  0  2 -1  2  1 -1  1  2  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 99100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  1 -1  1  0 -1  0  0  1  0 -1  0  0] (Indices: [1, 2, 3, 5, 7, 9, 11, 12, 16, 17]), Candidate: [ 3  1  1 -1  2  0  2 -1  2  0  1  1  0  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 99150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  1 -1  0  1  0 -1  0  1  0 -1  0  0] (Indices: [1, 2, 3, 5, 7, 9, 12, 13, 16, 17]), Candidate: [ 3  1  1 -1  2  0  2 -1  2  0  0  2  1  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 99200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  1 -1  0  0  0  1  0 -1  1 -1  1 -1] (Indices: [1, 2, 3, 5, 7, 9, 14, 15, 17, 19]), Candidate: [ 3  1  1 -1  2  0  2 -1  2  0  0  1  1  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 99250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  0  1  0 -1  0  1  0 -1  0  0  1 -1] (Indices: [1, 2, 3, 5, 7, 10, 11, 14, 15, 19]), Candidate: [ 3  1  1 -1  2  0  2 -1  1  2  0  0  1  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 99300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  0  1 -1  1 -1  0  0  1 -1  1  0 -1] (Indices: [1, 2, 3, 5, 7, 10, 12, 16, 18, 19]), Candidate: [ 3  1  1 -1  2  0  2 -1  1  2 -1  2  0  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 99350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  0  0  1  0  0 -1  0  0  1 -1  1 -1] (Indices: [1, 2, 3, 5, 7, 11, 12, 13, 17, 19]), Candidate: [ 3  1  1 -1  2  0  2 -1  1  1  1  1  1  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 99400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  0  0  1 -1  0  1 -1  1 -1  1  0 -1] (Indices: [1, 2, 3, 5, 7, 11, 14, 16, 18, 19]), Candidate: [ 3  1  1 -1  2  0  2 -1  1  1  1  0  1  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 99450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  0  0  0  0  1  0 -1  1 -1  1  0 -1] (Indices: [1, 2, 3, 5, 7, 13, 14, 16, 18, 19]), Candidate: [ 3  1  1 -1  2  0  2 -1  1  1  0  1  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 99500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1  0  0 -1  1 -1  1 -1  0  0  1 -1  0] (Indices: [1, 2, 3, 5, 8, 9, 10, 12, 14, 18]), Candidate: [ 3  1  1 -1  2  0  1  1  1  1 -1  2  0  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 99550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1  0 -1  1  0  0 -1  0  0  1 -1  0  0] (Indices: [1, 2, 3, 5, 8, 9, 11, 12, 13, 17]), Candidate: [ 3  1  1 -1  2  0  1  1  1  0  1  1  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 99600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1  0 -1  1 -1  0  0  0  1  0 -1  1 -1] (Indices: [1, 2, 3, 5, 8, 9, 11, 16, 17, 19]), Candidate: [ 3  1  1 -1  2  0  1  1  1  0  1  0  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 99650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1  0 -1  0  0  1 -1  1  0 -1  0  1 -1] (Indices: [1, 2, 3, 5, 8, 9, 13, 15, 16, 19]), Candidate: [ 3  1  1 -1  2  0  1  1  1  0  0  1  2  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 99700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1 -1  1  0 -1  1 -1  1 -1  1 -1  0  0] (Indices: [1, 2, 3, 5, 8, 10, 11, 13, 15, 17]), Candidate: [ 3  1  1 -1  2  0  1  1  0  2  0  0  2  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 99750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1 -1  1 -1  1 -1  1 -1  1 -1  0  1 -1] (Indices: [1, 2, 3, 5, 8, 10, 12, 14, 16, 19]), Candidate: [ 3  1  1 -1  2  0  1  1  0  2 -1  2  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 99800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1 -1  0  1  0  0  0 -1  1 -1  0  0  0] (Indices: [1, 2, 3, 5, 8, 11, 12, 13, 14, 16]), Candidate: [ 3  1  1 -1  2  0  1  1  0  1  1  1  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 99850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1 -1  0  1 -1  1 -1  0  1  0  0 -1  0] (Indices: [1, 2, 3, 5, 8, 11, 13, 16, 17, 18]), Candidate: [ 3  1  1 -1  2  0  1  1  0  1  1  0  2  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 99900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1 -1  0  0  1 -1  0  1  0  0 -1  1 -1] (Indices: [1, 2, 3, 5, 8, 12, 15, 16, 17, 19]), Candidate: [ 3  1  1 -1  2  0  1  1  0  1  0  2  0  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 99950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  1  0  0 -1  1  0 -1  0  0  0  1 -1] (Indices: [1, 2, 3, 5, 9, 10, 11, 13, 14, 19]), Candidate: [ 3  1  1 -1  2  0  1  0  2  1  0  0  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  1  0 -1  1 -1  1 -1  1  0 -1  0  0] (Indices: [1, 2, 3, 5, 9, 10, 12, 14, 16, 17]), Candidate: [ 3  1  1 -1  2  0  1  0  2  1 -1  2  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 100050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  1  0 -1  0  0  0  0  1  0  0  0 -1] (Indices: [1, 2, 3, 5, 9, 10, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  0  1  0  2  1 -1  1  1  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  1 -1  1 -1  1 -1  1 -1  1 -1  1 -1] (Indices: [1, 2, 3, 5, 9, 11, 13, 15, 17, 19]), Candidate: [ 3  1  1 -1  2  0  1  0  2  0  1  0  2  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  1 -1  0  1 -1  1 -1  0  1  0  0 -1] (Indices: [1, 2, 3, 5, 9, 12, 14, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  0  1  0  2  0  0  2  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  0  1  0  0 -1  1 -1  0  1 -1  1 -1] (Indices: [1, 2, 3, 5, 10, 11, 12, 14, 17, 19]), Candidate: [ 3  1  1 -1  2  0  1  0  1  2  0  1  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  0  1 -1  1  0  0  0 -1  0  0  1 -1] (Indices: [1, 2, 3, 5, 10, 12, 13, 14, 15, 19]), Candidate: [ 3  1  1 -1  2  0  1  0  1  2 -1  2  1  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  0  1 -1  0  0  1  0 -1  1  0  0 -1] (Indices: [1, 2, 3, 5, 10, 14, 15, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  0  1  0  1  2 -1  1  1  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  0  0  1 -1  1 -1  1  0 -1  1  0 -1] (Indices: [1, 2, 3, 5, 11, 13, 15, 16, 18, 19]), Candidate: [ 3  1  1 -1  2  0  1  0  1  1  1  0  2  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0  0  0 -1  1 -1  0  0  0  0  1 -1  0] (Indices: [1, 2, 3, 6, 7, 8, 9, 10, 12, 18]), Candidate: [ 3  1  1 -1  1  2  1  0  1  1 -1  2  0  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0  0 -1  1 -1  0  0  0  0  0  1  0 -1] (Indices: [1, 2, 3, 6, 7, 8, 9, 11, 18, 19]), Candidate: [ 3  1  1 -1  1  2  1  0  1  0  1  0  1  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0  0 -1  0  0  0  0  1 -1  1  0 -1  0] (Indices: [1, 2, 3, 6, 7, 8, 9, 15, 17, 18]), Candidate: [ 3  1  1 -1  1  2  1  0  1  0  0  1  1  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0 -1  1 -1  1 -1  0  0  1  0 -1  0  0] (Indices: [1, 2, 3, 6, 7, 8, 10, 12, 16, 17]), Candidate: [ 3  1  1 -1  1  2  1  0  0  2 -1  2  0  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0 -1  0  1  0 -1  1 -1  0  0  1 -1  0] (Indices: [1, 2, 3, 6, 7, 8, 11, 12, 14, 18]), Candidate: [ 3  1  1 -1  1  2  1  0  0  1  1  1  0  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0 -1  0  0  1  0  0 -1  0  0  1 -1  0] (Indices: [1, 2, 3, 6, 7, 8, 12, 13, 14, 18]), Candidate: [ 3  1  1 -1  1  2  1  0  0  1  0  2  1  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0 -1  0  0  0  1 -1  0  1 -1  1  0 -1] (Indices: [1, 2, 3, 6, 7, 8, 13, 16, 18, 19]), Candidate: [ 3  1  1 -1  1  2  1  0  0  1  0  1  2  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  1  0 -1  1  0 -1  0  0  0  0  1 -1] (Indices: [1, 2, 3, 6, 7, 9, 10, 12, 13, 19]), Candidate: [ 3  1  1 -1  1  2  1 -1  2  1 -1  2  1  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 100800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  1  0 -1  0  0  0  0  0  1  0  0 -1] (Indices: [1, 2, 3, 6, 7, 9, 10, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  2  1 -1  2  1 -1  1  1  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 100850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  1 -1  1 -1  0  0  1 -1  1  0 -1  0] (Indices: [1, 2, 3, 6, 7, 9, 11, 15, 17, 18]), Candidate: [ 3  1  1 -1  1  2  1 -1  2  0  1  0  1  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  1 -1  0  0  1  0 -1  0  1 -1  1 -1] (Indices: [1, 2, 3, 6, 7, 9, 13, 14, 17, 19]), Candidate: [ 3  1  1 -1  1  2  1 -1  2  0  0  1  2  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 100950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  0  1  0 -1  1  0 -1  0  1 -1  0  0] (Indices: [1, 2, 3, 6, 7, 10, 11, 13, 14, 17]), Candidate: [ 3  1  1 -1  1  2  1 -1  1  2  0  0  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 101000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  0  1 -1  1 -1  1  0 -1  0  1 -1  0] (Indices: [1, 2, 3, 6, 7, 10, 12, 14, 15, 18]), Candidate: [ 3  1  1 -1  1  2  1 -1  1  2 -1  2  0  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 101050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  0  1 -1  0  0  0  1  0 -1  1  0 -1] (Indices: [1, 2, 3, 6, 7, 10, 15, 16, 18, 19]), Candidate: [ 3  1  1 -1  1  2  1 -1  1  2 -1  1  1  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 101100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  0  0  1 -1  1 -1  1  0 -1  0  1 -1] (Indices: [1, 2, 3, 6, 7, 11, 13, 15, 16, 19]), Candidate: [ 3  1  1 -1  1  2  1 -1  1  1  1  0  2  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 101150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  0  0  0  1 -1  1 -1  1  0 -1  1 -1] (Indices: [1, 2, 3, 6, 7, 12, 14, 16, 17, 19]), Candidate: [ 3  1  1 -1  1  2  1 -1  1  1  0  2  0  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 101200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1  0  0  0 -1  0  0  1 -1  0  0  1 -1] (Indices: [1, 2, 3, 6, 8, 9, 10, 11, 15, 19]), Candidate: [ 3  1  1 -1  1  2  0  1  1  1  0  0  1  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1  0  0 -1  0  0  1 -1  0  1  0 -1  0] (Indices: [1, 2, 3, 6, 8, 9, 10, 14, 17, 18]), Candidate: [ 3  1  1 -1  1  2  0  1  1  1 -1  1  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 101300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1  0 -1  1 -1  0  1  0 -1  1 -1  0  0] (Indices: [1, 2, 3, 6, 8, 9, 11, 14, 15, 17]), Candidate: [ 3  1  1 -1  1  2  0  1  1  0  1  0  1  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1  0 -1  0  1 -1  0  0  1  0  0 -1  0] (Indices: [1, 2, 3, 6, 8, 9, 12, 16, 17, 18]), Candidate: [ 3  1  1 -1  1  2  0  1  1  0  0  2  0  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1 -1  1  0  0 -1  0  1  0 -1  0  0  0] (Indices: [1, 2, 3, 6, 8, 10, 11, 12, 15, 16]), Candidate: [ 3  1  1 -1  1  2  0  1  0  2  0  1  0  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1 -1  1 -1  1  0 -1  1  0 -1  0  0  0] (Indices: [1, 2, 3, 6, 8, 10, 12, 13, 15, 16]), Candidate: [ 3  1  1 -1  1  2  0  1  0  2 -1  2  1  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 101500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1 -1  1 -1  0  0  1  0  0  0 -1  0  0] (Indices: [1, 2, 3, 6, 8, 10, 14, 15, 16, 17]), Candidate: [ 3  1  1 -1  1  2  0  1  0  2 -1  1  1  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 101550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1 -1  0  1 -1  1  0  0  0 -1  0  0  0] (Indices: [1, 2, 3, 6, 8, 11, 13, 14, 15, 16]), Candidate: [ 3  1  1 -1  1  2  0  1  0  1  1  0  2  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1 -1  0  0  1  0 -1  1 -1  0  1  0 -1] (Indices: [1, 2, 3, 6, 8, 12, 13, 15, 18, 19]), Candidate: [ 3  1  1 -1  1  2  0  1  0  1  0  2  1  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  1  0  0  0 -1  1 -1  0  0  1 -1  0] (Indices: [1, 2, 3, 6, 9, 10, 11, 12, 14, 18]), Candidate: [ 3  1  1 -1  1  2  0  0  2  1  0  1  0  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 101700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  1  0 -1  1  0  0 -1  0  0  1 -1  0] (Indices: [1, 2, 3, 6, 9, 10, 12, 13, 14, 18]), Candidate: [ 3  1  1 -1  1  2  0  0  2  1 -1  2  1  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 101750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  1  0 -1  0  1 -1  0  1 -1  1  0 -1] (Indices: [1, 2, 3, 6, 9, 10, 13, 16, 18, 19]), Candidate: [ 3  1  1 -1  1  2  0  0  2  1 -1  1  2  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 101800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  1 -1  1  0 -1  0  0  1 -1  1  0 -1] (Indices: [1, 2, 3, 6, 9, 11, 12, 16, 18, 19]), Candidate: [ 3  1  1 -1  1  2  0  0  2  0  1  1  0  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  1 -1  0  1  0 -1  1 -1  1  0 -1  0] (Indices: [1, 2, 3, 6, 9, 12, 13, 15, 17, 18]), Candidate: [ 3  1  1 -1  1  2  0  0  2  0  0  2  1  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  0  1  0  0  0 -1  1 -1  0  1 -1  0] (Indices: [1, 2, 3, 6, 10, 11, 12, 13, 15, 18]), Candidate: [ 3  1  1 -1  1  2  0  0  1  2  0  1  1  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  0  1  0 -1  0  1  0  0 -1  0  1 -1] (Indices: [1, 2, 3, 6, 10, 11, 14, 15, 16, 19]), Candidate: [ 3  1  1 -1  1  2  0  0  1  2  0  0  1  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  0  1 -1  0  1  0  0  0 -1  0  1 -1] (Indices: [1, 2, 3, 6, 10, 13, 14, 15, 16, 19]), Candidate: [ 3  1  1 -1  1  2  0  0  1  2 -1  1  2  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  0  0  1  0 -1  0  1  0  0 -1  1 -1] (Indices: [1, 2, 3, 6, 11, 12, 15, 16, 17, 19]), Candidate: [ 3  1  1 -1  1  2  0  0  1  1  1  1  0  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  0  0  0  0  1  0 -1  1  0  0  0 -1] (Indices: [1, 2, 3, 6, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  2  0  0  1  1  0  1  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0  0  0 -1  1 -1  0  0  0  1 -1  1 -1] (Indices: [1, 2, 3, 7, 8, 9, 10, 12, 17, 19]), Candidate: [ 3  1  1 -1  1  1  2  0  1  1 -1  2  0  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0  0 -1  1  0 -1  0  1 -1  0  1 -1  0] (Indices: [1, 2, 3, 7, 8, 9, 11, 12, 15, 18]), Candidate: [ 3  1  1 -1  1  1  2  0  1  0  1  1  0  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0  0 -1  0  1  0 -1  1 -1  0  1 -1  0] (Indices: [1, 2, 3, 7, 8, 9, 12, 13, 15, 18]), Candidate: [ 3  1  1 -1  1  1  2  0  1  0  0  2  1  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0  0 -1  0  0  0  1  0  0 -1  0  1 -1] (Indices: [1, 2, 3, 7, 8, 9, 14, 15, 16, 19]), Candidate: [ 3  1  1 -1  1  1  2  0  1  0  0  1  1  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0 -1  1  0 -1  0  1  0 -1  1 -1  0  0] (Indices: [1, 2, 3, 7, 8, 10, 11, 14, 15, 17]), Candidate: [ 3  1  1 -1  1  1  2  0  0  2  0  0  1  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0 -1  1 -1  1 -1  0  0  1  0  0 -1  0] (Indices: [1, 2, 3, 7, 8, 10, 12, 16, 17, 18]), Candidate: [ 3  1  1 -1  1  1  2  0  0  2 -1  2  0  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0 -1  0  1  0  0 -1  0  1 -1  0  1 -1] (Indices: [1, 2, 3, 7, 8, 11, 12, 13, 16, 19]), Candidate: [ 3  1  1 -1  1  1  2  0  0  1  1  1  1  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0 -1  0  1 -1  0  1 -1  1  0  0 -1  0] (Indices: [1, 2, 3, 7, 8, 11, 14, 16, 17, 18]), Candidate: [ 3  1  1 -1  1  1  2  0  0  1  1  0  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0 -1  0  0  0  1  0 -1  1  0  0 -1  0] (Indices: [1, 2, 3, 7, 8, 13, 14, 16, 17, 18]), Candidate: [ 3  1  1 -1  1  1  2  0  0  1  0  1  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  1  0  0 -1  1 -1  0  0  0  1  0 -1] (Indices: [1, 2, 3, 7, 9, 10, 11, 13, 18, 19]), Candidate: [ 3  1  1 -1  1  1  2 -1  2  1  0  0  2  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  1  0 -1  1 -1  0  1 -1  1 -1  1 -1] (Indices: [1, 2, 3, 7, 9, 10, 12, 15, 17, 19]), Candidate: [ 3  1  1 -1  1  1  2 -1  2  1 -1  2  0  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 102700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  1 -1  1  0  0 -1  0  1  0 -1  0  0] (Indices: [1, 2, 3, 7, 9, 11, 12, 13, 16, 17]), Candidate: [ 3  1  1 -1  1  1  2 -1  2  0  1  1  1  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  1 -1  1 -1  0  1  0 -1  1 -1  1 -1] (Indices: [1, 2, 3, 7, 9, 11, 14, 15, 17, 19]), Candidate: [ 3  1  1 -1  1  1  2 -1  2  0  1  0  1  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  1 -1  0  0  1  0  0 -1  1 -1  1 -1] (Indices: [1, 2, 3, 7, 9, 13, 14, 15, 17, 19]), Candidate: [ 3  1  1 -1  1  1  2 -1  2  0  0  1  2  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  0  1  0  0 -1  0  0  1 -1  1  0 -1] (Indices: [1, 2, 3, 7, 10, 11, 12, 16, 18, 19]), Candidate: [ 3  1  1 -1  1  1  2 -1  1  2  0  1  0  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  0  1 -1  1  0 -1  1 -1  1  0 -1  0] (Indices: [1, 2, 3, 7, 10, 12, 13, 15, 17, 18]), Candidate: [ 3  1  1 -1  1  1  2 -1  1  2 -1  2  1  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 102950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  0  0  1  0  0  0 -1  0  1  0 -1  0] (Indices: [1, 2, 3, 7, 11, 12, 13, 14, 17, 18]), Candidate: [ 3  1  1 -1  1  1  2 -1  1  1  1  1  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 103000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  0  0  0  1  0  0  0  0 -1  1 -1  0] (Indices: [1, 2, 3, 7, 12, 13, 14, 15, 16, 18]), Candidate: [ 3  1  1 -1  1  1  2 -1  1  1  0  2  1  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 103050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1  0  0  0 -1  1  0 -1  0  1 -1  0  0] (Indices: [1, 2, 3, 8, 9, 10, 11, 13, 14, 17]), Candidate: [ 3  1  1 -1  1  1  1  1  1  1  0  0  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 103100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1  0  0 -1  1 -1  1  0 -1  0  1 -1  0] (Indices: [1, 2, 3, 8, 9, 10, 12, 14, 15, 18]), Candidate: [ 3  1  1 -1  1  1  1  1  1  1 -1  2  0  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 103150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1  0  0 -1  0  0  0  1  0 -1  1  0 -1] (Indices: [1, 2, 3, 8, 9, 10, 15, 16, 18, 19]), Candidate: [ 3  1  1 -1  1  1  1  1  1  1 -1  1  1  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 103200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1  0 -1  1 -1  1 -1  1  0 -1  0  1 -1] (Indices: [1, 2, 3, 8, 9, 11, 13, 15, 16, 19]), Candidate: [ 3  1  1 -1  1  1  1  1  1  0  1  0  2  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1  0 -1  0  1 -1  1 -1  1  0 -1  1 -1] (Indices: [1, 2, 3, 8, 9, 12, 14, 16, 17, 19]), Candidate: [ 3  1  1 -1  1  1  1  1  1  0  0  2  0  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 103300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1 -1  1  0  0 -1  1 -1  1 -1  0  1 -1] (Indices: [1, 2, 3, 8, 10, 11, 12, 14, 16, 19]), Candidate: [ 3  1  1 -1  1  1  1  1  0  2  0  1  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 103350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1 -1  1 -1  1  0  0  0 -1  1 -1  0  0] (Indices: [1, 2, 3, 8, 10, 12, 13, 14, 15, 17]), Candidate: [ 3  1  1 -1  1  1  1  1  0  2 -1  2  1  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 103400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1 -1  1 -1  0  0  1  0  0  0 -1  1 -1] (Indices: [1, 2, 3, 8, 10, 14, 15, 16, 17, 19]), Candidate: [ 3  1  1 -1  1  1  1  1  0  2 -1  1  1  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 103450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1 -1  0  1 -1  1 -1  1  0  0  0 -1  0] (Indices: [1, 2, 3, 8, 11, 13, 15, 16, 17, 18]), Candidate: [ 3  1  1 -1  1  1  1  1  0  1  1  0  2  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  1  0  0  0  0 -1  0  1 -1  0  1 -1] (Indices: [1, 2, 3, 9, 10, 11, 12, 13, 16, 19]), Candidate: [ 3  1  1 -1  1  1  1  0  2  1  0  1  1  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  1  0  0 -1  0  1 -1  1  0  0 -1  0] (Indices: [1, 2, 3, 9, 10, 11, 14, 16, 17, 18]), Candidate: [ 3  1  1 -1  1  1  1  0  2  1  0  0  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 103600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  1  0 -1  0  1  0 -1  1  0  0 -1  0] (Indices: [1, 2, 3, 9, 10, 13, 14, 16, 17, 18]), Candidate: [ 3  1  1 -1  1  1  1  0  2  1 -1  1  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 103650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  1 -1  1 -1  1  0  0  0  0 -1  0  0] (Indices: [1, 2, 3, 9, 11, 13, 14, 15, 16, 17]), Candidate: [ 3  1  1 -1  1  1  1  0  2  0  1  0  2  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  0  1  0  0  0  0  0 -1  1 -1  0  0] (Indices: [1, 2, 3, 10, 11, 12, 13, 14, 15, 17]), Candidate: [ 3  1  1 -1  1  1  1  0  1  2  0  1  1  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  0  1  0 -1  0  1  0  0  0 -1  1 -1] (Indices: [1, 2, 3, 10, 11, 14, 15, 16, 17, 19]), Candidate: [ 3  1  1 -1  1  1  1  0  1  2  0  0  1  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  0  0  1  0 -1  1  0  0 -1  1  0 -1] (Indices: [1, 2, 3, 11, 12, 14, 15, 16, 18, 19]), Candidate: [ 3  1  1 -1  1  1  1  0  1  1  1  1  0  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0  0 -1  0  0  0  1 -1  1 -1  0  0  0] (Indices: [1, 2, 4, 5, 6, 7, 8, 9, 14, 16]), Candidate: [ 3  1  0  1  1  1  1  0  1  0  0  1  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0 -1  0  1  0  0 -1  0  0  0  0  0  0] (Indices: [1, 2, 4, 5, 6, 7, 8, 11, 12, 13]), Candidate: [3 1 0 1 1 1 1 0 0 1 1 1 1 0 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 103950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0 -1  0  0  0  1  0 -1  1 -1  0  0  0] (Indices: [1, 2, 4, 5, 6, 7, 8, 13, 14, 16]), Candidate: [ 3  1  0  1  1  1  1  0  0  1  0  1  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  1  0 -1  0  1 -1  1 -1  0  0  0  0] (Indices: [1, 2, 4, 5, 6, 7, 9, 10, 13, 15]), Candidate: [ 3  1  0  1  1  1  1 -1  2  1 -1  1  2  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 104050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  1 -1  0  1  0 -1  0  1 -1  0  0  0] (Indices: [1, 2, 4, 5, 6, 7, 9, 12, 13, 16]), Candidate: [ 3  1  0  1  1  1  1 -1  2  0  0  2  1  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  1 -1  0  0  0  0  0  1  0  0 -1  0] (Indices: [1, 2, 4, 5, 6, 7, 9, 16, 17, 18]), Candidate: [ 3  1  0  1  1  1  1 -1  2  0  0  1  1  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  0  1 -1  1 -1  0  0  0  1  0 -1  0] (Indices: [1, 2, 4, 5, 6, 7, 10, 12, 17, 18]), Candidate: [ 3  1  0  1  1  1  1 -1  1  2 -1  2  0  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 104200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  0  0  1  0 -1  0  1 -1  1 -1  0  0] (Indices: [1, 2, 4, 5, 6, 7, 11, 12, 15, 17]), Candidate: [ 3  1  0  1  1  1  1 -1  1  1  1  1  0  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  0  0  0  1  0 -1  1 -1  1 -1  0  0] (Indices: [1, 2, 4, 5, 6, 7, 12, 13, 15, 17]), Candidate: [ 3  1  0  1  1  1  1 -1  1  1  0  2  1  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  0  0  0  0  0  1  0  0 -1  1 -1  0] (Indices: [1, 2, 4, 5, 6, 7, 14, 15, 16, 18]), Candidate: [ 3  1  0  1  1  1  1 -1  1  1  0  1  1  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1  0 -1  1  0  0 -1  0  0  0  0  0  0] (Indices: [1, 2, 4, 5, 6, 8, 9, 11, 12, 13]), Candidate: [3 1 0 1 1 1 0 1 1 0 1 1 1 0 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 104400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1  0 -1  0  0  1  0 -1  1 -1  0  0  0] (Indices: [1, 2, 4, 5, 6, 8, 9, 13, 14, 16]), Candidate: [ 3  1  0  1  1  1  0  1  1  0  0  1  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1 -1  1  0 -1  0  1 -1  0  0  1 -1  0] (Indices: [1, 2, 4, 5, 6, 8, 10, 11, 14, 18]), Candidate: [ 3  1  0  1  1  1  0  1  0  2  0  0  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1 -1  1 -1  0  0  1  0 -1  0  1 -1  0] (Indices: [1, 2, 4, 5, 6, 8, 10, 14, 15, 18]), Candidate: [ 3  1  0  1  1  1  0  1  0  2 -1  1  1  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1 -1  0  1 -1  1 -1  0  1 -1  0  1 -1] (Indices: [1, 2, 4, 5, 6, 8, 11, 13, 16, 19]), Candidate: [3 1 0 1 1 1 0 1 0 1 1 0 2 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 104600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1 -1  0  0  1 -1  0  1  0 -1  1 -1  0] (Indices: [1, 2, 4, 5, 6, 8, 12, 15, 16, 18]), Candidate: [3 1 0 1 1 1 0 1 0 1 0 2 0 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 104650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  1  0  0  0 -1  0  0  0  0  0  1 -1] (Indices: [1, 2, 4, 5, 6, 9, 10, 11, 12, 19]), Candidate: [3 1 0 1 1 1 0 0 2 1 0 1 0 1 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 104700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  1  0 -1  0  1 -1  1 -1  0  1 -1  0] (Indices: [1, 2, 4, 5, 6, 9, 10, 13, 15, 18]), Candidate: [ 3  1  0  1  1  1  0  0  2  1 -1  1  2  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  1 -1  1 -1  1  0 -1  1 -1  0  0  0] (Indices: [1, 2, 4, 5, 6, 9, 11, 13, 14, 16]), Candidate: [ 3  1  0  1  1  1  0  0  2  0  1  0  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  1 -1  0  1 -1  1  0 -1  1 -1  0  0] (Indices: [1, 2, 4, 5, 6, 9, 12, 14, 15, 17]), Candidate: [3 1 0 1 1 1 0 0 2 0 0 2 0 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 104850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  1 -1  0  0  0  0  1  0  0 -1  1 -1] (Indices: [1, 2, 4, 5, 6, 9, 15, 16, 17, 19]), Candidate: [3 1 0 1 1 1 0 0 2 0 0 1 1 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 104900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  0  1  0 -1  0  0  1  0  0 -1  0  0] (Indices: [1, 2, 4, 5, 6, 10, 11, 15, 16, 17]), Candidate: [3 1 0 1 1 1 0 0 1 2 0 0 1 1 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 104950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  0  1 -1  0  1  0 -1  1 -1  1 -1  0] (Indices: [1, 2, 4, 5, 6, 10, 13, 14, 16, 18]), Candidate: [ 3  1  0  1  1  1  0  0  1  2 -1  1  2  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 105000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  0  0  1  0 -1  1 -1  1 -1  1 -1  0] (Indices: [1, 2, 4, 5, 6, 11, 12, 14, 16, 18]), Candidate: [ 3  1  0  1  1  1  0  0  1  1  1  1  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  0  0  0  1  0  0  0  0 -1  0  0  0] (Indices: [1, 2, 4, 5, 6, 12, 13, 14, 15, 16]), Candidate: [3 1 0 1 1 1 0 0 1 1 0 2 1 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 105100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  0  0  0  0  0  1  0  0  0  0 -1  0] (Indices: [1, 2, 4, 5, 6, 14, 15, 16, 17, 18]), Candidate: [3 1 0 1 1 1 0 0 1 1 0 1 1 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 105150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0  0 -1  1 -1  1 -1  1 -1  0  0  0  0] (Indices: [1, 2, 4, 5, 7, 8, 9, 11, 13, 15]), Candidate: [3 1 0 1 1 0 2 0 1 0 1 0 2 0 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 105200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0  0 -1  0  0  1 -1  0  1  0 -1  0  0] (Indices: [1, 2, 4, 5, 7, 8, 9, 13, 16, 17]), Candidate: [3 1 0 1 1 0 2 0 1 0 0 1 2 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 105250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0 -1  1  0 -1  0  0  0  1 -1  0  1 -1] (Indices: [1, 2, 4, 5, 7, 8, 10, 11, 16, 19]), Candidate: [3 1 0 1 1 0 2 0 0 2 0 0 1 1 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 105300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0 -1  1 -1  0  0  0  1  0  0 -1  0  0] (Indices: [1, 2, 4, 5, 7, 8, 10, 15, 16, 17]), Candidate: [ 3  1  0  1  1  0  2  0  0  2 -1  1  1  1  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0 -1  0  1 -1  0  1 -1  1  0 -1  0  0] (Indices: [1, 2, 4, 5, 7, 8, 11, 14, 16, 17]), Candidate: [ 3  1  0  1  1  0  2  0  0  1  1  0  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0 -1  0  0  1 -1  0  0  0  1  0  0 -1] (Indices: [1, 2, 4, 5, 7, 8, 12, 17, 18, 19]), Candidate: [3 1 0 1 1 0 2 0 0 1 0 2 0 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 105450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  1  0  0 -1  0  1 -1  1 -1  0  0  0] (Indices: [1, 2, 4, 5, 7, 9, 10, 11, 14, 16]), Candidate: [ 3  1  0  1  1  0  2 -1  2  1  0  0  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 105500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  1  0 -1  0  0  1  0  0 -1  0  0  0] (Indices: [1, 2, 4, 5, 7, 9, 10, 14, 15, 16]), Candidate: [ 3  1  0  1  1  0  2 -1  2  1 -1  1  1  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 105550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  1 -1  1 -1  1 -1  0  1  0 -1  0  0] (Indices: [1, 2, 4, 5, 7, 9, 11, 13, 16, 17]), Candidate: [ 3  1  0  1  1  0  2 -1  2  0  1  0  2  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  1 -1  0  1 -1  1 -1  0  0  1  0 -1] (Indices: [1, 2, 4, 5, 7, 9, 12, 14, 18, 19]), Candidate: [ 3  1  0  1  1  0  2 -1  2  0  0  2  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 105650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  0  1  0  0  0 -1  0  0  0  1 -1  0] (Indices: [1, 2, 4, 5, 7, 10, 11, 12, 13, 18]), Candidate: [ 3  1  0  1  1  0  2 -1  1  2  0  1  1  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  0  1  0 -1  0  0  0  1 -1  1  0 -1] (Indices: [1, 2, 4, 5, 7, 10, 11, 16, 18, 19]), Candidate: [ 3  1  0  1  1  0  2 -1  1  2  0  0  1  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  0  1 -1  0  1 -1  1 -1  1  0 -1  0] (Indices: [1, 2, 4, 5, 7, 10, 13, 15, 17, 18]), Candidate: [ 3  1  0  1  1  0  2 -1  1  2 -1  1  2  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 105800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  0  0  1  0 -1  0  1 -1  1  0 -1  0] (Indices: [1, 2, 4, 5, 7, 11, 12, 15, 17, 18]), Candidate: [ 3  1  0  1  1  0  2 -1  1  1  1  1  0  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  0  0  0  1  0  0 -1  0  1 -1  1 -1] (Indices: [1, 2, 4, 5, 7, 12, 13, 14, 17, 19]), Candidate: [ 3  1  0  1  1  0  2 -1  1  1  0  2  1  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 105900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1  0  0  0  0 -1  0  1 -1  0  0  0  0] (Indices: [1, 2, 4, 5, 8, 9, 10, 11, 12, 15]), Candidate: [3 1 0 1 1 0 1 1 1 1 0 1 0 1 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 105950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1  0  0 -1  0  1  0 -1  0  0  1 -1  0] (Indices: [1, 2, 4, 5, 8, 9, 10, 13, 14, 18]), Candidate: [ 3  1  0  1  1  0  1  1  1  1 -1  1  2  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 106000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1  0 -1  1  0 -1  0  0  0  1  0 -1  0] (Indices: [1, 2, 4, 5, 8, 9, 11, 12, 17, 18]), Candidate: [3 1 0 1 1 0 1 1 1 0 1 1 0 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 106050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1  0 -1  0  1  0 -1  0  0  1  0 -1  0] (Indices: [1, 2, 4, 5, 8, 9, 12, 13, 17, 18]), Candidate: [3 1 0 1 1 0 1 1 1 0 0 2 1 0 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 106100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1  0 -1  0  0  0  1 -1  1  0 -1  1 -1] (Indices: [1, 2, 4, 5, 8, 9, 14, 16, 17, 19]), Candidate: [ 3  1  0  1  1  0  1  1  1  0  0  1  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 106150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1 -1  1  0 -1  0  1 -1  1 -1  0  1 -1] (Indices: [1, 2, 4, 5, 8, 10, 11, 14, 16, 19]), Candidate: [ 3  1  0  1  1  0  1  1  0  2  0  0  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 106200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1 -1  1 -1  0  1  0  0 -1  1 -1  0  0] (Indices: [1, 2, 4, 5, 8, 10, 13, 14, 15, 17]), Candidate: [ 3  1  0  1  1  0  1  1  0  2 -1  1  2  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 106250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1 -1  0  1  0 -1  1  0 -1  1 -1  0  0] (Indices: [1, 2, 4, 5, 8, 11, 12, 14, 15, 17]), Candidate: [3 1 0 1 1 0 1 1 0 1 1 1 0 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 106300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1 -1  0  1 -1  0  0  1  0  0 -1  1 -1] (Indices: [1, 2, 4, 5, 8, 11, 15, 16, 17, 19]), Candidate: [3 1 0 1 1 0 1 1 0 1 1 0 1 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 106350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1 -1  0  0  0  1 -1  1  0  0 -1  1 -1] (Indices: [1, 2, 4, 5, 8, 13, 15, 16, 17, 19]), Candidate: [3 1 0 1 1 0 1 1 0 1 0 1 2 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 106400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  1  0  0 -1  0  1 -1  1  0 -1  0  0] (Indices: [1, 2, 4, 5, 9, 10, 11, 14, 16, 17]), Candidate: [ 3  1  0  1  1  0  1  0  2  1  0  0  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 106450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  1  0 -1  1 -1  0  0  0  1  0  0 -1] (Indices: [1, 2, 4, 5, 9, 10, 12, 17, 18, 19]), Candidate: [ 3  1  0  1  1  0  1  0  2  1 -1  2  0  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 106500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  1 -1  1  0  0 -1  0  0  0  1  0 -1] (Indices: [1, 2, 4, 5, 9, 11, 12, 13, 18, 19]), Candidate: [3 1 0 1 1 0 1 0 2 0 1 1 1 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 106550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  1 -1  1 -1  0  1 -1  0  1  0  0 -1] (Indices: [1, 2, 4, 5, 9, 11, 14, 17, 18, 19]), Candidate: [ 3  1  0  1  1  0  1  0  2  0  1  0  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 106600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  1 -1  0  0  1  0 -1  0  1  0  0 -1] (Indices: [1, 2, 4, 5, 9, 13, 14, 17, 18, 19]), Candidate: [ 3  1  0  1  1  0  1  0  2  0  0  1  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 106650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  0  1  0 -1  1  0  0 -1  0  0  1 -1] (Indices: [1, 2, 4, 5, 10, 11, 13, 14, 15, 19]), Candidate: [3 1 0 1 1 0 1 0 1 2 0 0 2 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 106700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  0  1 -1  1  0 -1  0  1 -1  1  0 -1] (Indices: [1, 2, 4, 5, 10, 12, 13, 16, 18, 19]), Candidate: [ 3  1  0  1  1  0  1  0  1  2 -1  2  1  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 106750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  0  0  1  0  0 -1  1  0 -1  0  1 -1] (Indices: [1, 2, 4, 5, 11, 12, 13, 15, 16, 19]), Candidate: [3 1 0 1 1 0 1 0 1 1 1 1 1 0 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 106800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  0  0  0  1  0  0 -1  1  0  0 -1  0] (Indices: [1, 2, 4, 5, 12, 13, 14, 16, 17, 18]), Candidate: [ 3  1  0  1  1  0  1  0  1  1  0  2  1  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 106850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0  0  0 -1  0  0  0  1 -1  0  1 -1  0] (Indices: [1, 2, 4, 6, 7, 8, 9, 10, 15, 18]), Candidate: [ 3  1  0  1  0  2  1  0  1  1 -1  1  1  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 106900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0  0 -1  0  1 -1  0  1 -1  0  0  1 -1] (Indices: [1, 2, 4, 6, 7, 8, 9, 12, 15, 19]), Candidate: [3 1 0 1 0 2 1 0 1 0 0 2 0 1 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 106950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0 -1  1  0 -1  1 -1  1 -1  0  0  0  0] (Indices: [1, 2, 4, 6, 7, 8, 10, 11, 13, 15]), Candidate: [3 1 0 1 0 2 1 0 0 2 0 0 2 0 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 107000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0 -1  1 -1  0  1 -1  0  1  0 -1  0  0] (Indices: [1, 2, 4, 6, 7, 8, 10, 13, 16, 17]), Candidate: [ 3  1  0  1  0  2  1  0  0  2 -1  1  2  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0 -1  0  1 -1  1  0 -1  0  0  1 -1  0] (Indices: [1, 2, 4, 6, 7, 8, 11, 13, 14, 18]), Candidate: [ 3  1  0  1  0  2  1  0  0  1  1  0  2  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0 -1  0  0  1 -1  1  0 -1  0  0  1 -1] (Indices: [1, 2, 4, 6, 7, 8, 12, 14, 15, 19]), Candidate: [3 1 0 1 0 2 1 0 0 1 0 2 0 2 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 107150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0 -1  0  0  0  0  0  1 -1  1  0  0 -1] (Indices: [1, 2, 4, 6, 7, 8, 15, 17, 18, 19]), Candidate: [3 1 0 1 0 2 1 0 0 1 0 1 1 1 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 107200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  1  0 -1  1 -1  0  0  0  0  1  0 -1] (Indices: [1, 2, 4, 6, 7, 9, 10, 12, 18, 19]), Candidate: [ 3  1  0  1  0  2  1 -1  2  1 -1  2  0  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 107250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  1 -1  1  0 -1  0  1 -1  0  0  1 -1] (Indices: [1, 2, 4, 6, 7, 9, 11, 12, 15, 19]), Candidate: [ 3  1  0  1  0  2  1 -1  2  0  1  1  0  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  1 -1  0  1  0 -1  1 -1  0  0  1 -1] (Indices: [1, 2, 4, 6, 7, 9, 12, 13, 15, 19]), Candidate: [ 3  1  0  1  0  2  1 -1  2  0  0  2  1  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  1 -1  0  0  0  1  0 -1  1  0 -1  0] (Indices: [1, 2, 4, 6, 7, 9, 14, 15, 17, 18]), Candidate: [ 3  1  0  1  0  2  1 -1  2  0  0  1  1  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  0  1  0 -1  0  1  0 -1  0  1 -1  0] (Indices: [1, 2, 4, 6, 7, 10, 11, 14, 15, 18]), Candidate: [ 3  1  0  1  0  2  1 -1  1  2  0  0  1  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  0  1 -1  1 -1  0  0  1  0 -1  1 -1] (Indices: [1, 2, 4, 6, 7, 10, 12, 16, 17, 19]), Candidate: [ 3  1  0  1  0  2  1 -1  1  2 -1  2  0  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 107500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  0  0  1  0  0 -1  0  0  1  0 -1  0] (Indices: [1, 2, 4, 6, 7, 11, 12, 13, 17, 18]), Candidate: [ 3  1  0  1  0  2  1 -1  1  1  1  1  1  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  0  0  1 -1  0  1 -1  1  0 -1  1 -1] (Indices: [1, 2, 4, 6, 7, 11, 14, 16, 17, 19]), Candidate: [ 3  1  0  1  0  2  1 -1  1  1  1  0  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 107600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  0  0  0  0  1  0 -1  1  0 -1  1 -1] (Indices: [1, 2, 4, 6, 7, 13, 14, 16, 17, 19]), Candidate: [ 3  1  0  1  0  2  1 -1  1  1  0  1  2  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 107650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1  0  0 -1  1 -1  1 -1  0  1 -1  0  0] (Indices: [1, 2, 4, 6, 8, 9, 10, 12, 14, 17]), Candidate: [ 3  1  0  1  0  2  0  1  1  1 -1  2  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 107700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1  0 -1  1  0  0 -1  0  1 -1  0  0  0] (Indices: [1, 2, 4, 6, 8, 9, 11, 12, 13, 16]), Candidate: [3 1 0 1 0 2 0 1 1 0 1 1 1 0 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 107750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1  0 -1  1 -1  0  0  0  1  0  0 -1  0] (Indices: [1, 2, 4, 6, 8, 9, 11, 16, 17, 18]), Candidate: [3 1 0 1 0 2 0 1 1 0 1 0 1 1 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 107800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1  0 -1  0  0  1 -1  1  0 -1  1 -1  0] (Indices: [1, 2, 4, 6, 8, 9, 13, 15, 16, 18]), Candidate: [3 1 0 1 0 2 0 1 1 0 0 1 2 0 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 107850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1 -1  1  0 -1  1 -1  1  0 -1  0  0  0] (Indices: [1, 2, 4, 6, 8, 10, 11, 13, 15, 16]), Candidate: [3 1 0 1 0 2 0 1 0 2 0 0 2 0 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 107900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1 -1  1 -1  1 -1  1 -1  1 -1  1 -1  0] (Indices: [1, 2, 4, 6, 8, 10, 12, 14, 16, 18]), Candidate: [ 3  1  0  1  0  2  0  1  0  2 -1  2  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 107950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1 -1  0  1  0  0  0  0 -1  0  0  0  0] (Indices: [1, 2, 4, 6, 8, 11, 12, 13, 14, 15]), Candidate: [3 1 0 1 0 2 0 1 0 1 1 1 1 1 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 108000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1 -1  0  1 -1  1 -1  1 -1  0  1  0 -1] (Indices: [1, 2, 4, 6, 8, 11, 13, 15, 18, 19]), Candidate: [3 1 0 1 0 2 0 1 0 1 1 0 2 0 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 108050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1 -1  0  0  1 -1  0  1  0  0  0 -1  0] (Indices: [1, 2, 4, 6, 8, 12, 15, 16, 17, 18]), Candidate: [3 1 0 1 0 2 0 1 0 1 0 2 0 1 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 108100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  1  0  0 -1  1  0 -1  0  0  1 -1  0] (Indices: [1, 2, 4, 6, 9, 10, 11, 13, 14, 18]), Candidate: [ 3  1  0  1  0  2  0  0  2  1  0  0  2  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  1  0 -1  1 -1  1  0 -1  0  0  1 -1] (Indices: [1, 2, 4, 6, 9, 10, 12, 14, 15, 19]), Candidate: [ 3  1  0  1  0  2  0  0  2  1 -1  2  0  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  1  0 -1  0  0  0  1 -1  1  0  0 -1] (Indices: [1, 2, 4, 6, 9, 10, 15, 17, 18, 19]), Candidate: [ 3  1  0  1  0  2  0  0  2  1 -1  1  1  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  1 -1  1 -1  1 -1  1 -1  1  0 -1  0] (Indices: [1, 2, 4, 6, 9, 11, 13, 15, 17, 18]), Candidate: [3 1 0 1 0 2 0 0 2 0 1 0 2 0 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 108300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  1 -1  0  1 -1  1 -1  1 -1  1  0 -1] (Indices: [1, 2, 4, 6, 9, 12, 14, 16, 18, 19]), Candidate: [ 3  1  0  1  0  2  0  0  2  0  0  2  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  0  1  0  0 -1  1 -1  0  1  0 -1  0] (Indices: [1, 2, 4, 6, 10, 11, 12, 14, 17, 18]), Candidate: [ 3  1  0  1  0  2  0  0  1  2  0  1  0  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  0  1 -1  1  0  0  0 -1  0  1 -1  0] (Indices: [1, 2, 4, 6, 10, 12, 13, 14, 15, 18]), Candidate: [ 3  1  0  1  0  2  0  0  1  2 -1  2  1  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  0  1 -1  0  0  1  0  0 -1  1  0 -1] (Indices: [1, 2, 4, 6, 10, 14, 15, 16, 18, 19]), Candidate: [ 3  1  0  1  0  2  0  0  1  2 -1  1  1  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  0  0  1 -1  1 -1  1  0  0 -1  1 -1] (Indices: [1, 2, 4, 6, 11, 13, 15, 16, 17, 19]), Candidate: [3 1 0 1 0 2 0 0 1 1 1 0 2 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 108550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0  0  0  0 -1  1 -1  0  0  0  0  1 -1] (Indices: [1, 2, 4, 7, 8, 9, 10, 11, 13, 19]), Candidate: [3 1 0 1 0 1 2 0 1 1 0 0 2 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 108600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0  0  0 -1  0  1 -1  0  0  1 -1  1 -1] (Indices: [1, 2, 4, 7, 8, 9, 10, 13, 17, 19]), Candidate: [ 3  1  0  1  0  1  2  0  1  1 -1  1  2  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0  0 -1  1 -1  1 -1  1 -1  0  1 -1  0] (Indices: [1, 2, 4, 7, 8, 9, 11, 13, 15, 18]), Candidate: [3 1 0 1 0 1 2 0 1 0 1 0 2 0 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 108700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0  0 -1  0  1 -1  1 -1  0  1  0 -1  0] (Indices: [1, 2, 4, 7, 8, 9, 12, 14, 17, 18]), Candidate: [ 3  1  0  1  0  1  2  0  1  0  0  2  0  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0 -1  1  0  0  0 -1  0  1 -1  0  0  0] (Indices: [1, 2, 4, 7, 8, 10, 11, 12, 13, 16]), Candidate: [3 1 0 1 0 1 2 0 0 2 0 1 1 0 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 108800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0 -1  1  0 -1  0  0  0  1  0  0 -1  0] (Indices: [1, 2, 4, 7, 8, 10, 11, 16, 17, 18]), Candidate: [3 1 0 1 0 1 2 0 0 2 0 0 1 1 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 108850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0 -1  1 -1  0  1 -1  1  0 -1  1 -1  0] (Indices: [1, 2, 4, 7, 8, 10, 13, 15, 16, 18]), Candidate: [ 3  1  0  1  0  1  2  0  0  2 -1  1  2  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0 -1  0  1  0 -1  0  1  0 -1  1 -1  0] (Indices: [1, 2, 4, 7, 8, 11, 12, 15, 16, 18]), Candidate: [3 1 0 1 0 1 2 0 0 1 1 1 0 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 108950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0 -1  0  0  1  0  0 -1  1 -1  0  1 -1] (Indices: [1, 2, 4, 7, 8, 12, 13, 14, 16, 19]), Candidate: [ 3  1  0  1  0  1  2  0  0  1  0  2  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  1  0  0  0  0  0 -1  0  0  0  0  0] (Indices: [1, 2, 4, 7, 9, 10, 11, 12, 13, 14]), Candidate: [ 3  1  0  1  0  1  2 -1  2  1  0  1  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 109050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  1  0  0 -1  0  0  1 -1  1 -1  1 -1] (Indices: [1, 2, 4, 7, 9, 10, 11, 15, 17, 19]), Candidate: [ 3  1  0  1  0  1  2 -1  2  1  0  0  1  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  1  0 -1  0  1  0 -1  0  0  1  0 -1] (Indices: [1, 2, 4, 7, 9, 10, 13, 14, 18, 19]), Candidate: [ 3  1  0  1  0  1  2 -1  2  1 -1  1  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 109150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  1 -1  1  0 -1  1 -1  0  0  1  0 -1] (Indices: [1, 2, 4, 7, 9, 11, 12, 14, 18, 19]), Candidate: [ 3  1  0  1  0  1  2 -1  2  0  1  1  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 109200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  1 -1  0  1  0  0 -1  1  0 -1  0  0] (Indices: [1, 2, 4, 7, 9, 12, 13, 14, 16, 17]), Candidate: [ 3  1  0  1  0  1  2 -1  2  0  0  2  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 109250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  1 -1  0  0  0  1 -1  1  0  0  0 -1] (Indices: [1, 2, 4, 7, 9, 14, 16, 17, 18, 19]), Candidate: [ 3  1  0  1  0  1  2 -1  2  0  0  1  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 109300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  0  1  0 -1  1 -1  1 -1  1  0 -1  0] (Indices: [1, 2, 4, 7, 10, 11, 13, 15, 17, 18]), Candidate: [ 3  1  0  1  0  1  2 -1  1  2  0  0  2  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  0  1 -1  1 -1  1 -1  1 -1  1  0 -1] (Indices: [1, 2, 4, 7, 10, 12, 14, 16, 18, 19]), Candidate: [ 3  1  0  1  0  1  2 -1  1  2 -1  2  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 109400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  0  0  1  0 -1  1  0  0 -1  0  1 -1] (Indices: [1, 2, 4, 7, 11, 12, 14, 15, 16, 19]), Candidate: [ 3  1  0  1  0  1  2 -1  1  1  1  1  0  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  0  0  0  1 -1  1  0  0  0 -1  1 -1] (Indices: [1, 2, 4, 7, 12, 14, 15, 16, 17, 19]), Candidate: [ 3  1  0  1  0  1  2 -1  1  1  0  2  0  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1  0  0  0 -1  0  1  0 -1  0  1 -1  0] (Indices: [1, 2, 4, 8, 9, 10, 11, 14, 15, 18]), Candidate: [3 1 0 1 0 1 1 1 1 1 0 0 1 2 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 109550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1  0  0 -1  1 -1  0  0  1  0 -1  1 -1] (Indices: [1, 2, 4, 8, 9, 10, 12, 16, 17, 19]), Candidate: [ 3  1  0  1  0  1  1  1  1  1 -1  2  0  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1  0 -1  1  0  0 -1  0  0  1  0 -1  0] (Indices: [1, 2, 4, 8, 9, 11, 12, 13, 17, 18]), Candidate: [3 1 0 1 0 1 1 1 1 0 1 1 1 0 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 109650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1  0 -1  1 -1  0  1 -1  1  0 -1  1 -1] (Indices: [1, 2, 4, 8, 9, 11, 14, 16, 17, 19]), Candidate: [ 3  1  0  1  0  1  1  1  1  0  1  0  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1  0 -1  0  0  1  0 -1  1  0 -1  1 -1] (Indices: [1, 2, 4, 8, 9, 13, 14, 16, 17, 19]), Candidate: [ 3  1  0  1  0  1  1  1  1  0  0  1  2  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1 -1  1  0 -1  1  0  0 -1  1 -1  0  0] (Indices: [1, 2, 4, 8, 10, 11, 13, 14, 15, 17]), Candidate: [3 1 0 1 0 1 1 1 0 2 0 0 2 1 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 109800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1 -1  1 -1  1  0 -1  0  1  0  0 -1  0] (Indices: [1, 2, 4, 8, 10, 12, 13, 16, 17, 18]), Candidate: [ 3  1  0  1  0  1  1  1  0  2 -1  2  1  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1 -1  0  1  0  0 -1  1  0  0 -1  0  0] (Indices: [1, 2, 4, 8, 11, 12, 13, 15, 16, 17]), Candidate: [3 1 0 1 0 1 1 1 0 1 1 1 1 0 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 109900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1 -1  0  0  1  0  0  0 -1  1 -1  1 -1] (Indices: [1, 2, 4, 8, 12, 13, 14, 15, 17, 19]), Candidate: [3 1 0 1 0 1 1 1 0 1 0 2 1 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 109950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  1  0  0  0 -1  0  1  0 -1  1 -1  0] (Indices: [1, 2, 4, 9, 10, 11, 12, 15, 16, 18]), Candidate: [3 1 0 1 0 1 1 0 2 1 0 1 0 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 110000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  1  0 -1  1  0  0 -1  1 -1  0  1 -1] (Indices: [1, 2, 4, 9, 10, 12, 13, 14, 16, 19]), Candidate: [ 3  1  0  1  0  1  1  0  2  1 -1  2  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 110050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  1 -1  1  0  0  0  0  0 -1  0  0  0] (Indices: [1, 2, 4, 9, 11, 12, 13, 14, 15, 16]), Candidate: [3 1 0 1 0 1 1 0 2 0 1 1 1 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 110100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  1 -1  1 -1  0  1  0  0  0  0 -1  0] (Indices: [1, 2, 4, 9, 11, 14, 15, 16, 17, 18]), Candidate: [3 1 0 1 0 1 1 0 2 0 1 0 1 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 110150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  0  1  0  0  0 -1  0  1  0  0 -1  0] (Indices: [1, 2, 4, 10, 11, 12, 13, 16, 17, 18]), Candidate: [3 1 0 1 0 1 1 0 1 2 0 1 1 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 110200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  0  1 -1  1  0 -1  1  0  0  0 -1  0] (Indices: [1, 2, 4, 10, 12, 13, 15, 16, 17, 18]), Candidate: [ 3  1  0  1  0  1  1  0  1  2 -1  2  1  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  0  0  0  1  0  0 -1  1  0  0  0 -1] (Indices: [1, 2, 4, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  1  0  1  0  1  1  0  1  1  0  2  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0  0 -1  1 -1  1 -1  0  0  1 -1  0  0] (Indices: [1, 2, 5, 6, 7, 8, 9, 11, 13, 17]), Candidate: [3 1 0 0 2 1 1 0 1 0 1 0 2 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 110350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0  0 -1  0  0  1 -1  0  1 -1  0  1 -1] (Indices: [1, 2, 5, 6, 7, 8, 9, 13, 16, 19]), Candidate: [3 1 0 0 2 1 1 0 1 0 0 1 2 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 110400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0 -1  1  0 -1  0  0  0  0  1 -1  1 -1] (Indices: [1, 2, 5, 6, 7, 8, 10, 11, 17, 19]), Candidate: [3 1 0 0 2 1 1 0 0 2 0 0 1 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 110450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0 -1  1 -1  0  0  0  1  0 -1  0  1 -1] (Indices: [1, 2, 5, 6, 7, 8, 10, 15, 16, 19]), Candidate: [ 3  1  0  0  2  1  1  0  0  2 -1  1  1  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0 -1  0  1 -1  0  1 -1  1 -1  0  1 -1] (Indices: [1, 2, 5, 6, 7, 8, 11, 14, 16, 19]), Candidate: [ 3  1  0  0  2  1  1  0  0  1  1  0  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0 -1  0  0  0  1  0  0 -1  1 -1  0  0] (Indices: [1, 2, 5, 6, 7, 8, 13, 14, 15, 17]), Candidate: [3 1 0 0 2 1 1 0 0 1 0 1 2 1 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 110600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  1  0  0 -1  0  1 -1  0  0  1 -1  0] (Indices: [1, 2, 5, 6, 7, 9, 10, 11, 14, 18]), Candidate: [ 3  1  0  0  2  1  1 -1  2  1  0  0  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 110650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  1  0 -1  0  0  1  0 -1  0  1 -1  0] (Indices: [1, 2, 5, 6, 7, 9, 10, 14, 15, 18]), Candidate: [ 3  1  0  0  2  1  1 -1  2  1 -1  1  1  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 110700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  1 -1  1 -1  1 -1  0  1 -1  0  1 -1] (Indices: [1, 2, 5, 6, 7, 9, 11, 13, 16, 19]), Candidate: [ 3  1  0  0  2  1  1 -1  2  0  1  0  2  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  1 -1  0  1 -1  0  1  0 -1  1 -1  0] (Indices: [1, 2, 5, 6, 7, 9, 12, 15, 16, 18]), Candidate: [ 3  1  0  0  2  1  1 -1  2  0  0  2  0  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  0  1  0  0 -1  1  0 -1  0  0  0  0] (Indices: [1, 2, 5, 6, 7, 10, 11, 12, 14, 15]), Candidate: [ 3  1  0  0  2  1  1 -1  1  2  0  1  0  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  0  1 -1  1  0  0  0 -1  0  0  0  0] (Indices: [1, 2, 5, 6, 7, 10, 12, 13, 14, 15]), Candidate: [ 3  1  0  0  2  1  1 -1  1  2 -1  2  1  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 110900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  0  1 -1  0  1 -1  1 -1  0  1  0 -1] (Indices: [1, 2, 5, 6, 7, 10, 13, 15, 18, 19]), Candidate: [ 3  1  0  0  2  1  1 -1  1  2 -1  1  2  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 110950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  0  0  1  0 -1  0  1 -1  0  1  0 -1] (Indices: [1, 2, 5, 6, 7, 11, 12, 15, 18, 19]), Candidate: [ 3  1  0  0  2  1  1 -1  1  1  1  1  0  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  0  0  0  1  0 -1  1  0  0 -1  0  0] (Indices: [1, 2, 5, 6, 7, 12, 13, 15, 16, 17]), Candidate: [ 3  1  0  0  2  1  1 -1  1  1  0  2  1  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1  0  0  0  0 -1  0  0  0  1 -1  0  0] (Indices: [1, 2, 5, 6, 8, 9, 10, 11, 12, 17]), Candidate: [3 1 0 0 2 1 0 1 1 1 0 1 0 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 111100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1  0  0 -1  0  1 -1  1  0 -1  0  0  0] (Indices: [1, 2, 5, 6, 8, 9, 10, 13, 15, 16]), Candidate: [ 3  1  0  0  2  1  0  1  1  1 -1  1  2  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1  0 -1  1  0 -1  0  0  0  0  1  0 -1] (Indices: [1, 2, 5, 6, 8, 9, 11, 12, 18, 19]), Candidate: [3 1 0 0 2 1 0 1 1 0 1 1 0 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 111200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1  0 -1  0  1  0 -1  0  0  0  1  0 -1] (Indices: [1, 2, 5, 6, 8, 9, 12, 13, 18, 19]), Candidate: [3 1 0 0 2 1 0 1 1 0 0 2 1 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 111250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1  0 -1  0  0  0  1 -1  0  1  0  0 -1] (Indices: [1, 2, 5, 6, 8, 9, 14, 17, 18, 19]), Candidate: [ 3  1  0  0  2  1  0  1  1  0  0  1  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1 -1  1  0 -1  0  1 -1  0  1 -1  1 -1] (Indices: [1, 2, 5, 6, 8, 10, 11, 14, 17, 19]), Candidate: [ 3  1  0  0  2  1  0  1  0  2  0  0  1  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1 -1  1 -1  0  1  0  0 -1  0  0  1 -1] (Indices: [1, 2, 5, 6, 8, 10, 13, 14, 15, 19]), Candidate: [ 3  1  0  0  2  1  0  1  0  2 -1  1  2  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1 -1  0  1  0 -1  1  0 -1  0  0  1 -1] (Indices: [1, 2, 5, 6, 8, 11, 12, 14, 15, 19]), Candidate: [3 1 0 0 2 1 0 1 0 1 1 1 0 2 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 111450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1 -1  0  1 -1  0  0  1 -1  1  0  0 -1] (Indices: [1, 2, 5, 6, 8, 11, 15, 17, 18, 19]), Candidate: [3 1 0 0 2 1 0 1 0 1 1 0 1 1 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 111500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1 -1  0  0  0  1 -1  1 -1  1  0  0 -1] (Indices: [1, 2, 5, 6, 8, 13, 15, 17, 18, 19]), Candidate: [3 1 0 0 2 1 0 1 0 1 0 1 2 0 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 111550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  1  0  0 -1  0  1 -1  1 -1  0  1 -1] (Indices: [1, 2, 5, 6, 9, 10, 11, 14, 16, 19]), Candidate: [ 3  1  0  0  2  1  0  0  2  1  0  0  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  1  0 -1  0  1  0  0 -1  1 -1  0  0] (Indices: [1, 2, 5, 6, 9, 10, 13, 14, 15, 17]), Candidate: [ 3  1  0  0  2  1  0  0  2  1 -1  1  2  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  1 -1  1  0 -1  1  0 -1  1 -1  0  0] (Indices: [1, 2, 5, 6, 9, 11, 12, 14, 15, 17]), Candidate: [3 1 0 0 2 1 0 0 2 0 1 1 0 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 111700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  1 -1  1 -1  0  0  1  0  0 -1  1 -1] (Indices: [1, 2, 5, 6, 9, 11, 15, 16, 17, 19]), Candidate: [3 1 0 0 2 1 0 0 2 0 1 0 1 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 111750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  1 -1  0  0  1 -1  1  0  0 -1  1 -1] (Indices: [1, 2, 5, 6, 9, 13, 15, 16, 17, 19]), Candidate: [3 1 0 0 2 1 0 0 2 0 0 1 2 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 111800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  0  1  0 -1  1  0 -1  1 -1  1 -1  0] (Indices: [1, 2, 5, 6, 10, 11, 13, 14, 16, 18]), Candidate: [ 3  1  0  0  2  1  0  0  1  2  0  0  2  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  0  1 -1  1 -1  1  0  0  0 -1  0  0] (Indices: [1, 2, 5, 6, 10, 12, 14, 15, 16, 17]), Candidate: [ 3  1  0  0  2  1  0  0  1  2 -1  2  0  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  0  0  1  0  0 -1  1 -1  1 -1  1 -1] (Indices: [1, 2, 5, 6, 11, 12, 13, 15, 17, 19]), Candidate: [3 1 0 0 2 1 0 0 1 1 1 1 1 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 111950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  0  0  0  1  0  0 -1  1 -1  1  0 -1] (Indices: [1, 2, 5, 6, 12, 13, 14, 16, 18, 19]), Candidate: [ 3  1  0  0  2  1  0  0  1  1  0  2  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0  0  0 -1  1  0 -1  0  1 -1  0  0  0] (Indices: [1, 2, 5, 7, 8, 9, 10, 12, 13, 16]), Candidate: [ 3  1  0  0  2  0  2  0  1  1 -1  2  1  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0  0  0 -1  0  0  0  0  1  0  0 -1  0] (Indices: [1, 2, 5, 7, 8, 9, 10, 16, 17, 18]), Candidate: [ 3  1  0  0  2  0  2  0  1  1 -1  1  1  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0  0 -1  1 -1  0  0  1  0  0 -1  0  0] (Indices: [1, 2, 5, 7, 8, 9, 11, 15, 16, 17]), Candidate: [3 1 0 0 2 0 2 0 1 0 1 0 1 1 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 112150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0  0 -1  0  0  1  0 -1  1 -1  1 -1  0] (Indices: [1, 2, 5, 7, 8, 9, 13, 14, 16, 18]), Candidate: [ 3  1  0  0  2  0  2  0  1  0  0  1  2  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0 -1  1  0  0 -1  0  0  0  0  1  0 -1] (Indices: [1, 2, 5, 7, 8, 10, 11, 12, 18, 19]), Candidate: [3 1 0 0 2 0 2 0 0 2 0 1 0 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 112250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0 -1  1 -1  1  0 -1  0  0  0  1  0 -1] (Indices: [1, 2, 5, 7, 8, 10, 12, 13, 18, 19]), Candidate: [ 3  1  0  0  2  0  2  0  0  2 -1  2  1  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0 -1  1 -1  0  0  1 -1  0  1  0  0 -1] (Indices: [1, 2, 5, 7, 8, 10, 14, 17, 18, 19]), Candidate: [ 3  1  0  0  2  0  2  0  0  2 -1  1  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 112350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0 -1  0  1 -1  1  0 -1  0  0  1  0 -1] (Indices: [1, 2, 5, 7, 8, 11, 13, 14, 18, 19]), Candidate: [ 3  1  0  0  2  0  2  0  0  1  1  0  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0 -1  0  0  1 -1  1  0 -1  1 -1  1 -1] (Indices: [1, 2, 5, 7, 8, 12, 14, 15, 17, 19]), Candidate: [3 1 0 0 2 0 2 0 0 1 0 2 0 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 112450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  1  0  0  0 -1  0  0  0  1  0 -1  0] (Indices: [1, 2, 5, 7, 9, 10, 11, 12, 17, 18]), Candidate: [ 3  1  0  0  2  0  2 -1  2  1  0  1  0  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  1  0 -1  1  0 -1  0  0  1  0 -1  0] (Indices: [1, 2, 5, 7, 9, 10, 12, 13, 17, 18]), Candidate: [ 3  1  0  0  2  0  2 -1  2  1 -1  2  1  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 112550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  1  0 -1  0  0  1 -1  1  0 -1  1 -1] (Indices: [1, 2, 5, 7, 9, 10, 14, 16, 17, 19]), Candidate: [ 3  1  0  0  2  0  2 -1  2  1 -1  1  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 112600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  1 -1  1 -1  1  0 -1  0  1  0 -1  0] (Indices: [1, 2, 5, 7, 9, 11, 13, 14, 17, 18]), Candidate: [ 3  1  0  0  2  0  2 -1  2  0  1  0  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 112650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  1 -1  0  1 -1  1  0  0 -1  0  1 -1] (Indices: [1, 2, 5, 7, 9, 12, 14, 15, 16, 19]), Candidate: [ 3  1  0  0  2  0  2 -1  2  0  0  2  0  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  0  1  0  0 -1  1  0 -1  1 -1  0  0] (Indices: [1, 2, 5, 7, 10, 11, 12, 14, 15, 17]), Candidate: [ 3  1  0  0  2  0  2 -1  1  2  0  1  0  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  0  1  0 -1  0  0  1  0  0 -1  1 -1] (Indices: [1, 2, 5, 7, 10, 11, 15, 16, 17, 19]), Candidate: [ 3  1  0  0  2  0  2 -1  1  2  0  0  1  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  0  1 -1  0  1 -1  1  0  0 -1  1 -1] (Indices: [1, 2, 5, 7, 10, 13, 15, 16, 17, 19]), Candidate: [ 3  1  0  0  2  0  2 -1  1  2 -1  1  2  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 112850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  0  0  1 -1  1  0  0 -1  0  1  0 -1] (Indices: [1, 2, 5, 7, 11, 13, 14, 15, 18, 19]), Candidate: [ 3  1  0  0  2  0  2 -1  1  1  1  0  2  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1  0  0  0  0 -1  1  0 -1  0  0  0  0] (Indices: [1, 2, 5, 8, 9, 10, 11, 12, 14, 15]), Candidate: [3 1 0 0 2 0 1 1 1 1 0 1 0 2 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 112950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1  0  0 -1  1  0  0  0 -1  0  0  0  0] (Indices: [1, 2, 5, 8, 9, 10, 12, 13, 14, 15]), Candidate: [ 3  1  0  0  2  0  1  1  1  1 -1  2  1  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1  0  0 -1  0  1 -1  1 -1  0  1  0 -1] (Indices: [1, 2, 5, 8, 9, 10, 13, 15, 18, 19]), Candidate: [ 3  1  0  0  2  0  1  1  1  1 -1  1  2  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1  0 -1  1  0 -1  0  1 -1  0  1  0 -1] (Indices: [1, 2, 5, 8, 9, 11, 12, 15, 18, 19]), Candidate: [3 1 0 0 2 0 1 1 1 0 1 1 0 1 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 113100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1  0 -1  0  1  0 -1  1  0  0 -1  0  0] (Indices: [1, 2, 5, 8, 9, 12, 13, 15, 16, 17]), Candidate: [3 1 0 0 2 0 1 1 1 0 0 2 1 0 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 113150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1 -1  1  0  0  0  0 -1  0  0  0  1 -1] (Indices: [1, 2, 5, 8, 10, 11, 12, 13, 14, 19]), Candidate: [ 3  1  0  0  2  0  1  1  0  2  0  1  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1 -1  1  0 -1  1 -1  0  0  1  0  0 -1] (Indices: [1, 2, 5, 8, 10, 11, 13, 17, 18, 19]), Candidate: [3 1 0 0 2 0 1 1 0 2 0 0 2 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 113250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1 -1  1 -1  1 -1  0  0  1  0  0  0 -1] (Indices: [1, 2, 5, 8, 10, 12, 16, 17, 18, 19]), Candidate: [ 3  1  0  0  2  0  1  1  0  2 -1  2  0  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1 -1  0  1  0 -1  1 -1  1 -1  1  0 -1] (Indices: [1, 2, 5, 8, 11, 12, 14, 16, 18, 19]), Candidate: [ 3  1  0  0  2  0  1  1  0  1  1  1  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1 -1  0  0  0  1  0  0  0  0 -1  1 -1] (Indices: [1, 2, 5, 8, 13, 14, 15, 16, 17, 19]), Candidate: [3 1 0 0 2 0 1 1 0 1 0 1 2 1 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 113400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  1  0  0 -1  1  0 -1  0  0  1  0 -1] (Indices: [1, 2, 5, 9, 10, 11, 13, 14, 18, 19]), Candidate: [ 3  1  0  0  2  0  1  0  2  1  0  0  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  1  0 -1  1 -1  1  0 -1  1 -1  1 -1] (Indices: [1, 2, 5, 9, 10, 12, 14, 15, 17, 19]), Candidate: [ 3  1  0  0  2  0  1  0  2  1 -1  2  0  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  1 -1  1  0  0 -1  0  1 -1  1  0 -1] (Indices: [1, 2, 5, 9, 11, 12, 13, 16, 18, 19]), Candidate: [3 1 0 0 2 0 1 0 2 0 1 1 1 0 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 113550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  1 -1  0  1  0 -1  1  0 -1  1  0 -1] (Indices: [1, 2, 5, 9, 12, 13, 15, 16, 18, 19]), Candidate: [3 1 0 0 2 0 1 0 2 0 0 2 1 0 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 113600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  0  1  0  0 -1  0  0  1  0  0  0 -1] (Indices: [1, 2, 5, 10, 11, 12, 16, 17, 18, 19]), Candidate: [3 1 0 0 2 0 1 0 1 2 0 1 0 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 113650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  0  0  1  0  0  0  0  0  0 -1  0  0] (Indices: [1, 2, 5, 11, 12, 13, 14, 15, 16, 17]), Candidate: [3 1 0 0 2 0 1 0 1 1 1 1 1 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 113700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0  0  0  0 -1  0  1 -1  1 -1  0  0  0] (Indices: [1, 2, 6, 7, 8, 9, 10, 11, 14, 16]), Candidate: [ 3  1  0  0  1  2  1  0  1  1  0  0  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0  0  0 -1  0  0  1  0  0 -1  0  0  0] (Indices: [1, 2, 6, 7, 8, 9, 10, 14, 15, 16]), Candidate: [ 3  1  0  0  1  2  1  0  1  1 -1  1  1  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0  0 -1  1 -1  1 -1  0  1  0 -1  0  0] (Indices: [1, 2, 6, 7, 8, 9, 11, 13, 16, 17]), Candidate: [3 1 0 0 1 2 1 0 1 0 1 0 2 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 113850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0  0 -1  0  1 -1  1 -1  0  0  1  0 -1] (Indices: [1, 2, 6, 7, 8, 9, 12, 14, 18, 19]), Candidate: [ 3  1  0  0  1  2  1  0  1  0  0  2  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0 -1  1  0  0  0 -1  0  0  0  1 -1  0] (Indices: [1, 2, 6, 7, 8, 10, 11, 12, 13, 18]), Candidate: [3 1 0 0 1 2 1 0 0 2 0 1 1 0 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 113950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0 -1  1  0 -1  0  0  0  1 -1  1  0 -1] (Indices: [1, 2, 6, 7, 8, 10, 11, 16, 18, 19]), Candidate: [3 1 0 0 1 2 1 0 0 2 0 0 1 1 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 114000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0 -1  1 -1  0  1 -1  1 -1  1  0 -1  0] (Indices: [1, 2, 6, 7, 8, 10, 13, 15, 17, 18]), Candidate: [ 3  1  0  0  1  2  1  0  0  2 -1  1  2  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0 -1  0  1  0 -1  0  1 -1  1  0 -1  0] (Indices: [1, 2, 6, 7, 8, 11, 12, 15, 17, 18]), Candidate: [3 1 0 0 1 2 1 0 0 1 1 1 0 1 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 114100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0 -1  0  0  1  0  0 -1  0  1 -1  1 -1] (Indices: [1, 2, 6, 7, 8, 12, 13, 14, 17, 19]), Candidate: [ 3  1  0  0  1  2  1  0  0  1  0  2  1  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  1  0  0  0  0 -1  0  1 -1  0  0  0] (Indices: [1, 2, 6, 7, 9, 10, 11, 12, 13, 16]), Candidate: [ 3  1  0  0  1  2  1 -1  2  1  0  1  1  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  1  0  0 -1  0  0  0  1  0  0 -1  0] (Indices: [1, 2, 6, 7, 9, 10, 11, 16, 17, 18]), Candidate: [ 3  1  0  0  1  2  1 -1  2  1  0  0  1  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  1  0 -1  0  1 -1  1  0 -1  1 -1  0] (Indices: [1, 2, 6, 7, 9, 10, 13, 15, 16, 18]), Candidate: [ 3  1  0  0  1  2  1 -1  2  1 -1  1  2  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 114300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  1 -1  1  0 -1  0  1  0 -1  1 -1  0] (Indices: [1, 2, 6, 7, 9, 11, 12, 15, 16, 18]), Candidate: [ 3  1  0  0  1  2  1 -1  2  0  1  1  0  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  1 -1  0  1  0  0 -1  1 -1  0  1 -1] (Indices: [1, 2, 6, 7, 9, 12, 13, 14, 16, 19]), Candidate: [ 3  1  0  0  1  2  1 -1  2  0  0  2  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 114400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  0  1  0  0  0  0  0 -1  0  0  0  0] (Indices: [1, 2, 6, 7, 10, 11, 12, 13, 14, 15]), Candidate: [ 3  1  0  0  1  2  1 -1  1  2  0  1  1  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  0  1  0 -1  1 -1  1 -1  0  1  0 -1] (Indices: [1, 2, 6, 7, 10, 11, 13, 15, 18, 19]), Candidate: [ 3  1  0  0  1  2  1 -1  1  2  0  0  2  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  0  1 -1  1 -1  0  1  0  0  0 -1  0] (Indices: [1, 2, 6, 7, 10, 12, 15, 16, 17, 18]), Candidate: [ 3  1  0  0  1  2  1 -1  1  2 -1  2  0  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 114550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  0  0  1  0 -1  1  0 -1  1 -1  1 -1] (Indices: [1, 2, 6, 7, 11, 12, 14, 15, 17, 19]), Candidate: [ 3  1  0  0  1  2  1 -1  1  1  1  1  0  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  0  0  0  1 -1  1  0 -1  1  0  0 -1] (Indices: [1, 2, 6, 7, 12, 14, 15, 17, 18, 19]), Candidate: [ 3  1  0  0  1  2  1 -1  1  1  0  2  0  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1  0  0  0 -1  0  1 -1  1  0 -1  0  0] (Indices: [1, 2, 6, 8, 9, 10, 11, 14, 16, 17]), Candidate: [ 3  1  0  0  1  2  0  1  1  1  0  0  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1  0  0 -1  1 -1  0  0  0  1  0  0 -1] (Indices: [1, 2, 6, 8, 9, 10, 12, 17, 18, 19]), Candidate: [ 3  1  0  0  1  2  0  1  1  1 -1  2  0  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1  0 -1  1  0  0 -1  0  0  0  1  0 -1] (Indices: [1, 2, 6, 8, 9, 11, 12, 13, 18, 19]), Candidate: [3 1 0 0 1 2 0 1 1 0 1 1 1 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 114800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1  0 -1  1 -1  0  1 -1  0  1  0  0 -1] (Indices: [1, 2, 6, 8, 9, 11, 14, 17, 18, 19]), Candidate: [ 3  1  0  0  1  2  0  1  1  0  1  0  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1  0 -1  0  0  1  0 -1  0  1  0  0 -1] (Indices: [1, 2, 6, 8, 9, 13, 14, 17, 18, 19]), Candidate: [ 3  1  0  0  1  2  0  1  1  0  0  1  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1 -1  1  0 -1  1  0  0 -1  0  0  1 -1] (Indices: [1, 2, 6, 8, 10, 11, 13, 14, 15, 19]), Candidate: [3 1 0 0 1 2 0 1 0 2 0 0 2 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 114950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1 -1  1 -1  1  0 -1  0  1 -1  1  0 -1] (Indices: [1, 2, 6, 8, 10, 12, 13, 16, 18, 19]), Candidate: [ 3  1  0  0  1  2  0  1  0  2 -1  2  1  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1 -1  0  1  0  0 -1  1  0 -1  0  1 -1] (Indices: [1, 2, 6, 8, 11, 12, 13, 15, 16, 19]), Candidate: [3 1 0 0 1 2 0 1 0 1 1 1 1 0 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 115050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1 -1  0  0  1  0  0 -1  1  0  0 -1  0] (Indices: [1, 2, 6, 8, 12, 13, 14, 16, 17, 18]), Candidate: [ 3  1  0  0  1  2  0  1  0  1  0  2  1  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  1  0  0  0 -1  0  1 -1  1  0 -1  0] (Indices: [1, 2, 6, 9, 10, 11, 12, 15, 17, 18]), Candidate: [3 1 0 0 1 2 0 0 2 1 0 1 0 1 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 115150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  1  0 -1  1  0  0 -1  0  1 -1  1 -1] (Indices: [1, 2, 6, 9, 10, 12, 13, 14, 17, 19]), Candidate: [ 3  1  0  0  1  2  0  0  2  1 -1  2  1  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 115200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  1 -1  1  0  0  0  0 -1  0  1 -1  0] (Indices: [1, 2, 6, 9, 11, 12, 13, 14, 15, 18]), Candidate: [3 1 0 0 1 2 0 0 2 0 1 1 1 1 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 115250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  1 -1  1 -1  0  1  0  0 -1  1  0 -1] (Indices: [1, 2, 6, 9, 11, 14, 15, 16, 18, 19]), Candidate: [3 1 0 0 1 2 0 0 2 0 1 0 1 2 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 115300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  0  1  0  0  0 -1  0  1 -1  1  0 -1] (Indices: [1, 2, 6, 10, 11, 12, 13, 16, 18, 19]), Candidate: [3 1 0 0 1 2 0 0 1 2 0 1 1 0 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 115350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  0  1 -1  1  0 -1  1  0 -1  1  0 -1] (Indices: [1, 2, 6, 10, 12, 13, 15, 16, 18, 19]), Candidate: [ 3  1  0  0  1  2  0  0  1  2 -1  2  1  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  0  0  0  1 -1  1  0  0  0  0  0 -1] (Indices: [1, 2, 6, 12, 14, 15, 16, 17, 18, 19]), Candidate: [3 1 0 0 1 2 0 0 1 1 0 2 0 2 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 115450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0  0  0  0 -1  0  0  1  0 -1  0  1 -1] (Indices: [1, 2, 7, 8, 9, 10, 11, 15, 16, 19]), Candidate: [3 1 0 0 1 1 2 0 1 1 0 0 1 1 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 115500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0  0  0 -1  0  1  0 -1  0  1  0 -1  0] (Indices: [1, 2, 7, 8, 9, 10, 13, 14, 17, 18]), Candidate: [ 3  1  0  0  1  1  2  0  1  1 -1  1  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 115550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0  0 -1  1  0 -1  1 -1  0  1  0 -1  0] (Indices: [1, 2, 7, 8, 9, 11, 12, 14, 17, 18]), Candidate: [ 3  1  0  0  1  1  2  0  1  0  1  1  0  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0  0 -1  0  1  0  0  0 -1  0  1 -1  0] (Indices: [1, 2, 7, 8, 9, 12, 13, 14, 15, 18]), Candidate: [3 1 0 0 1 1 2 0 1 0 0 2 1 1 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 115650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0  0 -1  0  0  0  1  0  0 -1  1  0 -1] (Indices: [1, 2, 7, 8, 9, 14, 15, 16, 18, 19]), Candidate: [3 1 0 0 1 1 2 0 1 0 0 1 1 2 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 115700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0 -1  1  0 -1  1 -1  1  0 -1  1 -1  0] (Indices: [1, 2, 7, 8, 10, 11, 13, 15, 16, 18]), Candidate: [3 1 0 0 1 1 2 0 0 2 0 0 2 0 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 115750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0 -1  1 -1  1 -1  1 -1  1  0  0 -1  0] (Indices: [1, 2, 7, 8, 10, 12, 14, 16, 17, 18]), Candidate: [ 3  1  0  0  1  1  2  0  0  2 -1  2  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 115800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0 -1  0  1  0 -1  1  0  0  0 -1  0  0] (Indices: [1, 2, 7, 8, 11, 12, 14, 15, 16, 17]), Candidate: [3 1 0 0 1 1 2 0 0 1 1 1 0 2 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 115850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0 -1  0  0  1  0 -1  0  1  0  0  0 -1] (Indices: [1, 2, 7, 8, 12, 13, 16, 17, 18, 19]), Candidate: [3 1 0 0 1 1 2 0 0 1 0 2 1 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 115900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  1  0  0 -1  1  0  0 -1  1 -1  0  0] (Indices: [1, 2, 7, 9, 10, 11, 13, 14, 15, 17]), Candidate: [ 3  1  0  0  1  1  2 -1  2  1  0  0  2  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  1  0 -1  1  0 -1  0  1  0  0 -1  0] (Indices: [1, 2, 7, 9, 10, 12, 13, 16, 17, 18]), Candidate: [ 3  1  0  0  1  1  2 -1  2  1 -1  2  1  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 116000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  1 -1  1  0  0 -1  1  0  0 -1  0  0] (Indices: [1, 2, 7, 9, 11, 12, 13, 15, 16, 17]), Candidate: [ 3  1  0  0  1  1  2 -1  2  0  1  1  1  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  1 -1  0  1  0  0  0 -1  1 -1  1 -1] (Indices: [1, 2, 7, 9, 12, 13, 14, 15, 17, 19]), Candidate: [ 3  1  0  0  1  1  2 -1  2  0  0  2  1  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  0  1  0  0 -1  1 -1  1  0  0 -1  0] (Indices: [1, 2, 7, 10, 11, 12, 14, 16, 17, 18]), Candidate: [ 3  1  0  0  1  1  2 -1  1  2  0  1  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 116150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  0  1 -1  1 -1  0  1  0  0  0  0 -1] (Indices: [1, 2, 7, 10, 12, 15, 16, 17, 18, 19]), Candidate: [ 3  1  0  0  1  1  2 -1  1  2 -1  2  0  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 116200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1  0  0  0  0  0 -1  1 -1  1 -1  0  0] (Indices: [1, 2, 8, 9, 10, 11, 12, 13, 15, 17]), Candidate: [3 1 0 0 1 1 1 1 1 1 0 1 1 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 116250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1  0  0  0 -1  0  1  0  0 -1  1 -1  0] (Indices: [1, 2, 8, 9, 10, 11, 14, 15, 16, 18]), Candidate: [3 1 0 0 1 1 1 1 1 1 0 0 1 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 116300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1  0  0 -1  0  1  0  0  0 -1  1 -1  0] (Indices: [1, 2, 8, 9, 10, 13, 14, 15, 16, 18]), Candidate: [ 3  1  0  0  1  1  1  1  1  1 -1  1  2  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1  0 -1  1  0 -1  0  1  0  0  0 -1  0] (Indices: [1, 2, 8, 9, 11, 12, 15, 16, 17, 18]), Candidate: [3 1 0 0 1 1 1 1 1 0 1 1 0 1 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 116400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1  0 -1  0  0  1  0  0 -1  1  0  0 -1] (Indices: [1, 2, 8, 9, 13, 14, 15, 17, 18, 19]), Candidate: [3 1 0 0 1 1 1 1 1 0 0 1 2 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 116450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1 -1  1  0 -1  1 -1  1  0  0 -1  1 -1] (Indices: [1, 2, 8, 10, 11, 13, 15, 16, 17, 19]), Candidate: [3 1 0 0 1 1 1 1 0 2 0 0 2 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 116500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1 -1  0  1  0  0 -1  1  0 -1  1  0 -1] (Indices: [1, 2, 8, 11, 12, 13, 15, 16, 18, 19]), Candidate: [3 1 0 0 1 1 1 1 0 1 1 1 1 0 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 116550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  1  0  0  0 -1  1 -1  1  0  0 -1  0] (Indices: [1, 2, 9, 10, 11, 12, 14, 16, 17, 18]), Candidate: [ 3  1  0  0  1  1  1  0  2  1  0  1  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  1  0 -1  1 -1  0  1  0  0  0  0 -1] (Indices: [1, 2, 9, 10, 12, 15, 16, 17, 18, 19]), Candidate: [ 3  1  0  0  1  1  1  0  2  1 -1  2  0  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  0  1  0  0  0  0 -1  1  0  0 -1  0] (Indices: [1, 2, 10, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 3  1  0  0  1  1  1  0  1  2  0  1  1  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0  0 -1  1 -1  0  1 -1  0  0  0  0  0] (Indices: [1, 3, 4, 5, 6, 7, 8, 9, 11, 14]), Candidate: [ 3  0  2  0  1  1  1  0  1  0  1  0  1  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0 -1  1 -1  0  1 -1  1 -1  0  0  0  0] (Indices: [1, 3, 4, 5, 6, 7, 8, 10, 13, 15]), Candidate: [ 3  0  2  0  1  1  1  0  0  2 -1  1  2  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0 -1  0  0  1  0 -1  0  1 -1  0  0  0] (Indices: [1, 3, 4, 5, 6, 7, 8, 12, 13, 16]), Candidate: [3 0 2 0 1 1 1 0 0 1 0 2 1 0 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 116850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0 -1  0  0  0  0  0  0  1  0  0 -1  0] (Indices: [1, 3, 4, 5, 6, 7, 8, 16, 17, 18]), Candidate: [3 0 2 0 1 1 1 0 0 1 0 1 1 1 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 116900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  1 -1  1 -1  1 -1  0  0  1 -1  0  0] (Indices: [1, 3, 4, 5, 6, 7, 9, 11, 13, 17]), Candidate: [ 3  0  2  0  1  1  1 -1  2  0  1  0  2  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  1 -1  0  0  1 -1  0  1 -1  0  1 -1] (Indices: [1, 3, 4, 5, 6, 7, 9, 13, 16, 19]), Candidate: [ 3  0  2  0  1  1  1 -1  2  0  0  1  2  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  0  1  0 -1  0  0  0  0  1 -1  1 -1] (Indices: [1, 3, 4, 5, 6, 7, 10, 11, 17, 19]), Candidate: [ 3  0  2  0  1  1  1 -1  1  2  0  0  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  0  1 -1  0  0  0  1  0 -1  0  1 -1] (Indices: [1, 3, 4, 5, 6, 7, 10, 15, 16, 19]), Candidate: [ 3  0  2  0  1  1  1 -1  1  2 -1  1  1  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 117100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  0  0  1 -1  0  1 -1  1 -1  0  1 -1] (Indices: [1, 3, 4, 5, 6, 7, 11, 14, 16, 19]), Candidate: [ 3  0  2  0  1  1  1 -1  1  1  1  0  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 117150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  0  0  0  0  1  0  0 -1  1 -1  0  0] (Indices: [1, 3, 4, 5, 6, 7, 13, 14, 15, 17]), Candidate: [ 3  0  2  0  1  1  1 -1  1  1  0  1  2  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1  0  0 -1  0  1 -1  1 -1  0  0  0  0] (Indices: [1, 3, 4, 5, 6, 8, 9, 10, 13, 15]), Candidate: [ 3  0  2  0  1  1  0  1  1  1 -1  1  2  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1  0 -1  0  1  0 -1  0  1 -1  0  0  0] (Indices: [1, 3, 4, 5, 6, 8, 9, 12, 13, 16]), Candidate: [3 0 2 0 1 1 0 1 1 0 0 2 1 0 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 117300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1  0 -1  0  0  0  0  0  1  0  0 -1  0] (Indices: [1, 3, 4, 5, 6, 8, 9, 16, 17, 18]), Candidate: [3 0 2 0 1 1 0 1 1 0 0 1 1 1 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 117350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1 -1  1 -1  1 -1  0  0  0  1  0 -1  0] (Indices: [1, 3, 4, 5, 6, 8, 10, 12, 17, 18]), Candidate: [ 3  0  2  0  1  1  0  1  0  2 -1  2  0  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1 -1  0  1  0 -1  0  1 -1  1 -1  0  0] (Indices: [1, 3, 4, 5, 6, 8, 11, 12, 15, 17]), Candidate: [3 0 2 0 1 1 0 1 0 1 1 1 0 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 117450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1 -1  0  0  1  0 -1  1 -1  1 -1  0  0] (Indices: [1, 3, 4, 5, 6, 8, 12, 13, 15, 17]), Candidate: [3 0 2 0 1 1 0 1 0 1 0 2 1 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 117500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1 -1  0  0  0  0  1  0  0 -1  1 -1  0] (Indices: [1, 3, 4, 5, 6, 8, 14, 15, 16, 18]), Candidate: [3 0 2 0 1 1 0 1 0 1 0 1 1 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 117550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  1  0 -1  1 -1  1 -1  0  1 -1  0  0] (Indices: [1, 3, 4, 5, 6, 9, 10, 12, 14, 17]), Candidate: [ 3  0  2  0  1  1  0  0  2  1 -1  2  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 117600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  1 -1  1  0  0 -1  0  1 -1  0  0  0] (Indices: [1, 3, 4, 5, 6, 9, 11, 12, 13, 16]), Candidate: [3 0 2 0 1 1 0 0 2 0 1 1 1 0 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 117650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  1 -1  1 -1  0  0  0  1  0  0 -1  0] (Indices: [1, 3, 4, 5, 6, 9, 11, 16, 17, 18]), Candidate: [3 0 2 0 1 1 0 0 2 0 1 0 1 1 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 117700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  1 -1  0  0  1 -1  1  0 -1  1 -1  0] (Indices: [1, 3, 4, 5, 6, 9, 13, 15, 16, 18]), Candidate: [3 0 2 0 1 1 0 0 2 0 0 1 2 0 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 117750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  0  1  0 -1  1 -1  1  0 -1  0  0  0] (Indices: [1, 3, 4, 5, 6, 10, 11, 13, 15, 16]), Candidate: [3 0 2 0 1 1 0 0 1 2 0 0 2 0 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 117800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  0  1 -1  1 -1  1 -1  1 -1  1 -1  0] (Indices: [1, 3, 4, 5, 6, 10, 12, 14, 16, 18]), Candidate: [ 3  0  2  0  1  1  0  0  1  2 -1  2  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 117850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  0  0  1  0  0  0  0 -1  0  0  0  0] (Indices: [1, 3, 4, 5, 6, 11, 12, 13, 14, 15]), Candidate: [3 0 2 0 1 1 0 0 1 1 1 1 1 1 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 117900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  0  0  1 -1  1 -1  1 -1  0  1  0 -1] (Indices: [1, 3, 4, 5, 6, 11, 13, 15, 18, 19]), Candidate: [3 0 2 0 1 1 0 0 1 1 1 0 2 0 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 117950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  0  0  0  1 -1  0  1  0  0  0 -1  0] (Indices: [1, 3, 4, 5, 6, 12, 15, 16, 17, 18]), Candidate: [3 0 2 0 1 1 0 0 1 1 0 2 0 1 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 118000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0  0  0 -1  0  0  1 -1  0  0  1 -1  0] (Indices: [1, 3, 4, 5, 7, 8, 9, 10, 14, 18]), Candidate: [ 3  0  2  0  1  0  2  0  1  1 -1  1  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 118050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0  0 -1  0  1 -1  1 -1  0  0  0  1 -1] (Indices: [1, 3, 4, 5, 7, 8, 9, 12, 14, 19]), Candidate: [ 3  0  2  0  1  0  2  0  1  0  0  2  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0 -1  1  0  0 -1  0  0  0  1 -1  0  0] (Indices: [1, 3, 4, 5, 7, 8, 10, 11, 12, 17]), Candidate: [3 0 2 0 1 0 2 0 0 2 0 1 0 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 118150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0 -1  1 -1  0  1 -1  1  0 -1  0  0  0] (Indices: [1, 3, 4, 5, 7, 8, 10, 13, 15, 16]), Candidate: [ 3  0  2  0  1  0  2  0  0  2 -1  1  2  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0 -1  0  1  0 -1  0  0  0  0  1  0 -1] (Indices: [1, 3, 4, 5, 7, 8, 11, 12, 18, 19]), Candidate: [3 0 2 0 1 0 2 0 0 1 1 1 0 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 118250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0 -1  0  0  1  0 -1  0  0  0  1  0 -1] (Indices: [1, 3, 4, 5, 7, 8, 12, 13, 18, 19]), Candidate: [3 0 2 0 1 0 2 0 0 1 0 2 1 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 118300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0 -1  0  0  0  0  1 -1  0  1  0  0 -1] (Indices: [1, 3, 4, 5, 7, 8, 14, 17, 18, 19]), Candidate: [ 3  0  2  0  1  0  2  0  0  1  0  1  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  1  0 -1  1 -1  0  0  1 -1  1 -1  0] (Indices: [1, 3, 4, 5, 7, 9, 10, 12, 16, 18]), Candidate: [ 3  0  2  0  1  0  2 -1  2  1 -1  2  0  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 118400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  1 -1  1  0 -1  1 -1  0  0  0  1 -1] (Indices: [1, 3, 4, 5, 7, 9, 11, 12, 14, 19]), Candidate: [ 3  0  2  0  1  0  2 -1  2  0  1  1  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 118450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  1 -1  0  1  0  0 -1  0  0  0  1 -1] (Indices: [1, 3, 4, 5, 7, 9, 12, 13, 14, 19]), Candidate: [ 3  0  2  0  1  0  2 -1  2  0  0  2  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 118500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  1 -1  0  0  1 -1  0  0  1  0  0 -1] (Indices: [1, 3, 4, 5, 7, 9, 13, 17, 18, 19]), Candidate: [ 3  0  2  0  1  0  2 -1  2  0  0  1  2  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  0  1  0 -1  1 -1  0  0  1 -1  1 -1] (Indices: [1, 3, 4, 5, 7, 10, 11, 13, 17, 19]), Candidate: [ 3  0  2  0  1  0  2 -1  1  2  0  0  2  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  0  1 -1  1 -1  0  1 -1  1  0 -1  0] (Indices: [1, 3, 4, 5, 7, 10, 12, 15, 17, 18]), Candidate: [ 3  0  2  0  1  0  2 -1  1  2 -1  2  0  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 118650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  0  0  1  0  0 -1  1 -1  0  0  1 -1] (Indices: [1, 3, 4, 5, 7, 11, 12, 13, 15, 19]), Candidate: [ 3  0  2  0  1  0  2 -1  1  1  1  1  1  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  0  0  1 -1  0  1  0 -1  1  0 -1  0] (Indices: [1, 3, 4, 5, 7, 11, 14, 15, 17, 18]), Candidate: [ 3  0  2  0  1  0  2 -1  1  1  1  0  1  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  0  0  0  0  1  0  0 -1  1  0 -1  0] (Indices: [1, 3, 4, 5, 7, 13, 14, 15, 17, 18]), Candidate: [ 3  0  2  0  1  0  2 -1  1  1  0  1  2  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1  0  0 -1  1  0 -1  0  0  0  1 -1  0] (Indices: [1, 3, 4, 5, 8, 9, 10, 12, 13, 18]), Candidate: [ 3  0  2  0  1  0  1  1  1  1 -1  2  1  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1  0  0 -1  0  0  0  0  1 -1  1  0 -1] (Indices: [1, 3, 4, 5, 8, 9, 10, 16, 18, 19]), Candidate: [ 3  0  2  0  1  0  1  1  1  1 -1  1  1  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1  0 -1  1 -1  0  0  1  0 -1  0  1 -1] (Indices: [1, 3, 4, 5, 8, 9, 11, 15, 16, 19]), Candidate: [3 0 2 0 1 0 1 1 1 0 1 0 1 1 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 118950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1  0 -1  0  0  1  0 -1  0  1  0 -1  0] (Indices: [1, 3, 4, 5, 8, 9, 13, 14, 17, 18]), Candidate: [ 3  0  2  0  1  0  1  1  1  0  0  1  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1 -1  1  0 -1  1  0 -1  1 -1  0  0  0] (Indices: [1, 3, 4, 5, 8, 10, 11, 13, 14, 16]), Candidate: [ 3  0  2  0  1  0  1  1  0  2  0  0  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1 -1  1 -1  1 -1  1  0 -1  1 -1  0  0] (Indices: [1, 3, 4, 5, 8, 10, 12, 14, 15, 17]), Candidate: [ 3  0  2  0  1  0  1  1  0  2 -1  2  0  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1 -1  1 -1  0  0  0  1  0  0 -1  1 -1] (Indices: [1, 3, 4, 5, 8, 10, 15, 16, 17, 19]), Candidate: [ 3  0  2  0  1  0  1  1  0  2 -1  1  1  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1 -1  0  1 -1  1 -1  1  0 -1  1 -1  0] (Indices: [1, 3, 4, 5, 8, 11, 13, 15, 16, 18]), Candidate: [3 0 2 0 1 0 1 1 0 1 1 0 2 0 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 119200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1 -1  0  0  1 -1  1 -1  1  0  0 -1  0] (Indices: [1, 3, 4, 5, 8, 12, 14, 16, 17, 18]), Candidate: [ 3  0  2  0  1  0  1  1  0  1  0  2  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  1  0  0  0 -1  0  0  0  0  1  0 -1] (Indices: [1, 3, 4, 5, 9, 10, 11, 12, 18, 19]), Candidate: [3 0 2 0 1 0 1 0 2 1 0 1 0 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 119300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  1  0 -1  1  0 -1  0  0  0  1  0 -1] (Indices: [1, 3, 4, 5, 9, 10, 12, 13, 18, 19]), Candidate: [ 3  0  2  0  1  0  1  0  2  1 -1  2  1  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  1  0 -1  0  0  1 -1  0  1  0  0 -1] (Indices: [1, 3, 4, 5, 9, 10, 14, 17, 18, 19]), Candidate: [ 3  0  2  0  1  0  1  0  2  1 -1  1  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 119400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  1 -1  1 -1  1  0 -1  0  0  1  0 -1] (Indices: [1, 3, 4, 5, 9, 11, 13, 14, 18, 19]), Candidate: [ 3  0  2  0  1  0  1  0  2  0  1  0  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  1 -1  0  1 -1  1  0 -1  1 -1  1 -1] (Indices: [1, 3, 4, 5, 9, 12, 14, 15, 17, 19]), Candidate: [3 0 2 0 1 0 1 0 2 0 0 2 0 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 119500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  0  1  0  0 -1  1  0 -1  0  0  1 -1] (Indices: [1, 3, 4, 5, 10, 11, 12, 14, 15, 19]), Candidate: [3 0 2 0 1 0 1 0 1 2 0 1 0 2 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 119550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  0  1  0 -1  0  0  1 -1  1  0  0 -1] (Indices: [1, 3, 4, 5, 10, 11, 15, 17, 18, 19]), Candidate: [3 0 2 0 1 0 1 0 1 2 0 0 1 1 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 119600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  0  1 -1  0  1 -1  1 -1  1  0  0 -1] (Indices: [1, 3, 4, 5, 10, 13, 15, 17, 18, 19]), Candidate: [ 3  0  2  0  1  0  1  0  1  2 -1  1  2  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  0  0  1 -1  1  0 -1  1  0 -1  1 -1] (Indices: [1, 3, 4, 5, 11, 13, 14, 16, 17, 19]), Candidate: [ 3  0  2  0  1  0  1  0  1  1  1  0  2  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0  0  0 -1  1  0 -1  0  0  0  0  0  0] (Indices: [1, 3, 4, 6, 7, 8, 9, 10, 12, 13]), Candidate: [ 3  0  2  0  0  2  1  0  1  1 -1  2  1  0  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0  0 -1  1 -1  0  0  0  1  0 -1  0  0] (Indices: [1, 3, 4, 6, 7, 8, 9, 11, 16, 17]), Candidate: [3 0 2 0 0 2 1 0 1 0 1 0 1 1 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 119800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0  0 -1  0  0  0  1 -1  0  1 -1  1 -1] (Indices: [1, 3, 4, 6, 7, 8, 9, 14, 17, 19]), Candidate: [ 3  0  2  0  0  2  1  0  1  0  0  1  1  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0 -1  1 -1  1 -1  1 -1  0  0  0  1 -1] (Indices: [1, 3, 4, 6, 7, 8, 10, 12, 14, 19]), Candidate: [ 3  0  2  0  0  2  1  0  0  2 -1  2  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 119900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0 -1  0  1  0  0 -1  0  0  0  1 -1  0] (Indices: [1, 3, 4, 6, 7, 8, 11, 12, 13, 18]), Candidate: [3 0 2 0 0 2 1 0 0 1 1 1 1 0 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 119950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0 -1  0  1 -1  0  0  0  1 -1  1  0 -1] (Indices: [1, 3, 4, 6, 7, 8, 11, 16, 18, 19]), Candidate: [3 0 2 0 0 2 1 0 0 1 1 0 1 1 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 120000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0 -1  0  0  0  1 -1  1 -1  1  0 -1  0] (Indices: [1, 3, 4, 6, 7, 8, 13, 15, 17, 18]), Candidate: [3 0 2 0 0 2 1 0 0 1 0 1 2 0 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 120050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  1  0 -1  1  0  0 -1  0  0  0  0  0] (Indices: [1, 3, 4, 6, 7, 9, 10, 12, 13, 14]), Candidate: [ 3  0  2  0  0  2  1 -1  2  1 -1  2  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 120100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  1  0 -1  0  0  0  1 -1  1 -1  1 -1] (Indices: [1, 3, 4, 6, 7, 9, 10, 15, 17, 19]), Candidate: [ 3  0  2  0  0  2  1 -1  2  1 -1  1  1  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 120150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  1 -1  1 -1  0  1 -1  0  1 -1  1 -1] (Indices: [1, 3, 4, 6, 7, 9, 11, 14, 17, 19]), Candidate: [ 3  0  2  0  0  2  1 -1  2  0  1  0  1  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 120200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  1 -1  0  0  1  0  0 -1  0  0  1 -1] (Indices: [1, 3, 4, 6, 7, 9, 13, 14, 15, 19]), Candidate: [ 3  0  2  0  0  2  1 -1  2  0  0  1  2  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  0  1  0  0 -1  0  0  0  1  0 -1  0] (Indices: [1, 3, 4, 6, 7, 10, 11, 12, 17, 18]), Candidate: [ 3  0  2  0  0  2  1 -1  1  2  0  1  0  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  0  1 -1  1  0 -1  0  0  1  0 -1  0] (Indices: [1, 3, 4, 6, 7, 10, 12, 13, 17, 18]), Candidate: [ 3  0  2  0  0  2  1 -1  1  2 -1  2  1  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 120350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  0  1 -1  0  0  1 -1  1  0 -1  1 -1] (Indices: [1, 3, 4, 6, 7, 10, 14, 16, 17, 19]), Candidate: [ 3  0  2  0  0  2  1 -1  1  2 -1  1  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 120400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  0  0  1 -1  1  0 -1  0  1  0 -1  0] (Indices: [1, 3, 4, 6, 7, 11, 13, 14, 17, 18]), Candidate: [ 3  0  2  0  0  2  1 -1  1  1  1  0  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 120450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  0  0  0  1 -1  1  0  0 -1  0  1 -1] (Indices: [1, 3, 4, 6, 7, 12, 14, 15, 16, 19]), Candidate: [ 3  0  2  0  0  2  1 -1  1  1  0  2  0  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1  0  0  0 -1  0  1 -1  0  0  1 -1  0] (Indices: [1, 3, 4, 6, 8, 9, 10, 11, 14, 18]), Candidate: [ 3  0  2  0  0  2  0  1  1  1  0  0  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1  0  0 -1  0  0  1  0 -1  0  1 -1  0] (Indices: [1, 3, 4, 6, 8, 9, 10, 14, 15, 18]), Candidate: [ 3  0  2  0  0  2  0  1  1  1 -1  1  1  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1  0 -1  1 -1  1 -1  0  1 -1  0  1 -1] (Indices: [1, 3, 4, 6, 8, 9, 11, 13, 16, 19]), Candidate: [3 0 2 0 0 2 0 1 1 0 1 0 2 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 120650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1  0 -1  0  1 -1  0  1  0 -1  1 -1  0] (Indices: [1, 3, 4, 6, 8, 9, 12, 15, 16, 18]), Candidate: [3 0 2 0 0 2 0 1 1 0 0 2 0 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 120700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1 -1  1  0  0 -1  1  0 -1  0  0  0  0] (Indices: [1, 3, 4, 6, 8, 10, 11, 12, 14, 15]), Candidate: [3 0 2 0 0 2 0 1 0 2 0 1 0 2 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 120750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1 -1  1 -1  1  0  0  0 -1  0  0  0  0] (Indices: [1, 3, 4, 6, 8, 10, 12, 13, 14, 15]), Candidate: [ 3  0  2  0  0  2  0  1  0  2 -1  2  1  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1 -1  1 -1  0  1 -1  1 -1  0  1  0 -1] (Indices: [1, 3, 4, 6, 8, 10, 13, 15, 18, 19]), Candidate: [ 3  0  2  0  0  2  0  1  0  2 -1  1  2  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1 -1  0  1  0 -1  0  1 -1  0  1  0 -1] (Indices: [1, 3, 4, 6, 8, 11, 12, 15, 18, 19]), Candidate: [3 0 2 0 0 2 0 1 0 1 1 1 0 1 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 120900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1 -1  0  0  1  0 -1  1  0  0 -1  0  0] (Indices: [1, 3, 4, 6, 8, 12, 13, 15, 16, 17]), Candidate: [3 0 2 0 0 2 0 1 0 1 0 2 1 0 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 120950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  1  0  0  0  0 -1  0  0  0  1 -1  0] (Indices: [1, 3, 4, 6, 9, 10, 11, 12, 13, 18]), Candidate: [3 0 2 0 0 2 0 0 2 1 0 1 1 0 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 121000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  1  0  0 -1  0  0  0  1 -1  1  0 -1] (Indices: [1, 3, 4, 6, 9, 10, 11, 16, 18, 19]), Candidate: [3 0 2 0 0 2 0 0 2 1 0 0 1 1 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 121050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  1  0 -1  0  1 -1  1 -1  1  0 -1  0] (Indices: [1, 3, 4, 6, 9, 10, 13, 15, 17, 18]), Candidate: [ 3  0  2  0  0  2  0  0  2  1 -1  1  2  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  1 -1  1  0 -1  0  1 -1  1  0 -1  0] (Indices: [1, 3, 4, 6, 9, 11, 12, 15, 17, 18]), Candidate: [3 0 2 0 0 2 0 0 2 0 1 1 0 1 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 121150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  1 -1  0  1  0  0 -1  0  1 -1  1 -1] (Indices: [1, 3, 4, 6, 9, 12, 13, 14, 17, 19]), Candidate: [ 3  0  2  0  0  2  0  0  2  0  0  2  1  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  0  1  0  0  0  0 -1  0  1 -1  0  0] (Indices: [1, 3, 4, 6, 10, 11, 12, 13, 14, 17]), Candidate: [ 3  0  2  0  0  2  0  0  1  2  0  1  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  0  1  0 -1  1 -1  0  1  0 -1  1 -1] (Indices: [1, 3, 4, 6, 10, 11, 13, 16, 17, 19]), Candidate: [3 0 2 0 0 2 0 0 1 2 0 0 2 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 121300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  0  1 -1  1 -1  0  1  0 -1  1  0 -1] (Indices: [1, 3, 4, 6, 10, 12, 15, 16, 18, 19]), Candidate: [ 3  0  2  0  0  2  0  0  1  2 -1  2  0  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  0  0  1  0 -1  1 -1  1  0  0 -1  0] (Indices: [1, 3, 4, 6, 11, 12, 14, 16, 17, 18]), Candidate: [ 3  0  2  0  0  2  0  0  1  1  1  1  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  0  0  0  1 -1  0  1  0  0  0  0 -1] (Indices: [1, 3, 4, 6, 12, 15, 16, 17, 18, 19]), Candidate: [3 0 2 0 0 2 0 0 1 1 0 2 0 1 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 121450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0  0  0 -1  1 -1  0  1 -1  0  0  1 -1] (Indices: [1, 3, 4, 7, 8, 9, 10, 12, 15, 19]), Candidate: [ 3  0  2  0  0  1  2  0  1  1 -1  2  0  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0  0 -1  1  0 -1  1 -1  0  1 -1  0  0] (Indices: [1, 3, 4, 7, 8, 9, 11, 12, 14, 17]), Candidate: [ 3  0  2  0  0  1  2  0  1  0  1  1  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0  0 -1  0  1  0  0 -1  0  1 -1  0  0] (Indices: [1, 3, 4, 7, 8, 9, 12, 13, 14, 17]), Candidate: [ 3  0  2  0  0  1  2  0  1  0  0  2  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0  0 -1  0  0  1 -1  0  1  0 -1  1 -1] (Indices: [1, 3, 4, 7, 8, 9, 13, 16, 17, 19]), Candidate: [3 0 2 0 0 1 2 0 1 0 0 1 2 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 121650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0 -1  1  0 -1  1 -1  0  1 -1  0  1 -1] (Indices: [1, 3, 4, 7, 8, 10, 11, 13, 16, 19]), Candidate: [3 0 2 0 0 1 2 0 0 2 0 0 2 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 121700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0 -1  1 -1  1 -1  0  1  0 -1  1 -1  0] (Indices: [1, 3, 4, 7, 8, 10, 12, 15, 16, 18]), Candidate: [ 3  0  2  0  0  1  2  0  0  2 -1  2  0  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0 -1  0  1  0  0 -1  1 -1  1 -1  0  0] (Indices: [1, 3, 4, 7, 8, 11, 12, 13, 15, 17]), Candidate: [3 0 2 0 0 1 2 0 0 1 1 1 1 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 121800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0 -1  0  1 -1  0  1  0  0 -1  1 -1  0] (Indices: [1, 3, 4, 7, 8, 11, 14, 15, 16, 18]), Candidate: [3 0 2 0 0 1 2 0 0 1 1 0 1 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 121850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0 -1  0  0  0  1  0  0  0 -1  1 -1  0] (Indices: [1, 3, 4, 7, 8, 13, 14, 15, 16, 18]), Candidate: [3 0 2 0 0 1 2 0 0 1 0 1 2 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 121900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  1  0  0 -1  1 -1  0  1  0 -1  0  0] (Indices: [1, 3, 4, 7, 9, 10, 11, 13, 16, 17]), Candidate: [ 3  0  2  0  0  1  2 -1  2  1  0  0  2  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  1  0 -1  1 -1  1 -1  0  0  1  0 -1] (Indices: [1, 3, 4, 7, 9, 10, 12, 14, 18, 19]), Candidate: [ 3  0  2  0  0  1  2 -1  2  1 -1  2  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 122000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  1 -1  1  0  0  0 -1  0  0  0  1 -1] (Indices: [1, 3, 4, 7, 9, 11, 12, 13, 14, 19]), Candidate: [ 3  0  2  0  0  1  2 -1  2  0  1  1  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 122050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  1 -1  1 -1  1 -1  0  0  1  0  0 -1] (Indices: [1, 3, 4, 7, 9, 11, 13, 17, 18, 19]), Candidate: [ 3  0  2  0  0  1  2 -1  2  0  1  0  2  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  1 -1  0  1 -1  0  0  1  0  0  0 -1] (Indices: [1, 3, 4, 7, 9, 12, 16, 17, 18, 19]), Candidate: [ 3  0  2  0  0  1  2 -1  2  0  0  2  0  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  0  1  0  0 -1  0  1 -1  1  0 -1  0] (Indices: [1, 3, 4, 7, 10, 11, 12, 15, 17, 18]), Candidate: [ 3  0  2  0  0  1  2 -1  1  2  0  1  0  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  0  1 -1  1  0  0 -1  0  1 -1  1 -1] (Indices: [1, 3, 4, 7, 10, 12, 13, 14, 17, 19]), Candidate: [ 3  0  2  0  0  1  2 -1  1  2 -1  2  1  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 122250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  0  0  1  0  0  0  0 -1  0  1 -1  0] (Indices: [1, 3, 4, 7, 11, 12, 13, 14, 15, 18]), Candidate: [ 3  0  2  0  0  1  2 -1  1  1  1  1  1  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  0  0  1 -1  0  1  0  0 -1  1  0 -1] (Indices: [1, 3, 4, 7, 11, 14, 15, 16, 18, 19]), Candidate: [ 3  0  2  0  0  1  2 -1  1  1  1  0  1  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1  0  0  0  0 -1  0  0  0  1  0 -1  0] (Indices: [1, 3, 4, 8, 9, 10, 11, 12, 17, 18]), Candidate: [3 0 2 0 0 1 1 1 1 1 0 1 0 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 122400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1  0  0 -1  1  0 -1  0  0  1  0 -1  0] (Indices: [1, 3, 4, 8, 9, 10, 12, 13, 17, 18]), Candidate: [ 3  0  2  0  0  1  1  1  1  1 -1  2  1  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1  0  0 -1  0  0  1 -1  1  0 -1  1 -1] (Indices: [1, 3, 4, 8, 9, 10, 14, 16, 17, 19]), Candidate: [ 3  0  2  0  0  1  1  1  1  1 -1  1  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 122500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1  0 -1  1 -1  1  0 -1  0  1  0 -1  0] (Indices: [1, 3, 4, 8, 9, 11, 13, 14, 17, 18]), Candidate: [ 3  0  2  0  0  1  1  1  1  0  1  0  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1  0 -1  0  1 -1  1  0  0 -1  0  1 -1] (Indices: [1, 3, 4, 8, 9, 12, 14, 15, 16, 19]), Candidate: [3 0 2 0 0 1 1 1 1 0 0 2 0 2 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 122600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1 -1  1  0  0 -1  1  0 -1  1 -1  0  0] (Indices: [1, 3, 4, 8, 10, 11, 12, 14, 15, 17]), Candidate: [3 0 2 0 0 1 1 1 0 2 0 1 0 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 122650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1 -1  1  0 -1  0  0  1  0  0 -1  1 -1] (Indices: [1, 3, 4, 8, 10, 11, 15, 16, 17, 19]), Candidate: [3 0 2 0 0 1 1 1 0 2 0 0 1 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 122700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1 -1  1 -1  0  1 -1  1  0  0 -1  1 -1] (Indices: [1, 3, 4, 8, 10, 13, 15, 16, 17, 19]), Candidate: [ 3  0  2  0  0  1  1  1  0  2 -1  1  2  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1 -1  0  1 -1  1  0  0 -1  0  1  0 -1] (Indices: [1, 3, 4, 8, 11, 13, 14, 15, 18, 19]), Candidate: [3 0 2 0 0 1 1 1 0 1 1 0 2 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 122800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  1  0  0  0  0 -1  1 -1  1 -1  0  0] (Indices: [1, 3, 4, 9, 10, 11, 12, 13, 15, 17]), Candidate: [3 0 2 0 0 1 1 0 2 1 0 1 1 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 122850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  1  0  0 -1  0  1  0  0 -1  1 -1  0] (Indices: [1, 3, 4, 9, 10, 11, 14, 15, 16, 18]), Candidate: [3 0 2 0 0 1 1 0 2 1 0 0 1 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 122900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  1  0 -1  0  1  0  0  0 -1  1 -1  0] (Indices: [1, 3, 4, 9, 10, 13, 14, 15, 16, 18]), Candidate: [ 3  0  2  0  0  1  1  0  2  1 -1  1  2  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  1 -1  1  0 -1  0  1  0  0  0 -1  0] (Indices: [1, 3, 4, 9, 11, 12, 15, 16, 17, 18]), Candidate: [3 0 2 0 0 1 1 0 2 0 1 1 0 1 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 123000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  1 -1  0  0  1  0  0 -1  1  0  0 -1] (Indices: [1, 3, 4, 9, 13, 14, 15, 17, 18, 19]), Candidate: [3 0 2 0 0 1 1 0 2 0 0 1 2 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 123050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  0  1  0 -1  1 -1  1  0  0 -1  1 -1] (Indices: [1, 3, 4, 10, 11, 13, 15, 16, 17, 19]), Candidate: [3 0 2 0 0 1 1 0 1 2 0 0 2 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 123100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  0  0  1  0  0 -1  1  0 -1  1  0 -1] (Indices: [1, 3, 4, 11, 12, 13, 15, 16, 18, 19]), Candidate: [3 0 2 0 0 1 1 0 1 1 1 1 1 0 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 123150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0  0  0 -1  0  0  0  1  0 -1  0  0  0] (Indices: [1, 3, 5, 6, 7, 8, 9, 10, 15, 16]), Candidate: [ 3  0  2 -1  2  1  1  0  1  1 -1  1  1  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 123200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0  0 -1  0  1 -1  0  1 -1  1 -1  0  0] (Indices: [1, 3, 5, 6, 7, 8, 9, 12, 15, 17]), Candidate: [ 3  0  2 -1  2  1  1  0  1  0  0  2  0  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0 -1  1  0  0 -1  0  0  0  0  0  1 -1] (Indices: [1, 3, 5, 6, 7, 8, 10, 11, 12, 19]), Candidate: [ 3  0  2 -1  2  1  1  0  0  2  0  1  0  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0 -1  1 -1  0  1 -1  1 -1  0  1 -1  0] (Indices: [1, 3, 5, 6, 7, 8, 10, 13, 15, 18]), Candidate: [ 3  0  2 -1  2  1  1  0  0  2 -1  1  2  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 123350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0 -1  0  1 -1  1  0 -1  1 -1  0  0  0] (Indices: [1, 3, 5, 6, 7, 8, 11, 13, 14, 16]), Candidate: [ 3  0  2 -1  2  1  1  0  0  1  1  0  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 123400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0 -1  0  0  1 -1  1  0 -1  1 -1  0  0] (Indices: [1, 3, 5, 6, 7, 8, 12, 14, 15, 17]), Candidate: [ 3  0  2 -1  2  1  1  0  0  1  0  2  0  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0 -1  0  0  0  0  0  1  0  0 -1  1 -1] (Indices: [1, 3, 5, 6, 7, 8, 15, 16, 17, 19]), Candidate: [ 3  0  2 -1  2  1  1  0  0  1  0  1  1  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  1  0 -1  1 -1  0  0  0  1  0 -1  0] (Indices: [1, 3, 5, 6, 7, 9, 10, 12, 17, 18]), Candidate: [ 3  0  2 -1  2  1  1 -1  2  1 -1  2  0  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 123550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  1 -1  1  0 -1  0  1 -1  1 -1  0  0] (Indices: [1, 3, 5, 6, 7, 9, 11, 12, 15, 17]), Candidate: [ 3  0  2 -1  2  1  1 -1  2  0  1  1  0  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 123600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  1 -1  0  1  0 -1  1 -1  1 -1  0  0] (Indices: [1, 3, 5, 6, 7, 9, 12, 13, 15, 17]), Candidate: [ 3  0  2 -1  2  1  1 -1  2  0  0  2  1  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 123650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  1 -1  0  0  0  1  0  0 -1  1 -1  0] (Indices: [1, 3, 5, 6, 7, 9, 14, 15, 16, 18]), Candidate: [ 3  0  2 -1  2  1  1 -1  2  0  0  1  1  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 123700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  0  1  0 -1  0  1  0  0 -1  0  0  0] (Indices: [1, 3, 5, 6, 7, 10, 11, 14, 15, 16]), Candidate: [ 3  0  2 -1  2  1  1 -1  1  2  0  0  1  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 123750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  0  1 -1  1 -1  0  1 -1  0  1  0 -1] (Indices: [1, 3, 5, 6, 7, 10, 12, 15, 18, 19]), Candidate: [ 3  0  2 -1  2  1  1 -1  1  2 -1  2  0  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 123800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  0  0  1  0  0 -1  0  1 -1  1 -1  0] (Indices: [1, 3, 5, 6, 7, 11, 12, 13, 16, 18]), Candidate: [ 3  0  2 -1  2  1  1 -1  1  1  1  1  1  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 123850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  0  0  1 -1  0  1  0 -1  0  1  0 -1] (Indices: [1, 3, 5, 6, 7, 11, 14, 15, 18, 19]), Candidate: [ 3  0  2 -1  2  1  1 -1  1  1  1  0  1  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 123900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  0  0  0  0  1  0  0 -1  0  1  0 -1] (Indices: [1, 3, 5, 6, 7, 13, 14, 15, 18, 19]), Candidate: [ 3  0  2 -1  2  1  1 -1  1  1  0  1  2  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 123950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1  0  0 -1  1 -1  1  0 -1  0  0  0  0] (Indices: [1, 3, 5, 6, 8, 9, 10, 12, 14, 15]), Candidate: [ 3  0  2 -1  2  1  0  1  1  1 -1  2  0  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1  0 -1  1  0  0  0 -1  0  0  0  0  0] (Indices: [1, 3, 5, 6, 8, 9, 11, 12, 13, 14]), Candidate: [ 3  0  2 -1  2  1  0  1  1  0  1  1  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1  0 -1  1 -1  0  0  1 -1  1 -1  1 -1] (Indices: [1, 3, 5, 6, 8, 9, 11, 15, 17, 19]), Candidate: [ 3  0  2 -1  2  1  0  1  1  0  1  0  1  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 124100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1  0 -1  0  0  1  0 -1  0  0  1  0 -1] (Indices: [1, 3, 5, 6, 8, 9, 13, 14, 18, 19]), Candidate: [ 3  0  2 -1  2  1  0  1  1  0  0  1  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1 -1  1  0 -1  1  0 -1  0  0  1 -1  0] (Indices: [1, 3, 5, 6, 8, 10, 11, 13, 14, 18]), Candidate: [ 3  0  2 -1  2  1  0  1  0  2  0  0  2  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1 -1  1 -1  1 -1  1  0 -1  0  0  1 -1] (Indices: [1, 3, 5, 6, 8, 10, 12, 14, 15, 19]), Candidate: [ 3  0  2 -1  2  1  0  1  0  2 -1  2  0  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1 -1  1 -1  0  0  0  1 -1  1  0  0 -1] (Indices: [1, 3, 5, 6, 8, 10, 15, 17, 18, 19]), Candidate: [ 3  0  2 -1  2  1  0  1  0  2 -1  1  1  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1 -1  0  1 -1  1 -1  1 -1  1  0 -1  0] (Indices: [1, 3, 5, 6, 8, 11, 13, 15, 17, 18]), Candidate: [ 3  0  2 -1  2  1  0  1  0  1  1  0  2  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 124350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1 -1  0  0  1 -1  1 -1  1 -1  1  0 -1] (Indices: [1, 3, 5, 6, 8, 12, 14, 16, 18, 19]), Candidate: [ 3  0  2 -1  2  1  0  1  0  1  0  2  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  1  0  0 -1  1  0 -1  1 -1  0  0  0] (Indices: [1, 3, 5, 6, 9, 10, 11, 13, 14, 16]), Candidate: [ 3  0  2 -1  2  1  0  0  2  1  0  0  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  1  0 -1  1 -1  1  0 -1  1 -1  0  0] (Indices: [1, 3, 5, 6, 9, 10, 12, 14, 15, 17]), Candidate: [ 3  0  2 -1  2  1  0  0  2  1 -1  2  0  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  1  0 -1  0  0  0  1  0  0 -1  1 -1] (Indices: [1, 3, 5, 6, 9, 10, 15, 16, 17, 19]), Candidate: [ 3  0  2 -1  2  1  0  0  2  1 -1  1  1  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  1 -1  1 -1  1 -1  1  0 -1  1 -1  0] (Indices: [1, 3, 5, 6, 9, 11, 13, 15, 16, 18]), Candidate: [ 3  0  2 -1  2  1  0  0  2  0  1  0  2  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 124600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  1 -1  0  1 -1  1 -1  1  0  0 -1  0] (Indices: [1, 3, 5, 6, 9, 12, 14, 16, 17, 18]), Candidate: [ 3  0  2 -1  2  1  0  0  2  0  0  2  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  0  1  0  0 -1  1 -1  1 -1  1 -1  0] (Indices: [1, 3, 5, 6, 10, 11, 12, 14, 16, 18]), Candidate: [ 3  0  2 -1  2  1  0  0  1  2  0  1  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  0  1 -1  1  0  0  0  0 -1  0  0  0] (Indices: [1, 3, 5, 6, 10, 12, 13, 14, 15, 16]), Candidate: [ 3  0  2 -1  2  1  0  0  1  2 -1  2  1  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  0  1 -1  0  0  1  0  0  0  0 -1  0] (Indices: [1, 3, 5, 6, 10, 14, 15, 16, 17, 18]), Candidate: [ 3  0  2 -1  2  1  0  0  1  2 -1  1  1  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  0  0  1 -1  1  0 -1  0  1  0  0 -1] (Indices: [1, 3, 5, 6, 11, 13, 14, 17, 18, 19]), Candidate: [ 3  0  2 -1  2  1  0  0  1  1  1  0  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0  0  0  0 -1  1 -1  0  0  1 -1  0  0] (Indices: [1, 3, 5, 7, 8, 9, 10, 11, 13, 17]), Candidate: [ 3  0  2 -1  2  0  2  0  1  1  0  0  2  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 124900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0  0  0 -1  0  1 -1  0  1 -1  0  1 -1] (Indices: [1, 3, 5, 7, 8, 9, 10, 13, 16, 19]), Candidate: [ 3  0  2 -1  2  0  2  0  1  1 -1  1  2  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0  0 -1  1 -1  1 -1  1  0 -1  0  0  0] (Indices: [1, 3, 5, 7, 8, 9, 11, 13, 15, 16]), Candidate: [ 3  0  2 -1  2  0  2  0  1  0  1  0  2  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 125000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0  0 -1  0  1 -1  1 -1  1 -1  1 -1  0] (Indices: [1, 3, 5, 7, 8, 9, 12, 14, 16, 18]), Candidate: [ 3  0  2 -1  2  0  2  0  1  0  0  2  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0 -1  1  0  0  0  0 -1  0  0  0  0  0] (Indices: [1, 3, 5, 7, 8, 10, 11, 12, 13, 14]), Candidate: [ 3  0  2 -1  2  0  2  0  0  2  0  1  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0 -1  1  0 -1  0  0  1 -1  1 -1  1 -1] (Indices: [1, 3, 5, 7, 8, 10, 11, 15, 17, 19]), Candidate: [ 3  0  2 -1  2  0  2  0  0  2  0  0  1  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 125150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0 -1  1 -1  0  1  0 -1  0  0  1  0 -1] (Indices: [1, 3, 5, 7, 8, 10, 13, 14, 18, 19]), Candidate: [ 3  0  2 -1  2  0  2  0  0  2 -1  1  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 125200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0 -1  0  1  0 -1  1 -1  0  0  1  0 -1] (Indices: [1, 3, 5, 7, 8, 11, 12, 14, 18, 19]), Candidate: [ 3  0  2 -1  2  0  2  0  0  1  1  1  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0 -1  0  0  1  0  0 -1  1  0 -1  0  0] (Indices: [1, 3, 5, 7, 8, 12, 13, 14, 16, 17]), Candidate: [ 3  0  2 -1  2  0  2  0  0  1  0  2  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0 -1  0  0  0  0  1 -1  1  0  0  0 -1] (Indices: [1, 3, 5, 7, 8, 14, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  2  0  2  0  0  1  0  1  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  1  0  0 -1  0  0  1  0 -1  0  1 -1] (Indices: [1, 3, 5, 7, 9, 10, 11, 15, 16, 19]), Candidate: [ 3  0  2 -1  2  0  2 -1  2  1  0  0  1  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  1  0 -1  0  1  0 -1  0  1  0 -1  0] (Indices: [1, 3, 5, 7, 9, 10, 13, 14, 17, 18]), Candidate: [ 3  0  2 -1  2  0  2 -1  2  1 -1  1  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 125450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  1 -1  1  0 -1  1 -1  0  1  0 -1  0] (Indices: [1, 3, 5, 7, 9, 11, 12, 14, 17, 18]), Candidate: [ 3  0  2 -1  2  0  2 -1  2  0  1  1  0  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 125500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  1 -1  0  1  0  0  0 -1  0  1 -1  0] (Indices: [1, 3, 5, 7, 9, 12, 13, 14, 15, 18]), Candidate: [ 3  0  2 -1  2  0  2 -1  2  0  0  2  1  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  1 -1  0  0  0  1  0  0 -1  1  0 -1] (Indices: [1, 3, 5, 7, 9, 14, 15, 16, 18, 19]), Candidate: [ 3  0  2 -1  2  0  2 -1  2  0  0  1  1  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  0  1  0 -1  1 -1  1  0 -1  1 -1  0] (Indices: [1, 3, 5, 7, 10, 11, 13, 15, 16, 18]), Candidate: [ 3  0  2 -1  2  0  2 -1  1  2  0  0  2  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  0  1 -1  1 -1  1 -1  1  0  0 -1  0] (Indices: [1, 3, 5, 7, 10, 12, 14, 16, 17, 18]), Candidate: [ 3  0  2 -1  2  0  2 -1  1  2 -1  2  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 125700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  0  0  1  0 -1  1  0  0  0 -1  0  0] (Indices: [1, 3, 5, 7, 11, 12, 14, 15, 16, 17]), Candidate: [ 3  0  2 -1  2  0  2 -1  1  1  1  1  0  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  0  0  0  1  0 -1  0  1  0  0  0 -1] (Indices: [1, 3, 5, 7, 12, 13, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  2  0  2 -1  1  1  0  2  1  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1  0  0  0 -1  0  1  0  0 -1  0  0  0] (Indices: [1, 3, 5, 8, 9, 10, 11, 14, 15, 16]), Candidate: [ 3  0  2 -1  2  0  1  1  1  1  0  0  1  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 125850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1  0  0 -1  1 -1  0  1 -1  0  1  0 -1] (Indices: [1, 3, 5, 8, 9, 10, 12, 15, 18, 19]), Candidate: [ 3  0  2 -1  2  0  1  1  1  1 -1  2  0  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1  0 -1  1  0  0 -1  0  1 -1  1 -1  0] (Indices: [1, 3, 5, 8, 9, 11, 12, 13, 16, 18]), Candidate: [ 3  0  2 -1  2  0  1  1  1  0  1  1  1  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 125950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1  0 -1  1 -1  0  1  0 -1  0  1  0 -1] (Indices: [1, 3, 5, 8, 9, 11, 14, 15, 18, 19]), Candidate: [ 3  0  2 -1  2  0  1  1  1  0  1  0  1  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 126000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1  0 -1  0  0  1  0  0 -1  0  1  0 -1] (Indices: [1, 3, 5, 8, 9, 13, 14, 15, 18, 19]), Candidate: [ 3  0  2 -1  2  0  1  1  1  0  0  1  2  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 126050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1 -1  1  0  0 -1  0  0  0  1  0  0 -1] (Indices: [1, 3, 5, 8, 10, 11, 12, 17, 18, 19]), Candidate: [ 3  0  2 -1  2  0  1  1  0  2  0  1  0  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 126100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1 -1  1 -1  1  0 -1  1 -1  1 -1  1 -1] (Indices: [1, 3, 5, 8, 10, 12, 13, 15, 17, 19]), Candidate: [ 3  0  2 -1  2  0  1  1  0  2 -1  2  1  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 126150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1 -1  0  1  0  0  0 -1  0  1 -1  1 -1] (Indices: [1, 3, 5, 8, 11, 12, 13, 14, 17, 19]), Candidate: [ 3  0  2 -1  2  0  1  1  0  1  1  1  1  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 126200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1 -1  0  0  1  0  0  0  0 -1  0  1 -1] (Indices: [1, 3, 5, 8, 12, 13, 14, 15, 16, 19]), Candidate: [ 3  0  2 -1  2  0  1  1  0  1  0  2  1  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 126250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  1  0  0  0 -1  1 -1  0  0  1  0 -1] (Indices: [1, 3, 5, 9, 10, 11, 12, 14, 18, 19]), Candidate: [ 3  0  2 -1  2  0  1  0  2  1  0  1  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 126300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  1  0 -1  1  0  0 -1  1  0 -1  0  0] (Indices: [1, 3, 5, 9, 10, 12, 13, 14, 16, 17]), Candidate: [ 3  0  2 -1  2  0  1  0  2  1 -1  2  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 126350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  1  0 -1  0  0  1 -1  1  0  0  0 -1] (Indices: [1, 3, 5, 9, 10, 14, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  2  0  1  0  2  1 -1  1  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 126400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  1 -1  1 -1  1 -1  1 -1  1  0  0 -1] (Indices: [1, 3, 5, 9, 11, 13, 15, 17, 18, 19]), Candidate: [ 3  0  2 -1  2  0  1  0  2  0  1  0  2  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 126450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  0  1  0  0  0 -1  1 -1  1 -1  1 -1] (Indices: [1, 3, 5, 10, 11, 12, 13, 15, 17, 19]), Candidate: [ 3  0  2 -1  2  0  1  0  1  2  0  1  1  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 126500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  0  1 -1  1  0  0 -1  1 -1  1  0 -1] (Indices: [1, 3, 5, 10, 12, 13, 14, 16, 18, 19]), Candidate: [ 3  0  2 -1  2  0  1  0  1  2 -1  2  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 126550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  0  0  0  1  0  0  0  0 -1  1  0 -1] (Indices: [1, 3, 5, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 3  0  2 -1  2  0  1  0  1  1  0  2  1  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 126600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0  0  0 -1  1 -1  0  0  1 -1  1 -1  0] (Indices: [1, 3, 6, 7, 8, 9, 10, 12, 16, 18]), Candidate: [ 3  0  2 -1  1  2  1  0  1  1 -1  2  0  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 126650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0  0 -1  1  0 -1  1 -1  0  0  0  1 -1] (Indices: [1, 3, 6, 7, 8, 9, 11, 12, 14, 19]), Candidate: [ 3  0  2 -1  1  2  1  0  1  0  1  1  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 126700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0  0 -1  0  1  0  0 -1  0  0  0  1 -1] (Indices: [1, 3, 6, 7, 8, 9, 12, 13, 14, 19]), Candidate: [ 3  0  2 -1  1  2  1  0  1  0  0  2  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 126750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0  0 -1  0  0  1 -1  0  0  1  0  0 -1] (Indices: [1, 3, 6, 7, 8, 9, 13, 17, 18, 19]), Candidate: [ 3  0  2 -1  1  2  1  0  1  0  0  1  2  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 126800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0 -1  1  0 -1  1 -1  0  0  1 -1  1 -1] (Indices: [1, 3, 6, 7, 8, 10, 11, 13, 17, 19]), Candidate: [ 3  0  2 -1  1  2  1  0  0  2  0  0  2  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 126850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0 -1  1 -1  1 -1  0  1 -1  1  0 -1  0] (Indices: [1, 3, 6, 7, 8, 10, 12, 15, 17, 18]), Candidate: [ 3  0  2 -1  1  2  1  0  0  2 -1  2  0  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 126900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0 -1  0  1  0  0 -1  1 -1  0  0  1 -1] (Indices: [1, 3, 6, 7, 8, 11, 12, 13, 15, 19]), Candidate: [ 3  0  2 -1  1  2  1  0  0  1  1  1  1  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 126950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0 -1  0  1 -1  0  1  0 -1  1  0 -1  0] (Indices: [1, 3, 6, 7, 8, 11, 14, 15, 17, 18]), Candidate: [ 3  0  2 -1  1  2  1  0  0  1  1  0  1  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 127000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0 -1  0  0  0  1  0  0 -1  1  0 -1  0] (Indices: [1, 3, 6, 7, 8, 13, 14, 15, 17, 18]), Candidate: [ 3  0  2 -1  1  2  1  0  0  1  0  1  2  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 127050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  1  0  0 -1  1 -1  0  1 -1  0  1 -1] (Indices: [1, 3, 6, 7, 9, 10, 11, 13, 16, 19]), Candidate: [ 3  0  2 -1  1  2  1 -1  2  1  0  0  2  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 127100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  1  0 -1  1 -1  0  1  0 -1  1 -1  0] (Indices: [1, 3, 6, 7, 9, 10, 12, 15, 16, 18]), Candidate: [ 3  0  2 -1  1  2  1 -1  2  1 -1  2  0  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 127150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  1 -1  1  0  0 -1  1 -1  1 -1  0  0] (Indices: [1, 3, 6, 7, 9, 11, 12, 13, 15, 17]), Candidate: [ 3  0  2 -1  1  2  1 -1  2  0  1  1  1  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 127200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  1 -1  1 -1  0  1  0  0 -1  1 -1  0] (Indices: [1, 3, 6, 7, 9, 11, 14, 15, 16, 18]), Candidate: [ 3  0  2 -1  1  2  1 -1  2  0  1  0  1  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 127250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  1 -1  0  0  1  0  0  0 -1  1 -1  0] (Indices: [1, 3, 6, 7, 9, 13, 14, 15, 16, 18]), Candidate: [ 3  0  2 -1  1  2  1 -1  2  0  0  1  2  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 127300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  0  1  0  0 -1  0  1 -1  0  1  0 -1] (Indices: [1, 3, 6, 7, 10, 11, 12, 15, 18, 19]), Candidate: [ 3  0  2 -1  1  2  1 -1  1  2  0  1  0  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 127350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  0  1 -1  1  0 -1  1  0  0 -1  0  0] (Indices: [1, 3, 6, 7, 10, 12, 13, 15, 16, 17]), Candidate: [ 3  0  2 -1  1  2  1 -1  1  2 -1  2  1  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 127400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  0  0  1  0  0  0 -1  1  0 -1  0  0] (Indices: [1, 3, 6, 7, 11, 12, 13, 14, 16, 17]), Candidate: [ 3  0  2 -1  1  2  1 -1  1  1  1  1  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 127450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  0  0  1 -1  0  1 -1  1  0  0  0 -1] (Indices: [1, 3, 6, 7, 11, 14, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  1  2  1 -1  1  1  1  0  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 127500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1  0  0  0  0 -1  0  0  0  0  1  0 -1] (Indices: [1, 3, 6, 8, 9, 10, 11, 12, 18, 19]), Candidate: [ 3  0  2 -1  1  2  0  1  1  1  0  1  0  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 127550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1  0  0 -1  1  0 -1  0  0  0  1  0 -1] (Indices: [1, 3, 6, 8, 9, 10, 12, 13, 18, 19]), Candidate: [ 3  0  2 -1  1  2  0  1  1  1 -1  2  1  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 127600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1  0  0 -1  0  0  1 -1  0  1  0  0 -1] (Indices: [1, 3, 6, 8, 9, 10, 14, 17, 18, 19]), Candidate: [ 3  0  2 -1  1  2  0  1  1  1 -1  1  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 127650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1  0 -1  1 -1  1  0 -1  0  0  1  0 -1] (Indices: [1, 3, 6, 8, 9, 11, 13, 14, 18, 19]), Candidate: [ 3  0  2 -1  1  2  0  1  1  0  1  0  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 127700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1  0 -1  0  1 -1  1  0 -1  1 -1  1 -1] (Indices: [1, 3, 6, 8, 9, 12, 14, 15, 17, 19]), Candidate: [ 3  0  2 -1  1  2  0  1  1  0  0  2  0  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 127750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1 -1  1  0  0 -1  1  0 -1  0  0  1 -1] (Indices: [1, 3, 6, 8, 10, 11, 12, 14, 15, 19]), Candidate: [ 3  0  2 -1  1  2  0  1  0  2  0  1  0  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 127800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1 -1  1  0 -1  0  0  1 -1  1  0  0 -1] (Indices: [1, 3, 6, 8, 10, 11, 15, 17, 18, 19]), Candidate: [ 3  0  2 -1  1  2  0  1  0  2  0  0  1  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 127850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1 -1  1 -1  0  1 -1  1 -1  1  0  0 -1] (Indices: [1, 3, 6, 8, 10, 13, 15, 17, 18, 19]), Candidate: [ 3  0  2 -1  1  2  0  1  0  2 -1  1  2  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 127900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1 -1  0  1 -1  1  0 -1  1  0 -1  1 -1] (Indices: [1, 3, 6, 8, 11, 13, 14, 16, 17, 19]), Candidate: [ 3  0  2 -1  1  2  0  1  0  1  1  0  2  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 127950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  1  0  0  0  0 -1  1 -1  0  0  1 -1] (Indices: [1, 3, 6, 9, 10, 11, 12, 13, 15, 19]), Candidate: [ 3  0  2 -1  1  2  0  0  2  1  0  1  1  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 128000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  1  0  0 -1  0  1  0 -1  1  0 -1  0] (Indices: [1, 3, 6, 9, 10, 11, 14, 15, 17, 18]), Candidate: [ 3  0  2 -1  1  2  0  0  2  1  0  0  1  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 128050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  1  0 -1  0  1  0  0 -1  1  0 -1  0] (Indices: [1, 3, 6, 9, 10, 13, 14, 15, 17, 18]), Candidate: [ 3  0  2 -1  1  2  0  0  2  1 -1  1  2  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 128100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  1 -1  1  0 -1  0  1  0 -1  1  0 -1] (Indices: [1, 3, 6, 9, 11, 12, 15, 16, 18, 19]), Candidate: [ 3  0  2 -1  1  2  0  0  2  0  1  1  0  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 128150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  1 -1  0  0  1 -1  1  0  0  0  0 -1] (Indices: [1, 3, 6, 9, 13, 15, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  1  2  0  0  2  0  0  1  2  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 128200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  0  1  0 -1  1 -1  1 -1  1  0  0 -1] (Indices: [1, 3, 6, 10, 11, 13, 15, 17, 18, 19]), Candidate: [ 3  0  2 -1  1  2  0  0  1  2  0  0  2  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 128250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  0  0  1  0  0 -1  0  1  0  0  0 -1] (Indices: [1, 3, 6, 11, 12, 13, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  1  2  0  0  1  1  1  1  1  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 128300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0  0  0  0 -1  1 -1  1 -1  0  1 -1  0] (Indices: [1, 3, 7, 8, 9, 10, 11, 13, 15, 18]), Candidate: [ 3  0  2 -1  1  1  2  0  1  1  0  0  2  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 128350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0  0  0 -1  1 -1  1 -1  0  1  0 -1  0] (Indices: [1, 3, 7, 8, 9, 10, 12, 14, 17, 18]), Candidate: [ 3  0  2 -1  1  1  2  0  1  1 -1  2  0  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 128400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0  0 -1  1  0  0  0 -1  0  1 -1  0  0] (Indices: [1, 3, 7, 8, 9, 11, 12, 13, 14, 17]), Candidate: [ 3  0  2 -1  1  1  2  0  1  0  1  1  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 128450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0  0 -1  1 -1  1 -1  0  1  0 -1  1 -1] (Indices: [1, 3, 7, 8, 9, 11, 13, 16, 17, 19]), Candidate: [ 3  0  2 -1  1  1  2  0  1  0  1  0  2  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 128500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0  0 -1  0  1 -1  0  1  0 -1  1  0 -1] (Indices: [1, 3, 7, 8, 9, 12, 15, 16, 18, 19]), Candidate: [ 3  0  2 -1  1  1  2  0  1  0  0  2  0  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 128550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0 -1  1  0  0 -1  0  1  0 -1  1 -1  0] (Indices: [1, 3, 7, 8, 10, 11, 12, 15, 16, 18]), Candidate: [ 3  0  2 -1  1  1  2  0  0  2  0  1  0  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 128600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0 -1  1 -1  1  0  0 -1  1 -1  0  1 -1] (Indices: [1, 3, 7, 8, 10, 12, 13, 14, 16, 19]), Candidate: [ 3  0  2 -1  1  1  2  0  0  2 -1  2  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 128650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0 -1  0  1  0  0  0  0  0 -1  0  0  0] (Indices: [1, 3, 7, 8, 11, 12, 13, 14, 15, 16]), Candidate: [ 3  0  2 -1  1  1  2  0  0  1  1  1  1  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 128700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0 -1  0  1 -1  0  1  0  0  0  0 -1  0] (Indices: [1, 3, 7, 8, 11, 14, 15, 16, 17, 18]), Candidate: [ 3  0  2 -1  1  1  2  0  0  1  1  0  1  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 128750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  1  0  0  0 -1  1  0 -1  1 -1  0  0] (Indices: [1, 3, 7, 9, 10, 11, 12, 14, 15, 17]), Candidate: [ 3  0  2 -1  1  1  2 -1  2  1  0  1  0  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 128800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  1  0  0 -1  0  0  1  0  0 -1  1 -1] (Indices: [1, 3, 7, 9, 10, 11, 15, 16, 17, 19]), Candidate: [ 3  0  2 -1  1  1  2 -1  2  1  0  0  1  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 128850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  1  0 -1  0  1 -1  1  0  0 -1  1 -1] (Indices: [1, 3, 7, 9, 10, 13, 15, 16, 17, 19]), Candidate: [ 3  0  2 -1  1  1  2 -1  2  1 -1  1  2  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 128900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  1 -1  1 -1  1  0  0 -1  0  1  0 -1] (Indices: [1, 3, 7, 9, 11, 13, 14, 15, 18, 19]), Candidate: [ 3  0  2 -1  1  1  2 -1  2  0  1  0  2  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 128950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  0  1  0  0  0  0 -1  1 -1  0  1 -1] (Indices: [1, 3, 7, 10, 11, 12, 13, 14, 16, 19]), Candidate: [ 3  0  2 -1  1  1  2 -1  1  2  0  1  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 129000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  0  1 -1  1  0  0  0  0  0 -1  0  0] (Indices: [1, 3, 7, 10, 12, 13, 14, 15, 16, 17]), Candidate: [ 3  0  2 -1  1  1  2 -1  1  2 -1  2  1  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 129050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  0  0  1 -1  1  0  0  0  0 -1  1 -1] (Indices: [1, 3, 7, 11, 13, 14, 15, 16, 17, 19]), Candidate: [ 3  0  2 -1  1  1  2 -1  1  1  1  0  2  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 129100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1  0  0  0 -1  1  0  0 -1  1 -1  0  0] (Indices: [1, 3, 8, 9, 10, 11, 13, 14, 15, 17]), Candidate: [ 3  0  2 -1  1  1  1  1  1  1  0  0  2  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 129150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1  0  0 -1  1  0 -1  0  1  0  0 -1  0] (Indices: [1, 3, 8, 9, 10, 12, 13, 16, 17, 18]), Candidate: [ 3  0  2 -1  1  1  1  1  1  1 -1  2  1  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 129200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1  0 -1  1  0  0 -1  1  0  0 -1  0  0] (Indices: [1, 3, 8, 9, 11, 12, 13, 15, 16, 17]), Candidate: [ 3  0  2 -1  1  1  1  1  1  0  1  1  1  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 129250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1  0 -1  0  1  0  0  0 -1  1 -1  1 -1] (Indices: [1, 3, 8, 9, 12, 13, 14, 15, 17, 19]), Candidate: [ 3  0  2 -1  1  1  1  1  1  0  0  2  1  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 129300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1 -1  1  0  0 -1  1 -1  1  0  0 -1  0] (Indices: [1, 3, 8, 10, 11, 12, 14, 16, 17, 18]), Candidate: [ 3  0  2 -1  1  1  1  1  0  2  0  1  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 129350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1 -1  1 -1  1 -1  0  1  0  0  0  0 -1] (Indices: [1, 3, 8, 10, 12, 15, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  1  1  1  1  0  2 -1  2  0  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 129400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  1  0  0  0  0  0 -1  1 -1  0  1 -1] (Indices: [1, 3, 9, 10, 11, 12, 13, 14, 16, 19]), Candidate: [ 3  0  2 -1  1  1  1  0  2  1  0  1  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 129450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  1  0 -1  1  0  0  0  0  0 -1  0  0] (Indices: [1, 3, 9, 10, 12, 13, 14, 15, 16, 17]), Candidate: [ 3  0  2 -1  1  1  1  0  2  1 -1  2  1  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 129500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  1 -1  1 -1  1  0  0  0  0 -1  1 -1] (Indices: [1, 3, 9, 11, 13, 14, 15, 16, 17, 19]), Candidate: [ 3  0  2 -1  1  1  1  0  2  0  1  0  2  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 129550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  0  0  1  0  0  0  0  0  0  0 -1  0] (Indices: [1, 3, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 3  0  2 -1  1  1  1  0  1  1  1  1  1  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 129600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0  0 -1  1  0 -1  0  0  0  0  1 -1  0] (Indices: [1, 4, 5, 6, 7, 8, 9, 11, 12, 18]), Candidate: [3 0 1 1 1 1 1 0 1 0 1 1 0 1 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 129650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0  0 -1  0  0  1 -1  1 -1  1 -1  0  0] (Indices: [1, 4, 5, 6, 7, 8, 9, 13, 15, 17]), Candidate: [3 0 1 1 1 1 1 0 1 0 0 1 2 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 129700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0 -1  1  0 -1  0  0  1 -1  0  0  1 -1] (Indices: [1, 4, 5, 6, 7, 8, 10, 11, 15, 19]), Candidate: [3 0 1 1 1 1 1 0 0 2 0 0 1 1 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 129750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0 -1  1 -1  0  0  1 -1  0  1  0 -1  0] (Indices: [1, 4, 5, 6, 7, 8, 10, 14, 17, 18]), Candidate: [ 3  0  1  1  1  1  1  0  0  2 -1  1  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 129800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0 -1  0  1 -1  0  1  0 -1  1 -1  0  0] (Indices: [1, 4, 5, 6, 7, 8, 11, 14, 15, 17]), Candidate: [3 0 1 1 1 1 1 0 0 1 1 0 1 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 129850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0 -1  0  0  1 -1  0  0  1  0  0 -1  0] (Indices: [1, 4, 5, 6, 7, 8, 12, 16, 17, 18]), Candidate: [3 0 1 1 1 1 1 0 0 1 0 2 0 1 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 129900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  1  0  0 -1  1 -1  0  0  0  1 -1  0] (Indices: [1, 4, 5, 6, 7, 9, 10, 11, 13, 18]), Candidate: [ 3  0  1  1  1  1  1 -1  2  1  0  0  2  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 129950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  1  0 -1  0  1 -1  0  0  1  0 -1  0] (Indices: [1, 4, 5, 6, 7, 9, 10, 13, 17, 18]), Candidate: [ 3  0  1  1  1  1  1 -1  2  1 -1  1  2  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 130000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  1 -1  1 -1  1 -1  1 -1  1 -1  0  0] (Indices: [1, 4, 5, 6, 7, 9, 11, 13, 15, 17]), Candidate: [ 3  0  1  1  1  1  1 -1  2  0  1  0  2  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 130050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  1 -1  0  1 -1  1 -1  1 -1  0  1 -1] (Indices: [1, 4, 5, 6, 7, 9, 12, 14, 16, 19]), Candidate: [ 3  0  1  1  1  1  1 -1  2  0  0  2  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 130100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  0  1  0  0  0 -1  1 -1  0  0  0  0] (Indices: [1, 4, 5, 6, 7, 10, 11, 12, 13, 15]), Candidate: [ 3  0  1  1  1  1  1 -1  1  2  0  1  1  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 130150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  0  1  0 -1  0  0  1 -1  0  1  0 -1] (Indices: [1, 4, 5, 6, 7, 10, 11, 15, 18, 19]), Candidate: [ 3  0  1  1  1  1  1 -1  1  2  0  0  1  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 130200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  0  1 -1  0  1 -1  1  0  0 -1  0  0] (Indices: [1, 4, 5, 6, 7, 10, 13, 15, 16, 17]), Candidate: [ 3  0  1  1  1  1  1 -1  1  2 -1  1  2  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 130250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  0  0  1  0 -1  0  1  0  0 -1  0  0] (Indices: [1, 4, 5, 6, 7, 11, 12, 15, 16, 17]), Candidate: [ 3  0  1  1  1  1  1 -1  1  1  1  1  0  1  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 130300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  0  0  0  1  0  0 -1  1 -1  1 -1  0] (Indices: [1, 4, 5, 6, 7, 12, 13, 14, 16, 18]), Candidate: [ 3  0  1  1  1  1  1 -1  1  1  0  2  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 130350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  0  0  0  0  0  0  1  0  0  0  0 -1] (Indices: [1, 4, 5, 6, 7, 15, 16, 17, 18, 19]), Candidate: [ 3  0  1  1  1  1  1 -1  1  1  0  1  1  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 130400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1  0  0 -1  0  1  0  0 -1  0  0  0  0] (Indices: [1, 4, 5, 6, 8, 9, 10, 13, 14, 15]), Candidate: [ 3  0  1  1  1  1  0  1  1  1 -1  1  2  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 130450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1  0 -1  1  0 -1  0  0  1  0 -1  0  0] (Indices: [1, 4, 5, 6, 8, 9, 11, 12, 16, 17]), Candidate: [3 0 1 1 1 1 0 1 1 0 1 1 0 1 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 130500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1  0 -1  0  1  0 -1  0  1  0 -1  0  0] (Indices: [1, 4, 5, 6, 8, 9, 12, 13, 16, 17]), Candidate: [3 0 1 1 1 1 0 1 1 0 0 2 1 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 130550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1  0 -1  0  0  0  1  0 -1  1 -1  1 -1] (Indices: [1, 4, 5, 6, 8, 9, 14, 15, 17, 19]), Candidate: [3 0 1 1 1 1 0 1 1 0 0 1 1 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 130600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1 -1  1  0 -1  0  1  0 -1  0  0  1 -1] (Indices: [1, 4, 5, 6, 8, 10, 11, 14, 15, 19]), Candidate: [3 0 1 1 1 1 0 1 0 2 0 0 1 2 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 130650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1 -1  1 -1  1 -1  0  0  1 -1  1  0 -1] (Indices: [1, 4, 5, 6, 8, 10, 12, 16, 18, 19]), Candidate: [ 3  0  1  1  1  1  0  1  0  2 -1  2  0  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 130700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1 -1  0  1  0  0 -1  0  0  1 -1  1 -1] (Indices: [1, 4, 5, 6, 8, 11, 12, 13, 17, 19]), Candidate: [3 0 1 1 1 1 0 1 0 1 1 1 1 0 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 130750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1 -1  0  1 -1  0  1 -1  1 -1  1  0 -1] (Indices: [1, 4, 5, 6, 8, 11, 14, 16, 18, 19]), Candidate: [ 3  0  1  1  1  1  0  1  0  1  1  0  1  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 130800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1 -1  0  0  0  1  0 -1  1 -1  1  0 -1] (Indices: [1, 4, 5, 6, 8, 13, 14, 16, 18, 19]), Candidate: [ 3  0  1  1  1  1  0  1  0  1  0  1  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 130850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  1  0  0 -1  0  1  0 -1  1 -1  0  0] (Indices: [1, 4, 5, 6, 9, 10, 11, 14, 15, 17]), Candidate: [3 0 1 1 1 1 0 0 2 1 0 0 1 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 130900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  1  0 -1  1 -1  0  0  1  0  0 -1  0] (Indices: [1, 4, 5, 6, 9, 10, 12, 16, 17, 18]), Candidate: [ 3  0  1  1  1  1  0  0  2  1 -1  2  0  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 130950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  1 -1  1  0  0 -1  0  1 -1  0  1 -1] (Indices: [1, 4, 5, 6, 9, 11, 12, 13, 16, 19]), Candidate: [3 0 1 1 1 1 0 0 2 0 1 1 1 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 131000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  1 -1  1 -1  0  1 -1  1  0  0 -1  0] (Indices: [1, 4, 5, 6, 9, 11, 14, 16, 17, 18]), Candidate: [ 3  0  1  1  1  1  0  0  2  0  1  0  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 131050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  1 -1  0  0  1  0 -1  1  0  0 -1  0] (Indices: [1, 4, 5, 6, 9, 13, 14, 16, 17, 18]), Candidate: [ 3  0  1  1  1  1  0  0  2  0  0  1  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 131100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  0  1  0 -1  1  0  0  0 -1  0  0  0] (Indices: [1, 4, 5, 6, 10, 11, 13, 14, 15, 16]), Candidate: [3 0 1 1 1 1 0 0 1 2 0 0 2 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 131150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  0  1 -1  1  0 -1  1 -1  0  1  0 -1] (Indices: [1, 4, 5, 6, 10, 12, 13, 15, 18, 19]), Candidate: [ 3  0  1  1  1  1  0  0  1  2 -1  2  1  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 131200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  0  0  1  0  0  0 -1  0  0  1  0 -1] (Indices: [1, 4, 5, 6, 11, 12, 13, 14, 18, 19]), Candidate: [ 3  0  1  1  1  1  0  0  1  1  1  1  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 131250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  0  0  0  1  0  0  0 -1  1  0 -1  0] (Indices: [1, 4, 5, 6, 12, 13, 14, 15, 17, 18]), Candidate: [3 0 1 1 1 1 0 0 1 1 0 2 1 1 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 131300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0  0  0  0 -1  0  0  0  0  1  0 -1  0] (Indices: [1, 4, 5, 7, 8, 9, 10, 11, 17, 18]), Candidate: [3 0 1 1 1 0 2 0 1 1 0 0 1 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 131350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0  0  0 -1  0  0  0  1  0 -1  1 -1  0] (Indices: [1, 4, 5, 7, 8, 9, 10, 15, 16, 18]), Candidate: [ 3  0  1  1  1  0  2  0  1  1 -1  1  1  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 131400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0  0 -1  1 -1  0  1 -1  1 -1  1 -1  0] (Indices: [1, 4, 5, 7, 8, 9, 11, 14, 16, 18]), Candidate: [ 3  0  1  1  1  0  2  0  1  0  1  0  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 131450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0  0 -1  0  0  1  0  0  0 -1  0  0  0] (Indices: [1, 4, 5, 7, 8, 9, 13, 14, 15, 16]), Candidate: [3 0 1 1 1 0 2 0 1 0 0 1 2 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 131500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0 -1  1  0  0 -1  0  0  1  0 -1  0  0] (Indices: [1, 4, 5, 7, 8, 10, 11, 12, 16, 17]), Candidate: [3 0 1 1 1 0 2 0 0 2 0 1 0 1 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 131550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0 -1  1 -1  1  0 -1  0  1  0 -1  0  0] (Indices: [1, 4, 5, 7, 8, 10, 12, 13, 16, 17]), Candidate: [ 3  0  1  1  1  0  2  0  0  2 -1  2  1  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 131600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0 -1  1 -1  0  0  1  0 -1  1 -1  1 -1] (Indices: [1, 4, 5, 7, 8, 10, 14, 15, 17, 19]), Candidate: [ 3  0  1  1  1  0  2  0  0  2 -1  1  1  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 131650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0 -1  0  1 -1  1  0 -1  1  0 -1  0  0] (Indices: [1, 4, 5, 7, 8, 11, 13, 14, 16, 17]), Candidate: [ 3  0  1  1  1  0  2  0  0  1  1  0  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 131700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0 -1  0  0  1  0 -1  0  0  1  0  0 -1] (Indices: [1, 4, 5, 7, 8, 12, 13, 17, 18, 19]), Candidate: [3 0 1 1 1 0 2 0 0 1 0 2 1 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 131750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  1  0  0  0 -1  0  1 -1  0  1 -1  0] (Indices: [1, 4, 5, 7, 9, 10, 11, 12, 15, 18]), Candidate: [ 3  0  1  1  1  0  2 -1  2  1  0  1  0  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 131800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  1  0 -1  1  0 -1  1 -1  0  1 -1  0] (Indices: [1, 4, 5, 7, 9, 10, 12, 13, 15, 18]), Candidate: [ 3  0  1  1  1  0  2 -1  2  1 -1  2  1  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 131850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  1  0 -1  0  0  1  0  0 -1  0  1 -1] (Indices: [1, 4, 5, 7, 9, 10, 14, 15, 16, 19]), Candidate: [ 3  0  1  1  1  0  2 -1  2  1 -1  1  1  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 131900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  1 -1  1 -1  1  0  0 -1  0  1 -1  0] (Indices: [1, 4, 5, 7, 9, 11, 13, 14, 15, 18]), Candidate: [ 3  0  1  1  1  0  2 -1  2  0  1  0  2  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 131950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  1 -1  0  1  0 -1  0  1  0 -1  1 -1] (Indices: [1, 4, 5, 7, 9, 12, 13, 16, 17, 19]), Candidate: [ 3  0  1  1  1  0  2 -1  2  0  0  2  1  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 132000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  0  1  0  0  0 -1  0  1 -1  0  1 -1] (Indices: [1, 4, 5, 7, 10, 11, 12, 13, 16, 19]), Candidate: [ 3  0  1  1  1  0  2 -1  1  2  0  1  1  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 132050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  0  1  0 -1  0  1 -1  1  0  0 -1  0] (Indices: [1, 4, 5, 7, 10, 11, 14, 16, 17, 18]), Candidate: [ 3  0  1  1  1  0  2 -1  1  2  0  0  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 132100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  0  1 -1  0  1  0 -1  1  0  0 -1  0] (Indices: [1, 4, 5, 7, 10, 13, 14, 16, 17, 18]), Candidate: [ 3  0  1  1  1  0  2 -1  1  2 -1  1  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 132150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  0  0  1 -1  1  0  0  0  0 -1  0  0] (Indices: [1, 4, 5, 7, 11, 13, 14, 15, 16, 17]), Candidate: [ 3  0  1  1  1  0  2 -1  1  1  1  0  2  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 132200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1  0  0  0  0  0 -1  1 -1  0  0  0  0] (Indices: [1, 4, 5, 8, 9, 10, 11, 12, 13, 15]), Candidate: [3 0 1 1 1 0 1 1 1 1 0 1 1 0 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 132250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1  0  0  0 -1  0  0  1 -1  0  1  0 -1] (Indices: [1, 4, 5, 8, 9, 10, 11, 15, 18, 19]), Candidate: [3 0 1 1 1 0 1 1 1 1 0 0 1 1 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 132300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1  0  0 -1  0  1 -1  1  0  0 -1  0  0] (Indices: [1, 4, 5, 8, 9, 10, 13, 15, 16, 17]), Candidate: [ 3  0  1  1  1  0  1  1  1  1 -1  1  2  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 132350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1  0 -1  1  0 -1  0  1  0  0 -1  0  0] (Indices: [1, 4, 5, 8, 9, 11, 12, 15, 16, 17]), Candidate: [3 0 1 1 1 0 1 1 1 0 1 1 0 1 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 132400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1  0 -1  0  1  0  0 -1  1 -1  1 -1  0] (Indices: [1, 4, 5, 8, 9, 12, 13, 14, 16, 18]), Candidate: [ 3  0  1  1  1  0  1  1  1  0  0  2  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 132450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1  0 -1  0  0  0  0  1  0  0  0  0 -1] (Indices: [1, 4, 5, 8, 9, 15, 16, 17, 18, 19]), Candidate: [3 0 1 1 1 0 1 1 1 0 0 1 1 1 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 132500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1 -1  1  0 -1  1 -1  1 -1  1 -1  1 -1] (Indices: [1, 4, 5, 8, 10, 11, 13, 15, 17, 19]), Candidate: [3 0 1 1 1 0 1 1 0 2 0 0 2 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 132550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1 -1  1 -1  1 -1  1 -1  0  1  0  0 -1] (Indices: [1, 4, 5, 8, 10, 12, 14, 17, 18, 19]), Candidate: [ 3  0  1  1  1  0  1  1  0  2 -1  2  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 132600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1 -1  0  1  0 -1  1  0 -1  1  0 -1  0] (Indices: [1, 4, 5, 8, 11, 12, 14, 15, 17, 18]), Candidate: [3 0 1 1 1 0 1 1 0 1 1 1 0 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 132650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1 -1  0  0  1 -1  1  0  0 -1  1  0 -1] (Indices: [1, 4, 5, 8, 12, 14, 15, 16, 18, 19]), Candidate: [3 0 1 1 1 0 1 1 0 1 0 2 0 2 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 132700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  1  0  0 -1  1  0 -1  1  0 -1  0  0] (Indices: [1, 4, 5, 9, 10, 11, 13, 14, 16, 17]), Candidate: [ 3  0  1  1  1  0  1  0  2  1  0  0  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 132750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  1  0 -1  1  0 -1  0  0  1  0  0 -1] (Indices: [1, 4, 5, 9, 10, 12, 13, 17, 18, 19]), Candidate: [ 3  0  1  1  1  0  1  0  2  1 -1  2  1  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 132800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  1 -1  1  0  0 -1  1 -1  1  0 -1  0] (Indices: [1, 4, 5, 9, 11, 12, 13, 15, 17, 18]), Candidate: [3 0 1 1 1 0 1 0 2 0 1 1 1 0 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 132850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  1 -1  0  1  0  0 -1  1  0 -1  1 -1] (Indices: [1, 4, 5, 9, 12, 13, 14, 16, 17, 19]), Candidate: [ 3  0  1  1  1  0  1  0  2  0  0  2  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 132900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  0  1  0  0 -1  1 -1  0  1  0  0 -1] (Indices: [1, 4, 5, 10, 11, 12, 14, 17, 18, 19]), Candidate: [ 3  0  1  1  1  0  1  0  1  2  0  1  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 132950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  0  1 -1  0  1  0  0  0 -1  1  0 -1] (Indices: [1, 4, 5, 10, 13, 14, 15, 16, 18, 19]), Candidate: [ 3  0  1  1  1  0  1  0  1  2 -1  1  2  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 133000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0  0  0  0 -1  1 -1  0  1 -1  0  0  0] (Indices: [1, 4, 6, 7, 8, 9, 10, 11, 13, 16]), Candidate: [3 0 1 1 0 2 1 0 1 1 0 0 2 0 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 133050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0  0  0 -1  0  1 -1  0  1 -1  1 -1  0] (Indices: [1, 4, 6, 7, 8, 9, 10, 13, 16, 18]), Candidate: [ 3  0  1  1  0  2  1  0  1  1 -1  1  2  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 133100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0  0 -1  1 -1  1  0 -1  0  0  0  1 -1] (Indices: [1, 4, 6, 7, 8, 9, 11, 13, 14, 19]), Candidate: [ 3  0  1  1  0  2  1  0  1  0  1  0  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 133150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0  0 -1  0  1 -1  1 -1  1  0 -1  0  0] (Indices: [1, 4, 6, 7, 8, 9, 12, 14, 16, 17]), Candidate: [ 3  0  1  1  0  2  1  0  1  0  0  2  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 133200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0  0 -1  0  0  0  0  0  1  0  0  0 -1] (Indices: [1, 4, 6, 7, 8, 9, 16, 17, 18, 19]), Candidate: [3 0 1 1 0 2 1 0 1 0 0 1 1 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 133250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0 -1  1  0 -1  0  0  1 -1  1  0 -1  0] (Indices: [1, 4, 6, 7, 8, 10, 11, 15, 17, 18]), Candidate: [3 0 1 1 0 2 1 0 0 2 0 0 1 1 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 133300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0 -1  1 -1  0  1  0 -1  0  1 -1  1 -1] (Indices: [1, 4, 6, 7, 8, 10, 13, 14, 17, 19]), Candidate: [ 3  0  1  1  0  2  1  0  0  2 -1  1  2  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 133350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0 -1  0  1  0 -1  1 -1  0  1 -1  1 -1] (Indices: [1, 4, 6, 7, 8, 11, 12, 14, 17, 19]), Candidate: [ 3  0  1  1  0  2  1  0  0  1  1  1  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 133400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0 -1  0  0  1  0  0  0 -1  0  0  1 -1] (Indices: [1, 4, 6, 7, 8, 12, 13, 14, 15, 19]), Candidate: [3 0 1 1 0 2 1 0 0 1 0 2 1 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 133450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0 -1  0  0  0  0  1  0 -1  1  0  0 -1] (Indices: [1, 4, 6, 7, 8, 14, 15, 17, 18, 19]), Candidate: [3 0 1 1 0 2 1 0 0 1 0 1 1 2 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 133500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  1  0  0 -1  0  0  1  0 -1  1 -1  0] (Indices: [1, 4, 6, 7, 9, 10, 11, 15, 16, 18]), Candidate: [ 3  0  1  1  0  2  1 -1  2  1  0  0  1  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 133550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  1  0 -1  0  1  0 -1  1 -1  0  1 -1] (Indices: [1, 4, 6, 7, 9, 10, 13, 14, 16, 19]), Candidate: [ 3  0  1  1  0  2  1 -1  2  1 -1  1  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 133600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  1 -1  1  0 -1  1 -1  1 -1  0  1 -1] (Indices: [1, 4, 6, 7, 9, 11, 12, 14, 16, 19]), Candidate: [ 3  0  1  1  0  2  1 -1  2  0  1  1  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 133650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  1 -1  0  1  0  0  0 -1  1 -1  0  0] (Indices: [1, 4, 6, 7, 9, 12, 13, 14, 15, 17]), Candidate: [ 3  0  1  1  0  2  1 -1  2  0  0  2  1  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 133700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  1 -1  0  0  0  1  0  0  0 -1  1 -1] (Indices: [1, 4, 6, 7, 9, 14, 15, 16, 17, 19]), Candidate: [ 3  0  1  1  0  2  1 -1  2  0  0  1  1  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 133750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  0  1  0 -1  1 -1  1  0  0 -1  0  0] (Indices: [1, 4, 6, 7, 10, 11, 13, 15, 16, 17]), Candidate: [ 3  0  1  1  0  2  1 -1  1  2  0  0  2  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 133800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  0  1 -1  1 -1  1  0 -1  0  1  0 -1] (Indices: [1, 4, 6, 7, 10, 12, 14, 15, 18, 19]), Candidate: [ 3  0  1  1  0  2  1 -1  1  2 -1  2  0  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 133850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  0  0  1  0  0 -1  0  0  1  0  0 -1] (Indices: [1, 4, 6, 7, 11, 12, 13, 17, 18, 19]), Candidate: [ 3  0  1  1  0  2  1 -1  1  1  1  1  1  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 133900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  0  0  0  1  0 -1  1 -1  1  0  0 -1] (Indices: [1, 4, 6, 7, 12, 13, 15, 17, 18, 19]), Candidate: [ 3  0  1  1  0  2  1 -1  1  1  0  2  1  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 133950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1  0  0  0 -1  1 -1  0  0  0  1  0 -1] (Indices: [1, 4, 6, 8, 9, 10, 11, 13, 18, 19]), Candidate: [3 0 1 1 0 2 0 1 1 1 0 0 2 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 134000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1  0  0 -1  1 -1  0  1 -1  1 -1  1 -1] (Indices: [1, 4, 6, 8, 9, 10, 12, 15, 17, 19]), Candidate: [ 3  0  1  1  0  2  0  1  1  1 -1  2  0  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 134050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1  0 -1  1  0  0 -1  0  1  0 -1  0  0] (Indices: [1, 4, 6, 8, 9, 11, 12, 13, 16, 17]), Candidate: [3 0 1 1 0 2 0 1 1 0 1 1 1 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 134100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1  0 -1  1 -1  0  1  0 -1  1 -1  1 -1] (Indices: [1, 4, 6, 8, 9, 11, 14, 15, 17, 19]), Candidate: [3 0 1 1 0 2 0 1 1 0 1 0 1 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 134150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1  0 -1  0  0  1  0  0 -1  1 -1  1 -1] (Indices: [1, 4, 6, 8, 9, 13, 14, 15, 17, 19]), Candidate: [3 0 1 1 0 2 0 1 1 0 0 1 2 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 134200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1 -1  1  0  0 -1  0  0  1 -1  1  0 -1] (Indices: [1, 4, 6, 8, 10, 11, 12, 16, 18, 19]), Candidate: [3 0 1 1 0 2 0 1 0 2 0 1 0 1 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 134250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1 -1  1 -1  1  0 -1  1 -1  1  0 -1  0] (Indices: [1, 4, 6, 8, 10, 12, 13, 15, 17, 18]), Candidate: [ 3  0  1  1  0  2  0  1  0  2 -1  2  1  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 134300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1 -1  0  1  0  0  0 -1  0  1  0 -1  0] (Indices: [1, 4, 6, 8, 11, 12, 13, 14, 17, 18]), Candidate: [ 3  0  1  1  0  2  0  1  0  1  1  1  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 134350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1 -1  0  0  1  0  0  0  0 -1  1 -1  0] (Indices: [1, 4, 6, 8, 12, 13, 14, 15, 16, 18]), Candidate: [3 0 1 1 0 2 0 1 0 1 0 2 1 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 134400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  1  0  0  0 -1  1 -1  0  1 -1  1 -1] (Indices: [1, 4, 6, 9, 10, 11, 12, 14, 17, 19]), Candidate: [ 3  0  1  1  0  2  0  0  2  1  0  1  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 134450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  1  0 -1  1  0  0  0 -1  0  0  1 -1] (Indices: [1, 4, 6, 9, 10, 12, 13, 14, 15, 19]), Candidate: [ 3  0  1  1  0  2  0  0  2  1 -1  2  1  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 134500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  1  0 -1  0  0  1  0 -1  1  0  0 -1] (Indices: [1, 4, 6, 9, 10, 14, 15, 17, 18, 19]), Candidate: [ 3  0  1  1  0  2  0  0  2  1 -1  1  1  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 134550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  1 -1  1 -1  1 -1  1  0 -1  1  0 -1] (Indices: [1, 4, 6, 9, 11, 13, 15, 16, 18, 19]), Candidate: [3 0 1 1 0 2 0 0 2 0 1 0 2 0 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 134600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  0  1  0  0  0 -1  1 -1  1  0 -1  0] (Indices: [1, 4, 6, 10, 11, 12, 13, 15, 17, 18]), Candidate: [3 0 1 1 0 2 0 0 1 2 0 1 1 0 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 134650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  0  1 -1  1  0  0 -1  1  0 -1  1 -1] (Indices: [1, 4, 6, 10, 12, 13, 14, 16, 17, 19]), Candidate: [ 3  0  1  1  0  2  0  0  1  2 -1  2  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 134700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  0  0  0  1  0  0  0  0  0 -1  1 -1] (Indices: [1, 4, 6, 12, 13, 14, 15, 16, 17, 19]), Candidate: [3 0 1 1 0 2 0 0 1 1 0 2 1 1 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 134750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0  0  0  0 -1  0  1 -1  0  1  0 -1  0] (Indices: [1, 4, 7, 8, 9, 10, 11, 14, 17, 18]), Candidate: [ 3  0  1  1  0  1  2  0  1  1  0  0  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 134800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0  0  0 -1  0  1  0  0 -1  0  1 -1  0] (Indices: [1, 4, 7, 8, 9, 10, 13, 14, 15, 18]), Candidate: [ 3  0  1  1  0  1  2  0  1  1 -1  1  2  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 134850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0  0 -1  1  0 -1  1  0 -1  0  1 -1  0] (Indices: [1, 4, 7, 8, 9, 11, 12, 14, 15, 18]), Candidate: [3 0 1 1 0 1 2 0 1 0 1 1 0 2 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 134900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0  0 -1  1 -1  0  0  1  0 -1  1  0 -1] (Indices: [1, 4, 7, 8, 9, 11, 15, 16, 18, 19]), Candidate: [3 0 1 1 0 1 2 0 1 0 1 0 1 1 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 134950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0  0 -1  0  0  1 -1  1  0 -1  1  0 -1] (Indices: [1, 4, 7, 8, 9, 13, 15, 16, 18, 19]), Candidate: [3 0 1 1 0 1 2 0 1 0 0 1 2 0 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 135000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0 -1  1  0 -1  1  0 -1  1 -1  0  1 -1] (Indices: [1, 4, 7, 8, 10, 11, 13, 14, 16, 19]), Candidate: [ 3  0  1  1  0  1  2  0  0  2  0  0  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 135050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0 -1  1 -1  1 -1  1  0  0 -1  1 -1  0] (Indices: [1, 4, 7, 8, 10, 12, 14, 15, 16, 18]), Candidate: [ 3  0  1  1  0  1  2  0  0  2 -1  2  0  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 135100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0 -1  0  1  0  0 -1  1 -1  0  1  0 -1] (Indices: [1, 4, 7, 8, 11, 12, 13, 15, 18, 19]), Candidate: [3 0 1 1 0 1 2 0 0 1 1 1 1 0 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 135150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0 -1  0  0  1  0  0 -1  0  1  0  0 -1] (Indices: [1, 4, 7, 8, 12, 13, 14, 17, 18, 19]), Candidate: [ 3  0  1  1  0  1  2  0  0  1  0  2  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 135200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  1  0  0  0 -1  0  0  1  0  0 -1  0] (Indices: [1, 4, 7, 9, 10, 11, 12, 16, 17, 18]), Candidate: [ 3  0  1  1  0  1  2 -1  2  1  0  1  0  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 135250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  1  0 -1  1  0 -1  1  0 -1  1 -1  0] (Indices: [1, 4, 7, 9, 10, 12, 13, 15, 16, 18]), Candidate: [ 3  0  1  1  0  1  2 -1  2  1 -1  2  1  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 135300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  1 -1  1  0  0  0 -1  1 -1  1 -1  0] (Indices: [1, 4, 7, 9, 11, 12, 13, 14, 16, 18]), Candidate: [ 3  0  1  1  0  1  2 -1  2  0  1  1  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 135350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  1 -1  1 -1  0  0  1  0  0  0  0 -1] (Indices: [1, 4, 7, 9, 11, 15, 16, 17, 18, 19]), Candidate: [ 3  0  1  1  0  1  2 -1  2  0  1  0  1  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 135400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  0  1  0  0 -1  1  0  0 -1  1 -1  0] (Indices: [1, 4, 7, 10, 11, 12, 14, 15, 16, 18]), Candidate: [ 3  0  1  1  0  1  2 -1  1  2  0  1  0  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 135450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  0  1 -1  1 -1  1  0  0  0  0 -1  0] (Indices: [1, 4, 7, 10, 12, 14, 15, 16, 17, 18]), Candidate: [ 3  0  1  1  0  1  2 -1  1  2 -1  2  0  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 135500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1  0  0  0  0  0  0 -1  1 -1  0  0  0] (Indices: [1, 4, 8, 9, 10, 11, 12, 13, 14, 16]), Candidate: [ 3  0  1  1  0  1  1  1  1  1  0  1  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 135550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1  0  0  0 -1  1 -1  0  1  0  0 -1  0] (Indices: [1, 4, 8, 9, 10, 11, 13, 16, 17, 18]), Candidate: [3 0 1 1 0 1 1 1 1 1 0 0 2 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 135600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1  0  0 -1  1 -1  0  1  0  0 -1  1 -1] (Indices: [1, 4, 8, 9, 10, 12, 15, 16, 17, 19]), Candidate: [ 3  0  1  1  0  1  1  1  1  1 -1  2  0  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 135650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1  0 -1  1  0 -1  1  0 -1  0  1  0 -1] (Indices: [1, 4, 8, 9, 11, 12, 14, 15, 18, 19]), Candidate: [3 0 1 1 0 1 1 1 1 0 1 1 0 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 135700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1  0 -1  0  1 -1  1 -1  1  0  0  0 -1] (Indices: [1, 4, 8, 9, 12, 14, 16, 17, 18, 19]), Candidate: [ 3  0  1  1  0  1  1  1  1  0  0  2  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 135750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1 -1  1  0 -1  1  0 -1  1  0  0 -1  0] (Indices: [1, 4, 8, 10, 11, 13, 14, 16, 17, 18]), Candidate: [ 3  0  1  1  0  1  1  1  0  2  0  0  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 135800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1 -1  0  1  0  0  0 -1  1  0 -1  1 -1] (Indices: [1, 4, 8, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 3  0  1  1  0  1  1  1  0  1  1  1  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 135850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  1  0  0  0 -1  1  0  0 -1  1 -1  0] (Indices: [1, 4, 9, 10, 11, 12, 14, 15, 16, 18]), Candidate: [3 0 1 1 0 1 1 0 2 1 0 1 0 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 135900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  1  0 -1  1 -1  1  0  0  0  0 -1  0] (Indices: [1, 4, 9, 10, 12, 14, 15, 16, 17, 18]), Candidate: [ 3  0  1  1  0  1  1  0  2  1 -1  2  0  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 135950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  0  1  0  0  0  0  0  0 -1  1 -1  0] (Indices: [1, 4, 10, 11, 12, 13, 14, 15, 16, 18]), Candidate: [3 0 1 1 0 1 1 0 1 2 0 1 1 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 136000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0  0  0  0  0 -1  0  0  0  0  0  1 -1] (Indices: [1, 5, 6, 7, 8, 9, 10, 11, 12, 19]), Candidate: [3 0 1 0 2 1 1 0 1 1 0 1 0 1 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 136050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0  0  0 -1  0  1 -1  1 -1  0  1 -1  0] (Indices: [1, 5, 6, 7, 8, 9, 10, 13, 15, 18]), Candidate: [ 3  0  1  0  2  1  1  0  1  1 -1  1  2  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 136100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0  0 -1  1 -1  1  0 -1  1 -1  0  0  0] (Indices: [1, 5, 6, 7, 8, 9, 11, 13, 14, 16]), Candidate: [ 3  0  1  0  2  1  1  0  1  0  1  0  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 136150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0  0 -1  0  1 -1  1  0 -1  1 -1  0  0] (Indices: [1, 5, 6, 7, 8, 9, 12, 14, 15, 17]), Candidate: [3 0 1 0 2 1 1 0 1 0 0 2 0 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 136200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0  0 -1  0  0  0  0  1  0  0 -1  1 -1] (Indices: [1, 5, 6, 7, 8, 9, 15, 16, 17, 19]), Candidate: [3 0 1 0 2 1 1 0 1 0 0 1 1 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 136250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0 -1  1  0 -1  0  0  1  0  0 -1  0  0] (Indices: [1, 5, 6, 7, 8, 10, 11, 15, 16, 17]), Candidate: [3 0 1 0 2 1 1 0 0 2 0 0 1 1 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 136300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0 -1  1 -1  0  1  0 -1  1 -1  1 -1  0] (Indices: [1, 5, 6, 7, 8, 10, 13, 14, 16, 18]), Candidate: [ 3  0  1  0  2  1  1  0  0  2 -1  1  2  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 136350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0 -1  0  1  0 -1  1 -1  1 -1  1 -1  0] (Indices: [1, 5, 6, 7, 8, 11, 12, 14, 16, 18]), Candidate: [ 3  0  1  0  2  1  1  0  0  1  1  1  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 136400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0 -1  0  0  1  0  0  0  0 -1  0  0  0] (Indices: [1, 5, 6, 7, 8, 12, 13, 14, 15, 16]), Candidate: [3 0 1 0 2 1 1 0 0 1 0 2 1 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 136450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0 -1  0  0  0  0  1  0  0  0  0 -1  0] (Indices: [1, 5, 6, 7, 8, 14, 15, 16, 17, 18]), Candidate: [3 0 1 0 2 1 1 0 0 1 0 1 1 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 136500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  1  0  0 -1  0  1 -1  0  1 -1  1 -1] (Indices: [1, 5, 6, 7, 9, 10, 11, 14, 17, 19]), Candidate: [ 3  0  1  0  2  1  1 -1  2  1  0  0  1  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 136550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  1  0 -1  0  1  0  0 -1  0  0  1 -1] (Indices: [1, 5, 6, 7, 9, 10, 13, 14, 15, 19]), Candidate: [ 3  0  1  0  2  1  1 -1  2  1 -1  1  2  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 136600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  1 -1  1  0 -1  1  0 -1  0  0  1 -1] (Indices: [1, 5, 6, 7, 9, 11, 12, 14, 15, 19]), Candidate: [ 3  0  1  0  2  1  1 -1  2  0  1  1  0  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 136650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  1 -1  1 -1  0  0  1 -1  1  0  0 -1] (Indices: [1, 5, 6, 7, 9, 11, 15, 17, 18, 19]), Candidate: [ 3  0  1  0  2  1  1 -1  2  0  1  0  1  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 136700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  1 -1  0  0  1 -1  1 -1  1  0  0 -1] (Indices: [1, 5, 6, 7, 9, 13, 15, 17, 18, 19]), Candidate: [ 3  0  1  0  2  1  1 -1  2  0  0  1  2  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 136750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  0  1  0 -1  1  0 -1  0  1  0 -1  0] (Indices: [1, 5, 6, 7, 10, 11, 13, 14, 17, 18]), Candidate: [ 3  0  1  0  2  1  1 -1  1  2  0  0  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 136800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  0  1 -1  1 -1  1  0  0 -1  0  1 -1] (Indices: [1, 5, 6, 7, 10, 12, 14, 15, 16, 19]), Candidate: [ 3  0  1  0  2  1  1 -1  1  2 -1  2  0  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 136850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  0  0  1  0  0 -1  0  1  0  0 -1  0] (Indices: [1, 5, 6, 7, 11, 12, 13, 16, 17, 18]), Candidate: [ 3  0  1  0  2  1  1 -1  1  1  1  1  1  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 136900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  0  0  0  1  0 -1  1  0  0  0 -1  0] (Indices: [1, 5, 6, 7, 12, 13, 15, 16, 17, 18]), Candidate: [ 3  0  1  0  2  1  1 -1  1  1  0  2  1  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 136950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1  0  0  0 -1  1 -1  0  1 -1  0  1 -1] (Indices: [1, 5, 6, 8, 9, 10, 11, 13, 16, 19]), Candidate: [3 0 1 0 2 1 0 1 1 1 0 0 2 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 137000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1  0  0 -1  1 -1  0  1  0 -1  1 -1  0] (Indices: [1, 5, 6, 8, 9, 10, 12, 15, 16, 18]), Candidate: [ 3  0  1  0  2  1  0  1  1  1 -1  2  0  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 137050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1  0 -1  1  0  0 -1  1 -1  1 -1  0  0] (Indices: [1, 5, 6, 8, 9, 11, 12, 13, 15, 17]), Candidate: [3 0 1 0 2 1 0 1 1 0 1 1 1 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 137100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1  0 -1  1 -1  0  1  0  0 -1  1 -1  0] (Indices: [1, 5, 6, 8, 9, 11, 14, 15, 16, 18]), Candidate: [3 0 1 0 2 1 0 1 1 0 1 0 1 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 137150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1  0 -1  0  0  1  0  0  0 -1  1 -1  0] (Indices: [1, 5, 6, 8, 9, 13, 14, 15, 16, 18]), Candidate: [3 0 1 0 2 1 0 1 1 0 0 1 2 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 137200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1 -1  1  0  0 -1  0  1 -1  0  1  0 -1] (Indices: [1, 5, 6, 8, 10, 11, 12, 15, 18, 19]), Candidate: [3 0 1 0 2 1 0 1 0 2 0 1 0 1 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 137250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1 -1  1 -1  1  0 -1  1  0  0 -1  0  0] (Indices: [1, 5, 6, 8, 10, 12, 13, 15, 16, 17]), Candidate: [ 3  0  1  0  2  1  0  1  0  2 -1  2  1  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 137300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1 -1  0  1  0  0  0 -1  1  0 -1  0  0] (Indices: [1, 5, 6, 8, 11, 12, 13, 14, 16, 17]), Candidate: [ 3  0  1  0  2  1  0  1  0  1  1  1  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 137350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1 -1  0  1 -1  0  1 -1  1  0  0  0 -1] (Indices: [1, 5, 6, 8, 11, 14, 16, 17, 18, 19]), Candidate: [ 3  0  1  0  2  1  0  1  0  1  1  0  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 137400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  1  0  0  0 -1  1 -1  1 -1  1 -1  0] (Indices: [1, 5, 6, 9, 10, 11, 12, 14, 16, 18]), Candidate: [ 3  0  1  0  2  1  0  0  2  1  0  1  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 137450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  1  0 -1  1  0  0  0  0 -1  0  0  0] (Indices: [1, 5, 6, 9, 10, 12, 13, 14, 15, 16]), Candidate: [ 3  0  1  0  2  1  0  0  2  1 -1  2  1  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 137500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  1  0 -1  0  0  1  0  0  0  0 -1  0] (Indices: [1, 5, 6, 9, 10, 14, 15, 16, 17, 18]), Candidate: [ 3  0  1  0  2  1  0  0  2  1 -1  1  1  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 137550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  1 -1  1 -1  1  0 -1  0  1  0  0 -1] (Indices: [1, 5, 6, 9, 11, 13, 14, 17, 18, 19]), Candidate: [ 3  0  1  0  2  1  0  0  2  0  1  0  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 137600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  0  1  0  0  0 -1  1  0  0 -1  0  0] (Indices: [1, 5, 6, 10, 11, 12, 13, 15, 16, 17]), Candidate: [3 0 1 0 2 1 0 0 1 2 0 1 1 0 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 137650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  0  1 -1  1  0  0  0 -1  1 -1  1 -1] (Indices: [1, 5, 6, 10, 12, 13, 14, 15, 17, 19]), Candidate: [ 3  0  1  0  2  1  0  0  1  2 -1  2  1  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 137700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  0  0  1 -1  1 -1  1  0  0  0  0 -1] (Indices: [1, 5, 6, 11, 13, 15, 16, 17, 18, 19]), Candidate: [3 0 1 0 2 1 0 0 1 1 1 0 2 0 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 137750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0  0  0  0 -1  0  1 -1  1  0 -1  0  0] (Indices: [1, 5, 7, 8, 9, 10, 11, 14, 16, 17]), Candidate: [ 3  0  1  0  2  0  2  0  1  1  0  0  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 137800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0  0  0 -1  1 -1  0  0  0  1  0  0 -1] (Indices: [1, 5, 7, 8, 9, 10, 12, 17, 18, 19]), Candidate: [ 3  0  1  0  2  0  2  0  1  1 -1  2  0  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 137850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0  0 -1  1  0  0 -1  0  0  0  1  0 -1] (Indices: [1, 5, 7, 8, 9, 11, 12, 13, 18, 19]), Candidate: [3 0 1 0 2 0 2 0 1 0 1 1 1 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 137900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0  0 -1  1 -1  0  1 -1  0  1  0  0 -1] (Indices: [1, 5, 7, 8, 9, 11, 14, 17, 18, 19]), Candidate: [ 3  0  1  0  2  0  2  0  1  0  1  0  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 137950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0  0 -1  0  0  1  0 -1  0  1  0  0 -1] (Indices: [1, 5, 7, 8, 9, 13, 14, 17, 18, 19]), Candidate: [ 3  0  1  0  2  0  2  0  1  0  0  1  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 138000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0 -1  1  0 -1  1  0  0 -1  0  0  1 -1] (Indices: [1, 5, 7, 8, 10, 11, 13, 14, 15, 19]), Candidate: [3 0 1 0 2 0 2 0 0 2 0 0 2 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 138050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0 -1  1 -1  1  0 -1  0  1 -1  1  0 -1] (Indices: [1, 5, 7, 8, 10, 12, 13, 16, 18, 19]), Candidate: [ 3  0  1  0  2  0  2  0  0  2 -1  2  1  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 138100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0 -1  0  1  0  0 -1  1  0 -1  0  1 -1] (Indices: [1, 5, 7, 8, 11, 12, 13, 15, 16, 19]), Candidate: [3 0 1 0 2 0 2 0 0 1 1 1 1 0 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 138150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0 -1  0  0  1  0  0 -1  1  0  0 -1  0] (Indices: [1, 5, 7, 8, 12, 13, 14, 16, 17, 18]), Candidate: [ 3  0  1  0  2  0  2  0  0  1  0  2  1  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 138200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  1  0  0  0 -1  0  1 -1  1  0 -1  0] (Indices: [1, 5, 7, 9, 10, 11, 12, 15, 17, 18]), Candidate: [ 3  0  1  0  2  0  2 -1  2  1  0  1  0  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 138250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  1  0 -1  1  0  0 -1  0  1 -1  1 -1] (Indices: [1, 5, 7, 9, 10, 12, 13, 14, 17, 19]), Candidate: [ 3  0  1  0  2  0  2 -1  2  1 -1  2  1  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 138300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  1 -1  1  0  0  0  0 -1  0  1 -1  0] (Indices: [1, 5, 7, 9, 11, 12, 13, 14, 15, 18]), Candidate: [ 3  0  1  0  2  0  2 -1  2  0  1  1  1  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 138350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  1 -1  1 -1  0  1  0  0 -1  1  0 -1] (Indices: [1, 5, 7, 9, 11, 14, 15, 16, 18, 19]), Candidate: [ 3  0  1  0  2  0  2 -1  2  0  1  0  1  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 138400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  0  1  0  0  0 -1  0  1 -1  1  0 -1] (Indices: [1, 5, 7, 10, 11, 12, 13, 16, 18, 19]), Candidate: [ 3  0  1  0  2  0  2 -1  1  2  0  1  1  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 138450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  0  1 -1  1  0 -1  1  0 -1  1  0 -1] (Indices: [1, 5, 7, 10, 12, 13, 15, 16, 18, 19]), Candidate: [ 3  0  1  0  2  0  2 -1  1  2 -1  2  1  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 138500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  0  0  0  1 -1  1  0  0  0  0  0 -1] (Indices: [1, 5, 7, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  0  1  0  2  0  2 -1  1  1  0  2  0  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 138550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1  0  0  0 -1  1 -1  1 -1  1  0 -1  0] (Indices: [1, 5, 8, 9, 10, 11, 13, 15, 17, 18]), Candidate: [3 0 1 0 2 0 1 1 1 1 0 0 2 0 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 138600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1  0  0 -1  1 -1  1 -1  1 -1  1  0 -1] (Indices: [1, 5, 8, 9, 10, 12, 14, 16, 18, 19]), Candidate: [ 3  0  1  0  2  0  1  1  1  1 -1  2  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 138650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1  0 -1  1  0 -1  1  0  0 -1  0  1 -1] (Indices: [1, 5, 8, 9, 11, 12, 14, 15, 16, 19]), Candidate: [3 0 1 0 2 0 1 1 1 0 1 1 0 2 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 138700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1  0 -1  0  1 -1  1  0  0  0 -1  1 -1] (Indices: [1, 5, 8, 9, 12, 14, 15, 16, 17, 19]), Candidate: [3 0 1 0 2 0 1 1 1 0 0 2 0 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 138750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1 -1  1  0 -1  1  0  0 -1  1  0 -1  0] (Indices: [1, 5, 8, 10, 11, 13, 14, 15, 17, 18]), Candidate: [3 0 1 0 2 0 1 1 0 2 0 0 2 1 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 138800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1 -1  0  1  0  0  0  0 -1  1 -1  1 -1] (Indices: [1, 5, 8, 11, 12, 13, 14, 15, 17, 19]), Candidate: [3 0 1 0 2 0 1 1 0 1 1 1 1 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 138850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  1  0  0  0  0 -1  0  1 -1  1  0 -1] (Indices: [1, 5, 9, 10, 11, 12, 13, 16, 18, 19]), Candidate: [3 0 1 0 2 0 1 0 2 1 0 1 1 0 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 138900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  1  0 -1  1  0 -1  1  0 -1  1  0 -1] (Indices: [1, 5, 9, 10, 12, 13, 15, 16, 18, 19]), Candidate: [ 3  0  1  0  2  0  1  0  2  1 -1  2  1  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 138950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  1 -1  0  1 -1  1  0  0  0  0  0 -1] (Indices: [1, 5, 9, 12, 14, 15, 16, 17, 18, 19]), Candidate: [3 0 1 0 2 0 1 0 2 0 0 2 0 2 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 139000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0  0  0  0  0  0 -1  0  0  1 -1  0  0] (Indices: [1, 6, 7, 8, 9, 10, 11, 12, 13, 17]), Candidate: [3 0 1 0 1 2 1 0 1 1 0 1 1 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 139050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0  0  0  0 -1  0  0  0  1  0 -1  1 -1] (Indices: [1, 6, 7, 8, 9, 10, 11, 16, 17, 19]), Candidate: [3 0 1 0 1 2 1 0 1 1 0 0 1 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 139100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0  0  0 -1  0  1 -1  1  0 -1  0  1 -1] (Indices: [1, 6, 7, 8, 9, 10, 13, 15, 16, 19]), Candidate: [ 3  0  1  0  1  2  1  0  1  1 -1  1  2  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 139150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0  0 -1  1  0 -1  0  1  0 -1  0  1 -1] (Indices: [1, 6, 7, 8, 9, 11, 12, 15, 16, 19]), Candidate: [3 0 1 0 1 2 1 0 1 0 1 1 0 1 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 139200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0  0 -1  0  1  0  0 -1  0  1  0 -1  0] (Indices: [1, 6, 7, 8, 9, 12, 13, 14, 17, 18]), Candidate: [ 3  0  1  0  1  2  1  0  1  0  0  2  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 139250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0 -1  1  0  0  0  0 -1  1 -1  0  0  0] (Indices: [1, 6, 7, 8, 10, 11, 12, 13, 14, 16]), Candidate: [ 3  0  1  0  1  2  1  0  0  2  0  1  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 139300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0 -1  1  0 -1  1 -1  0  1  0  0 -1  0] (Indices: [1, 6, 7, 8, 10, 11, 13, 16, 17, 18]), Candidate: [3 0 1 0 1 2 1 0 0 2 0 0 2 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 139350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0 -1  1 -1  1 -1  0  1  0  0 -1  1 -1] (Indices: [1, 6, 7, 8, 10, 12, 15, 16, 17, 19]), Candidate: [ 3  0  1  0  1  2  1  0  0  2 -1  2  0  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 139400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0 -1  0  1  0 -1  1  0 -1  0  1  0 -1] (Indices: [1, 6, 7, 8, 11, 12, 14, 15, 18, 19]), Candidate: [3 0 1 0 1 2 1 0 0 1 1 1 0 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 139450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0 -1  0  0  1 -1  1 -1  1  0  0  0 -1] (Indices: [1, 6, 7, 8, 12, 14, 16, 17, 18, 19]), Candidate: [ 3  0  1  0  1  2  1  0  0  1  0  2  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 139500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  1  0  0 -1  1  0 -1  1 -1  0  1 -1] (Indices: [1, 6, 7, 9, 10, 11, 13, 14, 16, 19]), Candidate: [ 3  0  1  0  1  2  1 -1  2  1  0  0  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 139550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  1  0 -1  1 -1  1  0  0 -1  1 -1  0] (Indices: [1, 6, 7, 9, 10, 12, 14, 15, 16, 18]), Candidate: [ 3  0  1  0  1  2  1 -1  2  1 -1  2  0  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 139600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  1 -1  1  0  0 -1  1 -1  0  1  0 -1] (Indices: [1, 6, 7, 9, 11, 12, 13, 15, 18, 19]), Candidate: [ 3  0  1  0  1  2  1 -1  2  0  1  1  1  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 139650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  1 -1  0  1  0  0 -1  0  1  0  0 -1] (Indices: [1, 6, 7, 9, 12, 13, 14, 17, 18, 19]), Candidate: [ 3  0  1  0  1  2  1 -1  2  0  0  2  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 139700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  0  1  0  0 -1  0  1  0  0 -1  1 -1] (Indices: [1, 6, 7, 10, 11, 12, 15, 16, 17, 19]), Candidate: [ 3  0  1  0  1  2  1 -1  1  2  0  1  0  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 139750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  0  1 -1  0  1  0 -1  1  0  0  0 -1] (Indices: [1, 6, 7, 10, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  0  1  0  1  2  1 -1  1  2 -1  1  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 139800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1  0  0  0  0  0 -1  0  1 -1  0  1 -1] (Indices: [1, 6, 8, 9, 10, 11, 12, 13, 16, 19]), Candidate: [3 0 1 0 1 2 0 1 1 1 0 1 1 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 139850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1  0  0  0 -1  0  1 -1  1  0  0 -1  0] (Indices: [1, 6, 8, 9, 10, 11, 14, 16, 17, 18]), Candidate: [ 3  0  1  0  1  2  0  1  1  1  0  0  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 139900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1  0  0 -1  0  1  0 -1  1  0  0 -1  0] (Indices: [1, 6, 8, 9, 10, 13, 14, 16, 17, 18]), Candidate: [ 3  0  1  0  1  2  0  1  1  1 -1  1  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 139950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1  0 -1  1 -1  1  0  0  0  0 -1  0  0] (Indices: [1, 6, 8, 9, 11, 13, 14, 15, 16, 17]), Candidate: [3 0 1 0 1 2 0 1 1 0 1 0 2 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 140000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1 -1  1  0  0  0  0  0 -1  1 -1  0  0] (Indices: [1, 6, 8, 10, 11, 12, 13, 14, 15, 17]), Candidate: [3 0 1 0 1 2 0 1 0 2 0 1 1 1 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 140050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1 -1  1  0 -1  0  1  0  0  0 -1  1 -1] (Indices: [1, 6, 8, 10, 11, 14, 15, 16, 17, 19]), Candidate: [3 0 1 0 1 2 0 1 0 2 0 0 1 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 140100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1 -1  0  1  0 -1  1  0  0 -1  1  0 -1] (Indices: [1, 6, 8, 11, 12, 14, 15, 16, 18, 19]), Candidate: [3 0 1 0 1 2 0 1 0 1 1 1 0 2 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 140150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  1  0  0  0 -1  0  1  0  0 -1  1 -1] (Indices: [1, 6, 9, 10, 11, 12, 15, 16, 17, 19]), Candidate: [3 0 1 0 1 2 0 0 2 1 0 1 0 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 140200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  1  0 -1  0  1  0 -1  1  0  0  0 -1] (Indices: [1, 6, 9, 10, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  0  1  0  1  2  0  0  2  1 -1  1  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 140250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  0  1  0  0  0 -1  1  0  0 -1  1 -1] (Indices: [1, 6, 10, 11, 12, 13, 15, 16, 17, 19]), Candidate: [3 0 1 0 1 2 0 0 1 2 0 1 1 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 140300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0  0  0  0  0 -1  1  0 -1  1 -1  0  0] (Indices: [1, 7, 8, 9, 10, 11, 12, 14, 15, 17]), Candidate: [3 0 1 0 1 1 2 0 1 1 0 1 0 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 140350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0  0  0  0 -1  0  0  1  0  0 -1  1 -1] (Indices: [1, 7, 8, 9, 10, 11, 15, 16, 17, 19]), Candidate: [3 0 1 0 1 1 2 0 1 1 0 0 1 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 140400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0  0  0 -1  0  1 -1  1  0  0 -1  1 -1] (Indices: [1, 7, 8, 9, 10, 13, 15, 16, 17, 19]), Candidate: [ 3  0  1  0  1  1  2  0  1  1 -1  1  2  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 140450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0  0 -1  1 -1  1  0  0 -1  0  1  0 -1] (Indices: [1, 7, 8, 9, 11, 13, 14, 15, 18, 19]), Candidate: [3 0 1 0 1 1 2 0 1 0 1 0 2 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 140500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0 -1  1  0  0  0  0 -1  1 -1  0  1 -1] (Indices: [1, 7, 8, 10, 11, 12, 13, 14, 16, 19]), Candidate: [ 3  0  1  0  1  1  2  0  0  2  0  1  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 140550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0 -1  1 -1  1  0  0  0  0  0 -1  0  0] (Indices: [1, 7, 8, 10, 12, 13, 14, 15, 16, 17]), Candidate: [ 3  0  1  0  1  1  2  0  0  2 -1  2  1  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 140600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0 -1  0  1 -1  1  0  0  0  0 -1  1 -1] (Indices: [1, 7, 8, 11, 13, 14, 15, 16, 17, 19]), Candidate: [3 0 1 0 1 1 2 0 0 1 1 0 2 1 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 140650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  1  0  0 -1  1  0  0  0 -1  1 -1  0] (Indices: [1, 7, 9, 10, 11, 13, 14, 15, 16, 18]), Candidate: [ 3  0  1  0  1  1  2 -1  2  1  0  0  2  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 140700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  1 -1  1  0  0  0  0  0 -1  0  1 -1] (Indices: [1, 7, 9, 11, 12, 13, 14, 15, 16, 19]), Candidate: [ 3  0  1  0  1  1  2 -1  2  0  1  1  1  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 140750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  0  1  0  0 -1  1  0  0  0 -1  1 -1] (Indices: [1, 7, 10, 11, 12, 14, 15, 16, 17, 19]), Candidate: [ 3  0  1  0  1  1  2 -1  1  2  0  1  0  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 140800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1  0  0  0  0 -1  1  0  0 -1  1 -1  0] (Indices: [1, 8, 9, 10, 11, 12, 14, 15, 16, 18]), Candidate: [3 0 1 0 1 1 1 1 1 1 0 1 0 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 140850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1  0  0 -1  1 -1  1  0  0  0  0 -1  0] (Indices: [1, 8, 9, 10, 12, 14, 15, 16, 17, 18]), Candidate: [ 3  0  1  0  1  1  1  1  1  1 -1  2  0  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 140900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1 -1  1  0  0  0  0  0  0 -1  1 -1  0] (Indices: [1, 8, 10, 11, 12, 13, 14, 15, 16, 18]), Candidate: [3 0 1 0 1 1 1 1 0 2 0 1 1 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 140950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  0  1  0  0  0  0  0 -1  1  0  0 -1  0] (Indices: [1, 9, 10, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 3  0  1  0  1  1  1  0  2  1  0  1  1  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 141000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0  0  0 -1  1 -1  0  0  0  0  0  0  0] (Indices: [2, 3, 4, 5, 6, 7, 8, 9, 10, 12]), Candidate: [ 2  2  1  0  1  1  1  0  1  1 -1  2  0  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 141050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0 -1  1  0 -1  0  0  0  0  0  1 -1  0] (Indices: [2, 3, 4, 5, 6, 7, 8, 10, 11, 18]), Candidate: [2 2 1 0 1 1 1 0 0 2 0 0 1 1 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 141100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0 -1  0  1 -1  0  0  1 -1  0  1 -1  0] (Indices: [2, 3, 4, 5, 6, 7, 8, 11, 15, 18]), Candidate: [2 2 1 0 1 1 1 0 0 1 1 0 1 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 141150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0 -1  0  0  0  0  1 -1  1 -1  0  1 -1] (Indices: [2, 3, 4, 5, 6, 7, 8, 14, 16, 19]), Candidate: [ 2  2  1  0  1  1  1  0  0  1  0  1  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 141200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  1 -1  1  0  0 -1  0  0  0  0  0  0] (Indices: [2, 3, 4, 5, 6, 7, 9, 11, 12, 13]), Candidate: [ 2  2  1  0  1  1  1 -1  2  0  1  1  1  0  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 141250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  1 -1  0  0  1  0 -1  1 -1  0  0  0] (Indices: [2, 3, 4, 5, 6, 7, 9, 13, 14, 16]), Candidate: [ 2  2  1  0  1  1  1 -1  2  0  0  1  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 141300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  0  1  0 -1  0  1 -1  0  0  1 -1  0] (Indices: [2, 3, 4, 5, 6, 7, 10, 11, 14, 18]), Candidate: [ 2  2  1  0  1  1  1 -1  1  2  0  0  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 141350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  0  1 -1  0  0  1  0 -1  0  1 -1  0] (Indices: [2, 3, 4, 5, 6, 7, 10, 14, 15, 18]), Candidate: [ 2  2  1  0  1  1  1 -1  1  2 -1  1  1  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 141400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  0  0  1 -1  1 -1  0  1 -1  0  1 -1] (Indices: [2, 3, 4, 5, 6, 7, 11, 13, 16, 19]), Candidate: [ 2  2  1  0  1  1  1 -1  1  1  1  0  2  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 141450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  0  0  0  1 -1  0  1  0 -1  1 -1  0] (Indices: [2, 3, 4, 5, 6, 7, 12, 15, 16, 18]), Candidate: [ 2  2  1  0  1  1  1 -1  1  1  0  2  0  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 141500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1  0  0  0 -1  0  0  0  0  0  1 -1  0] (Indices: [2, 3, 4, 5, 6, 8, 9, 10, 11, 18]), Candidate: [2 2 1 0 1 1 0 1 1 1 0 0 1 1 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 141550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1  0 -1  1 -1  0  0  1 -1  0  1 -1  0] (Indices: [2, 3, 4, 5, 6, 8, 9, 11, 15, 18]), Candidate: [2 2 1 0 1 1 0 1 1 0 1 0 1 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 141600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1  0 -1  0  0  0  1 -1  1 -1  0  1 -1] (Indices: [2, 3, 4, 5, 6, 8, 9, 14, 16, 19]), Candidate: [ 2  2  1  0  1  1  0  1  1  0  0  1  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 141650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1 -1  1 -1  1 -1  1 -1  0  1 -1  0  0] (Indices: [2, 3, 4, 5, 6, 8, 10, 12, 14, 17]), Candidate: [ 2  2  1  0  1  1  0  1  0  2 -1  2  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 141700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1 -1  0  1  0  0 -1  0  1 -1  0  0  0] (Indices: [2, 3, 4, 5, 6, 8, 11, 12, 13, 16]), Candidate: [2 2 1 0 1 1 0 1 0 1 1 1 1 0 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 141750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1 -1  0  1 -1  0  0  0  1  0  0 -1  0] (Indices: [2, 3, 4, 5, 6, 8, 11, 16, 17, 18]), Candidate: [2 2 1 0 1 1 0 1 0 1 1 0 1 1 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 141800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1 -1  0  0  0  1 -1  1  0 -1  1 -1  0] (Indices: [2, 3, 4, 5, 6, 8, 13, 15, 16, 18]), Candidate: [2 2 1 0 1 1 0 1 0 1 0 1 2 0 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 141850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  1  0  0 -1  0  0  0  0  1 -1  1 -1] (Indices: [2, 3, 4, 5, 6, 9, 10, 11, 17, 19]), Candidate: [2 2 1 0 1 1 0 0 2 1 0 0 1 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 141900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  1  0 -1  0  0  0  1  0 -1  0  1 -1] (Indices: [2, 3, 4, 5, 6, 9, 10, 15, 16, 19]), Candidate: [ 2  2  1  0  1  1  0  0  2  1 -1  1  1  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 141950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  1 -1  1 -1  0  1 -1  1 -1  0  1 -1] (Indices: [2, 3, 4, 5, 6, 9, 11, 14, 16, 19]), Candidate: [ 2  2  1  0  1  1  0  0  2  0  1  0  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 142000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  1 -1  0  0  1  0  0 -1  1 -1  0  0] (Indices: [2, 3, 4, 5, 6, 9, 13, 14, 15, 17]), Candidate: [2 2 1 0 1 1 0 0 2 0 0 1 2 1 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 142050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  0  1  0  0 -1  0  0  1 -1  1 -1  0] (Indices: [2, 3, 4, 5, 6, 10, 11, 12, 16, 18]), Candidate: [2 2 1 0 1 1 0 0 1 2 0 1 0 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 142100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  0  1 -1  1  0 -1  0  1 -1  1 -1  0] (Indices: [2, 3, 4, 5, 6, 10, 12, 13, 16, 18]), Candidate: [ 2  2  1  0  1  1  0  0  1  2 -1  2  1  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 142150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  0  1 -1  0  0  1  0 -1  0  1  0 -1] (Indices: [2, 3, 4, 5, 6, 10, 14, 15, 18, 19]), Candidate: [ 2  2  1  0  1  1  0  0  1  2 -1  1  1  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 142200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  0  0  1 -1  1  0 -1  1 -1  1 -1  0] (Indices: [2, 3, 4, 5, 6, 11, 13, 14, 16, 18]), Candidate: [ 2  2  1  0  1  1  0  0  1  1  1  0  2  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 142250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  0  0  0  1 -1  1  0  0  0 -1  0  0] (Indices: [2, 3, 4, 5, 6, 12, 14, 15, 16, 17]), Candidate: [2 2 1 0 1 1 0 0 1 1 0 2 0 2 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 142300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0  0  0 -1  1 -1  0  0  0  0  0  1 -1] (Indices: [2, 3, 4, 5, 7, 8, 9, 10, 12, 19]), Candidate: [ 2  2  1  0  1  0  2  0  1  1 -1  2  0  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 142350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0  0 -1  0  1  0  0 -1  0  0  0  0  0] (Indices: [2, 3, 4, 5, 7, 8, 9, 12, 13, 14]), Candidate: [ 2  2  1  0  1  0  2  0  1  0  0  2  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 142400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0  0 -1  0  0  0  0  1 -1  1 -1  1 -1] (Indices: [2, 3, 4, 5, 7, 8, 9, 15, 17, 19]), Candidate: [2 2 1 0 1 0 2 0 1 0 0 1 1 1 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 142450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0 -1  1 -1  1 -1  0  0  1 -1  1 -1  0] (Indices: [2, 3, 4, 5, 7, 8, 10, 12, 16, 18]), Candidate: [ 2  2  1  0  1  0  2  0  0  2 -1  2  0  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 142500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0 -1  0  1  0 -1  1 -1  0  0  0  1 -1] (Indices: [2, 3, 4, 5, 7, 8, 11, 12, 14, 19]), Candidate: [ 2  2  1  0  1  0  2  0  0  1  1  1  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 142550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0 -1  0  0  1  0  0 -1  0  0  0  1 -1] (Indices: [2, 3, 4, 5, 7, 8, 12, 13, 14, 19]), Candidate: [ 2  2  1  0  1  0  2  0  0  1  0  2  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 142600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0 -1  0  0  0  1 -1  0  0  1  0  0 -1] (Indices: [2, 3, 4, 5, 7, 8, 13, 17, 18, 19]), Candidate: [2 2 1 0 1 0 2 0 0 1 0 1 2 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 142650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  1  0 -1  1 -1  1  0 -1  0  0  0  0] (Indices: [2, 3, 4, 5, 7, 9, 10, 12, 14, 15]), Candidate: [ 2  2  1  0  1  0  2 -1  2  1 -1  2  0  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 142700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  1 -1  1  0  0  0 -1  0  0  0  0  0] (Indices: [2, 3, 4, 5, 7, 9, 11, 12, 13, 14]), Candidate: [ 2  2  1  0  1  0  2 -1  2  0  1  1  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 142750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  1 -1  1 -1  0  0  1 -1  1 -1  1 -1] (Indices: [2, 3, 4, 5, 7, 9, 11, 15, 17, 19]), Candidate: [ 2  2  1  0  1  0  2 -1  2  0  1  0  1  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 142800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  1 -1  0  0  1  0 -1  0  0  1  0 -1] (Indices: [2, 3, 4, 5, 7, 9, 13, 14, 18, 19]), Candidate: [ 2  2  1  0  1  0  2 -1  2  0  0  1  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 142850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  0  1  0 -1  1  0 -1  0  0  1 -1  0] (Indices: [2, 3, 4, 5, 7, 10, 11, 13, 14, 18]), Candidate: [ 2  2  1  0  1  0  2 -1  1  2  0  0  2  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 142900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  0  1 -1  1 -1  1  0 -1  0  0  1 -1] (Indices: [2, 3, 4, 5, 7, 10, 12, 14, 15, 19]), Candidate: [ 2  2  1  0  1  0  2 -1  1  2 -1  2  0  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 142950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  0  1 -1  0  0  0  1 -1  1  0  0 -1] (Indices: [2, 3, 4, 5, 7, 10, 15, 17, 18, 19]), Candidate: [ 2  2  1  0  1  0  2 -1  1  2 -1  1  1  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 143000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  0  0  1 -1  1 -1  1 -1  1  0 -1  0] (Indices: [2, 3, 4, 5, 7, 11, 13, 15, 17, 18]), Candidate: [ 2  2  1  0  1  0  2 -1  1  1  1  0  2  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 143050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  0  0  0  1 -1  1 -1  1 -1  1  0 -1] (Indices: [2, 3, 4, 5, 7, 12, 14, 16, 18, 19]), Candidate: [ 2  2  1  0  1  0  2 -1  1  1  0  2  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 143100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1  0  0  0 -1  0  0  0  1  0 -1  0  0] (Indices: [2, 3, 4, 5, 8, 9, 10, 11, 16, 17]), Candidate: [2 2 1 0 1 0 1 1 1 1 0 0 1 1 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 143150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1  0  0 -1  0  0  1 -1  0  1 -1  1 -1] (Indices: [2, 3, 4, 5, 8, 9, 10, 14, 17, 19]), Candidate: [ 2  2  1  0  1  0  1  1  1  1 -1  1  1  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 143200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1  0 -1  1 -1  0  1  0 -1  0  1 -1  0] (Indices: [2, 3, 4, 5, 8, 9, 11, 14, 15, 18]), Candidate: [2 2 1 0 1 0 1 1 1 0 1 0 1 2 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 143250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1  0 -1  0  1 -1  0  0  1  0 -1  1 -1] (Indices: [2, 3, 4, 5, 8, 9, 12, 16, 17, 19]), Candidate: [2 2 1 0 1 0 1 1 1 0 0 2 0 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 143300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1 -1  1  0  0 -1  0  1 -1  1 -1  0  0] (Indices: [2, 3, 4, 5, 8, 10, 11, 12, 15, 17]), Candidate: [2 2 1 0 1 0 1 1 0 2 0 1 0 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 143350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1 -1  1 -1  1  0 -1  1 -1  1 -1  0  0] (Indices: [2, 3, 4, 5, 8, 10, 12, 13, 15, 17]), Candidate: [ 2  2  1  0  1  0  1  1  0  2 -1  2  1  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 143400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1 -1  1 -1  0  0  1  0  0 -1  1 -1  0] (Indices: [2, 3, 4, 5, 8, 10, 14, 15, 16, 18]), Candidate: [ 2  2  1  0  1  0  1  1  0  2 -1  1  1  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 143450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1 -1  0  1 -1  1  0  0 -1  1 -1  0  0] (Indices: [2, 3, 4, 5, 8, 11, 13, 14, 15, 17]), Candidate: [2 2 1 0 1 0 1 1 0 1 1 0 2 1 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 143500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1 -1  0  0  1  0 -1  0  1  0  0 -1  0] (Indices: [2, 3, 4, 5, 8, 12, 13, 16, 17, 18]), Candidate: [2 2 1 0 1 0 1 1 0 1 0 2 1 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 143550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  1  0  0  0 -1  1 -1  0  0  0  1 -1] (Indices: [2, 3, 4, 5, 9, 10, 11, 12, 14, 19]), Candidate: [ 2  2  1  0  1  0  1  0  2  1  0  1  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 143600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  1  0 -1  1  0  0 -1  0  0  0  1 -1] (Indices: [2, 3, 4, 5, 9, 10, 12, 13, 14, 19]), Candidate: [ 2  2  1  0  1  0  1  0  2  1 -1  2  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 143650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  1  0 -1  0  1 -1  0  0  1  0  0 -1] (Indices: [2, 3, 4, 5, 9, 10, 13, 17, 18, 19]), Candidate: [ 2  2  1  0  1  0  1  0  2  1 -1  1  2  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 143700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  1 -1  1  0 -1  0  0  0  1  0  0 -1] (Indices: [2, 3, 4, 5, 9, 11, 12, 17, 18, 19]), Candidate: [2 2 1 0 1 0 1 0 2 0 1 1 0 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 143750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  1 -1  0  1  0 -1  1 -1  1 -1  1 -1] (Indices: [2, 3, 4, 5, 9, 12, 13, 15, 17, 19]), Candidate: [2 2 1 0 1 0 1 0 2 0 0 2 1 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 143800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  0  1  0  0  0 -1  1 -1  0  0  1 -1] (Indices: [2, 3, 4, 5, 10, 11, 12, 13, 15, 19]), Candidate: [2 2 1 0 1 0 1 0 1 2 0 1 1 0 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 143850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  0  1  0 -1  0  1  0 -1  1  0 -1  0] (Indices: [2, 3, 4, 5, 10, 11, 14, 15, 17, 18]), Candidate: [2 2 1 0 1 0 1 0 1 2 0 0 1 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 143900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  0  1 -1  0  1  0  0 -1  1  0 -1  0] (Indices: [2, 3, 4, 5, 10, 13, 14, 15, 17, 18]), Candidate: [ 2  2  1  0  1  0  1  0  1  2 -1  1  2  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 143950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  0  0  1  0 -1  0  1  0 -1  1  0 -1] (Indices: [2, 3, 4, 5, 11, 12, 15, 16, 18, 19]), Candidate: [2 2 1 0 1 0 1 0 1 1 1 1 0 1 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 144000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  0  0  0  0  1 -1  1  0  0  0  0 -1] (Indices: [2, 3, 4, 5, 13, 15, 16, 17, 18, 19]), Candidate: [2 2 1 0 1 0 1 0 1 1 0 1 2 0 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 144050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0  0 -1  1 -1  1 -1  0  0  0  0  1 -1] (Indices: [2, 3, 4, 6, 7, 8, 9, 11, 13, 19]), Candidate: [2 2 1 0 0 2 1 0 1 0 1 0 2 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 144100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0  0 -1  0  0  1 -1  0  0  1 -1  1 -1] (Indices: [2, 3, 4, 6, 7, 8, 9, 13, 17, 19]), Candidate: [2 2 1 0 0 2 1 0 1 0 0 1 2 0 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 144150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0 -1  1 -1  1  0  0 -1  0  0  0  0  0] (Indices: [2, 3, 4, 6, 7, 8, 10, 12, 13, 14]), Candidate: [ 2  2  1  0  0  2  1  0  0  2 -1  2  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 144200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0 -1  1 -1  0  0  0  1 -1  1 -1  1 -1] (Indices: [2, 3, 4, 6, 7, 8, 10, 15, 17, 19]), Candidate: [ 2  2  1  0  0  2  1  0  0  2 -1  1  1  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 144250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0 -1  0  1 -1  0  1 -1  0  1 -1  1 -1] (Indices: [2, 3, 4, 6, 7, 8, 11, 14, 17, 19]), Candidate: [ 2  2  1  0  0  2  1  0  0  1  1  0  1  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 144300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0 -1  0  0  0  1  0  0 -1  0  0  1 -1] (Indices: [2, 3, 4, 6, 7, 8, 13, 14, 15, 19]), Candidate: [2 2 1 0 0 2 1 0 0 1 0 1 2 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 144350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  1  0  0 -1  0  0  1  0 -1  0  0  0] (Indices: [2, 3, 4, 6, 7, 9, 10, 11, 15, 16]), Candidate: [ 2  2  1  0  0  2  1 -1  2  1  0  0  1  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 144400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  1  0 -1  0  0  1 -1  1  0 -1  0  0] (Indices: [2, 3, 4, 6, 7, 9, 10, 14, 16, 17]), Candidate: [ 2  2  1  0  0  2  1 -1  2  1 -1  1  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 144450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  1 -1  1 -1  1 -1  0  0  1 -1  1 -1] (Indices: [2, 3, 4, 6, 7, 9, 11, 13, 17, 19]), Candidate: [ 2  2  1  0  0  2  1 -1  2  0  1  0  2  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 144500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  1 -1  0  1 -1  0  1 -1  1  0 -1  0] (Indices: [2, 3, 4, 6, 7, 9, 12, 15, 17, 18]), Candidate: [ 2  2  1  0  0  2  1 -1  2  0  0  2  0  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 144550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  0  1  0  0 -1  1 -1  0  1 -1  0  0] (Indices: [2, 3, 4, 6, 7, 10, 11, 12, 14, 17]), Candidate: [ 2  2  1  0  0  2  1 -1  1  2  0  1  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 144600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  0  1 -1  1  0  0 -1  0  1 -1  0  0] (Indices: [2, 3, 4, 6, 7, 10, 12, 13, 14, 17]), Candidate: [ 2  2  1  0  0  2  1 -1  1  2 -1  2  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 144650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  0  1 -1  0  1 -1  0  1  0 -1  1 -1] (Indices: [2, 3, 4, 6, 7, 10, 13, 16, 17, 19]), Candidate: [ 2  2  1  0  0  2  1 -1  1  2 -1  1  2  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 144700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  0  0  1  0 -1  0  0  1  0 -1  1 -1] (Indices: [2, 3, 4, 6, 7, 11, 12, 16, 17, 19]), Candidate: [ 2  2  1  0  0  2  1 -1  1  1  1  1  0  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 144750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  0  0  0  1  0 -1  1  0 -1  0  1 -1] (Indices: [2, 3, 4, 6, 7, 12, 13, 15, 16, 19]), Candidate: [ 2  2  1  0  0  2  1 -1  1  1  0  2  1  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 144800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1  0  0  0  0 -1  0  0  0  0  0  1 -1] (Indices: [2, 3, 4, 6, 8, 9, 10, 11, 12, 19]), Candidate: [2 2 1 0 0 2 0 1 1 1 0 1 0 1 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 144850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1  0  0 -1  0  1 -1  1 -1  0  1 -1  0] (Indices: [2, 3, 4, 6, 8, 9, 10, 13, 15, 18]), Candidate: [ 2  2  1  0  0  2  0  1  1  1 -1  1  2  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 144900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1  0 -1  1 -1  1  0 -1  1 -1  0  0  0] (Indices: [2, 3, 4, 6, 8, 9, 11, 13, 14, 16]), Candidate: [ 2  2  1  0  0  2  0  1  1  0  1  0  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 144950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1  0 -1  0  1 -1  1  0 -1  1 -1  0  0] (Indices: [2, 3, 4, 6, 8, 9, 12, 14, 15, 17]), Candidate: [2 2 1 0 0 2 0 1 1 0 0 2 0 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 145000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1  0 -1  0  0  0  0  1  0  0 -1  1 -1] (Indices: [2, 3, 4, 6, 8, 9, 15, 16, 17, 19]), Candidate: [2 2 1 0 0 2 0 1 1 0 0 1 1 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 145050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1 -1  1  0 -1  0  0  1  0  0 -1  0  0] (Indices: [2, 3, 4, 6, 8, 10, 11, 15, 16, 17]), Candidate: [2 2 1 0 0 2 0 1 0 2 0 0 1 1 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 145100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1 -1  1 -1  0  1  0 -1  1 -1  1 -1  0] (Indices: [2, 3, 4, 6, 8, 10, 13, 14, 16, 18]), Candidate: [ 2  2  1  0  0  2  0  1  0  2 -1  1  2  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 145150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1 -1  0  1  0 -1  1 -1  1 -1  1 -1  0] (Indices: [2, 3, 4, 6, 8, 11, 12, 14, 16, 18]), Candidate: [ 2  2  1  0  0  2  0  1  0  1  1  1  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 145200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1 -1  0  0  1  0  0  0  0 -1  0  0  0] (Indices: [2, 3, 4, 6, 8, 12, 13, 14, 15, 16]), Candidate: [2 2 1 0 0 2 0 1 0 1 0 2 1 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 145250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1 -1  0  0  0  0  1  0  0  0  0 -1  0] (Indices: [2, 3, 4, 6, 8, 14, 15, 16, 17, 18]), Candidate: [2 2 1 0 0 2 0 1 0 1 0 1 1 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 145300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  1  0  0 -1  0  1 -1  0  1 -1  1 -1] (Indices: [2, 3, 4, 6, 9, 10, 11, 14, 17, 19]), Candidate: [ 2  2  1  0  0  2  0  0  2  1  0  0  1  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 145350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  1  0 -1  0  1  0  0 -1  0  0  1 -1] (Indices: [2, 3, 4, 6, 9, 10, 13, 14, 15, 19]), Candidate: [ 2  2  1  0  0  2  0  0  2  1 -1  1  2  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 145400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  1 -1  1  0 -1  1  0 -1  0  0  1 -1] (Indices: [2, 3, 4, 6, 9, 11, 12, 14, 15, 19]), Candidate: [2 2 1 0 0 2 0 0 2 0 1 1 0 2 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 145450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  1 -1  1 -1  0  0  1 -1  1  0  0 -1] (Indices: [2, 3, 4, 6, 9, 11, 15, 17, 18, 19]), Candidate: [2 2 1 0 0 2 0 0 2 0 1 0 1 1 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 145500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  1 -1  0  0  1 -1  1 -1  1  0  0 -1] (Indices: [2, 3, 4, 6, 9, 13, 15, 17, 18, 19]), Candidate: [2 2 1 0 0 2 0 0 2 0 0 1 2 0 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 145550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  0  1  0 -1  1  0 -1  0  1  0 -1  0] (Indices: [2, 3, 4, 6, 10, 11, 13, 14, 17, 18]), Candidate: [ 2  2  1  0  0  2  0  0  1  2  0  0  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 145600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  0  1 -1  1 -1  1  0  0 -1  0  1 -1] (Indices: [2, 3, 4, 6, 10, 12, 14, 15, 16, 19]), Candidate: [ 2  2  1  0  0  2  0  0  1  2 -1  2  0  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 145650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  0  0  1  0  0 -1  0  1  0  0 -1  0] (Indices: [2, 3, 4, 6, 11, 12, 13, 16, 17, 18]), Candidate: [2 2 1 0 0 2 0 0 1 1 1 1 1 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 145700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  0  0  0  1  0 -1  1  0  0  0 -1  0] (Indices: [2, 3, 4, 6, 12, 13, 15, 16, 17, 18]), Candidate: [2 2 1 0 0 2 0 0 1 1 0 2 1 0 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 145750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0  0  0 -1  1  0 -1  0  0  0  1 -1  0] (Indices: [2, 3, 4, 7, 8, 9, 10, 12, 13, 18]), Candidate: [ 2  2  1  0  0  1  2  0  1  1 -1  2  1  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 145800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0  0  0 -1  0  0  0  0  1 -1  1  0 -1] (Indices: [2, 3, 4, 7, 8, 9, 10, 16, 18, 19]), Candidate: [ 2  2  1  0  0  1  2  0  1  1 -1  1  1  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 145850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0  0 -1  1 -1  0  0  1  0 -1  0  1 -1] (Indices: [2, 3, 4, 7, 8, 9, 11, 15, 16, 19]), Candidate: [2 2 1 0 0 1 2 0 1 0 1 0 1 1 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 145900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0  0 -1  0  0  1  0 -1  0  1  0 -1  0] (Indices: [2, 3, 4, 7, 8, 9, 13, 14, 17, 18]), Candidate: [ 2  2  1  0  0  1  2  0  1  0  0  1  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 145950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0 -1  1  0 -1  1  0 -1  1 -1  0  0  0] (Indices: [2, 3, 4, 7, 8, 10, 11, 13, 14, 16]), Candidate: [ 2  2  1  0  0  1  2  0  0  2  0  0  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 146000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0 -1  1 -1  1 -1  1  0 -1  1 -1  0  0] (Indices: [2, 3, 4, 7, 8, 10, 12, 14, 15, 17]), Candidate: [ 2  2  1  0  0  1  2  0  0  2 -1  2  0  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 146050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0 -1  1 -1  0  0  0  1  0  0 -1  1 -1] (Indices: [2, 3, 4, 7, 8, 10, 15, 16, 17, 19]), Candidate: [ 2  2  1  0  0  1  2  0  0  2 -1  1  1  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 146100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0 -1  0  1 -1  1 -1  1  0 -1  1 -1  0] (Indices: [2, 3, 4, 7, 8, 11, 13, 15, 16, 18]), Candidate: [2 2 1 0 0 1 2 0 0 1 1 0 2 0 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 146150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0 -1  0  0  1 -1  1 -1  1  0  0 -1  0] (Indices: [2, 3, 4, 7, 8, 12, 14, 16, 17, 18]), Candidate: [ 2  2  1  0  0  1  2  0  0  1  0  2  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 146200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  1  0  0  0 -1  0  0  0  0  1  0 -1] (Indices: [2, 3, 4, 7, 9, 10, 11, 12, 18, 19]), Candidate: [ 2  2  1  0  0  1  2 -1  2  1  0  1  0  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 146250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  1  0 -1  1  0 -1  0  0  0  1  0 -1] (Indices: [2, 3, 4, 7, 9, 10, 12, 13, 18, 19]), Candidate: [ 2  2  1  0  0  1  2 -1  2  1 -1  2  1  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 146300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  1  0 -1  0  0  1 -1  0  1  0  0 -1] (Indices: [2, 3, 4, 7, 9, 10, 14, 17, 18, 19]), Candidate: [ 2  2  1  0  0  1  2 -1  2  1 -1  1  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 146350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  1 -1  1 -1  1  0 -1  0  0  1  0 -1] (Indices: [2, 3, 4, 7, 9, 11, 13, 14, 18, 19]), Candidate: [ 2  2  1  0  0  1  2 -1  2  0  1  0  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 146400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  1 -1  0  1 -1  1  0 -1  1 -1  1 -1] (Indices: [2, 3, 4, 7, 9, 12, 14, 15, 17, 19]), Candidate: [ 2  2  1  0  0  1  2 -1  2  0  0  2  0  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 146450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  0  1  0  0 -1  1  0 -1  0  0  1 -1] (Indices: [2, 3, 4, 7, 10, 11, 12, 14, 15, 19]), Candidate: [ 2  2  1  0  0  1  2 -1  1  2  0  1  0  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 146500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  0  1  0 -1  0  0  1 -1  1  0  0 -1] (Indices: [2, 3, 4, 7, 10, 11, 15, 17, 18, 19]), Candidate: [ 2  2  1  0  0  1  2 -1  1  2  0  0  1  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 146550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  0  1 -1  0  1 -1  1 -1  1  0  0 -1] (Indices: [2, 3, 4, 7, 10, 13, 15, 17, 18, 19]), Candidate: [ 2  2  1  0  0  1  2 -1  1  2 -1  1  2  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 146600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  0  0  1 -1  1  0 -1  1  0 -1  1 -1] (Indices: [2, 3, 4, 7, 11, 13, 14, 16, 17, 19]), Candidate: [ 2  2  1  0  0  1  2 -1  1  1  1  0  2  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 146650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1  0  0  0  0 -1  1 -1  0  1 -1  0  0] (Indices: [2, 3, 4, 8, 9, 10, 11, 12, 14, 17]), Candidate: [ 2  2  1  0  0  1  1  1  1  1  0  1  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 146700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1  0  0 -1  1  0  0 -1  0  1 -1  0  0] (Indices: [2, 3, 4, 8, 9, 10, 12, 13, 14, 17]), Candidate: [ 2  2  1  0  0  1  1  1  1  1 -1  2  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 146750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1  0  0 -1  0  1 -1  0  1  0 -1  1 -1] (Indices: [2, 3, 4, 8, 9, 10, 13, 16, 17, 19]), Candidate: [ 2  2  1  0  0  1  1  1  1  1 -1  1  2  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 146800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1  0 -1  1  0 -1  0  0  1  0 -1  1 -1] (Indices: [2, 3, 4, 8, 9, 11, 12, 16, 17, 19]), Candidate: [2 2 1 0 0 1 1 1 1 0 1 1 0 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 146850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1  0 -1  0  1  0 -1  1  0 -1  0  1 -1] (Indices: [2, 3, 4, 8, 9, 12, 13, 15, 16, 19]), Candidate: [2 2 1 0 0 1 1 1 1 0 0 2 1 0 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 146900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1 -1  1  0  0  0 -1  1 -1  1 -1  0  0] (Indices: [2, 3, 4, 8, 10, 11, 12, 13, 15, 17]), Candidate: [2 2 1 0 0 1 1 1 0 2 0 1 1 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 146950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1 -1  1  0 -1  0  1  0  0 -1  1 -1  0] (Indices: [2, 3, 4, 8, 10, 11, 14, 15, 16, 18]), Candidate: [2 2 1 0 0 1 1 1 0 2 0 0 1 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 147000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1 -1  1 -1  0  1  0  0  0 -1  1 -1  0] (Indices: [2, 3, 4, 8, 10, 13, 14, 15, 16, 18]), Candidate: [ 2  2  1  0  0  1  1  1  0  2 -1  1  2  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 147050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1 -1  0  1  0 -1  0  1  0  0  0 -1  0] (Indices: [2, 3, 4, 8, 11, 12, 15, 16, 17, 18]), Candidate: [2 2 1 0 0 1 1 1 0 1 1 1 0 1 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 147100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1 -1  0  0  0  1  0  0 -1  1  0  0 -1] (Indices: [2, 3, 4, 8, 13, 14, 15, 17, 18, 19]), Candidate: [2 2 1 0 0 1 1 1 0 1 0 1 2 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 147150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  1  0  0 -1  1 -1  1  0 -1  1 -1  0] (Indices: [2, 3, 4, 9, 10, 11, 13, 15, 16, 18]), Candidate: [2 2 1 0 0 1 1 0 2 1 0 0 2 0 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 147200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  1  0 -1  1 -1  1 -1  1  0  0 -1  0] (Indices: [2, 3, 4, 9, 10, 12, 14, 16, 17, 18]), Candidate: [ 2  2  1  0  0  1  1  0  2  1 -1  2  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 147250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  1 -1  1  0 -1  1  0  0  0 -1  0  0] (Indices: [2, 3, 4, 9, 11, 12, 14, 15, 16, 17]), Candidate: [2 2 1 0 0 1 1 0 2 0 1 1 0 2 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 147300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  1 -1  0  1  0 -1  0  1  0  0  0 -1] (Indices: [2, 3, 4, 9, 12, 13, 16, 17, 18, 19]), Candidate: [2 2 1 0 0 1 1 0 2 0 0 2 1 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 147350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  0  1  0 -1  1  0  0  0 -1  1 -1  0] (Indices: [2, 3, 4, 10, 11, 13, 14, 15, 16, 18]), Candidate: [2 2 1 0 0 1 1 0 1 2 0 0 2 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 147400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  0  0  1  0  0  0  0  0 -1  0  1 -1] (Indices: [2, 3, 4, 11, 12, 13, 14, 15, 16, 19]), Candidate: [2 2 1 0 0 1 1 0 1 1 1 1 1 1 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 147450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0  0  0 -1  0  1 -1  1 -1  0  0  0  0] (Indices: [2, 3, 5, 6, 7, 8, 9, 10, 13, 15]), Candidate: [ 2  2  1 -1  2  1  1  0  1  1 -1  1  2  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 147500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0  0 -1  0  1  0 -1  0  1 -1  0  0  0] (Indices: [2, 3, 5, 6, 7, 8, 9, 12, 13, 16]), Candidate: [ 2  2  1 -1  2  1  1  0  1  0  0  2  1  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 147550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0  0 -1  0  0  0  0  0  1  0  0 -1  0] (Indices: [2, 3, 5, 6, 7, 8, 9, 16, 17, 18]), Candidate: [ 2  2  1 -1  2  1  1  0  1  0  0  1  1  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 147600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0 -1  1 -1  1 -1  0  0  0  1  0 -1  0] (Indices: [2, 3, 5, 6, 7, 8, 10, 12, 17, 18]), Candidate: [ 2  2  1 -1  2  1  1  0  0  2 -1  2  0  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 147650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0 -1  0  1  0 -1  0  1 -1  1 -1  0  0] (Indices: [2, 3, 5, 6, 7, 8, 11, 12, 15, 17]), Candidate: [ 2  2  1 -1  2  1  1  0  0  1  1  1  0  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 147700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0 -1  0  0  1  0 -1  1 -1  1 -1  0  0] (Indices: [2, 3, 5, 6, 7, 8, 12, 13, 15, 17]), Candidate: [ 2  2  1 -1  2  1  1  0  0  1  0  2  1  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 147750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0 -1  0  0  0  0  1  0  0 -1  1 -1  0] (Indices: [2, 3, 5, 6, 7, 8, 14, 15, 16, 18]), Candidate: [ 2  2  1 -1  2  1  1  0  0  1  0  1  1  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 147800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  1  0 -1  1 -1  1 -1  0  1 -1  0  0] (Indices: [2, 3, 5, 6, 7, 9, 10, 12, 14, 17]), Candidate: [ 2  2  1 -1  2  1  1 -1  2  1 -1  2  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 147850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  1 -1  1  0  0 -1  0  1 -1  0  0  0] (Indices: [2, 3, 5, 6, 7, 9, 11, 12, 13, 16]), Candidate: [ 2  2  1 -1  2  1  1 -1  2  0  1  1  1  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 147900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  1 -1  1 -1  0  0  0  1  0  0 -1  0] (Indices: [2, 3, 5, 6, 7, 9, 11, 16, 17, 18]), Candidate: [ 2  2  1 -1  2  1  1 -1  2  0  1  0  1  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 147950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  1 -1  0  0  1 -1  1  0 -1  1 -1  0] (Indices: [2, 3, 5, 6, 7, 9, 13, 15, 16, 18]), Candidate: [ 2  2  1 -1  2  1  1 -1  2  0  0  1  2  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 148000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  0  1  0 -1  1 -1  1  0 -1  0  0  0] (Indices: [2, 3, 5, 6, 7, 10, 11, 13, 15, 16]), Candidate: [ 2  2  1 -1  2  1  1 -1  1  2  0  0  2  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 148050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  0  1 -1  1 -1  1 -1  1 -1  1 -1  0] (Indices: [2, 3, 5, 6, 7, 10, 12, 14, 16, 18]), Candidate: [ 2  2  1 -1  2  1  1 -1  1  2 -1  2  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 148100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  0  0  1  0  0  0  0 -1  0  0  0  0] (Indices: [2, 3, 5, 6, 7, 11, 12, 13, 14, 15]), Candidate: [ 2  2  1 -1  2  1  1 -1  1  1  1  1  1  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 148150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  0  0  1 -1  1 -1  1 -1  0  1  0 -1] (Indices: [2, 3, 5, 6, 7, 11, 13, 15, 18, 19]), Candidate: [ 2  2  1 -1  2  1  1 -1  1  1  1  0  2  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 148200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  0  0  0  1 -1  0  1  0  0  0 -1  0] (Indices: [2, 3, 5, 6, 7, 12, 15, 16, 17, 18]), Candidate: [ 2  2  1 -1  2  1  1 -1  1  1  0  2  0  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 148250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1  0  0  0 -1  0  0  0  1 -1  0  1 -1] (Indices: [2, 3, 5, 6, 8, 9, 10, 11, 16, 19]), Candidate: [ 2  2  1 -1  2  1  0  1  1  1  0  0  1  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 148300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1  0  0 -1  0  0  0  1  0  0 -1  0  0] (Indices: [2, 3, 5, 6, 8, 9, 10, 15, 16, 17]), Candidate: [ 2  2  1 -1  2  1  0  1  1  1 -1  1  1  1  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 148350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1  0 -1  1 -1  0  1 -1  1  0 -1  0  0] (Indices: [2, 3, 5, 6, 8, 9, 11, 14, 16, 17]), Candidate: [ 2  2  1 -1  2  1  0  1  1  0  1  0  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 148400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1  0 -1  0  1 -1  0  0  0  1  0  0 -1] (Indices: [2, 3, 5, 6, 8, 9, 12, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  1  0  1  1  0  0  2  0  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 148450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1 -1  1  0  0 -1  0  1 -1  0  0  1 -1] (Indices: [2, 3, 5, 6, 8, 10, 11, 12, 15, 19]), Candidate: [ 2  2  1 -1  2  1  0  1  0  2  0  1  0  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 148500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1 -1  1 -1  1  0 -1  1 -1  0  0  1 -1] (Indices: [2, 3, 5, 6, 8, 10, 12, 13, 15, 19]), Candidate: [ 2  2  1 -1  2  1  0  1  0  2 -1  2  1  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 148550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1 -1  1 -1  0  0  1  0 -1  1  0 -1  0] (Indices: [2, 3, 5, 6, 8, 10, 14, 15, 17, 18]), Candidate: [ 2  2  1 -1  2  1  0  1  0  2 -1  1  1  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 148600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1 -1  0  1 -1  1  0  0 -1  0  0  1 -1] (Indices: [2, 3, 5, 6, 8, 11, 13, 14, 15, 19]), Candidate: [ 2  2  1 -1  2  1  0  1  0  1  1  0  2  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 148650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1 -1  0  0  1  0 -1  0  1 -1  1  0 -1] (Indices: [2, 3, 5, 6, 8, 12, 13, 16, 18, 19]), Candidate: [ 2  2  1 -1  2  1  0  1  0  1  0  2  1  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 148700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  1  0  0  0 -1  0  1 -1  1 -1  0  0] (Indices: [2, 3, 5, 6, 9, 10, 11, 12, 15, 17]), Candidate: [ 2  2  1 -1  2  1  0  0  2  1  0  1  0  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 148750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  1  0 -1  1  0 -1  1 -1  1 -1  0  0] (Indices: [2, 3, 5, 6, 9, 10, 12, 13, 15, 17]), Candidate: [ 2  2  1 -1  2  1  0  0  2  1 -1  2  1  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 148800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  1  0 -1  0  0  1  0  0 -1  1 -1  0] (Indices: [2, 3, 5, 6, 9, 10, 14, 15, 16, 18]), Candidate: [ 2  2  1 -1  2  1  0  0  2  1 -1  1  1  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 148850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  1 -1  1 -1  1  0  0 -1  1 -1  0  0] (Indices: [2, 3, 5, 6, 9, 11, 13, 14, 15, 17]), Candidate: [ 2  2  1 -1  2  1  0  0  2  0  1  0  2  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 148900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  1 -1  0  1  0 -1  0  1  0  0 -1  0] (Indices: [2, 3, 5, 6, 9, 12, 13, 16, 17, 18]), Candidate: [ 2  2  1 -1  2  1  0  0  2  0  0  2  1  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 148950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  0  1  0  0  0 -1  0  1 -1  1 -1  0] (Indices: [2, 3, 5, 6, 10, 11, 12, 13, 16, 18]), Candidate: [ 2  2  1 -1  2  1  0  0  1  2  0  1  1  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 149000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  0  1  0 -1  0  1  0 -1  0  1  0 -1] (Indices: [2, 3, 5, 6, 10, 11, 14, 15, 18, 19]), Candidate: [ 2  2  1 -1  2  1  0  0  1  2  0  0  1  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 149050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  0  1 -1  0  1  0  0 -1  0  1  0 -1] (Indices: [2, 3, 5, 6, 10, 13, 14, 15, 18, 19]), Candidate: [ 2  2  1 -1  2  1  0  0  1  2 -1  1  2  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 149100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  0  0  1  0 -1  0  0  1  0  0  0 -1] (Indices: [2, 3, 5, 6, 11, 12, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  1  0  0  1  1  1  1  0  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 149150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0  0  0  0  0  0 -1  0  0  0  0  0  0] (Indices: [2, 3, 5, 7, 8, 9, 10, 11, 12, 13]), Candidate: [ 2  2  1 -1  2  0  2  0  1  1  0  1  1  0  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 149200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0  0  0 -1  0  1  0 -1  1 -1  0  0  0] (Indices: [2, 3, 5, 7, 8, 9, 10, 13, 14, 16]), Candidate: [ 2  2  1 -1  2  0  2  0  1  1 -1  1  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 149250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0  0 -1  1  0 -1  0  0  1 -1  1 -1  0] (Indices: [2, 3, 5, 7, 8, 9, 11, 12, 16, 18]), Candidate: [ 2  2  1 -1  2  0  2  0  1  0  1  1  0  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 149300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0  0 -1  0  1  0 -1  0  1 -1  1 -1  0] (Indices: [2, 3, 5, 7, 8, 9, 12, 13, 16, 18]), Candidate: [ 2  2  1 -1  2  0  2  0  1  0  0  2  1  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 149350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0  0 -1  0  0  0  1  0 -1  0  1  0 -1] (Indices: [2, 3, 5, 7, 8, 9, 14, 15, 18, 19]), Candidate: [ 2  2  1 -1  2  0  2  0  1  0  0  1  1  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 149400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0 -1  1  0 -1  0  1 -1  1  0 -1  0  0] (Indices: [2, 3, 5, 7, 8, 10, 11, 14, 16, 17]), Candidate: [ 2  2  1 -1  2  0  2  0  0  2  0  0  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 149450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0 -1  1 -1  1 -1  0  0  0  1  0  0 -1] (Indices: [2, 3, 5, 7, 8, 10, 12, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  0  2  0  0  2 -1  2  0  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 149500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0 -1  0  1  0  0 -1  0  0  0  1  0 -1] (Indices: [2, 3, 5, 7, 8, 11, 12, 13, 18, 19]), Candidate: [ 2  2  1 -1  2  0  2  0  0  1  1  1  1  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 149550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0 -1  0  1 -1  0  1 -1  0  1  0  0 -1] (Indices: [2, 3, 5, 7, 8, 11, 14, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  0  2  0  0  1  1  0  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 149600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0 -1  0  0  0  1  0 -1  0  1  0  0 -1] (Indices: [2, 3, 5, 7, 8, 13, 14, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  0  2  0  0  1  0  1  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 149650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  1  0  0 -1  0  1  0 -1  0  1 -1  0] (Indices: [2, 3, 5, 7, 9, 10, 11, 14, 15, 18]), Candidate: [ 2  2  1 -1  2  0  2 -1  2  1  0  0  1  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 149700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  1  0 -1  1 -1  0  0  1  0 -1  1 -1] (Indices: [2, 3, 5, 7, 9, 10, 12, 16, 17, 19]), Candidate: [ 2  2  1 -1  2  0  2 -1  2  1 -1  2  0  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 149750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  1 -1  1  0  0 -1  0  0  1  0 -1  0] (Indices: [2, 3, 5, 7, 9, 11, 12, 13, 17, 18]), Candidate: [ 2  2  1 -1  2  0  2 -1  2  0  1  1  1  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 149800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  1 -1  1 -1  0  1 -1  1  0 -1  1 -1] (Indices: [2, 3, 5, 7, 9, 11, 14, 16, 17, 19]), Candidate: [ 2  2  1 -1  2  0  2 -1  2  0  1  0  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 149850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  1 -1  0  0  1  0 -1  1  0 -1  1 -1] (Indices: [2, 3, 5, 7, 9, 13, 14, 16, 17, 19]), Candidate: [ 2  2  1 -1  2  0  2 -1  2  0  0  1  2  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 149900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  0  1  0 -1  1  0  0 -1  1 -1  0  0] (Indices: [2, 3, 5, 7, 10, 11, 13, 14, 15, 17]), Candidate: [ 2  2  1 -1  2  0  2 -1  1  2  0  0  2  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 149950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  0  1 -1  1  0 -1  0  1  0  0 -1  0] (Indices: [2, 3, 5, 7, 10, 12, 13, 16, 17, 18]), Candidate: [ 2  2  1 -1  2  0  2 -1  1  2 -1  2  1  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 150000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  0  0  1  0  0 -1  1  0  0 -1  0  0] (Indices: [2, 3, 5, 7, 11, 12, 13, 15, 16, 17]), Candidate: [ 2  2  1 -1  2  0  2 -1  1  1  1  1  1  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 150050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  0  0  0  1  0  0  0 -1  1 -1  1 -1] (Indices: [2, 3, 5, 7, 12, 13, 14, 15, 17, 19]), Candidate: [ 2  2  1 -1  2  0  2 -1  1  1  0  2  1  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 150100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1  0  0  0 -1  1 -1  1  0 -1  0  0  0] (Indices: [2, 3, 5, 8, 9, 10, 11, 13, 15, 16]), Candidate: [ 2  2  1 -1  2  0  1  1  1  1  0  0  2  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 150150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1  0  0 -1  1 -1  1 -1  1 -1  1 -1  0] (Indices: [2, 3, 5, 8, 9, 10, 12, 14, 16, 18]), Candidate: [ 2  2  1 -1  2  0  1  1  1  1 -1  2  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 150200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1  0 -1  1  0  0  0  0 -1  0  0  0  0] (Indices: [2, 3, 5, 8, 9, 11, 12, 13, 14, 15]), Candidate: [ 2  2  1 -1  2  0  1  1  1  0  1  1  1  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 150250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1  0 -1  1 -1  1 -1  1 -1  0  1  0 -1] (Indices: [2, 3, 5, 8, 9, 11, 13, 15, 18, 19]), Candidate: [ 2  2  1 -1  2  0  1  1  1  0  1  0  2  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 150300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1  0 -1  0  1 -1  0  1  0  0  0 -1  0] (Indices: [2, 3, 5, 8, 9, 12, 15, 16, 17, 18]), Candidate: [ 2  2  1 -1  2  0  1  1  1  0  0  2  0  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 150350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1 -1  1  0  0 -1  1 -1  0  0  1  0 -1] (Indices: [2, 3, 5, 8, 10, 11, 12, 14, 18, 19]), Candidate: [ 2  2  1 -1  2  0  1  1  0  2  0  1  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 150400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1 -1  1 -1  1  0  0 -1  1  0 -1  0  0] (Indices: [2, 3, 5, 8, 10, 12, 13, 14, 16, 17]), Candidate: [ 2  2  1 -1  2  0  1  1  0  2 -1  2  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 150450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1 -1  1 -1  0  0  1 -1  1  0  0  0 -1] (Indices: [2, 3, 5, 8, 10, 14, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  0  1  1  0  2 -1  1  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 150500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1 -1  0  1 -1  1 -1  1 -1  1  0  0 -1] (Indices: [2, 3, 5, 8, 11, 13, 15, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  0  1  1  0  1  1  0  2  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 150550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  1  0  0  0  0 -1  0  0  0  1  0 -1] (Indices: [2, 3, 5, 9, 10, 11, 12, 13, 18, 19]), Candidate: [ 2  2  1 -1  2  0  1  0  2  1  0  1  1  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 150600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  1  0  0 -1  0  1 -1  0  1  0  0 -1] (Indices: [2, 3, 5, 9, 10, 11, 14, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  0  1  0  2  1  0  0  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 150650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  1  0 -1  0  1  0 -1  0  1  0  0 -1] (Indices: [2, 3, 5, 9, 10, 13, 14, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  0  1  0  2  1 -1  1  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 150700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  1 -1  1 -1  1  0  0 -1  1  0 -1  0] (Indices: [2, 3, 5, 9, 11, 13, 14, 15, 17, 18]), Candidate: [ 2  2  1 -1  2  0  1  0  2  0  1  0  2  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 150750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  0  1  0  0  0  0 -1  1  0 -1  0  0] (Indices: [2, 3, 5, 10, 11, 12, 13, 14, 16, 17]), Candidate: [ 2  2  1 -1  2  0  1  0  1  2  0  1  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 150800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  0  1  0 -1  0  1 -1  1  0  0  0 -1] (Indices: [2, 3, 5, 10, 11, 14, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  0  1  0  1  2  0  0  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 150850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  0  0  1  0 -1  0  1  0  0  0  0 -1] (Indices: [2, 3, 5, 11, 12, 15, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  0  1  0  1  1  1  1  0  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 150900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0  0  0 -1  1 -1  1  0 -1  0  0  0  0] (Indices: [2, 3, 6, 7, 8, 9, 10, 12, 14, 15]), Candidate: [ 2  2  1 -1  1  2  1  0  1  1 -1  2  0  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 150950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0  0 -1  1  0  0  0 -1  0  0  0  0  0] (Indices: [2, 3, 6, 7, 8, 9, 11, 12, 13, 14]), Candidate: [ 2  2  1 -1  1  2  1  0  1  0  1  1  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 151000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0  0 -1  1 -1  0  0  1 -1  1 -1  1 -1] (Indices: [2, 3, 6, 7, 8, 9, 11, 15, 17, 19]), Candidate: [ 2  2  1 -1  1  2  1  0  1  0  1  0  1  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 151050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0  0 -1  0  0  1  0 -1  0  0  1  0 -1] (Indices: [2, 3, 6, 7, 8, 9, 13, 14, 18, 19]), Candidate: [ 2  2  1 -1  1  2  1  0  1  0  0  1  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 151100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0 -1  1  0 -1  1  0 -1  0  0  1 -1  0] (Indices: [2, 3, 6, 7, 8, 10, 11, 13, 14, 18]), Candidate: [ 2  2  1 -1  1  2  1  0  0  2  0  0  2  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 151150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0 -1  1 -1  1 -1  1  0 -1  0  0  1 -1] (Indices: [2, 3, 6, 7, 8, 10, 12, 14, 15, 19]), Candidate: [ 2  2  1 -1  1  2  1  0  0  2 -1  2  0  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 151200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0 -1  1 -1  0  0  0  1 -1  1  0  0 -1] (Indices: [2, 3, 6, 7, 8, 10, 15, 17, 18, 19]), Candidate: [ 2  2  1 -1  1  2  1  0  0  2 -1  1  1  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 151250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0 -1  0  1 -1  1 -1  1 -1  1  0 -1  0] (Indices: [2, 3, 6, 7, 8, 11, 13, 15, 17, 18]), Candidate: [ 2  2  1 -1  1  2  1  0  0  1  1  0  2  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 151300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0 -1  0  0  1 -1  1 -1  1 -1  1  0 -1] (Indices: [2, 3, 6, 7, 8, 12, 14, 16, 18, 19]), Candidate: [ 2  2  1 -1  1  2  1  0  0  1  0  2  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 151350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  1  0  0 -1  1  0 -1  1 -1  0  0  0] (Indices: [2, 3, 6, 7, 9, 10, 11, 13, 14, 16]), Candidate: [ 2  2  1 -1  1  2  1 -1  2  1  0  0  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 151400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  1  0 -1  1 -1  1  0 -1  1 -1  0  0] (Indices: [2, 3, 6, 7, 9, 10, 12, 14, 15, 17]), Candidate: [ 2  2  1 -1  1  2  1 -1  2  1 -1  2  0  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 151450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  1  0 -1  0  0  0  1  0  0 -1  1 -1] (Indices: [2, 3, 6, 7, 9, 10, 15, 16, 17, 19]), Candidate: [ 2  2  1 -1  1  2  1 -1  2  1 -1  1  1  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 151500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  1 -1  1 -1  1 -1  1  0 -1  1 -1  0] (Indices: [2, 3, 6, 7, 9, 11, 13, 15, 16, 18]), Candidate: [ 2  2  1 -1  1  2  1 -1  2  0  1  0  2  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 151550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  1 -1  0  1 -1  1 -1  1  0  0 -1  0] (Indices: [2, 3, 6, 7, 9, 12, 14, 16, 17, 18]), Candidate: [ 2  2  1 -1  1  2  1 -1  2  0  0  2  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 151600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  0  1  0  0 -1  1 -1  1 -1  1 -1  0] (Indices: [2, 3, 6, 7, 10, 11, 12, 14, 16, 18]), Candidate: [ 2  2  1 -1  1  2  1 -1  1  2  0  1  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 151650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  0  1 -1  1  0  0  0  0 -1  0  0  0] (Indices: [2, 3, 6, 7, 10, 12, 13, 14, 15, 16]), Candidate: [ 2  2  1 -1  1  2  1 -1  1  2 -1  2  1  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 151700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  0  1 -1  0  0  1  0  0  0  0 -1  0] (Indices: [2, 3, 6, 7, 10, 14, 15, 16, 17, 18]), Candidate: [ 2  2  1 -1  1  2  1 -1  1  2 -1  1  1  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 151750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  0  0  1 -1  1  0 -1  0  1  0  0 -1] (Indices: [2, 3, 6, 7, 11, 13, 14, 17, 18, 19]), Candidate: [ 2  2  1 -1  1  2  1 -1  1  1  1  0  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 151800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1  0  0  0  0 -1  1 -1  0  0  0  1 -1] (Indices: [2, 3, 6, 8, 9, 10, 11, 12, 14, 19]), Candidate: [ 2  2  1 -1  1  2  0  1  1  1  0  1  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 151850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1  0  0 -1  1  0  0 -1  0  0  0  1 -1] (Indices: [2, 3, 6, 8, 9, 10, 12, 13, 14, 19]), Candidate: [ 2  2  1 -1  1  2  0  1  1  1 -1  2  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 151900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1  0  0 -1  0  1 -1  0  0  1  0  0 -1] (Indices: [2, 3, 6, 8, 9, 10, 13, 17, 18, 19]), Candidate: [ 2  2  1 -1  1  2  0  1  1  1 -1  1  2  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 151950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1  0 -1  1  0 -1  0  0  0  1  0  0 -1] (Indices: [2, 3, 6, 8, 9, 11, 12, 17, 18, 19]), Candidate: [ 2  2  1 -1  1  2  0  1  1  0  1  1  0  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 152000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1  0 -1  0  1  0 -1  1 -1  1 -1  1 -1] (Indices: [2, 3, 6, 8, 9, 12, 13, 15, 17, 19]), Candidate: [ 2  2  1 -1  1  2  0  1  1  0  0  2  1  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 152050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1 -1  1  0  0  0 -1  1 -1  0  0  1 -1] (Indices: [2, 3, 6, 8, 10, 11, 12, 13, 15, 19]), Candidate: [ 2  2  1 -1  1  2  0  1  0  2  0  1  1  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 152100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1 -1  1  0 -1  0  1  0 -1  1  0 -1  0] (Indices: [2, 3, 6, 8, 10, 11, 14, 15, 17, 18]), Candidate: [ 2  2  1 -1  1  2  0  1  0  2  0  0  1  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 152150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1 -1  1 -1  0  1  0  0 -1  1  0 -1  0] (Indices: [2, 3, 6, 8, 10, 13, 14, 15, 17, 18]), Candidate: [ 2  2  1 -1  1  2  0  1  0  2 -1  1  2  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 152200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1 -1  0  1  0 -1  0  1  0 -1  1  0 -1] (Indices: [2, 3, 6, 8, 11, 12, 15, 16, 18, 19]), Candidate: [ 2  2  1 -1  1  2  0  1  0  1  1  1  0  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 152250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1 -1  0  0  0  1 -1  1  0  0  0  0 -1] (Indices: [2, 3, 6, 8, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  1  2  0  1  0  1  0  1  2  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 152300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  1  0  0 -1  1 -1  1 -1  1  0 -1  0] (Indices: [2, 3, 6, 9, 10, 11, 13, 15, 17, 18]), Candidate: [ 2  2  1 -1  1  2  0  0  2  1  0  0  2  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 152350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  1  0 -1  1 -1  1 -1  1 -1  1  0 -1] (Indices: [2, 3, 6, 9, 10, 12, 14, 16, 18, 19]), Candidate: [ 2  2  1 -1  1  2  0  0  2  1 -1  2  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 152400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  1 -1  1  0 -1  1  0  0 -1  0  1 -1] (Indices: [2, 3, 6, 9, 11, 12, 14, 15, 16, 19]), Candidate: [ 2  2  1 -1  1  2  0  0  2  0  1  1  0  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 152450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  1 -1  0  1 -1  1  0  0  0 -1  1 -1] (Indices: [2, 3, 6, 9, 12, 14, 15, 16, 17, 19]), Candidate: [ 2  2  1 -1  1  2  0  0  2  0  0  2  0  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 152500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  0  1  0 -1  1  0  0 -1  1  0 -1  0] (Indices: [2, 3, 6, 10, 11, 13, 14, 15, 17, 18]), Candidate: [ 2  2  1 -1  1  2  0  0  1  2  0  0  2  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 152550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  0  0  1  0  0  0  0 -1  1 -1  1 -1] (Indices: [2, 3, 6, 11, 12, 13, 14, 15, 17, 19]), Candidate: [ 2  2  1 -1  1  2  0  0  1  1  1  1  1  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 152600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0  0  0  0  0 -1  0  0  0  1  0 -1  0] (Indices: [2, 3, 7, 8, 9, 10, 11, 12, 17, 18]), Candidate: [ 2  2  1 -1  1  1  2  0  1  1  0  1  0  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 152650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0  0  0 -1  1  0 -1  0  0  1  0 -1  0] (Indices: [2, 3, 7, 8, 9, 10, 12, 13, 17, 18]), Candidate: [ 2  2  1 -1  1  1  2  0  1  1 -1  2  1  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 152700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0  0  0 -1  0  0  1 -1  1  0 -1  1 -1] (Indices: [2, 3, 7, 8, 9, 10, 14, 16, 17, 19]), Candidate: [ 2  2  1 -1  1  1  2  0  1  1 -1  1  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 152750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0  0 -1  1 -1  1  0 -1  0  1  0 -1  0] (Indices: [2, 3, 7, 8, 9, 11, 13, 14, 17, 18]), Candidate: [ 2  2  1 -1  1  1  2  0  1  0  1  0  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 152800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0  0 -1  0  1 -1  1  0  0 -1  0  1 -1] (Indices: [2, 3, 7, 8, 9, 12, 14, 15, 16, 19]), Candidate: [ 2  2  1 -1  1  1  2  0  1  0  0  2  0  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 152850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0 -1  1  0  0 -1  1  0 -1  1 -1  0  0] (Indices: [2, 3, 7, 8, 10, 11, 12, 14, 15, 17]), Candidate: [ 2  2  1 -1  1  1  2  0  0  2  0  1  0  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 152900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0 -1  1  0 -1  0  0  1  0  0 -1  1 -1] (Indices: [2, 3, 7, 8, 10, 11, 15, 16, 17, 19]), Candidate: [ 2  2  1 -1  1  1  2  0  0  2  0  0  1  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 152950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0 -1  1 -1  0  1 -1  1  0  0 -1  1 -1] (Indices: [2, 3, 7, 8, 10, 13, 15, 16, 17, 19]), Candidate: [ 2  2  1 -1  1  1  2  0  0  2 -1  1  2  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 153000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0 -1  0  1 -1  1  0  0 -1  0  1  0 -1] (Indices: [2, 3, 7, 8, 11, 13, 14, 15, 18, 19]), Candidate: [ 2  2  1 -1  1  1  2  0  0  1  1  0  2  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 153050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  1  0  0  0  0 -1  1 -1  1 -1  0  0] (Indices: [2, 3, 7, 9, 10, 11, 12, 13, 15, 17]), Candidate: [ 2  2  1 -1  1  1  2 -1  2  1  0  1  1  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 153100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  1  0  0 -1  0  1  0  0 -1  1 -1  0] (Indices: [2, 3, 7, 9, 10, 11, 14, 15, 16, 18]), Candidate: [ 2  2  1 -1  1  1  2 -1  2  1  0  0  1  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 153150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  1  0 -1  0  1  0  0  0 -1  1 -1  0] (Indices: [2, 3, 7, 9, 10, 13, 14, 15, 16, 18]), Candidate: [ 2  2  1 -1  1  1  2 -1  2  1 -1  1  2  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 153200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  1 -1  1  0 -1  0  1  0  0  0 -1  0] (Indices: [2, 3, 7, 9, 11, 12, 15, 16, 17, 18]), Candidate: [ 2  2  1 -1  1  1  2 -1  2  0  1  1  0  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 153250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  1 -1  0  0  1  0  0 -1  1  0  0 -1] (Indices: [2, 3, 7, 9, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  2  1 -1  1  1  2 -1  2  0  0  1  2  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 153300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  0  1  0 -1  1 -1  1  0  0 -1  1 -1] (Indices: [2, 3, 7, 10, 11, 13, 15, 16, 17, 19]), Candidate: [ 2  2  1 -1  1  1  2 -1  1  2  0  0  2  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 153350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  0  0  1  0  0 -1  1  0 -1  1  0 -1] (Indices: [2, 3, 7, 11, 12, 13, 15, 16, 18, 19]), Candidate: [ 2  2  1 -1  1  1  2 -1  1  1  1  1  1  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 153400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1  0  0  0  0 -1  0  1  0 -1  1 -1  0] (Indices: [2, 3, 8, 9, 10, 11, 12, 15, 16, 18]), Candidate: [ 2  2  1 -1  1  1  1  1  1  1  0  1  0  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 153450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1  0  0 -1  1  0  0 -1  1 -1  0  1 -1] (Indices: [2, 3, 8, 9, 10, 12, 13, 14, 16, 19]), Candidate: [ 2  2  1 -1  1  1  1  1  1  1 -1  2  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 153500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1  0 -1  1  0  0  0  0  0 -1  0  0  0] (Indices: [2, 3, 8, 9, 11, 12, 13, 14, 15, 16]), Candidate: [ 2  2  1 -1  1  1  1  1  1  0  1  1  1  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 153550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1  0 -1  1 -1  0  1  0  0  0  0 -1  0] (Indices: [2, 3, 8, 9, 11, 14, 15, 16, 17, 18]), Candidate: [ 2  2  1 -1  1  1  1  1  1  0  1  0  1  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 153600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1 -1  1  0  0  0 -1  0  1  0  0 -1  0] (Indices: [2, 3, 8, 10, 11, 12, 13, 16, 17, 18]), Candidate: [ 2  2  1 -1  1  1  1  1  0  2  0  1  1  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 153650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1 -1  1 -1  1  0 -1  1  0  0  0 -1  0] (Indices: [2, 3, 8, 10, 12, 13, 15, 16, 17, 18]), Candidate: [ 2  2  1 -1  1  1  1  1  0  2 -1  2  1  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 153700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1 -1  0  0  1  0  0 -1  1  0  0  0 -1] (Indices: [2, 3, 8, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  1  1  1  1  0  1  0  2  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 153750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  1  0  0 -1  1 -1  1  0  0 -1  1 -1] (Indices: [2, 3, 9, 10, 11, 13, 15, 16, 17, 19]), Candidate: [ 2  2  1 -1  1  1  1  0  2  1  0  0  2  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 153800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  1 -1  1  0  0 -1  1  0 -1  1  0 -1] (Indices: [2, 3, 9, 11, 12, 13, 15, 16, 18, 19]), Candidate: [ 2  2  1 -1  1  1  1  0  2  0  1  1  1  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 153850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  0  1  0 -1  1 -1  1  0  0  0  0 -1] (Indices: [2, 3, 10, 11, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  1  1  1  0  1  2  0  0  2  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 153900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0  0  0 -1  0  0  0  0  1 -1  1 -1  0] (Indices: [2, 4, 5, 6, 7, 8, 9, 10, 16, 18]), Candidate: [ 2  2  0  1  1  1  1  0  1  1 -1  1  1  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 153950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0  0 -1  0  1 -1  0  0  1 -1  0  1 -1] (Indices: [2, 4, 5, 6, 7, 8, 9, 12, 16, 19]), Candidate: [2 2 0 1 1 1 1 0 1 0 0 2 0 1 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 154000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0 -1  1  0 -1  1 -1  0  0  0  1 -1  0] (Indices: [2, 4, 5, 6, 7, 8, 10, 11, 13, 18]), Candidate: [2 2 0 1 1 1 1 0 0 2 0 0 2 0 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 154050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0 -1  1 -1  0  1 -1  0  0  1  0 -1  0] (Indices: [2, 4, 5, 6, 7, 8, 10, 13, 17, 18]), Candidate: [ 2  2  0  1  1  1  1  0  0  2 -1  1  2  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 154100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0 -1  0  1 -1  1 -1  1 -1  1 -1  0  0] (Indices: [2, 4, 5, 6, 7, 8, 11, 13, 15, 17]), Candidate: [2 2 0 1 1 1 1 0 0 1 1 0 2 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 154150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0 -1  0  0  1 -1  1 -1  1 -1  0  1 -1] (Indices: [2, 4, 5, 6, 7, 8, 12, 14, 16, 19]), Candidate: [ 2  2  0  1  1  1  1  0  0  1  0  2  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 154200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  1  0  0  0 -1  1 -1  0  0  0  0  0] (Indices: [2, 4, 5, 6, 7, 9, 10, 11, 12, 14]), Candidate: [ 2  2  0  1  1  1  1 -1  2  1  0  1  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 154250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  1  0 -1  0  1  0 -1  0  1 -1  0  0] (Indices: [2, 4, 5, 6, 7, 9, 10, 13, 14, 17]), Candidate: [ 2  2  0  1  1  1  1 -1  2  1 -1  1  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 154300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  1 -1  1  0 -1  0  0  1 -1  0  1 -1] (Indices: [2, 4, 5, 6, 7, 9, 11, 12, 16, 19]), Candidate: [ 2  2  0  1  1  1  1 -1  2  0  1  1  0  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 154350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  1 -1  0  1  0 -1  0  1 -1  0  1 -1] (Indices: [2, 4, 5, 6, 7, 9, 12, 13, 16, 19]), Candidate: [ 2  2  0  1  1  1  1 -1  2  0  0  2  1  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 154400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  1 -1  0  0  0  1 -1  1  0  0 -1  0] (Indices: [2, 4, 5, 6, 7, 9, 14, 16, 17, 18]), Candidate: [ 2  2  0  1  1  1  1 -1  2  0  0  1  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 154450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  0  1  0 -1  0  1 -1  1 -1  1 -1  0] (Indices: [2, 4, 5, 6, 7, 10, 11, 14, 16, 18]), Candidate: [ 2  2  0  1  1  1  1 -1  1  2  0  0  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 154500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  0  1 -1  0  1  0  0  0 -1  0  0  0] (Indices: [2, 4, 5, 6, 7, 10, 13, 14, 15, 16]), Candidate: [ 2  2  0  1  1  1  1 -1  1  2 -1  1  2  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 154550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  0  0  1  0 -1  1  0  0 -1  0  0  0] (Indices: [2, 4, 5, 6, 7, 11, 12, 14, 15, 16]), Candidate: [ 2  2  0  1  1  1  1 -1  1  1  1  1  0  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 154600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  0  0  1 -1  0  0  1  0  0  0 -1  0] (Indices: [2, 4, 5, 6, 7, 11, 15, 16, 17, 18]), Candidate: [ 2  2  0  1  1  1  1 -1  1  1  1  0  1  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 154650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  0  0  0  0  1 -1  1  0  0  0 -1  0] (Indices: [2, 4, 5, 6, 7, 13, 15, 16, 17, 18]), Candidate: [ 2  2  0  1  1  1  1 -1  1  1  0  1  2  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 154700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1  0  0 -1  1 -1  0  1  0 -1  0  0  0] (Indices: [2, 4, 5, 6, 8, 9, 10, 12, 15, 16]), Candidate: [ 2  2  0  1  1  1  0  1  1  1 -1  2  0  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 154750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1  0 -1  1  0  0 -1  0  0  0  0  1 -1] (Indices: [2, 4, 5, 6, 8, 9, 11, 12, 13, 19]), Candidate: [2 2 0 1 1 1 0 1 1 0 1 1 1 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 154800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1  0 -1  1 -1  0  0  0  0  1  0  0 -1] (Indices: [2, 4, 5, 6, 8, 9, 11, 17, 18, 19]), Candidate: [2 2 0 1 1 1 0 1 1 0 1 0 1 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 154850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1  0 -1  0  0  1 -1  1 -1  1 -1  1 -1] (Indices: [2, 4, 5, 6, 8, 9, 13, 15, 17, 19]), Candidate: [2 2 0 1 1 1 0 1 1 0 0 1 2 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 154900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1 -1  1  0 -1  1 -1  1 -1  0  0  1 -1] (Indices: [2, 4, 5, 6, 8, 10, 11, 13, 15, 19]), Candidate: [2 2 0 1 1 1 0 1 0 2 0 0 2 0 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 154950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1 -1  1 -1  1 -1  1 -1  0  1 -1  1 -1] (Indices: [2, 4, 5, 6, 8, 10, 12, 14, 17, 19]), Candidate: [ 2  2  0  1  1  1  0  1  0  2 -1  2  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 155000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1 -1  0  1  0  0  0 -1  0  0  1 -1  0] (Indices: [2, 4, 5, 6, 8, 11, 12, 13, 14, 18]), Candidate: [ 2  2  0  1  1  1  0  1  0  1  1  1  1  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 155050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1 -1  0  1 -1  1 -1  0  1 -1  1  0 -1] (Indices: [2, 4, 5, 6, 8, 11, 13, 16, 18, 19]), Candidate: [2 2 0 1 1 1 0 1 0 1 1 0 2 0 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 155100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1 -1  0  0  1 -1  0  1 -1  1  0  0 -1] (Indices: [2, 4, 5, 6, 8, 12, 15, 17, 18, 19]), Candidate: [2 2 0 1 1 1 0 1 0 1 0 2 0 1 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 155150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  1  0  0 -1  1 -1  1 -1  1 -1  0  0] (Indices: [2, 4, 5, 6, 9, 10, 11, 13, 15, 17]), Candidate: [2 2 0 1 1 1 0 0 2 1 0 0 2 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 155200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  1  0 -1  1 -1  1 -1  1 -1  0  1 -1] (Indices: [2, 4, 5, 6, 9, 10, 12, 14, 16, 19]), Candidate: [ 2  2  0  1  1  1  0  0  2  1 -1  2  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 155250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  1 -1  1  0  0  0 -1  1 -1  0  0  0] (Indices: [2, 4, 5, 6, 9, 11, 12, 13, 14, 16]), Candidate: [ 2  2  0  1  1  1  0  0  2  0  1  1  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 155300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  1 -1  1 -1  1 -1  0  1  0  0 -1  0] (Indices: [2, 4, 5, 6, 9, 11, 13, 16, 17, 18]), Candidate: [2 2 0 1 1 1 0 0 2 0 1 0 2 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 155350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  1 -1  0  1 -1  0  1  0  0 -1  1 -1] (Indices: [2, 4, 5, 6, 9, 12, 15, 16, 17, 19]), Candidate: [2 2 0 1 1 1 0 0 2 0 0 2 0 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 155400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  0  1  0  0 -1  0  1  0  0 -1  0  0] (Indices: [2, 4, 5, 6, 10, 11, 12, 15, 16, 17]), Candidate: [2 2 0 1 1 1 0 0 1 2 0 1 0 1 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 155450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  0  1 -1  1  0  0 -1  1 -1  1 -1  0] (Indices: [2, 4, 5, 6, 10, 12, 13, 14, 16, 18]), Candidate: [ 2  2  0  1  1  1  0  0  1  2 -1  2  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 155500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  0  1 -1  0  0  0  1  0  0  0  0 -1] (Indices: [2, 4, 5, 6, 10, 15, 16, 17, 18, 19]), Candidate: [ 2  2  0  1  1  1  0  0  1  2 -1  1  1  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 155550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  0  0  1 -1  1 -1  0  1  0  0  0 -1] (Indices: [2, 4, 5, 6, 11, 13, 16, 17, 18, 19]), Candidate: [2 2 0 1 1 1 0 0 1 1 1 0 2 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 155600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0  0  0  0 -1  0  1 -1  0  1 -1  0  0] (Indices: [2, 4, 5, 7, 8, 9, 10, 11, 14, 17]), Candidate: [ 2  2  0  1  1  0  2  0  1  1  0  0  1  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 155650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0  0  0 -1  0  0  1  0 -1  1 -1  0  0] (Indices: [2, 4, 5, 7, 8, 9, 10, 14, 15, 17]), Candidate: [ 2  2  0  1  1  0  2  0  1  1 -1  1  1  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 155700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0  0 -1  1 -1  1 -1  0  1 -1  1 -1  0] (Indices: [2, 4, 5, 7, 8, 9, 11, 13, 16, 18]), Candidate: [2 2 0 1 1 0 2 0 1 0 1 0 2 0 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 155750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0  0 -1  0  1 -1  0  1  0  0 -1  0  0] (Indices: [2, 4, 5, 7, 8, 9, 12, 15, 16, 17]), Candidate: [2 2 0 1 1 0 2 0 1 0 0 2 0 1 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 155800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0 -1  1  0  0  0 -1  0  0  0  0  1 -1] (Indices: [2, 4, 5, 7, 8, 10, 11, 12, 13, 19]), Candidate: [2 2 0 1 1 0 2 0 0 2 0 1 1 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 155850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0 -1  1  0 -1  0  0  0  0  1  0  0 -1] (Indices: [2, 4, 5, 7, 8, 10, 11, 17, 18, 19]), Candidate: [2 2 0 1 1 0 2 0 0 2 0 0 1 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 155900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0 -1  1 -1  0  1 -1  1 -1  1 -1  1 -1] (Indices: [2, 4, 5, 7, 8, 10, 13, 15, 17, 19]), Candidate: [ 2  2  0  1  1  0  2  0  0  2 -1  1  2  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 155950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0 -1  0  1  0 -1  0  1 -1  1 -1  1 -1] (Indices: [2, 4, 5, 7, 8, 11, 12, 15, 17, 19]), Candidate: [2 2 0 1 1 0 2 0 0 1 1 1 0 1 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 156000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0 -1  0  0  1  0  0 -1  0  0  1  0 -1] (Indices: [2, 4, 5, 7, 8, 12, 13, 14, 18, 19]), Candidate: [ 2  2  0  1  1  0  2  0  0  1  0  2  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 156050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  1  0  0  0  0 -1  0  0  1 -1  0  0] (Indices: [2, 4, 5, 7, 9, 10, 11, 12, 13, 17]), Candidate: [ 2  2  0  1  1  0  2 -1  2  1  0  1  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 156100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  1  0  0 -1  0  0  0  1  0 -1  1 -1] (Indices: [2, 4, 5, 7, 9, 10, 11, 16, 17, 19]), Candidate: [ 2  2  0  1  1  0  2 -1  2  1  0  0  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 156150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  1  0 -1  0  1 -1  1  0 -1  0  1 -1] (Indices: [2, 4, 5, 7, 9, 10, 13, 15, 16, 19]), Candidate: [ 2  2  0  1  1  0  2 -1  2  1 -1  1  2  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 156200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  1 -1  1  0 -1  0  1  0 -1  0  1 -1] (Indices: [2, 4, 5, 7, 9, 11, 12, 15, 16, 19]), Candidate: [ 2  2  0  1  1  0  2 -1  2  0  1  1  0  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 156250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  1 -1  0  1  0  0 -1  0  1  0 -1  0] (Indices: [2, 4, 5, 7, 9, 12, 13, 14, 17, 18]), Candidate: [ 2  2  0  1  1  0  2 -1  2  0  0  2  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 156300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  0  1  0  0  0  0 -1  1 -1  0  0  0] (Indices: [2, 4, 5, 7, 10, 11, 12, 13, 14, 16]), Candidate: [ 2  2  0  1  1  0  2 -1  1  2  0  1  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 156350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  0  1  0 -1  1 -1  0  1  0  0 -1  0] (Indices: [2, 4, 5, 7, 10, 11, 13, 16, 17, 18]), Candidate: [ 2  2  0  1  1  0  2 -1  1  2  0  0  2  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 156400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  0  1 -1  1 -1  0  1  0  0 -1  1 -1] (Indices: [2, 4, 5, 7, 10, 12, 15, 16, 17, 19]), Candidate: [ 2  2  0  1  1  0  2 -1  1  2 -1  2  0  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 156450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  0  0  1  0 -1  1  0 -1  0  1  0 -1] (Indices: [2, 4, 5, 7, 11, 12, 14, 15, 18, 19]), Candidate: [ 2  2  0  1  1  0  2 -1  1  1  1  1  0  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 156500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  0  0  0  1 -1  1 -1  1  0  0  0 -1] (Indices: [2, 4, 5, 7, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  2  0  1  1  0  2 -1  1  1  0  2  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 156550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1  0  0  0 -1  0  1 -1  1 -1  1 -1  0] (Indices: [2, 4, 5, 8, 9, 10, 11, 14, 16, 18]), Candidate: [ 2  2  0  1  1  0  1  1  1  1  0  0  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 156600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1  0  0 -1  0  1  0  0  0 -1  0  0  0] (Indices: [2, 4, 5, 8, 9, 10, 13, 14, 15, 16]), Candidate: [ 2  2  0  1  1  0  1  1  1  1 -1  1  2  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 156650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1  0 -1  1  0 -1  1  0  0 -1  0  0  0] (Indices: [2, 4, 5, 8, 9, 11, 12, 14, 15, 16]), Candidate: [2 2 0 1 1 0 1 1 1 0 1 1 0 2 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 156700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1  0 -1  1 -1  0  0  1  0  0  0 -1  0] (Indices: [2, 4, 5, 8, 9, 11, 15, 16, 17, 18]), Candidate: [2 2 0 1 1 0 1 1 1 0 1 0 1 1 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 156750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1  0 -1  0  0  1 -1  1  0  0  0 -1  0] (Indices: [2, 4, 5, 8, 9, 13, 15, 16, 17, 18]), Candidate: [2 2 0 1 1 0 1 1 1 0 0 1 2 0 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 156800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1 -1  1  0 -1  1  0 -1  1  0 -1  0  0] (Indices: [2, 4, 5, 8, 10, 11, 13, 14, 16, 17]), Candidate: [ 2  2  0  1  1  0  1  1  0  2  0  0  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 156850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1 -1  1 -1  1  0 -1  0  0  1  0  0 -1] (Indices: [2, 4, 5, 8, 10, 12, 13, 17, 18, 19]), Candidate: [ 2  2  0  1  1  0  1  1  0  2 -1  2  1  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 156900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1 -1  0  1  0  0 -1  1 -1  1  0 -1  0] (Indices: [2, 4, 5, 8, 11, 12, 13, 15, 17, 18]), Candidate: [2 2 0 1 1 0 1 1 0 1 1 1 1 0 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 156950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1 -1  0  0  1  0  0 -1  1  0 -1  1 -1] (Indices: [2, 4, 5, 8, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  2  0  1  1  0  1  1  0  1  0  2  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 157000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  1  0  0  0 -1  0  1 -1  1 -1  1 -1] (Indices: [2, 4, 5, 9, 10, 11, 12, 15, 17, 19]), Candidate: [2 2 0 1 1 0 1 0 2 1 0 1 0 1 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 157050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  1  0 -1  1  0  0 -1  0  0  1  0 -1] (Indices: [2, 4, 5, 9, 10, 12, 13, 14, 18, 19]), Candidate: [ 2  2  0  1  1  0  1  0  2  1 -1  2  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 157100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  1 -1  1  0  0  0  0 -1  0  0  1 -1] (Indices: [2, 4, 5, 9, 11, 12, 13, 14, 15, 19]), Candidate: [2 2 0 1 1 0 1 0 2 0 1 1 1 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 157150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  1 -1  1 -1  0  1  0 -1  1  0  0 -1] (Indices: [2, 4, 5, 9, 11, 14, 15, 17, 18, 19]), Candidate: [2 2 0 1 1 0 1 0 2 0 1 0 1 2 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 157200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  0  1  0  0  0 -1  0  0  1  0  0 -1] (Indices: [2, 4, 5, 10, 11, 12, 13, 17, 18, 19]), Candidate: [2 2 0 1 1 0 1 0 1 2 0 1 1 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 157250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  0  1 -1  1  0 -1  1 -1  1  0  0 -1] (Indices: [2, 4, 5, 10, 12, 13, 15, 17, 18, 19]), Candidate: [ 2  2  0  1  1  0  1  0  1  2 -1  2  1  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 157300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  0  0  0  0  1  0  0  0  0  0  0 -1] (Indices: [2, 4, 5, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 2 0 1 1 0 1 0 1 1 0 1 2 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 157350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0  0  0 -1  0  1  0  0 -1  0  0  0  0] (Indices: [2, 4, 6, 7, 8, 9, 10, 13, 14, 15]), Candidate: [ 2  2  0  1  0  2  1  0  1  1 -1  1  2  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 157400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0  0 -1  1  0 -1  0  0  1  0 -1  0  0] (Indices: [2, 4, 6, 7, 8, 9, 11, 12, 16, 17]), Candidate: [2 2 0 1 0 2 1 0 1 0 1 1 0 1 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 157450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0  0 -1  0  1  0 -1  0  1  0 -1  0  0] (Indices: [2, 4, 6, 7, 8, 9, 12, 13, 16, 17]), Candidate: [2 2 0 1 0 2 1 0 1 0 0 2 1 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 157500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0  0 -1  0  0  0  1  0 -1  1 -1  1 -1] (Indices: [2, 4, 6, 7, 8, 9, 14, 15, 17, 19]), Candidate: [2 2 0 1 0 2 1 0 1 0 0 1 1 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 157550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0 -1  1  0 -1  0  1  0 -1  0  0  1 -1] (Indices: [2, 4, 6, 7, 8, 10, 11, 14, 15, 19]), Candidate: [2 2 0 1 0 2 1 0 0 2 0 0 1 2 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 157600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0 -1  1 -1  1 -1  0  0  1 -1  1  0 -1] (Indices: [2, 4, 6, 7, 8, 10, 12, 16, 18, 19]), Candidate: [ 2  2  0  1  0  2  1  0  0  2 -1  2  0  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 157650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0 -1  0  1  0  0 -1  0  0  1 -1  1 -1] (Indices: [2, 4, 6, 7, 8, 11, 12, 13, 17, 19]), Candidate: [2 2 0 1 0 2 1 0 0 1 1 1 1 0 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 157700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0 -1  0  1 -1  0  1 -1  1 -1  1  0 -1] (Indices: [2, 4, 6, 7, 8, 11, 14, 16, 18, 19]), Candidate: [ 2  2  0  1  0  2  1  0  0  1  1  0  1  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 157750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0 -1  0  0  0  1  0 -1  1 -1  1  0 -1] (Indices: [2, 4, 6, 7, 8, 13, 14, 16, 18, 19]), Candidate: [ 2  2  0  1  0  2  1  0  0  1  0  1  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 157800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  1  0  0 -1  0  1  0 -1  1 -1  0  0] (Indices: [2, 4, 6, 7, 9, 10, 11, 14, 15, 17]), Candidate: [ 2  2  0  1  0  2  1 -1  2  1  0  0  1  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 157850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  1  0 -1  1 -1  0  0  1  0  0 -1  0] (Indices: [2, 4, 6, 7, 9, 10, 12, 16, 17, 18]), Candidate: [ 2  2  0  1  0  2  1 -1  2  1 -1  2  0  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 157900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  1 -1  1  0  0 -1  0  1 -1  0  1 -1] (Indices: [2, 4, 6, 7, 9, 11, 12, 13, 16, 19]), Candidate: [ 2  2  0  1  0  2  1 -1  2  0  1  1  1  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 157950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  1 -1  1 -1  0  1 -1  1  0  0 -1  0] (Indices: [2, 4, 6, 7, 9, 11, 14, 16, 17, 18]), Candidate: [ 2  2  0  1  0  2  1 -1  2  0  1  0  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 158000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  1 -1  0  0  1  0 -1  1  0  0 -1  0] (Indices: [2, 4, 6, 7, 9, 13, 14, 16, 17, 18]), Candidate: [ 2  2  0  1  0  2  1 -1  2  0  0  1  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 158050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  0  1  0 -1  1  0  0  0 -1  0  0  0] (Indices: [2, 4, 6, 7, 10, 11, 13, 14, 15, 16]), Candidate: [ 2  2  0  1  0  2  1 -1  1  2  0  0  2  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 158100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  0  1 -1  1  0 -1  1 -1  0  1  0 -1] (Indices: [2, 4, 6, 7, 10, 12, 13, 15, 18, 19]), Candidate: [ 2  2  0  1  0  2  1 -1  1  2 -1  2  1  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 158150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  0  0  1  0  0  0 -1  0  0  1  0 -1] (Indices: [2, 4, 6, 7, 11, 12, 13, 14, 18, 19]), Candidate: [ 2  2  0  1  0  2  1 -1  1  1  1  1  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 158200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  0  0  0  1  0  0  0 -1  1  0 -1  0] (Indices: [2, 4, 6, 7, 12, 13, 14, 15, 17, 18]), Candidate: [ 2  2  0  1  0  2  1 -1  1  1  0  2  1  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 158250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1  0  0  0 -1  1  0 -1  0  0  0  1 -1] (Indices: [2, 4, 6, 8, 9, 10, 11, 13, 14, 19]), Candidate: [ 2  2  0  1  0  2  0  1  1  1  0  0  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 158300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1  0  0 -1  1 -1  1 -1  1  0 -1  0  0] (Indices: [2, 4, 6, 8, 9, 10, 12, 14, 16, 17]), Candidate: [ 2  2  0  1  0  2  0  1  1  1 -1  2  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 158350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1  0  0 -1  0  0  0  0  1  0  0  0 -1] (Indices: [2, 4, 6, 8, 9, 10, 16, 17, 18, 19]), Candidate: [ 2  2  0  1  0  2  0  1  1  1 -1  1  1  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 158400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1  0 -1  1 -1  1 -1  1 -1  1 -1  1 -1] (Indices: [2, 4, 6, 8, 9, 11, 13, 15, 17, 19]), Candidate: [2 2 0 1 0 2 0 1 1 0 1 0 2 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 158450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1  0 -1  0  1 -1  1 -1  0  1  0  0 -1] (Indices: [2, 4, 6, 8, 9, 12, 14, 17, 18, 19]), Candidate: [ 2  2  0  1  0  2  0  1  1  0  0  2  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 158500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1 -1  1  0  0 -1  1 -1  0  1 -1  1 -1] (Indices: [2, 4, 6, 8, 10, 11, 12, 14, 17, 19]), Candidate: [ 2  2  0  1  0  2  0  1  0  2  0  1  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 158550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1 -1  1 -1  1  0  0  0 -1  0  0  1 -1] (Indices: [2, 4, 6, 8, 10, 12, 13, 14, 15, 19]), Candidate: [ 2  2  0  1  0  2  0  1  0  2 -1  2  1  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 158600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1 -1  1 -1  0  0  1  0 -1  1  0  0 -1] (Indices: [2, 4, 6, 8, 10, 14, 15, 17, 18, 19]), Candidate: [ 2  2  0  1  0  2  0  1  0  2 -1  1  1  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 158650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1 -1  0  1 -1  1 -1  1  0 -1  1  0 -1] (Indices: [2, 4, 6, 8, 11, 13, 15, 16, 18, 19]), Candidate: [2 2 0 1 0 2 0 1 0 1 1 0 2 0 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 158700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  1  0  0  0  0 -1  0  0  1 -1  1 -1] (Indices: [2, 4, 6, 9, 10, 11, 12, 13, 17, 19]), Candidate: [2 2 0 1 0 2 0 0 2 1 0 1 1 0 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 158750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  1  0  0 -1  0  1 -1  1 -1  1  0 -1] (Indices: [2, 4, 6, 9, 10, 11, 14, 16, 18, 19]), Candidate: [ 2  2  0  1  0  2  0  0  2  1  0  0  1  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 158800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  1  0 -1  0  1  0 -1  1 -1  1  0 -1] (Indices: [2, 4, 6, 9, 10, 13, 14, 16, 18, 19]), Candidate: [ 2  2  0  1  0  2  0  0  2  1 -1  1  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 158850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  1 -1  1 -1  1  0  0  0 -1  0  1 -1] (Indices: [2, 4, 6, 9, 11, 13, 14, 15, 16, 19]), Candidate: [2 2 0 1 0 2 0 0 2 0 1 0 2 1 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 158900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  0  1  0  0  0  0  0 -1  0  0  1 -1] (Indices: [2, 4, 6, 10, 11, 12, 13, 14, 15, 19]), Candidate: [2 2 0 1 0 2 0 0 1 2 0 1 1 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 158950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  0  1  0 -1  0  1  0 -1  1  0  0 -1] (Indices: [2, 4, 6, 10, 11, 14, 15, 17, 18, 19]), Candidate: [2 2 0 1 0 2 0 0 1 2 0 0 1 2 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 159000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  0  0  1  0 -1  1 -1  1  0  0  0 -1] (Indices: [2, 4, 6, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  2  0  1  0  2  0  0  1  1  1  1  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 159050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0  0  0  0 -1  1 -1  0  0  1  0 -1  0] (Indices: [2, 4, 7, 8, 9, 10, 11, 13, 17, 18]), Candidate: [2 2 0 1 0 1 2 0 1 1 0 0 2 0 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 159100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0  0  0 -1  1 -1  0  1  0 -1  0  1 -1] (Indices: [2, 4, 7, 8, 9, 10, 12, 15, 16, 19]), Candidate: [ 2  2  0  1  0  1  2  0  1  1 -1  2  0  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 159150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0  0 -1  1  0  0 -1  1 -1  0  1 -1  0] (Indices: [2, 4, 7, 8, 9, 11, 12, 13, 15, 18]), Candidate: [2 2 0 1 0 1 2 0 1 0 1 1 1 0 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 159200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0  0 -1  1 -1  0  1  0  0 -1  0  1 -1] (Indices: [2, 4, 7, 8, 9, 11, 14, 15, 16, 19]), Candidate: [2 2 0 1 0 1 2 0 1 0 1 0 1 2 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 159250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0  0 -1  0  0  1  0  0  0 -1  0  1 -1] (Indices: [2, 4, 7, 8, 9, 13, 14, 15, 16, 19]), Candidate: [2 2 0 1 0 1 2 0 1 0 0 1 2 1 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 159300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0 -1  1  0  0 -1  0  0  1  0  0 -1  0] (Indices: [2, 4, 7, 8, 10, 11, 12, 16, 17, 18]), Candidate: [2 2 0 1 0 1 2 0 0 2 0 1 0 1 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 159350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0 -1  1 -1  1  0 -1  1  0 -1  1 -1  0] (Indices: [2, 4, 7, 8, 10, 12, 13, 15, 16, 18]), Candidate: [ 2  2  0  1  0  1  2  0  0  2 -1  2  1  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 159400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0 -1  0  1  0  0  0 -1  1 -1  1 -1  0] (Indices: [2, 4, 7, 8, 11, 12, 13, 14, 16, 18]), Candidate: [ 2  2  0  1  0  1  2  0  0  1  1  1  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 159450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0 -1  0  1 -1  0  0  1  0  0  0  0 -1] (Indices: [2, 4, 7, 8, 11, 15, 16, 17, 18, 19]), Candidate: [2 2 0 1 0 1 2 0 0 1 1 0 1 1 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 159500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  1  0  0  0 -1  1 -1  1 -1  0  1 -1] (Indices: [2, 4, 7, 9, 10, 11, 12, 14, 16, 19]), Candidate: [ 2  2  0  1  0  1  2 -1  2  1  0  1  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 159550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  1  0 -1  1  0  0  0 -1  1 -1  0  0] (Indices: [2, 4, 7, 9, 10, 12, 13, 14, 15, 17]), Candidate: [ 2  2  0  1  0  1  2 -1  2  1 -1  2  1  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 159600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  1  0 -1  0  0  1  0  0  0 -1  1 -1] (Indices: [2, 4, 7, 9, 10, 14, 15, 16, 17, 19]), Candidate: [ 2  2  0  1  0  1  2 -1  2  1 -1  1  1  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 159650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  1 -1  1 -1  1 -1  1  0  0  0 -1  0] (Indices: [2, 4, 7, 9, 11, 13, 15, 16, 17, 18]), Candidate: [ 2  2  0  1  0  1  2 -1  2  0  1  0  2  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 159700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  0  1  0  0  0 -1  1  0 -1  1 -1  0] (Indices: [2, 4, 7, 10, 11, 12, 13, 15, 16, 18]), Candidate: [ 2  2  0  1  0  1  2 -1  1  2  0  1  1  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 159750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  0  1 -1  1  0  0  0 -1  0  1  0 -1] (Indices: [2, 4, 7, 10, 12, 13, 14, 15, 18, 19]), Candidate: [ 2  2  0  1  0  1  2 -1  1  2 -1  2  1  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 159800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  0  0  1 -1  0  1  0  0  0  0  0 -1] (Indices: [2, 4, 7, 11, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  2  0  1  0  1  2 -1  1  1  1  0  1  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 159850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1  0  0  0 -1  1  0 -1  1 -1  0  1 -1] (Indices: [2, 4, 8, 9, 10, 11, 13, 14, 16, 19]), Candidate: [ 2  2  0  1  0  1  1  1  1  1  0  0  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 159900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1  0  0 -1  1 -1  1  0  0 -1  1 -1  0] (Indices: [2, 4, 8, 9, 10, 12, 14, 15, 16, 18]), Candidate: [ 2  2  0  1  0  1  1  1  1  1 -1  2  0  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 159950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1  0 -1  1  0  0 -1  1 -1  0  1  0 -1] (Indices: [2, 4, 8, 9, 11, 12, 13, 15, 18, 19]), Candidate: [2 2 0 1 0 1 1 1 1 0 1 1 1 0 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 160000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1  0 -1  0  1  0  0 -1  0  1  0  0 -1] (Indices: [2, 4, 8, 9, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  2  0  1  0  1  1  1  1  0  0  2  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 160050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1 -1  1  0  0 -1  0  1  0  0 -1  1 -1] (Indices: [2, 4, 8, 10, 11, 12, 15, 16, 17, 19]), Candidate: [2 2 0 1 0 1 1 1 0 2 0 1 0 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 160100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1 -1  1 -1  0  1  0 -1  1  0  0  0 -1] (Indices: [2, 4, 8, 10, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  2  0  1  0  1  1  1  0  2 -1  1  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 160150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  1  0  0  0  0 -1  1  0 -1  1 -1  0] (Indices: [2, 4, 9, 10, 11, 12, 13, 15, 16, 18]), Candidate: [2 2 0 1 0 1 1 0 2 1 0 1 1 0 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 160200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  1  0 -1  1  0  0  0 -1  0  1  0 -1] (Indices: [2, 4, 9, 10, 12, 13, 14, 15, 18, 19]), Candidate: [ 2  2  0  1  0  1  1  0  2  1 -1  2  1  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 160250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  1 -1  1 -1  0  1  0  0  0  0  0 -1] (Indices: [2, 4, 9, 11, 14, 15, 16, 17, 18, 19]), Candidate: [2 2 0 1 0 1 1 0 2 0 1 0 1 2 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 160300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  0  0  1  0  0 -1  1  0  0  0  0 -1] (Indices: [2, 4, 11, 12, 13, 15, 16, 17, 18, 19]), Candidate: [2 2 0 1 0 1 1 0 1 1 1 1 1 0 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 160350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0  0  0 -1  1 -1  0  0  0  1  0 -1  0] (Indices: [2, 5, 6, 7, 8, 9, 10, 12, 17, 18]), Candidate: [ 2  2  0  0  2  1  1  0  1  1 -1  2  0  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 160400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0  0 -1  1  0 -1  0  1 -1  1 -1  0  0] (Indices: [2, 5, 6, 7, 8, 9, 11, 12, 15, 17]), Candidate: [2 2 0 0 2 1 1 0 1 0 1 1 0 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 160450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0  0 -1  0  1  0 -1  1 -1  1 -1  0  0] (Indices: [2, 5, 6, 7, 8, 9, 12, 13, 15, 17]), Candidate: [2 2 0 0 2 1 1 0 1 0 0 2 1 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 160500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0  0 -1  0  0  0  1  0  0 -1  1 -1  0] (Indices: [2, 5, 6, 7, 8, 9, 14, 15, 16, 18]), Candidate: [2 2 0 0 2 1 1 0 1 0 0 1 1 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 160550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0 -1  1  0 -1  0  1  0  0 -1  0  0  0] (Indices: [2, 5, 6, 7, 8, 10, 11, 14, 15, 16]), Candidate: [2 2 0 0 2 1 1 0 0 2 0 0 1 2 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 160600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0 -1  1 -1  1 -1  0  1 -1  0  1  0 -1] (Indices: [2, 5, 6, 7, 8, 10, 12, 15, 18, 19]), Candidate: [ 2  2  0  0  2  1  1  0  0  2 -1  2  0  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 160650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0 -1  0  1  0  0 -1  0  1 -1  1 -1  0] (Indices: [2, 5, 6, 7, 8, 11, 12, 13, 16, 18]), Candidate: [2 2 0 0 2 1 1 0 0 1 1 1 1 0 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 160700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0 -1  0  1 -1  0  1  0 -1  0  1  0 -1] (Indices: [2, 5, 6, 7, 8, 11, 14, 15, 18, 19]), Candidate: [2 2 0 0 2 1 1 0 0 1 1 0 1 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 160750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0 -1  0  0  0  1  0  0 -1  0  1  0 -1] (Indices: [2, 5, 6, 7, 8, 13, 14, 15, 18, 19]), Candidate: [2 2 0 0 2 1 1 0 0 1 0 1 2 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 160800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  1  0  0 -1  1 -1  0  0  1 -1  1 -1] (Indices: [2, 5, 6, 7, 9, 10, 11, 13, 17, 19]), Candidate: [ 2  2  0  0  2  1  1 -1  2  1  0  0  2  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 160850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  1  0 -1  1 -1  0  1 -1  1  0 -1  0] (Indices: [2, 5, 6, 7, 9, 10, 12, 15, 17, 18]), Candidate: [ 2  2  0  0  2  1  1 -1  2  1 -1  2  0  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 160900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  1 -1  1  0  0 -1  1 -1  0  0  1 -1] (Indices: [2, 5, 6, 7, 9, 11, 12, 13, 15, 19]), Candidate: [ 2  2  0  0  2  1  1 -1  2  0  1  1  1  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 160950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  1 -1  1 -1  0  1  0 -1  1  0 -1  0] (Indices: [2, 5, 6, 7, 9, 11, 14, 15, 17, 18]), Candidate: [ 2  2  0  0  2  1  1 -1  2  0  1  0  1  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 161000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  1 -1  0  0  1  0  0 -1  1  0 -1  0] (Indices: [2, 5, 6, 7, 9, 13, 14, 15, 17, 18]), Candidate: [ 2  2  0  0  2  1  1 -1  2  0  0  1  2  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 161050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  0  1  0  0 -1  0  0  1  0 -1  1 -1] (Indices: [2, 5, 6, 7, 10, 11, 12, 16, 17, 19]), Candidate: [ 2  2  0  0  2  1  1 -1  1  2  0  1  0  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 161100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  0  1 -1  1  0 -1  1  0 -1  0  1 -1] (Indices: [2, 5, 6, 7, 10, 12, 13, 15, 16, 19]), Candidate: [ 2  2  0  0  2  1  1 -1  1  2 -1  2  1  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 161150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  0  0  1  0  0  0 -1  1 -1  0  1 -1] (Indices: [2, 5, 6, 7, 11, 12, 13, 14, 16, 19]), Candidate: [ 2  2  0  0  2  1  1 -1  1  1  1  1  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 161200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  0  0  0  1  0  0  0  0  0 -1  0  0] (Indices: [2, 5, 6, 7, 12, 13, 14, 15, 16, 17]), Candidate: [ 2  2  0  0  2  1  1 -1  1  1  0  2  1  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 161250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1  0  0  0 -1  1  0 -1  1 -1  0  0  0] (Indices: [2, 5, 6, 8, 9, 10, 11, 13, 14, 16]), Candidate: [ 2  2  0  0  2  1  0  1  1  1  0  0  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 161300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1  0  0 -1  1 -1  1  0 -1  1 -1  0  0] (Indices: [2, 5, 6, 8, 9, 10, 12, 14, 15, 17]), Candidate: [ 2  2  0  0  2  1  0  1  1  1 -1  2  0  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 161350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1  0  0 -1  0  0  0  1  0  0 -1  1 -1] (Indices: [2, 5, 6, 8, 9, 10, 15, 16, 17, 19]), Candidate: [ 2  2  0  0  2  1  0  1  1  1 -1  1  1  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 161400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1  0 -1  1 -1  1 -1  1  0 -1  1 -1  0] (Indices: [2, 5, 6, 8, 9, 11, 13, 15, 16, 18]), Candidate: [2 2 0 0 2 1 0 1 1 0 1 0 2 0 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 161450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1  0 -1  0  1 -1  1 -1  1  0  0 -1  0] (Indices: [2, 5, 6, 8, 9, 12, 14, 16, 17, 18]), Candidate: [ 2  2  0  0  2  1  0  1  1  0  0  2  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 161500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1 -1  1  0  0 -1  1 -1  1 -1  1 -1  0] (Indices: [2, 5, 6, 8, 10, 11, 12, 14, 16, 18]), Candidate: [ 2  2  0  0  2  1  0  1  0  2  0  1  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 161550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1 -1  1 -1  1  0  0  0  0 -1  0  0  0] (Indices: [2, 5, 6, 8, 10, 12, 13, 14, 15, 16]), Candidate: [ 2  2  0  0  2  1  0  1  0  2 -1  2  1  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 161600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1 -1  1 -1  0  0  1  0  0  0  0 -1  0] (Indices: [2, 5, 6, 8, 10, 14, 15, 16, 17, 18]), Candidate: [ 2  2  0  0  2  1  0  1  0  2 -1  1  1  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 161650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1 -1  0  1 -1  1  0 -1  0  1  0  0 -1] (Indices: [2, 5, 6, 8, 11, 13, 14, 17, 18, 19]), Candidate: [ 2  2  0  0  2  1  0  1  0  1  1  0  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 161700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  1  0  0  0  0 -1  0  1 -1  1 -1  0] (Indices: [2, 5, 6, 9, 10, 11, 12, 13, 16, 18]), Candidate: [2 2 0 0 2 1 0 0 2 1 0 1 1 0 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 161750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  1  0  0 -1  0  1  0 -1  0  1  0 -1] (Indices: [2, 5, 6, 9, 10, 11, 14, 15, 18, 19]), Candidate: [2 2 0 0 2 1 0 0 2 1 0 0 1 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 161800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  1  0 -1  0  1  0  0 -1  0  1  0 -1] (Indices: [2, 5, 6, 9, 10, 13, 14, 15, 18, 19]), Candidate: [ 2  2  0  0  2  1  0  0  2  1 -1  1  2  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 161850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  1 -1  1  0 -1  0  0  1  0  0  0 -1] (Indices: [2, 5, 6, 9, 11, 12, 16, 17, 18, 19]), Candidate: [2 2 0 0 2 1 0 0 2 0 1 1 0 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 161900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  0  1  0  0  0  0  0  0 -1  0  0  0] (Indices: [2, 5, 6, 10, 11, 12, 13, 14, 15, 16]), Candidate: [2 2 0 0 2 1 0 0 1 2 0 1 1 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 161950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  0  1  0 -1  0  1  0  0  0  0 -1  0] (Indices: [2, 5, 6, 10, 11, 14, 15, 16, 17, 18]), Candidate: [2 2 0 0 2 1 0 0 1 2 0 0 1 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 162000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  0  0  1  0 -1  1  0  0  0 -1  1 -1] (Indices: [2, 5, 6, 11, 12, 14, 15, 16, 17, 19]), Candidate: [2 2 0 0 2 1 0 0 1 1 1 1 0 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 162050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0  0  0  0 -1  1 -1  0  1  0 -1  0  0] (Indices: [2, 5, 7, 8, 9, 10, 11, 13, 16, 17]), Candidate: [2 2 0 0 2 0 2 0 1 1 0 0 2 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 162100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0  0  0 -1  1 -1  1 -1  0  0  1  0 -1] (Indices: [2, 5, 7, 8, 9, 10, 12, 14, 18, 19]), Candidate: [ 2  2  0  0  2  0  2  0  1  1 -1  2  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 162150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0  0 -1  1  0  0  0 -1  0  0  0  1 -1] (Indices: [2, 5, 7, 8, 9, 11, 12, 13, 14, 19]), Candidate: [ 2  2  0  0  2  0  2  0  1  0  1  1  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 162200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0  0 -1  1 -1  1 -1  0  0  1  0  0 -1] (Indices: [2, 5, 7, 8, 9, 11, 13, 17, 18, 19]), Candidate: [2 2 0 0 2 0 2 0 1 0 1 0 2 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 162250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0  0 -1  0  1 -1  0  0  1  0  0  0 -1] (Indices: [2, 5, 7, 8, 9, 12, 16, 17, 18, 19]), Candidate: [2 2 0 0 2 0 2 0 1 0 0 2 0 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 162300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0 -1  1  0  0 -1  0  1 -1  1  0 -1  0] (Indices: [2, 5, 7, 8, 10, 11, 12, 15, 17, 18]), Candidate: [2 2 0 0 2 0 2 0 0 2 0 1 0 1 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 162350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0 -1  1 -1  1  0  0 -1  0  1 -1  1 -1] (Indices: [2, 5, 7, 8, 10, 12, 13, 14, 17, 19]), Candidate: [ 2  2  0  0  2  0  2  0  0  2 -1  2  1  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 162400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0 -1  0  1  0  0  0  0 -1  0  1 -1  0] (Indices: [2, 5, 7, 8, 11, 12, 13, 14, 15, 18]), Candidate: [2 2 0 0 2 0 2 0 0 1 1 1 1 1 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 162450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0 -1  0  1 -1  0  1  0  0 -1  1  0 -1] (Indices: [2, 5, 7, 8, 11, 14, 15, 16, 18, 19]), Candidate: [2 2 0 0 2 0 2 0 0 1 1 0 1 2 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 162500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  1  0  0  0 -1  1  0 -1  0  0  1 -1] (Indices: [2, 5, 7, 9, 10, 11, 12, 14, 15, 19]), Candidate: [ 2  2  0  0  2  0  2 -1  2  1  0  1  0  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 162550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  1  0  0 -1  0  0  1 -1  1  0  0 -1] (Indices: [2, 5, 7, 9, 10, 11, 15, 17, 18, 19]), Candidate: [ 2  2  0  0  2  0  2 -1  2  1  0  0  1  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 162600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  1  0 -1  0  1 -1  1 -1  1  0  0 -1] (Indices: [2, 5, 7, 9, 10, 13, 15, 17, 18, 19]), Candidate: [ 2  2  0  0  2  0  2 -1  2  1 -1  1  2  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 162650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  1 -1  1 -1  1  0 -1  1  0 -1  1 -1] (Indices: [2, 5, 7, 9, 11, 13, 14, 16, 17, 19]), Candidate: [ 2  2  0  0  2  0  2 -1  2  0  1  0  2  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 162700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  0  1  0  0  0  0 -1  0  1 -1  1 -1] (Indices: [2, 5, 7, 10, 11, 12, 13, 14, 17, 19]), Candidate: [ 2  2  0  0  2  0  2 -1  1  2  0  1  1  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 162750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  0  1 -1  1  0  0  0  0 -1  0  1 -1] (Indices: [2, 5, 7, 10, 12, 13, 14, 15, 16, 19]), Candidate: [ 2  2  0  0  2  0  2 -1  1  2 -1  2  1  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 162800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  0  0  1 -1  1  0  0 -1  1  0  0 -1] (Indices: [2, 5, 7, 11, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  2  0  0  2  0  2 -1  1  1  1  0  2  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 162850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1  0  0  0 -1  1  0  0 -1  0  0  1 -1] (Indices: [2, 5, 8, 9, 10, 11, 13, 14, 15, 19]), Candidate: [2 2 0 0 2 0 1 1 1 1 0 0 2 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 162900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1  0  0 -1  1  0 -1  0  1 -1  1  0 -1] (Indices: [2, 5, 8, 9, 10, 12, 13, 16, 18, 19]), Candidate: [ 2  2  0  0  2  0  1  1  1  1 -1  2  1  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 162950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1  0 -1  1  0  0 -1  1  0 -1  0  1 -1] (Indices: [2, 5, 8, 9, 11, 12, 13, 15, 16, 19]), Candidate: [2 2 0 0 2 0 1 1 1 0 1 1 1 0 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 163000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1  0 -1  0  1  0  0 -1  1  0  0 -1  0] (Indices: [2, 5, 8, 9, 12, 13, 14, 16, 17, 18]), Candidate: [ 2  2  0  0  2  0  1  1  1  0  0  2  1  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 163050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1 -1  1  0  0 -1  1 -1  1 -1  1  0 -1] (Indices: [2, 5, 8, 10, 11, 12, 14, 16, 18, 19]), Candidate: [ 2  2  0  0  2  0  1  1  0  2  0  1  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 163100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1 -1  1 -1  0  1  0  0  0  0 -1  1 -1] (Indices: [2, 5, 8, 10, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  2  0  0  2  0  1  1  0  2 -1  1  2  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 163150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  1  0  0  0  0  0 -1  0  1 -1  1 -1] (Indices: [2, 5, 9, 10, 11, 12, 13, 14, 17, 19]), Candidate: [ 2  2  0  0  2  0  1  0  2  1  0  1  1  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 163200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  1  0 -1  1  0  0  0  0 -1  0  1 -1] (Indices: [2, 5, 9, 10, 12, 13, 14, 15, 16, 19]), Candidate: [ 2  2  0  0  2  0  1  0  2  1 -1  2  1  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 163250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  1 -1  1 -1  1  0  0 -1  1  0  0 -1] (Indices: [2, 5, 9, 11, 13, 14, 15, 17, 18, 19]), Candidate: [2 2 0 0 2 0 1 0 2 0 1 0 2 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 163300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  0  0  1  0  0  0  0  0 -1  1  0 -1] (Indices: [2, 5, 11, 12, 13, 14, 15, 16, 18, 19]), Candidate: [2 2 0 0 2 0 1 0 1 1 1 1 1 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 163350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0  0  0  0 -1  0  1 -1  0  1  0 -1  0] (Indices: [2, 6, 7, 8, 9, 10, 11, 14, 17, 18]), Candidate: [ 2  2  0  0  1  2  1  0  1  1  0  0  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 163400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0  0  0 -1  0  1  0  0 -1  0  1 -1  0] (Indices: [2, 6, 7, 8, 9, 10, 13, 14, 15, 18]), Candidate: [ 2  2  0  0  1  2  1  0  1  1 -1  1  2  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 163450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0  0 -1  1  0 -1  1  0 -1  0  1 -1  0] (Indices: [2, 6, 7, 8, 9, 11, 12, 14, 15, 18]), Candidate: [2 2 0 0 1 2 1 0 1 0 1 1 0 2 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 163500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0  0 -1  1 -1  0  0  1  0 -1  1  0 -1] (Indices: [2, 6, 7, 8, 9, 11, 15, 16, 18, 19]), Candidate: [2 2 0 0 1 2 1 0 1 0 1 0 1 1 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 163550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0  0 -1  0  0  1 -1  1  0 -1  1  0 -1] (Indices: [2, 6, 7, 8, 9, 13, 15, 16, 18, 19]), Candidate: [2 2 0 0 1 2 1 0 1 0 0 1 2 0 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 163600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0 -1  1  0 -1  1  0 -1  1 -1  0  1 -1] (Indices: [2, 6, 7, 8, 10, 11, 13, 14, 16, 19]), Candidate: [ 2  2  0  0  1  2  1  0  0  2  0  0  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 163650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0 -1  1 -1  1 -1  1  0  0 -1  1 -1  0] (Indices: [2, 6, 7, 8, 10, 12, 14, 15, 16, 18]), Candidate: [ 2  2  0  0  1  2  1  0  0  2 -1  2  0  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 163700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0 -1  0  1  0  0 -1  1 -1  0  1  0 -1] (Indices: [2, 6, 7, 8, 11, 12, 13, 15, 18, 19]), Candidate: [2 2 0 0 1 2 1 0 0 1 1 1 1 0 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 163750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0 -1  0  0  1  0  0 -1  0  1  0  0 -1] (Indices: [2, 6, 7, 8, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  2  0  0  1  2  1  0  0  1  0  2  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 163800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  1  0  0  0 -1  0  0  1  0  0 -1  0] (Indices: [2, 6, 7, 9, 10, 11, 12, 16, 17, 18]), Candidate: [ 2  2  0  0  1  2  1 -1  2  1  0  1  0  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 163850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  1  0 -1  1  0 -1  1  0 -1  1 -1  0] (Indices: [2, 6, 7, 9, 10, 12, 13, 15, 16, 18]), Candidate: [ 2  2  0  0  1  2  1 -1  2  1 -1  2  1  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 163900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  1 -1  1  0  0  0 -1  1 -1  1 -1  0] (Indices: [2, 6, 7, 9, 11, 12, 13, 14, 16, 18]), Candidate: [ 2  2  0  0  1  2  1 -1  2  0  1  1  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 163950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  1 -1  1 -1  0  0  1  0  0  0  0 -1] (Indices: [2, 6, 7, 9, 11, 15, 16, 17, 18, 19]), Candidate: [ 2  2  0  0  1  2  1 -1  2  0  1  0  1  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 164000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  0  1  0  0 -1  1  0  0 -1  1 -1  0] (Indices: [2, 6, 7, 10, 11, 12, 14, 15, 16, 18]), Candidate: [ 2  2  0  0  1  2  1 -1  1  2  0  1  0  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 164050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  0  1 -1  1 -1  1  0  0  0  0 -1  0] (Indices: [2, 6, 7, 10, 12, 14, 15, 16, 17, 18]), Candidate: [ 2  2  0  0  1  2  1 -1  1  2 -1  2  0  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 164100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1  0  0  0  0  0  0 -1  1 -1  0  0  0] (Indices: [2, 6, 8, 9, 10, 11, 12, 13, 14, 16]), Candidate: [ 2  2  0  0  1  2  0  1  1  1  0  1  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 164150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1  0  0  0 -1  1 -1  0  1  0  0 -1  0] (Indices: [2, 6, 8, 9, 10, 11, 13, 16, 17, 18]), Candidate: [2 2 0 0 1 2 0 1 1 1 0 0 2 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 164200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1  0  0 -1  1 -1  0  1  0  0 -1  1 -1] (Indices: [2, 6, 8, 9, 10, 12, 15, 16, 17, 19]), Candidate: [ 2  2  0  0  1  2  0  1  1  1 -1  2  0  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 164250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1  0 -1  1  0 -1  1  0 -1  0  1  0 -1] (Indices: [2, 6, 8, 9, 11, 12, 14, 15, 18, 19]), Candidate: [2 2 0 0 1 2 0 1 1 0 1 1 0 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 164300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1  0 -1  0  1 -1  1 -1  1  0  0  0 -1] (Indices: [2, 6, 8, 9, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  2  0  0  1  2  0  1  1  0  0  2  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 164350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1 -1  1  0 -1  1  0 -1  1  0  0 -1  0] (Indices: [2, 6, 8, 10, 11, 13, 14, 16, 17, 18]), Candidate: [ 2  2  0  0  1  2  0  1  0  2  0  0  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 164400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1 -1  0  1  0  0  0 -1  1  0 -1  1 -1] (Indices: [2, 6, 8, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  2  0  0  1  2  0  1  0  1  1  1  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 164450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  1  0  0  0 -1  1  0  0 -1  1 -1  0] (Indices: [2, 6, 9, 10, 11, 12, 14, 15, 16, 18]), Candidate: [2 2 0 0 1 2 0 0 2 1 0 1 0 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 164500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  1  0 -1  1 -1  1  0  0  0  0 -1  0] (Indices: [2, 6, 9, 10, 12, 14, 15, 16, 17, 18]), Candidate: [ 2  2  0  0  1  2  0  0  2  1 -1  2  0  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 164550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  0  1  0  0  0  0  0  0 -1  1 -1  0] (Indices: [2, 6, 10, 11, 12, 13, 14, 15, 16, 18]), Candidate: [2 2 0 0 1 2 0 0 1 2 0 1 1 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 164600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0  0  0  0  0  0 -1  1 -1  1 -1  0  0] (Indices: [2, 7, 8, 9, 10, 11, 12, 13, 15, 17]), Candidate: [2 2 0 0 1 1 2 0 1 1 0 1 1 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 164650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0  0  0  0 -1  0  1  0  0 -1  1 -1  0] (Indices: [2, 7, 8, 9, 10, 11, 14, 15, 16, 18]), Candidate: [2 2 0 0 1 1 2 0 1 1 0 0 1 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 164700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0  0  0 -1  0  1  0  0  0 -1  1 -1  0] (Indices: [2, 7, 8, 9, 10, 13, 14, 15, 16, 18]), Candidate: [ 2  2  0  0  1  1  2  0  1  1 -1  1  2  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 164750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0  0 -1  1  0 -1  0  1  0  0  0 -1  0] (Indices: [2, 7, 8, 9, 11, 12, 15, 16, 17, 18]), Candidate: [2 2 0 0 1 1 2 0 1 0 1 1 0 1 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 164800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0  0 -1  0  0  1  0  0 -1  1  0  0 -1] (Indices: [2, 7, 8, 9, 13, 14, 15, 17, 18, 19]), Candidate: [2 2 0 0 1 1 2 0 1 0 0 1 2 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 164850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0 -1  1  0 -1  1 -1  1  0  0 -1  1 -1] (Indices: [2, 7, 8, 10, 11, 13, 15, 16, 17, 19]), Candidate: [2 2 0 0 1 1 2 0 0 2 0 0 2 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 164900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0 -1  0  1  0  0 -1  1  0 -1  1  0 -1] (Indices: [2, 7, 8, 11, 12, 13, 15, 16, 18, 19]), Candidate: [2 2 0 0 1 1 2 0 0 1 1 1 1 0 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 164950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  1  0  0  0 -1  1 -1  1  0  0 -1  0] (Indices: [2, 7, 9, 10, 11, 12, 14, 16, 17, 18]), Candidate: [ 2  2  0  0  1  1  2 -1  2  1  0  1  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 165000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  1  0 -1  1 -1  0  1  0  0  0  0 -1] (Indices: [2, 7, 9, 10, 12, 15, 16, 17, 18, 19]), Candidate: [ 2  2  0  0  1  1  2 -1  2  1 -1  2  0  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 165050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  0  1  0  0  0  0 -1  1  0  0 -1  0] (Indices: [2, 7, 10, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 2  2  0  0  1  1  2 -1  1  2  0  1  1  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 165100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1  0  0  0  0  0 -1  1  0 -1  1 -1  0] (Indices: [2, 8, 9, 10, 11, 12, 13, 15, 16, 18]), Candidate: [2 2 0 0 1 1 1 1 1 1 0 1 1 0 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 165150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1  0  0 -1  1  0  0  0 -1  0  1  0 -1] (Indices: [2, 8, 9, 10, 12, 13, 14, 15, 18, 19]), Candidate: [ 2  2  0  0  1  1  1  1  1  1 -1  2  1  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 165200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1  0 -1  1 -1  0  1  0  0  0  0  0 -1] (Indices: [2, 8, 9, 11, 14, 15, 16, 17, 18, 19]), Candidate: [2 2 0 0 1 1 1 1 1 0 1 0 1 2 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 165250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1 -1  0  1  0  0 -1  1  0  0  0  0 -1] (Indices: [2, 8, 11, 12, 13, 15, 16, 17, 18, 19]), Candidate: [2 2 0 0 1 1 1 1 0 1 1 1 1 0 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 165300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  0  0  1  0  0  0  0  0  0  0 -1  1 -1] (Indices: [2, 10, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [2 2 0 0 1 1 1 0 1 2 0 1 1 1 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 165350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0  0 -1  1  0 -1  0  0  0  0  1 -1  0] (Indices: [3, 4, 5, 6, 7, 8, 9, 11, 12, 18]), Candidate: [2 1 2 0 1 1 1 0 1 0 1 1 0 1 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 165400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0  0 -1  0  0  1 -1  1 -1  1 -1  0  0] (Indices: [3, 4, 5, 6, 7, 8, 9, 13, 15, 17]), Candidate: [2 1 2 0 1 1 1 0 1 0 0 1 2 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 165450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0 -1  1  0 -1  0  0  1 -1  0  0  1 -1] (Indices: [3, 4, 5, 6, 7, 8, 10, 11, 15, 19]), Candidate: [2 1 2 0 1 1 1 0 0 2 0 0 1 1 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 165500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0 -1  1 -1  0  0  1 -1  0  1  0 -1  0] (Indices: [3, 4, 5, 6, 7, 8, 10, 14, 17, 18]), Candidate: [ 2  1  2  0  1  1  1  0  0  2 -1  1  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 165550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0 -1  0  1 -1  0  1  0 -1  1 -1  0  0] (Indices: [3, 4, 5, 6, 7, 8, 11, 14, 15, 17]), Candidate: [2 1 2 0 1 1 1 0 0 1 1 0 1 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 165600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0 -1  0  0  1 -1  0  0  1  0  0 -1  0] (Indices: [3, 4, 5, 6, 7, 8, 12, 16, 17, 18]), Candidate: [2 1 2 0 1 1 1 0 0 1 0 2 0 1 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 165650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  1  0  0 -1  1 -1  0  0  0  1 -1  0] (Indices: [3, 4, 5, 6, 7, 9, 10, 11, 13, 18]), Candidate: [ 2  1  2  0  1  1  1 -1  2  1  0  0  2  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 165700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  1  0 -1  0  1 -1  0  0  1  0 -1  0] (Indices: [3, 4, 5, 6, 7, 9, 10, 13, 17, 18]), Candidate: [ 2  1  2  0  1  1  1 -1  2  1 -1  1  2  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 165750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  1 -1  1 -1  1 -1  1 -1  1 -1  0  0] (Indices: [3, 4, 5, 6, 7, 9, 11, 13, 15, 17]), Candidate: [ 2  1  2  0  1  1  1 -1  2  0  1  0  2  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 165800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  1 -1  0  1 -1  1 -1  1 -1  0  1 -1] (Indices: [3, 4, 5, 6, 7, 9, 12, 14, 16, 19]), Candidate: [ 2  1  2  0  1  1  1 -1  2  0  0  2  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 165850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  0  1  0  0  0 -1  1 -1  0  0  0  0] (Indices: [3, 4, 5, 6, 7, 10, 11, 12, 13, 15]), Candidate: [ 2  1  2  0  1  1  1 -1  1  2  0  1  1  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 165900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  0  1  0 -1  0  0  1 -1  0  1  0 -1] (Indices: [3, 4, 5, 6, 7, 10, 11, 15, 18, 19]), Candidate: [ 2  1  2  0  1  1  1 -1  1  2  0  0  1  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 165950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  0  1 -1  0  1 -1  1  0  0 -1  0  0] (Indices: [3, 4, 5, 6, 7, 10, 13, 15, 16, 17]), Candidate: [ 2  1  2  0  1  1  1 -1  1  2 -1  1  2  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 166000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  0  0  1  0 -1  0  1  0  0 -1  0  0] (Indices: [3, 4, 5, 6, 7, 11, 12, 15, 16, 17]), Candidate: [ 2  1  2  0  1  1  1 -1  1  1  1  1  0  1  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 166050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  0  0  0  1  0  0 -1  1 -1  1 -1  0] (Indices: [3, 4, 5, 6, 7, 12, 13, 14, 16, 18]), Candidate: [ 2  1  2  0  1  1  1 -1  1  1  0  2  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 166100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  0  0  0  0  0  0  1  0  0  0  0 -1] (Indices: [3, 4, 5, 6, 7, 15, 16, 17, 18, 19]), Candidate: [ 2  1  2  0  1  1  1 -1  1  1  0  1  1  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 166150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1  0  0 -1  0  1  0  0 -1  0  0  0  0] (Indices: [3, 4, 5, 6, 8, 9, 10, 13, 14, 15]), Candidate: [ 2  1  2  0  1  1  0  1  1  1 -1  1  2  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 166200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1  0 -1  1  0 -1  0  0  1  0 -1  0  0] (Indices: [3, 4, 5, 6, 8, 9, 11, 12, 16, 17]), Candidate: [2 1 2 0 1 1 0 1 1 0 1 1 0 1 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 166250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1  0 -1  0  1  0 -1  0  1  0 -1  0  0] (Indices: [3, 4, 5, 6, 8, 9, 12, 13, 16, 17]), Candidate: [2 1 2 0 1 1 0 1 1 0 0 2 1 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 166300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1  0 -1  0  0  0  1  0 -1  1 -1  1 -1] (Indices: [3, 4, 5, 6, 8, 9, 14, 15, 17, 19]), Candidate: [2 1 2 0 1 1 0 1 1 0 0 1 1 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 166350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1 -1  1  0 -1  0  1  0 -1  0  0  1 -1] (Indices: [3, 4, 5, 6, 8, 10, 11, 14, 15, 19]), Candidate: [2 1 2 0 1 1 0 1 0 2 0 0 1 2 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 166400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1 -1  1 -1  1 -1  0  0  1 -1  1  0 -1] (Indices: [3, 4, 5, 6, 8, 10, 12, 16, 18, 19]), Candidate: [ 2  1  2  0  1  1  0  1  0  2 -1  2  0  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 166450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1 -1  0  1  0  0 -1  0  0  1 -1  1 -1] (Indices: [3, 4, 5, 6, 8, 11, 12, 13, 17, 19]), Candidate: [2 1 2 0 1 1 0 1 0 1 1 1 1 0 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 166500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1 -1  0  1 -1  0  1 -1  1 -1  1  0 -1] (Indices: [3, 4, 5, 6, 8, 11, 14, 16, 18, 19]), Candidate: [ 2  1  2  0  1  1  0  1  0  1  1  0  1  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 166550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1 -1  0  0  0  1  0 -1  1 -1  1  0 -1] (Indices: [3, 4, 5, 6, 8, 13, 14, 16, 18, 19]), Candidate: [ 2  1  2  0  1  1  0  1  0  1  0  1  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 166600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  1  0  0 -1  0  1  0 -1  1 -1  0  0] (Indices: [3, 4, 5, 6, 9, 10, 11, 14, 15, 17]), Candidate: [2 1 2 0 1 1 0 0 2 1 0 0 1 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 166650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  1  0 -1  1 -1  0  0  1  0  0 -1  0] (Indices: [3, 4, 5, 6, 9, 10, 12, 16, 17, 18]), Candidate: [ 2  1  2  0  1  1  0  0  2  1 -1  2  0  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 166700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  1 -1  1  0  0 -1  0  1 -1  0  1 -1] (Indices: [3, 4, 5, 6, 9, 11, 12, 13, 16, 19]), Candidate: [2 1 2 0 1 1 0 0 2 0 1 1 1 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 166750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  1 -1  1 -1  0  1 -1  1  0  0 -1  0] (Indices: [3, 4, 5, 6, 9, 11, 14, 16, 17, 18]), Candidate: [ 2  1  2  0  1  1  0  0  2  0  1  0  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 166800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  1 -1  0  0  1  0 -1  1  0  0 -1  0] (Indices: [3, 4, 5, 6, 9, 13, 14, 16, 17, 18]), Candidate: [ 2  1  2  0  1  1  0  0  2  0  0  1  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 166850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  0  1  0 -1  1  0  0  0 -1  0  0  0] (Indices: [3, 4, 5, 6, 10, 11, 13, 14, 15, 16]), Candidate: [2 1 2 0 1 1 0 0 1 2 0 0 2 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 166900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  0  1 -1  1  0 -1  1 -1  0  1  0 -1] (Indices: [3, 4, 5, 6, 10, 12, 13, 15, 18, 19]), Candidate: [ 2  1  2  0  1  1  0  0  1  2 -1  2  1  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 166950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  0  0  1  0  0  0 -1  0  0  1  0 -1] (Indices: [3, 4, 5, 6, 11, 12, 13, 14, 18, 19]), Candidate: [ 2  1  2  0  1  1  0  0  1  1  1  1  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 167000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  0  0  0  1  0  0  0 -1  1  0 -1  0] (Indices: [3, 4, 5, 6, 12, 13, 14, 15, 17, 18]), Candidate: [2 1 2 0 1 1 0 0 1 1 0 2 1 1 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 167050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0  0  0  0 -1  0  0  0  0  1  0 -1  0] (Indices: [3, 4, 5, 7, 8, 9, 10, 11, 17, 18]), Candidate: [2 1 2 0 1 0 2 0 1 1 0 0 1 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 167100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0  0  0 -1  0  0  0  1  0 -1  1 -1  0] (Indices: [3, 4, 5, 7, 8, 9, 10, 15, 16, 18]), Candidate: [ 2  1  2  0  1  0  2  0  1  1 -1  1  1  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 167150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0  0 -1  1 -1  0  1 -1  1 -1  1 -1  0] (Indices: [3, 4, 5, 7, 8, 9, 11, 14, 16, 18]), Candidate: [ 2  1  2  0  1  0  2  0  1  0  1  0  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 167200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0  0 -1  0  0  1  0  0  0 -1  0  0  0] (Indices: [3, 4, 5, 7, 8, 9, 13, 14, 15, 16]), Candidate: [2 1 2 0 1 0 2 0 1 0 0 1 2 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 167250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0 -1  1  0  0 -1  0  0  1  0 -1  0  0] (Indices: [3, 4, 5, 7, 8, 10, 11, 12, 16, 17]), Candidate: [2 1 2 0 1 0 2 0 0 2 0 1 0 1 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 167300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0 -1  1 -1  1  0 -1  0  1  0 -1  0  0] (Indices: [3, 4, 5, 7, 8, 10, 12, 13, 16, 17]), Candidate: [ 2  1  2  0  1  0  2  0  0  2 -1  2  1  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 167350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0 -1  1 -1  0  0  1  0 -1  1 -1  1 -1] (Indices: [3, 4, 5, 7, 8, 10, 14, 15, 17, 19]), Candidate: [ 2  1  2  0  1  0  2  0  0  2 -1  1  1  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 167400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0 -1  0  1 -1  1  0 -1  1  0 -1  0  0] (Indices: [3, 4, 5, 7, 8, 11, 13, 14, 16, 17]), Candidate: [ 2  1  2  0  1  0  2  0  0  1  1  0  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 167450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0 -1  0  0  1  0 -1  0  0  1  0  0 -1] (Indices: [3, 4, 5, 7, 8, 12, 13, 17, 18, 19]), Candidate: [2 1 2 0 1 0 2 0 0 1 0 2 1 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 167500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  1  0  0  0 -1  0  1 -1  0  1 -1  0] (Indices: [3, 4, 5, 7, 9, 10, 11, 12, 15, 18]), Candidate: [ 2  1  2  0  1  0  2 -1  2  1  0  1  0  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 167550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  1  0 -1  1  0 -1  1 -1  0  1 -1  0] (Indices: [3, 4, 5, 7, 9, 10, 12, 13, 15, 18]), Candidate: [ 2  1  2  0  1  0  2 -1  2  1 -1  2  1  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 167600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  1  0 -1  0  0  1  0  0 -1  0  1 -1] (Indices: [3, 4, 5, 7, 9, 10, 14, 15, 16, 19]), Candidate: [ 2  1  2  0  1  0  2 -1  2  1 -1  1  1  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 167650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  1 -1  1 -1  1  0  0 -1  0  1 -1  0] (Indices: [3, 4, 5, 7, 9, 11, 13, 14, 15, 18]), Candidate: [ 2  1  2  0  1  0  2 -1  2  0  1  0  2  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 167700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  1 -1  0  1  0 -1  0  1  0 -1  1 -1] (Indices: [3, 4, 5, 7, 9, 12, 13, 16, 17, 19]), Candidate: [ 2  1  2  0  1  0  2 -1  2  0  0  2  1  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 167750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  0  1  0  0  0 -1  0  1 -1  0  1 -1] (Indices: [3, 4, 5, 7, 10, 11, 12, 13, 16, 19]), Candidate: [ 2  1  2  0  1  0  2 -1  1  2  0  1  1  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 167800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  0  1  0 -1  0  1 -1  1  0  0 -1  0] (Indices: [3, 4, 5, 7, 10, 11, 14, 16, 17, 18]), Candidate: [ 2  1  2  0  1  0  2 -1  1  2  0  0  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 167850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  0  1 -1  0  1  0 -1  1  0  0 -1  0] (Indices: [3, 4, 5, 7, 10, 13, 14, 16, 17, 18]), Candidate: [ 2  1  2  0  1  0  2 -1  1  2 -1  1  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 167900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  0  0  1 -1  1  0  0  0  0 -1  0  0] (Indices: [3, 4, 5, 7, 11, 13, 14, 15, 16, 17]), Candidate: [ 2  1  2  0  1  0  2 -1  1  1  1  0  2  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 167950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1  0  0  0  0  0 -1  1 -1  0  0  0  0] (Indices: [3, 4, 5, 8, 9, 10, 11, 12, 13, 15]), Candidate: [2 1 2 0 1 0 1 1 1 1 0 1 1 0 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 168000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1  0  0  0 -1  0  0  1 -1  0  1  0 -1] (Indices: [3, 4, 5, 8, 9, 10, 11, 15, 18, 19]), Candidate: [2 1 2 0 1 0 1 1 1 1 0 0 1 1 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 168050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1  0  0 -1  0  1 -1  1  0  0 -1  0  0] (Indices: [3, 4, 5, 8, 9, 10, 13, 15, 16, 17]), Candidate: [ 2  1  2  0  1  0  1  1  1  1 -1  1  2  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 168100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1  0 -1  1  0 -1  0  1  0  0 -1  0  0] (Indices: [3, 4, 5, 8, 9, 11, 12, 15, 16, 17]), Candidate: [2 1 2 0 1 0 1 1 1 0 1 1 0 1 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 168150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1  0 -1  0  1  0  0 -1  1 -1  1 -1  0] (Indices: [3, 4, 5, 8, 9, 12, 13, 14, 16, 18]), Candidate: [ 2  1  2  0  1  0  1  1  1  0  0  2  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 168200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1  0 -1  0  0  0  0  1  0  0  0  0 -1] (Indices: [3, 4, 5, 8, 9, 15, 16, 17, 18, 19]), Candidate: [2 1 2 0 1 0 1 1 1 0 0 1 1 1 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 168250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1 -1  1  0 -1  1 -1  1 -1  1 -1  1 -1] (Indices: [3, 4, 5, 8, 10, 11, 13, 15, 17, 19]), Candidate: [2 1 2 0 1 0 1 1 0 2 0 0 2 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 168300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1 -1  1 -1  1 -1  1 -1  0  1  0  0 -1] (Indices: [3, 4, 5, 8, 10, 12, 14, 17, 18, 19]), Candidate: [ 2  1  2  0  1  0  1  1  0  2 -1  2  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 168350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1 -1  0  1  0 -1  1  0 -1  1  0 -1  0] (Indices: [3, 4, 5, 8, 11, 12, 14, 15, 17, 18]), Candidate: [2 1 2 0 1 0 1 1 0 1 1 1 0 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 168400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1 -1  0  0  1 -1  1  0  0 -1  1  0 -1] (Indices: [3, 4, 5, 8, 12, 14, 15, 16, 18, 19]), Candidate: [2 1 2 0 1 0 1 1 0 1 0 2 0 2 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 168450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  1  0  0 -1  1  0 -1  1  0 -1  0  0] (Indices: [3, 4, 5, 9, 10, 11, 13, 14, 16, 17]), Candidate: [ 2  1  2  0  1  0  1  0  2  1  0  0  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 168500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  1  0 -1  1  0 -1  0  0  1  0  0 -1] (Indices: [3, 4, 5, 9, 10, 12, 13, 17, 18, 19]), Candidate: [ 2  1  2  0  1  0  1  0  2  1 -1  2  1  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 168550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  1 -1  1  0  0 -1  1 -1  1  0 -1  0] (Indices: [3, 4, 5, 9, 11, 12, 13, 15, 17, 18]), Candidate: [2 1 2 0 1 0 1 0 2 0 1 1 1 0 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 168600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  1 -1  0  1  0  0 -1  1  0 -1  1 -1] (Indices: [3, 4, 5, 9, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  1  2  0  1  0  1  0  2  0  0  2  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 168650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  0  1  0  0 -1  1 -1  0  1  0  0 -1] (Indices: [3, 4, 5, 10, 11, 12, 14, 17, 18, 19]), Candidate: [ 2  1  2  0  1  0  1  0  1  2  0  1  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 168700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  0  1 -1  0  1  0  0  0 -1  1  0 -1] (Indices: [3, 4, 5, 10, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  1  2  0  1  0  1  0  1  2 -1  1  2  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 168750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0  0  0  0 -1  1 -1  0  1 -1  0  0  0] (Indices: [3, 4, 6, 7, 8, 9, 10, 11, 13, 16]), Candidate: [2 1 2 0 0 2 1 0 1 1 0 0 2 0 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 168800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0  0  0 -1  0  1 -1  0  1 -1  1 -1  0] (Indices: [3, 4, 6, 7, 8, 9, 10, 13, 16, 18]), Candidate: [ 2  1  2  0  0  2  1  0  1  1 -1  1  2  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 168850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0  0 -1  1 -1  1  0 -1  0  0  0  1 -1] (Indices: [3, 4, 6, 7, 8, 9, 11, 13, 14, 19]), Candidate: [ 2  1  2  0  0  2  1  0  1  0  1  0  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 168900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0  0 -1  0  1 -1  1 -1  1  0 -1  0  0] (Indices: [3, 4, 6, 7, 8, 9, 12, 14, 16, 17]), Candidate: [ 2  1  2  0  0  2  1  0  1  0  0  2  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 168950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0  0 -1  0  0  0  0  0  1  0  0  0 -1] (Indices: [3, 4, 6, 7, 8, 9, 16, 17, 18, 19]), Candidate: [2 1 2 0 0 2 1 0 1 0 0 1 1 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 169000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0 -1  1  0 -1  0  0  1 -1  1  0 -1  0] (Indices: [3, 4, 6, 7, 8, 10, 11, 15, 17, 18]), Candidate: [2 1 2 0 0 2 1 0 0 2 0 0 1 1 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 169050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0 -1  1 -1  0  1  0 -1  0  1 -1  1 -1] (Indices: [3, 4, 6, 7, 8, 10, 13, 14, 17, 19]), Candidate: [ 2  1  2  0  0  2  1  0  0  2 -1  1  2  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 169100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0 -1  0  1  0 -1  1 -1  0  1 -1  1 -1] (Indices: [3, 4, 6, 7, 8, 11, 12, 14, 17, 19]), Candidate: [ 2  1  2  0  0  2  1  0  0  1  1  1  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 169150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0 -1  0  0  1  0  0  0 -1  0  0  1 -1] (Indices: [3, 4, 6, 7, 8, 12, 13, 14, 15, 19]), Candidate: [2 1 2 0 0 2 1 0 0 1 0 2 1 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 169200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0 -1  0  0  0  0  1  0 -1  1  0  0 -1] (Indices: [3, 4, 6, 7, 8, 14, 15, 17, 18, 19]), Candidate: [2 1 2 0 0 2 1 0 0 1 0 1 1 2 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 169250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  1  0  0 -1  0  0  1  0 -1  1 -1  0] (Indices: [3, 4, 6, 7, 9, 10, 11, 15, 16, 18]), Candidate: [ 2  1  2  0  0  2  1 -1  2  1  0  0  1  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 169300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  1  0 -1  0  1  0 -1  1 -1  0  1 -1] (Indices: [3, 4, 6, 7, 9, 10, 13, 14, 16, 19]), Candidate: [ 2  1  2  0  0  2  1 -1  2  1 -1  1  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 169350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  1 -1  1  0 -1  1 -1  1 -1  0  1 -1] (Indices: [3, 4, 6, 7, 9, 11, 12, 14, 16, 19]), Candidate: [ 2  1  2  0  0  2  1 -1  2  0  1  1  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 169400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  1 -1  0  1  0  0  0 -1  1 -1  0  0] (Indices: [3, 4, 6, 7, 9, 12, 13, 14, 15, 17]), Candidate: [ 2  1  2  0  0  2  1 -1  2  0  0  2  1  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 169450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  1 -1  0  0  0  1  0  0  0 -1  1 -1] (Indices: [3, 4, 6, 7, 9, 14, 15, 16, 17, 19]), Candidate: [ 2  1  2  0  0  2  1 -1  2  0  0  1  1  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 169500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  0  1  0 -1  1 -1  1  0  0 -1  0  0] (Indices: [3, 4, 6, 7, 10, 11, 13, 15, 16, 17]), Candidate: [ 2  1  2  0  0  2  1 -1  1  2  0  0  2  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 169550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  0  1 -1  1 -1  1  0 -1  0  1  0 -1] (Indices: [3, 4, 6, 7, 10, 12, 14, 15, 18, 19]), Candidate: [ 2  1  2  0  0  2  1 -1  1  2 -1  2  0  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 169600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  0  0  1  0  0 -1  0  0  1  0  0 -1] (Indices: [3, 4, 6, 7, 11, 12, 13, 17, 18, 19]), Candidate: [ 2  1  2  0  0  2  1 -1  1  1  1  1  1  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 169650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  0  0  0  1  0 -1  1 -1  1  0  0 -1] (Indices: [3, 4, 6, 7, 12, 13, 15, 17, 18, 19]), Candidate: [ 2  1  2  0  0  2  1 -1  1  1  0  2  1  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 169700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1  0  0  0 -1  1 -1  0  0  0  1  0 -1] (Indices: [3, 4, 6, 8, 9, 10, 11, 13, 18, 19]), Candidate: [2 1 2 0 0 2 0 1 1 1 0 0 2 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 169750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1  0  0 -1  1 -1  0  1 -1  1 -1  1 -1] (Indices: [3, 4, 6, 8, 9, 10, 12, 15, 17, 19]), Candidate: [ 2  1  2  0  0  2  0  1  1  1 -1  2  0  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 169800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1  0 -1  1  0  0 -1  0  1  0 -1  0  0] (Indices: [3, 4, 6, 8, 9, 11, 12, 13, 16, 17]), Candidate: [2 1 2 0 0 2 0 1 1 0 1 1 1 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 169850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1  0 -1  1 -1  0  1  0 -1  1 -1  1 -1] (Indices: [3, 4, 6, 8, 9, 11, 14, 15, 17, 19]), Candidate: [2 1 2 0 0 2 0 1 1 0 1 0 1 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 169900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1  0 -1  0  0  1  0  0 -1  1 -1  1 -1] (Indices: [3, 4, 6, 8, 9, 13, 14, 15, 17, 19]), Candidate: [2 1 2 0 0 2 0 1 1 0 0 1 2 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 169950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1 -1  1  0  0 -1  0  0  1 -1  1  0 -1] (Indices: [3, 4, 6, 8, 10, 11, 12, 16, 18, 19]), Candidate: [2 1 2 0 0 2 0 1 0 2 0 1 0 1 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 170000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1 -1  1 -1  1  0 -1  1 -1  1  0 -1  0] (Indices: [3, 4, 6, 8, 10, 12, 13, 15, 17, 18]), Candidate: [ 2  1  2  0  0  2  0  1  0  2 -1  2  1  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 170050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1 -1  0  1  0  0  0 -1  0  1  0 -1  0] (Indices: [3, 4, 6, 8, 11, 12, 13, 14, 17, 18]), Candidate: [ 2  1  2  0  0  2  0  1  0  1  1  1  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 170100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1 -1  0  0  1  0  0  0  0 -1  1 -1  0] (Indices: [3, 4, 6, 8, 12, 13, 14, 15, 16, 18]), Candidate: [2 1 2 0 0 2 0 1 0 1 0 2 1 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 170150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  1  0  0  0 -1  1 -1  0  1 -1  1 -1] (Indices: [3, 4, 6, 9, 10, 11, 12, 14, 17, 19]), Candidate: [ 2  1  2  0  0  2  0  0  2  1  0  1  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 170200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  1  0 -1  1  0  0  0 -1  0  0  1 -1] (Indices: [3, 4, 6, 9, 10, 12, 13, 14, 15, 19]), Candidate: [ 2  1  2  0  0  2  0  0  2  1 -1  2  1  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 170250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  1  0 -1  0  0  1  0 -1  1  0  0 -1] (Indices: [3, 4, 6, 9, 10, 14, 15, 17, 18, 19]), Candidate: [ 2  1  2  0  0  2  0  0  2  1 -1  1  1  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 170300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  1 -1  1 -1  1 -1  1  0 -1  1  0 -1] (Indices: [3, 4, 6, 9, 11, 13, 15, 16, 18, 19]), Candidate: [2 1 2 0 0 2 0 0 2 0 1 0 2 0 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 170350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  0  1  0  0  0 -1  1 -1  1  0 -1  0] (Indices: [3, 4, 6, 10, 11, 12, 13, 15, 17, 18]), Candidate: [2 1 2 0 0 2 0 0 1 2 0 1 1 0 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 170400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  0  1 -1  1  0  0 -1  1  0 -1  1 -1] (Indices: [3, 4, 6, 10, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  1  2  0  0  2  0  0  1  2 -1  2  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 170450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  0  0  0  1  0  0  0  0  0 -1  1 -1] (Indices: [3, 4, 6, 12, 13, 14, 15, 16, 17, 19]), Candidate: [2 1 2 0 0 2 0 0 1 1 0 2 1 1 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 170500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0  0  0  0 -1  0  1 -1  0  1  0 -1  0] (Indices: [3, 4, 7, 8, 9, 10, 11, 14, 17, 18]), Candidate: [ 2  1  2  0  0  1  2  0  1  1  0  0  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 170550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0  0  0 -1  0  1  0  0 -1  0  1 -1  0] (Indices: [3, 4, 7, 8, 9, 10, 13, 14, 15, 18]), Candidate: [ 2  1  2  0  0  1  2  0  1  1 -1  1  2  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 170600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0  0 -1  1  0 -1  1  0 -1  0  1 -1  0] (Indices: [3, 4, 7, 8, 9, 11, 12, 14, 15, 18]), Candidate: [2 1 2 0 0 1 2 0 1 0 1 1 0 2 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 170650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0  0 -1  1 -1  0  0  1  0 -1  1  0 -1] (Indices: [3, 4, 7, 8, 9, 11, 15, 16, 18, 19]), Candidate: [2 1 2 0 0 1 2 0 1 0 1 0 1 1 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 170700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0  0 -1  0  0  1 -1  1  0 -1  1  0 -1] (Indices: [3, 4, 7, 8, 9, 13, 15, 16, 18, 19]), Candidate: [2 1 2 0 0 1 2 0 1 0 0 1 2 0 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 170750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0 -1  1  0 -1  1  0 -1  1 -1  0  1 -1] (Indices: [3, 4, 7, 8, 10, 11, 13, 14, 16, 19]), Candidate: [ 2  1  2  0  0  1  2  0  0  2  0  0  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 170800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0 -1  1 -1  1 -1  1  0  0 -1  1 -1  0] (Indices: [3, 4, 7, 8, 10, 12, 14, 15, 16, 18]), Candidate: [ 2  1  2  0  0  1  2  0  0  2 -1  2  0  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 170850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0 -1  0  1  0  0 -1  1 -1  0  1  0 -1] (Indices: [3, 4, 7, 8, 11, 12, 13, 15, 18, 19]), Candidate: [2 1 2 0 0 1 2 0 0 1 1 1 1 0 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 170900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0 -1  0  0  1  0  0 -1  0  1  0  0 -1] (Indices: [3, 4, 7, 8, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  1  2  0  0  1  2  0  0  1  0  2  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 170950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  1  0  0  0 -1  0  0  1  0  0 -1  0] (Indices: [3, 4, 7, 9, 10, 11, 12, 16, 17, 18]), Candidate: [ 2  1  2  0  0  1  2 -1  2  1  0  1  0  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 171000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  1  0 -1  1  0 -1  1  0 -1  1 -1  0] (Indices: [3, 4, 7, 9, 10, 12, 13, 15, 16, 18]), Candidate: [ 2  1  2  0  0  1  2 -1  2  1 -1  2  1  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 171050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  1 -1  1  0  0  0 -1  1 -1  1 -1  0] (Indices: [3, 4, 7, 9, 11, 12, 13, 14, 16, 18]), Candidate: [ 2  1  2  0  0  1  2 -1  2  0  1  1  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 171100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  1 -1  1 -1  0  0  1  0  0  0  0 -1] (Indices: [3, 4, 7, 9, 11, 15, 16, 17, 18, 19]), Candidate: [ 2  1  2  0  0  1  2 -1  2  0  1  0  1  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 171150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  0  1  0  0 -1  1  0  0 -1  1 -1  0] (Indices: [3, 4, 7, 10, 11, 12, 14, 15, 16, 18]), Candidate: [ 2  1  2  0  0  1  2 -1  1  2  0  1  0  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 171200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  0  1 -1  1 -1  1  0  0  0  0 -1  0] (Indices: [3, 4, 7, 10, 12, 14, 15, 16, 17, 18]), Candidate: [ 2  1  2  0  0  1  2 -1  1  2 -1  2  0  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 171250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1  0  0  0  0  0  0 -1  1 -1  0  0  0] (Indices: [3, 4, 8, 9, 10, 11, 12, 13, 14, 16]), Candidate: [ 2  1  2  0  0  1  1  1  1  1  0  1  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 171300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1  0  0  0 -1  1 -1  0  1  0  0 -1  0] (Indices: [3, 4, 8, 9, 10, 11, 13, 16, 17, 18]), Candidate: [2 1 2 0 0 1 1 1 1 1 0 0 2 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 171350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1  0  0 -1  1 -1  0  1  0  0 -1  1 -1] (Indices: [3, 4, 8, 9, 10, 12, 15, 16, 17, 19]), Candidate: [ 2  1  2  0  0  1  1  1  1  1 -1  2  0  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 171400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1  0 -1  1  0 -1  1  0 -1  0  1  0 -1] (Indices: [3, 4, 8, 9, 11, 12, 14, 15, 18, 19]), Candidate: [2 1 2 0 0 1 1 1 1 0 1 1 0 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 171450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1  0 -1  0  1 -1  1 -1  1  0  0  0 -1] (Indices: [3, 4, 8, 9, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  1  2  0  0  1  1  1  1  0  0  2  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 171500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1 -1  1  0 -1  1  0 -1  1  0  0 -1  0] (Indices: [3, 4, 8, 10, 11, 13, 14, 16, 17, 18]), Candidate: [ 2  1  2  0  0  1  1  1  0  2  0  0  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 171550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1 -1  0  1  0  0  0 -1  1  0 -1  1 -1] (Indices: [3, 4, 8, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  1  2  0  0  1  1  1  0  1  1  1  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 171600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  1  0  0  0 -1  1  0  0 -1  1 -1  0] (Indices: [3, 4, 9, 10, 11, 12, 14, 15, 16, 18]), Candidate: [2 1 2 0 0 1 1 0 2 1 0 1 0 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 171650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  1  0 -1  1 -1  1  0  0  0  0 -1  0] (Indices: [3, 4, 9, 10, 12, 14, 15, 16, 17, 18]), Candidate: [ 2  1  2  0  0  1  1  0  2  1 -1  2  0  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 171700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  0  1  0  0  0  0  0  0 -1  1 -1  0] (Indices: [3, 4, 10, 11, 12, 13, 14, 15, 16, 18]), Candidate: [2 1 2 0 0 1 1 0 1 2 0 1 1 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 171750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0  0  0  0  0 -1  0  0  0  0  0  1 -1] (Indices: [3, 5, 6, 7, 8, 9, 10, 11, 12, 19]), Candidate: [ 2  1  2 -1  2  1  1  0  1  1  0  1  0  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 171800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0  0  0 -1  0  1 -1  1 -1  0  1 -1  0] (Indices: [3, 5, 6, 7, 8, 9, 10, 13, 15, 18]), Candidate: [ 2  1  2 -1  2  1  1  0  1  1 -1  1  2  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 171850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0  0 -1  1 -1  1  0 -1  1 -1  0  0  0] (Indices: [3, 5, 6, 7, 8, 9, 11, 13, 14, 16]), Candidate: [ 2  1  2 -1  2  1  1  0  1  0  1  0  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 171900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0  0 -1  0  1 -1  1  0 -1  1 -1  0  0] (Indices: [3, 5, 6, 7, 8, 9, 12, 14, 15, 17]), Candidate: [ 2  1  2 -1  2  1  1  0  1  0  0  2  0  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 171950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0  0 -1  0  0  0  0  1  0  0 -1  1 -1] (Indices: [3, 5, 6, 7, 8, 9, 15, 16, 17, 19]), Candidate: [ 2  1  2 -1  2  1  1  0  1  0  0  1  1  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 172000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0 -1  1  0 -1  0  0  1  0  0 -1  0  0] (Indices: [3, 5, 6, 7, 8, 10, 11, 15, 16, 17]), Candidate: [ 2  1  2 -1  2  1  1  0  0  2  0  0  1  1  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 172050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0 -1  1 -1  0  1  0 -1  1 -1  1 -1  0] (Indices: [3, 5, 6, 7, 8, 10, 13, 14, 16, 18]), Candidate: [ 2  1  2 -1  2  1  1  0  0  2 -1  1  2  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 172100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0 -1  0  1  0 -1  1 -1  1 -1  1 -1  0] (Indices: [3, 5, 6, 7, 8, 11, 12, 14, 16, 18]), Candidate: [ 2  1  2 -1  2  1  1  0  0  1  1  1  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 172150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0 -1  0  0  1  0  0  0  0 -1  0  0  0] (Indices: [3, 5, 6, 7, 8, 12, 13, 14, 15, 16]), Candidate: [ 2  1  2 -1  2  1  1  0  0  1  0  2  1  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 172200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0 -1  0  0  0  0  1  0  0  0  0 -1  0] (Indices: [3, 5, 6, 7, 8, 14, 15, 16, 17, 18]), Candidate: [ 2  1  2 -1  2  1  1  0  0  1  0  1  1  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 172250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  1  0  0 -1  0  1 -1  0  1 -1  1 -1] (Indices: [3, 5, 6, 7, 9, 10, 11, 14, 17, 19]), Candidate: [ 2  1  2 -1  2  1  1 -1  2  1  0  0  1  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 172300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  1  0 -1  0  1  0  0 -1  0  0  1 -1] (Indices: [3, 5, 6, 7, 9, 10, 13, 14, 15, 19]), Candidate: [ 2  1  2 -1  2  1  1 -1  2  1 -1  1  2  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 172350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  1 -1  1  0 -1  1  0 -1  0  0  1 -1] (Indices: [3, 5, 6, 7, 9, 11, 12, 14, 15, 19]), Candidate: [ 2  1  2 -1  2  1  1 -1  2  0  1  1  0  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 172400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  1 -1  1 -1  0  0  1 -1  1  0  0 -1] (Indices: [3, 5, 6, 7, 9, 11, 15, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  1  1 -1  2  0  1  0  1  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 172450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  1 -1  0  0  1 -1  1 -1  1  0  0 -1] (Indices: [3, 5, 6, 7, 9, 13, 15, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  1  1 -1  2  0  0  1  2  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 172500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  0  1  0 -1  1  0 -1  0  1  0 -1  0] (Indices: [3, 5, 6, 7, 10, 11, 13, 14, 17, 18]), Candidate: [ 2  1  2 -1  2  1  1 -1  1  2  0  0  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 172550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  0  1 -1  1 -1  1  0  0 -1  0  1 -1] (Indices: [3, 5, 6, 7, 10, 12, 14, 15, 16, 19]), Candidate: [ 2  1  2 -1  2  1  1 -1  1  2 -1  2  0  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 172600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  0  0  1  0  0 -1  0  1  0  0 -1  0] (Indices: [3, 5, 6, 7, 11, 12, 13, 16, 17, 18]), Candidate: [ 2  1  2 -1  2  1  1 -1  1  1  1  1  1  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 172650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  0  0  0  1  0 -1  1  0  0  0 -1  0] (Indices: [3, 5, 6, 7, 12, 13, 15, 16, 17, 18]), Candidate: [ 2  1  2 -1  2  1  1 -1  1  1  0  2  1  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 172700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1  0  0  0 -1  1 -1  0  1 -1  0  1 -1] (Indices: [3, 5, 6, 8, 9, 10, 11, 13, 16, 19]), Candidate: [ 2  1  2 -1  2  1  0  1  1  1  0  0  2  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 172750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1  0  0 -1  1 -1  0  1  0 -1  1 -1  0] (Indices: [3, 5, 6, 8, 9, 10, 12, 15, 16, 18]), Candidate: [ 2  1  2 -1  2  1  0  1  1  1 -1  2  0  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 172800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1  0 -1  1  0  0 -1  1 -1  1 -1  0  0] (Indices: [3, 5, 6, 8, 9, 11, 12, 13, 15, 17]), Candidate: [ 2  1  2 -1  2  1  0  1  1  0  1  1  1  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 172850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1  0 -1  1 -1  0  1  0  0 -1  1 -1  0] (Indices: [3, 5, 6, 8, 9, 11, 14, 15, 16, 18]), Candidate: [ 2  1  2 -1  2  1  0  1  1  0  1  0  1  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 172900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1  0 -1  0  0  1  0  0  0 -1  1 -1  0] (Indices: [3, 5, 6, 8, 9, 13, 14, 15, 16, 18]), Candidate: [ 2  1  2 -1  2  1  0  1  1  0  0  1  2  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 172950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1 -1  1  0  0 -1  0  1 -1  0  1  0 -1] (Indices: [3, 5, 6, 8, 10, 11, 12, 15, 18, 19]), Candidate: [ 2  1  2 -1  2  1  0  1  0  2  0  1  0  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 173000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1 -1  1 -1  1  0 -1  1  0  0 -1  0  0] (Indices: [3, 5, 6, 8, 10, 12, 13, 15, 16, 17]), Candidate: [ 2  1  2 -1  2  1  0  1  0  2 -1  2  1  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 173050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1 -1  0  1  0  0  0 -1  1  0 -1  0  0] (Indices: [3, 5, 6, 8, 11, 12, 13, 14, 16, 17]), Candidate: [ 2  1  2 -1  2  1  0  1  0  1  1  1  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 173100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1 -1  0  1 -1  0  1 -1  1  0  0  0 -1] (Indices: [3, 5, 6, 8, 11, 14, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  1  0  1  0  1  1  0  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 173150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  1  0  0  0 -1  1 -1  1 -1  1 -1  0] (Indices: [3, 5, 6, 9, 10, 11, 12, 14, 16, 18]), Candidate: [ 2  1  2 -1  2  1  0  0  2  1  0  1  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 173200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  1  0 -1  1  0  0  0  0 -1  0  0  0] (Indices: [3, 5, 6, 9, 10, 12, 13, 14, 15, 16]), Candidate: [ 2  1  2 -1  2  1  0  0  2  1 -1  2  1  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 173250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  1  0 -1  0  0  1  0  0  0  0 -1  0] (Indices: [3, 5, 6, 9, 10, 14, 15, 16, 17, 18]), Candidate: [ 2  1  2 -1  2  1  0  0  2  1 -1  1  1  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 173300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  1 -1  1 -1  1  0 -1  0  1  0  0 -1] (Indices: [3, 5, 6, 9, 11, 13, 14, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  1  0  0  2  0  1  0  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 173350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  0  1  0  0  0 -1  1  0  0 -1  0  0] (Indices: [3, 5, 6, 10, 11, 12, 13, 15, 16, 17]), Candidate: [ 2  1  2 -1  2  1  0  0  1  2  0  1  1  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 173400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  0  1 -1  1  0  0  0 -1  1 -1  1 -1] (Indices: [3, 5, 6, 10, 12, 13, 14, 15, 17, 19]), Candidate: [ 2  1  2 -1  2  1  0  0  1  2 -1  2  1  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 173450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  0  0  1 -1  1 -1  1  0  0  0  0 -1] (Indices: [3, 5, 6, 11, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  1  0  0  1  1  1  0  2  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 173500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0  0  0  0 -1  0  1 -1  1  0 -1  0  0] (Indices: [3, 5, 7, 8, 9, 10, 11, 14, 16, 17]), Candidate: [ 2  1  2 -1  2  0  2  0  1  1  0  0  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 173550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0  0  0 -1  1 -1  0  0  0  1  0  0 -1] (Indices: [3, 5, 7, 8, 9, 10, 12, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  0  2  0  1  1 -1  2  0  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 173600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0  0 -1  1  0  0 -1  0  0  0  1  0 -1] (Indices: [3, 5, 7, 8, 9, 11, 12, 13, 18, 19]), Candidate: [ 2  1  2 -1  2  0  2  0  1  0  1  1  1  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 173650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0  0 -1  1 -1  0  1 -1  0  1  0  0 -1] (Indices: [3, 5, 7, 8, 9, 11, 14, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  0  2  0  1  0  1  0  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 173700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0  0 -1  0  0  1  0 -1  0  1  0  0 -1] (Indices: [3, 5, 7, 8, 9, 13, 14, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  0  2  0  1  0  0  1  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 173750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0 -1  1  0 -1  1  0  0 -1  0  0  1 -1] (Indices: [3, 5, 7, 8, 10, 11, 13, 14, 15, 19]), Candidate: [ 2  1  2 -1  2  0  2  0  0  2  0  0  2  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 173800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0 -1  1 -1  1  0 -1  0  1 -1  1  0 -1] (Indices: [3, 5, 7, 8, 10, 12, 13, 16, 18, 19]), Candidate: [ 2  1  2 -1  2  0  2  0  0  2 -1  2  1  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 173850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0 -1  0  1  0  0 -1  1  0 -1  0  1 -1] (Indices: [3, 5, 7, 8, 11, 12, 13, 15, 16, 19]), Candidate: [ 2  1  2 -1  2  0  2  0  0  1  1  1  1  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 173900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0 -1  0  0  1  0  0 -1  1  0  0 -1  0] (Indices: [3, 5, 7, 8, 12, 13, 14, 16, 17, 18]), Candidate: [ 2  1  2 -1  2  0  2  0  0  1  0  2  1  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 173950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  1  0  0  0 -1  0  1 -1  1  0 -1  0] (Indices: [3, 5, 7, 9, 10, 11, 12, 15, 17, 18]), Candidate: [ 2  1  2 -1  2  0  2 -1  2  1  0  1  0  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 174000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  1  0 -1  1  0  0 -1  0  1 -1  1 -1] (Indices: [3, 5, 7, 9, 10, 12, 13, 14, 17, 19]), Candidate: [ 2  1  2 -1  2  0  2 -1  2  1 -1  2  1  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 174050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  1 -1  1  0  0  0  0 -1  0  1 -1  0] (Indices: [3, 5, 7, 9, 11, 12, 13, 14, 15, 18]), Candidate: [ 2  1  2 -1  2  0  2 -1  2  0  1  1  1  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 174100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  1 -1  1 -1  0  1  0  0 -1  1  0 -1] (Indices: [3, 5, 7, 9, 11, 14, 15, 16, 18, 19]), Candidate: [ 2  1  2 -1  2  0  2 -1  2  0  1  0  1  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 174150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  0  1  0  0  0 -1  0  1 -1  1  0 -1] (Indices: [3, 5, 7, 10, 11, 12, 13, 16, 18, 19]), Candidate: [ 2  1  2 -1  2  0  2 -1  1  2  0  1  1  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 174200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  0  1 -1  1  0 -1  1  0 -1  1  0 -1] (Indices: [3, 5, 7, 10, 12, 13, 15, 16, 18, 19]), Candidate: [ 2  1  2 -1  2  0  2 -1  1  2 -1  2  1  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 174250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  0  0  0  1 -1  1  0  0  0  0  0 -1] (Indices: [3, 5, 7, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  0  2 -1  1  1  0  2  0  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 174300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1  0  0  0 -1  1 -1  1 -1  1  0 -1  0] (Indices: [3, 5, 8, 9, 10, 11, 13, 15, 17, 18]), Candidate: [ 2  1  2 -1  2  0  1  1  1  1  0  0  2  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 174350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1  0  0 -1  1 -1  1 -1  1 -1  1  0 -1] (Indices: [3, 5, 8, 9, 10, 12, 14, 16, 18, 19]), Candidate: [ 2  1  2 -1  2  0  1  1  1  1 -1  2  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 174400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1  0 -1  1  0 -1  1  0  0 -1  0  1 -1] (Indices: [3, 5, 8, 9, 11, 12, 14, 15, 16, 19]), Candidate: [ 2  1  2 -1  2  0  1  1  1  0  1  1  0  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 174450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1  0 -1  0  1 -1  1  0  0  0 -1  1 -1] (Indices: [3, 5, 8, 9, 12, 14, 15, 16, 17, 19]), Candidate: [ 2  1  2 -1  2  0  1  1  1  0  0  2  0  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 174500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1 -1  1  0 -1  1  0  0 -1  1  0 -1  0] (Indices: [3, 5, 8, 10, 11, 13, 14, 15, 17, 18]), Candidate: [ 2  1  2 -1  2  0  1  1  0  2  0  0  2  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 174550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1 -1  0  1  0  0  0  0 -1  1 -1  1 -1] (Indices: [3, 5, 8, 11, 12, 13, 14, 15, 17, 19]), Candidate: [ 2  1  2 -1  2  0  1  1  0  1  1  1  1  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 174600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  1  0  0  0  0 -1  0  1 -1  1  0 -1] (Indices: [3, 5, 9, 10, 11, 12, 13, 16, 18, 19]), Candidate: [ 2  1  2 -1  2  0  1  0  2  1  0  1  1  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 174650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  1  0 -1  1  0 -1  1  0 -1  1  0 -1] (Indices: [3, 5, 9, 10, 12, 13, 15, 16, 18, 19]), Candidate: [ 2  1  2 -1  2  0  1  0  2  1 -1  2  1  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 174700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  1 -1  0  1 -1  1  0  0  0  0  0 -1] (Indices: [3, 5, 9, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  0  1  0  2  0  0  2  0  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 174750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0  0  0  0  0  0 -1  0  0  1 -1  0  0] (Indices: [3, 6, 7, 8, 9, 10, 11, 12, 13, 17]), Candidate: [ 2  1  2 -1  1  2  1  0  1  1  0  1  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 174800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0  0  0  0 -1  0  0  0  1  0 -1  1 -1] (Indices: [3, 6, 7, 8, 9, 10, 11, 16, 17, 19]), Candidate: [ 2  1  2 -1  1  2  1  0  1  1  0  0  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 174850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0  0  0 -1  0  1 -1  1  0 -1  0  1 -1] (Indices: [3, 6, 7, 8, 9, 10, 13, 15, 16, 19]), Candidate: [ 2  1  2 -1  1  2  1  0  1  1 -1  1  2  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 174900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0  0 -1  1  0 -1  0  1  0 -1  0  1 -1] (Indices: [3, 6, 7, 8, 9, 11, 12, 15, 16, 19]), Candidate: [ 2  1  2 -1  1  2  1  0  1  0  1  1  0  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 174950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0  0 -1  0  1  0  0 -1  0  1  0 -1  0] (Indices: [3, 6, 7, 8, 9, 12, 13, 14, 17, 18]), Candidate: [ 2  1  2 -1  1  2  1  0  1  0  0  2  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 175000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0 -1  1  0  0  0  0 -1  1 -1  0  0  0] (Indices: [3, 6, 7, 8, 10, 11, 12, 13, 14, 16]), Candidate: [ 2  1  2 -1  1  2  1  0  0  2  0  1  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 175050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0 -1  1  0 -1  1 -1  0  1  0  0 -1  0] (Indices: [3, 6, 7, 8, 10, 11, 13, 16, 17, 18]), Candidate: [ 2  1  2 -1  1  2  1  0  0  2  0  0  2  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 175100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0 -1  1 -1  1 -1  0  1  0  0 -1  1 -1] (Indices: [3, 6, 7, 8, 10, 12, 15, 16, 17, 19]), Candidate: [ 2  1  2 -1  1  2  1  0  0  2 -1  2  0  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 175150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0 -1  0  1  0 -1  1  0 -1  0  1  0 -1] (Indices: [3, 6, 7, 8, 11, 12, 14, 15, 18, 19]), Candidate: [ 2  1  2 -1  1  2  1  0  0  1  1  1  0  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 175200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0 -1  0  0  1 -1  1 -1  1  0  0  0 -1] (Indices: [3, 6, 7, 8, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  2  1  0  0  1  0  2  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 175250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  1  0  0 -1  1  0 -1  1 -1  0  1 -1] (Indices: [3, 6, 7, 9, 10, 11, 13, 14, 16, 19]), Candidate: [ 2  1  2 -1  1  2  1 -1  2  1  0  0  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 175300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  1  0 -1  1 -1  1  0  0 -1  1 -1  0] (Indices: [3, 6, 7, 9, 10, 12, 14, 15, 16, 18]), Candidate: [ 2  1  2 -1  1  2  1 -1  2  1 -1  2  0  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 175350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  1 -1  1  0  0 -1  1 -1  0  1  0 -1] (Indices: [3, 6, 7, 9, 11, 12, 13, 15, 18, 19]), Candidate: [ 2  1  2 -1  1  2  1 -1  2  0  1  1  1  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 175400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  1 -1  0  1  0  0 -1  0  1  0  0 -1] (Indices: [3, 6, 7, 9, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  2  1 -1  2  0  0  2  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 175450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  0  1  0  0 -1  0  1  0  0 -1  1 -1] (Indices: [3, 6, 7, 10, 11, 12, 15, 16, 17, 19]), Candidate: [ 2  1  2 -1  1  2  1 -1  1  2  0  1  0  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 175500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  0  1 -1  0  1  0 -1  1  0  0  0 -1] (Indices: [3, 6, 7, 10, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  2  1 -1  1  2 -1  1  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 175550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1  0  0  0  0  0 -1  0  1 -1  0  1 -1] (Indices: [3, 6, 8, 9, 10, 11, 12, 13, 16, 19]), Candidate: [ 2  1  2 -1  1  2  0  1  1  1  0  1  1  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 175600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1  0  0  0 -1  0  1 -1  1  0  0 -1  0] (Indices: [3, 6, 8, 9, 10, 11, 14, 16, 17, 18]), Candidate: [ 2  1  2 -1  1  2  0  1  1  1  0  0  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 175650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1  0  0 -1  0  1  0 -1  1  0  0 -1  0] (Indices: [3, 6, 8, 9, 10, 13, 14, 16, 17, 18]), Candidate: [ 2  1  2 -1  1  2  0  1  1  1 -1  1  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 175700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1  0 -1  1 -1  1  0  0  0  0 -1  0  0] (Indices: [3, 6, 8, 9, 11, 13, 14, 15, 16, 17]), Candidate: [ 2  1  2 -1  1  2  0  1  1  0  1  0  2  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 175750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1 -1  1  0  0  0  0  0 -1  1 -1  0  0] (Indices: [3, 6, 8, 10, 11, 12, 13, 14, 15, 17]), Candidate: [ 2  1  2 -1  1  2  0  1  0  2  0  1  1  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 175800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1 -1  1  0 -1  0  1  0  0  0 -1  1 -1] (Indices: [3, 6, 8, 10, 11, 14, 15, 16, 17, 19]), Candidate: [ 2  1  2 -1  1  2  0  1  0  2  0  0  1  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 175850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1 -1  0  1  0 -1  1  0  0 -1  1  0 -1] (Indices: [3, 6, 8, 11, 12, 14, 15, 16, 18, 19]), Candidate: [ 2  1  2 -1  1  2  0  1  0  1  1  1  0  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 175900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  1  0  0  0 -1  0  1  0  0 -1  1 -1] (Indices: [3, 6, 9, 10, 11, 12, 15, 16, 17, 19]), Candidate: [ 2  1  2 -1  1  2  0  0  2  1  0  1  0  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 175950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  1  0 -1  0  1  0 -1  1  0  0  0 -1] (Indices: [3, 6, 9, 10, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  2  0  0  2  1 -1  1  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 176000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  0  1  0  0  0 -1  1  0  0 -1  1 -1] (Indices: [3, 6, 10, 11, 12, 13, 15, 16, 17, 19]), Candidate: [ 2  1  2 -1  1  2  0  0  1  2  0  1  1  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 176050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0  0  0  0  0 -1  1  0 -1  1 -1  0  0] (Indices: [3, 7, 8, 9, 10, 11, 12, 14, 15, 17]), Candidate: [ 2  1  2 -1  1  1  2  0  1  1  0  1  0  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 176100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0  0  0  0 -1  0  0  1  0  0 -1  1 -1] (Indices: [3, 7, 8, 9, 10, 11, 15, 16, 17, 19]), Candidate: [ 2  1  2 -1  1  1  2  0  1  1  0  0  1  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 176150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0  0  0 -1  0  1 -1  1  0  0 -1  1 -1] (Indices: [3, 7, 8, 9, 10, 13, 15, 16, 17, 19]), Candidate: [ 2  1  2 -1  1  1  2  0  1  1 -1  1  2  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 176200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0  0 -1  1 -1  1  0  0 -1  0  1  0 -1] (Indices: [3, 7, 8, 9, 11, 13, 14, 15, 18, 19]), Candidate: [ 2  1  2 -1  1  1  2  0  1  0  1  0  2  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 176250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0 -1  1  0  0  0  0 -1  1 -1  0  1 -1] (Indices: [3, 7, 8, 10, 11, 12, 13, 14, 16, 19]), Candidate: [ 2  1  2 -1  1  1  2  0  0  2  0  1  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 176300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0 -1  1 -1  1  0  0  0  0  0 -1  0  0] (Indices: [3, 7, 8, 10, 12, 13, 14, 15, 16, 17]), Candidate: [ 2  1  2 -1  1  1  2  0  0  2 -1  2  1  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 176350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0 -1  0  1 -1  1  0  0  0  0 -1  1 -1] (Indices: [3, 7, 8, 11, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  1  2 -1  1  1  2  0  0  1  1  0  2  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 176400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  1  0  0 -1  1  0  0  0 -1  1 -1  0] (Indices: [3, 7, 9, 10, 11, 13, 14, 15, 16, 18]), Candidate: [ 2  1  2 -1  1  1  2 -1  2  1  0  0  2  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 176450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  1 -1  1  0  0  0  0  0 -1  0  1 -1] (Indices: [3, 7, 9, 11, 12, 13, 14, 15, 16, 19]), Candidate: [ 2  1  2 -1  1  1  2 -1  2  0  1  1  1  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 176500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  0  1  0  0 -1  1  0  0  0 -1  1 -1] (Indices: [3, 7, 10, 11, 12, 14, 15, 16, 17, 19]), Candidate: [ 2  1  2 -1  1  1  2 -1  1  2  0  1  0  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 176550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1  0  0  0  0 -1  1  0  0 -1  1 -1  0] (Indices: [3, 8, 9, 10, 11, 12, 14, 15, 16, 18]), Candidate: [ 2  1  2 -1  1  1  1  1  1  1  0  1  0  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 176600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1  0  0 -1  1 -1  1  0  0  0  0 -1  0] (Indices: [3, 8, 9, 10, 12, 14, 15, 16, 17, 18]), Candidate: [ 2  1  2 -1  1  1  1  1  1  1 -1  2  0  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 176650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1 -1  1  0  0  0  0  0  0 -1  1 -1  0] (Indices: [3, 8, 10, 11, 12, 13, 14, 15, 16, 18]), Candidate: [ 2  1  2 -1  1  1  1  1  0  2  0  1  1  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 176700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  1  0  0  0  0  0 -1  1  0  0 -1  0] (Indices: [3, 9, 10, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 2  1  2 -1  1  1  1  0  2  1  0  1  1  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 176750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0  0  0  0  0 -1  1 -1  0  0  0  0  0] (Indices: [4, 5, 6, 7, 8, 9, 10, 11, 12, 14]), Candidate: [ 2  1  1  1  1  1  1  0  1  1  0  1  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 176800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0  0  0 -1  0  1  0 -1  0  1 -1  0  0] (Indices: [4, 5, 6, 7, 8, 9, 10, 13, 14, 17]), Candidate: [ 2  1  1  1  1  1  1  0  1  1 -1  1  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 176850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0  0 -1  1  0 -1  0  0  1 -1  0  1 -1] (Indices: [4, 5, 6, 7, 8, 9, 11, 12, 16, 19]), Candidate: [2 1 1 1 1 1 1 0 1 0 1 1 0 1 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 176900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0  0 -1  0  1  0 -1  0  1 -1  0  1 -1] (Indices: [4, 5, 6, 7, 8, 9, 12, 13, 16, 19]), Candidate: [2 1 1 1 1 1 1 0 1 0 0 2 1 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 176950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0  0 -1  0  0  0  1 -1  1  0  0 -1  0] (Indices: [4, 5, 6, 7, 8, 9, 14, 16, 17, 18]), Candidate: [ 2  1  1  1  1  1  1  0  1  0  0  1  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 177000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0 -1  1  0 -1  0  1 -1  1 -1  1 -1  0] (Indices: [4, 5, 6, 7, 8, 10, 11, 14, 16, 18]), Candidate: [ 2  1  1  1  1  1  1  0  0  2  0  0  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 177050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0 -1  1 -1  0  1  0  0  0 -1  0  0  0] (Indices: [4, 5, 6, 7, 8, 10, 13, 14, 15, 16]), Candidate: [ 2  1  1  1  1  1  1  0  0  2 -1  1  2  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 177100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0 -1  0  1  0 -1  1  0  0 -1  0  0  0] (Indices: [4, 5, 6, 7, 8, 11, 12, 14, 15, 16]), Candidate: [2 1 1 1 1 1 1 0 0 1 1 1 0 2 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 177150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0 -1  0  1 -1  0  0  1  0  0  0 -1  0] (Indices: [4, 5, 6, 7, 8, 11, 15, 16, 17, 18]), Candidate: [2 1 1 1 1 1 1 0 0 1 1 0 1 1 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 177200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0 -1  0  0  0  1 -1  1  0  0  0 -1  0] (Indices: [4, 5, 6, 7, 8, 13, 15, 16, 17, 18]), Candidate: [2 1 1 1 1 1 1 0 0 1 0 1 2 0 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 177250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  1  0  0 -1  0  1  0 -1  0  0  1 -1] (Indices: [4, 5, 6, 7, 9, 10, 11, 14, 15, 19]), Candidate: [ 2  1  1  1  1  1  1 -1  2  1  0  0  1  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 177300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  1  0 -1  1 -1  0  0  1 -1  1  0 -1] (Indices: [4, 5, 6, 7, 9, 10, 12, 16, 18, 19]), Candidate: [ 2  1  1  1  1  1  1 -1  2  1 -1  2  0  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 177350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  1 -1  1  0  0 -1  0  0  1 -1  1 -1] (Indices: [4, 5, 6, 7, 9, 11, 12, 13, 17, 19]), Candidate: [ 2  1  1  1  1  1  1 -1  2  0  1  1  1  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 177400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  1 -1  1 -1  0  1 -1  1 -1  1  0 -1] (Indices: [4, 5, 6, 7, 9, 11, 14, 16, 18, 19]), Candidate: [ 2  1  1  1  1  1  1 -1  2  0  1  0  1  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 177450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  1 -1  0  0  1  0 -1  1 -1  1  0 -1] (Indices: [4, 5, 6, 7, 9, 13, 14, 16, 18, 19]), Candidate: [ 2  1  1  1  1  1  1 -1  2  0  0  1  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 177500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  0  1  0 -1  1  0  0 -1  0  1 -1  0] (Indices: [4, 5, 6, 7, 10, 11, 13, 14, 15, 18]), Candidate: [ 2  1  1  1  1  1  1 -1  1  2  0  0  2  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 177550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  0  1 -1  1  0 -1  0  1  0 -1  1 -1] (Indices: [4, 5, 6, 7, 10, 12, 13, 16, 17, 19]), Candidate: [ 2  1  1  1  1  1  1 -1  1  2 -1  2  1  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 177600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  0  0  1  0  0 -1  1  0 -1  1 -1  0] (Indices: [4, 5, 6, 7, 11, 12, 13, 15, 16, 18]), Candidate: [ 2  1  1  1  1  1  1 -1  1  1  1  1  1  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 177650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  0  0  0  1  0  0  0 -1  0  1  0 -1] (Indices: [4, 5, 6, 7, 12, 13, 14, 15, 18, 19]), Candidate: [ 2  1  1  1  1  1  1 -1  1  1  0  2  1  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 177700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1  0  0  0 -1  1 -1  1 -1  1 -1  0  0] (Indices: [4, 5, 6, 8, 9, 10, 11, 13, 15, 17]), Candidate: [2 1 1 1 1 1 0 1 1 1 0 0 2 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 177750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1  0  0 -1  1 -1  1 -1  1 -1  0  1 -1] (Indices: [4, 5, 6, 8, 9, 10, 12, 14, 16, 19]), Candidate: [ 2  1  1  1  1  1  0  1  1  1 -1  2  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 177800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1  0 -1  1  0  0  0 -1  1 -1  0  0  0] (Indices: [4, 5, 6, 8, 9, 11, 12, 13, 14, 16]), Candidate: [ 2  1  1  1  1  1  0  1  1  0  1  1  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 177850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1  0 -1  1 -1  1 -1  0  1  0  0 -1  0] (Indices: [4, 5, 6, 8, 9, 11, 13, 16, 17, 18]), Candidate: [2 1 1 1 1 1 0 1 1 0 1 0 2 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 177900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1  0 -1  0  1 -1  0  1  0  0 -1  1 -1] (Indices: [4, 5, 6, 8, 9, 12, 15, 16, 17, 19]), Candidate: [2 1 1 1 1 1 0 1 1 0 0 2 0 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 177950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1 -1  1  0  0 -1  0  1  0  0 -1  0  0] (Indices: [4, 5, 6, 8, 10, 11, 12, 15, 16, 17]), Candidate: [2 1 1 1 1 1 0 1 0 2 0 1 0 1 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 178000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1 -1  1 -1  1  0  0 -1  1 -1  1 -1  0] (Indices: [4, 5, 6, 8, 10, 12, 13, 14, 16, 18]), Candidate: [ 2  1  1  1  1  1  0  1  0  2 -1  2  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 178050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1 -1  1 -1  0  0  0  1  0  0  0  0 -1] (Indices: [4, 5, 6, 8, 10, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1  1  1  1  0  1  0  2 -1  1  1  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 178100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1 -1  0  1 -1  1 -1  0  1  0  0  0 -1] (Indices: [4, 5, 6, 8, 11, 13, 16, 17, 18, 19]), Candidate: [2 1 1 1 1 1 0 1 0 1 1 0 2 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 178150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  1  0  0  0 -1  1  0  0 -1  0  0  0] (Indices: [4, 5, 6, 9, 10, 11, 12, 14, 15, 16]), Candidate: [2 1 1 1 1 1 0 0 2 1 0 1 0 2 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 178200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  1  0  0 -1  0  0  1  0  0  0 -1  0] (Indices: [4, 5, 6, 9, 10, 11, 15, 16, 17, 18]), Candidate: [2 1 1 1 1 1 0 0 2 1 0 0 1 1 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 178250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  1  0 -1  0  1 -1  1  0  0  0 -1  0] (Indices: [4, 5, 6, 9, 10, 13, 15, 16, 17, 18]), Candidate: [ 2  1  1  1  1  1  0  0  2  1 -1  1  2  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 178300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  1 -1  1 -1  1  0  0 -1  1 -1  1 -1] (Indices: [4, 5, 6, 9, 11, 13, 14, 15, 17, 19]), Candidate: [2 1 1 1 1 1 0 0 2 0 1 0 2 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 178350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  0  1  0  0  0  0 -1  1 -1  1 -1  0] (Indices: [4, 5, 6, 10, 11, 12, 13, 14, 16, 18]), Candidate: [ 2  1  1  1  1  1  0  0  1  2  0  1  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 178400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  0  1  0 -1  0  0  1  0  0  0  0 -1] (Indices: [4, 5, 6, 10, 11, 15, 16, 17, 18, 19]), Candidate: [2 1 1 1 1 1 0 0 1 2 0 0 1 1 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 178450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  0  0  1 -1  1  0  0  0  0  0 -1  0] (Indices: [4, 5, 6, 11, 13, 14, 15, 16, 17, 18]), Candidate: [2 1 1 1 1 1 0 0 1 1 1 0 2 1 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 178500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0  0  0  0 -1  1 -1  0  0  0  1  0 -1] (Indices: [4, 5, 7, 8, 9, 10, 11, 13, 18, 19]), Candidate: [2 1 1 1 1 0 2 0 1 1 0 0 2 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 178550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0  0  0 -1  1 -1  0  1 -1  1 -1  1 -1] (Indices: [4, 5, 7, 8, 9, 10, 12, 15, 17, 19]), Candidate: [ 2  1  1  1  1  0  2  0  1  1 -1  2  0  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 178600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0  0 -1  1  0  0 -1  0  1  0 -1  0  0] (Indices: [4, 5, 7, 8, 9, 11, 12, 13, 16, 17]), Candidate: [2 1 1 1 1 0 2 0 1 0 1 1 1 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 178650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0  0 -1  1 -1  0  1  0 -1  1 -1  1 -1] (Indices: [4, 5, 7, 8, 9, 11, 14, 15, 17, 19]), Candidate: [2 1 1 1 1 0 2 0 1 0 1 0 1 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 178700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0  0 -1  0  0  1  0  0 -1  1 -1  1 -1] (Indices: [4, 5, 7, 8, 9, 13, 14, 15, 17, 19]), Candidate: [2 1 1 1 1 0 2 0 1 0 0 1 2 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 178750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0 -1  1  0  0 -1  0  0  1 -1  1  0 -1] (Indices: [4, 5, 7, 8, 10, 11, 12, 16, 18, 19]), Candidate: [2 1 1 1 1 0 2 0 0 2 0 1 0 1 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 178800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0 -1  1 -1  1  0 -1  1 -1  1  0 -1  0] (Indices: [4, 5, 7, 8, 10, 12, 13, 15, 17, 18]), Candidate: [ 2  1  1  1  1  0  2  0  0  2 -1  2  1  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 178850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0 -1  0  1  0  0  0 -1  0  1  0 -1  0] (Indices: [4, 5, 7, 8, 11, 12, 13, 14, 17, 18]), Candidate: [ 2  1  1  1  1  0  2  0  0  1  1  1  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 178900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0 -1  0  0  1  0  0  0  0 -1  1 -1  0] (Indices: [4, 5, 7, 8, 12, 13, 14, 15, 16, 18]), Candidate: [2 1 1 1 1 0 2 0 0 1 0 2 1 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 178950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  1  0  0  0 -1  1 -1  0  1 -1  1 -1] (Indices: [4, 5, 7, 9, 10, 11, 12, 14, 17, 19]), Candidate: [ 2  1  1  1  1  0  2 -1  2  1  0  1  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 179000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  1  0 -1  1  0  0  0 -1  0  0  1 -1] (Indices: [4, 5, 7, 9, 10, 12, 13, 14, 15, 19]), Candidate: [ 2  1  1  1  1  0  2 -1  2  1 -1  2  1  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 179050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  1  0 -1  0  0  1  0 -1  1  0  0 -1] (Indices: [4, 5, 7, 9, 10, 14, 15, 17, 18, 19]), Candidate: [ 2  1  1  1  1  0  2 -1  2  1 -1  1  1  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 179100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  1 -1  1 -1  1 -1  1  0 -1  1  0 -1] (Indices: [4, 5, 7, 9, 11, 13, 15, 16, 18, 19]), Candidate: [ 2  1  1  1  1  0  2 -1  2  0  1  0  2  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 179150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  0  1  0  0  0 -1  1 -1  1  0 -1  0] (Indices: [4, 5, 7, 10, 11, 12, 13, 15, 17, 18]), Candidate: [ 2  1  1  1  1  0  2 -1  1  2  0  1  1  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 179200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  0  1 -1  1  0  0 -1  1  0 -1  1 -1] (Indices: [4, 5, 7, 10, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  1  1  1  1  0  2 -1  1  2 -1  2  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 179250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  0  0  0  1  0  0  0  0  0 -1  1 -1] (Indices: [4, 5, 7, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  1  1  1  1  0  2 -1  1  1  0  2  1  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 179300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1  0  0  0 -1  1  0 -1  0  1 -1  1 -1] (Indices: [4, 5, 8, 9, 10, 11, 13, 14, 17, 19]), Candidate: [ 2  1  1  1  1  0  1  1  1  1  0  0  2  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 179350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1  0  0 -1  1 -1  1  0 -1  1  0 -1  0] (Indices: [4, 5, 8, 9, 10, 12, 14, 15, 17, 18]), Candidate: [ 2  1  1  1  1  0  1  1  1  1 -1  2  0  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 179400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1  0 -1  1  0  0 -1  0  1  0 -1  1 -1] (Indices: [4, 5, 8, 9, 11, 12, 13, 16, 17, 19]), Candidate: [2 1 1 1 1 0 1 1 1 0 1 1 1 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 179450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1  0 -1  0  1  0 -1  1  0  0 -1  1 -1] (Indices: [4, 5, 8, 9, 12, 13, 15, 16, 17, 19]), Candidate: [2 1 1 1 1 0 1 1 1 0 0 2 1 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 179500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1 -1  1  0  0 -1  0  1 -1  1  0  0 -1] (Indices: [4, 5, 8, 10, 11, 12, 15, 17, 18, 19]), Candidate: [2 1 1 1 1 0 1 1 0 2 0 1 0 1 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 179550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1 -1  1 -1  0  0  1  0  0  0  0  0 -1] (Indices: [4, 5, 8, 10, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1  1  1  0  1  1  0  2 -1  1  1  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 179600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  1  0  0  0  0 -1  1 -1  1  0 -1  0] (Indices: [4, 5, 9, 10, 11, 12, 13, 15, 17, 18]), Candidate: [2 1 1 1 1 0 1 0 2 1 0 1 1 0 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 179650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  1  0 -1  1  0  0 -1  1  0 -1  1 -1] (Indices: [4, 5, 9, 10, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  1  1  1  1  0  1  0  2  1 -1  2  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 179700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  1 -1  0  1  0  0  0  0  0 -1  1 -1] (Indices: [4, 5, 9, 12, 13, 14, 15, 16, 17, 19]), Candidate: [2 1 1 1 1 0 1 0 2 0 0 2 1 1 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 179750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  0  0  1 -1  1  0  0  0  0  0  0 -1] (Indices: [4, 5, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 1 1 1 1 0 1 0 1 1 1 0 2 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 179800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0  0  0  0 -1  0  0  1  0 -1  0  1 -1] (Indices: [4, 6, 7, 8, 9, 10, 11, 15, 16, 19]), Candidate: [2 1 1 1 0 2 1 0 1 1 0 0 1 1 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 179850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0  0  0 -1  0  1  0 -1  0  1  0 -1  0] (Indices: [4, 6, 7, 8, 9, 10, 13, 14, 17, 18]), Candidate: [ 2  1  1  1  0  2  1  0  1  1 -1  1  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 179900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0  0 -1  1  0 -1  1 -1  0  1  0 -1  0] (Indices: [4, 6, 7, 8, 9, 11, 12, 14, 17, 18]), Candidate: [ 2  1  1  1  0  2  1  0  1  0  1  1  0  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 179950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0  0 -1  0  1  0  0  0 -1  0  1 -1  0] (Indices: [4, 6, 7, 8, 9, 12, 13, 14, 15, 18]), Candidate: [2 1 1 1 0 2 1 0 1 0 0 2 1 1 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 180000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0  0 -1  0  0  0  1  0  0 -1  1  0 -1] (Indices: [4, 6, 7, 8, 9, 14, 15, 16, 18, 19]), Candidate: [2 1 1 1 0 2 1 0 1 0 0 1 1 2 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 180050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0 -1  1  0 -1  1 -1  1  0 -1  1 -1  0] (Indices: [4, 6, 7, 8, 10, 11, 13, 15, 16, 18]), Candidate: [2 1 1 1 0 2 1 0 0 2 0 0 2 0 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 180100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0 -1  1 -1  1 -1  1 -1  1  0  0 -1  0] (Indices: [4, 6, 7, 8, 10, 12, 14, 16, 17, 18]), Candidate: [ 2  1  1  1  0  2  1  0  0  2 -1  2  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 180150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0 -1  0  1  0 -1  1  0  0  0 -1  0  0] (Indices: [4, 6, 7, 8, 11, 12, 14, 15, 16, 17]), Candidate: [2 1 1 1 0 2 1 0 0 1 1 1 0 2 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 180200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0 -1  0  0  1  0 -1  0  1  0  0  0 -1] (Indices: [4, 6, 7, 8, 12, 13, 16, 17, 18, 19]), Candidate: [2 1 1 1 0 2 1 0 0 1 0 2 1 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 180250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  1  0  0 -1  1  0  0 -1  1 -1  0  0] (Indices: [4, 6, 7, 9, 10, 11, 13, 14, 15, 17]), Candidate: [ 2  1  1  1  0  2  1 -1  2  1  0  0  2  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 180300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  1  0 -1  1  0 -1  0  1  0  0 -1  0] (Indices: [4, 6, 7, 9, 10, 12, 13, 16, 17, 18]), Candidate: [ 2  1  1  1  0  2  1 -1  2  1 -1  2  1  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 180350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  1 -1  1  0  0 -1  1  0  0 -1  0  0] (Indices: [4, 6, 7, 9, 11, 12, 13, 15, 16, 17]), Candidate: [ 2  1  1  1  0  2  1 -1  2  0  1  1  1  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 180400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  1 -1  0  1  0  0  0 -1  1 -1  1 -1] (Indices: [4, 6, 7, 9, 12, 13, 14, 15, 17, 19]), Candidate: [ 2  1  1  1  0  2  1 -1  2  0  0  2  1  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 180450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  0  1  0  0 -1  1 -1  1  0  0 -1  0] (Indices: [4, 6, 7, 10, 11, 12, 14, 16, 17, 18]), Candidate: [ 2  1  1  1  0  2  1 -1  1  2  0  1  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 180500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  0  1 -1  1 -1  0  1  0  0  0  0 -1] (Indices: [4, 6, 7, 10, 12, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1  1  0  2  1 -1  1  2 -1  2  0  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 180550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1  0  0  0  0  0 -1  1 -1  1 -1  0  0] (Indices: [4, 6, 8, 9, 10, 11, 12, 13, 15, 17]), Candidate: [2 1 1 1 0 2 0 1 1 1 0 1 1 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 180600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1  0  0  0 -1  0  1  0  0 -1  1 -1  0] (Indices: [4, 6, 8, 9, 10, 11, 14, 15, 16, 18]), Candidate: [2 1 1 1 0 2 0 1 1 1 0 0 1 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 180650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1  0  0 -1  0  1  0  0  0 -1  1 -1  0] (Indices: [4, 6, 8, 9, 10, 13, 14, 15, 16, 18]), Candidate: [ 2  1  1  1  0  2  0  1  1  1 -1  1  2  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 180700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1  0 -1  1  0 -1  0  1  0  0  0 -1  0] (Indices: [4, 6, 8, 9, 11, 12, 15, 16, 17, 18]), Candidate: [2 1 1 1 0 2 0 1 1 0 1 1 0 1 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 180750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1  0 -1  0  0  1  0  0 -1  1  0  0 -1] (Indices: [4, 6, 8, 9, 13, 14, 15, 17, 18, 19]), Candidate: [2 1 1 1 0 2 0 1 1 0 0 1 2 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 180800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1 -1  1  0 -1  1 -1  1  0  0 -1  1 -1] (Indices: [4, 6, 8, 10, 11, 13, 15, 16, 17, 19]), Candidate: [2 1 1 1 0 2 0 1 0 2 0 0 2 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 180850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1 -1  0  1  0  0 -1  1  0 -1  1  0 -1] (Indices: [4, 6, 8, 11, 12, 13, 15, 16, 18, 19]), Candidate: [2 1 1 1 0 2 0 1 0 1 1 1 1 0 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 180900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  1  0  0  0 -1  1 -1  1  0  0 -1  0] (Indices: [4, 6, 9, 10, 11, 12, 14, 16, 17, 18]), Candidate: [ 2  1  1  1  0  2  0  0  2  1  0  1  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 180950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  1  0 -1  1 -1  0  1  0  0  0  0 -1] (Indices: [4, 6, 9, 10, 12, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1  1  0  2  0  0  2  1 -1  2  0  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 181000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  0  1  0  0  0  0 -1  1  0  0 -1  0] (Indices: [4, 6, 10, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 2  1  1  1  0  2  0  0  1  2  0  1  1  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 181050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0  0  0  0  0  0 -1  0  1 -1  0  1 -1] (Indices: [4, 7, 8, 9, 10, 11, 12, 13, 16, 19]), Candidate: [2 1 1 1 0 1 2 0 1 1 0 1 1 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 181100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0  0  0  0 -1  0  1 -1  1  0  0 -1  0] (Indices: [4, 7, 8, 9, 10, 11, 14, 16, 17, 18]), Candidate: [ 2  1  1  1  0  1  2  0  1  1  0  0  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 181150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0  0  0 -1  0  1  0 -1  1  0  0 -1  0] (Indices: [4, 7, 8, 9, 10, 13, 14, 16, 17, 18]), Candidate: [ 2  1  1  1  0  1  2  0  1  1 -1  1  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 181200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0  0 -1  1 -1  1  0  0  0  0 -1  0  0] (Indices: [4, 7, 8, 9, 11, 13, 14, 15, 16, 17]), Candidate: [2 1 1 1 0 1 2 0 1 0 1 0 2 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 181250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0 -1  1  0  0  0  0  0 -1  1 -1  0  0] (Indices: [4, 7, 8, 10, 11, 12, 13, 14, 15, 17]), Candidate: [2 1 1 1 0 1 2 0 0 2 0 1 1 1 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 181300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0 -1  1  0 -1  0  1  0  0  0 -1  1 -1] (Indices: [4, 7, 8, 10, 11, 14, 15, 16, 17, 19]), Candidate: [2 1 1 1 0 1 2 0 0 2 0 0 1 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 181350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0 -1  0  1  0 -1  1  0  0 -1  1  0 -1] (Indices: [4, 7, 8, 11, 12, 14, 15, 16, 18, 19]), Candidate: [2 1 1 1 0 1 2 0 0 1 1 1 0 2 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 181400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  1  0  0  0 -1  0  1  0  0 -1  1 -1] (Indices: [4, 7, 9, 10, 11, 12, 15, 16, 17, 19]), Candidate: [ 2  1  1  1  0  1  2 -1  2  1  0  1  0  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 181450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  1  0 -1  0  1  0 -1  1  0  0  0 -1] (Indices: [4, 7, 9, 10, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  1  0  1  2 -1  2  1 -1  1  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 181500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  0  1  0  0  0 -1  1  0  0 -1  1 -1] (Indices: [4, 7, 10, 11, 12, 13, 15, 16, 17, 19]), Candidate: [ 2  1  1  1  0  1  2 -1  1  2  0  1  1  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 181550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1  0  0  0  0  0 -1  0  1  0  0 -1  0] (Indices: [4, 8, 9, 10, 11, 12, 13, 16, 17, 18]), Candidate: [2 1 1 1 0 1 1 1 1 1 0 1 1 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 181600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1  0  0 -1  1  0 -1  1  0  0  0 -1  0] (Indices: [4, 8, 9, 10, 12, 13, 15, 16, 17, 18]), Candidate: [ 2  1  1  1  0  1  1  1  1  1 -1  2  1  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 181650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1  0 -1  0  1  0  0 -1  1  0  0  0 -1] (Indices: [4, 8, 9, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  1  0  1  1  1  1  0  0  2  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 181700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  1  0  0  0  0  0  0  0 -1  1 -1  0] (Indices: [4, 9, 10, 11, 12, 13, 14, 15, 16, 18]), Candidate: [2 1 1 1 0 1 1 0 2 1 0 1 1 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 181750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  0  0  1  0  0 -1  1  0  0  0  0  0 -1] (Indices: [4, 10, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [2 1 1 1 0 1 1 0 1 2 0 1 0 2 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 181800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0  0  0  0 -1  0  0  1  0  0 -1  0  0] (Indices: [5, 6, 7, 8, 9, 10, 11, 15, 16, 17]), Candidate: [2 1 1 0 2 1 1 0 1 1 0 0 1 1 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 181850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0  0  0 -1  0  1  0 -1  1 -1  1 -1  0] (Indices: [5, 6, 7, 8, 9, 10, 13, 14, 16, 18]), Candidate: [ 2  1  1  0  2  1  1  0  1  1 -1  1  2  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 181900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0  0 -1  1  0 -1  1 -1  1 -1  1 -1  0] (Indices: [5, 6, 7, 8, 9, 11, 12, 14, 16, 18]), Candidate: [ 2  1  1  0  2  1  1  0  1  0  1  1  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 181950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0  0 -1  0  1  0  0  0  0 -1  0  0  0] (Indices: [5, 6, 7, 8, 9, 12, 13, 14, 15, 16]), Candidate: [2 1 1 0 2 1 1 0 1 0 0 2 1 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 182000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0  0 -1  0  0  0  1  0  0  0  0 -1  0] (Indices: [5, 6, 7, 8, 9, 14, 15, 16, 17, 18]), Candidate: [2 1 1 0 2 1 1 0 1 0 0 1 1 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 182050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0 -1  1  0 -1  1  0 -1  0  0  1  0 -1] (Indices: [5, 6, 7, 8, 10, 11, 13, 14, 18, 19]), Candidate: [ 2  1  1  0  2  1  1  0  0  2  0  0  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 182100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0 -1  1 -1  1 -1  1  0 -1  1 -1  1 -1] (Indices: [5, 6, 7, 8, 10, 12, 14, 15, 17, 19]), Candidate: [ 2  1  1  0  2  1  1  0  0  2 -1  2  0  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 182150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0 -1  0  1  0  0 -1  0  1 -1  1  0 -1] (Indices: [5, 6, 7, 8, 11, 12, 13, 16, 18, 19]), Candidate: [2 1 1 0 2 1 1 0 0 1 1 1 1 0 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 182200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0 -1  0  0  1  0 -1  1  0 -1  1  0 -1] (Indices: [5, 6, 7, 8, 12, 13, 15, 16, 18, 19]), Candidate: [2 1 1 0 2 1 1 0 0 1 0 2 1 0 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 182250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  1  0  0  0 -1  0  0  0  1  0  0 -1] (Indices: [5, 6, 7, 9, 10, 11, 12, 17, 18, 19]), Candidate: [ 2  1  1  0  2  1  1 -1  2  1  0  1  0  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 182300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  1  0 -1  1  0 -1  1 -1  1 -1  1 -1] (Indices: [5, 6, 7, 9, 10, 12, 13, 15, 17, 19]), Candidate: [ 2  1  1  0  2  1  1 -1  2  1 -1  2  1  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 182350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  1 -1  1  0  0  0 -1  0  1 -1  1 -1] (Indices: [5, 6, 7, 9, 11, 12, 13, 14, 17, 19]), Candidate: [ 2  1  1  0  2  1  1 -1  2  0  1  1  1  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 182400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  1 -1  0  1  0  0  0  0 -1  0  1 -1] (Indices: [5, 6, 7, 9, 12, 13, 14, 15, 16, 19]), Candidate: [ 2  1  1  0  2  1  1 -1  2  0  0  2  1  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 182450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  0  1  0  0 -1  1  0 -1  1 -1  1 -1] (Indices: [5, 6, 7, 10, 11, 12, 14, 15, 17, 19]), Candidate: [ 2  1  1  0  2  1  1 -1  1  2  0  1  0  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 182500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  0  1 -1  1 -1  1  0 -1  1  0  0 -1] (Indices: [5, 6, 7, 10, 12, 14, 15, 17, 18, 19]), Candidate: [ 2  1  1  0  2  1  1 -1  1  2 -1  2  0  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 182550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1  0  0  0  0  0  0 -1  0  0  0  1 -1] (Indices: [5, 6, 8, 9, 10, 11, 12, 13, 14, 19]), Candidate: [ 2  1  1  0  2  1  0  1  1  1  0  1  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 182600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1  0  0  0 -1  1 -1  0  0  1  0  0 -1] (Indices: [5, 6, 8, 9, 10, 11, 13, 17, 18, 19]), Candidate: [2 1 1 0 2 1 0 1 1 1 0 0 2 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 182650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1  0  0 -1  1 -1  0  0  1  0  0  0 -1] (Indices: [5, 6, 8, 9, 10, 12, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  2  1  0  1  1  1 -1  2  0  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 182700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1  0 -1  1  0 -1  1 -1  1 -1  1  0 -1] (Indices: [5, 6, 8, 9, 11, 12, 14, 16, 18, 19]), Candidate: [ 2  1  1  0  2  1  0  1  1  0  1  1  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 182750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1  0 -1  0  0  1  0  0  0  0 -1  1 -1] (Indices: [5, 6, 8, 9, 13, 14, 15, 16, 17, 19]), Candidate: [2 1 1 0 2 1 0 1 1 0 0 1 2 1 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 182800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1 -1  1  0 -1  1  0 -1  0  1  0  0 -1] (Indices: [5, 6, 8, 10, 11, 13, 14, 17, 18, 19]), Candidate: [ 2  1  1  0  2  1  0  1  0  2  0  0  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 182850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1 -1  0  1  0  0 -1  1  0  0  0 -1  0] (Indices: [5, 6, 8, 11, 12, 13, 15, 16, 17, 18]), Candidate: [2 1 1 0 2 1 0 1 0 1 1 1 1 0 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 182900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  1  0  0  0 -1  1  0 -1  1 -1  1 -1] (Indices: [5, 6, 9, 10, 11, 12, 14, 15, 17, 19]), Candidate: [2 1 1 0 2 1 0 0 2 1 0 1 0 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 182950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  1  0 -1  1 -1  1  0 -1  1  0  0 -1] (Indices: [5, 6, 9, 10, 12, 14, 15, 17, 18, 19]), Candidate: [ 2  1  1  0  2  1  0  0  2  1 -1  2  0  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 183000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  0  1  0  0  0  0  0 -1  1 -1  1 -1] (Indices: [5, 6, 10, 11, 12, 13, 14, 15, 17, 19]), Candidate: [2 1 1 0 2 1 0 0 1 2 0 1 1 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 183050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0  0  0  0  0  0 -1  0  1  0 -1  0  0] (Indices: [5, 7, 8, 9, 10, 11, 12, 13, 16, 17]), Candidate: [2 1 1 0 2 0 2 0 1 1 0 1 1 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 183100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0  0  0  0 -1  0  1  0 -1  1 -1  1 -1] (Indices: [5, 7, 8, 9, 10, 11, 14, 15, 17, 19]), Candidate: [2 1 1 0 2 0 2 0 1 1 0 0 1 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 183150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0  0  0 -1  0  1  0  0 -1  1 -1  1 -1] (Indices: [5, 7, 8, 9, 10, 13, 14, 15, 17, 19]), Candidate: [ 2  1  1  0  2  0  2  0  1  1 -1  1  2  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 183200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0  0 -1  1  0 -1  0  1 -1  1  0  0 -1] (Indices: [5, 7, 8, 9, 11, 12, 15, 17, 18, 19]), Candidate: [2 1 1 0 2 0 2 0 1 0 1 1 0 1 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 183250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0  0 -1  0  0  0  1  0  0  0  0  0 -1] (Indices: [5, 7, 8, 9, 14, 15, 16, 17, 18, 19]), Candidate: [2 1 1 0 2 0 2 0 1 0 0 1 1 2 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 183300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0 -1  1  0 -1  1 -1  0  1  0  0  0 -1] (Indices: [5, 7, 8, 10, 11, 13, 16, 17, 18, 19]), Candidate: [2 1 1 0 2 0 2 0 0 2 0 0 2 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 183350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0 -1  0  1  0 -1  1  0  0  0  0 -1  0] (Indices: [5, 7, 8, 11, 12, 14, 15, 16, 17, 18]), Candidate: [2 1 1 0 2 0 2 0 0 1 1 1 0 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 183400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  1  0  0  0 -1  1 -1  0  1  0  0 -1] (Indices: [5, 7, 9, 10, 11, 12, 14, 17, 18, 19]), Candidate: [ 2  1  1  0  2  0  2 -1  2  1  0  1  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 183450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  1  0 -1  0  1  0  0  0 -1  1  0 -1] (Indices: [5, 7, 9, 10, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  1  1  0  2  0  2 -1  2  1 -1  1  2  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 183500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  0  1  0  0  0  0 -1  0  1  0  0 -1] (Indices: [5, 7, 10, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  1  1  0  2  0  2 -1  1  2  0  1  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 183550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1  0  0  0  0  0 -1  1 -1  1 -1  1 -1] (Indices: [5, 8, 9, 10, 11, 12, 13, 15, 17, 19]), Candidate: [2 1 1 0 2 0 1 1 1 1 0 1 1 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 183600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1  0  0 -1  1  0  0 -1  1 -1  1  0 -1] (Indices: [5, 8, 9, 10, 12, 13, 14, 16, 18, 19]), Candidate: [ 2  1  1  0  2  0  1  1  1  1 -1  2  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 183650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1  0 -1  0  1  0  0  0  0 -1  1  0 -1] (Indices: [5, 8, 9, 12, 13, 14, 15, 16, 18, 19]), Candidate: [2 1 1 0 2 0 1 1 1 0 0 2 1 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 183700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1 -1  0  0  1  0  0  0  0  0  0  0 -1] (Indices: [5, 8, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 1 1 0 2 0 1 1 0 1 0 2 1 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 183750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  0  0  1  0  0  0  0 -1  1  0  0  0 -1] (Indices: [5, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  2  0  1  0  1  2  0  1  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 183800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0  0  0  0 -1  1  0 -1  0  0  1  0 -1] (Indices: [6, 7, 8, 9, 10, 11, 13, 14, 18, 19]), Candidate: [ 2  1  1  0  1  2  1  0  1  1  0  0  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 183850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0  0  0 -1  1 -1  1  0 -1  1 -1  1 -1] (Indices: [6, 7, 8, 9, 10, 12, 14, 15, 17, 19]), Candidate: [ 2  1  1  0  1  2  1  0  1  1 -1  2  0  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 183900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0  0 -1  1  0  0 -1  0  1 -1  1  0 -1] (Indices: [6, 7, 8, 9, 11, 12, 13, 16, 18, 19]), Candidate: [2 1 1 0 1 2 1 0 1 0 1 1 1 0 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 183950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0  0 -1  0  1  0 -1  1  0 -1  1  0 -1] (Indices: [6, 7, 8, 9, 12, 13, 15, 16, 18, 19]), Candidate: [2 1 1 0 1 2 1 0 1 0 0 2 1 0 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 184000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0 -1  1  0  0 -1  0  0  1  0  0  0 -1] (Indices: [6, 7, 8, 10, 11, 12, 16, 17, 18, 19]), Candidate: [2 1 1 0 1 2 1 0 0 2 0 1 0 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 184050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0 -1  0  1  0  0  0  0  0  0 -1  0  0] (Indices: [6, 7, 8, 11, 12, 13, 14, 15, 16, 17]), Candidate: [2 1 1 0 1 2 1 0 0 1 1 1 1 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 184100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  1  0  0  0  0 -1  1 -1  1 -1  1 -1] (Indices: [6, 7, 9, 10, 11, 12, 13, 15, 17, 19]), Candidate: [ 2  1  1  0  1  2  1 -1  2  1  0  1  1  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 184150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  1  0 -1  1  0  0 -1  1 -1  1  0 -1] (Indices: [6, 7, 9, 10, 12, 13, 14, 16, 18, 19]), Candidate: [ 2  1  1  0  1  2  1 -1  2  1 -1  2  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 184200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  1 -1  0  1  0  0  0  0 -1  1  0 -1] (Indices: [6, 7, 9, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  1  1  0  1  2  1 -1  2  0  0  2  1  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 184250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  0  0  0  1  0  0  0  0  0  0  0 -1] (Indices: [6, 7, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  1  2  1 -1  1  1  0  2  1  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 184300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1  0  0  0 -1  1 -1  0  1  0  0  0 -1] (Indices: [6, 8, 9, 10, 11, 13, 16, 17, 18, 19]), Candidate: [2 1 1 0 1 2 0 1 1 1 0 0 2 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 184350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1  0 -1  1  0 -1  1  0  0  0  0 -1  0] (Indices: [6, 8, 9, 11, 12, 14, 15, 16, 17, 18]), Candidate: [2 1 1 0 1 2 0 1 1 0 1 1 0 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 184400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1 -1  1 -1  1  0  0  0  0  0 -1  1 -1] (Indices: [6, 8, 10, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  1  1  0  1  2  0  1  0  2 -1  2  1  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 184450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  0  1  0 -1  1 -1  1  0  0  0  0  0 -1] (Indices: [6, 9, 10, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  1  2  0  0  2  1 -1  2  0  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 184500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0  0  0  0  0 -1  1 -1  0  1  0  0 -1] (Indices: [7, 8, 9, 10, 11, 12, 14, 17, 18, 19]), Candidate: [ 2  1  1  0  1  1  2  0  1  1  0  1  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 184550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0  0  0 -1  0  1  0  0  0 -1  1  0 -1] (Indices: [7, 8, 9, 10, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  1  1  0  1  1  2  0  1  1 -1  1  2  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 184600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0 -1  1  0  0  0  0 -1  0  1  0  0 -1] (Indices: [7, 8, 10, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  1  1  0  1  1  2  0  0  2  0  1  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 184650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1 -1  1  0  0  0  0 -1  0  1  0  0  0 -1] (Indices: [7, 9, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  1  1  2 -1  2  1  0  1  1  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 184700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1  0  0  0  0  0  0 -1  0  1  0  0 -1] (Indices: [8, 9, 10, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  1  1  0  1  1  1  1  1  1  0  1  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 184750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  1  0  0  0  0  0 -1  1  0  0  0 -1] (Indices: [9, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  1  1  1  0  2  1  0  1  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Finished generating neighbors. Total valid neighbors found: 54692
  Size of neighborhood t=10: 54692
  Using 'fork' start method for multiprocessing.
  No improvement found for t=10 after processing 54692 neighbors.
No improving solution found or error occurred for t=10.

Attempting neighborhood t=11 (current best cost: 98.4663)
  Exploring neighborhood t=11 in parallel (current cost: 98.4663)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Attempt 50: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0 -1  0  0  0  0  0  0  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 16, 17]), Candidate: [2 1 1 0 1 1 1 0 0 1 0 1 1 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  1 -1  0  0  0  0  0  0  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 9, 18, 19]), Candidate: [ 2  1  1  0  1  1  1 -1  2  0  0  1  1  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  0  0  1 -1  0  1  0 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 11, 14, 15]), Candidate: [ 2  1  1  0  1  1  1 -1  1  1  1  0  1  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  0  0  0  0  1 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 13, 18, 19]), Candidate: [ 2  1  1  0  1  1  1 -1  1  1  0  1  2  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1  0 -1  0  0  1 -1  0  0  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 9, 13, 19]), Candidate: [2 1 1 0 1 1 0 1 1 0 0 1 2 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1 -1  1 -1  0  0  0  0  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 10, 17, 19]), Candidate: [ 2  1  1  0  1  1  0  1  0  2 -1  1  1  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1 -1  0  0  1 -1  0  0  0  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 12, 18, 19]), Candidate: [2 1 1 0 1 1 0 1 0 1 0 2 0 1 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  1  0 -1  1 -1  0  0  0  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 9, 10, 12, 19]), Candidate: [ 2  1  1  0  1  1  0  0  2  1 -1  2  0  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  1 -1  0  1  0  0 -1  0  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 9, 12, 13, 14]), Candidate: [ 2  1  1  0  1  1  0  0  2  0  0  2  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  1 -1  0  0  0  0  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 9, 15, 17, 19]), Candidate: [2 1 1 0 1 1 0 0 2 0 0 1 1 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  0  1 -1  1 -1  0  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 10, 12, 16, 18]), Candidate: [ 2  1  1  0  1  1  0  0  1  2 -1  2  0  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  0  0  1  0 -1  1 -1  0  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 11, 12, 14, 19]), Candidate: [ 2  1  1  0  1  1  0  0  1  1  1  1  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  0  0  0  1  0  0 -1  0  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 12, 13, 14, 19]), Candidate: [ 2  1  1  0  1  1  0  0  1  1  0  2  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  0  0  0  0  1 -1  0  0  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 13, 17, 18, 19]), Candidate: [2 1 1 0 1 1 0 0 1 1 0 1 2 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0  0 -1  0  0  0  1 -1  0  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 9, 14, 19]), Candidate: [ 2  1  1  0  1  0  2  0  1  0  0  1  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0 -1  0  1  0 -1  0  0  1 -1  0  0  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 11, 12, 16]), Candidate: [2 1 1 0 1 0 2 0 0 1 1 1 0 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0 -1  0  0  0  1  0 -1  0  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 13, 14, 19]), Candidate: [ 2  1  1  0  1  0  2  0  0  1  0  1  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  1  0 -1  0  1 -1  0  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 9, 10, 13, 18]), Candidate: [ 2  1  1  0  1  0  2 -1  2  1 -1  1  2  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  1 -1  0  1  0 -1  0  0  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 9, 12, 13, 19]), Candidate: [ 2  1  1  0  1  0  2 -1  2  0  0  2  1  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  1 -1  0  0  0  0  0  0  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 9, 17, 18, 19]), Candidate: [ 2  1  1  0  1  0  2 -1  2  0  0  1  1  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  0  1 -1  0  1  0  0 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 10, 13, 14, 15]), Candidate: [ 2  1  1  0  1  0  2 -1  1  2 -1  1  2  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  0  0  1  0 -1  0  0  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 11, 12, 16, 17]), Candidate: [ 2  1  1  0  1  0  2 -1  1  1  1  1  0  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  0  0  0  1  0 -1  0  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 12, 13, 16, 17]), Candidate: [ 2  1  1  0  1  0  2 -1  1  1  0  2  1  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  0  0  0  0  0  1  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 14, 15, 17, 19]), Candidate: [ 2  1  1  0  1  0  2 -1  1  1  0  1  1  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1  0 -1  1  0 -1  0  0  1 -1  0  0  1] (Indices: [0, 1, 2, 3, 4, 5, 8, 9, 11, 12, 16]), Candidate: [2 1 1 0 1 0 1 1 1 0 1 1 0 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 1300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1  0 -1  0  0  1  0 -1  0  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 8, 9, 13, 14, 19]), Candidate: [ 2  1  1  0  1  0  1  1  1  0  0  1  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1 -1  1  0 -1  0  0  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 8, 10, 11, 15, 17]), Candidate: [2 1 1 0 1 0 1 1 0 2 0 0 1 1 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 1400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1 -1  1 -1  0  0  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 8, 10, 14, 16, 18]), Candidate: [ 2  1  1  0  1  0  1  1  0  2 -1  1  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1 -1  0  1 -1  1 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 8, 11, 13, 18, 19]), Candidate: [2 1 1 0 1 0 1 1 0 1 1 0 2 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 1500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1 -1  0  0  1 -1  0  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 8, 12, 15, 17, 19]), Candidate: [2 1 1 0 1 0 1 1 0 1 0 2 0 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 1550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  1  0  0 -1  1 -1  0  1 -1  0  0  1] (Indices: [0, 1, 2, 3, 4, 5, 9, 10, 11, 13, 16]), Candidate: [2 1 1 0 1 0 1 0 2 1 0 0 2 0 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 1600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  1  0 -1  0  1 -1  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 9, 10, 13, 16, 18]), Candidate: [ 2  1  1  0  1  0  1  0  2  1 -1  1  2  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  1 -1  1 -1  1  0 -1  0  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 9, 11, 13, 14, 19]), Candidate: [ 2  1  1  0  1  0  1  0  2  0  1  0  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  1 -1  0  1 -1  1 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 9, 12, 14, 16, 17]), Candidate: [ 2  1  1  0  1  0  1  0  2  0  0  2  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  1 -1  0  0  0  0  0  1  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 9, 16, 17, 18, 19]), Candidate: [2 1 1 0 1 0 1 0 2 0 0 1 1 1 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 1800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  0  1  0 -1  0  0  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 10, 11, 15, 17, 18]), Candidate: [2 1 1 0 1 0 1 0 1 2 0 0 1 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 1850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  0  1 -1  0  1  0 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 10, 13, 14, 17, 19]), Candidate: [ 2  1  1  0  1  0  1  0  1  2 -1  1  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  0  0  1  0 -1  1 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 11, 12, 14, 17, 19]), Candidate: [ 2  1  1  0  1  0  1  0  1  1  1  1  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  0  0  0  1  0  0  0 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 12, 13, 14, 15, 19]), Candidate: [2 1 1 0 1 0 1 0 1 1 0 2 1 1 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 2000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  0  0  0  0  0  1  0 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 14, 15, 17, 18, 19]), Candidate: [2 1 1 0 1 0 1 0 1 1 0 1 1 2 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 2050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0 -1  1  0 -1  0  1 -1  0  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 10, 11, 14]), Candidate: [ 2  1  1  0  0  2  1  0  0  2  0  0  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0 -1  0  1 -1  0  1 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 11, 14, 18]), Candidate: [ 2  1  1  0  0  2  1  0  0  1  1  0  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0 -1  0  0  0  0  1  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 14, 15, 18]), Candidate: [2 1 1 0 0 2 1 0 0 1 0 1 1 2 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 2200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  1  0 -1  0  0  0  0  1 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 9, 10, 16, 19]), Candidate: [ 2  1  1  0  0  2  1 -1  2  1 -1  1  1  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  1 -1  0  1 -1  0  0  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 7, 9, 12, 17, 18]), Candidate: [ 2  1  1  0  0  2  1 -1  2  0  0  2  0  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  0  1  0 -1  1 -1  0  0  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 10, 11, 13, 19]), Candidate: [ 2  1  1  0  0  2  1 -1  1  2  0  0  2  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  0  1 -1  0  1 -1  0  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 10, 13, 17, 19]), Candidate: [ 2  1  1  0  0  2  1 -1  1  2 -1  1  2  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  0  0  1 -1  1 -1  1 -1  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 7, 11, 13, 15, 18]), Candidate: [ 2  1  1  0  0  2  1 -1  1  1  1  0  2  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  0  0  0  1 -1  1 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 7, 12, 14, 17, 18]), Candidate: [ 2  1  1  0  0  2  1 -1  1  1  0  2  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1  0  0  0 -1  0  1 -1  0  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 6, 8, 9, 10, 11, 14]), Candidate: [ 2  1  1  0  0  2  0  1  1  1  0  0  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1  0 -1  1 -1  0  1 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 8, 9, 11, 14, 18]), Candidate: [ 2  1  1  0  0  2  0  1  1  0  1  0  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1  0 -1  0  0  0  1  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 8, 9, 14, 15, 18]), Candidate: [2 1 1 0 0 2 0 1 1 0 0 1 1 2 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 2650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1 -1  1 -1  1  0 -1  0  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 8, 10, 12, 13, 18]), Candidate: [ 2  1  1  0  0  2  0  1  0  2 -1  2  1  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1 -1  1 -1  0  0  0  0  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 6, 8, 10, 16, 18, 19]), Candidate: [ 2  1  1  0  0  2  0  1  0  2 -1  1  1  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1 -1  0  1 -1  0  0  1  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 6, 8, 11, 15, 16, 19]), Candidate: [2 1 1 0 0 2 0 1 0 1 1 0 1 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 2800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1 -1  0  0  0  1  0 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 8, 13, 14, 17, 18]), Candidate: [ 2  1  1  0  0  2  0  1  0  1  0  1  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  1  0  0 -1  0  0  0  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 6, 9, 10, 11, 16, 17]), Candidate: [2 1 1 0 0 2 0 0 2 1 0 0 1 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 2900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  1  0 -1  0  0  1 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 6, 9, 10, 14, 17, 19]), Candidate: [ 2  1  1  0  0  2  0  0  2  1 -1  1  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  1 -1  1 -1  0  1  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 9, 11, 14, 15, 18]), Candidate: [2 1 1 0 0 2 0 0 2 0 1 0 1 2 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 3000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  1 -1  0  1 -1  0  0  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 6, 9, 12, 16, 17, 19]), Candidate: [2 1 1 0 0 2 0 0 2 0 0 2 0 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 3050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  0  1  0  0 -1  0  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 4, 6, 10, 11, 12, 15, 17]), Candidate: [2 1 1 0 0 2 0 0 1 2 0 1 0 1 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 3100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  0  1 -1  1  0 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 4, 6, 10, 12, 13, 15, 17]), Candidate: [ 2  1  1  0  0  2  0  0  1  2 -1  2  1  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  0  1 -1  0  0  1  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 10, 14, 15, 16, 18]), Candidate: [ 2  1  1  0  0  2  0  0  1  2 -1  1  1  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  0  0  1 -1  1  0  0 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 4, 6, 11, 13, 14, 15, 17]), Candidate: [2 1 1 0 0 2 0 0 1 1 1 0 2 1 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 3250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  0  0  0  1  0 -1  0  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 12, 13, 16, 17, 18]), Candidate: [2 1 1 0 0 2 0 0 1 1 0 2 1 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 3300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0  0  0 -1  1 -1  0  1 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 7, 8, 9, 10, 12, 15]), Candidate: [ 2  1  1  0  0  1  2  0  1  1 -1  2  0  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0  0 -1  1 -1  0  0  0  1 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 7, 8, 9, 11, 16, 19]), Candidate: [2 1 1 0 0 1 2 0 1 0 1 0 1 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 3400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0  0 -1  0  0  0  0  1  0  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 7, 8, 9, 15, 16, 17]), Candidate: [2 1 1 0 0 1 2 0 1 0 0 1 1 1 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 3450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0 -1  1 -1  1 -1  0  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 4, 7, 8, 10, 12, 15, 17]), Candidate: [ 2  1  1  0  0  1  2  0  0  2 -1  2  0  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0 -1  0  1  0 -1  1  0 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 7, 8, 11, 12, 14, 15]), Candidate: [2 1 1 0 0 1 2 0 0 1 1 1 0 2 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 3550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0 -1  0  0  1  0  0  0 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 7, 8, 12, 13, 14, 15]), Candidate: [2 1 1 0 0 1 2 0 0 1 0 2 1 1 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 3600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0 -1  0  0  0  1 -1  1 -1  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 7, 8, 13, 15, 18, 19]), Candidate: [2 1 1 0 0 1 2 0 0 1 0 1 2 0 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 3650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  1  0 -1  1  0 -1  0  1 -1  0  0  1] (Indices: [0, 1, 2, 3, 4, 7, 9, 10, 12, 13, 16]), Candidate: [ 2  1  1  0  0  1  2 -1  2  1 -1  2  1  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  1  0 -1  0  0  0  0  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 4, 7, 9, 10, 16, 17, 18]), Candidate: [ 2  1  1  0  0  1  2 -1  2  1 -1  1  1  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  1 -1  1 -1  0  0  1  0  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 7, 9, 11, 15, 16, 17]), Candidate: [ 2  1  1  0  0  1  2 -1  2  0  1  0  1  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  1 -1  0  0  1  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 3, 4, 7, 9, 13, 14, 16, 18]), Candidate: [ 2  1  1  0  0  1  2 -1  2  0  0  1  2  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  0  1  0  0 -1  0  0  0  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 7, 10, 11, 12, 18, 19]), Candidate: [ 2  1  1  0  0  1  2 -1  1  2  0  1  0  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  0  1 -1  1  0 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 7, 10, 12, 13, 18, 19]), Candidate: [ 2  1  1  0  0  1  2 -1  1  2 -1  2  1  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  0  1 -1  0  0  1 -1  0  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 7, 10, 14, 17, 18, 19]), Candidate: [ 2  1  1  0  0  1  2 -1  1  2 -1  1  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 4000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  0  0  1 -1  1  0 -1  0  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 7, 11, 13, 14, 18, 19]), Candidate: [ 2  1  1  0  0  1  2 -1  1  1  1  0  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  0  0  0  1 -1  1  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 7, 12, 14, 15, 17, 19]), Candidate: [ 2  1  1  0  0  1  2 -1  1  1  0  2  0  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1  0  0  0 -1  0  0  1  0 -1  0  0  1] (Indices: [0, 1, 2, 3, 4, 8, 9, 10, 11, 15, 16]), Candidate: [2 1 1 0 0 1 1 1 1 1 0 0 1 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 4150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1  0  0 -1  0  0  1 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 8, 9, 10, 14, 16, 17]), Candidate: [ 2  1  1  0  0  1  1  1  1  1 -1  1  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1  0 -1  1 -1  1 -1  0  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 8, 9, 11, 13, 17, 19]), Candidate: [2 1 1 0 0 1 1 1 1 0 1 0 2 0 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 4250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1  0 -1  0  1 -1  0  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 4, 8, 9, 12, 15, 17, 18]), Candidate: [2 1 1 0 0 1 1 1 1 0 0 2 0 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 4300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1 -1  1  0  0 -1  1 -1  0  1 -1  0  1] (Indices: [0, 1, 2, 3, 4, 8, 10, 11, 12, 14, 17]), Candidate: [ 2  1  1  0  0  1  1  1  0  2  0  1  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1 -1  1 -1  1  0  0 -1  0  1 -1  0  1] (Indices: [0, 1, 2, 3, 4, 8, 10, 12, 13, 14, 17]), Candidate: [ 2  1  1  0  0  1  1  1  0  2 -1  2  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1 -1  1 -1  0  1 -1  0  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 8, 10, 13, 16, 17, 19]), Candidate: [ 2  1  1  0  0  1  1  1  0  2 -1  1  2  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1 -1  0  1  0 -1  0  0  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 8, 11, 12, 16, 17, 19]), Candidate: [2 1 1 0 0 1 1 1 0 1 1 1 0 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 4500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1 -1  0  0  1  0 -1  1  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 8, 12, 13, 15, 16, 19]), Candidate: [2 1 1 0 0 1 1 1 0 1 0 2 1 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 4550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  1  0  0  0 -1  1  0 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 9, 10, 11, 12, 14, 15]), Candidate: [2 1 1 0 0 1 1 0 2 1 0 1 0 2 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 4600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  1  0 -1  1  0  0  0 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 9, 10, 12, 13, 14, 15]), Candidate: [ 2  1  1  0  0  1  1  0  2  1 -1  2  1  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  1  0 -1  0  1 -1  1 -1  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 9, 10, 13, 15, 18, 19]), Candidate: [ 2  1  1  0  0  1  1  0  2  1 -1  1  2  0  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  1 -1  1  0 -1  0  1 -1  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 9, 11, 12, 15, 18, 19]), Candidate: [2 1 1 0 0 1 1 0 2 0 1 1 0 1 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 4750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  1 -1  0  1  0 -1  1  0  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 9, 12, 13, 15, 16, 17]), Candidate: [2 1 1 0 0 1 1 0 2 0 0 2 1 0 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 4800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  0  1  0  0  0  0 -1  0  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 10, 11, 12, 13, 14, 19]), Candidate: [ 2  1  1  0  0  1  1  0  1  2  0  1  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  0  1  0 -1  1 -1  0  0  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 10, 11, 13, 17, 18, 19]), Candidate: [2 1 1 0 0 1 1 0 1 2 0 0 2 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 4900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  0  1 -1  1 -1  0  0  1  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 10, 12, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  0  1  1  0  1  2 -1  2  0  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  0  0  1  0 -1  1 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 11, 12, 14, 16, 18, 19]), Candidate: [ 2  1  1  0  0  1  1  0  1  1  1  1  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  0  0  0  0  1  0  0  0  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 13, 14, 15, 16, 17, 19]), Candidate: [2 1 1 0 0 1 1 0 1 1 0 1 2 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 5050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0  0 -1  0  0  0  0  0  0  0  1  0  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 9, 18, 19]), Candidate: [ 2  1  1 -1  2  1  1  0  1  0  0  1  1  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0 -1  0  1 -1  0  1  0 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 11, 14, 15]), Candidate: [ 2  1  1 -1  2  1  1  0  0  1  1  0  1  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0 -1  0  0  0  1 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 13, 18, 19]), Candidate: [ 2  1  1 -1  2  1  1  0  0  1  0  1  2  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  1  0 -1  0  0  0  1 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 9, 10, 15, 19]), Candidate: [ 2  1  1 -1  2  1  1 -1  2  1 -1  1  1  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 5250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  1 -1  0  1 -1  0  0  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 9, 12, 16, 17]), Candidate: [ 2  1  1 -1  2  1  1 -1  2  0  0  2  0  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  0  1  0 -1  1 -1  0  1 -1  0  0  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 10, 11, 13, 16]), Candidate: [ 2  1  1 -1  2  1  1 -1  1  2  0  0  2  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  0  1 -1  0  1 -1  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 10, 13, 16, 18]), Candidate: [ 2  1  1 -1  2  1  1 -1  1  2 -1  1  2  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 5400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  0  0  1 -1  1  0 -1  0  0  0  1  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 11, 13, 14, 19]), Candidate: [ 2  1  1 -1  2  1  1 -1  1  1  1  0  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 5450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  0  0  0  1 -1  1 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 12, 14, 16, 17]), Candidate: [ 2  1  1 -1  2  1  1 -1  1  1  0  2  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 5500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  0  0  0  0  0  0  0  1  0  0  0  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  1  1 -1  1  1  0  1  1  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1  0 -1  1 -1  0  1  0 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 5, 6, 8, 9, 11, 14, 15]), Candidate: [ 2  1  1 -1  2  1  0  1  1  0  1  0  1  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1  0 -1  0  0  1 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 3, 5, 6, 8, 9, 13, 18, 19]), Candidate: [ 2  1  1 -1  2  1  0  1  1  0  0  1  2  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1 -1  1 -1  1  0 -1  1 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 5, 6, 8, 10, 12, 13, 15]), Candidate: [ 2  1  1 -1  2  1  0  1  0  2 -1  2  1  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1 -1  1 -1  0  0  0  1 -1  0  1  0  0] (Indices: [0, 1, 2, 3, 5, 6, 8, 10, 15, 18, 19]), Candidate: [ 2  1  1 -1  2  1  0  1  0  2 -1  1  1  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1 -1  0  1 -1  0  1 -1  0  0  1  0  0] (Indices: [0, 1, 2, 3, 5, 6, 8, 11, 14, 18, 19]), Candidate: [ 2  1  1 -1  2  1  0  1  0  1  1  0  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1 -1  0  0  0  1  0 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 5, 6, 8, 13, 14, 16, 17]), Candidate: [ 2  1  1 -1  2  1  0  1  0  1  0  1  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  1  0  0 -1  0  0  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 5, 6, 9, 10, 11, 15, 17]), Candidate: [ 2  1  1 -1  2  1  0  0  2  1  0  0  1  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  1  0 -1  0  0  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 9, 10, 14, 16, 18]), Candidate: [ 2  1  1 -1  2  1  0  0  2  1 -1  1  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 5950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  1 -1  1 -1  1 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 3, 5, 6, 9, 11, 13, 18, 19]), Candidate: [ 2  1  1 -1  2  1  0  0  2  0  1  0  2  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  1 -1  0  1 -1  0  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 5, 6, 9, 12, 15, 17, 19]), Candidate: [ 2  1  1 -1  2  1  0  0  2  0  0  2  0  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  0  1  0  0 -1  1 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 10, 11, 12, 14, 18]), Candidate: [ 2  1  1 -1  2  1  0  0  1  2  0  1  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  0  1 -1  1  0  0 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 10, 12, 13, 14, 18]), Candidate: [ 2  1  1 -1  2  1  0  0  1  2 -1  2  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 6150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  0  1 -1  0  1 -1  0  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 5, 6, 10, 13, 16, 18, 19]), Candidate: [ 2  1  1 -1  2  1  0  0  1  2 -1  1  2  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  0  0  1  0 -1  0  0  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 5, 6, 11, 12, 16, 18, 19]), Candidate: [ 2  1  1 -1  2  1  0  0  1  1  1  1  0  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  0  0  0  1  0 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 12, 13, 15, 17, 18]), Candidate: [ 2  1  1 -1  2  1  0  0  1  1  0  2  1  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0  0  0  0 -1  0  0  0  0  0  0  1  0] (Indices: [0, 1, 2, 3, 5, 7, 8, 9, 10, 11, 19]), Candidate: [ 2  1  1 -1  2  0  2  0  1  1  0  0  1  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0  0 -1  1 -1  0  0  1 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 5, 7, 8, 9, 11, 15, 19]), Candidate: [ 2  1  1 -1  2  0  2  0  1  0  1  0  1  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0  0 -1  0  0  0  1 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 5, 7, 8, 9, 14, 17, 18]), Candidate: [ 2  1  1 -1  2  0  2  0  1  0  0  1  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0 -1  1 -1  1 -1  1 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 5, 7, 8, 10, 12, 14, 18]), Candidate: [ 2  1  1 -1  2  0  2  0  0  2 -1  2  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 6500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0 -1  0  1  0  0 -1  0  0  1 -1  0  1] (Indices: [0, 1, 2, 3, 5, 7, 8, 11, 12, 13, 17]), Candidate: [ 2  1  1 -1  2  0  2  0  0  1  1  1  1  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0 -1  0  1 -1  0  0  0  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 5, 7, 8, 11, 16, 17, 19]), Candidate: [ 2  1  1 -1  2  0  2  0  0  1  1  0  1  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0 -1  0  0  0  1 -1  1  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 5, 7, 8, 13, 15, 16, 19]), Candidate: [ 2  1  1 -1  2  0  2  0  0  1  0  1  2  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  1  0  0 -1  0  0  0  0  0  1  0  0] (Indices: [0, 1, 2, 3, 5, 7, 9, 10, 11, 18, 19]), Candidate: [ 2  1  1 -1  2  0  2 -1  2  1  0  0  1  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  1  0 -1  0  0  0  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 5, 7, 9, 10, 15, 17, 18]), Candidate: [ 2  1  1 -1  2  0  2 -1  2  1 -1  1  1  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 6750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  1 -1  1 -1  0  1 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 5, 7, 9, 11, 14, 17, 18]), Candidate: [ 2  1  1 -1  2  0  2 -1  2  0  1  0  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 6800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  1 -1  0  0  1  0  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 3, 5, 7, 9, 13, 14, 15, 18]), Candidate: [ 2  1  1 -1  2  0  2 -1  2  0  0  1  2  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  0  1  0  0 -1  0  0  1 -1  0  1  0] (Indices: [0, 1, 2, 3, 5, 7, 10, 11, 12, 16, 19]), Candidate: [ 2  1  1 -1  2  0  2 -1  1  2  0  1  0  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  0  1 -1  1  0 -1  0  1 -1  0  1  0] (Indices: [0, 1, 2, 3, 5, 7, 10, 12, 13, 16, 19]), Candidate: [ 2  1  1 -1  2  0  2 -1  1  2 -1  2  1  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 6950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  0  1 -1  0  0  1 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 5, 7, 10, 14, 16, 17, 18]), Candidate: [ 2  1  1 -1  2  0  2 -1  1  2 -1  1  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 7000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  0  0  1 -1  1  0 -1  1 -1  0  1  0] (Indices: [0, 1, 2, 3, 5, 7, 11, 13, 14, 16, 19]), Candidate: [ 2  1  1 -1  2  0  2 -1  1  1  1  0  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 7050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  0  0  0  1 -1  1  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 5, 7, 12, 14, 15, 16, 18]), Candidate: [ 2  1  1 -1  2  0  2 -1  1  1  0  2  0  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1  0  0  0 -1  0  1 -1  0  1 -1  0  1] (Indices: [0, 1, 2, 3, 5, 8, 9, 10, 11, 14, 17]), Candidate: [ 2  1  1 -1  2  0  1  1  1  1  0  0  1  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1  0  0 -1  0  0  1  0 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 5, 8, 9, 10, 14, 15, 17]), Candidate: [ 2  1  1 -1  2  0  1  1  1  1 -1  1  1  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1  0 -1  1 -1  1 -1  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 3, 5, 8, 9, 11, 13, 16, 18]), Candidate: [ 2  1  1 -1  2  0  1  1  1  0  1  0  2  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1  0 -1  0  1 -1  0  1  0  0 -1  0  1] (Indices: [0, 1, 2, 3, 5, 8, 9, 12, 15, 16, 17]), Candidate: [ 2  1  1 -1  2  0  1  1  1  0  0  2  0  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1 -1  1  0  0  0 -1  0  0  0  0  1  0] (Indices: [0, 1, 2, 3, 5, 8, 10, 11, 12, 13, 19]), Candidate: [ 2  1  1 -1  2  0  1  1  0  2  0  1  1  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1 -1  1  0 -1  0  0  0  0  1  0  0  0] (Indices: [0, 1, 2, 3, 5, 8, 10, 11, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  0  1  1  0  2  0  0  1  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1 -1  1 -1  0  1 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 5, 8, 10, 13, 15, 17, 19]), Candidate: [ 2  1  1 -1  2  0  1  1  0  2 -1  1  2  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1 -1  0  1  0 -1  0  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 5, 8, 11, 12, 15, 17, 19]), Candidate: [ 2  1  1 -1  2  0  1  1  0  1  1  1  0  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1 -1  0  0  1  0  0 -1  0  0  1  0  0] (Indices: [0, 1, 2, 3, 5, 8, 12, 13, 14, 18, 19]), Candidate: [ 2  1  1 -1  2  0  1  1  0  1  0  2  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  1  0  0  0  0 -1  0  0  1 -1  0  1] (Indices: [0, 1, 2, 3, 5, 9, 10, 11, 12, 13, 17]), Candidate: [ 2  1  1 -1  2  0  1  0  2  1  0  1  1  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  1  0  0 -1  0  0  0  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 5, 9, 10, 11, 16, 17, 19]), Candidate: [ 2  1  1 -1  2  0  1  0  2  1  0  0  1  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  1  0 -1  0  1 -1  1  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 5, 9, 10, 13, 15, 16, 19]), Candidate: [ 2  1  1 -1  2  0  1  0  2  1 -1  1  2  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  1 -1  1  0 -1  0  1  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 5, 9, 11, 12, 15, 16, 19]), Candidate: [ 2  1  1 -1  2  0  1  0  2  0  1  1  0  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  1 -1  0  1  0  0 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 5, 9, 12, 13, 14, 17, 18]), Candidate: [ 2  1  1 -1  2  0  1  0  2  0  0  2  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  0  1  0  0  0  0 -1  1 -1  0  0  1] (Indices: [0, 1, 2, 3, 5, 10, 11, 12, 13, 14, 16]), Candidate: [ 2  1  1 -1  2  0  1  0  1  2  0  1  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  0  1  0 -1  1 -1  0  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 5, 10, 11, 13, 16, 17, 18]), Candidate: [ 2  1  1 -1  2  0  1  0  1  2  0  0  2  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  0  1 -1  1 -1  0  1  0  0 -1  1  0] (Indices: [0, 1, 2, 3, 5, 10, 12, 15, 16, 17, 19]), Candidate: [ 2  1  1 -1  2  0  1  0  1  2 -1  2  0  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  0  0  1  0 -1  1  0 -1  0  1  0  0] (Indices: [0, 1, 2, 3, 5, 11, 12, 14, 15, 18, 19]), Candidate: [ 2  1  1 -1  2  0  1  0  1  1  1  1  0  2  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  0  0  0  1 -1  1 -1  1  0  0  0  0] (Indices: [0, 1, 2, 3, 5, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  0  1  0  1  1  0  2  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0  0 -1  1  0 -1  0  0  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 6, 7, 8, 9, 11, 12, 18]), Candidate: [ 2  1  1 -1  1  2  1  0  1  0  1  1  0  1  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0  0 -1  0  0  1 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 6, 7, 8, 9, 13, 15, 17]), Candidate: [ 2  1  1 -1  1  2  1  0  1  0  0  1  2  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0 -1  1  0 -1  0  0  1 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 6, 7, 8, 10, 11, 15, 19]), Candidate: [ 2  1  1 -1  1  2  1  0  0  2  0  0  1  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0 -1  1 -1  0  0  1 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 6, 7, 8, 10, 14, 17, 18]), Candidate: [ 2  1  1 -1  1  2  1  0  0  2 -1  1  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 8250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0 -1  0  1 -1  0  1  0 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 6, 7, 8, 11, 14, 15, 17]), Candidate: [ 2  1  1 -1  1  2  1  0  0  1  1  0  1  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0 -1  0  0  1 -1  0  0  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 6, 7, 8, 12, 16, 17, 18]), Candidate: [ 2  1  1 -1  1  2  1  0  0  1  0  2  0  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  1  0  0 -1  1 -1  0  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 6, 7, 9, 10, 11, 13, 18]), Candidate: [ 2  1  1 -1  1  2  1 -1  2  1  0  0  2  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  1  0 -1  0  1 -1  0  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 6, 7, 9, 10, 13, 17, 18]), Candidate: [ 2  1  1 -1  1  2  1 -1  2  1 -1  1  2  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 8450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  1 -1  1 -1  1 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 6, 7, 9, 11, 13, 15, 17]), Candidate: [ 2  1  1 -1  1  2  1 -1  2  0  1  0  2  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  1 -1  0  1 -1  1 -1  1 -1  0  1  0] (Indices: [0, 1, 2, 3, 6, 7, 9, 12, 14, 16, 19]), Candidate: [ 2  1  1 -1  1  2  1 -1  2  0  0  2  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 8550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  0  1  0  0  0 -1  1 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 6, 7, 10, 11, 12, 13, 15]), Candidate: [ 2  1  1 -1  1  2  1 -1  1  2  0  1  1  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  0  1  0 -1  0  0  1 -1  0  1  0  0] (Indices: [0, 1, 2, 3, 6, 7, 10, 11, 15, 18, 19]), Candidate: [ 2  1  1 -1  1  2  1 -1  1  2  0  0  1  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  0  1 -1  0  1 -1  1  0  0 -1  0  1] (Indices: [0, 1, 2, 3, 6, 7, 10, 13, 15, 16, 17]), Candidate: [ 2  1  1 -1  1  2  1 -1  1  2 -1  1  2  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 8700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  0  0  1  0 -1  0  1  0  0 -1  0  1] (Indices: [0, 1, 2, 3, 6, 7, 11, 12, 15, 16, 17]), Candidate: [ 2  1  1 -1  1  2  1 -1  1  1  1  1  0  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  0  0  0  1  0  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 3, 6, 7, 12, 13, 14, 16, 18]), Candidate: [ 2  1  1 -1  1  2  1 -1  1  1  0  2  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 8800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  0  0  0  0  0  0  1  0  0  0  0  0] (Indices: [0, 1, 2, 3, 6, 7, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  2  1 -1  1  1  0  1  1  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1  0  0 -1  0  1  0  0 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 6, 8, 9, 10, 13, 14, 15]), Candidate: [ 2  1  1 -1  1  2  0  1  1  1 -1  1  2  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1  0 -1  1  0 -1  0  0  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 6, 8, 9, 11, 12, 16, 17]), Candidate: [ 2  1  1 -1  1  2  0  1  1  0  1  1  0  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1  0 -1  0  1  0 -1  0  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 6, 8, 9, 12, 13, 16, 17]), Candidate: [ 2  1  1 -1  1  2  0  1  1  0  0  2  1  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1  0 -1  0  0  0  1  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 6, 8, 9, 14, 15, 17, 19]), Candidate: [ 2  1  1 -1  1  2  0  1  1  0  0  1  1  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1 -1  1  0 -1  0  1  0 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 6, 8, 10, 11, 14, 15, 19]), Candidate: [ 2  1  1 -1  1  2  0  1  0  2  0  0  1  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1 -1  1 -1  1 -1  0  0  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 6, 8, 10, 12, 16, 18, 19]), Candidate: [ 2  1  1 -1  1  2  0  1  0  2 -1  2  0  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1 -1  0  1  0  0 -1  0  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 6, 8, 11, 12, 13, 17, 19]), Candidate: [ 2  1  1 -1  1  2  0  1  0  1  1  1  1  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1 -1  0  1 -1  0  1 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 6, 8, 11, 14, 16, 18, 19]), Candidate: [ 2  1  1 -1  1  2  0  1  0  1  1  0  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1 -1  0  0  0  1  0 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 6, 8, 13, 14, 16, 18, 19]), Candidate: [ 2  1  1 -1  1  2  0  1  0  1  0  1  2  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  1  0  0 -1  0  1  0 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 6, 9, 10, 11, 14, 15, 17]), Candidate: [ 2  1  1 -1  1  2  0  0  2  1  0  0  1  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  1  0 -1  1 -1  0  0  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 6, 9, 10, 12, 16, 17, 18]), Candidate: [ 2  1  1 -1  1  2  0  0  2  1 -1  2  0  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  1 -1  1  0  0 -1  0  1 -1  0  1  0] (Indices: [0, 1, 2, 3, 6, 9, 11, 12, 13, 16, 19]), Candidate: [ 2  1  1 -1  1  2  0  0  2  0  1  1  1  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  1 -1  1 -1  0  1 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 6, 9, 11, 14, 16, 17, 18]), Candidate: [ 2  1  1 -1  1  2  0  0  2  0  1  0  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  1 -1  0  0  1  0 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 6, 9, 13, 14, 16, 17, 18]), Candidate: [ 2  1  1 -1  1  2  0  0  2  0  0  1  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  0  1  0 -1  1  0  0  0 -1  0  0  1] (Indices: [0, 1, 2, 3, 6, 10, 11, 13, 14, 15, 16]), Candidate: [ 2  1  1 -1  1  2  0  0  1  2  0  0  2  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  0  1 -1  1  0 -1  1 -1  0  1  0  0] (Indices: [0, 1, 2, 3, 6, 10, 12, 13, 15, 18, 19]), Candidate: [ 2  1  1 -1  1  2  0  0  1  2 -1  2  1  0  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  0  0  1  0  0  0 -1  0  0  1  0  0] (Indices: [0, 1, 2, 3, 6, 11, 12, 13, 14, 18, 19]), Candidate: [ 2  1  1 -1  1  2  0  0  1  1  1  1  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  0  0  0  1  0  0  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 6, 12, 13, 14, 15, 17, 18]), Candidate: [ 2  1  1 -1  1  2  0  0  1  1  0  2  1  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0  0  0  0 -1  0  0  0  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 7, 8, 9, 10, 11, 17, 18]), Candidate: [ 2  1  1 -1  1  1  2  0  1  1  0  0  1  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0  0  0 -1  0  0  0  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 7, 8, 9, 10, 15, 16, 18]), Candidate: [ 2  1  1 -1  1  1  2  0  1  1 -1  1  1  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0  0 -1  1 -1  0  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 3, 7, 8, 9, 11, 14, 16, 18]), Candidate: [ 2  1  1 -1  1  1  2  0  1  0  1  0  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0  0 -1  0  0  1  0  0  0 -1  0  0  1] (Indices: [0, 1, 2, 3, 7, 8, 9, 13, 14, 15, 16]), Candidate: [ 2  1  1 -1  1  1  2  0  1  0  0  1  2  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0 -1  1  0  0 -1  0  0  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 7, 8, 10, 11, 12, 16, 17]), Candidate: [ 2  1  1 -1  1  1  2  0  0  2  0  1  0  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0 -1  1 -1  1  0 -1  0  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 7, 8, 10, 12, 13, 16, 17]), Candidate: [ 2  1  1 -1  1  1  2  0  0  2 -1  2  1  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0 -1  1 -1  0  0  1  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 7, 8, 10, 14, 15, 17, 19]), Candidate: [ 2  1  1 -1  1  1  2  0  0  2 -1  1  1  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0 -1  0  1 -1  1  0 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 7, 8, 11, 13, 14, 16, 17]), Candidate: [ 2  1  1 -1  1  1  2  0  0  1  1  0  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0 -1  0  0  1  0 -1  0  0  1  0  0  0] (Indices: [0, 1, 2, 3, 7, 8, 12, 13, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  1  2  0  0  1  0  2  1  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  1  0  0  0 -1  0  1 -1  0  1 -1  1] (Indices: [0, 1, 2, 3, 7, 9, 10, 11, 12, 15, 18]), Candidate: [ 2  1  1 -1  1  1  2 -1  2  1  0  1  0  1  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  1  0 -1  1  0 -1  1 -1  0  1 -1  1] (Indices: [0, 1, 2, 3, 7, 9, 10, 12, 13, 15, 18]), Candidate: [ 2  1  1 -1  1  1  2 -1  2  1 -1  2  1  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 10300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  1  0 -1  0  0  1  0  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 7, 9, 10, 14, 15, 16, 19]), Candidate: [ 2  1  1 -1  1  1  2 -1  2  1 -1  1  1  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 10350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  1 -1  1 -1  1  0  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 3, 7, 9, 11, 13, 14, 15, 18]), Candidate: [ 2  1  1 -1  1  1  2 -1  2  0  1  0  2  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  1 -1  0  1  0 -1  0  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 7, 9, 12, 13, 16, 17, 19]), Candidate: [ 2  1  1 -1  1  1  2 -1  2  0  0  2  1  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  0  1  0  0  0 -1  0  1 -1  0  1  0] (Indices: [0, 1, 2, 3, 7, 10, 11, 12, 13, 16, 19]), Candidate: [ 2  1  1 -1  1  1  2 -1  1  2  0  1  1  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  0  1  0 -1  0  1 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 7, 10, 11, 14, 16, 17, 18]), Candidate: [ 2  1  1 -1  1  1  2 -1  1  2  0  0  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 10550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  0  1 -1  0  1  0 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 7, 10, 13, 14, 16, 17, 18]), Candidate: [ 2  1  1 -1  1  1  2 -1  1  2 -1  1  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 10600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  0  0  1 -1  1  0  0  0  0 -1  0  1] (Indices: [0, 1, 2, 3, 7, 11, 13, 14, 15, 16, 17]), Candidate: [ 2  1  1 -1  1  1  2 -1  1  1  1  0  2  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1  0  0  0  0  0 -1  1 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 8, 9, 10, 11, 12, 13, 15]), Candidate: [ 2  1  1 -1  1  1  1  1  1  1  0  1  1  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1  0  0  0 -1  0  0  1 -1  0  1  0  0] (Indices: [0, 1, 2, 3, 8, 9, 10, 11, 15, 18, 19]), Candidate: [ 2  1  1 -1  1  1  1  1  1  1  0  0  1  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1  0  0 -1  0  1 -1  1  0  0 -1  0  1] (Indices: [0, 1, 2, 3, 8, 9, 10, 13, 15, 16, 17]), Candidate: [ 2  1  1 -1  1  1  1  1  1  1 -1  1  2  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1  0 -1  1  0 -1  0  1  0  0 -1  0  1] (Indices: [0, 1, 2, 3, 8, 9, 11, 12, 15, 16, 17]), Candidate: [ 2  1  1 -1  1  1  1  1  1  0  1  1  0  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1  0 -1  0  1  0  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 3, 8, 9, 12, 13, 14, 16, 18]), Candidate: [ 2  1  1 -1  1  1  1  1  1  0  0  2  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1  0 -1  0  0  0  0  1  0  0  0  0  0] (Indices: [0, 1, 2, 3, 8, 9, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  1  1  1  1  0  0  1  1  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1 -1  1  0 -1  1 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 8, 10, 11, 13, 15, 17, 19]), Candidate: [ 2  1  1 -1  1  1  1  1  0  2  0  0  2  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1 -1  1 -1  1 -1  1 -1  0  1  0  0  0] (Indices: [0, 1, 2, 3, 8, 10, 12, 14, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  1  1  1  0  2 -1  2  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 11050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1 -1  0  1  0 -1  1  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 8, 11, 12, 14, 15, 17, 18]), Candidate: [ 2  1  1 -1  1  1  1  1  0  1  1  1  0  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1 -1  0  0  1 -1  1  0  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 8, 12, 14, 15, 16, 18, 19]), Candidate: [ 2  1  1 -1  1  1  1  1  0  1  0  2  0  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  1  0  0 -1  1  0 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 9, 10, 11, 13, 14, 16, 17]), Candidate: [ 2  1  1 -1  1  1  1  0  2  1  0  0  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 11200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  1  0 -1  1  0 -1  0  0  1  0  0  0] (Indices: [0, 1, 2, 3, 9, 10, 12, 13, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  1  1  0  2  1 -1  2  1  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 11250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  1 -1  1  0  0 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 9, 11, 12, 13, 15, 17, 18]), Candidate: [ 2  1  1 -1  1  1  1  0  2  0  1  1  1  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  1 -1  0  1  0  0 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 9, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  1  1 -1  1  1  1  0  2  0  0  2  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 11350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  0  1  0  0 -1  1 -1  0  1  0  0  0] (Indices: [0, 1, 2, 3, 10, 11, 12, 14, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  1  1  0  1  2  0  1  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 11400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  0  1 -1  0  1  0  0  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 10, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  1  1 -1  1  1  1  0  1  2 -1  1  2  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 11450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0  0 -1  1  0 -1  0  0  0  0  0  0  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 9, 11, 12]), Candidate: [2 1 0 1 1 1 1 0 1 0 1 1 0 1 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 11500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0 -1  1 -1  1 -1  0  0  0  0  0  1  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 10, 12, 19]), Candidate: [ 2  1  0  1  1  1  1  0  0  2 -1  2  0  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0 -1  0  0  1  0  0 -1  0  0  0  0  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 12, 13, 14]), Candidate: [ 2  1  0  1  1  1  1  0  0  1  0  2  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0 -1  0  0  0  0  0  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 15, 17, 19]), Candidate: [2 1 0 1 1 1 1 0 0 1 0 1 1 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 11650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  1 -1  1 -1  1 -1  1 -1  0  0  0  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 9, 11, 13, 15]), Candidate: [ 2  1  0  1  1  1  1 -1  2  0  1  0  2  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  1 -1  0  0  1 -1  0  1  0 -1  0  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 9, 13, 16, 17]), Candidate: [ 2  1  0  1  1  1  1 -1  2  0  0  1  2  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  0  1  0 -1  0  0  0  1 -1  0  1  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 10, 11, 16, 19]), Candidate: [ 2  1  0  1  1  1  1 -1  1  2  0  0  1  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  0  1 -1  0  0  0  1  0  0 -1  0  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 10, 15, 16, 17]), Candidate: [ 2  1  0  1  1  1  1 -1  1  2 -1  1  1  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 11850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  0  0  1 -1  0  1 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 11, 14, 16, 17]), Candidate: [ 2  1  0  1  1  1  1 -1  1  1  1  0  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 11900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  0  0  0  1 -1  0  0  0  1  0  0  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 12, 17, 18, 19]), Candidate: [ 2  1  0  1  1  1  1 -1  1  1  0  2  0  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1  0  0 -1  1 -1  0  0  0  0  0  1  0] (Indices: [0, 1, 2, 4, 5, 6, 8, 9, 10, 12, 19]), Candidate: [ 2  1  0  1  1  1  0  1  1  1 -1  2  0  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1  0 -1  0  1  0  0 -1  0  0  0  0  1] (Indices: [0, 1, 2, 4, 5, 6, 8, 9, 12, 13, 14]), Candidate: [ 2  1  0  1  1  1  0  1  1  0  0  2  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1  0 -1  0  0  0  0  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 4, 5, 6, 8, 9, 15, 17, 19]), Candidate: [2 1 0 1 1 1 0 1 1 0 0 1 1 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 12100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1 -1  1 -1  1 -1  0  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 4, 5, 6, 8, 10, 12, 16, 18]), Candidate: [ 2  1  0  1  1  1  0  1  0  2 -1  2  0  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1 -1  0  1  0 -1  1 -1  0  0  0  1  0] (Indices: [0, 1, 2, 4, 5, 6, 8, 11, 12, 14, 19]), Candidate: [ 2  1  0  1  1  1  0  1  0  1  1  1  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1 -1  0  0  1  0  0 -1  0  0  0  1  0] (Indices: [0, 1, 2, 4, 5, 6, 8, 12, 13, 14, 19]), Candidate: [ 2  1  0  1  1  1  0  1  0  1  0  2  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1 -1  0  0  0  1 -1  0  0  1  0  0  0] (Indices: [0, 1, 2, 4, 5, 6, 8, 13, 17, 18, 19]), Candidate: [2 1 0 1 1 1 0 1 0 1 0 1 2 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 12300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  1  0 -1  1 -1  1  0 -1  0  0  0  1] (Indices: [0, 1, 2, 4, 5, 6, 9, 10, 12, 14, 15]), Candidate: [ 2  1  0  1  1  1  0  0  2  1 -1  2  0  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  1 -1  1  0  0  0 -1  0  0  0  0  1] (Indices: [0, 1, 2, 4, 5, 6, 9, 11, 12, 13, 14]), Candidate: [ 2  1  0  1  1  1  0  0  2  0  1  1  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  1 -1  1 -1  0  0  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 4, 5, 6, 9, 11, 15, 17, 19]), Candidate: [2 1 0 1 1 1 0 0 2 0 1 0 1 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 12450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  1 -1  0  0  1  0 -1  0  0  1  0  0] (Indices: [0, 1, 2, 4, 5, 6, 9, 13, 14, 18, 19]), Candidate: [ 2  1  0  1  1  1  0  0  2  0  0  1  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  0  1  0 -1  1  0 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 4, 5, 6, 10, 11, 13, 14, 18]), Candidate: [ 2  1  0  1  1  1  0  0  1  2  0  0  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  0  1 -1  1 -1  1  0 -1  0  0  1  0] (Indices: [0, 1, 2, 4, 5, 6, 10, 12, 14, 15, 19]), Candidate: [ 2  1  0  1  1  1  0  0  1  2 -1  2  0  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  0  1 -1  0  0  0  1 -1  1  0  0  0] (Indices: [0, 1, 2, 4, 5, 6, 10, 15, 17, 18, 19]), Candidate: [ 2  1  0  1  1  1  0  0  1  2 -1  1  1  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  0  0  1 -1  1 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 4, 5, 6, 11, 13, 15, 17, 18]), Candidate: [2 1 0 1 1 1 0 0 1 1 1 0 2 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 12700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  0  0  0  1 -1  1 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 4, 5, 6, 12, 14, 16, 18, 19]), Candidate: [ 2  1  0  1  1  1  0  0  1  1  0  2  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0  0  0 -1  0  0  1 -1  1 -1  0  0  1] (Indices: [0, 1, 2, 4, 5, 7, 8, 9, 10, 14, 16]), Candidate: [ 2  1  0  1  1  0  2  0  1  1 -1  1  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 12800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0  0 -1  0  1 -1  1 -1  0  1 -1  0  1] (Indices: [0, 1, 2, 4, 5, 7, 8, 9, 12, 14, 17]), Candidate: [ 2  1  0  1  1  0  2  0  1  0  0  2  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0 -1  1  0  0 -1  0  1 -1  0  0  0  1] (Indices: [0, 1, 2, 4, 5, 7, 8, 10, 11, 12, 15]), Candidate: [2 1 0 1 1 0 2 0 0 2 0 1 0 1 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 12900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0 -1  1 -1  0  1  0 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 4, 5, 7, 8, 10, 13, 14, 18]), Candidate: [ 2  1  0  1  1  0  2  0  0  2 -1  1  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 12950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0 -1  0  1  0 -1  0  0  0  1  0 -1  1] (Indices: [0, 1, 2, 4, 5, 7, 8, 11, 12, 17, 18]), Candidate: [2 1 0 1 1 0 2 0 0 1 1 1 0 1 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 13000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0 -1  0  0  1  0 -1  0  0  1  0 -1  1] (Indices: [0, 1, 2, 4, 5, 7, 8, 12, 13, 17, 18]), Candidate: [2 1 0 1 1 0 2 0 0 1 0 2 1 0 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 13050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0 -1  0  0  0  0  1 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 4, 5, 7, 8, 14, 16, 17, 19]), Candidate: [ 2  1  0  1  1  0  2  0  0  1  0  1  1  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  1  0 -1  1 -1  0  1 -1  0  0  1  0] (Indices: [0, 1, 2, 4, 5, 7, 9, 10, 12, 15, 19]), Candidate: [ 2  1  0  1  1  0  2 -1  2  1 -1  2  0  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 13150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  1 -1  1  0 -1  1 -1  0  1 -1  0  1] (Indices: [0, 1, 2, 4, 5, 7, 9, 11, 12, 14, 17]), Candidate: [ 2  1  0  1  1  0  2 -1  2  0  1  1  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 13200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  1 -1  0  1  0  0 -1  0  1 -1  0  1] (Indices: [0, 1, 2, 4, 5, 7, 9, 12, 13, 14, 17]), Candidate: [ 2  1  0  1  1  0  2 -1  2  0  0  2  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 13250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  1 -1  0  0  1 -1  0  1  0 -1  1  0] (Indices: [0, 1, 2, 4, 5, 7, 9, 13, 16, 17, 19]), Candidate: [ 2  1  0  1  1  0  2 -1  2  0  0  1  2  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  0  1  0 -1  1 -1  0  1 -1  0  1  0] (Indices: [0, 1, 2, 4, 5, 7, 10, 11, 13, 16, 19]), Candidate: [ 2  1  0  1  1  0  2 -1  1  2  0  0  2  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  0  1 -1  1 -1  0  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 4, 5, 7, 10, 12, 15, 16, 18]), Candidate: [ 2  1  0  1  1  0  2 -1  1  2 -1  2  0  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 13400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  0  0  1  0  0 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 4, 5, 7, 11, 12, 13, 15, 17]), Candidate: [ 2  1  0  1  1  0  2 -1  1  1  1  1  1  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  0  0  1 -1  0  1  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 4, 5, 7, 11, 14, 15, 16, 18]), Candidate: [ 2  1  0  1  1  0  2 -1  1  1  1  0  1  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  0  0  0  0  1  0  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 4, 5, 7, 13, 14, 15, 16, 18]), Candidate: [ 2  1  0  1  1  0  2 -1  1  1  0  1  2  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1  0  0 -1  1  0 -1  0  1 -1  0  0  1] (Indices: [0, 1, 2, 4, 5, 8, 9, 10, 12, 13, 16]), Candidate: [ 2  1  0  1  1  0  1  1  1  1 -1  2  1  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1  0  0 -1  0  0  0  0  1  0  0 -1  1] (Indices: [0, 1, 2, 4, 5, 8, 9, 10, 16, 17, 18]), Candidate: [ 2  1  0  1  1  0  1  1  1  1 -1  1  1  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1  0 -1  1 -1  0  0  1  0  0 -1  0  1] (Indices: [0, 1, 2, 4, 5, 8, 9, 11, 15, 16, 17]), Candidate: [2 1 0 1 1 0 1 1 1 0 1 0 1 1 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 13700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1  0 -1  0  0  1  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 4, 5, 8, 9, 13, 14, 16, 18]), Candidate: [ 2  1  0  1  1  0  1  1  1  0  0  1  2  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1 -1  1  0  0 -1  0  0  0  0  1  0  0] (Indices: [0, 1, 2, 4, 5, 8, 10, 11, 12, 18, 19]), Candidate: [2 1 0 1 1 0 1 1 0 2 0 1 0 1 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 13800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1 -1  1 -1  1  0 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 4, 5, 8, 10, 12, 13, 18, 19]), Candidate: [ 2  1  0  1  1  0  1  1  0  2 -1  2  1  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1 -1  1 -1  0  0  1 -1  0  1  0  0  0] (Indices: [0, 1, 2, 4, 5, 8, 10, 14, 17, 18, 19]), Candidate: [ 2  1  0  1  1  0  1  1  0  2 -1  1  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 13900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1 -1  0  1 -1  1  0 -1  0  0  1  0  0] (Indices: [0, 1, 2, 4, 5, 8, 11, 13, 14, 18, 19]), Candidate: [ 2  1  0  1  1  0  1  1  0  1  1  0  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1 -1  0  0  1 -1  1  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 4, 5, 8, 12, 14, 15, 17, 19]), Candidate: [2 1 0 1 1 0 1 1 0 1 0 2 0 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 14000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  1  0  0  0 -1  0  0  0  1  0 -1  1] (Indices: [0, 1, 2, 4, 5, 9, 10, 11, 12, 17, 18]), Candidate: [2 1 0 1 1 0 1 0 2 1 0 1 0 1 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 14050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  1  0 -1  1  0 -1  0  0  1  0 -1  1] (Indices: [0, 1, 2, 4, 5, 9, 10, 12, 13, 17, 18]), Candidate: [ 2  1  0  1  1  0  1  0  2  1 -1  2  1  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  1  0 -1  0  0  1 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 4, 5, 9, 10, 14, 16, 17, 19]), Candidate: [ 2  1  0  1  1  0  1  0  2  1 -1  1  1  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 14150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  1 -1  1 -1  1  0 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 4, 5, 9, 11, 13, 14, 17, 18]), Candidate: [ 2  1  0  1  1  0  1  0  2  0  1  0  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  1 -1  0  1 -1  1  0  0 -1  0  1  0] (Indices: [0, 1, 2, 4, 5, 9, 12, 14, 15, 16, 19]), Candidate: [2 1 0 1 1 0 1 0 2 0 0 2 0 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 14250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  0  1  0  0 -1  1  0 -1  1 -1  0  1] (Indices: [0, 1, 2, 4, 5, 10, 11, 12, 14, 15, 17]), Candidate: [2 1 0 1 1 0 1 0 1 2 0 1 0 2 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 14300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  0  1  0 -1  0  0  1  0  0 -1  1  0] (Indices: [0, 1, 2, 4, 5, 10, 11, 15, 16, 17, 19]), Candidate: [2 1 0 1 1 0 1 0 1 2 0 0 1 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 14350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  0  1 -1  0  1 -1  1  0  0 -1  1  0] (Indices: [0, 1, 2, 4, 5, 10, 13, 15, 16, 17, 19]), Candidate: [ 2  1  0  1  1  0  1  0  1  2 -1  1  2  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  0  0  1 -1  1  0  0 -1  0  1  0  0] (Indices: [0, 1, 2, 4, 5, 11, 13, 14, 15, 18, 19]), Candidate: [2 1 0 1 1 0 1 0 1 1 1 0 2 1 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 14450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0  0  0  0 -1  0  0  0  0  0  1 -1  1] (Indices: [0, 1, 2, 4, 6, 7, 8, 9, 10, 11, 18]), Candidate: [2 1 0 1 0 2 1 0 1 1 0 0 1 1 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 14500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0  0 -1  1 -1  0  0  1 -1  0  1 -1  1] (Indices: [0, 1, 2, 4, 6, 7, 8, 9, 11, 15, 18]), Candidate: [2 1 0 1 0 2 1 0 1 0 1 0 1 1 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 14550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0  0 -1  0  0  0  1 -1  1 -1  0  1  0] (Indices: [0, 1, 2, 4, 6, 7, 8, 9, 14, 16, 19]), Candidate: [ 2  1  0  1  0  2  1  0  1  0  0  1  1  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0 -1  1 -1  1 -1  1 -1  0  1 -1  0  1] (Indices: [0, 1, 2, 4, 6, 7, 8, 10, 12, 14, 17]), Candidate: [ 2  1  0  1  0  2  1  0  0  2 -1  2  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 14650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0 -1  0  1  0  0 -1  0  1 -1  0  0  1] (Indices: [0, 1, 2, 4, 6, 7, 8, 11, 12, 13, 16]), Candidate: [2 1 0 1 0 2 1 0 0 1 1 1 1 0 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 14700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0 -1  0  1 -1  0  0  0  1  0  0 -1  1] (Indices: [0, 1, 2, 4, 6, 7, 8, 11, 16, 17, 18]), Candidate: [2 1 0 1 0 2 1 0 0 1 1 0 1 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 14750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0 -1  0  0  0  1 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 4, 6, 7, 8, 13, 15, 16, 18]), Candidate: [2 1 0 1 0 2 1 0 0 1 0 1 2 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 14800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  1  0  0 -1  0  0  0  0  1 -1  1  0] (Indices: [0, 1, 2, 4, 6, 7, 9, 10, 11, 17, 19]), Candidate: [ 2  1  0  1  0  2  1 -1  2  1  0  0  1  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  1  0 -1  0  0  0  1  0 -1  0  1  0] (Indices: [0, 1, 2, 4, 6, 7, 9, 10, 15, 16, 19]), Candidate: [ 2  1  0  1  0  2  1 -1  2  1 -1  1  1  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 14900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  1 -1  1 -1  0  1 -1  1 -1  0  1  0] (Indices: [0, 1, 2, 4, 6, 7, 9, 11, 14, 16, 19]), Candidate: [ 2  1  0  1  0  2  1 -1  2  0  1  0  1  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 14950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  1 -1  0  0  1  0  0 -1  1 -1  0  1] (Indices: [0, 1, 2, 4, 6, 7, 9, 13, 14, 15, 17]), Candidate: [ 2  1  0  1  0  2  1 -1  2  0  0  1  2  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  0  1  0  0 -1  0  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 4, 6, 7, 10, 11, 12, 16, 18]), Candidate: [ 2  1  0  1  0  2  1 -1  1  2  0  1  0  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  0  1 -1  1  0 -1  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 4, 6, 7, 10, 12, 13, 16, 18]), Candidate: [ 2  1  0  1  0  2  1 -1  1  2 -1  2  1  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  0  1 -1  0  0  1  0 -1  0  1  0  0] (Indices: [0, 1, 2, 4, 6, 7, 10, 14, 15, 18, 19]), Candidate: [ 2  1  0  1  0  2  1 -1  1  2 -1  1  1  2  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  0  0  1 -1  1  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 4, 6, 7, 11, 13, 14, 16, 18]), Candidate: [ 2  1  0  1  0  2  1 -1  1  1  1  0  2  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  0  0  0  1 -1  1  0  0  0 -1  0  1] (Indices: [0, 1, 2, 4, 6, 7, 12, 14, 15, 16, 17]), Candidate: [ 2  1  0  1  0  2  1 -1  1  1  0  2  0  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1  0  0  0 -1  0  1 -1  1 -1  0  0  1] (Indices: [0, 1, 2, 4, 6, 8, 9, 10, 11, 14, 16]), Candidate: [ 2  1  0  1  0  2  0  1  1  1  0  0  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1  0  0 -1  0  0  1  0  0 -1  0  0  1] (Indices: [0, 1, 2, 4, 6, 8, 9, 10, 14, 15, 16]), Candidate: [ 2  1  0  1  0  2  0  1  1  1 -1  1  1  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1  0 -1  1 -1  1 -1  0  1  0 -1  0  1] (Indices: [0, 1, 2, 4, 6, 8, 9, 11, 13, 16, 17]), Candidate: [2 1 0 1 0 2 0 1 1 0 1 0 2 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 15400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1  0 -1  0  1 -1  1 -1  0  0  1  0  0] (Indices: [0, 1, 2, 4, 6, 8, 9, 12, 14, 18, 19]), Candidate: [ 2  1  0  1  0  2  0  1  1  0  0  2  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1 -1  1  0  0  0 -1  0  0  0  1 -1  1] (Indices: [0, 1, 2, 4, 6, 8, 10, 11, 12, 13, 18]), Candidate: [2 1 0 1 0 2 0 1 0 2 0 1 1 0 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 15500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1 -1  1  0 -1  0  0  0  1 -1  1  0  0] (Indices: [0, 1, 2, 4, 6, 8, 10, 11, 16, 18, 19]), Candidate: [2 1 0 1 0 2 0 1 0 2 0 0 1 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 15550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1 -1  1 -1  0  1 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 4, 6, 8, 10, 13, 15, 17, 18]), Candidate: [ 2  1  0  1  0  2  0  1  0  2 -1  1  2  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1 -1  0  1  0 -1  0  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 4, 6, 8, 11, 12, 15, 17, 18]), Candidate: [2 1 0 1 0 2 0 1 0 1 1 1 0 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 15650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1 -1  0  0  1  0  0 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 4, 6, 8, 12, 13, 14, 17, 19]), Candidate: [ 2  1  0  1  0  2  0  1  0  1  0  2  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  1  0  0  0  0 -1  0  1 -1  0  0  1] (Indices: [0, 1, 2, 4, 6, 9, 10, 11, 12, 13, 16]), Candidate: [2 1 0 1 0 2 0 0 2 1 0 1 1 0 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 15750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  1  0  0 -1  0  0  0  1  0  0 -1  1] (Indices: [0, 1, 2, 4, 6, 9, 10, 11, 16, 17, 18]), Candidate: [2 1 0 1 0 2 0 0 2 1 0 0 1 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 15800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  1  0 -1  0  1 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 4, 6, 9, 10, 13, 15, 16, 18]), Candidate: [ 2  1  0  1  0  2  0  0  2  1 -1  1  2  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  1 -1  1  0 -1  0  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 4, 6, 9, 11, 12, 15, 16, 18]), Candidate: [2 1 0 1 0 2 0 0 2 0 1 1 0 1 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 15900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  1 -1  0  1  0  0 -1  1 -1  0  1  0] (Indices: [0, 1, 2, 4, 6, 9, 12, 13, 14, 16, 19]), Candidate: [ 2  1  0  1  0  2  0  0  2  0  0  2  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  0  1  0  0  0  0  0 -1  0  0  0  1] (Indices: [0, 1, 2, 4, 6, 10, 11, 12, 13, 14, 15]), Candidate: [2 1 0 1 0 2 0 0 1 2 0 1 1 1 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 16000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  0  1  0 -1  1 -1  1 -1  0  1  0  0] (Indices: [0, 1, 2, 4, 6, 10, 11, 13, 15, 18, 19]), Candidate: [2 1 0 1 0 2 0 0 1 2 0 0 2 0 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 16050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  0  1 -1  1 -1  0  1  0  0  0 -1  1] (Indices: [0, 1, 2, 4, 6, 10, 12, 15, 16, 17, 18]), Candidate: [ 2  1  0  1  0  2  0  0  1  2 -1  2  0  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  0  0  1  0 -1  1  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 4, 6, 11, 12, 14, 15, 17, 19]), Candidate: [2 1 0 1 0 2 0 0 1 1 1 1 0 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 16150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  0  0  0  1 -1  1  0 -1  1  0  0  0] (Indices: [0, 1, 2, 4, 6, 12, 14, 15, 17, 18, 19]), Candidate: [2 1 0 1 0 2 0 0 1 1 0 2 0 2 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 16200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0  0  0 -1  1 -1  0  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 4, 7, 8, 9, 10, 12, 15, 17]), Candidate: [ 2  1  0  1  0  1  2  0  1  1 -1  2  0  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0  0 -1  1  0 -1  1  0 -1  0  0  0  1] (Indices: [0, 1, 2, 4, 7, 8, 9, 11, 12, 14, 15]), Candidate: [2 1 0 1 0 1 2 0 1 0 1 1 0 2 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 16300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0  0 -1  0  1  0  0  0 -1  0  0  0  1] (Indices: [0, 1, 2, 4, 7, 8, 9, 12, 13, 14, 15]), Candidate: [2 1 0 1 0 1 2 0 1 0 0 2 1 1 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 16350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0  0 -1  0  0  1 -1  1 -1  0  1  0  0] (Indices: [0, 1, 2, 4, 7, 8, 9, 13, 15, 18, 19]), Candidate: [2 1 0 1 0 1 2 0 1 0 0 1 2 0 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 16400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0 -1  1  0 -1  1 -1  0  1  0 -1  0  1] (Indices: [0, 1, 2, 4, 7, 8, 10, 11, 13, 16, 17]), Candidate: [2 1 0 1 0 1 2 0 0 2 0 0 2 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 16450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0 -1  1 -1  1 -1  1 -1  0  0  1  0  0] (Indices: [0, 1, 2, 4, 7, 8, 10, 12, 14, 18, 19]), Candidate: [ 2  1  0  1  0  1  2  0  0  2 -1  2  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0 -1  0  1  0  0  0 -1  0  0  0  1  0] (Indices: [0, 1, 2, 4, 7, 8, 11, 12, 13, 14, 19]), Candidate: [ 2  1  0  1  0  1  2  0  0  1  1  1  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0 -1  0  1 -1  1 -1  0  0  1  0  0  0] (Indices: [0, 1, 2, 4, 7, 8, 11, 13, 17, 18, 19]), Candidate: [2 1 0 1 0 1 2 0 0 1 1 0 2 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 16600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0 -1  0  0  1 -1  0  0  1  0  0  0  0] (Indices: [0, 1, 2, 4, 7, 8, 12, 16, 17, 18, 19]), Candidate: [2 1 0 1 0 1 2 0 0 1 0 2 0 1 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 16650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  1  0  0 -1  1 -1  1 -1  0  1 -1  1] (Indices: [0, 1, 2, 4, 7, 9, 10, 11, 13, 15, 18]), Candidate: [ 2  1  0  1  0  1  2 -1  2  1  0  0  2  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  1  0 -1  1 -1  1 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 4, 7, 9, 10, 12, 14, 17, 18]), Candidate: [ 2  1  0  1  0  1  2 -1  2  1 -1  2  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 16750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  1 -1  1  0  0  0 -1  0  1 -1  0  1] (Indices: [0, 1, 2, 4, 7, 9, 11, 12, 13, 14, 17]), Candidate: [ 2  1  0  1  0  1  2 -1  2  0  1  1  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  1 -1  1 -1  1 -1  0  1  0 -1  1  0] (Indices: [0, 1, 2, 4, 7, 9, 11, 13, 16, 17, 19]), Candidate: [ 2  1  0  1  0  1  2 -1  2  0  1  0  2  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  1 -1  0  1 -1  0  1  0 -1  1  0  0] (Indices: [0, 1, 2, 4, 7, 9, 12, 15, 16, 18, 19]), Candidate: [ 2  1  0  1  0  1  2 -1  2  0  0  2  0  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  0  1  0  0 -1  0  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 4, 7, 10, 11, 12, 15, 16, 18]), Candidate: [ 2  1  0  1  0  1  2 -1  1  2  0  1  0  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  0  1 -1  1  0  0 -1  1 -1  0  1  0] (Indices: [0, 1, 2, 4, 7, 10, 12, 13, 14, 16, 19]), Candidate: [ 2  1  0  1  0  1  2 -1  1  2 -1  2  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 17000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  0  0  1  0  0  0  0  0 -1  0  0  1] (Indices: [0, 1, 2, 4, 7, 11, 12, 13, 14, 15, 16]), Candidate: [ 2  1  0  1  0  1  2 -1  1  1  1  1  1  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  0  0  1 -1  0  1  0  0  0  0 -1  1] (Indices: [0, 1, 2, 4, 7, 11, 14, 15, 16, 17, 18]), Candidate: [ 2  1  0  1  0  1  2 -1  1  1  1  0  1  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1  0  0  0  0 -1  0  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 4, 8, 9, 10, 11, 12, 16, 18]), Candidate: [2 1 0 1 0 1 1 1 1 1 0 1 0 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 17150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1  0  0 -1  1  0 -1  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 4, 8, 9, 10, 12, 13, 16, 18]), Candidate: [ 2  1  0  1  0  1  1  1  1  1 -1  2  1  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1  0  0 -1  0  0  1  0 -1  0  1  0  0] (Indices: [0, 1, 2, 4, 8, 9, 10, 14, 15, 18, 19]), Candidate: [ 2  1  0  1  0  1  1  1  1  1 -1  1  1  2  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1  0 -1  1 -1  1  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 4, 8, 9, 11, 13, 14, 16, 18]), Candidate: [ 2  1  0  1  0  1  1  1  1  0  1  0  2  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1  0 -1  0  1 -1  1  0  0  0 -1  0  1] (Indices: [0, 1, 2, 4, 8, 9, 12, 14, 15, 16, 17]), Candidate: [2 1 0 1 0 1 1 1 1 0 0 2 0 2 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 17350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1 -1  1  0  0  0 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 4, 8, 10, 11, 12, 13, 18, 19]), Candidate: [2 1 0 1 0 1 1 1 0 2 0 1 1 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 17400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1 -1  1  0 -1  0  1 -1  0  1  0  0  0] (Indices: [0, 1, 2, 4, 8, 10, 11, 14, 17, 18, 19]), Candidate: [ 2  1  0  1  0  1  1  1  0  2  0  0  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1 -1  1 -1  0  1  0 -1  0  1  0  0  0] (Indices: [0, 1, 2, 4, 8, 10, 13, 14, 17, 18, 19]), Candidate: [ 2  1  0  1  0  1  1  1  0  2 -1  1  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 17500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1 -1  0  1 -1  1  0  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 4, 8, 11, 13, 14, 15, 17, 18]), Candidate: [2 1 0 1 0 1 1 1 0 1 1 0 2 1 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 17550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  1  0  0  0  0  0 -1  0  0  0  1  0] (Indices: [0, 1, 2, 4, 9, 10, 11, 12, 13, 14, 19]), Candidate: [ 2  1  0  1  0  1  1  0  2  1  0  1  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  1  0  0 -1  1 -1  0  0  1  0  0  0] (Indices: [0, 1, 2, 4, 9, 10, 11, 13, 17, 18, 19]), Candidate: [2 1 0 1 0 1 1 0 2 1 0 0 2 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 17650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  1  0 -1  1 -1  0  0  1  0  0  0  0] (Indices: [0, 1, 2, 4, 9, 10, 12, 16, 17, 18, 19]), Candidate: [ 2  1  0  1  0  1  1  0  2  1 -1  2  0  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  1 -1  1  0 -1  1 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 4, 9, 11, 12, 14, 16, 18, 19]), Candidate: [ 2  1  0  1  0  1  1  0  2  0  1  1  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  1 -1  0  0  1  0  0  0  0 -1  1  0] (Indices: [0, 1, 2, 4, 9, 13, 14, 15, 16, 17, 19]), Candidate: [2 1 0 1 0 1 1 0 2 0 0 1 2 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 17800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  0  1  0 -1  1  0 -1  0  1  0  0  0] (Indices: [0, 1, 2, 4, 10, 11, 13, 14, 17, 18, 19]), Candidate: [ 2  1  0  1  0  1  1  0  1  2  0  0  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  0  0  1  0  0 -1  1  0  0  0 -1  1] (Indices: [0, 1, 2, 4, 11, 12, 13, 15, 16, 17, 18]), Candidate: [2 1 0 1 0 1 1 0 1 1 1 1 1 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 17900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0  0  0 -1  0  0  1 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 5, 6, 7, 8, 9, 10, 14, 18]), Candidate: [ 2  1  0  0  2  1  1  0  1  1 -1  1  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 17950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0  0 -1  0  1 -1  1 -1  0  0  0  1  0] (Indices: [0, 1, 2, 5, 6, 7, 8, 9, 12, 14, 19]), Candidate: [ 2  1  0  0  2  1  1  0  1  0  0  2  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0 -1  1  0  0 -1  0  0  0  1 -1  0  1] (Indices: [0, 1, 2, 5, 6, 7, 8, 10, 11, 12, 17]), Candidate: [2 1 0 0 2 1 1 0 0 2 0 1 0 1 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 18050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0 -1  1 -1  0  1 -1  1  0 -1  0  0  1] (Indices: [0, 1, 2, 5, 6, 7, 8, 10, 13, 15, 16]), Candidate: [ 2  1  0  0  2  1  1  0  0  2 -1  1  2  0  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0 -1  0  1  0 -1  0  0  0  0  1  0  0] (Indices: [0, 1, 2, 5, 6, 7, 8, 11, 12, 18, 19]), Candidate: [2 1 0 0 2 1 1 0 0 1 1 1 0 1 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 18150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0 -1  0  0  1  0 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 5, 6, 7, 8, 12, 13, 18, 19]), Candidate: [2 1 0 0 2 1 1 0 0 1 0 2 1 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 18200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0 -1  0  0  0  0  1 -1  0  1  0  0  0] (Indices: [0, 1, 2, 5, 6, 7, 8, 14, 17, 18, 19]), Candidate: [ 2  1  0  0  2  1  1  0  0  1  0  1  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  1  0 -1  1 -1  0  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 5, 6, 7, 9, 10, 12, 16, 18]), Candidate: [ 2  1  0  0  2  1  1 -1  2  1 -1  2  0  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  1 -1  1  0 -1  1 -1  0  0  0  1  0] (Indices: [0, 1, 2, 5, 6, 7, 9, 11, 12, 14, 19]), Candidate: [ 2  1  0  0  2  1  1 -1  2  0  1  1  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  1 -1  0  1  0  0 -1  0  0  0  1  0] (Indices: [0, 1, 2, 5, 6, 7, 9, 12, 13, 14, 19]), Candidate: [ 2  1  0  0  2  1  1 -1  2  0  0  2  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  1 -1  0  0  1 -1  0  0  1  0  0  0] (Indices: [0, 1, 2, 5, 6, 7, 9, 13, 17, 18, 19]), Candidate: [ 2  1  0  0  2  1  1 -1  2  0  0  1  2  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  0  1  0 -1  1 -1  0  0  1 -1  1  0] (Indices: [0, 1, 2, 5, 6, 7, 10, 11, 13, 17, 19]), Candidate: [ 2  1  0  0  2  1  1 -1  1  2  0  0  2  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  0  1 -1  1 -1  0  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 5, 6, 7, 10, 12, 15, 17, 18]), Candidate: [ 2  1  0  0  2  1  1 -1  1  2 -1  2  0  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  0  0  1  0  0 -1  1 -1  0  0  1  0] (Indices: [0, 1, 2, 5, 6, 7, 11, 12, 13, 15, 19]), Candidate: [ 2  1  0  0  2  1  1 -1  1  1  1  1  1  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  0  0  1 -1  0  1  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 5, 6, 7, 11, 14, 15, 17, 18]), Candidate: [ 2  1  0  0  2  1  1 -1  1  1  1  0  1  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  0  0  0  0  1  0  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 5, 6, 7, 13, 14, 15, 17, 18]), Candidate: [ 2  1  0  0  2  1  1 -1  1  1  0  1  2  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1  0  0 -1  1  0 -1  0  0  0  1 -1  1] (Indices: [0, 1, 2, 5, 6, 8, 9, 10, 12, 13, 18]), Candidate: [ 2  1  0  0  2  1  0  1  1  1 -1  2  1  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1  0  0 -1  0  0  0  0  1 -1  1  0  0] (Indices: [0, 1, 2, 5, 6, 8, 9, 10, 16, 18, 19]), Candidate: [ 2  1  0  0  2  1  0  1  1  1 -1  1  1  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1  0 -1  1 -1  0  0  1  0 -1  0  1  0] (Indices: [0, 1, 2, 5, 6, 8, 9, 11, 15, 16, 19]), Candidate: [2 1 0 0 2 1 0 1 1 0 1 0 1 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 18850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1  0 -1  0  0  1  0 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 5, 6, 8, 9, 13, 14, 17, 18]), Candidate: [ 2  1  0  0  2  1  0  1  1  0  0  1  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1 -1  1  0 -1  1  0 -1  1 -1  0  0  1] (Indices: [0, 1, 2, 5, 6, 8, 10, 11, 13, 14, 16]), Candidate: [ 2  1  0  0  2  1  0  1  0  2  0  0  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1 -1  1 -1  1 -1  1  0 -1  1 -1  0  1] (Indices: [0, 1, 2, 5, 6, 8, 10, 12, 14, 15, 17]), Candidate: [ 2  1  0  0  2  1  0  1  0  2 -1  2  0  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1 -1  1 -1  0  0  0  1  0  0 -1  1  0] (Indices: [0, 1, 2, 5, 6, 8, 10, 15, 16, 17, 19]), Candidate: [ 2  1  0  0  2  1  0  1  0  2 -1  1  1  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1 -1  0  1 -1  1 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 5, 6, 8, 11, 13, 15, 16, 18]), Candidate: [2 1 0 0 2 1 0 1 0 1 1 0 2 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 19100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1 -1  0  0  1 -1  1 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 5, 6, 8, 12, 14, 16, 17, 18]), Candidate: [ 2  1  0  0  2  1  0  1  0  1  0  2  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  1  0  0  0 -1  0  0  0  0  1  0  0] (Indices: [0, 1, 2, 5, 6, 9, 10, 11, 12, 18, 19]), Candidate: [2 1 0 0 2 1 0 0 2 1 0 1 0 1 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 19200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  1  0 -1  1  0 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 5, 6, 9, 10, 12, 13, 18, 19]), Candidate: [ 2  1  0  0  2  1  0  0  2  1 -1  2  1  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  1  0 -1  0  0  1 -1  0  1  0  0  0] (Indices: [0, 1, 2, 5, 6, 9, 10, 14, 17, 18, 19]), Candidate: [ 2  1  0  0  2  1  0  0  2  1 -1  1  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 19300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  1 -1  1 -1  1  0 -1  0  0  1  0  0] (Indices: [0, 1, 2, 5, 6, 9, 11, 13, 14, 18, 19]), Candidate: [ 2  1  0  0  2  1  0  0  2  0  1  0  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  1 -1  0  1 -1  1  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 5, 6, 9, 12, 14, 15, 17, 19]), Candidate: [2 1 0 0 2 1 0 0 2 0 0 2 0 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 19400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  0  1  0  0 -1  1  0 -1  0  0  1  0] (Indices: [0, 1, 2, 5, 6, 10, 11, 12, 14, 15, 19]), Candidate: [2 1 0 0 2 1 0 0 1 2 0 1 0 2 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 19450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  0  1  0 -1  0  0  1 -1  1  0  0  0] (Indices: [0, 1, 2, 5, 6, 10, 11, 15, 17, 18, 19]), Candidate: [2 1 0 0 2 1 0 0 1 2 0 0 1 1 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 19500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  0  1 -1  0  1 -1  1 -1  1  0  0  0] (Indices: [0, 1, 2, 5, 6, 10, 13, 15, 17, 18, 19]), Candidate: [ 2  1  0  0  2  1  0  0  1  2 -1  1  2  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  0  0  1 -1  1  0 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 5, 6, 11, 13, 14, 16, 17, 19]), Candidate: [ 2  1  0  0  2  1  0  0  1  1  1  0  2  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0  0  0  0 -1  1 -1  1 -1  0  0  0  1] (Indices: [0, 1, 2, 5, 7, 8, 9, 10, 11, 13, 15]), Candidate: [2 1 0 0 2 0 2 0 1 1 0 0 2 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 19650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0  0  0 -1  0  1 -1  0  1  0 -1  0  1] (Indices: [0, 1, 2, 5, 7, 8, 9, 10, 13, 16, 17]), Candidate: [ 2  1  0  0  2  0  2  0  1  1 -1  1  2  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0  0 -1  1 -1  1  0 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 5, 7, 8, 9, 11, 13, 14, 18]), Candidate: [ 2  1  0  0  2  0  2  0  1  0  1  0  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0  0 -1  0  1 -1  1  0 -1  0  0  1  0] (Indices: [0, 1, 2, 5, 7, 8, 9, 12, 14, 15, 19]), Candidate: [2 1 0 0 2 0 2 0 1 0 0 2 0 2 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 19800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0  0 -1  0  0  0  0  1 -1  1  0  0  0] (Indices: [0, 1, 2, 5, 7, 8, 9, 15, 17, 18, 19]), Candidate: [2 1 0 0 2 0 2 0 1 0 0 1 1 1 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 19850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0 -1  1  0 -1  0  0  1  0 -1  0  1  0] (Indices: [0, 1, 2, 5, 7, 8, 10, 11, 15, 16, 19]), Candidate: [2 1 0 0 2 0 2 0 0 2 0 0 1 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 19900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0 -1  1 -1  0  1  0 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 5, 7, 8, 10, 13, 14, 17, 18]), Candidate: [ 2  1  0  0  2  0  2  0  0  2 -1  1  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 19950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0 -1  0  1  0 -1  1 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 5, 7, 8, 11, 12, 14, 17, 18]), Candidate: [ 2  1  0  0  2  0  2  0  0  1  1  1  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0 -1  0  0  1  0  0  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 5, 7, 8, 12, 13, 14, 15, 18]), Candidate: [2 1 0 0 2 0 2 0 0 1 0 2 1 1 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 20050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0 -1  0  0  0  0  1  0  0 -1  1  0  0] (Indices: [0, 1, 2, 5, 7, 8, 14, 15, 16, 18, 19]), Candidate: [2 1 0 0 2 0 2 0 0 1 0 1 1 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 20100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  1  0  0 -1  0  0  1  0  0 -1  0  1] (Indices: [0, 1, 2, 5, 7, 9, 10, 11, 15, 16, 17]), Candidate: [ 2  1  0  0  2  0  2 -1  2  1  0  0  1  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  1  0 -1  0  1  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 5, 7, 9, 10, 13, 14, 16, 18]), Candidate: [ 2  1  0  0  2  0  2 -1  2  1 -1  1  2  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 20200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  1 -1  1  0 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 5, 7, 9, 11, 12, 14, 16, 18]), Candidate: [ 2  1  0  0  2  0  2 -1  2  0  1  1  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  1 -1  0  1  0  0  0  0 -1  0  0  1] (Indices: [0, 1, 2, 5, 7, 9, 12, 13, 14, 15, 16]), Candidate: [ 2  1  0  0  2  0  2 -1  2  0  0  2  1  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  1 -1  0  0  0  1  0  0  0  0 -1  1] (Indices: [0, 1, 2, 5, 7, 9, 14, 15, 16, 17, 18]), Candidate: [ 2  1  0  0  2  0  2 -1  2  0  0  1  1  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  0  1  0 -1  1  0 -1  0  0  1  0  0] (Indices: [0, 1, 2, 5, 7, 10, 11, 13, 14, 18, 19]), Candidate: [ 2  1  0  0  2  0  2 -1  1  2  0  0  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  0  1 -1  1 -1  1  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 5, 7, 10, 12, 14, 15, 17, 19]), Candidate: [ 2  1  0  0  2  0  2 -1  1  2 -1  2  0  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  0  0  1  0  0 -1  0  1 -1  1  0  0] (Indices: [0, 1, 2, 5, 7, 11, 12, 13, 16, 18, 19]), Candidate: [ 2  1  0  0  2  0  2 -1  1  1  1  1  1  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  0  0  0  1  0 -1  1  0 -1  1  0  0] (Indices: [0, 1, 2, 5, 7, 12, 13, 15, 16, 18, 19]), Candidate: [ 2  1  0  0  2  0  2 -1  1  1  0  2  1  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1  0  0  0 -1  1 -1  0  0  1 -1  1  0] (Indices: [0, 1, 2, 5, 8, 9, 10, 11, 13, 17, 19]), Candidate: [2 1 0 0 2 0 1 1 1 1 0 0 2 0 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 20600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1  0  0 -1  1 -1  0  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 5, 8, 9, 10, 12, 15, 17, 18]), Candidate: [ 2  1  0  0  2  0  1  1  1  1 -1  2  0  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1  0 -1  1  0  0 -1  1 -1  0  0  1  0] (Indices: [0, 1, 2, 5, 8, 9, 11, 12, 13, 15, 19]), Candidate: [2 1 0 0 2 0 1 1 1 0 1 1 1 0 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 20700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1  0 -1  1 -1  0  1  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 5, 8, 9, 11, 14, 15, 17, 18]), Candidate: [2 1 0 0 2 0 1 1 1 0 1 0 1 2 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 20750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1  0 -1  0  0  1  0  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 5, 8, 9, 13, 14, 15, 17, 18]), Candidate: [2 1 0 0 2 0 1 1 1 0 0 1 2 1 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 20800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1 -1  1  0  0 -1  0  0  1  0 -1  1  0] (Indices: [0, 1, 2, 5, 8, 10, 11, 12, 16, 17, 19]), Candidate: [2 1 0 0 2 0 1 1 0 2 0 1 0 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 20850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1 -1  1 -1  1  0 -1  1  0 -1  0  1  0] (Indices: [0, 1, 2, 5, 8, 10, 12, 13, 15, 16, 19]), Candidate: [ 2  1  0  0  2  0  1  1  0  2 -1  2  1  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1 -1  0  1  0  0  0 -1  1 -1  0  1  0] (Indices: [0, 1, 2, 5, 8, 11, 12, 13, 14, 16, 19]), Candidate: [ 2  1  0  0  2  0  1  1  0  1  1  1  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1 -1  0  0  1  0  0  0  0  0 -1  0  1] (Indices: [0, 1, 2, 5, 8, 12, 13, 14, 15, 16, 17]), Candidate: [2 1 0 0 2 0 1 1 0 1 0 2 1 1 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 21000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  1  0  0  0 -1  1 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 5, 9, 10, 11, 12, 14, 17, 18]), Candidate: [ 2  1  0  0  2  0  1  0  2  1  0  1  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  1  0 -1  1  0  0  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 5, 9, 10, 12, 13, 14, 15, 18]), Candidate: [ 2  1  0  0  2  0  1  0  2  1 -1  2  1  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  1  0 -1  0  0  1  0  0 -1  1  0  0] (Indices: [0, 1, 2, 5, 9, 10, 14, 15, 16, 18, 19]), Candidate: [ 2  1  0  0  2  0  1  0  2  1 -1  1  1  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  1 -1  1 -1  1 -1  1  0  0 -1  1  0] (Indices: [0, 1, 2, 5, 9, 11, 13, 15, 16, 17, 19]), Candidate: [2 1 0 0 2 0 1 0 2 0 1 0 2 0 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 21200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  0  1  0  0  0 -1  1  0 -1  0  1  0] (Indices: [0, 1, 2, 5, 10, 11, 12, 13, 15, 16, 19]), Candidate: [2 1 0 0 2 0 1 0 1 2 0 1 1 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 21250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  0  1 -1  1  0  0 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 5, 10, 12, 13, 14, 16, 17, 18]), Candidate: [ 2  1  0  0  2  0  1  0  1  2 -1  2  1  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  0  0  0  1  0  0  0  0  0  0 -1  1] (Indices: [0, 1, 2, 5, 12, 13, 14, 15, 16, 17, 18]), Candidate: [2 1 0 0 2 0 1 0 1 1 0 2 1 1 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 21350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0  0  0 -1  1 -1  0  1 -1  0  0  1  0] (Indices: [0, 1, 2, 6, 7, 8, 9, 10, 12, 15, 19]), Candidate: [ 2  1  0  0  1  2  1  0  1  1 -1  2  0  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0  0 -1  1  0 -1  1 -1  0  1 -1  0  1] (Indices: [0, 1, 2, 6, 7, 8, 9, 11, 12, 14, 17]), Candidate: [ 2  1  0  0  1  2  1  0  1  0  1  1  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0  0 -1  0  1  0  0 -1  0  1 -1  0  1] (Indices: [0, 1, 2, 6, 7, 8, 9, 12, 13, 14, 17]), Candidate: [ 2  1  0  0  1  2  1  0  1  0  0  2  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0  0 -1  0  0  1 -1  0  1  0 -1  1  0] (Indices: [0, 1, 2, 6, 7, 8, 9, 13, 16, 17, 19]), Candidate: [2 1 0 0 1 2 1 0 1 0 0 1 2 0 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 21550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0 -1  1  0 -1  1 -1  0  1 -1  0  1  0] (Indices: [0, 1, 2, 6, 7, 8, 10, 11, 13, 16, 19]), Candidate: [2 1 0 0 1 2 1 0 0 2 0 0 2 0 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 21600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0 -1  1 -1  1 -1  0  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 6, 7, 8, 10, 12, 15, 16, 18]), Candidate: [ 2  1  0  0  1  2  1  0  0  2 -1  2  0  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0 -1  0  1  0  0 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 6, 7, 8, 11, 12, 13, 15, 17]), Candidate: [2 1 0 0 1 2 1 0 0 1 1 1 1 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 21700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0 -1  0  1 -1  0  1  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 6, 7, 8, 11, 14, 15, 16, 18]), Candidate: [2 1 0 0 1 2 1 0 0 1 1 0 1 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 21750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0 -1  0  0  0  1  0  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 6, 7, 8, 13, 14, 15, 16, 18]), Candidate: [2 1 0 0 1 2 1 0 0 1 0 1 2 1 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 21800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  1  0  0 -1  1 -1  0  1  0 -1  0  1] (Indices: [0, 1, 2, 6, 7, 9, 10, 11, 13, 16, 17]), Candidate: [ 2  1  0  0  1  2  1 -1  2  1  0  0  2  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  1  0 -1  1 -1  1 -1  0  0  1  0  0] (Indices: [0, 1, 2, 6, 7, 9, 10, 12, 14, 18, 19]), Candidate: [ 2  1  0  0  1  2  1 -1  2  1 -1  2  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 21900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  1 -1  1  0  0  0 -1  0  0  0  1  0] (Indices: [0, 1, 2, 6, 7, 9, 11, 12, 13, 14, 19]), Candidate: [ 2  1  0  0  1  2  1 -1  2  0  1  1  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  1 -1  1 -1  1 -1  0  0  1  0  0  0] (Indices: [0, 1, 2, 6, 7, 9, 11, 13, 17, 18, 19]), Candidate: [ 2  1  0  0  1  2  1 -1  2  0  1  0  2  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  1 -1  0  1 -1  0  0  1  0  0  0  0] (Indices: [0, 1, 2, 6, 7, 9, 12, 16, 17, 18, 19]), Candidate: [ 2  1  0  0  1  2  1 -1  2  0  0  2  0  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  0  1  0  0 -1  0  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 6, 7, 10, 11, 12, 15, 17, 18]), Candidate: [ 2  1  0  0  1  2  1 -1  1  2  0  1  0  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  0  1 -1  1  0  0 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 6, 7, 10, 12, 13, 14, 17, 19]), Candidate: [ 2  1  0  0  1  2  1 -1  1  2 -1  2  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 22150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  0  0  1  0  0  0  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 6, 7, 11, 12, 13, 14, 15, 18]), Candidate: [ 2  1  0  0  1  2  1 -1  1  1  1  1  1  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  0  0  1 -1  0  1  0  0 -1  1  0  0] (Indices: [0, 1, 2, 6, 7, 11, 14, 15, 16, 18, 19]), Candidate: [ 2  1  0  0  1  2  1 -1  1  1  1  0  1  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1  0  0  0  0 -1  0  0  0  1  0 -1  1] (Indices: [0, 1, 2, 6, 8, 9, 10, 11, 12, 17, 18]), Candidate: [2 1 0 0 1 2 0 1 1 1 0 1 0 1 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 22300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1  0  0 -1  1  0 -1  0  0  1  0 -1  1] (Indices: [0, 1, 2, 6, 8, 9, 10, 12, 13, 17, 18]), Candidate: [ 2  1  0  0  1  2  0  1  1  1 -1  2  1  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1  0  0 -1  0  0  1 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 6, 8, 9, 10, 14, 16, 17, 19]), Candidate: [ 2  1  0  0  1  2  0  1  1  1 -1  1  1  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 22400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1  0 -1  1 -1  1  0 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 6, 8, 9, 11, 13, 14, 17, 18]), Candidate: [ 2  1  0  0  1  2  0  1  1  0  1  0  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1  0 -1  0  1 -1  1  0  0 -1  0  1  0] (Indices: [0, 1, 2, 6, 8, 9, 12, 14, 15, 16, 19]), Candidate: [2 1 0 0 1 2 0 1 1 0 0 2 0 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 22500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1 -1  1  0  0 -1  1  0 -1  1 -1  0  1] (Indices: [0, 1, 2, 6, 8, 10, 11, 12, 14, 15, 17]), Candidate: [2 1 0 0 1 2 0 1 0 2 0 1 0 2 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 22550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1 -1  1  0 -1  0  0  1  0  0 -1  1  0] (Indices: [0, 1, 2, 6, 8, 10, 11, 15, 16, 17, 19]), Candidate: [2 1 0 0 1 2 0 1 0 2 0 0 1 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 22600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1 -1  1 -1  0  1 -1  1  0  0 -1  1  0] (Indices: [0, 1, 2, 6, 8, 10, 13, 15, 16, 17, 19]), Candidate: [ 2  1  0  0  1  2  0  1  0  2 -1  1  2  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1 -1  0  1 -1  1  0  0 -1  0  1  0  0] (Indices: [0, 1, 2, 6, 8, 11, 13, 14, 15, 18, 19]), Candidate: [2 1 0 0 1 2 0 1 0 1 1 0 2 1 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 22700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  1  0  0  0  0 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 6, 9, 10, 11, 12, 13, 15, 17]), Candidate: [2 1 0 0 1 2 0 0 2 1 0 1 1 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 22750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  1  0  0 -1  0  1  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 6, 9, 10, 11, 14, 15, 16, 18]), Candidate: [2 1 0 0 1 2 0 0 2 1 0 0 1 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 22800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  1  0 -1  0  1  0  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 6, 9, 10, 13, 14, 15, 16, 18]), Candidate: [ 2  1  0  0  1  2  0  0  2  1 -1  1  2  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  1 -1  1  0 -1  0  1  0  0  0 -1  1] (Indices: [0, 1, 2, 6, 9, 11, 12, 15, 16, 17, 18]), Candidate: [2 1 0 0 1 2 0 0 2 0 1 1 0 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 22900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  1 -1  0  0  1  0  0 -1  1  0  0  0] (Indices: [0, 1, 2, 6, 9, 13, 14, 15, 17, 18, 19]), Candidate: [2 1 0 0 1 2 0 0 2 0 0 1 2 1 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 22950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  0  1  0 -1  1 -1  1  0  0 -1  1  0] (Indices: [0, 1, 2, 6, 10, 11, 13, 15, 16, 17, 19]), Candidate: [2 1 0 0 1 2 0 0 1 2 0 0 2 0 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 23000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  0  0  1  0  0 -1  1  0 -1  1  0  0] (Indices: [0, 1, 2, 6, 11, 12, 13, 15, 16, 18, 19]), Candidate: [2 1 0 0 1 2 0 0 1 1 1 1 1 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 23050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0  0  0  0 -1  1 -1  1  0 -1  0  0  1] (Indices: [0, 1, 2, 7, 8, 9, 10, 11, 13, 15, 16]), Candidate: [2 1 0 0 1 1 2 0 1 1 0 0 2 0 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 23100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0  0  0 -1  1 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 7, 8, 9, 10, 12, 14, 16, 18]), Candidate: [ 2  1  0  0  1  1  2  0  1  1 -1  2  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 23150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0  0 -1  1  0  0  0  0 -1  0  0  0  1] (Indices: [0, 1, 2, 7, 8, 9, 11, 12, 13, 14, 15]), Candidate: [2 1 0 0 1 1 2 0 1 0 1 1 1 1 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 23200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0  0 -1  1 -1  1 -1  1 -1  0  1  0  0] (Indices: [0, 1, 2, 7, 8, 9, 11, 13, 15, 18, 19]), Candidate: [2 1 0 0 1 1 2 0 1 0 1 0 2 0 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 23250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0  0 -1  0  1 -1  0  1  0  0  0 -1  1] (Indices: [0, 1, 2, 7, 8, 9, 12, 15, 16, 17, 18]), Candidate: [2 1 0 0 1 1 2 0 1 0 0 2 0 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 23300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0 -1  1  0  0 -1  1 -1  0  0  1  0  0] (Indices: [0, 1, 2, 7, 8, 10, 11, 12, 14, 18, 19]), Candidate: [ 2  1  0  0  1  1  2  0  0  2  0  1  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0 -1  1 -1  1  0  0 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 7, 8, 10, 12, 13, 14, 16, 17]), Candidate: [ 2  1  0  0  1  1  2  0  0  2 -1  2  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 23400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0 -1  1 -1  0  0  1 -1  1  0  0  0  0] (Indices: [0, 1, 2, 7, 8, 10, 14, 16, 17, 18, 19]), Candidate: [ 2  1  0  0  1  1  2  0  0  2 -1  1  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 23450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0 -1  0  1 -1  1 -1  1 -1  1  0  0  0] (Indices: [0, 1, 2, 7, 8, 11, 13, 15, 17, 18, 19]), Candidate: [2 1 0 0 1 1 2 0 0 1 1 0 2 0 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 23500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  1  0  0  0  0 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 7, 9, 10, 11, 12, 13, 18, 19]), Candidate: [ 2  1  0  0  1  1  2 -1  2  1  0  1  1  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  1  0  0 -1  0  1 -1  0  1  0  0  0] (Indices: [0, 1, 2, 7, 9, 10, 11, 14, 17, 18, 19]), Candidate: [ 2  1  0  0  1  1  2 -1  2  1  0  0  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 23600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  1  0 -1  0  1  0 -1  0  1  0  0  0] (Indices: [0, 1, 2, 7, 9, 10, 13, 14, 17, 18, 19]), Candidate: [ 2  1  0  0  1  1  2 -1  2  1 -1  1  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 23650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  1 -1  1 -1  1  0  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 7, 9, 11, 13, 14, 15, 17, 18]), Candidate: [ 2  1  0  0  1  1  2 -1  2  0  1  0  2  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  0  1  0  0  0  0 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 7, 10, 11, 12, 13, 14, 16, 17]), Candidate: [ 2  1  0  0  1  1  2 -1  1  2  0  1  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 23750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  0  1  0 -1  0  1 -1  1  0  0  0  0] (Indices: [0, 1, 2, 7, 10, 11, 14, 16, 17, 18, 19]), Candidate: [ 2  1  0  0  1  1  2 -1  1  2  0  0  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 23800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  0  0  1  0 -1  0  1  0  0  0  0  0] (Indices: [0, 1, 2, 7, 11, 12, 15, 16, 17, 18, 19]), Candidate: [ 2  1  0  0  1  1  2 -1  1  1  1  1  0  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1  0  0  0  0 -1  0  0  0  1  0  0  0] (Indices: [0, 1, 2, 8, 9, 10, 11, 12, 17, 18, 19]), Candidate: [2 1 0 0 1 1 1 1 1 1 0 1 0 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 23900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1  0  0 -1  1  0 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 8, 9, 10, 12, 13, 15, 17, 19]), Candidate: [ 2  1  0  0  1  1  1  1  1  1 -1  2  1  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1  0 -1  1  0  0  0 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 8, 9, 11, 12, 13, 14, 17, 19]), Candidate: [ 2  1  0  0  1  1  1  1  1  0  1  1  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1  0 -1  0  1  0  0  0  0 -1  0  1  0] (Indices: [0, 1, 2, 8, 9, 12, 13, 14, 15, 16, 19]), Candidate: [2 1 0 0 1 1 1 1 1 0 0 2 1 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 24050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1 -1  1  0  0 -1  1  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 8, 10, 11, 12, 14, 15, 17, 19]), Candidate: [2 1 0 0 1 1 1 1 0 2 0 1 0 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 24100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1 -1  1 -1  1 -1  1  0 -1  1  0  0  0] (Indices: [0, 1, 2, 8, 10, 12, 14, 15, 17, 18, 19]), Candidate: [ 2  1  0  0  1  1  1  1  0  2 -1  2  0  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  1  0  0  0  0  0 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 9, 10, 11, 12, 13, 14, 16, 17]), Candidate: [ 2  1  0  0  1  1  1  0  2  1  0  1  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  1  0  0 -1  0  1 -1  1  0  0  0  0] (Indices: [0, 1, 2, 9, 10, 11, 14, 16, 17, 18, 19]), Candidate: [ 2  1  0  0  1  1  1  0  2  1  0  0  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  1 -1  1  0 -1  0  1  0  0  0  0  0] (Indices: [0, 1, 2, 9, 11, 12, 15, 16, 17, 18, 19]), Candidate: [2 1 0 0 1 1 1 0 2 0 1 1 0 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 24300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  0  1 -1  1 -1  1  0  0  0  0  0  0] (Indices: [0, 1, 2, 10, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  0  0  1  1  1  0  1  2 -1  2  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0  0 -1  0  0  0  0  0  1  0 -1  0  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 9, 16, 17]), Candidate: [2 0 2 0 1 1 1 0 1 0 0 1 1 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 24400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0 -1  0  1 -1  1 -1  1 -1  0  0  0  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 11, 13, 15]), Candidate: [2 0 2 0 1 1 1 0 0 1 1 0 2 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 24450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0 -1  0  0  0  1 -1  0  1  0 -1  0  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 13, 16, 17]), Candidate: [2 0 2 0 1 1 1 0 0 1 0 1 2 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 24500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  1  0 -1  0  0  1 -1  0  0  1 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 9, 10, 14, 18]), Candidate: [ 2  0  2  0  1  1  1 -1  2  1 -1  1  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 24550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  1 -1  0  1 -1  1 -1  0  0  0  1  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 9, 12, 14, 19]), Candidate: [ 2  0  2  0  1  1  1 -1  2  0  0  2  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 24600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  0  1  0  0 -1  0  0  0  1 -1  0  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 10, 11, 12, 17]), Candidate: [ 2  0  2  0  1  1  1 -1  1  2  0  1  0  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  0  1 -1  0  1 -1  1  0 -1  0  0  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 10, 13, 15, 16]), Candidate: [ 2  0  2  0  1  1  1 -1  1  2 -1  1  2  0  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 24700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  0  0  1  0 -1  0  0  0  0  1  0  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 11, 12, 18, 19]), Candidate: [ 2  0  2  0  1  1  1 -1  1  1  1  1  0  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  0  0  0  1  0 -1  0  0  0  1  0  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 12, 13, 18, 19]), Candidate: [ 2  0  2  0  1  1  1 -1  1  1  0  2  1  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  0  0  0  0  0  1 -1  0  1  0  0  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 14, 17, 18, 19]), Candidate: [ 2  0  2  0  1  1  1 -1  1  1  0  1  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 24850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1  0 -1  1 -1  1 -1  1 -1  0  0  0  1] (Indices: [0, 1, 3, 4, 5, 6, 8, 9, 11, 13, 15]), Candidate: [2 0 2 0 1 1 0 1 1 0 1 0 2 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 24900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1  0 -1  0  0  1 -1  0  1  0 -1  0  1] (Indices: [0, 1, 3, 4, 5, 6, 8, 9, 13, 16, 17]), Candidate: [2 0 2 0 1 1 0 1 1 0 0 1 2 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 24950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1 -1  1  0 -1  0  0  0  1 -1  0  1  0] (Indices: [0, 1, 3, 4, 5, 6, 8, 10, 11, 16, 19]), Candidate: [2 0 2 0 1 1 0 1 0 2 0 0 1 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 25000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1 -1  1 -1  0  0  0  1  0  0 -1  0  1] (Indices: [0, 1, 3, 4, 5, 6, 8, 10, 15, 16, 17]), Candidate: [ 2  0  2  0  1  1  0  1  0  2 -1  1  1  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1 -1  0  1 -1  0  1 -1  1  0 -1  0  1] (Indices: [0, 1, 3, 4, 5, 6, 8, 11, 14, 16, 17]), Candidate: [ 2  0  2  0  1  1  0  1  0  1  1  0  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1 -1  0  0  1 -1  0  0  0  1  0  0  0] (Indices: [0, 1, 3, 4, 5, 6, 8, 12, 17, 18, 19]), Candidate: [2 0 2 0 1 1 0 1 0 1 0 2 0 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 25150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  1  0  0 -1  0  1 -1  1 -1  0  0  1] (Indices: [0, 1, 3, 4, 5, 6, 9, 10, 11, 14, 16]), Candidate: [ 2  0  2  0  1  1  0  0  2  1  0  0  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  1  0 -1  0  0  1  0  0 -1  0  0  1] (Indices: [0, 1, 3, 4, 5, 6, 9, 10, 14, 15, 16]), Candidate: [ 2  0  2  0  1  1  0  0  2  1 -1  1  1  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  1 -1  1 -1  1 -1  0  1  0 -1  0  1] (Indices: [0, 1, 3, 4, 5, 6, 9, 11, 13, 16, 17]), Candidate: [2 0 2 0 1 1 0 0 2 0 1 0 2 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 25300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  1 -1  0  1 -1  1 -1  0  0  1  0  0] (Indices: [0, 1, 3, 4, 5, 6, 9, 12, 14, 18, 19]), Candidate: [ 2  0  2  0  1  1  0  0  2  0  0  2  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  0  1  0  0  0 -1  0  0  0  1 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 10, 11, 12, 13, 18]), Candidate: [2 0 2 0 1 1 0 0 1 2 0 1 1 0 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 25400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  0  1  0 -1  0  0  0  1 -1  1  0  0] (Indices: [0, 1, 3, 4, 5, 6, 10, 11, 16, 18, 19]), Candidate: [2 0 2 0 1 1 0 0 1 2 0 0 1 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 25450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  0  1 -1  0  1 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 10, 13, 15, 17, 18]), Candidate: [ 2  0  2  0  1  1  0  0  1  2 -1  1  2  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  0  0  1  0 -1  0  1 -1  1  0 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 11, 12, 15, 17, 18]), Candidate: [2 0 2 0 1 1 0 0 1 1 1 1 0 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 25550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  0  0  0  1  0  0 -1  0  1 -1  1  0] (Indices: [0, 1, 3, 4, 5, 6, 12, 13, 14, 17, 19]), Candidate: [ 2  0  2  0  1  1  0  0  1  1  0  2  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0  0  0  0 -1  0  1 -1  0  0  0  0  1] (Indices: [0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14]), Candidate: [ 2  0  2  0  1  0  2  0  1  1  0  0  1  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0  0 -1  1 -1  0  1 -1  0  0  1 -1  1] (Indices: [0, 1, 3, 4, 5, 7, 8, 9, 11, 14, 18]), Candidate: [ 2  0  2  0  1  0  2  0  1  0  1  0  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0  0 -1  0  0  0  1  0 -1  0  1 -1  1] (Indices: [0, 1, 3, 4, 5, 7, 8, 9, 14, 15, 18]), Candidate: [2 0 2 0 1 0 2 0 1 0 0 1 1 2 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 25750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0 -1  1 -1  1  0 -1  0  0  0  1 -1  1] (Indices: [0, 1, 3, 4, 5, 7, 8, 10, 12, 13, 18]), Candidate: [ 2  0  2  0  1  0  2  0  0  2 -1  2  1  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0 -1  1 -1  0  0  0  0  1 -1  1  0  0] (Indices: [0, 1, 3, 4, 5, 7, 8, 10, 16, 18, 19]), Candidate: [ 2  0  2  0  1  0  2  0  0  2 -1  1  1  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0 -1  0  1 -1  0  0  1  0 -1  0  1  0] (Indices: [0, 1, 3, 4, 5, 7, 8, 11, 15, 16, 19]), Candidate: [2 0 2 0 1 0 2 0 0 1 1 0 1 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 25900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0 -1  0  0  0  1  0 -1  0  1  0 -1  1] (Indices: [0, 1, 3, 4, 5, 7, 8, 13, 14, 17, 18]), Candidate: [ 2  0  2  0  1  0  2  0  0  1  0  1  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  1  0  0 -1  0  0  0  1  0 -1  0  1] (Indices: [0, 1, 3, 4, 5, 7, 9, 10, 11, 16, 17]), Candidate: [ 2  0  2  0  1  0  2 -1  2  1  0  0  1  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  1  0 -1  0  0  1 -1  0  1 -1  1  0] (Indices: [0, 1, 3, 4, 5, 7, 9, 10, 14, 17, 19]), Candidate: [ 2  0  2  0  1  0  2 -1  2  1 -1  1  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 26050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  1 -1  1 -1  0  1  0 -1  0  1 -1  1] (Indices: [0, 1, 3, 4, 5, 7, 9, 11, 14, 15, 18]), Candidate: [ 2  0  2  0  1  0  2 -1  2  0  1  0  1  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  1 -1  0  1 -1  0  0  1  0 -1  1  0] (Indices: [0, 1, 3, 4, 5, 7, 9, 12, 16, 17, 19]), Candidate: [ 2  0  2  0  1  0  2 -1  2  0  0  2  0  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  0  1  0  0 -1  0  1 -1  1 -1  0  1] (Indices: [0, 1, 3, 4, 5, 7, 10, 11, 12, 15, 17]), Candidate: [ 2  0  2  0  1  0  2 -1  1  2  0  1  0  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  0  1 -1  1  0 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 3, 4, 5, 7, 10, 12, 13, 15, 17]), Candidate: [ 2  0  2  0  1  0  2 -1  1  2 -1  2  1  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 26250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  0  1 -1  0  0  1  0  0 -1  1 -1  1] (Indices: [0, 1, 3, 4, 5, 7, 10, 14, 15, 16, 18]), Candidate: [ 2  0  2  0  1  0  2 -1  1  2 -1  1  1  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 26300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  0  0  1 -1  1  0  0 -1  1 -1  0  1] (Indices: [0, 1, 3, 4, 5, 7, 11, 13, 14, 15, 17]), Candidate: [ 2  0  2  0  1  0  2 -1  1  1  1  0  2  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  0  0  0  1  0 -1  0  1  0  0 -1  1] (Indices: [0, 1, 3, 4, 5, 7, 12, 13, 16, 17, 18]), Candidate: [ 2  0  2  0  1  0  2 -1  1  1  0  2  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1  0  0  0 -1  1 -1  0  0  1 -1  0  1] (Indices: [0, 1, 3, 4, 5, 8, 9, 10, 11, 13, 17]), Candidate: [2 0 2 0 1 0 1 1 1 1 0 0 2 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 26450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1  0  0 -1  0  1 -1  0  1 -1  0  1  0] (Indices: [0, 1, 3, 4, 5, 8, 9, 10, 13, 16, 19]), Candidate: [ 2  0  2  0  1  0  1  1  1  1 -1  1  2  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1  0 -1  1 -1  1 -1  1  0 -1  0  0  1] (Indices: [0, 1, 3, 4, 5, 8, 9, 11, 13, 15, 16]), Candidate: [2 0 2 0 1 0 1 1 1 0 1 0 2 0 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 26550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1  0 -1  0  1 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 3, 4, 5, 8, 9, 12, 14, 16, 18]), Candidate: [ 2  0  2  0  1  0  1  1  1  0  0  2  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1 -1  1  0  0  0  0 -1  0  0  0  0  1] (Indices: [0, 1, 3, 4, 5, 8, 10, 11, 12, 13, 14]), Candidate: [ 2  0  2  0  1  0  1  1  0  2  0  1  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1 -1  1  0 -1  0  0  1 -1  1 -1  1  0] (Indices: [0, 1, 3, 4, 5, 8, 10, 11, 15, 17, 19]), Candidate: [2 0 2 0 1 0 1 1 0 2 0 0 1 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 26700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1 -1  1 -1  0  1  0 -1  0  0  1  0  0] (Indices: [0, 1, 3, 4, 5, 8, 10, 13, 14, 18, 19]), Candidate: [ 2  0  2  0  1  0  1  1  0  2 -1  1  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 26750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1 -1  0  1  0 -1  1 -1  0  0  1  0  0] (Indices: [0, 1, 3, 4, 5, 8, 11, 12, 14, 18, 19]), Candidate: [ 2  0  2  0  1  0  1  1  0  1  1  1  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1 -1  0  0  1  0  0 -1  1  0 -1  0  1] (Indices: [0, 1, 3, 4, 5, 8, 12, 13, 14, 16, 17]), Candidate: [ 2  0  2  0  1  0  1  1  0  1  0  2  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1 -1  0  0  0  0  1 -1  1  0  0  0  0] (Indices: [0, 1, 3, 4, 5, 8, 14, 16, 17, 18, 19]), Candidate: [ 2  0  2  0  1  0  1  1  0  1  0  1  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  1  0  0 -1  0  0  1  0 -1  0  1  0] (Indices: [0, 1, 3, 4, 5, 9, 10, 11, 15, 16, 19]), Candidate: [2 0 2 0 1 0 1 0 2 1 0 0 1 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 26950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  1  0 -1  0  1  0 -1  0  1  0 -1  1] (Indices: [0, 1, 3, 4, 5, 9, 10, 13, 14, 17, 18]), Candidate: [ 2  0  2  0  1  0  1  0  2  1 -1  1  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  1 -1  1  0 -1  1 -1  0  1  0 -1  1] (Indices: [0, 1, 3, 4, 5, 9, 11, 12, 14, 17, 18]), Candidate: [ 2  0  2  0  1  0  1  0  2  0  1  1  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  1 -1  0  1  0  0  0 -1  0  1 -1  1] (Indices: [0, 1, 3, 4, 5, 9, 12, 13, 14, 15, 18]), Candidate: [2 0 2 0 1 0 1 0 2 0 0 2 1 1 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 27100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  1 -1  0  0  0  1  0  0 -1  1  0  0] (Indices: [0, 1, 3, 4, 5, 9, 14, 15, 16, 18, 19]), Candidate: [2 0 2 0 1 0 1 0 2 0 0 1 1 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 27150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  0  1  0 -1  1 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 3, 4, 5, 10, 11, 13, 15, 16, 18]), Candidate: [2 0 2 0 1 0 1 0 1 2 0 0 2 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 27200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  0  1 -1  1 -1  1 -1  1  0  0 -1  1] (Indices: [0, 1, 3, 4, 5, 10, 12, 14, 16, 17, 18]), Candidate: [ 2  0  2  0  1  0  1  0  1  2 -1  2  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  0  0  1  0 -1  1  0  0  0 -1  0  1] (Indices: [0, 1, 3, 4, 5, 11, 12, 14, 15, 16, 17]), Candidate: [2 0 2 0 1 0 1 0 1 1 1 1 0 2 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 27300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  0  0  0  1  0 -1  0  1  0  0  0  0] (Indices: [0, 1, 3, 4, 5, 12, 13, 16, 17, 18, 19]), Candidate: [2 0 2 0 1 0 1 0 1 1 0 2 1 0 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 27350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0  0 -1  1  0  0 -1  0  0  0  0  0  1] (Indices: [0, 1, 3, 4, 6, 7, 8, 9, 11, 12, 13]), Candidate: [2 0 2 0 0 2 1 0 1 0 1 1 1 0 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 27400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0  0 -1  0  0  1  0 -1  1 -1  0  0  1] (Indices: [0, 1, 3, 4, 6, 7, 8, 9, 13, 14, 16]), Candidate: [ 2  0  2  0  0  2  1  0  1  0  0  1  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0 -1  1  0 -1  0  1 -1  0  0  1 -1  1] (Indices: [0, 1, 3, 4, 6, 7, 8, 10, 11, 14, 18]), Candidate: [ 2  0  2  0  0  2  1  0  0  2  0  0  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0 -1  1 -1  0  0  1  0 -1  0  1 -1  1] (Indices: [0, 1, 3, 4, 6, 7, 8, 10, 14, 15, 18]), Candidate: [ 2  0  2  0  0  2  1  0  0  2 -1  1  1  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0 -1  0  1 -1  1 -1  0  1 -1  0  1  0] (Indices: [0, 1, 3, 4, 6, 7, 8, 11, 13, 16, 19]), Candidate: [2 0 2 0 0 2 1 0 0 1 1 0 2 0 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 27600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0 -1  0  0  1 -1  0  1  0 -1  1 -1  1] (Indices: [0, 1, 3, 4, 6, 7, 8, 12, 15, 16, 18]), Candidate: [2 0 2 0 0 2 1 0 0 1 0 2 0 1 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 27650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  1  0  0  0 -1  0  0  0  0  0  1  0] (Indices: [0, 1, 3, 4, 6, 7, 9, 10, 11, 12, 19]), Candidate: [ 2  0  2  0  0  2  1 -1  2  1  0  1  0  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  1  0 -1  0  1 -1  1 -1  0  1 -1  1] (Indices: [0, 1, 3, 4, 6, 7, 9, 10, 13, 15, 18]), Candidate: [ 2  0  2  0  0  2  1 -1  2  1 -1  1  2  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  1 -1  1 -1  1  0 -1  1 -1  0  0  1] (Indices: [0, 1, 3, 4, 6, 7, 9, 11, 13, 14, 16]), Candidate: [ 2  0  2  0  0  2  1 -1  2  0  1  0  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  1 -1  0  1 -1  1  0 -1  1 -1  0  1] (Indices: [0, 1, 3, 4, 6, 7, 9, 12, 14, 15, 17]), Candidate: [ 2  0  2  0  0  2  1 -1  2  0  0  2  0  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  1 -1  0  0  0  0  1  0  0 -1  1  0] (Indices: [0, 1, 3, 4, 6, 7, 9, 15, 16, 17, 19]), Candidate: [ 2  0  2  0  0  2  1 -1  2  0  0  1  1  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  0  1  0 -1  0  0  1  0  0 -1  0  1] (Indices: [0, 1, 3, 4, 6, 7, 10, 11, 15, 16, 17]), Candidate: [ 2  0  2  0  0  2  1 -1  1  2  0  0  1  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  0  1 -1  0  1  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 3, 4, 6, 7, 10, 13, 14, 16, 18]), Candidate: [ 2  0  2  0  0  2  1 -1  1  2 -1  1  2  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 28000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  0  0  1  0 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 3, 4, 6, 7, 11, 12, 14, 16, 18]), Candidate: [ 2  0  2  0  0  2  1 -1  1  1  1  1  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  0  0  0  1  0  0  0  0 -1  0  0  1] (Indices: [0, 1, 3, 4, 6, 7, 12, 13, 14, 15, 16]), Candidate: [ 2  0  2  0  0  2  1 -1  1  1  0  2  1  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  0  0  0  0  0  1  0  0  0  0 -1  1] (Indices: [0, 1, 3, 4, 6, 7, 14, 15, 16, 17, 18]), Candidate: [ 2  0  2  0  0  2  1 -1  1  1  0  1  1  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1  0  0 -1  1 -1  0  0  1 -1  1 -1  1] (Indices: [0, 1, 3, 4, 6, 8, 9, 10, 12, 16, 18]), Candidate: [ 2  0  2  0  0  2  0  1  1  1 -1  2  0  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1  0 -1  1  0 -1  1 -1  0  0  0  1  0] (Indices: [0, 1, 3, 4, 6, 8, 9, 11, 12, 14, 19]), Candidate: [ 2  0  2  0  0  2  0  1  1  0  1  1  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1  0 -1  0  1  0  0 -1  0  0  0  1  0] (Indices: [0, 1, 3, 4, 6, 8, 9, 12, 13, 14, 19]), Candidate: [ 2  0  2  0  0  2  0  1  1  0  0  2  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1  0 -1  0  0  1 -1  0  0  1  0  0  0] (Indices: [0, 1, 3, 4, 6, 8, 9, 13, 17, 18, 19]), Candidate: [2 0 2 0 0 2 0 1 1 0 0 1 2 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 28350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1 -1  1  0 -1  1 -1  0  0  1 -1  1  0] (Indices: [0, 1, 3, 4, 6, 8, 10, 11, 13, 17, 19]), Candidate: [2 0 2 0 0 2 0 1 0 2 0 0 2 0 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 28400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1 -1  1 -1  1 -1  0  1 -1  1  0 -1  1] (Indices: [0, 1, 3, 4, 6, 8, 10, 12, 15, 17, 18]), Candidate: [ 2  0  2  0  0  2  0  1  0  2 -1  2  0  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1 -1  0  1  0  0 -1  1 -1  0  0  1  0] (Indices: [0, 1, 3, 4, 6, 8, 11, 12, 13, 15, 19]), Candidate: [2 0 2 0 0 2 0 1 0 1 1 1 1 0 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 28500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1 -1  0  1 -1  0  1  0 -1  1  0 -1  1] (Indices: [0, 1, 3, 4, 6, 8, 11, 14, 15, 17, 18]), Candidate: [2 0 2 0 0 2 0 1 0 1 1 0 1 2 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 28550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1 -1  0  0  0  1  0  0 -1  1  0 -1  1] (Indices: [0, 1, 3, 4, 6, 8, 13, 14, 15, 17, 18]), Candidate: [2 0 2 0 0 2 0 1 0 1 0 1 2 1 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 28600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  1  0  0 -1  1 -1  0  1 -1  0  1  0] (Indices: [0, 1, 3, 4, 6, 9, 10, 11, 13, 16, 19]), Candidate: [2 0 2 0 0 2 0 0 2 1 0 0 2 0 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 28650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  1  0 -1  1 -1  0  1  0 -1  1 -1  1] (Indices: [0, 1, 3, 4, 6, 9, 10, 12, 15, 16, 18]), Candidate: [ 2  0  2  0  0  2  0  0  2  1 -1  2  0  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  1 -1  1  0  0 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 3, 4, 6, 9, 11, 12, 13, 15, 17]), Candidate: [2 0 2 0 0 2 0 0 2 0 1 1 1 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 28750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  1 -1  1 -1  0  1  0  0 -1  1 -1  1] (Indices: [0, 1, 3, 4, 6, 9, 11, 14, 15, 16, 18]), Candidate: [2 0 2 0 0 2 0 0 2 0 1 0 1 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 28800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  1 -1  0  0  1  0  0  0 -1  1 -1  1] (Indices: [0, 1, 3, 4, 6, 9, 13, 14, 15, 16, 18]), Candidate: [2 0 2 0 0 2 0 0 2 0 0 1 2 1 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 28850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  0  1  0  0 -1  0  1 -1  0  1  0  0] (Indices: [0, 1, 3, 4, 6, 10, 11, 12, 15, 18, 19]), Candidate: [2 0 2 0 0 2 0 0 1 2 0 1 0 1 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 28900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  0  1 -1  1  0 -1  1  0  0 -1  0  1] (Indices: [0, 1, 3, 4, 6, 10, 12, 13, 15, 16, 17]), Candidate: [ 2  0  2  0  0  2  0  0  1  2 -1  2  1  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  0  0  1  0  0  0 -1  1  0 -1  0  1] (Indices: [0, 1, 3, 4, 6, 11, 12, 13, 14, 16, 17]), Candidate: [ 2  0  2  0  0  2  0  0  1  1  1  1  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  0  0  1 -1  0  1 -1  1  0  0  0  0] (Indices: [0, 1, 3, 4, 6, 11, 14, 16, 17, 18, 19]), Candidate: [ 2  0  2  0  0  2  0  0  1  1  1  0  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0  0  0  0 -1  0  0  1 -1  0  1 -1  1] (Indices: [0, 1, 3, 4, 7, 8, 9, 10, 11, 15, 18]), Candidate: [2 0 2 0 0 1 2 0 1 1 0 0 1 1 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 29100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0  0  0 -1  0  0  1 -1  1 -1  0  1  0] (Indices: [0, 1, 3, 4, 7, 8, 9, 10, 14, 16, 19]), Candidate: [ 2  0  2  0  0  1  2  0  1  1 -1  1  1  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0  0 -1  1 -1  0  1  0  0 -1  0  0  1] (Indices: [0, 1, 3, 4, 7, 8, 9, 11, 14, 15, 16]), Candidate: [2 0 2 0 0 1 2 0 1 0 1 0 1 2 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 29200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0  0 -1  0  1 -1  0  1 -1  0  1  0  0] (Indices: [0, 1, 3, 4, 7, 8, 9, 12, 15, 18, 19]), Candidate: [2 0 2 0 0 1 2 0 1 0 0 2 0 1 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 29250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0 -1  1  0  0 -1  1 -1  0  0  0  1  0] (Indices: [0, 1, 3, 4, 7, 8, 10, 11, 12, 14, 19]), Candidate: [ 2  0  2  0  0  1  2  0  0  2  0  1  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0 -1  1 -1  1  0  0 -1  0  0  0  1  0] (Indices: [0, 1, 3, 4, 7, 8, 10, 12, 13, 14, 19]), Candidate: [ 2  0  2  0  0  1  2  0  0  2 -1  2  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0 -1  1 -1  0  1 -1  0  0  1  0  0  0] (Indices: [0, 1, 3, 4, 7, 8, 10, 13, 17, 18, 19]), Candidate: [ 2  0  2  0  0  1  2  0  0  2 -1  1  2  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0 -1  0  1  0 -1  0  0  0  1  0  0  0] (Indices: [0, 1, 3, 4, 7, 8, 11, 12, 17, 18, 19]), Candidate: [2 0 2 0 0 1 2 0 0 1 1 1 0 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 29450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0 -1  0  0  1  0 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 3, 4, 7, 8, 12, 13, 15, 17, 19]), Candidate: [2 0 2 0 0 1 2 0 0 1 0 2 1 0 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 29500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  1  0  0  0 -1  1 -1  0  1 -1  0  1] (Indices: [0, 1, 3, 4, 7, 9, 10, 11, 12, 14, 17]), Candidate: [ 2  0  2  0  0  1  2 -1  2  1  0  1  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  1  0 -1  1  0  0 -1  0  1 -1  0  1] (Indices: [0, 1, 3, 4, 7, 9, 10, 12, 13, 14, 17]), Candidate: [ 2  0  2  0  0  1  2 -1  2  1 -1  2  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 29600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  1  0 -1  0  1 -1  0  1  0 -1  1  0] (Indices: [0, 1, 3, 4, 7, 9, 10, 13, 16, 17, 19]), Candidate: [ 2  0  2  0  0  1  2 -1  2  1 -1  1  2  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  1 -1  1  0 -1  0  0  1  0 -1  1  0] (Indices: [0, 1, 3, 4, 7, 9, 11, 12, 16, 17, 19]), Candidate: [ 2  0  2  0  0  1  2 -1  2  0  1  1  0  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  1 -1  0  1  0 -1  1  0 -1  0  1  0] (Indices: [0, 1, 3, 4, 7, 9, 12, 13, 15, 16, 19]), Candidate: [ 2  0  2  0  0  1  2 -1  2  0  0  2  1  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  0  1  0  0  0 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 3, 4, 7, 10, 11, 12, 13, 15, 17]), Candidate: [ 2  0  2  0  0  1  2 -1  1  2  0  1  1  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  0  1  0 -1  0  1  0  0 -1  1 -1  1] (Indices: [0, 1, 3, 4, 7, 10, 11, 14, 15, 16, 18]), Candidate: [ 2  0  2  0  0  1  2 -1  1  2  0  0  1  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  0  1 -1  0  1  0  0  0 -1  1 -1  1] (Indices: [0, 1, 3, 4, 7, 10, 13, 14, 15, 16, 18]), Candidate: [ 2  0  2  0  0  1  2 -1  1  2 -1  1  2  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  0  0  1  0 -1  0  1  0  0  0 -1  1] (Indices: [0, 1, 3, 4, 7, 11, 12, 15, 16, 17, 18]), Candidate: [ 2  0  2  0  0  1  2 -1  1  1  1  1  0  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  0  0  0  0  1  0  0 -1  1  0  0  0] (Indices: [0, 1, 3, 4, 7, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  0  2  0  0  1  2 -1  1  1  0  1  2  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1  0  0  0 -1  0  0  1  0  0 -1  0  1] (Indices: [0, 1, 3, 4, 8, 9, 10, 11, 15, 16, 17]), Candidate: [2 0 2 0 0 1 1 1 1 1 0 0 1 1 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 30050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1  0  0 -1  0  1  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 3, 4, 8, 9, 10, 13, 14, 16, 18]), Candidate: [ 2  0  2  0  0  1  1  1  1  1 -1  1  2  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 30100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1  0 -1  1  0 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 3, 4, 8, 9, 11, 12, 14, 16, 18]), Candidate: [ 2  0  2  0  0  1  1  1  1  0  1  1  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1  0 -1  0  1  0  0  0  0 -1  0  0  1] (Indices: [0, 1, 3, 4, 8, 9, 12, 13, 14, 15, 16]), Candidate: [2 0 2 0 0 1 1 1 1 0 0 2 1 1 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 30200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1  0 -1  0  0  0  1  0  0  0  0 -1  1] (Indices: [0, 1, 3, 4, 8, 9, 14, 15, 16, 17, 18]), Candidate: [2 0 2 0 0 1 1 1 1 0 0 1 1 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 30250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1 -1  1  0 -1  1  0 -1  0  0  1  0  0] (Indices: [0, 1, 3, 4, 8, 10, 11, 13, 14, 18, 19]), Candidate: [ 2  0  2  0  0  1  1  1  0  2  0  0  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1 -1  1 -1  1 -1  1  0 -1  1 -1  1  0] (Indices: [0, 1, 3, 4, 8, 10, 12, 14, 15, 17, 19]), Candidate: [ 2  0  2  0  0  1  1  1  0  2 -1  2  0  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1 -1  0  1  0  0 -1  0  1 -1  1  0  0] (Indices: [0, 1, 3, 4, 8, 11, 12, 13, 16, 18, 19]), Candidate: [2 0 2 0 0 1 1 1 0 1 1 1 1 0 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 30400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1 -1  0  0  1  0 -1  1  0 -1  1  0  0] (Indices: [0, 1, 3, 4, 8, 12, 13, 15, 16, 18, 19]), Candidate: [2 0 2 0 0 1 1 1 0 1 0 2 1 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 30450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  1  0  0  0 -1  0  0  0  1  0  0  0] (Indices: [0, 1, 3, 4, 9, 10, 11, 12, 17, 18, 19]), Candidate: [2 0 2 0 0 1 1 0 2 1 0 1 0 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 30500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  1  0 -1  1  0 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 3, 4, 9, 10, 12, 13, 15, 17, 19]), Candidate: [ 2  0  2  0  0  1  1  0  2  1 -1  2  1  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  1 -1  1  0  0  0 -1  0  1 -1  1  0] (Indices: [0, 1, 3, 4, 9, 11, 12, 13, 14, 17, 19]), Candidate: [ 2  0  2  0  0  1  1  0  2  0  1  1  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  1 -1  0  1  0  0  0  0 -1  0  1  0] (Indices: [0, 1, 3, 4, 9, 12, 13, 14, 15, 16, 19]), Candidate: [2 0 2 0 0 1 1 0 2 0 0 2 1 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 30650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  0  1  0  0 -1  1  0 -1  1 -1  1  0] (Indices: [0, 1, 3, 4, 10, 11, 12, 14, 15, 17, 19]), Candidate: [2 0 2 0 0 1 1 0 1 2 0 1 0 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 30700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  0  1 -1  1 -1  1  0 -1  1  0  0  0] (Indices: [0, 1, 3, 4, 10, 12, 14, 15, 17, 18, 19]), Candidate: [ 2  0  2  0  0  1  1  0  1  2 -1  2  0  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0  0  0  0 -1  0  0  0  1 -1  0  0  1] (Indices: [0, 1, 3, 5, 6, 7, 8, 9, 10, 11, 16]), Candidate: [ 2  0  2 -1  2  1  1  0  1  1  0  0  1  1  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0  0 -1  1 -1  0  0  1  0 -1  0  0  1] (Indices: [0, 1, 3, 5, 6, 7, 8, 9, 11, 15, 16]), Candidate: [ 2  0  2 -1  2  1  1  0  1  0  1  0  1  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0  0 -1  0  0  0  1 -1  1  0 -1  0  1] (Indices: [0, 1, 3, 5, 6, 7, 8, 9, 14, 16, 17]), Candidate: [ 2  0  2 -1  2  1  1  0  1  0  0  1  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 30900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0 -1  1 -1  1 -1  1  0 -1  0  0  0  1] (Indices: [0, 1, 3, 5, 6, 7, 8, 10, 12, 14, 15]), Candidate: [ 2  0  2 -1  2  1  1  0  0  2 -1  2  0  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 30950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0 -1  0  1  0  0  0 -1  0  0  0  0  1] (Indices: [0, 1, 3, 5, 6, 7, 8, 11, 12, 13, 14]), Candidate: [ 2  0  2 -1  2  1  1  0  0  1  1  1  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0 -1  0  1 -1  0  0  1 -1  1 -1  1  0] (Indices: [0, 1, 3, 5, 6, 7, 8, 11, 15, 17, 19]), Candidate: [ 2  0  2 -1  2  1  1  0  0  1  1  0  1  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0 -1  0  0  0  1  0 -1  0  0  1  0  0] (Indices: [0, 1, 3, 5, 6, 7, 8, 13, 14, 18, 19]), Candidate: [ 2  0  2 -1  2  1  1  0  0  1  0  1  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  1  0  0 -1  0  0  0  1 -1  0  1  0] (Indices: [0, 1, 3, 5, 6, 7, 9, 10, 11, 16, 19]), Candidate: [ 2  0  2 -1  2  1  1 -1  2  1  0  0  1  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  1  0 -1  0  0  0  1  0  0 -1  0  1] (Indices: [0, 1, 3, 5, 6, 7, 9, 10, 15, 16, 17]), Candidate: [ 2  0  2 -1  2  1  1 -1  2  1 -1  1  1  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 31200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  1 -1  1 -1  0  1 -1  1  0 -1  0  1] (Indices: [0, 1, 3, 5, 6, 7, 9, 11, 14, 16, 17]), Candidate: [ 2  0  2 -1  2  1  1 -1  2  0  1  0  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 31250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  1 -1  0  1 -1  0  0  0  1  0  0  0] (Indices: [0, 1, 3, 5, 6, 7, 9, 12, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  1  1 -1  2  0  0  2  0  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  0  1  0  0 -1  0  1 -1  0  0  1  0] (Indices: [0, 1, 3, 5, 6, 7, 10, 11, 12, 15, 19]), Candidate: [ 2  0  2 -1  2  1  1 -1  1  2  0  1  0  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  0  1 -1  1  0 -1  1 -1  0  0  1  0] (Indices: [0, 1, 3, 5, 6, 7, 10, 12, 13, 15, 19]), Candidate: [ 2  0  2 -1  2  1  1 -1  1  2 -1  2  1  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 31400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  0  1 -1  0  0  1  0 -1  1  0 -1  1] (Indices: [0, 1, 3, 5, 6, 7, 10, 14, 15, 17, 18]), Candidate: [ 2  0  2 -1  2  1  1 -1  1  2 -1  1  1  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 31450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  0  0  1 -1  1  0  0 -1  0  0  1  0] (Indices: [0, 1, 3, 5, 6, 7, 11, 13, 14, 15, 19]), Candidate: [ 2  0  2 -1  2  1  1 -1  1  1  1  0  2  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  0  0  0  1  0 -1  0  1 -1  1  0  0] (Indices: [0, 1, 3, 5, 6, 7, 12, 13, 16, 18, 19]), Candidate: [ 2  0  2 -1  2  1  1 -1  1  1  0  2  1  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1  0  0  0 -1  1 -1  0  0  0  0  1  0] (Indices: [0, 1, 3, 5, 6, 8, 9, 10, 11, 13, 19]), Candidate: [ 2  0  2 -1  2  1  0  1  1  1  0  0  2  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1  0  0 -1  0  1 -1  0  0  1 -1  1  0] (Indices: [0, 1, 3, 5, 6, 8, 9, 10, 13, 17, 19]), Candidate: [ 2  0  2 -1  2  1  0  1  1  1 -1  1  2  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1  0 -1  1 -1  1 -1  1 -1  0  1 -1  1] (Indices: [0, 1, 3, 5, 6, 8, 9, 11, 13, 15, 18]), Candidate: [ 2  0  2 -1  2  1  0  1  1  0  1  0  2  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1  0 -1  0  1 -1  1 -1  0  1  0 -1  1] (Indices: [0, 1, 3, 5, 6, 8, 9, 12, 14, 17, 18]), Candidate: [ 2  0  2 -1  2  1  0  1  1  0  0  2  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1 -1  1  0  0  0 -1  0  1 -1  0  0  1] (Indices: [0, 1, 3, 5, 6, 8, 10, 11, 12, 13, 16]), Candidate: [ 2  0  2 -1  2  1  0  1  0  2  0  1  1  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1 -1  1  0 -1  0  0  0  1  0  0 -1  1] (Indices: [0, 1, 3, 5, 6, 8, 10, 11, 16, 17, 18]), Candidate: [ 2  0  2 -1  2  1  0  1  0  2  0  0  1  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1 -1  1 -1  0  1 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 3, 5, 6, 8, 10, 13, 15, 16, 18]), Candidate: [ 2  0  2 -1  2  1  0  1  0  2 -1  1  2  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1 -1  0  1  0 -1  0  1  0 -1  1 -1  1] (Indices: [0, 1, 3, 5, 6, 8, 11, 12, 15, 16, 18]), Candidate: [ 2  0  2 -1  2  1  0  1  0  1  1  1  0  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1 -1  0  0  1  0  0 -1  1 -1  0  1  0] (Indices: [0, 1, 3, 5, 6, 8, 12, 13, 14, 16, 19]), Candidate: [ 2  0  2 -1  2  1  0  1  0  1  0  2  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  1  0  0  0  0  0 -1  0  0  0  0  1] (Indices: [0, 1, 3, 5, 6, 9, 10, 11, 12, 13, 14]), Candidate: [ 2  0  2 -1  2  1  0  0  2  1  0  1  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  1  0  0 -1  0  0  1 -1  1 -1  1  0] (Indices: [0, 1, 3, 5, 6, 9, 10, 11, 15, 17, 19]), Candidate: [ 2  0  2 -1  2  1  0  0  2  1  0  0  1  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  1  0 -1  0  1  0 -1  0  0  1  0  0] (Indices: [0, 1, 3, 5, 6, 9, 10, 13, 14, 18, 19]), Candidate: [ 2  0  2 -1  2  1  0  0  2  1 -1  1  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 32150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  1 -1  1  0 -1  1 -1  0  0  1  0  0] (Indices: [0, 1, 3, 5, 6, 9, 11, 12, 14, 18, 19]), Candidate: [ 2  0  2 -1  2  1  0  0  2  0  1  1  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  1 -1  0  1  0  0 -1  1  0 -1  0  1] (Indices: [0, 1, 3, 5, 6, 9, 12, 13, 14, 16, 17]), Candidate: [ 2  0  2 -1  2  1  0  0  2  0  0  2  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  1 -1  0  0  0  1 -1  1  0  0  0  0] (Indices: [0, 1, 3, 5, 6, 9, 14, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  1  0  0  2  0  0  1  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  0  1  0 -1  1 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 3, 5, 6, 10, 11, 13, 15, 17, 18]), Candidate: [ 2  0  2 -1  2  1  0  0  1  2  0  0  2  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  0  1 -1  1 -1  1 -1  1 -1  1  0  0] (Indices: [0, 1, 3, 5, 6, 10, 12, 14, 16, 18, 19]), Candidate: [ 2  0  2 -1  2  1  0  0  1  2 -1  2  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 32400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  0  0  1  0 -1  1  0  0 -1  0  1  0] (Indices: [0, 1, 3, 5, 6, 11, 12, 14, 15, 16, 19]), Candidate: [ 2  0  2 -1  2  1  0  0  1  1  1  1  0  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  0  0  0  1 -1  1  0  0  0 -1  1  0] (Indices: [0, 1, 3, 5, 6, 12, 14, 15, 16, 17, 19]), Candidate: [ 2  0  2 -1  2  1  0  0  1  1  0  2  0  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0  0  0 -1  1 -1  1 -1  0  0  0  1  0] (Indices: [0, 1, 3, 5, 7, 8, 9, 10, 12, 14, 19]), Candidate: [ 2  0  2 -1  2  0  2  0  1  1 -1  2  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 32550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0  0 -1  1  0  0 -1  0  0  0  1 -1  1] (Indices: [0, 1, 3, 5, 7, 8, 9, 11, 12, 13, 18]), Candidate: [ 2  0  2 -1  2  0  2  0  1  0  1  1  1  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0  0 -1  1 -1  0  0  0  1 -1  1  0  0] (Indices: [0, 1, 3, 5, 7, 8, 9, 11, 16, 18, 19]), Candidate: [ 2  0  2 -1  2  0  2  0  1  0  1  0  1  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0  0 -1  0  0  1 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 3, 5, 7, 8, 9, 13, 15, 17, 18]), Candidate: [ 2  0  2 -1  2  0  2  0  1  0  0  1  2  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0 -1  1  0 -1  1 -1  1 -1  0  1 -1  1] (Indices: [0, 1, 3, 5, 7, 8, 10, 11, 13, 15, 18]), Candidate: [ 2  0  2 -1  2  0  2  0  0  2  0  0  2  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0 -1  1 -1  1 -1  1 -1  0  1  0 -1  1] (Indices: [0, 1, 3, 5, 7, 8, 10, 12, 14, 17, 18]), Candidate: [ 2  0  2 -1  2  0  2  0  0  2 -1  2  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 32800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0 -1  0  1  0  0  0 -1  0  1 -1  0  1] (Indices: [0, 1, 3, 5, 7, 8, 11, 12, 13, 14, 17]), Candidate: [ 2  0  2 -1  2  0  2  0  0  1  1  1  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0 -1  0  1 -1  1 -1  0  1  0 -1  1  0] (Indices: [0, 1, 3, 5, 7, 8, 11, 13, 16, 17, 19]), Candidate: [ 2  0  2 -1  2  0  2  0  0  1  1  0  2  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0 -1  0  0  1 -1  0  1  0 -1  1  0  0] (Indices: [0, 1, 3, 5, 7, 8, 12, 15, 16, 18, 19]), Candidate: [ 2  0  2 -1  2  0  2  0  0  1  0  2  0  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  1  0  0 -1  1 -1  1  0 -1  0  0  1] (Indices: [0, 1, 3, 5, 7, 9, 10, 11, 13, 15, 16]), Candidate: [ 2  0  2 -1  2  0  2 -1  2  1  0  0  2  0  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 33000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  1  0 -1  1 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 3, 5, 7, 9, 10, 12, 14, 16, 18]), Candidate: [ 2  0  2 -1  2  0  2 -1  2  1 -1  2  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 33050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  1 -1  1  0  0  0  0 -1  0  0  0  1] (Indices: [0, 1, 3, 5, 7, 9, 11, 12, 13, 14, 15]), Candidate: [ 2  0  2 -1  2  0  2 -1  2  0  1  1  1  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 33100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  1 -1  1 -1  1 -1  1 -1  0  1  0  0] (Indices: [0, 1, 3, 5, 7, 9, 11, 13, 15, 18, 19]), Candidate: [ 2  0  2 -1  2  0  2 -1  2  0  1  0  2  0  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 33150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  1 -1  0  1 -1  0  1  0  0  0 -1  1] (Indices: [0, 1, 3, 5, 7, 9, 12, 15, 16, 17, 18]), Candidate: [ 2  0  2 -1  2  0  2 -1  2  0  0  2  0  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 33200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  0  1  0  0 -1  1 -1  0  0  1  0  0] (Indices: [0, 1, 3, 5, 7, 10, 11, 12, 14, 18, 19]), Candidate: [ 2  0  2 -1  2  0  2 -1  1  2  0  1  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 33250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  0  1 -1  1  0  0 -1  1  0 -1  0  1] (Indices: [0, 1, 3, 5, 7, 10, 12, 13, 14, 16, 17]), Candidate: [ 2  0  2 -1  2  0  2 -1  1  2 -1  2  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 33300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  0  1 -1  0  0  1 -1  1  0  0  0  0] (Indices: [0, 1, 3, 5, 7, 10, 14, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  0  2 -1  1  2 -1  1  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 33350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  0  0  1 -1  1 -1  1 -1  1  0  0  0] (Indices: [0, 1, 3, 5, 7, 11, 13, 15, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  0  2 -1  1  1  1  0  2  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 33400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1  0  0  0  0 -1  0  1 -1  0  0  1  0] (Indices: [0, 1, 3, 5, 8, 9, 10, 11, 12, 15, 19]), Candidate: [ 2  0  2 -1  2  0  1  1  1  1  0  1  0  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1  0  0 -1  1  0 -1  1 -1  0  0  1  0] (Indices: [0, 1, 3, 5, 8, 9, 10, 12, 13, 15, 19]), Candidate: [ 2  0  2 -1  2  0  1  1  1  1 -1  2  1  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 33500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1  0  0 -1  0  0  1  0 -1  1  0 -1  1] (Indices: [0, 1, 3, 5, 8, 9, 10, 14, 15, 17, 18]), Candidate: [ 2  0  2 -1  2  0  1  1  1  1 -1  1  1  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 33550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1  0 -1  1 -1  1  0  0 -1  0  0  1  0] (Indices: [0, 1, 3, 5, 8, 9, 11, 13, 14, 15, 19]), Candidate: [ 2  0  2 -1  2  0  1  1  1  0  1  0  2  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1  0 -1  0  1  0 -1  0  1 -1  1  0  0] (Indices: [0, 1, 3, 5, 8, 9, 12, 13, 16, 18, 19]), Candidate: [ 2  0  2 -1  2  0  1  1  1  0  0  2  1  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1 -1  1  0  0  0 -1  0  0  1  0 -1  1] (Indices: [0, 1, 3, 5, 8, 10, 11, 12, 13, 17, 18]), Candidate: [ 2  0  2 -1  2  0  1  1  0  2  0  1  1  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1 -1  1  0 -1  0  1 -1  1  0 -1  1  0] (Indices: [0, 1, 3, 5, 8, 10, 11, 14, 16, 17, 19]), Candidate: [ 2  0  2 -1  2  0  1  1  0  2  0  0  1  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 33750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1 -1  1 -1  0  1  0 -1  1  0 -1  1  0] (Indices: [0, 1, 3, 5, 8, 10, 13, 14, 16, 17, 19]), Candidate: [ 2  0  2 -1  2  0  1  1  0  2 -1  1  2  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 33800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1 -1  0  1 -1  1  0  0  0 -1  1 -1  1] (Indices: [0, 1, 3, 5, 8, 11, 13, 14, 15, 16, 18]), Candidate: [ 2  0  2 -1  2  0  1  1  0  1  1  0  2  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  1  0  0  0  0  0 -1  0  1 -1  0  1] (Indices: [0, 1, 3, 5, 9, 10, 11, 12, 13, 14, 17]), Candidate: [ 2  0  2 -1  2  0  1  0  2  1  0  1  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 33900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  1  0  0 -1  1 -1  0  1  0 -1  1  0] (Indices: [0, 1, 3, 5, 9, 10, 11, 13, 16, 17, 19]), Candidate: [ 2  0  2 -1  2  0  1  0  2  1  0  0  2  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  1  0 -1  1 -1  0  1  0 -1  1  0  0] (Indices: [0, 1, 3, 5, 9, 10, 12, 15, 16, 18, 19]), Candidate: [ 2  0  2 -1  2  0  1  0  2  1 -1  2  0  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  1 -1  1  0 -1  1 -1  1  0  0 -1  1] (Indices: [0, 1, 3, 5, 9, 11, 12, 14, 16, 17, 18]), Candidate: [ 2  0  2 -1  2  0  1  0  2  0  1  1  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  1 -1  0  1 -1  0  1  0  0  0  0  0] (Indices: [0, 1, 3, 5, 9, 12, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  0  1  0  2  0  0  2  0  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  0  1  0 -1  1  0 -1  1  0 -1  1  0] (Indices: [0, 1, 3, 5, 10, 11, 13, 14, 16, 17, 19]), Candidate: [ 2  0  2 -1  2  0  1  0  1  2  0  0  2  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  0  0  1  0  0  0 -1  1 -1  1  0  0] (Indices: [0, 1, 3, 5, 11, 12, 13, 14, 16, 18, 19]), Candidate: [ 2  0  2 -1  2  0  1  0  1  1  1  1  1  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0  0  0  0 -1  0  0  0  1  0 -1  0  1] (Indices: [0, 1, 3, 6, 7, 8, 9, 10, 11, 16, 17]), Candidate: [ 2  0  2 -1  1  2  1  0  1  1  0  0  1  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0  0  0 -1  0  0  1 -1  0  1 -1  1  0] (Indices: [0, 1, 3, 6, 7, 8, 9, 10, 14, 17, 19]), Candidate: [ 2  0  2 -1  1  2  1  0  1  1 -1  1  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 34300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0  0 -1  1 -1  0  1  0 -1  0  1 -1  1] (Indices: [0, 1, 3, 6, 7, 8, 9, 11, 14, 15, 18]), Candidate: [ 2  0  2 -1  1  2  1  0  1  0  1  0  1  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0  0 -1  0  1 -1  0  0  1  0 -1  1  0] (Indices: [0, 1, 3, 6, 7, 8, 9, 12, 16, 17, 19]), Candidate: [ 2  0  2 -1  1  2  1  0  1  0  0  2  0  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0 -1  1  0  0 -1  0  1 -1  1 -1  0  1] (Indices: [0, 1, 3, 6, 7, 8, 10, 11, 12, 15, 17]), Candidate: [ 2  0  2 -1  1  2  1  0  0  2  0  1  0  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0 -1  1 -1  1  0 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 3, 6, 7, 8, 10, 12, 13, 15, 17]), Candidate: [ 2  0  2 -1  1  2  1  0  0  2 -1  2  1  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0 -1  1 -1  0  0  1  0  0 -1  1 -1  1] (Indices: [0, 1, 3, 6, 7, 8, 10, 14, 15, 16, 18]), Candidate: [ 2  0  2 -1  1  2  1  0  0  2 -1  1  1  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0 -1  0  1 -1  1  0  0 -1  1 -1  0  1] (Indices: [0, 1, 3, 6, 7, 8, 11, 13, 14, 15, 17]), Candidate: [ 2  0  2 -1  1  2  1  0  0  1  1  0  2  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0 -1  0  0  1  0 -1  0  1  0  0 -1  1] (Indices: [0, 1, 3, 6, 7, 8, 12, 13, 16, 17, 18]), Candidate: [ 2  0  2 -1  1  2  1  0  0  1  0  2  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  1  0  0  0 -1  1 -1  0  0  0  1  0] (Indices: [0, 1, 3, 6, 7, 9, 10, 11, 12, 14, 19]), Candidate: [ 2  0  2 -1  1  2  1 -1  2  1  0  1  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 34700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  1  0 -1  1  0  0 -1  0  0  0  1  0] (Indices: [0, 1, 3, 6, 7, 9, 10, 12, 13, 14, 19]), Candidate: [ 2  0  2 -1  1  2  1 -1  2  1 -1  2  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 34750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  1  0 -1  0  1 -1  0  0  1  0  0  0] (Indices: [0, 1, 3, 6, 7, 9, 10, 13, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  2  1 -1  2  1 -1  1  2  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 34800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  1 -1  1  0 -1  0  0  0  1  0  0  0] (Indices: [0, 1, 3, 6, 7, 9, 11, 12, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  2  1 -1  2  0  1  1  0  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  1 -1  0  1  0 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 3, 6, 7, 9, 12, 13, 15, 17, 19]), Candidate: [ 2  0  2 -1  1  2  1 -1  2  0  0  2  1  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  0  1  0  0  0 -1  1 -1  0  0  1  0] (Indices: [0, 1, 3, 6, 7, 10, 11, 12, 13, 15, 19]), Candidate: [ 2  0  2 -1  1  2  1 -1  1  2  0  1  1  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  0  1  0 -1  0  1  0 -1  1  0 -1  1] (Indices: [0, 1, 3, 6, 7, 10, 11, 14, 15, 17, 18]), Candidate: [ 2  0  2 -1  1  2  1 -1  1  2  0  0  1  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  0  1 -1  0  1  0  0 -1  1  0 -1  1] (Indices: [0, 1, 3, 6, 7, 10, 13, 14, 15, 17, 18]), Candidate: [ 2  0  2 -1  1  2  1 -1  1  2 -1  1  2  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 35050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  0  0  1  0 -1  0  1  0 -1  1  0  0] (Indices: [0, 1, 3, 6, 7, 11, 12, 15, 16, 18, 19]), Candidate: [ 2  0  2 -1  1  2  1 -1  1  1  1  1  0  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  0  0  0  0  1 -1  1  0  0  0  0  0] (Indices: [0, 1, 3, 6, 7, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  2  1 -1  1  1  0  1  2  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1  0  0  0 -1  0  0  1  0 -1  0  1  0] (Indices: [0, 1, 3, 6, 8, 9, 10, 11, 15, 16, 19]), Candidate: [ 2  0  2 -1  1  2  0  1  1  1  0  0  1  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1  0  0 -1  0  1  0 -1  0  1  0 -1  1] (Indices: [0, 1, 3, 6, 8, 9, 10, 13, 14, 17, 18]), Candidate: [ 2  0  2 -1  1  2  0  1  1  1 -1  1  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 35250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1  0 -1  1  0 -1  1 -1  0  1  0 -1  1] (Indices: [0, 1, 3, 6, 8, 9, 11, 12, 14, 17, 18]), Candidate: [ 2  0  2 -1  1  2  0  1  1  0  1  1  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1  0 -1  0  1  0  0  0 -1  0  1 -1  1] (Indices: [0, 1, 3, 6, 8, 9, 12, 13, 14, 15, 18]), Candidate: [ 2  0  2 -1  1  2  0  1  1  0  0  2  1  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1  0 -1  0  0  0  1  0  0 -1  1  0  0] (Indices: [0, 1, 3, 6, 8, 9, 14, 15, 16, 18, 19]), Candidate: [ 2  0  2 -1  1  2  0  1  1  0  0  1  1  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1 -1  1  0 -1  1 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 3, 6, 8, 10, 11, 13, 15, 16, 18]), Candidate: [ 2  0  2 -1  1  2  0  1  0  2  0  0  2  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1 -1  1 -1  1 -1  1 -1  1  0  0 -1  1] (Indices: [0, 1, 3, 6, 8, 10, 12, 14, 16, 17, 18]), Candidate: [ 2  0  2 -1  1  2  0  1  0  2 -1  2  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 35500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1 -1  0  1  0 -1  1  0  0  0 -1  0  1] (Indices: [0, 1, 3, 6, 8, 11, 12, 14, 15, 16, 17]), Candidate: [ 2  0  2 -1  1  2  0  1  0  1  1  1  0  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1 -1  0  0  1  0 -1  0  1  0  0  0  0] (Indices: [0, 1, 3, 6, 8, 12, 13, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  2  0  1  0  1  0  2  1  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  1  0  0 -1  1  0  0 -1  1 -1  0  1] (Indices: [0, 1, 3, 6, 9, 10, 11, 13, 14, 15, 17]), Candidate: [ 2  0  2 -1  1  2  0  0  2  1  0  0  2  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  1  0 -1  1  0 -1  0  1  0  0 -1  1] (Indices: [0, 1, 3, 6, 9, 10, 12, 13, 16, 17, 18]), Candidate: [ 2  0  2 -1  1  2  0  0  2  1 -1  2  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  1 -1  1  0  0 -1  1  0  0 -1  0  1] (Indices: [0, 1, 3, 6, 9, 11, 12, 13, 15, 16, 17]), Candidate: [ 2  0  2 -1  1  2  0  0  2  0  1  1  1  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  1 -1  0  1  0  0  0 -1  1 -1  1  0] (Indices: [0, 1, 3, 6, 9, 12, 13, 14, 15, 17, 19]), Candidate: [ 2  0  2 -1  1  2  0  0  2  0  0  2  1  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  0  1  0  0 -1  1 -1  1  0  0 -1  1] (Indices: [0, 1, 3, 6, 10, 11, 12, 14, 16, 17, 18]), Candidate: [ 2  0  2 -1  1  2  0  0  1  2  0  1  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  0  1 -1  1 -1  0  1  0  0  0  0  0] (Indices: [0, 1, 3, 6, 10, 12, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  2  0  0  1  2 -1  2  0  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0  0  0  0  0 -1  1  0 -1  0  0  0  1] (Indices: [0, 1, 3, 7, 8, 9, 10, 11, 12, 14, 15]), Candidate: [ 2  0  2 -1  1  1  2  0  1  1  0  1  0  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0  0  0 -1  1  0  0  0 -1  0  0  0  1] (Indices: [0, 1, 3, 7, 8, 9, 10, 12, 13, 14, 15]), Candidate: [ 2  0  2 -1  1  1  2  0  1  1 -1  2  1  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0  0  0 -1  0  1 -1  1 -1  0  1  0  0] (Indices: [0, 1, 3, 7, 8, 9, 10, 13, 15, 18, 19]), Candidate: [ 2  0  2 -1  1  1  2  0  1  1 -1  1  2  0  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0  0 -1  1  0 -1  0  1 -1  0  1  0  0] (Indices: [0, 1, 3, 7, 8, 9, 11, 12, 15, 18, 19]), Candidate: [ 2  0  2 -1  1  1  2  0  1  0  1  1  0  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0  0 -1  0  1  0 -1  1  0  0 -1  0  1] (Indices: [0, 1, 3, 7, 8, 9, 12, 13, 15, 16, 17]), Candidate: [ 2  0  2 -1  1  1  2  0  1  0  0  2  1  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0 -1  1  0  0  0  0 -1  0  0  0  1  0] (Indices: [0, 1, 3, 7, 8, 10, 11, 12, 13, 14, 19]), Candidate: [ 2  0  2 -1  1  1  2  0  0  2  0  1  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0 -1  1  0 -1  1 -1  0  0  1  0  0  0] (Indices: [0, 1, 3, 7, 8, 10, 11, 13, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  2  0  0  2  0  0  2  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0 -1  1 -1  1 -1  0  0  1  0  0  0  0] (Indices: [0, 1, 3, 7, 8, 10, 12, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  2  0  0  2 -1  2  0  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0 -1  0  1  0 -1  1 -1  1 -1  1  0  0] (Indices: [0, 1, 3, 7, 8, 11, 12, 14, 16, 18, 19]), Candidate: [ 2  0  2 -1  1  1  2  0  0  1  1  1  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0 -1  0  0  0  1  0  0  0  0 -1  1  0] (Indices: [0, 1, 3, 7, 8, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  0  2 -1  1  1  2  0  0  1  0  1  2  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  1  0  0 -1  1  0 -1  0  0  1  0  0] (Indices: [0, 1, 3, 7, 9, 10, 11, 13, 14, 18, 19]), Candidate: [ 2  0  2 -1  1  1  2 -1  2  1  0  0  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 36450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  1  0 -1  1 -1  1  0 -1  1 -1  1  0] (Indices: [0, 1, 3, 7, 9, 10, 12, 14, 15, 17, 19]), Candidate: [ 2  0  2 -1  1  1  2 -1  2  1 -1  2  0  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 36500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  1 -1  1  0  0 -1  0  1 -1  1  0  0] (Indices: [0, 1, 3, 7, 9, 11, 12, 13, 16, 18, 19]), Candidate: [ 2  0  2 -1  1  1  2 -1  2  0  1  1  1  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  1 -1  0  1  0 -1  1  0 -1  1  0  0] (Indices: [0, 1, 3, 7, 9, 12, 13, 15, 16, 18, 19]), Candidate: [ 2  0  2 -1  1  1  2 -1  2  0  0  2  1  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  0  1  0  0 -1  0  0  1  0  0  0  0] (Indices: [0, 1, 3, 7, 10, 11, 12, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  2 -1  1  2  0  1  0  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  0  0  1  0  0  0  0  0  0 -1  0  1] (Indices: [0, 1, 3, 7, 11, 12, 13, 14, 15, 16, 17]), Candidate: [ 2  0  2 -1  1  1  2 -1  1  1  1  1  1  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1  0  0  0  0  0 -1  0  0  0  1  0  0] (Indices: [0, 1, 3, 8, 9, 10, 11, 12, 13, 18, 19]), Candidate: [ 2  0  2 -1  1  1  1  1  1  1  0  1  1  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1  0  0  0 -1  0  1 -1  0  1  0  0  0] (Indices: [0, 1, 3, 8, 9, 10, 11, 14, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  1  1  1  1  0  0  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1  0  0 -1  0  1  0 -1  0  1  0  0  0] (Indices: [0, 1, 3, 8, 9, 10, 13, 14, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  1  1  1  1 -1  1  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 36850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1  0 -1  1 -1  1  0  0 -1  1  0 -1  1] (Indices: [0, 1, 3, 8, 9, 11, 13, 14, 15, 17, 18]), Candidate: [ 2  0  2 -1  1  1  1  1  1  0  1  0  2  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1 -1  1  0  0  0  0 -1  1  0 -1  0  1] (Indices: [0, 1, 3, 8, 10, 11, 12, 13, 14, 16, 17]), Candidate: [ 2  0  2 -1  1  1  1  1  0  2  0  1  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1 -1  1  0 -1  0  1 -1  1  0  0  0  0] (Indices: [0, 1, 3, 8, 10, 11, 14, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  1  1  0  2  0  0  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1 -1  0  1  0 -1  0  1  0  0  0  0  0] (Indices: [0, 1, 3, 8, 11, 12, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  1  1  0  1  1  1  0  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  1  0  0  0 -1  0  0  1  0  0  0  0] (Indices: [0, 1, 3, 9, 10, 11, 12, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  1  0  2  1  0  1  0  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  1 -1  1  0  0  0  0  0  0 -1  0  1] (Indices: [0, 1, 3, 9, 11, 12, 13, 14, 15, 16, 17]), Candidate: [ 2  0  2 -1  1  1  1  0  2  0  1  1  1  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  0  1  0  0  0 -1  0  1  0  0  0  0] (Indices: [0, 1, 3, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  1  0  1  2  0  1  1  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0  0  0 -1  0  1 -1  0  0  0  1 -1  1] (Indices: [0, 1, 4, 5, 6, 7, 8, 9, 10, 13, 18]), Candidate: [ 2  0  1  1  1  1  1  0  1  1 -1  1  2  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0  0 -1  0  1  0 -1  0  0  0  0  1  0] (Indices: [0, 1, 4, 5, 6, 7, 8, 9, 12, 13, 19]), Candidate: [2 0 1 1 1 1 1 0 1 0 0 2 1 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 37300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0  0 -1  0  0  0  0  0  0  1  0  0  0] (Indices: [0, 1, 4, 5, 6, 7, 8, 9, 17, 18, 19]), Candidate: [2 0 1 1 1 1 1 0 1 0 0 1 1 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 37350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0 -1  1 -1  0  1  0  0 -1  0  0  0  1] (Indices: [0, 1, 4, 5, 6, 7, 8, 10, 13, 14, 15]), Candidate: [ 2  0  1  1  1  1  1  0  0  2 -1  1  2  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0 -1  0  1  0 -1  0  0  1  0 -1  0  1] (Indices: [0, 1, 4, 5, 6, 7, 8, 11, 12, 16, 17]), Candidate: [2 0 1 1 1 1 1 0 0 1 1 1 0 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 37450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0 -1  0  0  1  0 -1  0  1  0 -1  0  1] (Indices: [0, 1, 4, 5, 6, 7, 8, 12, 13, 16, 17]), Candidate: [2 0 1 1 1 1 1 0 0 1 0 2 1 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 37500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0 -1  0  0  0  0  1  0 -1  1 -1  1  0] (Indices: [0, 1, 4, 5, 6, 7, 8, 14, 15, 17, 19]), Candidate: [2 0 1 1 1 1 1 0 0 1 0 1 1 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 37550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  1  0 -1  1 -1  0  1  0 -1  0  0  1] (Indices: [0, 1, 4, 5, 6, 7, 9, 10, 12, 15, 16]), Candidate: [ 2  0  1  1  1  1  1 -1  2  1 -1  2  0  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  1 -1  1  0  0 -1  0  0  0  0  1  0] (Indices: [0, 1, 4, 5, 6, 7, 9, 11, 12, 13, 19]), Candidate: [ 2  0  1  1  1  1  1 -1  2  0  1  1  1  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  1 -1  1 -1  0  0  0  0  1  0  0  0] (Indices: [0, 1, 4, 5, 6, 7, 9, 11, 17, 18, 19]), Candidate: [ 2  0  1  1  1  1  1 -1  2  0  1  0  1  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  1 -1  0  0  1 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 4, 5, 6, 7, 9, 13, 15, 17, 19]), Candidate: [ 2  0  1  1  1  1  1 -1  2  0  0  1  2  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  0  1  0 -1  1 -1  1 -1  0  0  1  0] (Indices: [0, 1, 4, 5, 6, 7, 10, 11, 13, 15, 19]), Candidate: [ 2  0  1  1  1  1  1 -1  1  2  0  0  2  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  0  1 -1  1 -1  1 -1  0  1 -1  1  0] (Indices: [0, 1, 4, 5, 6, 7, 10, 12, 14, 17, 19]), Candidate: [ 2  0  1  1  1  1  1 -1  1  2 -1  2  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 37850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  0  0  1  0  0  0 -1  0  0  1 -1  1] (Indices: [0, 1, 4, 5, 6, 7, 11, 12, 13, 14, 18]), Candidate: [ 2  0  1  1  1  1  1 -1  1  1  1  1  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  0  0  1 -1  1 -1  0  1 -1  1  0  0] (Indices: [0, 1, 4, 5, 6, 7, 11, 13, 16, 18, 19]), Candidate: [ 2  0  1  1  1  1  1 -1  1  1  1  0  2  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  0  0  0  1 -1  0  1 -1  1  0  0  0] (Indices: [0, 1, 4, 5, 6, 7, 12, 15, 17, 18, 19]), Candidate: [ 2  0  1  1  1  1  1 -1  1  1  0  2  0  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1  0  0  0 -1  0  0  0  0  0  1  0  0] (Indices: [0, 1, 4, 5, 6, 8, 9, 10, 11, 18, 19]), Candidate: [2 0 1 1 1 1 0 1 1 1 0 0 1 1 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 38050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1  0  0 -1  0  0  0  1 -1  1  0 -1  1] (Indices: [0, 1, 4, 5, 6, 8, 9, 10, 15, 17, 18]), Candidate: [ 2  0  1  1  1  1  0  1  1  1 -1  1  1  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1  0 -1  1 -1  0  1 -1  0  1  0 -1  1] (Indices: [0, 1, 4, 5, 6, 8, 9, 11, 14, 17, 18]), Candidate: [ 2  0  1  1  1  1  0  1  1  0  1  0  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1  0 -1  0  0  1  0  0 -1  0  1 -1  1] (Indices: [0, 1, 4, 5, 6, 8, 9, 13, 14, 15, 18]), Candidate: [2 0 1 1 1 1 0 1 1 0 0 1 2 1 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 38200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1 -1  1  0  0 -1  0  0  1 -1  0  1  0] (Indices: [0, 1, 4, 5, 6, 8, 10, 11, 12, 16, 19]), Candidate: [2 0 1 1 1 1 0 1 0 2 0 1 0 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 38250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1 -1  1 -1  1  0 -1  0  1 -1  0  1  0] (Indices: [0, 1, 4, 5, 6, 8, 10, 12, 13, 16, 19]), Candidate: [ 2  0  1  1  1  1  0  1  0  2 -1  2  1  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1 -1  1 -1  0  0  1 -1  1  0  0 -1  1] (Indices: [0, 1, 4, 5, 6, 8, 10, 14, 16, 17, 18]), Candidate: [ 2  0  1  1  1  1  0  1  0  2 -1  1  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1 -1  0  1 -1  1  0 -1  1 -1  0  1  0] (Indices: [0, 1, 4, 5, 6, 8, 11, 13, 14, 16, 19]), Candidate: [ 2  0  1  1  1  1  0  1  0  1  1  0  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1 -1  0  0  1 -1  1  0  0 -1  1 -1  1] (Indices: [0, 1, 4, 5, 6, 8, 12, 14, 15, 16, 18]), Candidate: [2 0 1 1 1 1 0 1 0 1 0 2 0 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 38450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  1  0  0  0 -1  0  0  1  0 -1  0  1] (Indices: [0, 1, 4, 5, 6, 9, 10, 11, 12, 16, 17]), Candidate: [2 0 1 1 1 1 0 0 2 1 0 1 0 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 38500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  1  0 -1  1  0 -1  0  1  0 -1  0  1] (Indices: [0, 1, 4, 5, 6, 9, 10, 12, 13, 16, 17]), Candidate: [ 2  0  1  1  1  1  0  0  2  1 -1  2  1  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  1  0 -1  0  0  1  0 -1  1 -1  1  0] (Indices: [0, 1, 4, 5, 6, 9, 10, 14, 15, 17, 19]), Candidate: [ 2  0  1  1  1  1  0  0  2  1 -1  1  1  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  1 -1  1 -1  1  0 -1  1  0 -1  0  1] (Indices: [0, 1, 4, 5, 6, 9, 11, 13, 14, 16, 17]), Candidate: [ 2  0  1  1  1  1  0  0  2  0  1  0  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  1 -1  0  1  0 -1  0  0  1  0  0  0] (Indices: [0, 1, 4, 5, 6, 9, 12, 13, 17, 18, 19]), Candidate: [2 0 1 1 1 1 0 0 2 0 0 2 1 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 38700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  0  1  0  0  0 -1  0  0  1 -1  1  0] (Indices: [0, 1, 4, 5, 6, 10, 11, 12, 13, 17, 19]), Candidate: [2 0 1 1 1 1 0 0 1 2 0 1 1 0 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 38750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  0  1  0 -1  0  1 -1  1 -1  1  0  0] (Indices: [0, 1, 4, 5, 6, 10, 11, 14, 16, 18, 19]), Candidate: [ 2  0  1  1  1  1  0  0  1  2  0  0  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  0  1 -1  0  1  0 -1  1 -1  1  0  0] (Indices: [0, 1, 4, 5, 6, 10, 13, 14, 16, 18, 19]), Candidate: [ 2  0  1  1  1  1  0  0  1  2 -1  1  2  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  0  0  1 -1  1  0  0  0 -1  0  1  0] (Indices: [0, 1, 4, 5, 6, 11, 13, 14, 15, 16, 19]), Candidate: [2 0 1 1 1 1 0 0 1 1 1 0 2 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 38900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0  0  0  0  0 -1  0  0  1 -1  0  0  1] (Indices: [0, 1, 4, 5, 7, 8, 9, 10, 11, 12, 16]), Candidate: [2 0 1 1 1 0 2 0 1 1 0 1 0 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 38950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0  0  0 -1  0  1  0 -1  0  0  0  1  0] (Indices: [0, 1, 4, 5, 7, 8, 9, 10, 13, 14, 19]), Candidate: [ 2  0  1  1  1  0  2  0  1  1 -1  1  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0  0 -1  1  0 -1  0  0  0  1 -1  1  0] (Indices: [0, 1, 4, 5, 7, 8, 9, 11, 12, 17, 19]), Candidate: [2 0 1 1 1 0 2 0 1 0 1 1 0 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 39050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0  0 -1  0  1  0 -1  0  0  1 -1  1  0] (Indices: [0, 1, 4, 5, 7, 8, 9, 12, 13, 17, 19]), Candidate: [2 0 1 1 1 0 2 0 1 0 0 2 1 0 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 39100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0  0 -1  0  0  0  1 -1  1 -1  1  0  0] (Indices: [0, 1, 4, 5, 7, 8, 9, 14, 16, 18, 19]), Candidate: [ 2  0  1  1  1  0  2  0  1  0  0  1  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0 -1  1  0 -1  0  1 -1  0  1  0 -1  1] (Indices: [0, 1, 4, 5, 7, 8, 10, 11, 14, 17, 18]), Candidate: [ 2  0  1  1  1  0  2  0  0  2  0  0  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0 -1  1 -1  0  1  0  0 -1  0  1 -1  1] (Indices: [0, 1, 4, 5, 7, 8, 10, 13, 14, 15, 18]), Candidate: [ 2  0  1  1  1  0  2  0  0  2 -1  1  2  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0 -1  0  1  0 -1  1  0 -1  0  1 -1  1] (Indices: [0, 1, 4, 5, 7, 8, 11, 12, 14, 15, 18]), Candidate: [2 0 1 1 1 0 2 0 0 1 1 1 0 2 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 39300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0 -1  0  1 -1  0  0  1  0 -1  1  0  0] (Indices: [0, 1, 4, 5, 7, 8, 11, 15, 16, 18, 19]), Candidate: [2 0 1 1 1 0 2 0 0 1 1 0 1 1 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 39350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0 -1  0  0  0  1 -1  1  0 -1  1  0  0] (Indices: [0, 1, 4, 5, 7, 8, 13, 15, 16, 18, 19]), Candidate: [2 0 1 1 1 0 2 0 0 1 0 1 2 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 39400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  1  0  0 -1  0  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 4, 5, 7, 9, 10, 11, 14, 16, 18]), Candidate: [ 2  0  1  1  1  0  2 -1  2  1  0  0  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  1  0 -1  0  1  0  0  0 -1  0  0  1] (Indices: [0, 1, 4, 5, 7, 9, 10, 13, 14, 15, 16]), Candidate: [ 2  0  1  1  1  0  2 -1  2  1 -1  1  2  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  1 -1  1  0 -1  1  0  0 -1  0  0  1] (Indices: [0, 1, 4, 5, 7, 9, 11, 12, 14, 15, 16]), Candidate: [ 2  0  1  1  1  0  2 -1  2  0  1  1  0  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  1 -1  1 -1  0  0  1  0  0  0 -1  1] (Indices: [0, 1, 4, 5, 7, 9, 11, 15, 16, 17, 18]), Candidate: [ 2  0  1  1  1  0  2 -1  2  0  1  0  1  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  1 -1  0  0  1 -1  1  0  0  0 -1  1] (Indices: [0, 1, 4, 5, 7, 9, 13, 15, 16, 17, 18]), Candidate: [ 2  0  1  1  1  0  2 -1  2  0  0  1  2  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  0  1  0 -1  1  0 -1  1  0 -1  0  1] (Indices: [0, 1, 4, 5, 7, 10, 11, 13, 14, 16, 17]), Candidate: [ 2  0  1  1  1  0  2 -1  1  2  0  0  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  0  1 -1  1  0 -1  0  0  1  0  0  0] (Indices: [0, 1, 4, 5, 7, 10, 12, 13, 17, 18, 19]), Candidate: [ 2  0  1  1  1  0  2 -1  1  2 -1  2  1  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  0  0  1  0  0 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 4, 5, 7, 11, 12, 13, 15, 17, 18]), Candidate: [ 2  0  1  1  1  0  2 -1  1  1  1  1  1  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  0  0  0  1  0  0 -1  1  0 -1  1  0] (Indices: [0, 1, 4, 5, 7, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  0  1  1  1  0  2 -1  1  1  0  2  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1  0  0  0 -1  1 -1  1 -1  0  0  1  0] (Indices: [0, 1, 4, 5, 8, 9, 10, 11, 13, 15, 19]), Candidate: [2 0 1 1 1 0 1 1 1 1 0 0 2 0 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 39900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1  0  0 -1  1 -1  1 -1  0  1 -1  1  0] (Indices: [0, 1, 4, 5, 8, 9, 10, 12, 14, 17, 19]), Candidate: [ 2  0  1  1  1  0  1  1  1  1 -1  2  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1  0 -1  1  0  0  0 -1  0  0  1 -1  1] (Indices: [0, 1, 4, 5, 8, 9, 11, 12, 13, 14, 18]), Candidate: [ 2  0  1  1  1  0  1  1  1  0  1  1  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1  0 -1  1 -1  1 -1  0  1 -1  1  0  0] (Indices: [0, 1, 4, 5, 8, 9, 11, 13, 16, 18, 19]), Candidate: [2 0 1 1 1 0 1 1 1 0 1 0 2 0 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 40050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1  0 -1  0  1 -1  0  1 -1  1  0  0  0] (Indices: [0, 1, 4, 5, 8, 9, 12, 15, 17, 18, 19]), Candidate: [2 0 1 1 1 0 1 1 1 0 0 2 0 1 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 40100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1 -1  1  0  0 -1  0  1  0 -1  0  1  0] (Indices: [0, 1, 4, 5, 8, 10, 11, 12, 15, 16, 19]), Candidate: [2 0 1 1 1 0 1 1 0 2 0 1 0 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 40150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1 -1  1 -1  1  0  0 -1  0  1  0 -1  1] (Indices: [0, 1, 4, 5, 8, 10, 12, 13, 14, 17, 18]), Candidate: [ 2  0  1  1  1  0  1  1  0  2 -1  2  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 40200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1 -1  0  1  0  0  0  0 -1  1 -1  0  1] (Indices: [0, 1, 4, 5, 8, 11, 12, 13, 14, 15, 17]), Candidate: [2 0 1 1 1 0 1 1 0 1 1 1 1 1 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 40250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1 -1  0  1 -1  0  1  0  0  0 -1  1  0] (Indices: [0, 1, 4, 5, 8, 11, 14, 15, 16, 17, 19]), Candidate: [2 0 1 1 1 0 1 1 0 1 1 0 1 2 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 40300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  1  0  0  0 -1  1  0 -1  0  1 -1  1] (Indices: [0, 1, 4, 5, 9, 10, 11, 12, 14, 15, 18]), Candidate: [2 0 1 1 1 0 1 0 2 1 0 1 0 2 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 40350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  1  0  0 -1  0  0  1  0 -1  1  0  0] (Indices: [0, 1, 4, 5, 9, 10, 11, 15, 16, 18, 19]), Candidate: [2 0 1 1 1 0 1 0 2 1 0 0 1 1 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 40400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  1  0 -1  0  1 -1  1  0 -1  1  0  0] (Indices: [0, 1, 4, 5, 9, 10, 13, 15, 16, 18, 19]), Candidate: [ 2  0  1  1  1  0  1  0  2  1 -1  1  2  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  1 -1  1 -1  1  0 -1  1  0  0 -1  1] (Indices: [0, 1, 4, 5, 9, 11, 13, 14, 16, 17, 18]), Candidate: [ 2  0  1  1  1  0  1  0  2  0  1  0  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  0  1  0  0  0  0 -1  0  1  0 -1  1] (Indices: [0, 1, 4, 5, 10, 11, 12, 13, 14, 17, 18]), Candidate: [ 2  0  1  1  1  0  1  0  1  2  0  1  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  0  1 -1  1  0  0  0  0 -1  1 -1  1] (Indices: [0, 1, 4, 5, 10, 12, 13, 14, 15, 16, 18]), Candidate: [ 2  0  1  1  1  0  1  0  1  2 -1  2  1  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  0  0  1 -1  1  0  0  0 -1  1  0  0] (Indices: [0, 1, 4, 5, 11, 13, 14, 15, 16, 18, 19]), Candidate: [2 0 1 1 1 0 1 0 1 1 1 0 2 1 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 40650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0  0  0 -1  1 -1  1 -1  0  0  1 -1  1] (Indices: [0, 1, 4, 6, 7, 8, 9, 10, 12, 14, 18]), Candidate: [ 2  0  1  1  0  2  1  0  1  1 -1  2  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 40700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0  0 -1  1  0  0 -1  0  0  1 -1  0  1] (Indices: [0, 1, 4, 6, 7, 8, 9, 11, 12, 13, 17]), Candidate: [2 0 1 1 0 2 1 0 1 0 1 1 1 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 40750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0  0 -1  1 -1  0  0  0  1  0 -1  1  0] (Indices: [0, 1, 4, 6, 7, 8, 9, 11, 16, 17, 19]), Candidate: [2 0 1 1 0 2 1 0 1 0 1 0 1 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 40800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0  0 -1  0  0  1 -1  1  0 -1  0  1  0] (Indices: [0, 1, 4, 6, 7, 8, 9, 13, 15, 16, 19]), Candidate: [2 0 1 1 0 2 1 0 1 0 0 1 2 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 40850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0 -1  1  0 -1  1 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 4, 6, 7, 8, 10, 11, 13, 15, 17]), Candidate: [2 0 1 1 0 2 1 0 0 2 0 0 2 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 40900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0 -1  1 -1  1 -1  1 -1  1 -1  0  1  0] (Indices: [0, 1, 4, 6, 7, 8, 10, 12, 14, 16, 19]), Candidate: [ 2  0  1  1  0  2  1  0  0  2 -1  2  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 40950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0 -1  0  1  0  0  0 -1  1 -1  0  0  1] (Indices: [0, 1, 4, 6, 7, 8, 11, 12, 13, 14, 16]), Candidate: [ 2  0  1  1  0  2  1  0  0  1  1  1  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0 -1  0  1 -1  1 -1  0  1  0  0 -1  1] (Indices: [0, 1, 4, 6, 7, 8, 11, 13, 16, 17, 18]), Candidate: [2 0 1 1 0 2 1 0 0 1 1 0 2 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 41050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0 -1  0  0  1 -1  0  1  0  0 -1  1  0] (Indices: [0, 1, 4, 6, 7, 8, 12, 15, 16, 17, 19]), Candidate: [2 0 1 1 0 2 1 0 0 1 0 2 0 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 41100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  1  0  0 -1  1  0 -1  0  0  0  1  0] (Indices: [0, 1, 4, 6, 7, 9, 10, 11, 13, 14, 19]), Candidate: [ 2  0  1  1  0  2  1 -1  2  1  0  0  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 41150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  1  0 -1  1 -1  1 -1  1  0 -1  0  1] (Indices: [0, 1, 4, 6, 7, 9, 10, 12, 14, 16, 17]), Candidate: [ 2  0  1  1  0  2  1 -1  2  1 -1  2  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 41200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  1  0 -1  0  0  0  0  1  0  0  0  0] (Indices: [0, 1, 4, 6, 7, 9, 10, 16, 17, 18, 19]), Candidate: [ 2  0  1  1  0  2  1 -1  2  1 -1  1  1  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 41250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  1 -1  1 -1  1 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 4, 6, 7, 9, 11, 13, 15, 17, 19]), Candidate: [ 2  0  1  1  0  2  1 -1  2  0  1  0  2  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  1 -1  0  1 -1  1 -1  0  1  0  0  0] (Indices: [0, 1, 4, 6, 7, 9, 12, 14, 17, 18, 19]), Candidate: [ 2  0  1  1  0  2  1 -1  2  0  0  2  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 41350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  0  1  0  0 -1  1 -1  0  1 -1  1  0] (Indices: [0, 1, 4, 6, 7, 10, 11, 12, 14, 17, 19]), Candidate: [ 2  0  1  1  0  2  1 -1  1  2  0  1  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 41400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  0  1 -1  1  0  0  0 -1  0  0  1  0] (Indices: [0, 1, 4, 6, 7, 10, 12, 13, 14, 15, 19]), Candidate: [ 2  0  1  1  0  2  1 -1  1  2 -1  2  1  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 41450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  0  1 -1  0  0  1  0 -1  1  0  0  0] (Indices: [0, 1, 4, 6, 7, 10, 14, 15, 17, 18, 19]), Candidate: [ 2  0  1  1  0  2  1 -1  1  2 -1  1  1  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 41500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  0  0  1 -1  1 -1  1  0 -1  1  0  0] (Indices: [0, 1, 4, 6, 7, 11, 13, 15, 16, 18, 19]), Candidate: [ 2  0  1  1  0  2  1 -1  1  1  1  0  2  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1  0  0  0  0 -1  0  1 -1  0  1 -1  1] (Indices: [0, 1, 4, 6, 8, 9, 10, 11, 12, 15, 18]), Candidate: [2 0 1 1 0 2 0 1 1 1 0 1 0 1 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 41600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1  0  0 -1  1  0 -1  1 -1  0  1 -1  1] (Indices: [0, 1, 4, 6, 8, 9, 10, 12, 13, 15, 18]), Candidate: [ 2  0  1  1  0  2  0  1  1  1 -1  2  1  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1  0  0 -1  0  0  1  0  0 -1  0  1  0] (Indices: [0, 1, 4, 6, 8, 9, 10, 14, 15, 16, 19]), Candidate: [ 2  0  1  1  0  2  0  1  1  1 -1  1  1  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1  0 -1  1 -1  1  0  0 -1  0  1 -1  1] (Indices: [0, 1, 4, 6, 8, 9, 11, 13, 14, 15, 18]), Candidate: [2 0 1 1 0 2 0 1 1 0 1 0 2 1 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 41750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1  0 -1  0  1  0 -1  0  1  0 -1  1  0] (Indices: [0, 1, 4, 6, 8, 9, 12, 13, 16, 17, 19]), Candidate: [2 0 1 1 0 2 0 1 1 0 0 2 1 0 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 41800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1 -1  1  0  0  0 -1  0  1 -1  0  1  0] (Indices: [0, 1, 4, 6, 8, 10, 11, 12, 13, 16, 19]), Candidate: [2 0 1 1 0 2 0 1 0 2 0 1 1 0 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 41850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1 -1  1  0 -1  0  1 -1  1  0  0 -1  1] (Indices: [0, 1, 4, 6, 8, 10, 11, 14, 16, 17, 18]), Candidate: [ 2  0  1  1  0  2  0  1  0  2  0  0  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1 -1  1 -1  0  1  0 -1  1  0  0 -1  1] (Indices: [0, 1, 4, 6, 8, 10, 13, 14, 16, 17, 18]), Candidate: [ 2  0  1  1  0  2  0  1  0  2 -1  1  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 41950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1 -1  0  1 -1  1  0  0  0  0 -1  0  1] (Indices: [0, 1, 4, 6, 8, 11, 13, 14, 15, 16, 17]), Candidate: [2 0 1 1 0 2 0 1 0 1 1 0 2 1 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 42000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  1  0  0  0  0  0 -1  1 -1  0  0  1] (Indices: [0, 1, 4, 6, 9, 10, 11, 12, 13, 14, 16]), Candidate: [ 2  0  1  1  0  2  0  0  2  1  0  1  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  1  0  0 -1  1 -1  0  1  0  0 -1  1] (Indices: [0, 1, 4, 6, 9, 10, 11, 13, 16, 17, 18]), Candidate: [2 0 1 1 0 2 0 0 2 1 0 0 2 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 42100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  1  0 -1  1 -1  0  1  0  0 -1  1  0] (Indices: [0, 1, 4, 6, 9, 10, 12, 15, 16, 17, 19]), Candidate: [ 2  0  1  1  0  2  0  0  2  1 -1  2  0  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  1 -1  1  0 -1  1  0 -1  0  1  0  0] (Indices: [0, 1, 4, 6, 9, 11, 12, 14, 15, 18, 19]), Candidate: [2 0 1 1 0 2 0 0 2 0 1 1 0 2 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 42200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  1 -1  0  1 -1  1 -1  1  0  0  0  0] (Indices: [0, 1, 4, 6, 9, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  0  1  1  0  2  0  0  2  0  0  2  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  0  1  0 -1  1  0 -1  1  0  0 -1  1] (Indices: [0, 1, 4, 6, 10, 11, 13, 14, 16, 17, 18]), Candidate: [ 2  0  1  1  0  2  0  0  1  2  0  0  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  0  0  1  0  0  0 -1  1  0 -1  1  0] (Indices: [0, 1, 4, 6, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  0  1  1  0  2  0  0  1  1  1  1  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0  0  0  0 -1  1  0  0 -1  0  0  0  1] (Indices: [0, 1, 4, 7, 8, 9, 10, 11, 13, 14, 15]), Candidate: [2 0 1 1 0 1 2 0 1 1 0 0 2 1 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 42400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0  0  0 -1  1 -1  1  0  0 -1  0  0  1] (Indices: [0, 1, 4, 7, 8, 9, 10, 12, 14, 15, 16]), Candidate: [ 2  0  1  1  0  1  2  0  1  1 -1  2  0  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0  0  0 -1  0  0  0  1  0  0  0 -1  1] (Indices: [0, 1, 4, 7, 8, 9, 10, 15, 16, 17, 18]), Candidate: [ 2  0  1  1  0  1  2  0  1  1 -1  1  1  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0  0 -1  1 -1  1 -1  1  0  0 -1  0  1] (Indices: [0, 1, 4, 7, 8, 9, 11, 13, 15, 16, 17]), Candidate: [2 0 1 1 0 1 2 0 1 0 1 0 2 0 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 42550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0  0 -1  0  1 -1  1  0 -1  0  1  0  0] (Indices: [0, 1, 4, 7, 8, 9, 12, 14, 15, 18, 19]), Candidate: [2 0 1 1 0 1 2 0 1 0 0 2 0 2 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 42600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0 -1  1  0  0 -1  1 -1  1  0 -1  0  1] (Indices: [0, 1, 4, 7, 8, 10, 11, 12, 14, 16, 17]), Candidate: [ 2  0  1  1  0  1  2  0  0  2  0  1  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0 -1  1  0 -1  0  0  0  1  0  0  0  0] (Indices: [0, 1, 4, 7, 8, 10, 11, 16, 17, 18, 19]), Candidate: [2 0 1 1 0 1 2 0 0 2 0 0 1 1 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 42700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0 -1  1 -1  0  1 -1  0  1  0  0  0  0] (Indices: [0, 1, 4, 7, 8, 10, 13, 16, 17, 18, 19]), Candidate: [ 2  0  1  1  0  1  2  0  0  2 -1  1  2  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0 -1  0  1 -1  1  0 -1  1 -1  1  0  0] (Indices: [0, 1, 4, 7, 8, 11, 13, 14, 16, 18, 19]), Candidate: [ 2  0  1  1  0  1  2  0  0  1  1  0  2  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  1  0  0  0  0 -1  0  1  0 -1  0  1] (Indices: [0, 1, 4, 7, 9, 10, 11, 12, 13, 16, 17]), Candidate: [ 2  0  1  1  0  1  2 -1  2  1  0  1  1  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  1  0  0 -1  0  1  0 -1  1 -1  1  0] (Indices: [0, 1, 4, 7, 9, 10, 11, 14, 15, 17, 19]), Candidate: [ 2  0  1  1  0  1  2 -1  2  1  0  0  1  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  1  0 -1  0  1  0  0 -1  1 -1  1  0] (Indices: [0, 1, 4, 7, 9, 10, 13, 14, 15, 17, 19]), Candidate: [ 2  0  1  1  0  1  2 -1  2  1 -1  1  2  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 42950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  1 -1  1  0 -1  0  1 -1  1  0  0  0] (Indices: [0, 1, 4, 7, 9, 11, 12, 15, 17, 18, 19]), Candidate: [ 2  0  1  1  0  1  2 -1  2  0  1  1  0  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  1 -1  0  0  0  1  0  0  0  0  0  0] (Indices: [0, 1, 4, 7, 9, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  0  1  1  0  1  2 -1  2  0  0  1  1  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  0  1  0 -1  1 -1  0  1  0  0  0  0] (Indices: [0, 1, 4, 7, 10, 11, 13, 16, 17, 18, 19]), Candidate: [ 2  0  1  1  0  1  2 -1  1  2  0  0  2  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  0  0  1  0 -1  1  0  0  0  0 -1  1] (Indices: [0, 1, 4, 7, 11, 12, 14, 15, 16, 17, 18]), Candidate: [ 2  0  1  1  0  1  2 -1  1  1  1  1  0  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1  0  0  0  0 -1  0  1 -1  1 -1  1  0] (Indices: [0, 1, 4, 8, 9, 10, 11, 12, 15, 17, 19]), Candidate: [2 0 1 1 0 1 1 1 1 1 0 1 0 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 43200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1  0  0 -1  1  0  0 -1  0  0  1  0  0] (Indices: [0, 1, 4, 8, 9, 10, 12, 13, 14, 18, 19]), Candidate: [ 2  0  1  1  0  1  1  1  1  1 -1  2  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 43250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1  0 -1  1  0  0  0  0 -1  0  0  1  0] (Indices: [0, 1, 4, 8, 9, 11, 12, 13, 14, 15, 19]), Candidate: [2 0 1 1 0 1 1 1 1 0 1 1 1 1 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 43300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1  0 -1  1 -1  0  1  0 -1  1  0  0  0] (Indices: [0, 1, 4, 8, 9, 11, 14, 15, 17, 18, 19]), Candidate: [2 0 1 1 0 1 1 1 1 0 1 0 1 2 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 43350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1 -1  1  0  0  0 -1  0  0  1  0  0  0] (Indices: [0, 1, 4, 8, 10, 11, 12, 13, 17, 18, 19]), Candidate: [2 0 1 1 0 1 1 1 0 2 0 1 1 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 43400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1 -1  1 -1  1  0 -1  1 -1  1  0  0  0] (Indices: [0, 1, 4, 8, 10, 12, 13, 15, 17, 18, 19]), Candidate: [ 2  0  1  1  0  1  1  1  0  2 -1  2  1  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1 -1  0  0  0  1  0  0  0  0  0  0  0] (Indices: [0, 1, 4, 8, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 0 1 1 0 1 1 1 0 1 0 1 2 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 43500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  1  0  0 -1  1 -1  0  1  0  0  0  0] (Indices: [0, 1, 4, 9, 10, 11, 13, 16, 17, 18, 19]), Candidate: [2 0 1 1 0 1 1 0 2 1 0 0 2 0 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 43550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  1 -1  1  0 -1  1  0  0  0  0 -1  1] (Indices: [0, 1, 4, 9, 11, 12, 14, 15, 16, 17, 18]), Candidate: [2 0 1 1 0 1 1 0 2 0 1 1 0 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 43600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  0  1 -1  1  0  0  0  0  0 -1  1  0] (Indices: [0, 1, 4, 10, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  0  1  1  0  1  1  0  1  2 -1  2  1  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0  0  0 -1  1 -1  1  0 -1  0  0  0  1] (Indices: [0, 1, 5, 6, 7, 8, 9, 10, 12, 14, 15]), Candidate: [ 2  0  1  0  2  1  1  0  1  1 -1  2  0  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0  0 -1  1  0  0  0 -1  0  0  0  0  1] (Indices: [0, 1, 5, 6, 7, 8, 9, 11, 12, 13, 14]), Candidate: [ 2  0  1  0  2  1  1  0  1  0  1  1  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0  0 -1  1 -1  0  0  1 -1  1 -1  1  0] (Indices: [0, 1, 5, 6, 7, 8, 9, 11, 15, 17, 19]), Candidate: [2 0 1 0 2 1 1 0 1 0 1 0 1 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 43800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0  0 -1  0  0  1  0 -1  0  0  1  0  0] (Indices: [0, 1, 5, 6, 7, 8, 9, 13, 14, 18, 19]), Candidate: [ 2  0  1  0  2  1  1  0  1  0  0  1  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0 -1  1  0 -1  1  0 -1  0  0  1 -1  1] (Indices: [0, 1, 5, 6, 7, 8, 10, 11, 13, 14, 18]), Candidate: [ 2  0  1  0  2  1  1  0  0  2  0  0  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0 -1  1 -1  1 -1  1  0 -1  0  0  1  0] (Indices: [0, 1, 5, 6, 7, 8, 10, 12, 14, 15, 19]), Candidate: [ 2  0  1  0  2  1  1  0  0  2 -1  2  0  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0 -1  1 -1  0  0  0  1 -1  1  0  0  0] (Indices: [0, 1, 5, 6, 7, 8, 10, 15, 17, 18, 19]), Candidate: [ 2  0  1  0  2  1  1  0  0  2 -1  1  1  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0 -1  0  1 -1  1 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 5, 6, 7, 8, 11, 13, 15, 17, 18]), Candidate: [2 0 1 0 2 1 1 0 0 1 1 0 2 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 44050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0 -1  0  0  1 -1  1 -1  1 -1  1  0  0] (Indices: [0, 1, 5, 6, 7, 8, 12, 14, 16, 18, 19]), Candidate: [ 2  0  1  0  2  1  1  0  0  1  0  2  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  1  0  0 -1  1  0 -1  1 -1  0  0  1] (Indices: [0, 1, 5, 6, 7, 9, 10, 11, 13, 14, 16]), Candidate: [ 2  0  1  0  2  1  1 -1  2  1  0  0  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 44150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  1  0 -1  1 -1  1  0 -1  1 -1  0  1] (Indices: [0, 1, 5, 6, 7, 9, 10, 12, 14, 15, 17]), Candidate: [ 2  0  1  0  2  1  1 -1  2  1 -1  2  0  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 44200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  1  0 -1  0  0  0  1  0  0 -1  1  0] (Indices: [0, 1, 5, 6, 7, 9, 10, 15, 16, 17, 19]), Candidate: [ 2  0  1  0  2  1  1 -1  2  1 -1  1  1  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 44250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  1 -1  1 -1  1 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 5, 6, 7, 9, 11, 13, 15, 16, 18]), Candidate: [ 2  0  1  0  2  1  1 -1  2  0  1  0  2  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  1 -1  0  1 -1  1 -1  1  0  0 -1  1] (Indices: [0, 1, 5, 6, 7, 9, 12, 14, 16, 17, 18]), Candidate: [ 2  0  1  0  2  1  1 -1  2  0  0  2  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 44350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  0  1  0  0 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 5, 6, 7, 10, 11, 12, 14, 16, 18]), Candidate: [ 2  0  1  0  2  1  1 -1  1  2  0  1  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 44400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  0  1 -1  1  0  0  0  0 -1  0  0  1] (Indices: [0, 1, 5, 6, 7, 10, 12, 13, 14, 15, 16]), Candidate: [ 2  0  1  0  2  1  1 -1  1  2 -1  2  1  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 44450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  0  1 -1  0  0  1  0  0  0  0 -1  1] (Indices: [0, 1, 5, 6, 7, 10, 14, 15, 16, 17, 18]), Candidate: [ 2  0  1  0  2  1  1 -1  1  2 -1  1  1  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 44500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  0  0  1 -1  1  0 -1  0  1  0  0  0] (Indices: [0, 1, 5, 6, 7, 11, 13, 14, 17, 18, 19]), Candidate: [ 2  0  1  0  2  1  1 -1  1  1  1  0  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 44550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1  0  0  0  0 -1  1 -1  0  0  0  1  0] (Indices: [0, 1, 5, 6, 8, 9, 10, 11, 12, 14, 19]), Candidate: [ 2  0  1  0  2  1  0  1  1  1  0  1  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1  0  0 -1  1  0  0 -1  0  0  0  1  0] (Indices: [0, 1, 5, 6, 8, 9, 10, 12, 13, 14, 19]), Candidate: [ 2  0  1  0  2  1  0  1  1  1 -1  2  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 44650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1  0  0 -1  0  1 -1  0  0  1  0  0  0] (Indices: [0, 1, 5, 6, 8, 9, 10, 13, 17, 18, 19]), Candidate: [ 2  0  1  0  2  1  0  1  1  1 -1  1  2  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1  0 -1  1  0 -1  0  0  0  1  0  0  0] (Indices: [0, 1, 5, 6, 8, 9, 11, 12, 17, 18, 19]), Candidate: [2 0 1 0 2 1 0 1 1 0 1 1 0 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 44750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1  0 -1  0  1  0 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 5, 6, 8, 9, 12, 13, 15, 17, 19]), Candidate: [2 0 1 0 2 1 0 1 1 0 0 2 1 0 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 44800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1 -1  1  0  0  0 -1  1 -1  0  0  1  0] (Indices: [0, 1, 5, 6, 8, 10, 11, 12, 13, 15, 19]), Candidate: [2 0 1 0 2 1 0 1 0 2 0 1 1 0 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 44850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1 -1  1  0 -1  0  1  0 -1  1  0 -1  1] (Indices: [0, 1, 5, 6, 8, 10, 11, 14, 15, 17, 18]), Candidate: [2 0 1 0 2 1 0 1 0 2 0 0 1 2 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 44900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1 -1  1 -1  0  1  0  0 -1  1  0 -1  1] (Indices: [0, 1, 5, 6, 8, 10, 13, 14, 15, 17, 18]), Candidate: [ 2  0  1  0  2  1  0  1  0  2 -1  1  2  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1 -1  0  1  0 -1  0  1  0 -1  1  0  0] (Indices: [0, 1, 5, 6, 8, 11, 12, 15, 16, 18, 19]), Candidate: [2 0 1 0 2 1 0 1 0 1 1 1 0 1 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 45000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1 -1  0  0  0  1 -1  1  0  0  0  0  0] (Indices: [0, 1, 5, 6, 8, 13, 15, 16, 17, 18, 19]), Candidate: [2 0 1 0 2 1 0 1 0 1 0 1 2 0 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 45050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  1  0  0 -1  1 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 5, 6, 9, 10, 11, 13, 15, 17, 18]), Candidate: [2 0 1 0 2 1 0 0 2 1 0 0 2 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 45100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  1  0 -1  1 -1  1 -1  1 -1  1  0  0] (Indices: [0, 1, 5, 6, 9, 10, 12, 14, 16, 18, 19]), Candidate: [ 2  0  1  0  2  1  0  0  2  1 -1  2  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 45150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  1 -1  1  0 -1  1  0  0 -1  0  1  0] (Indices: [0, 1, 5, 6, 9, 11, 12, 14, 15, 16, 19]), Candidate: [2 0 1 0 2 1 0 0 2 0 1 1 0 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 45200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  1 -1  0  1 -1  1  0  0  0 -1  1  0] (Indices: [0, 1, 5, 6, 9, 12, 14, 15, 16, 17, 19]), Candidate: [2 0 1 0 2 1 0 0 2 0 0 2 0 2 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 45250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  0  1  0 -1  1  0  0 -1  1  0 -1  1] (Indices: [0, 1, 5, 6, 10, 11, 13, 14, 15, 17, 18]), Candidate: [2 0 1 0 2 1 0 0 1 2 0 0 2 1 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 45300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  0  0  1  0  0  0  0 -1  1 -1  1  0] (Indices: [0, 1, 5, 6, 11, 12, 13, 14, 15, 17, 19]), Candidate: [2 0 1 0 2 1 0 0 1 1 1 1 1 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 45350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0  0  0  0  0 -1  0  0  0  1  0 -1  1] (Indices: [0, 1, 5, 7, 8, 9, 10, 11, 12, 17, 18]), Candidate: [2 0 1 0 2 0 2 0 1 1 0 1 0 1 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 45400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0  0  0 -1  1  0 -1  0  0  1  0 -1  1] (Indices: [0, 1, 5, 7, 8, 9, 10, 12, 13, 17, 18]), Candidate: [ 2  0  1  0  2  0  2  0  1  1 -1  2  1  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0  0  0 -1  0  0  1 -1  1  0 -1  1  0] (Indices: [0, 1, 5, 7, 8, 9, 10, 14, 16, 17, 19]), Candidate: [ 2  0  1  0  2  0  2  0  1  1 -1  1  1  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 45500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0  0 -1  1 -1  1  0 -1  0  1  0 -1  1] (Indices: [0, 1, 5, 7, 8, 9, 11, 13, 14, 17, 18]), Candidate: [ 2  0  1  0  2  0  2  0  1  0  1  0  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0  0 -1  0  1 -1  1  0  0 -1  0  1  0] (Indices: [0, 1, 5, 7, 8, 9, 12, 14, 15, 16, 19]), Candidate: [2 0 1 0 2 0 2 0 1 0 0 2 0 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 45600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0 -1  1  0  0 -1  1  0 -1  1 -1  0  1] (Indices: [0, 1, 5, 7, 8, 10, 11, 12, 14, 15, 17]), Candidate: [2 0 1 0 2 0 2 0 0 2 0 1 0 2 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 45650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0 -1  1  0 -1  0  0  1  0  0 -1  1  0] (Indices: [0, 1, 5, 7, 8, 10, 11, 15, 16, 17, 19]), Candidate: [2 0 1 0 2 0 2 0 0 2 0 0 1 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 45700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0 -1  1 -1  0  1 -1  1  0  0 -1  1  0] (Indices: [0, 1, 5, 7, 8, 10, 13, 15, 16, 17, 19]), Candidate: [ 2  0  1  0  2  0  2  0  0  2 -1  1  2  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0 -1  0  1 -1  1  0  0 -1  0  1  0  0] (Indices: [0, 1, 5, 7, 8, 11, 13, 14, 15, 18, 19]), Candidate: [2 0 1 0 2 0 2 0 0 1 1 0 2 1 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 45800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  1  0  0  0  0 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 5, 7, 9, 10, 11, 12, 13, 15, 17]), Candidate: [ 2  0  1  0  2  0  2 -1  2  1  0  1  1  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  1  0  0 -1  0  1  0  0 -1  1 -1  1] (Indices: [0, 1, 5, 7, 9, 10, 11, 14, 15, 16, 18]), Candidate: [ 2  0  1  0  2  0  2 -1  2  1  0  0  1  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  1  0 -1  0  1  0  0  0 -1  1 -1  1] (Indices: [0, 1, 5, 7, 9, 10, 13, 14, 15, 16, 18]), Candidate: [ 2  0  1  0  2  0  2 -1  2  1 -1  1  2  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 45950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  1 -1  1  0 -1  0  1  0  0  0 -1  1] (Indices: [0, 1, 5, 7, 9, 11, 12, 15, 16, 17, 18]), Candidate: [ 2  0  1  0  2  0  2 -1  2  0  1  1  0  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  1 -1  0  0  1  0  0 -1  1  0  0  0] (Indices: [0, 1, 5, 7, 9, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  0  1  0  2  0  2 -1  2  0  0  1  2  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  0  1  0 -1  1 -1  1  0  0 -1  1  0] (Indices: [0, 1, 5, 7, 10, 11, 13, 15, 16, 17, 19]), Candidate: [ 2  0  1  0  2  0  2 -1  1  2  0  0  2  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  0  0  1  0  0 -1  1  0 -1  1  0  0] (Indices: [0, 1, 5, 7, 11, 12, 13, 15, 16, 18, 19]), Candidate: [ 2  0  1  0  2  0  2 -1  1  1  1  1  1  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1  0  0  0  0 -1  0  1  0 -1  1 -1  1] (Indices: [0, 1, 5, 8, 9, 10, 11, 12, 15, 16, 18]), Candidate: [2 0 1 0 2 0 1 1 1 1 0 1 0 1 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 46200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1  0  0 -1  1  0  0 -1  1 -1  0  1  0] (Indices: [0, 1, 5, 8, 9, 10, 12, 13, 14, 16, 19]), Candidate: [ 2  0  1  0  2  0  1  1  1  1 -1  2  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 46250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1  0 -1  1  0  0  0  0  0 -1  0  0  1] (Indices: [0, 1, 5, 8, 9, 11, 12, 13, 14, 15, 16]), Candidate: [2 0 1 0 2 0 1 1 1 0 1 1 1 1 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 46300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1  0 -1  1 -1  0  1  0  0  0  0 -1  1] (Indices: [0, 1, 5, 8, 9, 11, 14, 15, 16, 17, 18]), Candidate: [2 0 1 0 2 0 1 1 1 0 1 0 1 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 46350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1 -1  1  0  0  0 -1  0  1  0  0 -1  1] (Indices: [0, 1, 5, 8, 10, 11, 12, 13, 16, 17, 18]), Candidate: [2 0 1 0 2 0 1 1 0 2 0 1 1 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 46400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1 -1  1 -1  1  0 -1  1  0  0  0 -1  1] (Indices: [0, 1, 5, 8, 10, 12, 13, 15, 16, 17, 18]), Candidate: [ 2  0  1  0  2  0  1  1  0  2 -1  2  1  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1 -1  0  0  1  0  0 -1  1  0  0  0  0] (Indices: [0, 1, 5, 8, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  0  1  0  2  0  1  1  0  1  0  2  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  1  0  0 -1  1 -1  1  0  0 -1  1  0] (Indices: [0, 1, 5, 9, 10, 11, 13, 15, 16, 17, 19]), Candidate: [2 0 1 0 2 0 1 0 2 1 0 0 2 0 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 46550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  1 -1  1  0  0 -1  1  0 -1  1  0  0] (Indices: [0, 1, 5, 9, 11, 12, 13, 15, 16, 18, 19]), Candidate: [2 0 1 0 2 0 1 0 2 0 1 1 1 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 46600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  0  1  0 -1  1 -1  1  0  0  0  0  0] (Indices: [0, 1, 5, 10, 11, 13, 15, 16, 17, 18, 19]), Candidate: [2 0 1 0 2 0 1 0 1 2 0 0 2 0 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 46650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0  0  0  0 -1  1 -1  0  1 -1  1 -1  1] (Indices: [0, 1, 6, 7, 8, 9, 10, 11, 13, 16, 18]), Candidate: [2 0 1 0 1 2 1 0 1 1 0 0 2 0 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 46700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0  0  0 -1  1 -1  0  1  0  0 -1  0  1] (Indices: [0, 1, 6, 7, 8, 9, 10, 12, 15, 16, 17]), Candidate: [ 2  0  1  0  1  2  1  0  1  1 -1  2  0  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0  0 -1  1  0  0 -1  1  0 -1  0  0  1] (Indices: [0, 1, 6, 7, 8, 9, 11, 12, 13, 15, 16]), Candidate: [2 0 1 0 1 2 1 0 1 0 1 1 1 0 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 46800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0  0 -1  1 -1  0  1  0  0  0 -1  0  1] (Indices: [0, 1, 6, 7, 8, 9, 11, 14, 15, 16, 17]), Candidate: [2 0 1 0 1 2 1 0 1 0 1 0 1 2 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 46850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0  0 -1  0  0  1  0  0  0  0 -1  0  1] (Indices: [0, 1, 6, 7, 8, 9, 13, 14, 15, 16, 17]), Candidate: [2 0 1 0 1 2 1 0 1 0 0 1 2 1 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 46900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0 -1  1  0  0 -1  0  1 -1  1 -1  1  0] (Indices: [0, 1, 6, 7, 8, 10, 11, 12, 15, 17, 19]), Candidate: [2 0 1 0 1 2 1 0 0 2 0 1 0 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 46950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0 -1  1 -1  1  0  0 -1  0  0  1  0  0] (Indices: [0, 1, 6, 7, 8, 10, 12, 13, 14, 18, 19]), Candidate: [ 2  0  1  0  1  2  1  0  0  2 -1  2  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 47000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0 -1  0  1  0  0  0  0 -1  0  0  1  0] (Indices: [0, 1, 6, 7, 8, 11, 12, 13, 14, 15, 19]), Candidate: [2 0 1 0 1 2 1 0 0 1 1 1 1 1 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 47050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0 -1  0  1 -1  0  1  0 -1  1  0  0  0] (Indices: [0, 1, 6, 7, 8, 11, 14, 15, 17, 18, 19]), Candidate: [2 0 1 0 1 2 1 0 0 1 1 0 1 2 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 47100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  1  0  0  0 -1  1 -1  1  0 -1  0  1] (Indices: [0, 1, 6, 7, 9, 10, 11, 12, 14, 16, 17]), Candidate: [ 2  0  1  0  1  2  1 -1  2  1  0  1  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 47150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  1  0  0 -1  0  0  0  1  0  0  0  0] (Indices: [0, 1, 6, 7, 9, 10, 11, 16, 17, 18, 19]), Candidate: [ 2  0  1  0  1  2  1 -1  2  1  0  0  1  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  1  0 -1  0  1 -1  0  1  0  0  0  0] (Indices: [0, 1, 6, 7, 9, 10, 13, 16, 17, 18, 19]), Candidate: [ 2  0  1  0  1  2  1 -1  2  1 -1  1  2  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 47250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  1 -1  1 -1  1  0 -1  1 -1  1  0  0] (Indices: [0, 1, 6, 7, 9, 11, 13, 14, 16, 18, 19]), Candidate: [ 2  0  1  0  1  2  1 -1  2  0  1  0  2  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 47300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  0  1  0  0  0  0 -1  0  0  1  0  0] (Indices: [0, 1, 6, 7, 10, 11, 12, 13, 14, 18, 19]), Candidate: [ 2  0  1  0  1  2  1 -1  1  2  0  1  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 47350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  0  1 -1  1  0  0  0 -1  1  0 -1  1] (Indices: [0, 1, 6, 7, 10, 12, 13, 14, 15, 17, 18]), Candidate: [ 2  0  1  0  1  2  1 -1  1  2 -1  2  1  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 47400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  0  0  1 -1  1  0 -1  1  0  0  0  0] (Indices: [0, 1, 6, 7, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  0  1  0  1  2  1 -1  1  1  1  0  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 47450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1  0  0  0 -1  1  0 -1  1  0 -1  0  1] (Indices: [0, 1, 6, 8, 9, 10, 11, 13, 14, 16, 17]), Candidate: [ 2  0  1  0  1  2  0  1  1  1  0  0  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1  0  0 -1  1  0 -1  0  0  1  0  0  0] (Indices: [0, 1, 6, 8, 9, 10, 12, 13, 17, 18, 19]), Candidate: [ 2  0  1  0  1  2  0  1  1  1 -1  2  1  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1  0 -1  1  0  0 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 6, 8, 9, 11, 12, 13, 15, 17, 18]), Candidate: [2 0 1 0 1 2 0 1 1 0 1 1 1 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 47600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1  0 -1  0  1  0  0 -1  1  0 -1  1  0] (Indices: [0, 1, 6, 8, 9, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  0  1  0  1  2  0  1  1  0  0  2  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1 -1  1  0  0 -1  1 -1  0  1  0  0  0] (Indices: [0, 1, 6, 8, 10, 11, 12, 14, 17, 18, 19]), Candidate: [ 2  0  1  0  1  2  0  1  0  2  0  1  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1 -1  1 -1  0  1  0  0  0 -1  1  0  0] (Indices: [0, 1, 6, 8, 10, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  0  1  0  1  2  0  1  0  2 -1  1  2  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  1  0  0  0  0  0 -1  0  0  1  0  0] (Indices: [0, 1, 6, 9, 10, 11, 12, 13, 14, 18, 19]), Candidate: [ 2  0  1  0  1  2  0  0  2  1  0  1  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  1  0 -1  1  0  0  0 -1  1  0 -1  1] (Indices: [0, 1, 6, 9, 10, 12, 13, 14, 15, 17, 18]), Candidate: [ 2  0  1  0  1  2  0  0  2  1 -1  2  1  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  1 -1  1 -1  1  0 -1  1  0  0  0  0] (Indices: [0, 1, 6, 9, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  0  1  0  1  2  0  0  2  0  1  0  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  0  0  1  0  0  0  0 -1  1  0  0  0] (Indices: [0, 1, 6, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [2 0 1 0 1 2 0 0 1 1 1 1 1 1 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 47950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0  0  0  0 -1  1  0 -1  0  0  1  0  0] (Indices: [0, 1, 7, 8, 9, 10, 11, 13, 14, 18, 19]), Candidate: [ 2  0  1  0  1  1  2  0  1  1  0  0  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0  0  0 -1  1 -1  1  0 -1  1 -1  1  0] (Indices: [0, 1, 7, 8, 9, 10, 12, 14, 15, 17, 19]), Candidate: [ 2  0  1  0  1  1  2  0  1  1 -1  2  0  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0  0 -1  1  0  0 -1  0  1 -1  1  0  0] (Indices: [0, 1, 7, 8, 9, 11, 12, 13, 16, 18, 19]), Candidate: [2 0 1 0 1 1 2 0 1 0 1 1 1 0 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 48100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0  0 -1  0  1  0 -1  1  0 -1  1  0  0] (Indices: [0, 1, 7, 8, 9, 12, 13, 15, 16, 18, 19]), Candidate: [2 0 1 0 1 1 2 0 1 0 0 2 1 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 48150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0 -1  1  0  0 -1  0  0  1  0  0  0  0] (Indices: [0, 1, 7, 8, 10, 11, 12, 16, 17, 18, 19]), Candidate: [2 0 1 0 1 1 2 0 0 2 0 1 0 1 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 48200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0 -1  0  1  0  0  0  0  0  0 -1  0  1] (Indices: [0, 1, 7, 8, 11, 12, 13, 14, 15, 16, 17]), Candidate: [2 0 1 0 1 1 2 0 0 1 1 1 1 1 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 48250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  1  0  0  0  0 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 7, 9, 10, 11, 12, 13, 15, 17, 19]), Candidate: [ 2  0  1  0  1  1  2 -1  2  1  0  1  1  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  1  0 -1  1  0  0 -1  1 -1  1  0  0] (Indices: [0, 1, 7, 9, 10, 12, 13, 14, 16, 18, 19]), Candidate: [ 2  0  1  0  1  1  2 -1  2  1 -1  2  1  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 48350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  1 -1  0  1  0  0  0  0 -1  1  0  0] (Indices: [0, 1, 7, 9, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  0  1  0  1  1  2 -1  2  0  0  2  1  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  0  0  0  1  0  0  0  0  0  0  0  0] (Indices: [0, 1, 7, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  0  1  0  1  1  2 -1  1  1  0  2  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1  0  0  0 -1  1 -1  0  1  0  0  0  0] (Indices: [0, 1, 8, 9, 10, 11, 13, 16, 17, 18, 19]), Candidate: [2 0 1 0 1 1 1 1 1 1 0 0 2 0 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 48500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1  0 -1  1  0 -1  1  0  0  0  0 -1  1] (Indices: [0, 1, 8, 9, 11, 12, 14, 15, 16, 17, 18]), Candidate: [2 0 1 0 1 1 1 1 1 0 1 1 0 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 48550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1 -1  1 -1  1  0  0  0  0  0 -1  1  0] (Indices: [0, 1, 8, 10, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  0  1  0  1  1  1  1  0  2 -1  2  1  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  1  0 -1  1 -1  1  0  0  0  0  0  0] (Indices: [0, 1, 9, 10, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  0  1  0  1  1  1  0  2  1 -1  2  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0  0 -1  0  0  1 -1  0  0  0  0  1  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 9, 13, 19]), Candidate: [1 2 1 0 1 1 1 0 1 0 0 1 2 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 48700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0 -1  1 -1  0  0  0  0  0  1 -1  1  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 10, 17, 19]), Candidate: [ 1  2  1  0  1  1  1  0  0  2 -1  1  1  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0 -1  0  0  1 -1  0  0  0  0  1  0  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 12, 18, 19]), Candidate: [1 2 1 0 1 1 1 0 0 1 0 2 0 1 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 48800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  1  0 -1  1 -1  0  0  0  0  0  1  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 9, 10, 12, 19]), Candidate: [ 1  2  1  0  1  1  1 -1  2  1 -1  2  0  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 48850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  1 -1  0  1  0  0 -1  0  0  0  0  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 9, 12, 13, 14]), Candidate: [ 1  2  1  0  1  1  1 -1  2  0  0  2  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 48900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  1 -1  0  0  0  0  1 -1  1 -1  1  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 9, 15, 17, 19]), Candidate: [ 1  2  1  0  1  1  1 -1  2  0  0  1  1  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  0  1 -1  1 -1  0  0  1 -1  1 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 10, 12, 16, 18]), Candidate: [ 1  2  1  0  1  1  1 -1  1  2 -1  2  0  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 49000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  0  0  1  0 -1  1 -1  0  0  0  1  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 11, 12, 14, 19]), Candidate: [ 1  2  1  0  1  1  1 -1  1  1  1  1  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 49050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  0  0  0  1  0  0 -1  0  0  0  1  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 12, 13, 14, 19]), Candidate: [ 1  2  1  0  1  1  1 -1  1  1  0  2  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 49100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  0  0  0  0  1 -1  0  0  1  0  0  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 13, 17, 18, 19]), Candidate: [ 1  2  1  0  1  1  1 -1  1  1  0  1  2  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1  0  0 -1  0  0  0  0  0  1 -1  1  0] (Indices: [0, 2, 3, 4, 5, 6, 8, 9, 10, 17, 19]), Candidate: [ 1  2  1  0  1  1  0  1  1  1 -1  1  1  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1  0 -1  0  1 -1  0  0  0  0  1  0  0] (Indices: [0, 2, 3, 4, 5, 6, 8, 9, 12, 18, 19]), Candidate: [1 2 1 0 1 1 0 1 1 0 0 2 0 1 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 49250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1 -1  1  0 -1  0  1 -1  1 -1  0  0  1] (Indices: [0, 2, 3, 4, 5, 6, 8, 10, 11, 14, 16]), Candidate: [ 1  2  1  0  1  1  0  1  0  2  0  0  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1 -1  1 -1  0  0  1  0  0 -1  0  0  1] (Indices: [0, 2, 3, 4, 5, 6, 8, 10, 14, 15, 16]), Candidate: [ 1  2  1  0  1  1  0  1  0  2 -1  1  1  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1 -1  0  1 -1  1 -1  0  1  0 -1  0  1] (Indices: [0, 2, 3, 4, 5, 6, 8, 11, 13, 16, 17]), Candidate: [1 2 1 0 1 1 0 1 0 1 1 0 2 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 49400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1 -1  0  0  1 -1  1 -1  0  0  1  0  0] (Indices: [0, 2, 3, 4, 5, 6, 8, 12, 14, 18, 19]), Candidate: [ 1  2  1  0  1  1  0  1  0  1  0  2  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  1  0  0  0 -1  0  0  0  1 -1  0  1] (Indices: [0, 2, 3, 4, 5, 6, 9, 10, 11, 12, 17]), Candidate: [1 2 1 0 1 1 0 0 2 1 0 1 0 1 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 49500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  1  0 -1  0  1 -1  1  0 -1  0  0  1] (Indices: [0, 2, 3, 4, 5, 6, 9, 10, 13, 15, 16]), Candidate: [ 1  2  1  0  1  1  0  0  2  1 -1  1  2  0  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  1 -1  1  0 -1  0  0  0  0  1  0  0] (Indices: [0, 2, 3, 4, 5, 6, 9, 11, 12, 18, 19]), Candidate: [1 2 1 0 1 1 0 0 2 0 1 1 0 1 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 49600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  1 -1  0  1  0 -1  0  0  0  1  0  0] (Indices: [0, 2, 3, 4, 5, 6, 9, 12, 13, 18, 19]), Candidate: [1 2 1 0 1 1 0 0 2 0 0 2 1 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 49650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  1 -1  0  0  0  1 -1  0  1  0  0  0] (Indices: [0, 2, 3, 4, 5, 6, 9, 14, 17, 18, 19]), Candidate: [ 1  2  1  0  1  1  0  0  2  0  0  1  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  0  1  0 -1  0  1 -1  0  1 -1  1  0] (Indices: [0, 2, 3, 4, 5, 6, 10, 11, 14, 17, 19]), Candidate: [ 1  2  1  0  1  1  0  0  1  2  0  0  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  0  1 -1  0  1  0  0 -1  0  0  1  0] (Indices: [0, 2, 3, 4, 5, 6, 10, 13, 14, 15, 19]), Candidate: [ 1  2  1  0  1  1  0  0  1  2 -1  1  2  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  0  0  1  0 -1  1  0 -1  0  0  1  0] (Indices: [0, 2, 3, 4, 5, 6, 11, 12, 14, 15, 19]), Candidate: [1 2 1 0 1 1 0 0 1 1 1 1 0 2 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 49850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  0  0  1 -1  0  0  1 -1  1  0  0  0] (Indices: [0, 2, 3, 4, 5, 6, 11, 15, 17, 18, 19]), Candidate: [1 2 1 0 1 1 0 0 1 1 1 0 1 1 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 49900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  0  0  0  0  1 -1  1 -1  1  0  0  0] (Indices: [0, 2, 3, 4, 5, 6, 13, 15, 17, 18, 19]), Candidate: [1 2 1 0 1 1 0 0 1 1 0 1 2 0 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 49950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0  0 -1  1  0 -1  0  0  0  0  0  1  0] (Indices: [0, 2, 3, 4, 5, 7, 8, 9, 11, 12, 19]), Candidate: [1 2 1 0 1 0 2 0 1 0 1 1 0 1 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 50000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0  0 -1  0  0  1 -1  1 -1  0  1 -1  1] (Indices: [0, 2, 3, 4, 5, 7, 8, 9, 13, 15, 18]), Candidate: [1 2 1 0 1 0 2 0 1 0 0 1 2 0 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 50050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0 -1  1  0 -1  0  0  0  1  0 -1  0  1] (Indices: [0, 2, 3, 4, 5, 7, 8, 10, 11, 16, 17]), Candidate: [1 2 1 0 1 0 2 0 0 2 0 0 1 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 50100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0 -1  1 -1  0  0  1 -1  0  1 -1  1  0] (Indices: [0, 2, 3, 4, 5, 7, 8, 10, 14, 17, 19]), Candidate: [ 1  2  1  0  1  0  2  0  0  2 -1  1  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 50150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0 -1  0  1 -1  0  1  0 -1  0  1 -1  1] (Indices: [0, 2, 3, 4, 5, 7, 8, 11, 14, 15, 18]), Candidate: [1 2 1 0 1 0 2 0 0 1 1 0 1 2 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 50200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0 -1  0  0  1 -1  0  0  1  0 -1  1  0] (Indices: [0, 2, 3, 4, 5, 7, 8, 12, 16, 17, 19]), Candidate: [1 2 1 0 1 0 2 0 0 1 0 2 0 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 50250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  1  0  0 -1  1 -1  0  0  0  0  1  0] (Indices: [0, 2, 3, 4, 5, 7, 9, 10, 11, 13, 19]), Candidate: [ 1  2  1  0  1  0  2 -1  2  1  0  0  2  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  1  0 -1  0  1 -1  0  0  1 -1  1  0] (Indices: [0, 2, 3, 4, 5, 7, 9, 10, 13, 17, 19]), Candidate: [ 1  2  1  0  1  0  2 -1  2  1 -1  1  2  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 50350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  1 -1  1 -1  1 -1  1 -1  0  1 -1  1] (Indices: [0, 2, 3, 4, 5, 7, 9, 11, 13, 15, 18]), Candidate: [ 1  2  1  0  1  0  2 -1  2  0  1  0  2  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  1 -1  0  1 -1  1 -1  0  1  0 -1  1] (Indices: [0, 2, 3, 4, 5, 7, 9, 12, 14, 17, 18]), Candidate: [ 1  2  1  0  1  0  2 -1  2  0  0  2  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 50450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  0  1  0  0  0 -1  0  1 -1  0  0  1] (Indices: [0, 2, 3, 4, 5, 7, 10, 11, 12, 13, 16]), Candidate: [ 1  2  1  0  1  0  2 -1  1  2  0  1  1  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  0  1  0 -1  0  0  0  1  0  0 -1  1] (Indices: [0, 2, 3, 4, 5, 7, 10, 11, 16, 17, 18]), Candidate: [ 1  2  1  0  1  0  2 -1  1  2  0  0  1  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  0  1 -1  0  1 -1  1  0 -1  1 -1  1] (Indices: [0, 2, 3, 4, 5, 7, 10, 13, 15, 16, 18]), Candidate: [ 1  2  1  0  1  0  2 -1  1  2 -1  1  2  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 50600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  0  0  1  0 -1  0  1  0 -1  1 -1  1] (Indices: [0, 2, 3, 4, 5, 7, 11, 12, 15, 16, 18]), Candidate: [ 1  2  1  0  1  0  2 -1  1  1  1  1  0  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  0  0  0  1  0  0 -1  1 -1  0  1  0] (Indices: [0, 2, 3, 4, 5, 7, 12, 13, 14, 16, 19]), Candidate: [ 1  2  1  0  1  0  2 -1  1  1  0  2  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 50700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1  0  0  0  0  0 -1  0  0  0  0  0  1] (Indices: [0, 2, 3, 4, 5, 8, 9, 10, 11, 12, 13]), Candidate: [1 2 1 0 1 0 1 1 1 1 0 1 1 0 0 1 1 1 1 7]
 -> Valid neighbor added.
Attempt 50750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1  0  0 -1  0  1  0 -1  1 -1  0  0  1] (Indices: [0, 2, 3, 4, 5, 8, 9, 10, 13, 14, 16]), Candidate: [ 1  2  1  0  1  0  1  1  1  1 -1  1  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 50800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1  0 -1  1  0 -1  0  0  1 -1  1 -1  1] (Indices: [0, 2, 3, 4, 5, 8, 9, 11, 12, 16, 18]), Candidate: [1 2 1 0 1 0 1 1 1 0 1 1 0 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 50850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1  0 -1  0  1  0 -1  0  1 -1  1 -1  1] (Indices: [0, 2, 3, 4, 5, 8, 9, 12, 13, 16, 18]), Candidate: [1 2 1 0 1 0 1 1 1 0 0 2 1 0 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 50900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1  0 -1  0  0  0  1  0 -1  0  1  0  0] (Indices: [0, 2, 3, 4, 5, 8, 9, 14, 15, 18, 19]), Candidate: [1 2 1 0 1 0 1 1 1 0 0 1 1 2 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 50950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1 -1  1  0 -1  0  1 -1  1  0 -1  0  1] (Indices: [0, 2, 3, 4, 5, 8, 10, 11, 14, 16, 17]), Candidate: [ 1  2  1  0  1  0  1  1  0  2  0  0  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1 -1  1 -1  1 -1  0  0  0  1  0  0  0] (Indices: [0, 2, 3, 4, 5, 8, 10, 12, 17, 18, 19]), Candidate: [ 1  2  1  0  1  0  1  1  0  2 -1  2  0  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1 -1  0  1  0  0 -1  0  0  0  1  0  0] (Indices: [0, 2, 3, 4, 5, 8, 11, 12, 13, 18, 19]), Candidate: [1 2 1 0 1 0 1 1 0 1 1 1 1 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 51100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1 -1  0  1 -1  0  1 -1  0  1  0  0  0] (Indices: [0, 2, 3, 4, 5, 8, 11, 14, 17, 18, 19]), Candidate: [ 1  2  1  0  1  0  1  1  0  1  1  0  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1 -1  0  0  0  1  0 -1  0  1  0  0  0] (Indices: [0, 2, 3, 4, 5, 8, 13, 14, 17, 18, 19]), Candidate: [ 1  2  1  0  1  0  1  1  0  1  0  1  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  1  0  0 -1  0  1  0 -1  0  1 -1  1] (Indices: [0, 2, 3, 4, 5, 9, 10, 11, 14, 15, 18]), Candidate: [1 2 1 0 1 0 1 0 2 1 0 0 1 2 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 51250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  1  0 -1  1 -1  0  0  1  0 -1  1  0] (Indices: [0, 2, 3, 4, 5, 9, 10, 12, 16, 17, 19]), Candidate: [ 1  2  1  0  1  0  1  0  2  1 -1  2  0  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  1 -1  1  0  0 -1  0  0  1  0 -1  1] (Indices: [0, 2, 3, 4, 5, 9, 11, 12, 13, 17, 18]), Candidate: [1 2 1 0 1 0 1 0 2 0 1 1 1 0 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 51350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  1 -1  1 -1  0  1 -1  1  0 -1  1  0] (Indices: [0, 2, 3, 4, 5, 9, 11, 14, 16, 17, 19]), Candidate: [ 1  2  1  0  1  0  1  0  2  0  1  0  1  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  1 -1  0  0  1  0 -1  1  0 -1  1  0] (Indices: [0, 2, 3, 4, 5, 9, 13, 14, 16, 17, 19]), Candidate: [ 1  2  1  0  1  0  1  0  2  0  0  1  2  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  0  1  0 -1  1  0  0 -1  1 -1  0  1] (Indices: [0, 2, 3, 4, 5, 10, 11, 13, 14, 15, 17]), Candidate: [1 2 1 0 1 0 1 0 1 2 0 0 2 1 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 51500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  0  1 -1  1  0 -1  0  1  0  0 -1  1] (Indices: [0, 2, 3, 4, 5, 10, 12, 13, 16, 17, 18]), Candidate: [ 1  2  1  0  1  0  1  0  1  2 -1  2  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  0  0  1  0  0 -1  1  0  0 -1  0  1] (Indices: [0, 2, 3, 4, 5, 11, 12, 13, 15, 16, 17]), Candidate: [1 2 1 0 1 0 1 0 1 1 1 1 1 0 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 51600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  0  0  0  1  0  0  0 -1  1 -1  1  0] (Indices: [0, 2, 3, 4, 5, 12, 13, 14, 15, 17, 19]), Candidate: [1 2 1 0 1 0 1 0 1 1 0 2 1 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 51650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0  0  0 -1  0  0  0  1  0 -1  0  0  1] (Indices: [0, 2, 3, 4, 6, 7, 8, 9, 10, 15, 16]), Candidate: [ 1  2  1  0  0  2  1  0  1  1 -1  1  1  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0  0 -1  0  1 -1  0  1 -1  1 -1  0  1] (Indices: [0, 2, 3, 4, 6, 7, 8, 9, 12, 15, 17]), Candidate: [1 2 1 0 0 2 1 0 1 0 0 2 0 1 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 51750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0 -1  1  0  0 -1  0  0  0  0  0  1  0] (Indices: [0, 2, 3, 4, 6, 7, 8, 10, 11, 12, 19]), Candidate: [1 2 1 0 0 2 1 0 0 2 0 1 0 1 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 51800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0 -1  1 -1  0  1 -1  1 -1  0  1 -1  1] (Indices: [0, 2, 3, 4, 6, 7, 8, 10, 13, 15, 18]), Candidate: [ 1  2  1  0  0  2  1  0  0  2 -1  1  2  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0 -1  0  1 -1  1  0 -1  1 -1  0  0  1] (Indices: [0, 2, 3, 4, 6, 7, 8, 11, 13, 14, 16]), Candidate: [ 1  2  1  0  0  2  1  0  0  1  1  0  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0 -1  0  0  1 -1  1  0 -1  1 -1  0  1] (Indices: [0, 2, 3, 4, 6, 7, 8, 12, 14, 15, 17]), Candidate: [1 2 1 0 0 2 1 0 0 1 0 2 0 2 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 51950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0 -1  0  0  0  0  0  1  0  0 -1  1  0] (Indices: [0, 2, 3, 4, 6, 7, 8, 15, 16, 17, 19]), Candidate: [1 2 1 0 0 2 1 0 0 1 0 1 1 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 52000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  1  0 -1  1 -1  0  0  0  1  0 -1  1] (Indices: [0, 2, 3, 4, 6, 7, 9, 10, 12, 17, 18]), Candidate: [ 1  2  1  0  0  2  1 -1  2  1 -1  2  0  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  1 -1  1  0 -1  0  1 -1  1 -1  0  1] (Indices: [0, 2, 3, 4, 6, 7, 9, 11, 12, 15, 17]), Candidate: [ 1  2  1  0  0  2  1 -1  2  0  1  1  0  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  1 -1  0  1  0 -1  1 -1  1 -1  0  1] (Indices: [0, 2, 3, 4, 6, 7, 9, 12, 13, 15, 17]), Candidate: [ 1  2  1  0  0  2  1 -1  2  0  0  2  1  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  1 -1  0  0  0  1  0  0 -1  1 -1  1] (Indices: [0, 2, 3, 4, 6, 7, 9, 14, 15, 16, 18]), Candidate: [ 1  2  1  0  0  2  1 -1  2  0  0  1  1  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  0  1  0 -1  0  1  0  0 -1  0  0  1] (Indices: [0, 2, 3, 4, 6, 7, 10, 11, 14, 15, 16]), Candidate: [ 1  2  1  0  0  2  1 -1  1  2  0  0  1  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  0  1 -1  1 -1  0  1 -1  0  1  0  0] (Indices: [0, 2, 3, 4, 6, 7, 10, 12, 15, 18, 19]), Candidate: [ 1  2  1  0  0  2  1 -1  1  2 -1  2  0  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  0  0  1  0  0 -1  0  1 -1  1 -1  1] (Indices: [0, 2, 3, 4, 6, 7, 11, 12, 13, 16, 18]), Candidate: [ 1  2  1  0  0  2  1 -1  1  1  1  1  1  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  0  0  1 -1  0  1  0 -1  0  1  0  0] (Indices: [0, 2, 3, 4, 6, 7, 11, 14, 15, 18, 19]), Candidate: [ 1  2  1  0  0  2  1 -1  1  1  1  0  1  2  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  0  0  0  0  1  0  0 -1  0  1  0  0] (Indices: [0, 2, 3, 4, 6, 7, 13, 14, 15, 18, 19]), Candidate: [ 1  2  1  0  0  2  1 -1  1  1  0  1  2  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1  0  0 -1  1 -1  1  0 -1  0  0  0  1] (Indices: [0, 2, 3, 4, 6, 8, 9, 10, 12, 14, 15]), Candidate: [ 1  2  1  0  0  2  0  1  1  1 -1  2  0  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1  0 -1  1  0  0  0 -1  0  0  0  0  1] (Indices: [0, 2, 3, 4, 6, 8, 9, 11, 12, 13, 14]), Candidate: [ 1  2  1  0  0  2  0  1  1  0  1  1  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1  0 -1  1 -1  0  0  1 -1  1 -1  1  0] (Indices: [0, 2, 3, 4, 6, 8, 9, 11, 15, 17, 19]), Candidate: [1 2 1 0 0 2 0 1 1 0 1 0 1 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 52600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1  0 -1  0  0  1  0 -1  0  0  1  0  0] (Indices: [0, 2, 3, 4, 6, 8, 9, 13, 14, 18, 19]), Candidate: [ 1  2  1  0  0  2  0  1  1  0  0  1  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1 -1  1  0 -1  1  0 -1  0  0  1 -1  1] (Indices: [0, 2, 3, 4, 6, 8, 10, 11, 13, 14, 18]), Candidate: [ 1  2  1  0  0  2  0  1  0  2  0  0  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1 -1  1 -1  1 -1  1  0 -1  0  0  1  0] (Indices: [0, 2, 3, 4, 6, 8, 10, 12, 14, 15, 19]), Candidate: [ 1  2  1  0  0  2  0  1  0  2 -1  2  0  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1 -1  1 -1  0  0  0  1 -1  1  0  0  0] (Indices: [0, 2, 3, 4, 6, 8, 10, 15, 17, 18, 19]), Candidate: [ 1  2  1  0  0  2  0  1  0  2 -1  1  1  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1 -1  0  1 -1  1 -1  1 -1  1  0 -1  1] (Indices: [0, 2, 3, 4, 6, 8, 11, 13, 15, 17, 18]), Candidate: [1 2 1 0 0 2 0 1 0 1 1 0 2 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 52850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1 -1  0  0  1 -1  1 -1  1 -1  1  0  0] (Indices: [0, 2, 3, 4, 6, 8, 12, 14, 16, 18, 19]), Candidate: [ 1  2  1  0  0  2  0  1  0  1  0  2  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  1  0  0 -1  1  0 -1  1 -1  0  0  1] (Indices: [0, 2, 3, 4, 6, 9, 10, 11, 13, 14, 16]), Candidate: [ 1  2  1  0  0  2  0  0  2  1  0  0  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  1  0 -1  1 -1  1  0 -1  1 -1  0  1] (Indices: [0, 2, 3, 4, 6, 9, 10, 12, 14, 15, 17]), Candidate: [ 1  2  1  0  0  2  0  0  2  1 -1  2  0  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  1  0 -1  0  0  0  1  0  0 -1  1  0] (Indices: [0, 2, 3, 4, 6, 9, 10, 15, 16, 17, 19]), Candidate: [ 1  2  1  0  0  2  0  0  2  1 -1  1  1  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  1 -1  1 -1  1 -1  1  0 -1  1 -1  1] (Indices: [0, 2, 3, 4, 6, 9, 11, 13, 15, 16, 18]), Candidate: [1 2 1 0 0 2 0 0 2 0 1 0 2 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 53100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  1 -1  0  1 -1  1 -1  1  0  0 -1  1] (Indices: [0, 2, 3, 4, 6, 9, 12, 14, 16, 17, 18]), Candidate: [ 1  2  1  0  0  2  0  0  2  0  0  2  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  0  1  0  0 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 2, 3, 4, 6, 10, 11, 12, 14, 16, 18]), Candidate: [ 1  2  1  0  0  2  0  0  1  2  0  1  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  0  1 -1  1  0  0  0  0 -1  0  0  1] (Indices: [0, 2, 3, 4, 6, 10, 12, 13, 14, 15, 16]), Candidate: [ 1  2  1  0  0  2  0  0  1  2 -1  2  1  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  0  1 -1  0  0  1  0  0  0  0 -1  1] (Indices: [0, 2, 3, 4, 6, 10, 14, 15, 16, 17, 18]), Candidate: [ 1  2  1  0  0  2  0  0  1  2 -1  1  1  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  0  0  1 -1  1  0 -1  0  1  0  0  0] (Indices: [0, 2, 3, 4, 6, 11, 13, 14, 17, 18, 19]), Candidate: [ 1  2  1  0  0  2  0  0  1  1  1  0  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0  0  0  0 -1  1 -1  0  0  1 -1  0  1] (Indices: [0, 2, 3, 4, 7, 8, 9, 10, 11, 13, 17]), Candidate: [1 2 1 0 0 1 2 0 1 1 0 0 2 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 53400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0  0  0 -1  0  1 -1  0  1 -1  0  1  0] (Indices: [0, 2, 3, 4, 7, 8, 9, 10, 13, 16, 19]), Candidate: [ 1  2  1  0  0  1  2  0  1  1 -1  1  2  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0  0 -1  1 -1  1 -1  1  0 -1  0  0  1] (Indices: [0, 2, 3, 4, 7, 8, 9, 11, 13, 15, 16]), Candidate: [1 2 1 0 0 1 2 0 1 0 1 0 2 0 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 53500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0  0 -1  0  1 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 2, 3, 4, 7, 8, 9, 12, 14, 16, 18]), Candidate: [ 1  2  1  0  0  1  2  0  1  0  0  2  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0 -1  1  0  0  0  0 -1  0  0  0  0  1] (Indices: [0, 2, 3, 4, 7, 8, 10, 11, 12, 13, 14]), Candidate: [ 1  2  1  0  0  1  2  0  0  2  0  1  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0 -1  1  0 -1  0  0  1 -1  1 -1  1  0] (Indices: [0, 2, 3, 4, 7, 8, 10, 11, 15, 17, 19]), Candidate: [1 2 1 0 0 1 2 0 0 2 0 0 1 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 53650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0 -1  1 -1  0  1  0 -1  0  0  1  0  0] (Indices: [0, 2, 3, 4, 7, 8, 10, 13, 14, 18, 19]), Candidate: [ 1  2  1  0  0  1  2  0  0  2 -1  1  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 53700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0 -1  0  1  0 -1  1 -1  0  0  1  0  0] (Indices: [0, 2, 3, 4, 7, 8, 11, 12, 14, 18, 19]), Candidate: [ 1  2  1  0  0  1  2  0  0  1  1  1  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0 -1  0  0  1  0  0 -1  1  0 -1  0  1] (Indices: [0, 2, 3, 4, 7, 8, 12, 13, 14, 16, 17]), Candidate: [ 1  2  1  0  0  1  2  0  0  1  0  2  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0 -1  0  0  0  0  1 -1  1  0  0  0  0] (Indices: [0, 2, 3, 4, 7, 8, 14, 16, 17, 18, 19]), Candidate: [ 1  2  1  0  0  1  2  0  0  1  0  1  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  1  0  0 -1  0  0  1  0 -1  0  1  0] (Indices: [0, 2, 3, 4, 7, 9, 10, 11, 15, 16, 19]), Candidate: [ 1  2  1  0  0  1  2 -1  2  1  0  0  1  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  1  0 -1  0  1  0 -1  0  1  0 -1  1] (Indices: [0, 2, 3, 4, 7, 9, 10, 13, 14, 17, 18]), Candidate: [ 1  2  1  0  0  1  2 -1  2  1 -1  1  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 53950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  1 -1  1  0 -1  1 -1  0  1  0 -1  1] (Indices: [0, 2, 3, 4, 7, 9, 11, 12, 14, 17, 18]), Candidate: [ 1  2  1  0  0  1  2 -1  2  0  1  1  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 54000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  1 -1  0  1  0  0  0 -1  0  1 -1  1] (Indices: [0, 2, 3, 4, 7, 9, 12, 13, 14, 15, 18]), Candidate: [ 1  2  1  0  0  1  2 -1  2  0  0  2  1  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  1 -1  0  0  0  1  0  0 -1  1  0  0] (Indices: [0, 2, 3, 4, 7, 9, 14, 15, 16, 18, 19]), Candidate: [ 1  2  1  0  0  1  2 -1  2  0  0  1  1  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  0  1  0 -1  1 -1  1  0 -1  1 -1  1] (Indices: [0, 2, 3, 4, 7, 10, 11, 13, 15, 16, 18]), Candidate: [ 1  2  1  0  0  1  2 -1  1  2  0  0  2  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  0  1 -1  1 -1  1 -1  1  0  0 -1  1] (Indices: [0, 2, 3, 4, 7, 10, 12, 14, 16, 17, 18]), Candidate: [ 1  2  1  0  0  1  2 -1  1  2 -1  2  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 54200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  0  0  1  0 -1  1  0  0  0 -1  0  1] (Indices: [0, 2, 3, 4, 7, 11, 12, 14, 15, 16, 17]), Candidate: [ 1  2  1  0  0  1  2 -1  1  1  1  1  0  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  0  0  0  1  0 -1  0  1  0  0  0  0] (Indices: [0, 2, 3, 4, 7, 12, 13, 16, 17, 18, 19]), Candidate: [ 1  2  1  0  0  1  2 -1  1  1  0  2  1  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1  0  0  0 -1  0  1  0  0 -1  0  0  1] (Indices: [0, 2, 3, 4, 8, 9, 10, 11, 14, 15, 16]), Candidate: [1 2 1 0 0 1 1 1 1 1 0 0 1 2 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 54350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1  0  0 -1  1 -1  0  1 -1  0  1  0  0] (Indices: [0, 2, 3, 4, 8, 9, 10, 12, 15, 18, 19]), Candidate: [ 1  2  1  0  0  1  1  1  1  1 -1  2  0  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1  0 -1  1  0  0 -1  0  1 -1  1 -1  1] (Indices: [0, 2, 3, 4, 8, 9, 11, 12, 13, 16, 18]), Candidate: [1 2 1 0 0 1 1 1 1 0 1 1 1 0 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 54450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1  0 -1  1 -1  0  1  0 -1  0  1  0  0] (Indices: [0, 2, 3, 4, 8, 9, 11, 14, 15, 18, 19]), Candidate: [1 2 1 0 0 1 1 1 1 0 1 0 1 2 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 54500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1  0 -1  0  0  1  0  0 -1  0  1  0  0] (Indices: [0, 2, 3, 4, 8, 9, 13, 14, 15, 18, 19]), Candidate: [1 2 1 0 0 1 1 1 1 0 0 1 2 1 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 54550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1 -1  1  0  0 -1  0  0  0  1  0  0  0] (Indices: [0, 2, 3, 4, 8, 10, 11, 12, 17, 18, 19]), Candidate: [1 2 1 0 0 1 1 1 0 2 0 1 0 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 54600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1 -1  1 -1  1  0 -1  1 -1  1 -1  1  0] (Indices: [0, 2, 3, 4, 8, 10, 12, 13, 15, 17, 19]), Candidate: [ 1  2  1  0  0  1  1  1  0  2 -1  2  1  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1 -1  0  1  0  0  0 -1  0  1 -1  1  0] (Indices: [0, 2, 3, 4, 8, 11, 12, 13, 14, 17, 19]), Candidate: [ 1  2  1  0  0  1  1  1  0  1  1  1  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1 -1  0  0  1  0  0  0  0 -1  0  1  0] (Indices: [0, 2, 3, 4, 8, 12, 13, 14, 15, 16, 19]), Candidate: [1 2 1 0 0 1 1 1 0 1 0 2 1 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 54750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  1  0  0  0 -1  1 -1  0  0  1  0  0] (Indices: [0, 2, 3, 4, 9, 10, 11, 12, 14, 18, 19]), Candidate: [ 1  2  1  0  0  1  1  0  2  1  0  1  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  1  0 -1  1  0  0 -1  1  0 -1  0  1] (Indices: [0, 2, 3, 4, 9, 10, 12, 13, 14, 16, 17]), Candidate: [ 1  2  1  0  0  1  1  0  2  1 -1  2  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 54850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  1  0 -1  0  0  1 -1  1  0  0  0  0] (Indices: [0, 2, 3, 4, 9, 10, 14, 16, 17, 18, 19]), Candidate: [ 1  2  1  0  0  1  1  0  2  1 -1  1  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 54900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  1 -1  1 -1  1 -1  1 -1  1  0  0  0] (Indices: [0, 2, 3, 4, 9, 11, 13, 15, 17, 18, 19]), Candidate: [1 2 1 0 0 1 1 0 2 0 1 0 2 0 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 54950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  0  1  0  0  0 -1  1 -1  1 -1  1  0] (Indices: [0, 2, 3, 4, 10, 11, 12, 13, 15, 17, 19]), Candidate: [1 2 1 0 0 1 1 0 1 2 0 1 1 0 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 55000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  0  1 -1  1  0  0 -1  1 -1  1  0  0] (Indices: [0, 2, 3, 4, 10, 12, 13, 14, 16, 18, 19]), Candidate: [ 1  2  1  0  0  1  1  0  1  2 -1  2  1  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  0  0  0  1  0  0  0  0 -1  1  0  0] (Indices: [0, 2, 3, 4, 12, 13, 14, 15, 16, 18, 19]), Candidate: [1 2 1 0 0 1 1 0 1 1 0 2 1 1 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 55100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0  0 -1  1 -1  1 -1  1 -1  0  0  0  1] (Indices: [0, 2, 3, 5, 6, 7, 8, 9, 11, 13, 15]), Candidate: [ 1  2  1 -1  2  1  1  0  1  0  1  0  2  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0  0 -1  0  0  1 -1  0  1  0 -1  0  1] (Indices: [0, 2, 3, 5, 6, 7, 8, 9, 13, 16, 17]), Candidate: [ 1  2  1 -1  2  1  1  0  1  0  0  1  2  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0 -1  1  0 -1  0  0  0  1 -1  0  1  0] (Indices: [0, 2, 3, 5, 6, 7, 8, 10, 11, 16, 19]), Candidate: [ 1  2  1 -1  2  1  1  0  0  2  0  0  1  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0 -1  1 -1  0  0  0  1  0  0 -1  0  1] (Indices: [0, 2, 3, 5, 6, 7, 8, 10, 15, 16, 17]), Candidate: [ 1  2  1 -1  2  1  1  0  0  2 -1  1  1  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0 -1  0  1 -1  0  1 -1  1  0 -1  0  1] (Indices: [0, 2, 3, 5, 6, 7, 8, 11, 14, 16, 17]), Candidate: [ 1  2  1 -1  2  1  1  0  0  1  1  0  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0 -1  0  0  1 -1  0  0  0  1  0  0  0] (Indices: [0, 2, 3, 5, 6, 7, 8, 12, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  1  1  0  0  1  0  2  0  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  1  0  0 -1  0  1 -1  1 -1  0  0  1] (Indices: [0, 2, 3, 5, 6, 7, 9, 10, 11, 14, 16]), Candidate: [ 1  2  1 -1  2  1  1 -1  2  1  0  0  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 55450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  1  0 -1  0  0  1  0  0 -1  0  0  1] (Indices: [0, 2, 3, 5, 6, 7, 9, 10, 14, 15, 16]), Candidate: [ 1  2  1 -1  2  1  1 -1  2  1 -1  1  1  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 55500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  1 -1  1 -1  1 -1  0  1  0 -1  0  1] (Indices: [0, 2, 3, 5, 6, 7, 9, 11, 13, 16, 17]), Candidate: [ 1  2  1 -1  2  1  1 -1  2  0  1  0  2  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  1 -1  0  1 -1  1 -1  0  0  1  0  0] (Indices: [0, 2, 3, 5, 6, 7, 9, 12, 14, 18, 19]), Candidate: [ 1  2  1 -1  2  1  1 -1  2  0  0  2  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 55600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  0  1  0  0  0 -1  0  0  0  1 -1  1] (Indices: [0, 2, 3, 5, 6, 7, 10, 11, 12, 13, 18]), Candidate: [ 1  2  1 -1  2  1  1 -1  1  2  0  1  1  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  0  1  0 -1  0  0  0  1 -1  1  0  0] (Indices: [0, 2, 3, 5, 6, 7, 10, 11, 16, 18, 19]), Candidate: [ 1  2  1 -1  2  1  1 -1  1  2  0  0  1  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  0  1 -1  0  1 -1  1 -1  1  0 -1  1] (Indices: [0, 2, 3, 5, 6, 7, 10, 13, 15, 17, 18]), Candidate: [ 1  2  1 -1  2  1  1 -1  1  2 -1  1  2  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 55750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  0  0  1  0 -1  0  1 -1  1  0 -1  1] (Indices: [0, 2, 3, 5, 6, 7, 11, 12, 15, 17, 18]), Candidate: [ 1  2  1 -1  2  1  1 -1  1  1  1  1  0  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  0  0  0  1  0  0 -1  0  1 -1  1  0] (Indices: [0, 2, 3, 5, 6, 7, 12, 13, 14, 17, 19]), Candidate: [ 1  2  1 -1  2  1  1 -1  1  1  0  2  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 55850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1  0  0  0  0 -1  0  1 -1  0  0  0  1] (Indices: [0, 2, 3, 5, 6, 8, 9, 10, 11, 12, 15]), Candidate: [ 1  2  1 -1  2  1  0  1  1  1  0  1  0  1  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1  0  0 -1  0  1  0 -1  0  0  1 -1  1] (Indices: [0, 2, 3, 5, 6, 8, 9, 10, 13, 14, 18]), Candidate: [ 1  2  1 -1  2  1  0  1  1  1 -1  1  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 55950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1  0 -1  1  0 -1  0  0  0  1  0 -1  1] (Indices: [0, 2, 3, 5, 6, 8, 9, 11, 12, 17, 18]), Candidate: [ 1  2  1 -1  2  1  0  1  1  0  1  1  0  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1  0 -1  0  1  0 -1  0  0  1  0 -1  1] (Indices: [0, 2, 3, 5, 6, 8, 9, 12, 13, 17, 18]), Candidate: [ 1  2  1 -1  2  1  0  1  1  0  0  2  1  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1  0 -1  0  0  0  1 -1  1  0 -1  1  0] (Indices: [0, 2, 3, 5, 6, 8, 9, 14, 16, 17, 19]), Candidate: [ 1  2  1 -1  2  1  0  1  1  0  0  1  1  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1 -1  1  0 -1  0  1 -1  1 -1  0  1  0] (Indices: [0, 2, 3, 5, 6, 8, 10, 11, 14, 16, 19]), Candidate: [ 1  2  1 -1  2  1  0  1  0  2  0  0  1  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1 -1  1 -1  0  1  0  0 -1  1 -1  0  1] (Indices: [0, 2, 3, 5, 6, 8, 10, 13, 14, 15, 17]), Candidate: [ 1  2  1 -1  2  1  0  1  0  2 -1  1  2  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1 -1  0  1  0 -1  1  0 -1  1 -1  0  1] (Indices: [0, 2, 3, 5, 6, 8, 11, 12, 14, 15, 17]), Candidate: [ 1  2  1 -1  2  1  0  1  0  1  1  1  0  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1 -1  0  1 -1  0  0  1  0  0 -1  1  0] (Indices: [0, 2, 3, 5, 6, 8, 11, 15, 16, 17, 19]), Candidate: [ 1  2  1 -1  2  1  0  1  0  1  1  0  1  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1 -1  0  0  0  1 -1  1  0  0 -1  1  0] (Indices: [0, 2, 3, 5, 6, 8, 13, 15, 16, 17, 19]), Candidate: [ 1  2  1 -1  2  1  0  1  0  1  0  1  2  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  1  0  0 -1  0  1 -1  1  0 -1  0  1] (Indices: [0, 2, 3, 5, 6, 9, 10, 11, 14, 16, 17]), Candidate: [ 1  2  1 -1  2  1  0  0  2  1  0  0  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  1  0 -1  1 -1  0  0  0  1  0  0  0] (Indices: [0, 2, 3, 5, 6, 9, 10, 12, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  1  0  0  2  1 -1  2  0  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  1 -1  1  0  0 -1  0  0  0  1  0  0] (Indices: [0, 2, 3, 5, 6, 9, 11, 12, 13, 18, 19]), Candidate: [ 1  2  1 -1  2  1  0  0  2  0  1  1  1  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  1 -1  1 -1  0  1 -1  0  1  0  0  0] (Indices: [0, 2, 3, 5, 6, 9, 11, 14, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  1  0  0  2  0  1  0  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  1 -1  0  0  1  0 -1  0  1  0  0  0] (Indices: [0, 2, 3, 5, 6, 9, 13, 14, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  1  0  0  2  0  0  1  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  0  1  0 -1  1  0  0 -1  0  0  1  0] (Indices: [0, 2, 3, 5, 6, 10, 11, 13, 14, 15, 19]), Candidate: [ 1  2  1 -1  2  1  0  0  1  2  0  0  2  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  0  1 -1  1  0 -1  0  1 -1  1  0  0] (Indices: [0, 2, 3, 5, 6, 10, 12, 13, 16, 18, 19]), Candidate: [ 1  2  1 -1  2  1  0  0  1  2 -1  2  1  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  0  0  1  0  0 -1  1  0 -1  0  1  0] (Indices: [0, 2, 3, 5, 6, 11, 12, 13, 15, 16, 19]), Candidate: [ 1  2  1 -1  2  1  0  0  1  1  1  1  1  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  0  0  0  1  0  0 -1  1  0  0 -1  1] (Indices: [0, 2, 3, 5, 6, 12, 13, 14, 16, 17, 18]), Candidate: [ 1  2  1 -1  2  1  0  0  1  1  0  2  1  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0  0  0 -1  1  0  0 -1  0  0  0  0  1] (Indices: [0, 2, 3, 5, 7, 8, 9, 10, 12, 13, 14]), Candidate: [ 1  2  1 -1  2  0  2  0  1  1 -1  2  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 56850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0  0  0 -1  0  0  0  1 -1  1 -1  1  0] (Indices: [0, 2, 3, 5, 7, 8, 9, 10, 15, 17, 19]), Candidate: [ 1  2  1 -1  2  0  2  0  1  1 -1  1  1  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0  0 -1  1 -1  0  1 -1  0  1 -1  1  0] (Indices: [0, 2, 3, 5, 7, 8, 9, 11, 14, 17, 19]), Candidate: [ 1  2  1 -1  2  0  2  0  1  0  1  0  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0  0 -1  0  0  1  0  0 -1  0  0  1  0] (Indices: [0, 2, 3, 5, 7, 8, 9, 13, 14, 15, 19]), Candidate: [ 1  2  1 -1  2  0  2  0  1  0  0  1  2  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0 -1  1  0  0 -1  0  0  0  1  0 -1  1] (Indices: [0, 2, 3, 5, 7, 8, 10, 11, 12, 17, 18]), Candidate: [ 1  2  1 -1  2  0  2  0  0  2  0  1  0  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0 -1  1 -1  1  0 -1  0  0  1  0 -1  1] (Indices: [0, 2, 3, 5, 7, 8, 10, 12, 13, 17, 18]), Candidate: [ 1  2  1 -1  2  0  2  0  0  2 -1  2  1  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0 -1  1 -1  0  0  1 -1  1  0 -1  1  0] (Indices: [0, 2, 3, 5, 7, 8, 10, 14, 16, 17, 19]), Candidate: [ 1  2  1 -1  2  0  2  0  0  2 -1  1  1  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 57150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0 -1  0  1 -1  1  0 -1  0  1  0 -1  1] (Indices: [0, 2, 3, 5, 7, 8, 11, 13, 14, 17, 18]), Candidate: [ 1  2  1 -1  2  0  2  0  0  1  1  0  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0 -1  0  0  1 -1  1  0  0 -1  0  1  0] (Indices: [0, 2, 3, 5, 7, 8, 12, 14, 15, 16, 19]), Candidate: [ 1  2  1 -1  2  0  2  0  0  1  0  2  0  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  1  0  0  0 -1  0  0  1 -1  1 -1  1] (Indices: [0, 2, 3, 5, 7, 9, 10, 11, 12, 16, 18]), Candidate: [ 1  2  1 -1  2  0  2 -1  2  1  0  1  0  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  1  0 -1  1  0 -1  0  1 -1  1 -1  1] (Indices: [0, 2, 3, 5, 7, 9, 10, 12, 13, 16, 18]), Candidate: [ 1  2  1 -1  2  0  2 -1  2  1 -1  2  1  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 57350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  1  0 -1  0  0  1  0 -1  0  1  0  0] (Indices: [0, 2, 3, 5, 7, 9, 10, 14, 15, 18, 19]), Candidate: [ 1  2  1 -1  2  0  2 -1  2  1 -1  1  1  2  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 57400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  1 -1  1 -1  1  0 -1  1 -1  1 -1  1] (Indices: [0, 2, 3, 5, 7, 9, 11, 13, 14, 16, 18]), Candidate: [ 1  2  1 -1  2  0  2 -1  2  0  1  0  2  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 57450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  1 -1  0  1 -1  1  0  0  0 -1  0  1] (Indices: [0, 2, 3, 5, 7, 9, 12, 14, 15, 16, 17]), Candidate: [ 1  2  1 -1  2  0  2 -1  2  0  0  2  0  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  0  1  0  0  0 -1  0  0  0  1  0  0] (Indices: [0, 2, 3, 5, 7, 10, 11, 12, 13, 18, 19]), Candidate: [ 1  2  1 -1  2  0  2 -1  1  2  0  1  1  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  0  1  0 -1  0  1 -1  0  1  0  0  0] (Indices: [0, 2, 3, 5, 7, 10, 11, 14, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  0  2 -1  1  2  0  0  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 57600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  0  1 -1  0  1  0 -1  0  1  0  0  0] (Indices: [0, 2, 3, 5, 7, 10, 13, 14, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  0  2 -1  1  2 -1  1  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 57650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  0  0  1 -1  1  0  0 -1  1  0 -1  1] (Indices: [0, 2, 3, 5, 7, 11, 13, 14, 15, 17, 18]), Candidate: [ 1  2  1 -1  2  0  2 -1  1  1  1  0  2  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1  0  0  0  0  0 -1  0  0  0  1 -1  1] (Indices: [0, 2, 3, 5, 8, 9, 10, 11, 12, 13, 18]), Candidate: [ 1  2  1 -1  2  0  1  1  1  1  0  1  1  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1  0  0  0 -1  0  0  0  1 -1  1  0  0] (Indices: [0, 2, 3, 5, 8, 9, 10, 11, 16, 18, 19]), Candidate: [ 1  2  1 -1  2  0  1  1  1  1  0  0  1  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1  0  0 -1  0  1 -1  1 -1  1  0 -1  1] (Indices: [0, 2, 3, 5, 8, 9, 10, 13, 15, 17, 18]), Candidate: [ 1  2  1 -1  2  0  1  1  1  1 -1  1  2  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1  0 -1  1  0 -1  0  1 -1  1  0 -1  1] (Indices: [0, 2, 3, 5, 8, 9, 11, 12, 15, 17, 18]), Candidate: [ 1  2  1 -1  2  0  1  1  1  0  1  1  0  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1  0 -1  0  1  0  0 -1  0  1 -1  1  0] (Indices: [0, 2, 3, 5, 8, 9, 12, 13, 14, 17, 19]), Candidate: [ 1  2  1 -1  2  0  1  1  1  0  0  2  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1 -1  1  0  0  0  0 -1  0  1 -1  0  1] (Indices: [0, 2, 3, 5, 8, 10, 11, 12, 13, 14, 17]), Candidate: [ 1  2  1 -1  2  0  1  1  0  2  0  1  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1 -1  1  0 -1  1 -1  0  1  0 -1  1  0] (Indices: [0, 2, 3, 5, 8, 10, 11, 13, 16, 17, 19]), Candidate: [ 1  2  1 -1  2  0  1  1  0  2  0  0  2  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1 -1  1 -1  1 -1  0  1  0 -1  1  0  0] (Indices: [0, 2, 3, 5, 8, 10, 12, 15, 16, 18, 19]), Candidate: [ 1  2  1 -1  2  0  1  1  0  2 -1  2  0  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1 -1  0  1  0 -1  1 -1  1  0  0 -1  1] (Indices: [0, 2, 3, 5, 8, 11, 12, 14, 16, 17, 18]), Candidate: [ 1  2  1 -1  2  0  1  1  0  1  1  1  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1 -1  0  0  1 -1  0  1  0  0  0  0  0] (Indices: [0, 2, 3, 5, 8, 12, 15, 16, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  0  1  1  0  1  0  2  0  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  1  0  0 -1  1  0 -1  0  1  0 -1  1] (Indices: [0, 2, 3, 5, 9, 10, 11, 13, 14, 17, 18]), Candidate: [ 1  2  1 -1  2  0  1  0  2  1  0  0  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  1  0 -1  1 -1  1  0  0 -1  0  1  0] (Indices: [0, 2, 3, 5, 9, 10, 12, 14, 15, 16, 19]), Candidate: [ 1  2  1 -1  2  0  1  0  2  1 -1  2  0  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  1 -1  1  0  0 -1  0  1  0  0 -1  1] (Indices: [0, 2, 3, 5, 9, 11, 12, 13, 16, 17, 18]), Candidate: [ 1  2  1 -1  2  0  1  0  2  0  1  1  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  1 -1  0  1  0 -1  1  0  0  0 -1  1] (Indices: [0, 2, 3, 5, 9, 12, 13, 15, 16, 17, 18]), Candidate: [ 1  2  1 -1  2  0  1  0  2  0  0  2  1  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  0  1  0  0 -1  0  1  0 -1  1  0  0] (Indices: [0, 2, 3, 5, 10, 11, 12, 15, 16, 18, 19]), Candidate: [ 1  2  1 -1  2  0  1  0  1  2  0  1  0  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  0  1 -1  0  1 -1  1  0  0  0  0  0] (Indices: [0, 2, 3, 5, 10, 13, 15, 16, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  0  1  0  1  2 -1  1  2  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0  0  0  0 -1  1 -1  0  0  0  0  1  0] (Indices: [0, 2, 3, 6, 7, 8, 9, 10, 11, 13, 19]), Candidate: [ 1  2  1 -1  1  2  1  0  1  1  0  0  2  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0  0  0 -1  0  1 -1  0  0  1 -1  1  0] (Indices: [0, 2, 3, 6, 7, 8, 9, 10, 13, 17, 19]), Candidate: [ 1  2  1 -1  1  2  1  0  1  1 -1  1  2  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0  0 -1  1 -1  1 -1  1 -1  0  1 -1  1] (Indices: [0, 2, 3, 6, 7, 8, 9, 11, 13, 15, 18]), Candidate: [ 1  2  1 -1  1  2  1  0  1  0  1  0  2  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0  0 -1  0  1 -1  1 -1  0  1  0 -1  1] (Indices: [0, 2, 3, 6, 7, 8, 9, 12, 14, 17, 18]), Candidate: [ 1  2  1 -1  1  2  1  0  1  0  0  2  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0 -1  1  0  0  0 -1  0  1 -1  0  0  1] (Indices: [0, 2, 3, 6, 7, 8, 10, 11, 12, 13, 16]), Candidate: [ 1  2  1 -1  1  2  1  0  0  2  0  1  1  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0 -1  1  0 -1  0  0  0  1  0  0 -1  1] (Indices: [0, 2, 3, 6, 7, 8, 10, 11, 16, 17, 18]), Candidate: [ 1  2  1 -1  1  2  1  0  0  2  0  0  1  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0 -1  1 -1  0  1 -1  1  0 -1  1 -1  1] (Indices: [0, 2, 3, 6, 7, 8, 10, 13, 15, 16, 18]), Candidate: [ 1  2  1 -1  1  2  1  0  0  2 -1  1  2  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0 -1  0  1  0 -1  0  1  0 -1  1 -1  1] (Indices: [0, 2, 3, 6, 7, 8, 11, 12, 15, 16, 18]), Candidate: [ 1  2  1 -1  1  2  1  0  0  1  1  1  0  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0 -1  0  0  1  0  0 -1  1 -1  0  1  0] (Indices: [0, 2, 3, 6, 7, 8, 12, 13, 14, 16, 19]), Candidate: [ 1  2  1 -1  1  2  1  0  0  1  0  2  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  1  0  0  0  0  0 -1  0  0  0  0  1] (Indices: [0, 2, 3, 6, 7, 9, 10, 11, 12, 13, 14]), Candidate: [ 1  2  1 -1  1  2  1 -1  2  1  0  1  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 59000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  1  0  0 -1  0  0  1 -1  1 -1  1  0] (Indices: [0, 2, 3, 6, 7, 9, 10, 11, 15, 17, 19]), Candidate: [ 1  2  1 -1  1  2  1 -1  2  1  0  0  1  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 59050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  1  0 -1  0  1  0 -1  0  0  1  0  0] (Indices: [0, 2, 3, 6, 7, 9, 10, 13, 14, 18, 19]), Candidate: [ 1  2  1 -1  1  2  1 -1  2  1 -1  1  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 59100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  1 -1  1  0 -1  1 -1  0  0  1  0  0] (Indices: [0, 2, 3, 6, 7, 9, 11, 12, 14, 18, 19]), Candidate: [ 1  2  1 -1  1  2  1 -1  2  0  1  1  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 59150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  1 -1  0  1  0  0 -1  1  0 -1  0  1] (Indices: [0, 2, 3, 6, 7, 9, 12, 13, 14, 16, 17]), Candidate: [ 1  2  1 -1  1  2  1 -1  2  0  0  2  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 59200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  1 -1  0  0  0  1 -1  1  0  0  0  0] (Indices: [0, 2, 3, 6, 7, 9, 14, 16, 17, 18, 19]), Candidate: [ 1  2  1 -1  1  2  1 -1  2  0  0  1  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 59250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  0  1  0 -1  1 -1  1 -1  1  0 -1  1] (Indices: [0, 2, 3, 6, 7, 10, 11, 13, 15, 17, 18]), Candidate: [ 1  2  1 -1  1  2  1 -1  1  2  0  0  2  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 59300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  0  1 -1  1 -1  1 -1  1 -1  1  0  0] (Indices: [0, 2, 3, 6, 7, 10, 12, 14, 16, 18, 19]), Candidate: [ 1  2  1 -1  1  2  1 -1  1  2 -1  2  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 59350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  0  0  1  0 -1  1  0  0 -1  0  1  0] (Indices: [0, 2, 3, 6, 7, 11, 12, 14, 15, 16, 19]), Candidate: [ 1  2  1 -1  1  2  1 -1  1  1  1  1  0  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 59400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  0  0  0  1 -1  1  0  0  0 -1  1  0] (Indices: [0, 2, 3, 6, 7, 12, 14, 15, 16, 17, 19]), Candidate: [ 1  2  1 -1  1  2  1 -1  1  1  0  2  0  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 59450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1  0  0  0 -1  0  1  0 -1  0  1 -1  1] (Indices: [0, 2, 3, 6, 8, 9, 10, 11, 14, 15, 18]), Candidate: [ 1  2  1 -1  1  2  0  1  1  1  0  0  1  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1  0  0 -1  1 -1  0  0  1  0 -1  1  0] (Indices: [0, 2, 3, 6, 8, 9, 10, 12, 16, 17, 19]), Candidate: [ 1  2  1 -1  1  2  0  1  1  1 -1  2  0  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 59550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1  0 -1  1  0  0 -1  0  0  1  0 -1  1] (Indices: [0, 2, 3, 6, 8, 9, 11, 12, 13, 17, 18]), Candidate: [ 1  2  1 -1  1  2  0  1  1  0  1  1  1  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1  0 -1  1 -1  0  1 -1  1  0 -1  1  0] (Indices: [0, 2, 3, 6, 8, 9, 11, 14, 16, 17, 19]), Candidate: [ 1  2  1 -1  1  2  0  1  1  0  1  0  1  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 59650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1  0 -1  0  0  1  0 -1  1  0 -1  1  0] (Indices: [0, 2, 3, 6, 8, 9, 13, 14, 16, 17, 19]), Candidate: [ 1  2  1 -1  1  2  0  1  1  0  0  1  2  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 59700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1 -1  1  0 -1  1  0  0 -1  1 -1  0  1] (Indices: [0, 2, 3, 6, 8, 10, 11, 13, 14, 15, 17]), Candidate: [ 1  2  1 -1  1  2  0  1  0  2  0  0  2  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1 -1  1 -1  1  0 -1  0  1  0  0 -1  1] (Indices: [0, 2, 3, 6, 8, 10, 12, 13, 16, 17, 18]), Candidate: [ 1  2  1 -1  1  2  0  1  0  2 -1  2  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 59800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1 -1  0  1  0  0 -1  1  0  0 -1  0  1] (Indices: [0, 2, 3, 6, 8, 11, 12, 13, 15, 16, 17]), Candidate: [ 1  2  1 -1  1  2  0  1  0  1  1  1  1  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1 -1  0  0  1  0  0  0 -1  1 -1  1  0] (Indices: [0, 2, 3, 6, 8, 12, 13, 14, 15, 17, 19]), Candidate: [ 1  2  1 -1  1  2  0  1  0  1  0  2  1  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  1  0  0  0 -1  0  1  0 -1  1 -1  1] (Indices: [0, 2, 3, 6, 9, 10, 11, 12, 15, 16, 18]), Candidate: [ 1  2  1 -1  1  2  0  0  2  1  0  1  0  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  1  0 -1  1  0  0 -1  1 -1  0  1  0] (Indices: [0, 2, 3, 6, 9, 10, 12, 13, 14, 16, 19]), Candidate: [ 1  2  1 -1  1  2  0  0  2  1 -1  2  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 60000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  1 -1  1  0  0  0  0  0 -1  0  0  1] (Indices: [0, 2, 3, 6, 9, 11, 12, 13, 14, 15, 16]), Candidate: [ 1  2  1 -1  1  2  0  0  2  0  1  1  1  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  1 -1  1 -1  0  1  0  0  0  0 -1  1] (Indices: [0, 2, 3, 6, 9, 11, 14, 15, 16, 17, 18]), Candidate: [ 1  2  1 -1  1  2  0  0  2  0  1  0  1  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  0  1  0  0  0 -1  0  1  0  0 -1  1] (Indices: [0, 2, 3, 6, 10, 11, 12, 13, 16, 17, 18]), Candidate: [ 1  2  1 -1  1  2  0  0  1  2  0  1  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  0  1 -1  1  0 -1  1  0  0  0 -1  1] (Indices: [0, 2, 3, 6, 10, 12, 13, 15, 16, 17, 18]), Candidate: [ 1  2  1 -1  1  2  0  0  1  2 -1  2  1  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 60200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  0  0  0  1  0  0 -1  1  0  0  0  0] (Indices: [0, 2, 3, 6, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  2  1 -1  1  2  0  0  1  1  0  2  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 60250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0  0  0  0 -1  0  0  1  0  0 -1  0  1] (Indices: [0, 2, 3, 7, 8, 9, 10, 11, 15, 16, 17]), Candidate: [ 1  2  1 -1  1  1  2  0  1  1  0  0  1  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0  0  0 -1  0  1  0 -1  1 -1  1 -1  1] (Indices: [0, 2, 3, 7, 8, 9, 10, 13, 14, 16, 18]), Candidate: [ 1  2  1 -1  1  1  2  0  1  1 -1  1  2  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 60350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0  0 -1  1  0 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 2, 3, 7, 8, 9, 11, 12, 14, 16, 18]), Candidate: [ 1  2  1 -1  1  1  2  0  1  0  1  1  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 60400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0  0 -1  0  1  0  0  0  0 -1  0  0  1] (Indices: [0, 2, 3, 7, 8, 9, 12, 13, 14, 15, 16]), Candidate: [ 1  2  1 -1  1  1  2  0  1  0  0  2  1  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0  0 -1  0  0  0  1  0  0  0  0 -1  1] (Indices: [0, 2, 3, 7, 8, 9, 14, 15, 16, 17, 18]), Candidate: [ 1  2  1 -1  1  1  2  0  1  0  0  1  1  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0 -1  1  0 -1  1  0 -1  0  0  1  0  0] (Indices: [0, 2, 3, 7, 8, 10, 11, 13, 14, 18, 19]), Candidate: [ 1  2  1 -1  1  1  2  0  0  2  0  0  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 60550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0 -1  1 -1  1 -1  1  0 -1  1 -1  1  0] (Indices: [0, 2, 3, 7, 8, 10, 12, 14, 15, 17, 19]), Candidate: [ 1  2  1 -1  1  1  2  0  0  2 -1  2  0  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 60600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0 -1  0  1  0  0 -1  0  1 -1  1  0  0] (Indices: [0, 2, 3, 7, 8, 11, 12, 13, 16, 18, 19]), Candidate: [ 1  2  1 -1  1  1  2  0  0  1  1  1  1  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0 -1  0  0  1  0 -1  1  0 -1  1  0  0] (Indices: [0, 2, 3, 7, 8, 12, 13, 15, 16, 18, 19]), Candidate: [ 1  2  1 -1  1  1  2  0  0  1  0  2  1  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  1  0  0  0 -1  0  0  0  1  0  0  0] (Indices: [0, 2, 3, 7, 9, 10, 11, 12, 17, 18, 19]), Candidate: [ 1  2  1 -1  1  1  2 -1  2  1  0  1  0  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 60750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  1  0 -1  1  0 -1  1 -1  1 -1  1  0] (Indices: [0, 2, 3, 7, 9, 10, 12, 13, 15, 17, 19]), Candidate: [ 1  2  1 -1  1  1  2 -1  2  1 -1  2  1  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 60800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  1 -1  1  0  0  0 -1  0  1 -1  1  0] (Indices: [0, 2, 3, 7, 9, 11, 12, 13, 14, 17, 19]), Candidate: [ 1  2  1 -1  1  1  2 -1  2  0  1  1  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 60850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  1 -1  0  1  0  0  0  0 -1  0  1  0] (Indices: [0, 2, 3, 7, 9, 12, 13, 14, 15, 16, 19]), Candidate: [ 1  2  1 -1  1  1  2 -1  2  0  0  2  1  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 60900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  0  1  0  0 -1  1  0 -1  1 -1  1  0] (Indices: [0, 2, 3, 7, 10, 11, 12, 14, 15, 17, 19]), Candidate: [ 1  2  1 -1  1  1  2 -1  1  2  0  1  0  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 60950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  0  1 -1  1 -1  1  0 -1  1  0  0  0] (Indices: [0, 2, 3, 7, 10, 12, 14, 15, 17, 18, 19]), Candidate: [ 1  2  1 -1  1  1  2 -1  1  2 -1  2  0  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 61000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1  0  0  0  0  0  0 -1  0  0  0  1  0] (Indices: [0, 2, 3, 8, 9, 10, 11, 12, 13, 14, 19]), Candidate: [ 1  2  1 -1  1  1  1  1  1  1  0  1  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 61050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1  0  0  0 -1  1 -1  0  0  1  0  0  0] (Indices: [0, 2, 3, 8, 9, 10, 11, 13, 17, 18, 19]), Candidate: [ 1  2  1 -1  1  1  1  1  1  1  0  0  2  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1  0  0 -1  1 -1  0  0  1  0  0  0  0] (Indices: [0, 2, 3, 8, 9, 10, 12, 16, 17, 18, 19]), Candidate: [ 1  2  1 -1  1  1  1  1  1  1 -1  2  0  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 61150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1  0 -1  1  0 -1  1 -1  1 -1  1  0  0] (Indices: [0, 2, 3, 8, 9, 11, 12, 14, 16, 18, 19]), Candidate: [ 1  2  1 -1  1  1  1  1  1  0  1  1  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 61200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1  0 -1  0  0  1  0  0  0  0 -1  1  0] (Indices: [0, 2, 3, 8, 9, 13, 14, 15, 16, 17, 19]), Candidate: [ 1  2  1 -1  1  1  1  1  1  0  0  1  2  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1 -1  1  0 -1  1  0 -1  0  1  0  0  0] (Indices: [0, 2, 3, 8, 10, 11, 13, 14, 17, 18, 19]), Candidate: [ 1  2  1 -1  1  1  1  1  0  2  0  0  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 61300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1 -1  0  1  0  0 -1  1  0  0  0 -1  1] (Indices: [0, 2, 3, 8, 11, 12, 13, 15, 16, 17, 18]), Candidate: [ 1  2  1 -1  1  1  1  1  0  1  1  1  1  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  1  0  0  0 -1  1  0 -1  1 -1  1  0] (Indices: [0, 2, 3, 9, 10, 11, 12, 14, 15, 17, 19]), Candidate: [ 1  2  1 -1  1  1  1  0  2  1  0  1  0  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  1  0 -1  1 -1  1  0 -1  1  0  0  0] (Indices: [0, 2, 3, 9, 10, 12, 14, 15, 17, 18, 19]), Candidate: [ 1  2  1 -1  1  1  1  0  2  1 -1  2  0  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 61450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  0  1  0  0  0  0  0 -1  1 -1  1  0] (Indices: [0, 2, 3, 10, 11, 12, 13, 14, 15, 17, 19]), Candidate: [ 1  2  1 -1  1  1  1  0  1  2  0  1  1  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0  0  0 -1  1 -1  1 -1  0  0  0  0  1] (Indices: [0, 2, 4, 5, 6, 7, 8, 9, 10, 12, 14]), Candidate: [ 1  2  0  1  1  1  1  0  1  1 -1  2  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 61550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0  0 -1  1 -1  0  0  0  1 -1  1 -1  1] (Indices: [0, 2, 4, 5, 6, 7, 8, 9, 11, 16, 18]), Candidate: [1 2 0 1 1 1 1 0 1 0 1 0 1 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 61600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0  0 -1  0  0  0  1 -1  0  0  1  0  0] (Indices: [0, 2, 4, 5, 6, 7, 8, 9, 14, 18, 19]), Candidate: [ 1  2  0  1  1  1  1  0  1  0  0  1  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0 -1  1 -1  1 -1  0  1  0 -1  0  0  1] (Indices: [0, 2, 4, 5, 6, 7, 8, 10, 12, 15, 16]), Candidate: [ 1  2  0  1  1  1  1  0  0  2 -1  2  0  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0 -1  0  1  0  0 -1  0  0  0  0  1  0] (Indices: [0, 2, 4, 5, 6, 7, 8, 11, 12, 13, 19]), Candidate: [1 2 0 1 1 1 1 0 0 1 1 1 1 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 61750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0 -1  0  1 -1  0  0  0  0  1  0  0  0] (Indices: [0, 2, 4, 5, 6, 7, 8, 11, 17, 18, 19]), Candidate: [1 2 0 1 1 1 1 0 0 1 1 0 1 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 61800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0 -1  0  0  0  1 -1  1 -1  1 -1  1  0] (Indices: [0, 2, 4, 5, 6, 7, 8, 13, 15, 17, 19]), Candidate: [1 2 0 1 1 1 1 0 0 1 0 1 2 0 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 61850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  1  0 -1  1  0 -1  1 -1  0  0  0  1] (Indices: [0, 2, 4, 5, 6, 7, 9, 10, 12, 13, 15]), Candidate: [ 1  2  0  1  1  1  1 -1  2  1 -1  2  1  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 61900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  1  0 -1  0  0  0  1 -1  0  1  0  0] (Indices: [0, 2, 4, 5, 6, 7, 9, 10, 15, 18, 19]), Candidate: [ 1  2  0  1  1  1  1 -1  2  1 -1  1  1  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 61950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  1 -1  1 -1  0  1 -1  0  0  1  0  0] (Indices: [0, 2, 4, 5, 6, 7, 9, 11, 14, 18, 19]), Candidate: [ 1  2  0  1  1  1  1 -1  2  0  1  0  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 62000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  1 -1  0  0  1  0 -1  1  0 -1  0  1] (Indices: [0, 2, 4, 5, 6, 7, 9, 13, 14, 16, 17]), Candidate: [ 1  2  0  1  1  1  1 -1  2  0  0  1  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 62050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  0  1  0  0 -1  0  0  0  1 -1  1  0] (Indices: [0, 2, 4, 5, 6, 7, 10, 11, 12, 17, 19]), Candidate: [ 1  2  0  1  1  1  1 -1  1  2  0  1  0  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  0  1 -1  1  0 -1  0  0  1 -1  1  0] (Indices: [0, 2, 4, 5, 6, 7, 10, 12, 13, 17, 19]), Candidate: [ 1  2  0  1  1  1  1 -1  1  2 -1  2  1  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 62150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  0  1 -1  0  0  1 -1  1 -1  1  0  0] (Indices: [0, 2, 4, 5, 6, 7, 10, 14, 16, 18, 19]), Candidate: [ 1  2  0  1  1  1  1 -1  1  2 -1  1  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 62200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  0  0  1 -1  1  0 -1  0  1 -1  1  0] (Indices: [0, 2, 4, 5, 6, 7, 11, 13, 14, 17, 19]), Candidate: [ 1  2  0  1  1  1  1 -1  1  1  1  0  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 62250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  0  0  0  1 -1  1  0 -1  1  0 -1  1] (Indices: [0, 2, 4, 5, 6, 7, 12, 14, 15, 17, 18]), Candidate: [ 1  2  0  1  1  1  1 -1  1  1  0  2  0  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1  0  0  0 -1  0  1 -1  0  0  0  1  0] (Indices: [0, 2, 4, 5, 6, 8, 9, 10, 11, 14, 19]), Candidate: [ 1  2  0  1  1  1  0  1  1  1  0  0  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1  0  0 -1  0  0  1  0 -1  0  0  1  0] (Indices: [0, 2, 4, 5, 6, 8, 9, 10, 14, 15, 19]), Candidate: [ 1  2  0  1  1  1  0  1  1  1 -1  1  1  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1  0 -1  1 -1  1 -1  0  0  1  0 -1  1] (Indices: [0, 2, 4, 5, 6, 8, 9, 11, 13, 17, 18]), Candidate: [1 2 0 1 1 1 0 1 1 0 1 0 2 0 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 62450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1  0 -1  0  1 -1  0  1  0 -1  0  1  0] (Indices: [0, 2, 4, 5, 6, 8, 9, 12, 15, 16, 19]), Candidate: [1 2 0 1 1 1 0 1 1 0 0 2 0 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 62500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1 -1  1  0  0 -1  1 -1  1 -1  0  0  1] (Indices: [0, 2, 4, 5, 6, 8, 10, 11, 12, 14, 16]), Candidate: [ 1  2  0  1  1  1  0  1  0  2  0  1  0  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1 -1  1 -1  1  0  0 -1  1 -1  0  0  1] (Indices: [0, 2, 4, 5, 6, 8, 10, 12, 13, 14, 16]), Candidate: [ 1  2  0  1  1  1  0  1  0  2 -1  2  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 62600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1 -1  1 -1  0  1 -1  0  1  0  0 -1  1] (Indices: [0, 2, 4, 5, 6, 8, 10, 13, 16, 17, 18]), Candidate: [ 1  2  0  1  1  1  0  1  0  2 -1  1  2  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1 -1  0  1  0 -1  0  0  1  0  0 -1  1] (Indices: [0, 2, 4, 5, 6, 8, 11, 12, 16, 17, 18]), Candidate: [1 2 0 1 1 1 0 1 0 1 1 1 0 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 62700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1 -1  0  0  1  0 -1  1  0 -1  1 -1  1] (Indices: [0, 2, 4, 5, 6, 8, 12, 13, 15, 16, 18]), Candidate: [1 2 0 1 1 1 0 1 0 1 0 2 1 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 62750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  1  0  0  0  0 -1  0  0  0  0  1  0] (Indices: [0, 2, 4, 5, 6, 9, 10, 11, 12, 13, 19]), Candidate: [1 2 0 1 1 1 0 0 2 1 0 1 1 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 62800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  1  0  0 -1  0  0  0  0  1  0  0  0] (Indices: [0, 2, 4, 5, 6, 9, 10, 11, 17, 18, 19]), Candidate: [1 2 0 1 1 1 0 0 2 1 0 0 1 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 62850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  1  0 -1  0  1 -1  1 -1  1 -1  1  0] (Indices: [0, 2, 4, 5, 6, 9, 10, 13, 15, 17, 19]), Candidate: [ 1  2  0  1  1  1  0  0  2  1 -1  1  2  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  1 -1  1  0 -1  0  1 -1  1 -1  1  0] (Indices: [0, 2, 4, 5, 6, 9, 11, 12, 15, 17, 19]), Candidate: [1 2 0 1 1 1 0 0 2 0 1 1 0 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 62950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  1 -1  0  1  0  0 -1  0  0  1  0  0] (Indices: [0, 2, 4, 5, 6, 9, 12, 13, 14, 18, 19]), Candidate: [ 1  2  0  1  1  1  0  0  2  0  0  2  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  0  1  0  0  0  0 -1  0  0  1 -1  1] (Indices: [0, 2, 4, 5, 6, 10, 11, 12, 13, 14, 18]), Candidate: [ 1  2  0  1  1  1  0  0  1  2  0  1  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  0  1  0 -1  1 -1  0  1 -1  1  0  0] (Indices: [0, 2, 4, 5, 6, 10, 11, 13, 16, 18, 19]), Candidate: [1 2 0 1 1 1 0 0 1 2 0 0 2 0 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 63100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  0  1 -1  1 -1  0  1 -1  1  0  0  0] (Indices: [0, 2, 4, 5, 6, 10, 12, 15, 17, 18, 19]), Candidate: [ 1  2  0  1  1  1  0  0  1  2 -1  2  0  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  0  0  1  0 -1  1 -1  1  0 -1  1  0] (Indices: [0, 2, 4, 5, 6, 11, 12, 14, 16, 17, 19]), Candidate: [ 1  2  0  1  1  1  0  0  1  1  1  1  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  0  0  0  0  1  0  0  0  0  0 -1  1] (Indices: [0, 2, 4, 5, 6, 13, 14, 15, 16, 17, 18]), Candidate: [1 2 0 1 1 1 0 0 1 1 0 1 2 1 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 63250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0  0  0 -1  1 -1  0  0  1  0 -1  0  1] (Indices: [0, 2, 4, 5, 7, 8, 9, 10, 12, 16, 17]), Candidate: [ 1  2  0  1  1  0  2  0  1  1 -1  2  0  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0  0 -1  1  0 -1  1 -1  0  0  1 -1  1] (Indices: [0, 2, 4, 5, 7, 8, 9, 11, 12, 14, 18]), Candidate: [ 1  2  0  1  1  0  2  0  1  0  1  1  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0  0 -1  0  1  0  0 -1  0  0  1 -1  1] (Indices: [0, 2, 4, 5, 7, 8, 9, 12, 13, 14, 18]), Candidate: [ 1  2  0  1  1  0  2  0  1  0  0  2  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0  0 -1  0  0  1 -1  0  1 -1  1  0  0] (Indices: [0, 2, 4, 5, 7, 8, 9, 13, 16, 18, 19]), Candidate: [1 2 0 1 1 0 2 0 1 0 0 1 2 0 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 63450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0 -1  1  0 -1  1 -1  0  0  1  0 -1  1] (Indices: [0, 2, 4, 5, 7, 8, 10, 11, 13, 17, 18]), Candidate: [1 2 0 1 1 0 2 0 0 2 0 0 2 0 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 63500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0 -1  1 -1  1 -1  0  1  0 -1  0  1  0] (Indices: [0, 2, 4, 5, 7, 8, 10, 12, 15, 16, 19]), Candidate: [ 1  2  0  1  1  0  2  0  0  2 -1  2  0  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0 -1  0  1  0  0 -1  1 -1  0  1 -1  1] (Indices: [0, 2, 4, 5, 7, 8, 11, 12, 13, 15, 18]), Candidate: [1 2 0 1 1 0 2 0 0 1 1 1 1 0 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 63600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0 -1  0  1 -1  0  1  0  0 -1  0  1  0] (Indices: [0, 2, 4, 5, 7, 8, 11, 14, 15, 16, 19]), Candidate: [1 2 0 1 1 0 2 0 0 1 1 0 1 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 63650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0 -1  0  0  0  1  0  0  0 -1  0  1  0] (Indices: [0, 2, 4, 5, 7, 8, 13, 14, 15, 16, 19]), Candidate: [1 2 0 1 1 0 2 0 0 1 0 1 2 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 63700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  1  0  0 -1  1 -1  0  1 -1  1 -1  1] (Indices: [0, 2, 4, 5, 7, 9, 10, 11, 13, 16, 18]), Candidate: [ 1  2  0  1  1  0  2 -1  2  1  0  0  2  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  1  0 -1  1 -1  0  1  0  0 -1  0  1] (Indices: [0, 2, 4, 5, 7, 9, 10, 12, 15, 16, 17]), Candidate: [ 1  2  0  1  1  0  2 -1  2  1 -1  2  0  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 63800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  1 -1  1  0  0 -1  1  0 -1  0  0  1] (Indices: [0, 2, 4, 5, 7, 9, 11, 12, 13, 15, 16]), Candidate: [ 1  2  0  1  1  0  2 -1  2  0  1  1  1  0  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  1 -1  1 -1  0  1  0  0  0 -1  0  1] (Indices: [0, 2, 4, 5, 7, 9, 11, 14, 15, 16, 17]), Candidate: [ 1  2  0  1  1  0  2 -1  2  0  1  0  1  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  1 -1  0  0  1  0  0  0  0 -1  0  1] (Indices: [0, 2, 4, 5, 7, 9, 13, 14, 15, 16, 17]), Candidate: [ 1  2  0  1  1  0  2 -1  2  0  0  1  2  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  0  1  0  0 -1  0  1 -1  1 -1  1  0] (Indices: [0, 2, 4, 5, 7, 10, 11, 12, 15, 17, 19]), Candidate: [ 1  2  0  1  1  0  2 -1  1  2  0  1  0  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  0  1 -1  1  0  0 -1  0  0  1  0  0] (Indices: [0, 2, 4, 5, 7, 10, 12, 13, 14, 18, 19]), Candidate: [ 1  2  0  1  1  0  2 -1  1  2 -1  2  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 64050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  0  0  1  0  0  0  0 -1  0  0  1  0] (Indices: [0, 2, 4, 5, 7, 11, 12, 13, 14, 15, 19]), Candidate: [ 1  2  0  1  1  0  2 -1  1  1  1  1  1  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  0  0  1 -1  0  1  0 -1  1  0  0  0] (Indices: [0, 2, 4, 5, 7, 11, 14, 15, 17, 18, 19]), Candidate: [ 1  2  0  1  1  0  2 -1  1  1  1  0  1  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1  0  0  0  0 -1  0  0  0  1 -1  1  0] (Indices: [0, 2, 4, 5, 8, 9, 10, 11, 12, 17, 19]), Candidate: [1 2 0 1 1 0 1 1 1 1 0 1 0 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 64200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1  0  0 -1  1  0 -1  0  0  1 -1  1  0] (Indices: [0, 2, 4, 5, 8, 9, 10, 12, 13, 17, 19]), Candidate: [ 1  2  0  1  1  0  1  1  1  1 -1  2  1  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1  0  0 -1  0  0  1 -1  1 -1  1  0  0] (Indices: [0, 2, 4, 5, 8, 9, 10, 14, 16, 18, 19]), Candidate: [ 1  2  0  1  1  0  1  1  1  1 -1  1  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 64300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1  0 -1  1 -1  1  0 -1  0  1 -1  1  0] (Indices: [0, 2, 4, 5, 8, 9, 11, 13, 14, 17, 19]), Candidate: [ 1  2  0  1  1  0  1  1  1  0  1  0  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1  0 -1  0  1 -1  1  0 -1  1  0 -1  1] (Indices: [0, 2, 4, 5, 8, 9, 12, 14, 15, 17, 18]), Candidate: [1 2 0 1 1 0 1 1 1 0 0 2 0 2 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 64400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1 -1  1  0  0 -1  1  0 -1  0  1 -1  1] (Indices: [0, 2, 4, 5, 8, 10, 11, 12, 14, 15, 18]), Candidate: [1 2 0 1 1 0 1 1 0 2 0 1 0 2 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 64450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1 -1  1  0 -1  0  0  1  0 -1  1  0  0] (Indices: [0, 2, 4, 5, 8, 10, 11, 15, 16, 18, 19]), Candidate: [1 2 0 1 1 0 1 1 0 2 0 0 1 1 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 64500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1 -1  1 -1  0  1 -1  1  0 -1  1  0  0] (Indices: [0, 2, 4, 5, 8, 10, 13, 15, 16, 18, 19]), Candidate: [ 1  2  0  1  1  0  1  1  0  2 -1  1  2  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1 -1  0  1 -1  1  0 -1  1  0  0 -1  1] (Indices: [0, 2, 4, 5, 8, 11, 13, 14, 16, 17, 18]), Candidate: [ 1  2  0  1  1  0  1  1  0  1  1  0  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  1  0  0  0  0 -1  1 -1  0  1 -1  1] (Indices: [0, 2, 4, 5, 9, 10, 11, 12, 13, 15, 18]), Candidate: [1 2 0 1 1 0 1 0 2 1 0 1 1 0 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 64650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  1  0  0 -1  0  1  0  0 -1  0  1  0] (Indices: [0, 2, 4, 5, 9, 10, 11, 14, 15, 16, 19]), Candidate: [1 2 0 1 1 0 1 0 2 1 0 0 1 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 64700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  1  0 -1  0  1  0  0  0 -1  0  1  0] (Indices: [0, 2, 4, 5, 9, 10, 13, 14, 15, 16, 19]), Candidate: [ 1  2  0  1  1  0  1  0  2  1 -1  1  2  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  1 -1  1  0 -1  0  1  0  0 -1  1  0] (Indices: [0, 2, 4, 5, 9, 11, 12, 15, 16, 17, 19]), Candidate: [1 2 0 1 1 0 1 0 2 0 1 1 0 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 64800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  1 -1  0  0  1  0 -1  1  0  0  0  0] (Indices: [0, 2, 4, 5, 9, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  2  0  1  1  0  1  0  2  0  0  1  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  0  1  0 -1  1 -1  1  0 -1  1  0  0] (Indices: [0, 2, 4, 5, 10, 11, 13, 15, 16, 18, 19]), Candidate: [1 2 0 1 1 0 1 0 1 2 0 0 2 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 64900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  0  0  1  0  0 -1  1 -1  1  0  0  0] (Indices: [0, 2, 4, 5, 11, 12, 13, 15, 17, 18, 19]), Candidate: [1 2 0 1 1 0 1 0 1 1 1 1 1 0 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 64950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0  0  0  0 -1  0  0  0  0  0  1  0  0] (Indices: [0, 2, 4, 6, 7, 8, 9, 10, 11, 18, 19]), Candidate: [1 2 0 1 0 2 1 0 1 1 0 0 1 1 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 65000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0  0  0 -1  0  0  0  1 -1  1  0 -1  1] (Indices: [0, 2, 4, 6, 7, 8, 9, 10, 15, 17, 18]), Candidate: [ 1  2  0  1  0  2  1  0  1  1 -1  1  1  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0  0 -1  1 -1  0  1 -1  0  1  0 -1  1] (Indices: [0, 2, 4, 6, 7, 8, 9, 11, 14, 17, 18]), Candidate: [ 1  2  0  1  0  2  1  0  1  0  1  0  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0  0 -1  0  0  1  0  0 -1  0  1 -1  1] (Indices: [0, 2, 4, 6, 7, 8, 9, 13, 14, 15, 18]), Candidate: [1 2 0 1 0 2 1 0 1 0 0 1 2 1 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 65150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0 -1  1  0  0 -1  0  0  1 -1  0  1  0] (Indices: [0, 2, 4, 6, 7, 8, 10, 11, 12, 16, 19]), Candidate: [1 2 0 1 0 2 1 0 0 2 0 1 0 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 65200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0 -1  1 -1  1  0 -1  0  1 -1  0  1  0] (Indices: [0, 2, 4, 6, 7, 8, 10, 12, 13, 16, 19]), Candidate: [ 1  2  0  1  0  2  1  0  0  2 -1  2  1  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0 -1  1 -1  0  0  1 -1  1  0  0 -1  1] (Indices: [0, 2, 4, 6, 7, 8, 10, 14, 16, 17, 18]), Candidate: [ 1  2  0  1  0  2  1  0  0  2 -1  1  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 65300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0 -1  0  1 -1  1  0 -1  1 -1  0  1  0] (Indices: [0, 2, 4, 6, 7, 8, 11, 13, 14, 16, 19]), Candidate: [ 1  2  0  1  0  2  1  0  0  1  1  0  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0 -1  0  0  1 -1  1  0  0 -1  1 -1  1] (Indices: [0, 2, 4, 6, 7, 8, 12, 14, 15, 16, 18]), Candidate: [1 2 0 1 0 2 1 0 0 1 0 2 0 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 65400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  1  0  0  0 -1  0  0  1  0 -1  0  1] (Indices: [0, 2, 4, 6, 7, 9, 10, 11, 12, 16, 17]), Candidate: [ 1  2  0  1  0  2  1 -1  2  1  0  1  0  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  1  0 -1  1  0 -1  0  1  0 -1  0  1] (Indices: [0, 2, 4, 6, 7, 9, 10, 12, 13, 16, 17]), Candidate: [ 1  2  0  1  0  2  1 -1  2  1 -1  2  1  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 65500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  1  0 -1  0  0  1  0 -1  1 -1  1  0] (Indices: [0, 2, 4, 6, 7, 9, 10, 14, 15, 17, 19]), Candidate: [ 1  2  0  1  0  2  1 -1  2  1 -1  1  1  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 65550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  1 -1  1 -1  1  0 -1  1  0 -1  0  1] (Indices: [0, 2, 4, 6, 7, 9, 11, 13, 14, 16, 17]), Candidate: [ 1  2  0  1  0  2  1 -1  2  0  1  0  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 65600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  1 -1  0  1  0 -1  0  0  1  0  0  0] (Indices: [0, 2, 4, 6, 7, 9, 12, 13, 17, 18, 19]), Candidate: [ 1  2  0  1  0  2  1 -1  2  0  0  2  1  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  0  1  0  0  0 -1  0  0  1 -1  1  0] (Indices: [0, 2, 4, 6, 7, 10, 11, 12, 13, 17, 19]), Candidate: [ 1  2  0  1  0  2  1 -1  1  2  0  1  1  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  0  1  0 -1  0  1 -1  1 -1  1  0  0] (Indices: [0, 2, 4, 6, 7, 10, 11, 14, 16, 18, 19]), Candidate: [ 1  2  0  1  0  2  1 -1  1  2  0  0  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 65750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  0  1 -1  0  1  0 -1  1 -1  1  0  0] (Indices: [0, 2, 4, 6, 7, 10, 13, 14, 16, 18, 19]), Candidate: [ 1  2  0  1  0  2  1 -1  1  2 -1  1  2  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 65800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  0  0  1 -1  1  0  0  0 -1  0  1  0] (Indices: [0, 2, 4, 6, 7, 11, 13, 14, 15, 16, 19]), Candidate: [ 1  2  0  1  0  2  1 -1  1  1  1  0  2  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1  0  0  0  0  0 -1  0  0  1 -1  0  1] (Indices: [0, 2, 4, 6, 8, 9, 10, 11, 12, 13, 17]), Candidate: [1 2 0 1 0 2 0 1 1 1 0 1 1 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 65900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1  0  0  0 -1  0  0  0  1  0 -1  1  0] (Indices: [0, 2, 4, 6, 8, 9, 10, 11, 16, 17, 19]), Candidate: [1 2 0 1 0 2 0 1 1 1 0 0 1 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 65950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1  0  0 -1  0  1 -1  1  0 -1  0  1  0] (Indices: [0, 2, 4, 6, 8, 9, 10, 13, 15, 16, 19]), Candidate: [ 1  2  0  1  0  2  0  1  1  1 -1  1  2  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1  0 -1  1  0 -1  0  1  0 -1  0  1  0] (Indices: [0, 2, 4, 6, 8, 9, 11, 12, 15, 16, 19]), Candidate: [1 2 0 1 0 2 0 1 1 0 1 1 0 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 66050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1  0 -1  0  1  0  0 -1  0  1  0 -1  1] (Indices: [0, 2, 4, 6, 8, 9, 12, 13, 14, 17, 18]), Candidate: [ 1  2  0  1  0  2  0  1  1  0  0  2  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1 -1  1  0  0  0  0 -1  1 -1  0  0  1] (Indices: [0, 2, 4, 6, 8, 10, 11, 12, 13, 14, 16]), Candidate: [ 1  2  0  1  0  2  0  1  0  2  0  1  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1 -1  1  0 -1  1 -1  0  1  0  0 -1  1] (Indices: [0, 2, 4, 6, 8, 10, 11, 13, 16, 17, 18]), Candidate: [1 2 0 1 0 2 0 1 0 2 0 0 2 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 66200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1 -1  1 -1  1 -1  0  1  0  0 -1  1  0] (Indices: [0, 2, 4, 6, 8, 10, 12, 15, 16, 17, 19]), Candidate: [ 1  2  0  1  0  2  0  1  0  2 -1  2  0  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1 -1  0  1  0 -1  1  0 -1  0  1  0  0] (Indices: [0, 2, 4, 6, 8, 11, 12, 14, 15, 18, 19]), Candidate: [1 2 0 1 0 2 0 1 0 1 1 1 0 2 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 66300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1 -1  0  0  1 -1  1 -1  1  0  0  0  0] (Indices: [0, 2, 4, 6, 8, 12, 14, 16, 17, 18, 19]), Candidate: [ 1  2  0  1  0  2  0  1  0  1  0  2  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  1  0  0 -1  1  0 -1  1 -1  0  1  0] (Indices: [0, 2, 4, 6, 9, 10, 11, 13, 14, 16, 19]), Candidate: [ 1  2  0  1  0  2  0  0  2  1  0  0  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  1  0 -1  1 -1  1  0  0 -1  1 -1  1] (Indices: [0, 2, 4, 6, 9, 10, 12, 14, 15, 16, 18]), Candidate: [ 1  2  0  1  0  2  0  0  2  1 -1  2  0  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  1 -1  1  0  0 -1  1 -1  0  1  0  0] (Indices: [0, 2, 4, 6, 9, 11, 12, 13, 15, 18, 19]), Candidate: [1 2 0 1 0 2 0 0 2 0 1 1 1 0 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 66500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  1 -1  0  1  0  0 -1  0  1  0  0  0] (Indices: [0, 2, 4, 6, 9, 12, 13, 14, 17, 18, 19]), Candidate: [ 1  2  0  1  0  2  0  0  2  0  0  2  1  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  0  1  0  0 -1  0  1  0  0 -1  1  0] (Indices: [0, 2, 4, 6, 10, 11, 12, 15, 16, 17, 19]), Candidate: [1 2 0 1 0 2 0 0 1 2 0 1 0 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 66600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  0  1 -1  0  1  0 -1  1  0  0  0  0] (Indices: [0, 2, 4, 6, 10, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  2  0  1  0  2  0  0  1  2 -1  1  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 66650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0  0  0  0  0 -1  0  1  0 -1  0  0  1] (Indices: [0, 2, 4, 7, 8, 9, 10, 11, 12, 15, 16]), Candidate: [1 2 0 1 0 1 2 0 1 1 0 1 0 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 66700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0  0  0 -1  1  0 -1  1  0 -1  0  0  1] (Indices: [0, 2, 4, 7, 8, 9, 10, 12, 13, 15, 16]), Candidate: [ 1  2  0  1  0  1  2  0  1  1 -1  2  1  0  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0  0  0 -1  0  0  1  0  0  0 -1  0  1] (Indices: [0, 2, 4, 7, 8, 9, 10, 14, 15, 16, 17]), Candidate: [ 1  2  0  1  0  1  2  0  1  1 -1  1  1  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0  0 -1  1 -1  1  0  0  0 -1  0  0  1] (Indices: [0, 2, 4, 7, 8, 9, 11, 13, 14, 15, 16]), Candidate: [1 2 0 1 0 1 2 0 1 0 1 0 2 1 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 66850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0  0 -1  0  1  0 -1  1 -1  0  1  0  0] (Indices: [0, 2, 4, 7, 8, 9, 12, 13, 15, 18, 19]), Candidate: [1 2 0 1 0 1 2 0 1 0 0 2 1 0 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 66900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0 -1  1  0  0  0 -1  0  1  0 -1  0  1] (Indices: [0, 2, 4, 7, 8, 10, 11, 12, 13, 16, 17]), Candidate: [1 2 0 1 0 1 2 0 0 2 0 1 1 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 66950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0 -1  1  0 -1  0  1  0 -1  1 -1  1  0] (Indices: [0, 2, 4, 7, 8, 10, 11, 14, 15, 17, 19]), Candidate: [1 2 0 1 0 1 2 0 0 2 0 0 1 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 67000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0 -1  1 -1  0  1  0  0 -1  1 -1  1  0] (Indices: [0, 2, 4, 7, 8, 10, 13, 14, 15, 17, 19]), Candidate: [ 1  2  0  1  0  1  2  0  0  2 -1  1  2  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0 -1  0  1  0 -1  0  1 -1  1  0  0  0] (Indices: [0, 2, 4, 7, 8, 11, 12, 15, 17, 18, 19]), Candidate: [1 2 0 1 0 1 2 0 0 1 1 1 0 1 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 67100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0 -1  0  0  0  0  1  0  0  0  0  0  0] (Indices: [0, 2, 4, 7, 8, 14, 15, 16, 17, 18, 19]), Candidate: [1 2 0 1 0 1 2 0 0 1 0 1 1 2 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 67150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  1  0  0 -1  1 -1  1 -1  1 -1  1  0] (Indices: [0, 2, 4, 7, 9, 10, 11, 13, 15, 17, 19]), Candidate: [ 1  2  0  1  0  1  2 -1  2  1  0  0  2  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  1  0 -1  1 -1  1 -1  0  1  0  0  0] (Indices: [0, 2, 4, 7, 9, 10, 12, 14, 17, 18, 19]), Candidate: [ 1  2  0  1  0  1  2 -1  2  1 -1  2  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 67250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  1 -1  1  0 -1  1  0 -1  1  0 -1  1] (Indices: [0, 2, 4, 7, 9, 11, 12, 14, 15, 17, 18]), Candidate: [ 1  2  0  1  0  1  2 -1  2  0  1  1  0  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  1 -1  0  1 -1  1  0  0 -1  1  0  0] (Indices: [0, 2, 4, 7, 9, 12, 14, 15, 16, 18, 19]), Candidate: [ 1  2  0  1  0  1  2 -1  2  0  0  2  0  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  0  1  0 -1  1  0  0 -1  1 -1  1  0] (Indices: [0, 2, 4, 7, 10, 11, 13, 14, 15, 17, 19]), Candidate: [ 1  2  0  1  0  1  2 -1  1  2  0  0  2  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  0  0  1  0  0  0  0 -1  0  1  0  0] (Indices: [0, 2, 4, 7, 11, 12, 13, 14, 15, 18, 19]), Candidate: [ 1  2  0  1  0  1  2 -1  1  1  1  1  1  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1  0  0  0  0 -1  1 -1  1  0 -1  0  1] (Indices: [0, 2, 4, 8, 9, 10, 11, 12, 14, 16, 17]), Candidate: [ 1  2  0  1  0  1  1  1  1  1  0  1  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1  0  0  0 -1  0  0  0  1  0  0  0  0] (Indices: [0, 2, 4, 8, 9, 10, 11, 16, 17, 18, 19]), Candidate: [1 2 0 1 0 1 1 1 1 1 0 0 1 1 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 67550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1  0  0 -1  0  1 -1  0  1  0  0  0  0] (Indices: [0, 2, 4, 8, 9, 10, 13, 16, 17, 18, 19]), Candidate: [ 1  2  0  1  0  1  1  1  1  1 -1  1  2  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1  0 -1  1 -1  1  0 -1  1 -1  1  0  0] (Indices: [0, 2, 4, 8, 9, 11, 13, 14, 16, 18, 19]), Candidate: [ 1  2  0  1  0  1  1  1  1  0  1  0  2  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1 -1  1  0  0  0  0 -1  0  0  1  0  0] (Indices: [0, 2, 4, 8, 10, 11, 12, 13, 14, 18, 19]), Candidate: [ 1  2  0  1  0  1  1  1  0  2  0  1  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1 -1  1 -1  1  0  0  0 -1  1  0 -1  1] (Indices: [0, 2, 4, 8, 10, 12, 13, 14, 15, 17, 18]), Candidate: [ 1  2  0  1  0  1  1  1  0  2 -1  2  1  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1 -1  0  1 -1  1  0 -1  1  0  0  0  0] (Indices: [0, 2, 4, 8, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  2  0  1  0  1  1  1  0  1  1  0  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  1  0  0 -1  1  0  0 -1  1 -1  1  0] (Indices: [0, 2, 4, 9, 10, 11, 13, 14, 15, 17, 19]), Candidate: [1 2 0 1 0 1 1 0 2 1 0 0 2 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 67850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  1 -1  1  0  0  0  0 -1  0  1  0  0] (Indices: [0, 2, 4, 9, 11, 12, 13, 14, 15, 18, 19]), Candidate: [1 2 0 1 0 1 1 0 2 0 1 1 1 1 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 67900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  0  1  0  0 -1  1 -1  1  0  0  0  0] (Indices: [0, 2, 4, 10, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 1  2  0  1  0  1  1  0  1  2  0  1  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0  0  0  0 -1  0  0  0  1 -1  0  1  0] (Indices: [0, 2, 5, 6, 7, 8, 9, 10, 11, 16, 19]), Candidate: [1 2 0 0 2 1 1 0 1 1 0 0 1 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 68000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0  0  0 -1  0  0  0  1  0  0 -1  0  1] (Indices: [0, 2, 5, 6, 7, 8, 9, 10, 15, 16, 17]), Candidate: [ 1  2  0  0  2  1  1  0  1  1 -1  1  1  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0  0 -1  1 -1  0  1 -1  1  0 -1  0  1] (Indices: [0, 2, 5, 6, 7, 8, 9, 11, 14, 16, 17]), Candidate: [ 1  2  0  0  2  1  1  0  1  0  1  0  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0  0 -1  0  1 -1  0  0  0  1  0  0  0] (Indices: [0, 2, 5, 6, 7, 8, 9, 12, 17, 18, 19]), Candidate: [1 2 0 0 2 1 1 0 1 0 0 2 0 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 68150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0 -1  1  0  0 -1  0  1 -1  0  0  1  0] (Indices: [0, 2, 5, 6, 7, 8, 10, 11, 12, 15, 19]), Candidate: [1 2 0 0 2 1 1 0 0 2 0 1 0 1 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 68200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0 -1  1 -1  1  0 -1  1 -1  0  0  1  0] (Indices: [0, 2, 5, 6, 7, 8, 10, 12, 13, 15, 19]), Candidate: [ 1  2  0  0  2  1  1  0  0  2 -1  2  1  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0 -1  1 -1  0  0  1  0 -1  1  0 -1  1] (Indices: [0, 2, 5, 6, 7, 8, 10, 14, 15, 17, 18]), Candidate: [ 1  2  0  0  2  1  1  0  0  2 -1  1  1  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0 -1  0  1 -1  1  0  0 -1  0  0  1  0] (Indices: [0, 2, 5, 6, 7, 8, 11, 13, 14, 15, 19]), Candidate: [1 2 0 0 2 1 1 0 0 1 1 0 2 1 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 68350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0 -1  0  0  1  0 -1  0  1 -1  1  0  0] (Indices: [0, 2, 5, 6, 7, 8, 12, 13, 16, 18, 19]), Candidate: [1 2 0 0 2 1 1 0 0 1 0 2 1 0 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 68400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  1  0  0  0 -1  0  1 -1  1 -1  0  1] (Indices: [0, 2, 5, 6, 7, 9, 10, 11, 12, 15, 17]), Candidate: [ 1  2  0  0  2  1  1 -1  2  1  0  1  0  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  1  0 -1  1  0 -1  1 -1  1 -1  0  1] (Indices: [0, 2, 5, 6, 7, 9, 10, 12, 13, 15, 17]), Candidate: [ 1  2  0  0  2  1  1 -1  2  1 -1  2  1  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  1  0 -1  0  0  1  0  0 -1  1 -1  1] (Indices: [0, 2, 5, 6, 7, 9, 10, 14, 15, 16, 18]), Candidate: [ 1  2  0  0  2  1  1 -1  2  1 -1  1  1  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  1 -1  1 -1  1  0  0 -1  1 -1  0  1] (Indices: [0, 2, 5, 6, 7, 9, 11, 13, 14, 15, 17]), Candidate: [ 1  2  0  0  2  1  1 -1  2  0  1  0  2  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  1 -1  0  1  0 -1  0  1  0  0 -1  1] (Indices: [0, 2, 5, 6, 7, 9, 12, 13, 16, 17, 18]), Candidate: [ 1  2  0  0  2  1  1 -1  2  0  0  2  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  0  1  0  0  0 -1  0  1 -1  1 -1  1] (Indices: [0, 2, 5, 6, 7, 10, 11, 12, 13, 16, 18]), Candidate: [ 1  2  0  0  2  1  1 -1  1  2  0  1  1  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  0  1  0 -1  0  1  0 -1  0  1  0  0] (Indices: [0, 2, 5, 6, 7, 10, 11, 14, 15, 18, 19]), Candidate: [ 1  2  0  0  2  1  1 -1  1  2  0  0  1  2  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  0  1 -1  0  1  0  0 -1  0  1  0  0] (Indices: [0, 2, 5, 6, 7, 10, 13, 14, 15, 18, 19]), Candidate: [ 1  2  0  0  2  1  1 -1  1  2 -1  1  2  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  0  0  1  0 -1  0  0  1  0  0  0  0] (Indices: [0, 2, 5, 6, 7, 11, 12, 16, 17, 18, 19]), Candidate: [ 1  2  0  0  2  1  1 -1  1  1  1  1  0  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1  0  0  0  0  0  0 -1  0  0  0  0  1] (Indices: [0, 2, 5, 6, 8, 9, 10, 11, 12, 13, 14]), Candidate: [ 1  2  0  0  2  1  0  1  1  1  0  1  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1  0  0  0 -1  0  0  1 -1  1 -1  1  0] (Indices: [0, 2, 5, 6, 8, 9, 10, 11, 15, 17, 19]), Candidate: [1 2 0 0 2 1 0 1 1 1 0 0 1 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 68950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1  0  0 -1  0  1  0 -1  0  0  1  0  0] (Indices: [0, 2, 5, 6, 8, 9, 10, 13, 14, 18, 19]), Candidate: [ 1  2  0  0  2  1  0  1  1  1 -1  1  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 69000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1  0 -1  1  0 -1  1 -1  0  0  1  0  0] (Indices: [0, 2, 5, 6, 8, 9, 11, 12, 14, 18, 19]), Candidate: [ 1  2  0  0  2  1  0  1  1  0  1  1  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1  0 -1  0  1  0  0 -1  1  0 -1  0  1] (Indices: [0, 2, 5, 6, 8, 9, 12, 13, 14, 16, 17]), Candidate: [ 1  2  0  0  2  1  0  1  1  0  0  2  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1  0 -1  0  0  0  1 -1  1  0  0  0  0] (Indices: [0, 2, 5, 6, 8, 9, 14, 16, 17, 18, 19]), Candidate: [ 1  2  0  0  2  1  0  1  1  0  0  1  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1 -1  1  0 -1  1 -1  1 -1  1  0 -1  1] (Indices: [0, 2, 5, 6, 8, 10, 11, 13, 15, 17, 18]), Candidate: [1 2 0 0 2 1 0 1 0 2 0 0 2 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 69200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1 -1  1 -1  1 -1  1 -1  1 -1  1  0  0] (Indices: [0, 2, 5, 6, 8, 10, 12, 14, 16, 18, 19]), Candidate: [ 1  2  0  0  2  1  0  1  0  2 -1  2  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 69250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1 -1  0  1  0 -1  1  0  0 -1  0  1  0] (Indices: [0, 2, 5, 6, 8, 11, 12, 14, 15, 16, 19]), Candidate: [1 2 0 0 2 1 0 1 0 1 1 1 0 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 69300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1 -1  0  0  1 -1  1  0  0  0 -1  1  0] (Indices: [0, 2, 5, 6, 8, 12, 14, 15, 16, 17, 19]), Candidate: [1 2 0 0 2 1 0 1 0 1 0 2 0 2 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 69350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  1  0  0 -1  1  0  0 -1  0  0  1  0] (Indices: [0, 2, 5, 6, 9, 10, 11, 13, 14, 15, 19]), Candidate: [1 2 0 0 2 1 0 0 2 1 0 0 2 1 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 69400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  1  0 -1  1  0 -1  0  1 -1  1  0  0] (Indices: [0, 2, 5, 6, 9, 10, 12, 13, 16, 18, 19]), Candidate: [ 1  2  0  0  2  1  0  0  2  1 -1  2  1  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  1 -1  1  0  0 -1  1  0 -1  0  1  0] (Indices: [0, 2, 5, 6, 9, 11, 12, 13, 15, 16, 19]), Candidate: [1 2 0 0 2 1 0 0 2 0 1 1 1 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 69500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  1 -1  0  1  0  0 -1  1  0  0 -1  1] (Indices: [0, 2, 5, 6, 9, 12, 13, 14, 16, 17, 18]), Candidate: [ 1  2  0  0  2  1  0  0  2  0  0  2  1  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  0  1  0  0 -1  1 -1  1 -1  1  0  0] (Indices: [0, 2, 5, 6, 10, 11, 12, 14, 16, 18, 19]), Candidate: [ 1  2  0  0  2  1  0  0  1  2  0  1  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  0  1 -1  0  1  0  0  0  0 -1  1  0] (Indices: [0, 2, 5, 6, 10, 13, 14, 15, 16, 17, 19]), Candidate: [ 1  2  0  0  2  1  0  0  1  2 -1  1  2  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0  0  0  0  0 -1  1 -1  0  1 -1  0  1] (Indices: [0, 2, 5, 7, 8, 9, 10, 11, 12, 14, 17]), Candidate: [ 1  2  0  0  2  0  2  0  1  1  0  1  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0  0  0 -1  1  0  0 -1  0  1 -1  0  1] (Indices: [0, 2, 5, 7, 8, 9, 10, 12, 13, 14, 17]), Candidate: [ 1  2  0  0  2  0  2  0  1  1 -1  2  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 69750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0  0  0 -1  0  1 -1  0  1  0 -1  1  0] (Indices: [0, 2, 5, 7, 8, 9, 10, 13, 16, 17, 19]), Candidate: [ 1  2  0  0  2  0  2  0  1  1 -1  1  2  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0  0 -1  1  0 -1  0  0  1  0 -1  1  0] (Indices: [0, 2, 5, 7, 8, 9, 11, 12, 16, 17, 19]), Candidate: [1 2 0 0 2 0 2 0 1 0 1 1 0 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 69850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0  0 -1  0  1  0 -1  1  0 -1  0  1  0] (Indices: [0, 2, 5, 7, 8, 9, 12, 13, 15, 16, 19]), Candidate: [1 2 0 0 2 0 2 0 1 0 0 2 1 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 69900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0 -1  1  0  0  0 -1  1 -1  1 -1  0  1] (Indices: [0, 2, 5, 7, 8, 10, 11, 12, 13, 15, 17]), Candidate: [1 2 0 0 2 0 2 0 0 2 0 1 1 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 69950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0 -1  1  0 -1  0  1  0  0 -1  1 -1  1] (Indices: [0, 2, 5, 7, 8, 10, 11, 14, 15, 16, 18]), Candidate: [1 2 0 0 2 0 2 0 0 2 0 0 1 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 70000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0 -1  1 -1  0  1  0  0  0 -1  1 -1  1] (Indices: [0, 2, 5, 7, 8, 10, 13, 14, 15, 16, 18]), Candidate: [ 1  2  0  0  2  0  2  0  0  2 -1  1  2  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0 -1  0  1  0 -1  0  1  0  0  0 -1  1] (Indices: [0, 2, 5, 7, 8, 11, 12, 15, 16, 17, 18]), Candidate: [1 2 0 0 2 0 2 0 0 1 1 1 0 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 70100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0 -1  0  0  0  1  0  0 -1  1  0  0  0] (Indices: [0, 2, 5, 7, 8, 13, 14, 15, 17, 18, 19]), Candidate: [1 2 0 0 2 0 2 0 0 1 0 1 2 1 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 70150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  1  0  0 -1  1 -1  1  0 -1  1 -1  1] (Indices: [0, 2, 5, 7, 9, 10, 11, 13, 15, 16, 18]), Candidate: [ 1  2  0  0  2  0  2 -1  2  1  0  0  2  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  1  0 -1  1 -1  1 -1  1  0  0 -1  1] (Indices: [0, 2, 5, 7, 9, 10, 12, 14, 16, 17, 18]), Candidate: [ 1  2  0  0  2  0  2 -1  2  1 -1  2  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 70250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  1 -1  1  0 -1  1  0  0  0 -1  0  1] (Indices: [0, 2, 5, 7, 9, 11, 12, 14, 15, 16, 17]), Candidate: [ 1  2  0  0  2  0  2 -1  2  0  1  1  0  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  1 -1  0  1  0 -1  0  1  0  0  0  0] (Indices: [0, 2, 5, 7, 9, 12, 13, 16, 17, 18, 19]), Candidate: [ 1  2  0  0  2  0  2 -1  2  0  0  2  1  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  0  1  0 -1  1  0  0  0 -1  1 -1  1] (Indices: [0, 2, 5, 7, 10, 11, 13, 14, 15, 16, 18]), Candidate: [ 1  2  0  0  2  0  2 -1  1  2  0  0  2  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  0  0  1  0  0  0  0  0 -1  0  1  0] (Indices: [0, 2, 5, 7, 11, 12, 13, 14, 15, 16, 19]), Candidate: [ 1  2  0  0  2  0  2 -1  1  1  1  1  1  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1  0  0  0  0 -1  1  0 -1  1 -1  0  1] (Indices: [0, 2, 5, 8, 9, 10, 11, 12, 14, 15, 17]), Candidate: [1 2 0 0 2 0 1 1 1 1 0 1 0 2 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 70500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1  0  0  0 -1  0  0  1  0  0 -1  1  0] (Indices: [0, 2, 5, 8, 9, 10, 11, 15, 16, 17, 19]), Candidate: [1 2 0 0 2 0 1 1 1 1 0 0 1 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 70550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1  0  0 -1  0  1 -1  1  0  0 -1  1  0] (Indices: [0, 2, 5, 8, 9, 10, 13, 15, 16, 17, 19]), Candidate: [ 1  2  0  0  2  0  1  1  1  1 -1  1  2  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1  0 -1  1 -1  1  0  0 -1  0  1  0  0] (Indices: [0, 2, 5, 8, 9, 11, 13, 14, 15, 18, 19]), Candidate: [1 2 0 0 2 0 1 1 1 0 1 0 2 1 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 70650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1 -1  1  0  0  0  0 -1  1 -1  0  1  0] (Indices: [0, 2, 5, 8, 10, 11, 12, 13, 14, 16, 19]), Candidate: [ 1  2  0  0  2  0  1  1  0  2  0  1  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1 -1  1 -1  1  0  0  0  0  0 -1  0  1] (Indices: [0, 2, 5, 8, 10, 12, 13, 14, 15, 16, 17]), Candidate: [ 1  2  0  0  2  0  1  1  0  2 -1  2  1  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1 -1  0  1 -1  1  0  0  0  0 -1  1  0] (Indices: [0, 2, 5, 8, 11, 13, 14, 15, 16, 17, 19]), Candidate: [1 2 0 0 2 0 1 1 0 1 1 0 2 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 70800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  1  0  0 -1  1  0  0  0 -1  1 -1  1] (Indices: [0, 2, 5, 9, 10, 11, 13, 14, 15, 16, 18]), Candidate: [1 2 0 0 2 0 1 0 2 1 0 0 2 1 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 70850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  1 -1  1  0  0  0  0  0 -1  0  1  0] (Indices: [0, 2, 5, 9, 11, 12, 13, 14, 15, 16, 19]), Candidate: [1 2 0 0 2 0 1 0 2 0 1 1 1 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 70900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  0  1  0  0 -1  1  0  0  0 -1  1  0] (Indices: [0, 2, 5, 10, 11, 12, 14, 15, 16, 17, 19]), Candidate: [1 2 0 0 2 0 1 0 1 2 0 1 0 2 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 70950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0  0  0  0 -1  1  0  0 -1  0  0  0  1] (Indices: [0, 2, 6, 7, 8, 9, 10, 11, 13, 14, 15]), Candidate: [1 2 0 0 1 2 1 0 1 1 0 0 2 1 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 71000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0  0  0 -1  1 -1  1  0  0 -1  0  0  1] (Indices: [0, 2, 6, 7, 8, 9, 10, 12, 14, 15, 16]), Candidate: [ 1  2  0  0  1  2  1  0  1  1 -1  2  0  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0  0  0 -1  0  0  0  1  0  0  0 -1  1] (Indices: [0, 2, 6, 7, 8, 9, 10, 15, 16, 17, 18]), Candidate: [ 1  2  0  0  1  2  1  0  1  1 -1  1  1  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0  0 -1  1 -1  1 -1  1  0  0 -1  0  1] (Indices: [0, 2, 6, 7, 8, 9, 11, 13, 15, 16, 17]), Candidate: [1 2 0 0 1 2 1 0 1 0 1 0 2 0 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 71150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0  0 -1  0  1 -1  1  0 -1  0  1  0  0] (Indices: [0, 2, 6, 7, 8, 9, 12, 14, 15, 18, 19]), Candidate: [1 2 0 0 1 2 1 0 1 0 0 2 0 2 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 71200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0 -1  1  0  0 -1  1 -1  1  0 -1  0  1] (Indices: [0, 2, 6, 7, 8, 10, 11, 12, 14, 16, 17]), Candidate: [ 1  2  0  0  1  2  1  0  0  2  0  1  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0 -1  1  0 -1  0  0  0  1  0  0  0  0] (Indices: [0, 2, 6, 7, 8, 10, 11, 16, 17, 18, 19]), Candidate: [1 2 0 0 1 2 1 0 0 2 0 0 1 1 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 71300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0 -1  1 -1  0  1 -1  0  1  0  0  0  0] (Indices: [0, 2, 6, 7, 8, 10, 13, 16, 17, 18, 19]), Candidate: [ 1  2  0  0  1  2  1  0  0  2 -1  1  2  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0 -1  0  1 -1  1  0 -1  1 -1  1  0  0] (Indices: [0, 2, 6, 7, 8, 11, 13, 14, 16, 18, 19]), Candidate: [ 1  2  0  0  1  2  1  0  0  1  1  0  2  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  1  0  0  0  0 -1  0  1  0 -1  0  1] (Indices: [0, 2, 6, 7, 9, 10, 11, 12, 13, 16, 17]), Candidate: [ 1  2  0  0  1  2  1 -1  2  1  0  1  1  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  1  0  0 -1  0  1  0 -1  1 -1  1  0] (Indices: [0, 2, 6, 7, 9, 10, 11, 14, 15, 17, 19]), Candidate: [ 1  2  0  0  1  2  1 -1  2  1  0  0  1  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  1  0 -1  0  1  0  0 -1  1 -1  1  0] (Indices: [0, 2, 6, 7, 9, 10, 13, 14, 15, 17, 19]), Candidate: [ 1  2  0  0  1  2  1 -1  2  1 -1  1  2  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 71550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  1 -1  1  0 -1  0  1 -1  1  0  0  0] (Indices: [0, 2, 6, 7, 9, 11, 12, 15, 17, 18, 19]), Candidate: [ 1  2  0  0  1  2  1 -1  2  0  1  1  0  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  1 -1  0  0  0  1  0  0  0  0  0  0] (Indices: [0, 2, 6, 7, 9, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  2  0  0  1  2  1 -1  2  0  0  1  1  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  0  1  0 -1  1 -1  0  1  0  0  0  0] (Indices: [0, 2, 6, 7, 10, 11, 13, 16, 17, 18, 19]), Candidate: [ 1  2  0  0  1  2  1 -1  1  2  0  0  2  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  0  0  1  0 -1  1  0  0  0  0 -1  1] (Indices: [0, 2, 6, 7, 11, 12, 14, 15, 16, 17, 18]), Candidate: [ 1  2  0  0  1  2  1 -1  1  1  1  1  0  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1  0  0  0  0 -1  0  1 -1  1 -1  1  0] (Indices: [0, 2, 6, 8, 9, 10, 11, 12, 15, 17, 19]), Candidate: [1 2 0 0 1 2 0 1 1 1 0 1 0 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 71800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1  0  0 -1  1  0  0 -1  0  0  1  0  0] (Indices: [0, 2, 6, 8, 9, 10, 12, 13, 14, 18, 19]), Candidate: [ 1  2  0  0  1  2  0  1  1  1 -1  2  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 71850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1  0 -1  1  0  0  0  0 -1  0  0  1  0] (Indices: [0, 2, 6, 8, 9, 11, 12, 13, 14, 15, 19]), Candidate: [1 2 0 0 1 2 0 1 1 0 1 1 1 1 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 71900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1  0 -1  1 -1  0  1  0 -1  1  0  0  0] (Indices: [0, 2, 6, 8, 9, 11, 14, 15, 17, 18, 19]), Candidate: [1 2 0 0 1 2 0 1 1 0 1 0 1 2 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 71950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1 -1  1  0  0  0 -1  0  0  1  0  0  0] (Indices: [0, 2, 6, 8, 10, 11, 12, 13, 17, 18, 19]), Candidate: [1 2 0 0 1 2 0 1 0 2 0 1 1 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 72000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1 -1  1 -1  1  0 -1  1 -1  1  0  0  0] (Indices: [0, 2, 6, 8, 10, 12, 13, 15, 17, 18, 19]), Candidate: [ 1  2  0  0  1  2  0  1  0  2 -1  2  1  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1 -1  0  0  0  1  0  0  0  0  0  0  0] (Indices: [0, 2, 6, 8, 13, 14, 15, 16, 17, 18, 19]), Candidate: [1 2 0 0 1 2 0 1 0 1 0 1 2 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 72100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  1  0  0 -1  1 -1  0  1  0  0  0  0] (Indices: [0, 2, 6, 9, 10, 11, 13, 16, 17, 18, 19]), Candidate: [1 2 0 0 1 2 0 0 2 1 0 0 2 0 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 72150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  1 -1  1  0 -1  1  0  0  0  0 -1  1] (Indices: [0, 2, 6, 9, 11, 12, 14, 15, 16, 17, 18]), Candidate: [1 2 0 0 1 2 0 0 2 0 1 1 0 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 72200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  0  1 -1  1  0  0  0  0  0 -1  1  0] (Indices: [0, 2, 6, 10, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 1  2  0  0  1  2  0  0  1  2 -1  2  1  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0  0  0  0  0 -1  0  0  0  1  0  0  0] (Indices: [0, 2, 7, 8, 9, 10, 11, 12, 17, 18, 19]), Candidate: [1 2 0 0 1 1 2 0 1 1 0 1 0 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 72300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0  0  0 -1  1  0 -1  1 -1  1 -1  1  0] (Indices: [0, 2, 7, 8, 9, 10, 12, 13, 15, 17, 19]), Candidate: [ 1  2  0  0  1  1  2  0  1  1 -1  2  1  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0  0 -1  1  0  0  0 -1  0  1 -1  1  0] (Indices: [0, 2, 7, 8, 9, 11, 12, 13, 14, 17, 19]), Candidate: [ 1  2  0  0  1  1  2  0  1  0  1  1  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0  0 -1  0  1  0  0  0  0 -1  0  1  0] (Indices: [0, 2, 7, 8, 9, 12, 13, 14, 15, 16, 19]), Candidate: [1 2 0 0 1 1 2 0 1 0 0 2 1 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 72450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0 -1  1  0  0 -1  1  0 -1  1 -1  1  0] (Indices: [0, 2, 7, 8, 10, 11, 12, 14, 15, 17, 19]), Candidate: [1 2 0 0 1 1 2 0 0 2 0 1 0 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 72500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0 -1  1 -1  1 -1  1  0 -1  1  0  0  0] (Indices: [0, 2, 7, 8, 10, 12, 14, 15, 17, 18, 19]), Candidate: [ 1  2  0  0  1  1  2  0  0  2 -1  2  0  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  1  0  0  0  0  0 -1  1  0 -1  0  1] (Indices: [0, 2, 7, 9, 10, 11, 12, 13, 14, 16, 17]), Candidate: [ 1  2  0  0  1  1  2 -1  2  1  0  1  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 72600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  1  0  0 -1  0  1 -1  1  0  0  0  0] (Indices: [0, 2, 7, 9, 10, 11, 14, 16, 17, 18, 19]), Candidate: [ 1  2  0  0  1  1  2 -1  2  1  0  0  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 72650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  1 -1  1  0 -1  0  1  0  0  0  0  0] (Indices: [0, 2, 7, 9, 11, 12, 15, 16, 17, 18, 19]), Candidate: [ 1  2  0  0  1  1  2 -1  2  0  1  1  0  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  0  1 -1  1 -1  1  0  0  0  0  0  0] (Indices: [0, 2, 7, 10, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  2  0  0  1  1  2 -1  1  2 -1  2  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 72750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1  0  0  0 -1  1  0  0 -1  1 -1  1  0] (Indices: [0, 2, 8, 9, 10, 11, 13, 14, 15, 17, 19]), Candidate: [1 2 0 0 1 1 1 1 1 1 0 0 2 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 72800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1  0 -1  1  0  0  0  0 -1  0  1  0  0] (Indices: [0, 2, 8, 9, 11, 12, 13, 14, 15, 18, 19]), Candidate: [1 2 0 0 1 1 1 1 1 0 1 1 1 1 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 72850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1 -1  1  0  0 -1  1 -1  1  0  0  0  0] (Indices: [0, 2, 8, 10, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 1  2  0  0  1  1  1  1  0  2  0  1  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  1  0  0 -1  1  0  0 -1  1  0  0  0] (Indices: [0, 2, 9, 10, 11, 13, 14, 15, 17, 18, 19]), Candidate: [1 2 0 0 1 1 1 0 2 1 0 0 2 1 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 72950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0  0  0 -1  0  1 -1  0  0  0  1 -1  1] (Indices: [0, 3, 4, 5, 6, 7, 8, 9, 10, 13, 18]), Candidate: [ 1  1  2  0  1  1  1  0  1  1 -1  1  2  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0  0 -1  0  1  0 -1  0  0  0  0  1  0] (Indices: [0, 3, 4, 5, 6, 7, 8, 9, 12, 13, 19]), Candidate: [1 1 2 0 1 1 1 0 1 0 0 2 1 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 73050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0  0 -1  0  0  0  0  0  0  1  0  0  0] (Indices: [0, 3, 4, 5, 6, 7, 8, 9, 17, 18, 19]), Candidate: [1 1 2 0 1 1 1 0 1 0 0 1 1 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 73100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0 -1  1 -1  0  1  0  0 -1  0  0  0  1] (Indices: [0, 3, 4, 5, 6, 7, 8, 10, 13, 14, 15]), Candidate: [ 1  1  2  0  1  1  1  0  0  2 -1  1  2  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0 -1  0  1  0 -1  0  0  1  0 -1  0  1] (Indices: [0, 3, 4, 5, 6, 7, 8, 11, 12, 16, 17]), Candidate: [1 1 2 0 1 1 1 0 0 1 1 1 0 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 73200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0 -1  0  0  1  0 -1  0  1  0 -1  0  1] (Indices: [0, 3, 4, 5, 6, 7, 8, 12, 13, 16, 17]), Candidate: [1 1 2 0 1 1 1 0 0 1 0 2 1 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 73250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0 -1  0  0  0  0  1  0 -1  1 -1  1  0] (Indices: [0, 3, 4, 5, 6, 7, 8, 14, 15, 17, 19]), Candidate: [1 1 2 0 1 1 1 0 0 1 0 1 1 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 73300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  1  0 -1  1 -1  0  1  0 -1  0  0  1] (Indices: [0, 3, 4, 5, 6, 7, 9, 10, 12, 15, 16]), Candidate: [ 1  1  2  0  1  1  1 -1  2  1 -1  2  0  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 73350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  1 -1  1  0  0 -1  0  0  0  0  1  0] (Indices: [0, 3, 4, 5, 6, 7, 9, 11, 12, 13, 19]), Candidate: [ 1  1  2  0  1  1  1 -1  2  0  1  1  1  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  1 -1  1 -1  0  0  0  0  1  0  0  0] (Indices: [0, 3, 4, 5, 6, 7, 9, 11, 17, 18, 19]), Candidate: [ 1  1  2  0  1  1  1 -1  2  0  1  0  1  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  1 -1  0  0  1 -1  1 -1  1 -1  1  0] (Indices: [0, 3, 4, 5, 6, 7, 9, 13, 15, 17, 19]), Candidate: [ 1  1  2  0  1  1  1 -1  2  0  0  1  2  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  0  1  0 -1  1 -1  1 -1  0  0  1  0] (Indices: [0, 3, 4, 5, 6, 7, 10, 11, 13, 15, 19]), Candidate: [ 1  1  2  0  1  1  1 -1  1  2  0  0  2  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  0  1 -1  1 -1  1 -1  0  1 -1  1  0] (Indices: [0, 3, 4, 5, 6, 7, 10, 12, 14, 17, 19]), Candidate: [ 1  1  2  0  1  1  1 -1  1  2 -1  2  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 73600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  0  0  1  0  0  0 -1  0  0  1 -1  1] (Indices: [0, 3, 4, 5, 6, 7, 11, 12, 13, 14, 18]), Candidate: [ 1  1  2  0  1  1  1 -1  1  1  1  1  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 73650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  0  0  1 -1  1 -1  0  1 -1  1  0  0] (Indices: [0, 3, 4, 5, 6, 7, 11, 13, 16, 18, 19]), Candidate: [ 1  1  2  0  1  1  1 -1  1  1  1  0  2  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  0  0  0  1 -1  0  1 -1  1  0  0  0] (Indices: [0, 3, 4, 5, 6, 7, 12, 15, 17, 18, 19]), Candidate: [ 1  1  2  0  1  1  1 -1  1  1  0  2  0  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1  0  0  0 -1  0  0  0  0  0  1  0  0] (Indices: [0, 3, 4, 5, 6, 8, 9, 10, 11, 18, 19]), Candidate: [1 1 2 0 1 1 0 1 1 1 0 0 1 1 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 73800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1  0  0 -1  0  0  0  1 -1  1  0 -1  1] (Indices: [0, 3, 4, 5, 6, 8, 9, 10, 15, 17, 18]), Candidate: [ 1  1  2  0  1  1  0  1  1  1 -1  1  1  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1  0 -1  1 -1  0  1 -1  0  1  0 -1  1] (Indices: [0, 3, 4, 5, 6, 8, 9, 11, 14, 17, 18]), Candidate: [ 1  1  2  0  1  1  0  1  1  0  1  0  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1  0 -1  0  0  1  0  0 -1  0  1 -1  1] (Indices: [0, 3, 4, 5, 6, 8, 9, 13, 14, 15, 18]), Candidate: [1 1 2 0 1 1 0 1 1 0 0 1 2 1 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 73950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1 -1  1  0  0 -1  0  0  1 -1  0  1  0] (Indices: [0, 3, 4, 5, 6, 8, 10, 11, 12, 16, 19]), Candidate: [1 1 2 0 1 1 0 1 0 2 0 1 0 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 74000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1 -1  1 -1  1  0 -1  0  1 -1  0  1  0] (Indices: [0, 3, 4, 5, 6, 8, 10, 12, 13, 16, 19]), Candidate: [ 1  1  2  0  1  1  0  1  0  2 -1  2  1  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1 -1  1 -1  0  0  1 -1  1  0  0 -1  1] (Indices: [0, 3, 4, 5, 6, 8, 10, 14, 16, 17, 18]), Candidate: [ 1  1  2  0  1  1  0  1  0  2 -1  1  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 74100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1 -1  0  1 -1  1  0 -1  1 -1  0  1  0] (Indices: [0, 3, 4, 5, 6, 8, 11, 13, 14, 16, 19]), Candidate: [ 1  1  2  0  1  1  0  1  0  1  1  0  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1 -1  0  0  1 -1  1  0  0 -1  1 -1  1] (Indices: [0, 3, 4, 5, 6, 8, 12, 14, 15, 16, 18]), Candidate: [1 1 2 0 1 1 0 1 0 1 0 2 0 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 74200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  1  0  0  0 -1  0  0  1  0 -1  0  1] (Indices: [0, 3, 4, 5, 6, 9, 10, 11, 12, 16, 17]), Candidate: [1 1 2 0 1 1 0 0 2 1 0 1 0 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 74250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  1  0 -1  1  0 -1  0  1  0 -1  0  1] (Indices: [0, 3, 4, 5, 6, 9, 10, 12, 13, 16, 17]), Candidate: [ 1  1  2  0  1  1  0  0  2  1 -1  2  1  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  1  0 -1  0  0  1  0 -1  1 -1  1  0] (Indices: [0, 3, 4, 5, 6, 9, 10, 14, 15, 17, 19]), Candidate: [ 1  1  2  0  1  1  0  0  2  1 -1  1  1  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  1 -1  1 -1  1  0 -1  1  0 -1  0  1] (Indices: [0, 3, 4, 5, 6, 9, 11, 13, 14, 16, 17]), Candidate: [ 1  1  2  0  1  1  0  0  2  0  1  0  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  1 -1  0  1  0 -1  0  0  1  0  0  0] (Indices: [0, 3, 4, 5, 6, 9, 12, 13, 17, 18, 19]), Candidate: [1 1 2 0 1 1 0 0 2 0 0 2 1 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 74450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  0  1  0  0  0 -1  0  0  1 -1  1  0] (Indices: [0, 3, 4, 5, 6, 10, 11, 12, 13, 17, 19]), Candidate: [1 1 2 0 1 1 0 0 1 2 0 1 1 0 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 74500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  0  1  0 -1  0  1 -1  1 -1  1  0  0] (Indices: [0, 3, 4, 5, 6, 10, 11, 14, 16, 18, 19]), Candidate: [ 1  1  2  0  1  1  0  0  1  2  0  0  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  0  1 -1  0  1  0 -1  1 -1  1  0  0] (Indices: [0, 3, 4, 5, 6, 10, 13, 14, 16, 18, 19]), Candidate: [ 1  1  2  0  1  1  0  0  1  2 -1  1  2  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 74600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  0  0  1 -1  1  0  0  0 -1  0  1  0] (Indices: [0, 3, 4, 5, 6, 11, 13, 14, 15, 16, 19]), Candidate: [1 1 2 0 1 1 0 0 1 1 1 0 2 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 74650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0  0  0  0  0 -1  0  0  1 -1  0  0  1] (Indices: [0, 3, 4, 5, 7, 8, 9, 10, 11, 12, 16]), Candidate: [1 1 2 0 1 0 2 0 1 1 0 1 0 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 74700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0  0  0 -1  0  1  0 -1  0  0  0  1  0] (Indices: [0, 3, 4, 5, 7, 8, 9, 10, 13, 14, 19]), Candidate: [ 1  1  2  0  1  0  2  0  1  1 -1  1  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 74750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0  0 -1  1  0 -1  0  0  0  1 -1  1  0] (Indices: [0, 3, 4, 5, 7, 8, 9, 11, 12, 17, 19]), Candidate: [1 1 2 0 1 0 2 0 1 0 1 1 0 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 74800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0  0 -1  0  1  0 -1  0  0  1 -1  1  0] (Indices: [0, 3, 4, 5, 7, 8, 9, 12, 13, 17, 19]), Candidate: [1 1 2 0 1 0 2 0 1 0 0 2 1 0 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 74850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0  0 -1  0  0  0  1 -1  1 -1  1  0  0] (Indices: [0, 3, 4, 5, 7, 8, 9, 14, 16, 18, 19]), Candidate: [ 1  1  2  0  1  0  2  0  1  0  0  1  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0 -1  1  0 -1  0  1 -1  0  1  0 -1  1] (Indices: [0, 3, 4, 5, 7, 8, 10, 11, 14, 17, 18]), Candidate: [ 1  1  2  0  1  0  2  0  0  2  0  0  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0 -1  1 -1  0  1  0  0 -1  0  1 -1  1] (Indices: [0, 3, 4, 5, 7, 8, 10, 13, 14, 15, 18]), Candidate: [ 1  1  2  0  1  0  2  0  0  2 -1  1  2  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0 -1  0  1  0 -1  1  0 -1  0  1 -1  1] (Indices: [0, 3, 4, 5, 7, 8, 11, 12, 14, 15, 18]), Candidate: [1 1 2 0 1 0 2 0 0 1 1 1 0 2 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 75050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0 -1  0  1 -1  0  0  1  0 -1  1  0  0] (Indices: [0, 3, 4, 5, 7, 8, 11, 15, 16, 18, 19]), Candidate: [1 1 2 0 1 0 2 0 0 1 1 0 1 1 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 75100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0 -1  0  0  0  1 -1  1  0 -1  1  0  0] (Indices: [0, 3, 4, 5, 7, 8, 13, 15, 16, 18, 19]), Candidate: [1 1 2 0 1 0 2 0 0 1 0 1 2 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 75150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  1  0  0 -1  0  1 -1  1 -1  1 -1  1] (Indices: [0, 3, 4, 5, 7, 9, 10, 11, 14, 16, 18]), Candidate: [ 1  1  2  0  1  0  2 -1  2  1  0  0  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 75200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  1  0 -1  0  1  0  0  0 -1  0  0  1] (Indices: [0, 3, 4, 5, 7, 9, 10, 13, 14, 15, 16]), Candidate: [ 1  1  2  0  1  0  2 -1  2  1 -1  1  2  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 75250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  1 -1  1  0 -1  1  0  0 -1  0  0  1] (Indices: [0, 3, 4, 5, 7, 9, 11, 12, 14, 15, 16]), Candidate: [ 1  1  2  0  1  0  2 -1  2  0  1  1  0  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  1 -1  1 -1  0  0  1  0  0  0 -1  1] (Indices: [0, 3, 4, 5, 7, 9, 11, 15, 16, 17, 18]), Candidate: [ 1  1  2  0  1  0  2 -1  2  0  1  0  1  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  1 -1  0  0  1 -1  1  0  0  0 -1  1] (Indices: [0, 3, 4, 5, 7, 9, 13, 15, 16, 17, 18]), Candidate: [ 1  1  2  0  1  0  2 -1  2  0  0  1  2  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  0  1  0 -1  1  0 -1  1  0 -1  0  1] (Indices: [0, 3, 4, 5, 7, 10, 11, 13, 14, 16, 17]), Candidate: [ 1  1  2  0  1  0  2 -1  1  2  0  0  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 75450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  0  1 -1  1  0 -1  0  0  1  0  0  0] (Indices: [0, 3, 4, 5, 7, 10, 12, 13, 17, 18, 19]), Candidate: [ 1  1  2  0  1  0  2 -1  1  2 -1  2  1  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 75500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  0  0  1  0  0 -1  1 -1  1  0 -1  1] (Indices: [0, 3, 4, 5, 7, 11, 12, 13, 15, 17, 18]), Candidate: [ 1  1  2  0  1  0  2 -1  1  1  1  1  1  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  0  0  0  1  0  0 -1  1  0 -1  1  0] (Indices: [0, 3, 4, 5, 7, 12, 13, 14, 16, 17, 19]), Candidate: [ 1  1  2  0  1  0  2 -1  1  1  0  2  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 75600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1  0  0  0 -1  1 -1  1 -1  0  0  1  0] (Indices: [0, 3, 4, 5, 8, 9, 10, 11, 13, 15, 19]), Candidate: [1 1 2 0 1 0 1 1 1 1 0 0 2 0 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 75650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1  0  0 -1  1 -1  1 -1  0  1 -1  1  0] (Indices: [0, 3, 4, 5, 8, 9, 10, 12, 14, 17, 19]), Candidate: [ 1  1  2  0  1  0  1  1  1  1 -1  2  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 75700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1  0 -1  1  0  0  0 -1  0  0  1 -1  1] (Indices: [0, 3, 4, 5, 8, 9, 11, 12, 13, 14, 18]), Candidate: [ 1  1  2  0  1  0  1  1  1  0  1  1  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1  0 -1  1 -1  1 -1  0  1 -1  1  0  0] (Indices: [0, 3, 4, 5, 8, 9, 11, 13, 16, 18, 19]), Candidate: [1 1 2 0 1 0 1 1 1 0 1 0 2 0 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 75800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1  0 -1  0  1 -1  0  1 -1  1  0  0  0] (Indices: [0, 3, 4, 5, 8, 9, 12, 15, 17, 18, 19]), Candidate: [1 1 2 0 1 0 1 1 1 0 0 2 0 1 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 75850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1 -1  1  0  0 -1  0  1  0 -1  0  1  0] (Indices: [0, 3, 4, 5, 8, 10, 11, 12, 15, 16, 19]), Candidate: [1 1 2 0 1 0 1 1 0 2 0 1 0 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 75900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1 -1  1 -1  1  0  0 -1  0  1  0 -1  1] (Indices: [0, 3, 4, 5, 8, 10, 12, 13, 14, 17, 18]), Candidate: [ 1  1  2  0  1  0  1  1  0  2 -1  2  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 75950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1 -1  0  1  0  0  0  0 -1  1 -1  0  1] (Indices: [0, 3, 4, 5, 8, 11, 12, 13, 14, 15, 17]), Candidate: [1 1 2 0 1 0 1 1 0 1 1 1 1 1 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 76000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1 -1  0  1 -1  0  1  0  0  0 -1  1  0] (Indices: [0, 3, 4, 5, 8, 11, 14, 15, 16, 17, 19]), Candidate: [1 1 2 0 1 0 1 1 0 1 1 0 1 2 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 76050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  1  0  0  0 -1  1  0 -1  0  1 -1  1] (Indices: [0, 3, 4, 5, 9, 10, 11, 12, 14, 15, 18]), Candidate: [1 1 2 0 1 0 1 0 2 1 0 1 0 2 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 76100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  1  0  0 -1  0  0  1  0 -1  1  0  0] (Indices: [0, 3, 4, 5, 9, 10, 11, 15, 16, 18, 19]), Candidate: [1 1 2 0 1 0 1 0 2 1 0 0 1 1 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 76150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  1  0 -1  0  1 -1  1  0 -1  1  0  0] (Indices: [0, 3, 4, 5, 9, 10, 13, 15, 16, 18, 19]), Candidate: [ 1  1  2  0  1  0  1  0  2  1 -1  1  2  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  1 -1  1 -1  1  0 -1  1  0  0 -1  1] (Indices: [0, 3, 4, 5, 9, 11, 13, 14, 16, 17, 18]), Candidate: [ 1  1  2  0  1  0  1  0  2  0  1  0  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  0  1  0  0  0  0 -1  0  1  0 -1  1] (Indices: [0, 3, 4, 5, 10, 11, 12, 13, 14, 17, 18]), Candidate: [ 1  1  2  0  1  0  1  0  1  2  0  1  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  0  1 -1  1  0  0  0  0 -1  1 -1  1] (Indices: [0, 3, 4, 5, 10, 12, 13, 14, 15, 16, 18]), Candidate: [ 1  1  2  0  1  0  1  0  1  2 -1  2  1  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  0  0  1 -1  1  0  0  0 -1  1  0  0] (Indices: [0, 3, 4, 5, 11, 13, 14, 15, 16, 18, 19]), Candidate: [1 1 2 0 1 0 1 0 1 1 1 0 2 1 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 76400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0  0  0 -1  1 -1  1 -1  0  0  1 -1  1] (Indices: [0, 3, 4, 6, 7, 8, 9, 10, 12, 14, 18]), Candidate: [ 1  1  2  0  0  2  1  0  1  1 -1  2  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 76450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0  0 -1  1  0  0 -1  0  0  1 -1  0  1] (Indices: [0, 3, 4, 6, 7, 8, 9, 11, 12, 13, 17]), Candidate: [1 1 2 0 0 2 1 0 1 0 1 1 1 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 76500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0  0 -1  1 -1  0  0  0  1  0 -1  1  0] (Indices: [0, 3, 4, 6, 7, 8, 9, 11, 16, 17, 19]), Candidate: [1 1 2 0 0 2 1 0 1 0 1 0 1 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 76550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0  0 -1  0  0  1 -1  1  0 -1  0  1  0] (Indices: [0, 3, 4, 6, 7, 8, 9, 13, 15, 16, 19]), Candidate: [1 1 2 0 0 2 1 0 1 0 0 1 2 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 76600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0 -1  1  0 -1  1 -1  1 -1  1 -1  0  1] (Indices: [0, 3, 4, 6, 7, 8, 10, 11, 13, 15, 17]), Candidate: [1 1 2 0 0 2 1 0 0 2 0 0 2 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 76650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0 -1  1 -1  1 -1  1 -1  1 -1  0  1  0] (Indices: [0, 3, 4, 6, 7, 8, 10, 12, 14, 16, 19]), Candidate: [ 1  1  2  0  0  2  1  0  0  2 -1  2  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 76700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0 -1  0  1  0  0  0 -1  1 -1  0  0  1] (Indices: [0, 3, 4, 6, 7, 8, 11, 12, 13, 14, 16]), Candidate: [ 1  1  2  0  0  2  1  0  0  1  1  1  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0 -1  0  1 -1  1 -1  0  1  0  0 -1  1] (Indices: [0, 3, 4, 6, 7, 8, 11, 13, 16, 17, 18]), Candidate: [1 1 2 0 0 2 1 0 0 1 1 0 2 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 76800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0 -1  0  0  1 -1  0  1  0  0 -1  1  0] (Indices: [0, 3, 4, 6, 7, 8, 12, 15, 16, 17, 19]), Candidate: [1 1 2 0 0 2 1 0 0 1 0 2 0 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 76850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  1  0  0 -1  1  0 -1  0  0  0  1  0] (Indices: [0, 3, 4, 6, 7, 9, 10, 11, 13, 14, 19]), Candidate: [ 1  1  2  0  0  2  1 -1  2  1  0  0  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 76900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  1  0 -1  1 -1  1 -1  1  0 -1  0  1] (Indices: [0, 3, 4, 6, 7, 9, 10, 12, 14, 16, 17]), Candidate: [ 1  1  2  0  0  2  1 -1  2  1 -1  2  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 76950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  1  0 -1  0  0  0  0  1  0  0  0  0] (Indices: [0, 3, 4, 6, 7, 9, 10, 16, 17, 18, 19]), Candidate: [ 1  1  2  0  0  2  1 -1  2  1 -1  1  1  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 77000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  1 -1  1 -1  1 -1  1 -1  1 -1  1  0] (Indices: [0, 3, 4, 6, 7, 9, 11, 13, 15, 17, 19]), Candidate: [ 1  1  2  0  0  2  1 -1  2  0  1  0  2  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  1 -1  0  1 -1  1 -1  0  1  0  0  0] (Indices: [0, 3, 4, 6, 7, 9, 12, 14, 17, 18, 19]), Candidate: [ 1  1  2  0  0  2  1 -1  2  0  0  2  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 77100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  0  1  0  0 -1  1 -1  0  1 -1  1  0] (Indices: [0, 3, 4, 6, 7, 10, 11, 12, 14, 17, 19]), Candidate: [ 1  1  2  0  0  2  1 -1  1  2  0  1  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 77150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  0  1 -1  1  0  0  0 -1  0  0  1  0] (Indices: [0, 3, 4, 6, 7, 10, 12, 13, 14, 15, 19]), Candidate: [ 1  1  2  0  0  2  1 -1  1  2 -1  2  1  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 77200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  0  1 -1  0  0  1  0 -1  1  0  0  0] (Indices: [0, 3, 4, 6, 7, 10, 14, 15, 17, 18, 19]), Candidate: [ 1  1  2  0  0  2  1 -1  1  2 -1  1  1  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 77250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  0  0  1 -1  1 -1  1  0 -1  1  0  0] (Indices: [0, 3, 4, 6, 7, 11, 13, 15, 16, 18, 19]), Candidate: [ 1  1  2  0  0  2  1 -1  1  1  1  0  2  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1  0  0  0  0 -1  0  1 -1  0  1 -1  1] (Indices: [0, 3, 4, 6, 8, 9, 10, 11, 12, 15, 18]), Candidate: [1 1 2 0 0 2 0 1 1 1 0 1 0 1 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 77350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1  0  0 -1  1  0 -1  1 -1  0  1 -1  1] (Indices: [0, 3, 4, 6, 8, 9, 10, 12, 13, 15, 18]), Candidate: [ 1  1  2  0  0  2  0  1  1  1 -1  2  1  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1  0  0 -1  0  0  1  0  0 -1  0  1  0] (Indices: [0, 3, 4, 6, 8, 9, 10, 14, 15, 16, 19]), Candidate: [ 1  1  2  0  0  2  0  1  1  1 -1  1  1  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1  0 -1  1 -1  1  0  0 -1  0  1 -1  1] (Indices: [0, 3, 4, 6, 8, 9, 11, 13, 14, 15, 18]), Candidate: [1 1 2 0 0 2 0 1 1 0 1 0 2 1 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 77500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1  0 -1  0  1  0 -1  0  1  0 -1  1  0] (Indices: [0, 3, 4, 6, 8, 9, 12, 13, 16, 17, 19]), Candidate: [1 1 2 0 0 2 0 1 1 0 0 2 1 0 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 77550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1 -1  1  0  0  0 -1  0  1 -1  0  1  0] (Indices: [0, 3, 4, 6, 8, 10, 11, 12, 13, 16, 19]), Candidate: [1 1 2 0 0 2 0 1 0 2 0 1 1 0 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 77600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1 -1  1  0 -1  0  1 -1  1  0  0 -1  1] (Indices: [0, 3, 4, 6, 8, 10, 11, 14, 16, 17, 18]), Candidate: [ 1  1  2  0  0  2  0  1  0  2  0  0  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1 -1  1 -1  0  1  0 -1  1  0  0 -1  1] (Indices: [0, 3, 4, 6, 8, 10, 13, 14, 16, 17, 18]), Candidate: [ 1  1  2  0  0  2  0  1  0  2 -1  1  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 77700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1 -1  0  1 -1  1  0  0  0  0 -1  0  1] (Indices: [0, 3, 4, 6, 8, 11, 13, 14, 15, 16, 17]), Candidate: [1 1 2 0 0 2 0 1 0 1 1 0 2 1 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 77750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  1  0  0  0  0  0 -1  1 -1  0  0  1] (Indices: [0, 3, 4, 6, 9, 10, 11, 12, 13, 14, 16]), Candidate: [ 1  1  2  0  0  2  0  0  2  1  0  1  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  1  0  0 -1  1 -1  0  1  0  0 -1  1] (Indices: [0, 3, 4, 6, 9, 10, 11, 13, 16, 17, 18]), Candidate: [1 1 2 0 0 2 0 0 2 1 0 0 2 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 77850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  1  0 -1  1 -1  0  1  0  0 -1  1  0] (Indices: [0, 3, 4, 6, 9, 10, 12, 15, 16, 17, 19]), Candidate: [ 1  1  2  0  0  2  0  0  2  1 -1  2  0  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  1 -1  1  0 -1  1  0 -1  0  1  0  0] (Indices: [0, 3, 4, 6, 9, 11, 12, 14, 15, 18, 19]), Candidate: [1 1 2 0 0 2 0 0 2 0 1 1 0 2 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 77950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  1 -1  0  1 -1  1 -1  1  0  0  0  0] (Indices: [0, 3, 4, 6, 9, 12, 14, 16, 17, 18, 19]), Candidate: [ 1  1  2  0  0  2  0  0  2  0  0  2  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  0  1  0 -1  1  0 -1  1  0  0 -1  1] (Indices: [0, 3, 4, 6, 10, 11, 13, 14, 16, 17, 18]), Candidate: [ 1  1  2  0  0  2  0  0  1  2  0  0  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  0  0  1  0  0  0 -1  1  0 -1  1  0] (Indices: [0, 3, 4, 6, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 1  1  2  0  0  2  0  0  1  1  1  1  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0  0  0  0 -1  1  0  0 -1  0  0  0  1] (Indices: [0, 3, 4, 7, 8, 9, 10, 11, 13, 14, 15]), Candidate: [1 1 2 0 0 1 2 0 1 1 0 0 2 1 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 78150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0  0  0 -1  1 -1  1  0  0 -1  0  0  1] (Indices: [0, 3, 4, 7, 8, 9, 10, 12, 14, 15, 16]), Candidate: [ 1  1  2  0  0  1  2  0  1  1 -1  2  0  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0  0  0 -1  0  0  0  1  0  0  0 -1  1] (Indices: [0, 3, 4, 7, 8, 9, 10, 15, 16, 17, 18]), Candidate: [ 1  1  2  0  0  1  2  0  1  1 -1  1  1  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0  0 -1  1 -1  1 -1  1  0  0 -1  0  1] (Indices: [0, 3, 4, 7, 8, 9, 11, 13, 15, 16, 17]), Candidate: [1 1 2 0 0 1 2 0 1 0 1 0 2 0 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 78300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0  0 -1  0  1 -1  1  0 -1  0  1  0  0] (Indices: [0, 3, 4, 7, 8, 9, 12, 14, 15, 18, 19]), Candidate: [1 1 2 0 0 1 2 0 1 0 0 2 0 2 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 78350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0 -1  1  0  0 -1  1 -1  1  0 -1  0  1] (Indices: [0, 3, 4, 7, 8, 10, 11, 12, 14, 16, 17]), Candidate: [ 1  1  2  0  0  1  2  0  0  2  0  1  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0 -1  1  0 -1  0  0  0  1  0  0  0  0] (Indices: [0, 3, 4, 7, 8, 10, 11, 16, 17, 18, 19]), Candidate: [1 1 2 0 0 1 2 0 0 2 0 0 1 1 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 78450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0 -1  1 -1  0  1 -1  0  1  0  0  0  0] (Indices: [0, 3, 4, 7, 8, 10, 13, 16, 17, 18, 19]), Candidate: [ 1  1  2  0  0  1  2  0  0  2 -1  1  2  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0 -1  0  1 -1  1  0 -1  1 -1  1  0  0] (Indices: [0, 3, 4, 7, 8, 11, 13, 14, 16, 18, 19]), Candidate: [ 1  1  2  0  0  1  2  0  0  1  1  0  2  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  1  0  0  0  0 -1  0  1  0 -1  0  1] (Indices: [0, 3, 4, 7, 9, 10, 11, 12, 13, 16, 17]), Candidate: [ 1  1  2  0  0  1  2 -1  2  1  0  1  1  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  1  0  0 -1  0  1  0 -1  1 -1  1  0] (Indices: [0, 3, 4, 7, 9, 10, 11, 14, 15, 17, 19]), Candidate: [ 1  1  2  0  0  1  2 -1  2  1  0  0  1  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  1  0 -1  0  1  0  0 -1  1 -1  1  0] (Indices: [0, 3, 4, 7, 9, 10, 13, 14, 15, 17, 19]), Candidate: [ 1  1  2  0  0  1  2 -1  2  1 -1  1  2  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 78700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  1 -1  1  0 -1  0  1 -1  1  0  0  0] (Indices: [0, 3, 4, 7, 9, 11, 12, 15, 17, 18, 19]), Candidate: [ 1  1  2  0  0  1  2 -1  2  0  1  1  0  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  1 -1  0  0  0  1  0  0  0  0  0  0] (Indices: [0, 3, 4, 7, 9, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  1  2  0  0  1  2 -1  2  0  0  1  1  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  0  1  0 -1  1 -1  0  1  0  0  0  0] (Indices: [0, 3, 4, 7, 10, 11, 13, 16, 17, 18, 19]), Candidate: [ 1  1  2  0  0  1  2 -1  1  2  0  0  2  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  0  0  1  0 -1  1  0  0  0  0 -1  1] (Indices: [0, 3, 4, 7, 11, 12, 14, 15, 16, 17, 18]), Candidate: [ 1  1  2  0  0  1  2 -1  1  1  1  1  0  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1  0  0  0  0 -1  0  1 -1  1 -1  1  0] (Indices: [0, 3, 4, 8, 9, 10, 11, 12, 15, 17, 19]), Candidate: [1 1 2 0 0 1 1 1 1 1 0 1 0 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 78950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1  0  0 -1  1  0  0 -1  0  0  1  0  0] (Indices: [0, 3, 4, 8, 9, 10, 12, 13, 14, 18, 19]), Candidate: [ 1  1  2  0  0  1  1  1  1  1 -1  2  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 79000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1  0 -1  1  0  0  0  0 -1  0  0  1  0] (Indices: [0, 3, 4, 8, 9, 11, 12, 13, 14, 15, 19]), Candidate: [1 1 2 0 0 1 1 1 1 0 1 1 1 1 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 79050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1  0 -1  1 -1  0  1  0 -1  1  0  0  0] (Indices: [0, 3, 4, 8, 9, 11, 14, 15, 17, 18, 19]), Candidate: [1 1 2 0 0 1 1 1 1 0 1 0 1 2 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 79100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1 -1  1  0  0  0 -1  0  0  1  0  0  0] (Indices: [0, 3, 4, 8, 10, 11, 12, 13, 17, 18, 19]), Candidate: [1 1 2 0 0 1 1 1 0 2 0 1 1 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 79150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1 -1  1 -1  1  0 -1  1 -1  1  0  0  0] (Indices: [0, 3, 4, 8, 10, 12, 13, 15, 17, 18, 19]), Candidate: [ 1  1  2  0  0  1  1  1  0  2 -1  2  1  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1 -1  0  0  0  1  0  0  0  0  0  0  0] (Indices: [0, 3, 4, 8, 13, 14, 15, 16, 17, 18, 19]), Candidate: [1 1 2 0 0 1 1 1 0 1 0 1 2 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 79250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  1  0  0 -1  1 -1  0  1  0  0  0  0] (Indices: [0, 3, 4, 9, 10, 11, 13, 16, 17, 18, 19]), Candidate: [1 1 2 0 0 1 1 0 2 1 0 0 2 0 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 79300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  1 -1  1  0 -1  1  0  0  0  0 -1  1] (Indices: [0, 3, 4, 9, 11, 12, 14, 15, 16, 17, 18]), Candidate: [1 1 2 0 0 1 1 0 2 0 1 1 0 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 79350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  0  1 -1  1  0  0  0  0  0 -1  1  0] (Indices: [0, 3, 4, 10, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 1  1  2  0  0  1  1  0  1  2 -1  2  1  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0  0  0 -1  1 -1  1  0 -1  0  0  0  1] (Indices: [0, 3, 5, 6, 7, 8, 9, 10, 12, 14, 15]), Candidate: [ 1  1  2 -1  2  1  1  0  1  1 -1  2  0  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 79450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0  0 -1  1  0  0  0 -1  0  0  0  0  1] (Indices: [0, 3, 5, 6, 7, 8, 9, 11, 12, 13, 14]), Candidate: [ 1  1  2 -1  2  1  1  0  1  0  1  1  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 79500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0  0 -1  1 -1  0  0  1 -1  1 -1  1  0] (Indices: [0, 3, 5, 6, 7, 8, 9, 11, 15, 17, 19]), Candidate: [ 1  1  2 -1  2  1  1  0  1  0  1  0  1  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0  0 -1  0  0  1  0 -1  0  0  1  0  0] (Indices: [0, 3, 5, 6, 7, 8, 9, 13, 14, 18, 19]), Candidate: [ 1  1  2 -1  2  1  1  0  1  0  0  1  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 79600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0 -1  1  0 -1  1  0 -1  0  0  1 -1  1] (Indices: [0, 3, 5, 6, 7, 8, 10, 11, 13, 14, 18]), Candidate: [ 1  1  2 -1  2  1  1  0  0  2  0  0  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 79650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0 -1  1 -1  1 -1  1  0 -1  0  0  1  0] (Indices: [0, 3, 5, 6, 7, 8, 10, 12, 14, 15, 19]), Candidate: [ 1  1  2 -1  2  1  1  0  0  2 -1  2  0  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 79700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0 -1  1 -1  0  0  0  1 -1  1  0  0  0] (Indices: [0, 3, 5, 6, 7, 8, 10, 15, 17, 18, 19]), Candidate: [ 1  1  2 -1  2  1  1  0  0  2 -1  1  1  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 79750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0 -1  0  1 -1  1 -1  1 -1  1  0 -1  1] (Indices: [0, 3, 5, 6, 7, 8, 11, 13, 15, 17, 18]), Candidate: [ 1  1  2 -1  2  1  1  0  0  1  1  0  2  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0 -1  0  0  1 -1  1 -1  1 -1  1  0  0] (Indices: [0, 3, 5, 6, 7, 8, 12, 14, 16, 18, 19]), Candidate: [ 1  1  2 -1  2  1  1  0  0  1  0  2  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 79850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  1  0  0 -1  1  0 -1  1 -1  0  0  1] (Indices: [0, 3, 5, 6, 7, 9, 10, 11, 13, 14, 16]), Candidate: [ 1  1  2 -1  2  1  1 -1  2  1  0  0  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 79900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  1  0 -1  1 -1  1  0 -1  1 -1  0  1] (Indices: [0, 3, 5, 6, 7, 9, 10, 12, 14, 15, 17]), Candidate: [ 1  1  2 -1  2  1  1 -1  2  1 -1  2  0  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 79950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  1  0 -1  0  0  0  1  0  0 -1  1  0] (Indices: [0, 3, 5, 6, 7, 9, 10, 15, 16, 17, 19]), Candidate: [ 1  1  2 -1  2  1  1 -1  2  1 -1  1  1  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 80000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  1 -1  1 -1  1 -1  1  0 -1  1 -1  1] (Indices: [0, 3, 5, 6, 7, 9, 11, 13, 15, 16, 18]), Candidate: [ 1  1  2 -1  2  1  1 -1  2  0  1  0  2  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 80050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  1 -1  0  1 -1  1 -1  1  0  0 -1  1] (Indices: [0, 3, 5, 6, 7, 9, 12, 14, 16, 17, 18]), Candidate: [ 1  1  2 -1  2  1  1 -1  2  0  0  2  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 80100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  0  1  0  0 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 3, 5, 6, 7, 10, 11, 12, 14, 16, 18]), Candidate: [ 1  1  2 -1  2  1  1 -1  1  2  0  1  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 80150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  0  1 -1  1  0  0  0  0 -1  0  0  1] (Indices: [0, 3, 5, 6, 7, 10, 12, 13, 14, 15, 16]), Candidate: [ 1  1  2 -1  2  1  1 -1  1  2 -1  2  1  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 80200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  0  1 -1  0  0  1  0  0  0  0 -1  1] (Indices: [0, 3, 5, 6, 7, 10, 14, 15, 16, 17, 18]), Candidate: [ 1  1  2 -1  2  1  1 -1  1  2 -1  1  1  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 80250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  0  0  1 -1  1  0 -1  0  1  0  0  0] (Indices: [0, 3, 5, 6, 7, 11, 13, 14, 17, 18, 19]), Candidate: [ 1  1  2 -1  2  1  1 -1  1  1  1  0  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 80300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1  0  0  0  0 -1  1 -1  0  0  0  1  0] (Indices: [0, 3, 5, 6, 8, 9, 10, 11, 12, 14, 19]), Candidate: [ 1  1  2 -1  2  1  0  1  1  1  0  1  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 80350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1  0  0 -1  1  0  0 -1  0  0  0  1  0] (Indices: [0, 3, 5, 6, 8, 9, 10, 12, 13, 14, 19]), Candidate: [ 1  1  2 -1  2  1  0  1  1  1 -1  2  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 80400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1  0  0 -1  0  1 -1  0  0  1  0  0  0] (Indices: [0, 3, 5, 6, 8, 9, 10, 13, 17, 18, 19]), Candidate: [ 1  1  2 -1  2  1  0  1  1  1 -1  1  2  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 80450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1  0 -1  1  0 -1  0  0  0  1  0  0  0] (Indices: [0, 3, 5, 6, 8, 9, 11, 12, 17, 18, 19]), Candidate: [ 1  1  2 -1  2  1  0  1  1  0  1  1  0  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1  0 -1  0  1  0 -1  1 -1  1 -1  1  0] (Indices: [0, 3, 5, 6, 8, 9, 12, 13, 15, 17, 19]), Candidate: [ 1  1  2 -1  2  1  0  1  1  0  0  2  1  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1 -1  1  0  0  0 -1  1 -1  0  0  1  0] (Indices: [0, 3, 5, 6, 8, 10, 11, 12, 13, 15, 19]), Candidate: [ 1  1  2 -1  2  1  0  1  0  2  0  1  1  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1 -1  1  0 -1  0  1  0 -1  1  0 -1  1] (Indices: [0, 3, 5, 6, 8, 10, 11, 14, 15, 17, 18]), Candidate: [ 1  1  2 -1  2  1  0  1  0  2  0  0  1  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1 -1  1 -1  0  1  0  0 -1  1  0 -1  1] (Indices: [0, 3, 5, 6, 8, 10, 13, 14, 15, 17, 18]), Candidate: [ 1  1  2 -1  2  1  0  1  0  2 -1  1  2  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 80700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1 -1  0  1  0 -1  0  1  0 -1  1  0  0] (Indices: [0, 3, 5, 6, 8, 11, 12, 15, 16, 18, 19]), Candidate: [ 1  1  2 -1  2  1  0  1  0  1  1  1  0  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1 -1  0  0  0  1 -1  1  0  0  0  0  0] (Indices: [0, 3, 5, 6, 8, 13, 15, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  2  1  0  1  0  1  0  1  2  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  1  0  0 -1  1 -1  1 -1  1  0 -1  1] (Indices: [0, 3, 5, 6, 9, 10, 11, 13, 15, 17, 18]), Candidate: [ 1  1  2 -1  2  1  0  0  2  1  0  0  2  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  1  0 -1  1 -1  1 -1  1 -1  1  0  0] (Indices: [0, 3, 5, 6, 9, 10, 12, 14, 16, 18, 19]), Candidate: [ 1  1  2 -1  2  1  0  0  2  1 -1  2  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 80900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  1 -1  1  0 -1  1  0  0 -1  0  1  0] (Indices: [0, 3, 5, 6, 9, 11, 12, 14, 15, 16, 19]), Candidate: [ 1  1  2 -1  2  1  0  0  2  0  1  1  0  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  1 -1  0  1 -1  1  0  0  0 -1  1  0] (Indices: [0, 3, 5, 6, 9, 12, 14, 15, 16, 17, 19]), Candidate: [ 1  1  2 -1  2  1  0  0  2  0  0  2  0  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  0  1  0 -1  1  0  0 -1  1  0 -1  1] (Indices: [0, 3, 5, 6, 10, 11, 13, 14, 15, 17, 18]), Candidate: [ 1  1  2 -1  2  1  0  0  1  2  0  0  2  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  0  0  1  0  0  0  0 -1  1 -1  1  0] (Indices: [0, 3, 5, 6, 11, 12, 13, 14, 15, 17, 19]), Candidate: [ 1  1  2 -1  2  1  0  0  1  1  1  1  1  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0  0  0  0  0 -1  0  0  0  1  0 -1  1] (Indices: [0, 3, 5, 7, 8, 9, 10, 11, 12, 17, 18]), Candidate: [ 1  1  2 -1  2  0  2  0  1  1  0  1  0  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0  0  0 -1  1  0 -1  0  0  1  0 -1  1] (Indices: [0, 3, 5, 7, 8, 9, 10, 12, 13, 17, 18]), Candidate: [ 1  1  2 -1  2  0  2  0  1  1 -1  2  1  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 81200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0  0  0 -1  0  0  1 -1  1  0 -1  1  0] (Indices: [0, 3, 5, 7, 8, 9, 10, 14, 16, 17, 19]), Candidate: [ 1  1  2 -1  2  0  2  0  1  1 -1  1  1  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 81250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0  0 -1  1 -1  1  0 -1  0  1  0 -1  1] (Indices: [0, 3, 5, 7, 8, 9, 11, 13, 14, 17, 18]), Candidate: [ 1  1  2 -1  2  0  2  0  1  0  1  0  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 81300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0  0 -1  0  1 -1  1  0  0 -1  0  1  0] (Indices: [0, 3, 5, 7, 8, 9, 12, 14, 15, 16, 19]), Candidate: [ 1  1  2 -1  2  0  2  0  1  0  0  2  0  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0 -1  1  0  0 -1  1  0 -1  1 -1  0  1] (Indices: [0, 3, 5, 7, 8, 10, 11, 12, 14, 15, 17]), Candidate: [ 1  1  2 -1  2  0  2  0  0  2  0  1  0  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0 -1  1  0 -1  0  0  1  0  0 -1  1  0] (Indices: [0, 3, 5, 7, 8, 10, 11, 15, 16, 17, 19]), Candidate: [ 1  1  2 -1  2  0  2  0  0  2  0  0  1  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0 -1  1 -1  0  1 -1  1  0  0 -1  1  0] (Indices: [0, 3, 5, 7, 8, 10, 13, 15, 16, 17, 19]), Candidate: [ 1  1  2 -1  2  0  2  0  0  2 -1  1  2  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 81500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0 -1  0  1 -1  1  0  0 -1  0  1  0  0] (Indices: [0, 3, 5, 7, 8, 11, 13, 14, 15, 18, 19]), Candidate: [ 1  1  2 -1  2  0  2  0  0  1  1  0  2  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  1  0  0  0  0 -1  1 -1  1 -1  0  1] (Indices: [0, 3, 5, 7, 9, 10, 11, 12, 13, 15, 17]), Candidate: [ 1  1  2 -1  2  0  2 -1  2  1  0  1  1  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 81600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  1  0  0 -1  0  1  0  0 -1  1 -1  1] (Indices: [0, 3, 5, 7, 9, 10, 11, 14, 15, 16, 18]), Candidate: [ 1  1  2 -1  2  0  2 -1  2  1  0  0  1  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 81650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  1  0 -1  0  1  0  0  0 -1  1 -1  1] (Indices: [0, 3, 5, 7, 9, 10, 13, 14, 15, 16, 18]), Candidate: [ 1  1  2 -1  2  0  2 -1  2  1 -1  1  2  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 81700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  1 -1  1  0 -1  0  1  0  0  0 -1  1] (Indices: [0, 3, 5, 7, 9, 11, 12, 15, 16, 17, 18]), Candidate: [ 1  1  2 -1  2  0  2 -1  2  0  1  1  0  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 81750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  1 -1  0  0  1  0  0 -1  1  0  0  0] (Indices: [0, 3, 5, 7, 9, 13, 14, 15, 17, 18, 19]), Candidate: [ 1  1  2 -1  2  0  2 -1  2  0  0  1  2  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 81800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  0  1  0 -1  1 -1  1  0  0 -1  1  0] (Indices: [0, 3, 5, 7, 10, 11, 13, 15, 16, 17, 19]), Candidate: [ 1  1  2 -1  2  0  2 -1  1  2  0  0  2  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 81850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  0  0  1  0  0 -1  1  0 -1  1  0  0] (Indices: [0, 3, 5, 7, 11, 12, 13, 15, 16, 18, 19]), Candidate: [ 1  1  2 -1  2  0  2 -1  1  1  1  1  1  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 81900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1  0  0  0  0 -1  0  1  0 -1  1 -1  1] (Indices: [0, 3, 5, 8, 9, 10, 11, 12, 15, 16, 18]), Candidate: [ 1  1  2 -1  2  0  1  1  1  1  0  1  0  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1  0  0 -1  1  0  0 -1  1 -1  0  1  0] (Indices: [0, 3, 5, 8, 9, 10, 12, 13, 14, 16, 19]), Candidate: [ 1  1  2 -1  2  0  1  1  1  1 -1  2  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 82000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1  0 -1  1  0  0  0  0  0 -1  0  0  1] (Indices: [0, 3, 5, 8, 9, 11, 12, 13, 14, 15, 16]), Candidate: [ 1  1  2 -1  2  0  1  1  1  0  1  1  1  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1  0 -1  1 -1  0  1  0  0  0  0 -1  1] (Indices: [0, 3, 5, 8, 9, 11, 14, 15, 16, 17, 18]), Candidate: [ 1  1  2 -1  2  0  1  1  1  0  1  0  1  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1 -1  1  0  0  0 -1  0  1  0  0 -1  1] (Indices: [0, 3, 5, 8, 10, 11, 12, 13, 16, 17, 18]), Candidate: [ 1  1  2 -1  2  0  1  1  0  2  0  1  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1 -1  1 -1  1  0 -1  1  0  0  0 -1  1] (Indices: [0, 3, 5, 8, 10, 12, 13, 15, 16, 17, 18]), Candidate: [ 1  1  2 -1  2  0  1  1  0  2 -1  2  1  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 82200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1 -1  0  0  1  0  0 -1  1  0  0  0  0] (Indices: [0, 3, 5, 8, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  2  0  1  1  0  1  0  2  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 82250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  1  0  0 -1  1 -1  1  0  0 -1  1  0] (Indices: [0, 3, 5, 9, 10, 11, 13, 15, 16, 17, 19]), Candidate: [ 1  1  2 -1  2  0  1  0  2  1  0  0  2  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  1 -1  1  0  0 -1  1  0 -1  1  0  0] (Indices: [0, 3, 5, 9, 11, 12, 13, 15, 16, 18, 19]), Candidate: [ 1  1  2 -1  2  0  1  0  2  0  1  1  1  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  0  1  0 -1  1 -1  1  0  0  0  0  0] (Indices: [0, 3, 5, 10, 11, 13, 15, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  2  0  1  0  1  2  0  0  2  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0  0  0  0 -1  1 -1  0  1 -1  1 -1  1] (Indices: [0, 3, 6, 7, 8, 9, 10, 11, 13, 16, 18]), Candidate: [ 1  1  2 -1  1  2  1  0  1  1  0  0  2  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0  0  0 -1  1 -1  0  1  0  0 -1  0  1] (Indices: [0, 3, 6, 7, 8, 9, 10, 12, 15, 16, 17]), Candidate: [ 1  1  2 -1  1  2  1  0  1  1 -1  2  0  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 82500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0  0 -1  1  0  0 -1  1  0 -1  0  0  1] (Indices: [0, 3, 6, 7, 8, 9, 11, 12, 13, 15, 16]), Candidate: [ 1  1  2 -1  1  2  1  0  1  0  1  1  1  0  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0  0 -1  1 -1  0  1  0  0  0 -1  0  1] (Indices: [0, 3, 6, 7, 8, 9, 11, 14, 15, 16, 17]), Candidate: [ 1  1  2 -1  1  2  1  0  1  0  1  0  1  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0  0 -1  0  0  1  0  0  0  0 -1  0  1] (Indices: [0, 3, 6, 7, 8, 9, 13, 14, 15, 16, 17]), Candidate: [ 1  1  2 -1  1  2  1  0  1  0  0  1  2  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0 -1  1  0  0 -1  0  1 -1  1 -1  1  0] (Indices: [0, 3, 6, 7, 8, 10, 11, 12, 15, 17, 19]), Candidate: [ 1  1  2 -1  1  2  1  0  0  2  0  1  0  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0 -1  1 -1  1  0  0 -1  0  0  1  0  0] (Indices: [0, 3, 6, 7, 8, 10, 12, 13, 14, 18, 19]), Candidate: [ 1  1  2 -1  1  2  1  0  0  2 -1  2  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 82750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0 -1  0  1  0  0  0  0 -1  0  0  1  0] (Indices: [0, 3, 6, 7, 8, 11, 12, 13, 14, 15, 19]), Candidate: [ 1  1  2 -1  1  2  1  0  0  1  1  1  1  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0 -1  0  1 -1  0  1  0 -1  1  0  0  0] (Indices: [0, 3, 6, 7, 8, 11, 14, 15, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  2  1  0  0  1  1  0  1  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  1  0  0  0 -1  1 -1  1  0 -1  0  1] (Indices: [0, 3, 6, 7, 9, 10, 11, 12, 14, 16, 17]), Candidate: [ 1  1  2 -1  1  2  1 -1  2  1  0  1  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 82900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  1  0  0 -1  0  0  0  1  0  0  0  0] (Indices: [0, 3, 6, 7, 9, 10, 11, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  2  1 -1  2  1  0  0  1  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 82950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  1  0 -1  0  1 -1  0  1  0  0  0  0] (Indices: [0, 3, 6, 7, 9, 10, 13, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  2  1 -1  2  1 -1  1  2  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 83000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  1 -1  1 -1  1  0 -1  1 -1  1  0  0] (Indices: [0, 3, 6, 7, 9, 11, 13, 14, 16, 18, 19]), Candidate: [ 1  1  2 -1  1  2  1 -1  2  0  1  0  2  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 83050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  0  1  0  0  0  0 -1  0  0  1  0  0] (Indices: [0, 3, 6, 7, 10, 11, 12, 13, 14, 18, 19]), Candidate: [ 1  1  2 -1  1  2  1 -1  1  2  0  1  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 83100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  0  1 -1  1  0  0  0 -1  1  0 -1  1] (Indices: [0, 3, 6, 7, 10, 12, 13, 14, 15, 17, 18]), Candidate: [ 1  1  2 -1  1  2  1 -1  1  2 -1  2  1  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 83150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  0  0  1 -1  1  0 -1  1  0  0  0  0] (Indices: [0, 3, 6, 7, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  2  1 -1  1  1  1  0  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 83200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1  0  0  0 -1  1  0 -1  1  0 -1  0  1] (Indices: [0, 3, 6, 8, 9, 10, 11, 13, 14, 16, 17]), Candidate: [ 1  1  2 -1  1  2  0  1  1  1  0  0  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 83250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1  0  0 -1  1  0 -1  0  0  1  0  0  0] (Indices: [0, 3, 6, 8, 9, 10, 12, 13, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  2  0  1  1  1 -1  2  1  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 83300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1  0 -1  1  0  0 -1  1 -1  1  0 -1  1] (Indices: [0, 3, 6, 8, 9, 11, 12, 13, 15, 17, 18]), Candidate: [ 1  1  2 -1  1  2  0  1  1  0  1  1  1  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1  0 -1  0  1  0  0 -1  1  0 -1  1  0] (Indices: [0, 3, 6, 8, 9, 12, 13, 14, 16, 17, 19]), Candidate: [ 1  1  2 -1  1  2  0  1  1  0  0  2  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 83400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1 -1  1  0  0 -1  1 -1  0  1  0  0  0] (Indices: [0, 3, 6, 8, 10, 11, 12, 14, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  2  0  1  0  2  0  1  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 83450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1 -1  1 -1  0  1  0  0  0 -1  1  0  0] (Indices: [0, 3, 6, 8, 10, 13, 14, 15, 16, 18, 19]), Candidate: [ 1  1  2 -1  1  2  0  1  0  2 -1  1  2  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 83500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  1  0  0  0  0  0 -1  0  0  1  0  0] (Indices: [0, 3, 6, 9, 10, 11, 12, 13, 14, 18, 19]), Candidate: [ 1  1  2 -1  1  2  0  0  2  1  0  1  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 83550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  1  0 -1  1  0  0  0 -1  1  0 -1  1] (Indices: [0, 3, 6, 9, 10, 12, 13, 14, 15, 17, 18]), Candidate: [ 1  1  2 -1  1  2  0  0  2  1 -1  2  1  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 83600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  1 -1  1 -1  1  0 -1  1  0  0  0  0] (Indices: [0, 3, 6, 9, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  2  0  0  2  0  1  0  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 83650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  0  0  1  0  0  0  0 -1  1  0  0  0] (Indices: [0, 3, 6, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  2  0  0  1  1  1  1  1  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0  0  0  0 -1  1  0 -1  0  0  1  0  0] (Indices: [0, 3, 7, 8, 9, 10, 11, 13, 14, 18, 19]), Candidate: [ 1  1  2 -1  1  1  2  0  1  1  0  0  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 83750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0  0  0 -1  1 -1  1  0 -1  1 -1  1  0] (Indices: [0, 3, 7, 8, 9, 10, 12, 14, 15, 17, 19]), Candidate: [ 1  1  2 -1  1  1  2  0  1  1 -1  2  0  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 83800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0  0 -1  1  0  0 -1  0  1 -1  1  0  0] (Indices: [0, 3, 7, 8, 9, 11, 12, 13, 16, 18, 19]), Candidate: [ 1  1  2 -1  1  1  2  0  1  0  1  1  1  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0  0 -1  0  1  0 -1  1  0 -1  1  0  0] (Indices: [0, 3, 7, 8, 9, 12, 13, 15, 16, 18, 19]), Candidate: [ 1  1  2 -1  1  1  2  0  1  0  0  2  1  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0 -1  1  0  0 -1  0  0  1  0  0  0  0] (Indices: [0, 3, 7, 8, 10, 11, 12, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  1  2  0  0  2  0  1  0  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0 -1  0  1  0  0  0  0  0  0 -1  0  1] (Indices: [0, 3, 7, 8, 11, 12, 13, 14, 15, 16, 17]), Candidate: [ 1  1  2 -1  1  1  2  0  0  1  1  1  1  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  1  0  0  0  0 -1  1 -1  1 -1  1  0] (Indices: [0, 3, 7, 9, 10, 11, 12, 13, 15, 17, 19]), Candidate: [ 1  1  2 -1  1  1  2 -1  2  1  0  1  1  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 84050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  1  0 -1  1  0  0 -1  1 -1  1  0  0] (Indices: [0, 3, 7, 9, 10, 12, 13, 14, 16, 18, 19]), Candidate: [ 1  1  2 -1  1  1  2 -1  2  1 -1  2  1  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 84100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  1 -1  0  1  0  0  0  0 -1  1  0  0] (Indices: [0, 3, 7, 9, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 1  1  2 -1  1  1  2 -1  2  0  0  2  1  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 84150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  0  0  0  1  0  0  0  0  0  0  0  0] (Indices: [0, 3, 7, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  1  2 -1  1  1  0  2  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 84200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1  0  0  0 -1  1 -1  0  1  0  0  0  0] (Indices: [0, 3, 8, 9, 10, 11, 13, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  1  1  1  1  1  0  0  2  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1  0 -1  1  0 -1  1  0  0  0  0 -1  1] (Indices: [0, 3, 8, 9, 11, 12, 14, 15, 16, 17, 18]), Candidate: [ 1  1  2 -1  1  1  1  1  1  0  1  1  0  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1 -1  1 -1  1  0  0  0  0  0 -1  1  0] (Indices: [0, 3, 8, 10, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 1  1  2 -1  1  1  1  1  0  2 -1  2  1  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 84350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  0  1  0 -1  1 -1  1  0  0  0  0  0  0] (Indices: [0, 3, 9, 10, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  1  1  0  2  1 -1  2  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 84400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0  0  0 -1  1  0 -1  1 -1  0  0  0  1] (Indices: [0, 4, 5, 6, 7, 8, 9, 10, 12, 13, 15]), Candidate: [ 1  1  1  1  1  1  1  0  1  1 -1  2  1  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0  0  0 -1  0  0  0  1 -1  0  1  0  0] (Indices: [0, 4, 5, 6, 7, 8, 9, 10, 15, 18, 19]), Candidate: [ 1  1  1  1  1  1  1  0  1  1 -1  1  1  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0  0 -1  1 -1  0  1 -1  0  0  1  0  0] (Indices: [0, 4, 5, 6, 7, 8, 9, 11, 14, 18, 19]), Candidate: [ 1  1  1  1  1  1  1  0  1  0  1  0  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0  0 -1  0  0  1  0 -1  1  0 -1  0  1] (Indices: [0, 4, 5, 6, 7, 8, 9, 13, 14, 16, 17]), Candidate: [ 1  1  1  1  1  1  1  0  1  0  0  1  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0 -1  1  0  0 -1  0  0  0  1 -1  1  0] (Indices: [0, 4, 5, 6, 7, 8, 10, 11, 12, 17, 19]), Candidate: [1 1 1 1 1 1 1 0 0 2 0 1 0 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 84650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0 -1  1 -1  1  0 -1  0  0  1 -1  1  0] (Indices: [0, 4, 5, 6, 7, 8, 10, 12, 13, 17, 19]), Candidate: [ 1  1  1  1  1  1  1  0  0  2 -1  2  1  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0 -1  1 -1  0  0  1 -1  1 -1  1  0  0] (Indices: [0, 4, 5, 6, 7, 8, 10, 14, 16, 18, 19]), Candidate: [ 1  1  1  1  1  1  1  0  0  2 -1  1  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 84750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0 -1  0  1 -1  1  0 -1  0  1 -1  1  0] (Indices: [0, 4, 5, 6, 7, 8, 11, 13, 14, 17, 19]), Candidate: [ 1  1  1  1  1  1  1  0  0  1  1  0  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0 -1  0  0  1 -1  1  0 -1  1  0 -1  1] (Indices: [0, 4, 5, 6, 7, 8, 12, 14, 15, 17, 18]), Candidate: [1 1 1 1 1 1 1 0 0 1 0 2 0 2 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 84850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  1  0  0  0 -1  0  0  1 -1  0  1  0] (Indices: [0, 4, 5, 6, 7, 9, 10, 11, 12, 16, 19]), Candidate: [ 1  1  1  1  1  1  1 -1  2  1  0  1  0  1  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  1  0 -1  1  0 -1  0  1 -1  0  1  0] (Indices: [0, 4, 5, 6, 7, 9, 10, 12, 13, 16, 19]), Candidate: [ 1  1  1  1  1  1  1 -1  2  1 -1  2  1  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 84950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  1  0 -1  0  0  1 -1  1  0  0 -1  1] (Indices: [0, 4, 5, 6, 7, 9, 10, 14, 16, 17, 18]), Candidate: [ 1  1  1  1  1  1  1 -1  2  1 -1  1  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 85000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  1 -1  1 -1  1  0 -1  1 -1  0  1  0] (Indices: [0, 4, 5, 6, 7, 9, 11, 13, 14, 16, 19]), Candidate: [ 1  1  1  1  1  1  1 -1  2  0  1  0  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 85050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  1 -1  0  1 -1  1  0  0 -1  1 -1  1] (Indices: [0, 4, 5, 6, 7, 9, 12, 14, 15, 16, 18]), Candidate: [ 1  1  1  1  1  1  1 -1  2  0  0  2  0  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  0  1  0  0 -1  1  0  0 -1  0  0  1] (Indices: [0, 4, 5, 6, 7, 10, 11, 12, 14, 15, 16]), Candidate: [ 1  1  1  1  1  1  1 -1  1  2  0  1  0  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  0  1  0 -1  0  0  1  0  0  0 -1  1] (Indices: [0, 4, 5, 6, 7, 10, 11, 15, 16, 17, 18]), Candidate: [ 1  1  1  1  1  1  1 -1  1  2  0  0  1  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  0  1 -1  0  1 -1  1  0  0  0 -1  1] (Indices: [0, 4, 5, 6, 7, 10, 13, 15, 16, 17, 18]), Candidate: [ 1  1  1  1  1  1  1 -1  1  2 -1  1  2  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 85250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  0  0  1 -1  1  0  0 -1  1 -1  1  0] (Indices: [0, 4, 5, 6, 7, 11, 13, 14, 15, 17, 19]), Candidate: [ 1  1  1  1  1  1  1 -1  1  1  1  0  2  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1  0  0  0  0  0 -1  0  0  0  0  1  0] (Indices: [0, 4, 5, 6, 8, 9, 10, 11, 12, 13, 19]), Candidate: [1 1 1 1 1 1 0 1 1 1 0 1 1 0 0 1 1 1 2 6]
 -> Valid neighbor added.
Attempt 85350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1  0  0  0 -1  0  0  0  0  1  0  0  0] (Indices: [0, 4, 5, 6, 8, 9, 10, 11, 17, 18, 19]), Candidate: [1 1 1 1 1 1 0 1 1 1 0 0 1 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 85400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1  0  0 -1  0  1 -1  1 -1  1 -1  1  0] (Indices: [0, 4, 5, 6, 8, 9, 10, 13, 15, 17, 19]), Candidate: [ 1  1  1  1  1  1  0  1  1  1 -1  1  2  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1  0 -1  1  0 -1  0  1 -1  1 -1  1  0] (Indices: [0, 4, 5, 6, 8, 9, 11, 12, 15, 17, 19]), Candidate: [1 1 1 1 1 1 0 1 1 0 1 1 0 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 85500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1  0 -1  0  1  0  0 -1  0  0  1  0  0] (Indices: [0, 4, 5, 6, 8, 9, 12, 13, 14, 18, 19]), Candidate: [ 1  1  1  1  1  1  0  1  1  0  0  2  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1 -1  1  0  0  0  0 -1  0  0  1 -1  1] (Indices: [0, 4, 5, 6, 8, 10, 11, 12, 13, 14, 18]), Candidate: [ 1  1  1  1  1  1  0  1  0  2  0  1  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1 -1  1  0 -1  1 -1  0  1 -1  1  0  0] (Indices: [0, 4, 5, 6, 8, 10, 11, 13, 16, 18, 19]), Candidate: [1 1 1 1 1 1 0 1 0 2 0 0 2 0 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 85650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1 -1  1 -1  1 -1  0  1 -1  1  0  0  0] (Indices: [0, 4, 5, 6, 8, 10, 12, 15, 17, 18, 19]), Candidate: [ 1  1  1  1  1  1  0  1  0  2 -1  2  0  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1 -1  0  1  0 -1  1 -1  1  0 -1  1  0] (Indices: [0, 4, 5, 6, 8, 11, 12, 14, 16, 17, 19]), Candidate: [ 1  1  1  1  1  1  0  1  0  1  1  1  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1 -1  0  0  0  1  0  0  0  0  0 -1  1] (Indices: [0, 4, 5, 6, 8, 13, 14, 15, 16, 17, 18]), Candidate: [1 1 1 1 1 1 0 1 0 1 0 1 2 1 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 85800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  1  0  0 -1  1  0 -1  0  1 -1  1  0] (Indices: [0, 4, 5, 6, 9, 10, 11, 13, 14, 17, 19]), Candidate: [ 1  1  1  1  1  1  0  0  2  1  0  0  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  1  0 -1  1 -1  1  0 -1  1  0 -1  1] (Indices: [0, 4, 5, 6, 9, 10, 12, 14, 15, 17, 18]), Candidate: [ 1  1  1  1  1  1  0  0  2  1 -1  2  0  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  1 -1  1  0  0 -1  0  1  0 -1  1  0] (Indices: [0, 4, 5, 6, 9, 11, 12, 13, 16, 17, 19]), Candidate: [1 1 1 1 1 1 0 0 2 0 1 1 1 0 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 85950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  1 -1  0  1  0 -1  1  0  0 -1  1  0] (Indices: [0, 4, 5, 6, 9, 12, 13, 15, 16, 17, 19]), Candidate: [1 1 1 1 1 1 0 0 2 0 0 2 1 0 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 86000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  0  1  0  0 -1  0  1 -1  1  0  0  0] (Indices: [0, 4, 5, 6, 10, 11, 12, 15, 17, 18, 19]), Candidate: [1 1 1 1 1 1 0 0 1 2 0 1 0 1 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 86050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  0  1 -1  0  0  1  0  0  0  0  0  0] (Indices: [0, 4, 5, 6, 10, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  1  1  1  1  1  0  0  1  2 -1  1  1  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0  0  0  0  0 -1  0  1 -1  0  1 -1  1] (Indices: [0, 4, 5, 7, 8, 9, 10, 11, 12, 15, 18]), Candidate: [1 1 1 1 1 0 2 0 1 1 0 1 0 1 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 86150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0  0  0 -1  1  0 -1  1 -1  0  1 -1  1] (Indices: [0, 4, 5, 7, 8, 9, 10, 12, 13, 15, 18]), Candidate: [ 1  1  1  1  1  0  2  0  1  1 -1  2  1  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0  0  0 -1  0  0  1  0  0 -1  0  1  0] (Indices: [0, 4, 5, 7, 8, 9, 10, 14, 15, 16, 19]), Candidate: [ 1  1  1  1  1  0  2  0  1  1 -1  1  1  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0  0 -1  1 -1  1  0  0 -1  0  1 -1  1] (Indices: [0, 4, 5, 7, 8, 9, 11, 13, 14, 15, 18]), Candidate: [1 1 1 1 1 0 2 0 1 0 1 0 2 1 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 86300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0  0 -1  0  1  0 -1  0  1  0 -1  1  0] (Indices: [0, 4, 5, 7, 8, 9, 12, 13, 16, 17, 19]), Candidate: [1 1 1 1 1 0 2 0 1 0 0 2 1 0 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 86350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0 -1  1  0  0  0 -1  0  1 -1  0  1  0] (Indices: [0, 4, 5, 7, 8, 10, 11, 12, 13, 16, 19]), Candidate: [1 1 1 1 1 0 2 0 0 2 0 1 1 0 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 86400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0 -1  1  0 -1  0  1 -1  1  0  0 -1  1] (Indices: [0, 4, 5, 7, 8, 10, 11, 14, 16, 17, 18]), Candidate: [ 1  1  1  1  1  0  2  0  0  2  0  0  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0 -1  1 -1  0  1  0 -1  1  0  0 -1  1] (Indices: [0, 4, 5, 7, 8, 10, 13, 14, 16, 17, 18]), Candidate: [ 1  1  1  1  1  0  2  0  0  2 -1  1  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 86500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0 -1  0  1 -1  1  0  0  0  0 -1  0  1] (Indices: [0, 4, 5, 7, 8, 11, 13, 14, 15, 16, 17]), Candidate: [1 1 1 1 1 0 2 0 0 1 1 0 2 1 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 86550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  1  0  0  0  0  0 -1  1 -1  0  0  1] (Indices: [0, 4, 5, 7, 9, 10, 11, 12, 13, 14, 16]), Candidate: [ 1  1  1  1  1  0  2 -1  2  1  0  1  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 86600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  1  0  0 -1  1 -1  0  1  0  0 -1  1] (Indices: [0, 4, 5, 7, 9, 10, 11, 13, 16, 17, 18]), Candidate: [ 1  1  1  1  1  0  2 -1  2  1  0  0  2  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  1  0 -1  1 -1  0  1  0  0 -1  1  0] (Indices: [0, 4, 5, 7, 9, 10, 12, 15, 16, 17, 19]), Candidate: [ 1  1  1  1  1  0  2 -1  2  1 -1  2  0  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 86700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  1 -1  1  0 -1  1  0 -1  0  1  0  0] (Indices: [0, 4, 5, 7, 9, 11, 12, 14, 15, 18, 19]), Candidate: [ 1  1  1  1  1  0  2 -1  2  0  1  1  0  2  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  1 -1  0  1 -1  1 -1  1  0  0  0  0] (Indices: [0, 4, 5, 7, 9, 12, 14, 16, 17, 18, 19]), Candidate: [ 1  1  1  1  1  0  2 -1  2  0  0  2  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 86800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  0  1  0 -1  1  0 -1  1  0  0 -1  1] (Indices: [0, 4, 5, 7, 10, 11, 13, 14, 16, 17, 18]), Candidate: [ 1  1  1  1  1  0  2 -1  1  2  0  0  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 86850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  0  0  1  0  0  0 -1  1  0 -1  1  0] (Indices: [0, 4, 5, 7, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 1  1  1  1  1  0  2 -1  1  1  1  1  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 86900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1  0  0  0  0 -1  1 -1  1 -1  0  1  0] (Indices: [0, 4, 5, 8, 9, 10, 11, 12, 14, 16, 19]), Candidate: [ 1  1  1  1  1  0  1  1  1  1  0  1  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1  0  0 -1  1  0  0  0 -1  1 -1  0  1] (Indices: [0, 4, 5, 8, 9, 10, 12, 13, 14, 15, 17]), Candidate: [ 1  1  1  1  1  0  1  1  1  1 -1  2  1  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1  0  0 -1  0  0  1  0  0  0 -1  1  0] (Indices: [0, 4, 5, 8, 9, 10, 14, 15, 16, 17, 19]), Candidate: [ 1  1  1  1  1  0  1  1  1  1 -1  1  1  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1  0 -1  1 -1  1 -1  1  0  0  0 -1  1] (Indices: [0, 4, 5, 8, 9, 11, 13, 15, 16, 17, 18]), Candidate: [1 1 1 1 1 0 1 1 1 0 1 0 2 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 87100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1 -1  1  0  0  0 -1  1  0 -1  1 -1  1] (Indices: [0, 4, 5, 8, 10, 11, 12, 13, 15, 16, 18]), Candidate: [1 1 1 1 1 0 1 1 0 2 0 1 1 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 87150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1 -1  1 -1  1  0  0  0 -1  0  1  0  0] (Indices: [0, 4, 5, 8, 10, 12, 13, 14, 15, 18, 19]), Candidate: [ 1  1  1  1  1  0  1  1  0  2 -1  2  1  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1 -1  0  1 -1  0  1  0  0  0  0  0  0] (Indices: [0, 4, 5, 8, 11, 14, 15, 16, 17, 18, 19]), Candidate: [1 1 1 1 1 0 1 1 0 1 1 0 1 2 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 87250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  1  0  0 -1  1  0 -1  1  0  0 -1  1] (Indices: [0, 4, 5, 9, 10, 11, 13, 14, 16, 17, 18]), Candidate: [ 1  1  1  1  1  0  1  0  2  1  0  0  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  1 -1  1  0  0  0 -1  1  0 -1  1  0] (Indices: [0, 4, 5, 9, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 1  1  1  1  1  0  1  0  2  0  1  1  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  0  1  0 -1  1  0  0  0  0  0 -1  1] (Indices: [0, 4, 5, 10, 11, 13, 14, 15, 16, 17, 18]), Candidate: [1 1 1 1 1 0 1 0 1 2 0 0 2 1 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 87400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0  0  0  0 -1  1 -1  1  0 -1  0  0  1] (Indices: [0, 4, 6, 7, 8, 9, 10, 11, 13, 15, 16]), Candidate: [1 1 1 1 0 2 1 0 1 1 0 0 2 0 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 87450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0  0  0 -1  1 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 4, 6, 7, 8, 9, 10, 12, 14, 16, 18]), Candidate: [ 1  1  1  1  0  2  1  0  1  1 -1  2  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 87500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0  0 -1  1  0  0  0  0 -1  0  0  0  1] (Indices: [0, 4, 6, 7, 8, 9, 11, 12, 13, 14, 15]), Candidate: [1 1 1 1 0 2 1 0 1 0 1 1 1 1 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 87550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0  0 -1  1 -1  1 -1  1 -1  0  1  0  0] (Indices: [0, 4, 6, 7, 8, 9, 11, 13, 15, 18, 19]), Candidate: [1 1 1 1 0 2 1 0 1 0 1 0 2 0 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 87600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0  0 -1  0  1 -1  0  1  0  0  0 -1  1] (Indices: [0, 4, 6, 7, 8, 9, 12, 15, 16, 17, 18]), Candidate: [1 1 1 1 0 2 1 0 1 0 0 2 0 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 87650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0 -1  1  0  0 -1  1 -1  0  0  1  0  0] (Indices: [0, 4, 6, 7, 8, 10, 11, 12, 14, 18, 19]), Candidate: [ 1  1  1  1  0  2  1  0  0  2  0  1  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0 -1  1 -1  1  0  0 -1  1  0 -1  0  1] (Indices: [0, 4, 6, 7, 8, 10, 12, 13, 14, 16, 17]), Candidate: [ 1  1  1  1  0  2  1  0  0  2 -1  2  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 87750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0 -1  1 -1  0  0  1 -1  1  0  0  0  0] (Indices: [0, 4, 6, 7, 8, 10, 14, 16, 17, 18, 19]), Candidate: [ 1  1  1  1  0  2  1  0  0  2 -1  1  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 87800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0 -1  0  1 -1  1 -1  1 -1  1  0  0  0] (Indices: [0, 4, 6, 7, 8, 11, 13, 15, 17, 18, 19]), Candidate: [1 1 1 1 0 2 1 0 0 1 1 0 2 0 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 87850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  1  0  0  0  0 -1  0  0  0  1  0  0] (Indices: [0, 4, 6, 7, 9, 10, 11, 12, 13, 18, 19]), Candidate: [ 1  1  1  1  0  2  1 -1  2  1  0  1  1  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  1  0  0 -1  0  1 -1  0  1  0  0  0] (Indices: [0, 4, 6, 7, 9, 10, 11, 14, 17, 18, 19]), Candidate: [ 1  1  1  1  0  2  1 -1  2  1  0  0  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 87950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  1  0 -1  0  1  0 -1  0  1  0  0  0] (Indices: [0, 4, 6, 7, 9, 10, 13, 14, 17, 18, 19]), Candidate: [ 1  1  1  1  0  2  1 -1  2  1 -1  1  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 88000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  1 -1  1 -1  1  0  0 -1  1  0 -1  1] (Indices: [0, 4, 6, 7, 9, 11, 13, 14, 15, 17, 18]), Candidate: [ 1  1  1  1  0  2  1 -1  2  0  1  0  2  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  0  1  0  0  0  0 -1  1  0 -1  0  1] (Indices: [0, 4, 6, 7, 10, 11, 12, 13, 14, 16, 17]), Candidate: [ 1  1  1  1  0  2  1 -1  1  2  0  1  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 88100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  0  1  0 -1  0  1 -1  1  0  0  0  0] (Indices: [0, 4, 6, 7, 10, 11, 14, 16, 17, 18, 19]), Candidate: [ 1  1  1  1  0  2  1 -1  1  2  0  0  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 88150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  0  0  1  0 -1  0  1  0  0  0  0  0] (Indices: [0, 4, 6, 7, 11, 12, 15, 16, 17, 18, 19]), Candidate: [ 1  1  1  1  0  2  1 -1  1  1  1  1  0  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1  0  0  0  0 -1  0  0  0  1  0  0  0] (Indices: [0, 4, 6, 8, 9, 10, 11, 12, 17, 18, 19]), Candidate: [1 1 1 1 0 2 0 1 1 1 0 1 0 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 88250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1  0  0 -1  1  0 -1  1 -1  1 -1  1  0] (Indices: [0, 4, 6, 8, 9, 10, 12, 13, 15, 17, 19]), Candidate: [ 1  1  1  1  0  2  0  1  1  1 -1  2  1  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1  0 -1  1  0  0  0 -1  0  1 -1  1  0] (Indices: [0, 4, 6, 8, 9, 11, 12, 13, 14, 17, 19]), Candidate: [ 1  1  1  1  0  2  0  1  1  0  1  1  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1  0 -1  0  1  0  0  0  0 -1  0  1  0] (Indices: [0, 4, 6, 8, 9, 12, 13, 14, 15, 16, 19]), Candidate: [1 1 1 1 0 2 0 1 1 0 0 2 1 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 88400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1 -1  1  0  0 -1  1  0 -1  1 -1  1  0] (Indices: [0, 4, 6, 8, 10, 11, 12, 14, 15, 17, 19]), Candidate: [1 1 1 1 0 2 0 1 0 2 0 1 0 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 88450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1 -1  1 -1  1 -1  1  0 -1  1  0  0  0] (Indices: [0, 4, 6, 8, 10, 12, 14, 15, 17, 18, 19]), Candidate: [ 1  1  1  1  0  2  0  1  0  2 -1  2  0  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  1  0  0  0  0  0 -1  1  0 -1  0  1] (Indices: [0, 4, 6, 9, 10, 11, 12, 13, 14, 16, 17]), Candidate: [ 1  1  1  1  0  2  0  0  2  1  0  1  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  1  0  0 -1  0  1 -1  1  0  0  0  0] (Indices: [0, 4, 6, 9, 10, 11, 14, 16, 17, 18, 19]), Candidate: [ 1  1  1  1  0  2  0  0  2  1  0  0  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  1 -1  1  0 -1  0  1  0  0  0  0  0] (Indices: [0, 4, 6, 9, 11, 12, 15, 16, 17, 18, 19]), Candidate: [1 1 1 1 0 2 0 0 2 0 1 1 0 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 88650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  0  1 -1  1 -1  1  0  0  0  0  0  0] (Indices: [0, 4, 6, 10, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  1  1  1  0  2  0  0  1  2 -1  2  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0  0  0  0 -1  1  0 -1  1  0 -1  0  1] (Indices: [0, 4, 7, 8, 9, 10, 11, 13, 14, 16, 17]), Candidate: [ 1  1  1  1  0  1  2  0  1  1  0  0  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0  0  0 -1  1  0 -1  0  0  1  0  0  0] (Indices: [0, 4, 7, 8, 9, 10, 12, 13, 17, 18, 19]), Candidate: [ 1  1  1  1  0  1  2  0  1  1 -1  2  1  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0  0 -1  1  0  0 -1  1 -1  1  0 -1  1] (Indices: [0, 4, 7, 8, 9, 11, 12, 13, 15, 17, 18]), Candidate: [1 1 1 1 0 1 2 0 1 0 1 1 1 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 88850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0  0 -1  0  1  0  0 -1  1  0 -1  1  0] (Indices: [0, 4, 7, 8, 9, 12, 13, 14, 16, 17, 19]), Candidate: [ 1  1  1  1  0  1  2  0  1  0  0  2  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0 -1  1  0  0 -1  1 -1  0  1  0  0  0] (Indices: [0, 4, 7, 8, 10, 11, 12, 14, 17, 18, 19]), Candidate: [ 1  1  1  1  0  1  2  0  0  2  0  1  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0 -1  1 -1  0  1  0  0  0 -1  1  0  0] (Indices: [0, 4, 7, 8, 10, 13, 14, 15, 16, 18, 19]), Candidate: [ 1  1  1  1  0  1  2  0  0  2 -1  1  2  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  1  0  0  0  0  0 -1  0  0  1  0  0] (Indices: [0, 4, 7, 9, 10, 11, 12, 13, 14, 18, 19]), Candidate: [ 1  1  1  1  0  1  2 -1  2  1  0  1  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 89050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  1  0 -1  1  0  0  0 -1  1  0 -1  1] (Indices: [0, 4, 7, 9, 10, 12, 13, 14, 15, 17, 18]), Candidate: [ 1  1  1  1  0  1  2 -1  2  1 -1  2  1  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 89100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  1 -1  1 -1  1  0 -1  1  0  0  0  0] (Indices: [0, 4, 7, 9, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  1  1  1  0  1  2 -1  2  0  1  0  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 89150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  0  0  1  0  0  0  0 -1  1  0  0  0] (Indices: [0, 4, 7, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 1  1  1  1  0  1  2 -1  1  1  1  1  1  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1  0  0  0 -1  1  0 -1  0  1  0  0  0] (Indices: [0, 4, 8, 9, 10, 11, 13, 14, 17, 18, 19]), Candidate: [ 1  1  1  1  0  1  1  1  1  1  0  0  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1  0 -1  1  0  0 -1  1  0  0  0 -1  1] (Indices: [0, 4, 8, 9, 11, 12, 13, 15, 16, 17, 18]), Candidate: [1 1 1 1 0 1 1 1 1 0 1 1 1 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 89300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1 -1  1  0 -1  1  0  0 -1  1  0  0  0] (Indices: [0, 4, 8, 10, 11, 13, 14, 15, 17, 18, 19]), Candidate: [1 1 1 1 0 1 1 1 0 2 0 0 2 1 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 89350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  0  1  0 -1  1  0  0  0  0  0 -1  1  0] (Indices: [0, 4, 9, 10, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 1  1  1  1  0  1  1  0  2  1 -1  2  1  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0  0  0  0 -1  1  0 -1  0  0  1 -1  1] (Indices: [0, 5, 6, 7, 8, 9, 10, 11, 13, 14, 18]), Candidate: [ 1  1  1  0  2  1  1  0  1  1  0  0  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0  0  0 -1  1 -1  1  0 -1  0  0  1  0] (Indices: [0, 5, 6, 7, 8, 9, 10, 12, 14, 15, 19]), Candidate: [ 1  1  1  0  2  1  1  0  1  1 -1  2  0  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0  0  0 -1  0  0  0  1 -1  1  0  0  0] (Indices: [0, 5, 6, 7, 8, 9, 10, 15, 17, 18, 19]), Candidate: [ 1  1  1  0  2  1  1  0  1  1 -1  1  1  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0  0 -1  1 -1  1 -1  1 -1  1  0 -1  1] (Indices: [0, 5, 6, 7, 8, 9, 11, 13, 15, 17, 18]), Candidate: [1 1 1 0 2 1 1 0 1 0 1 0 2 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 89600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0  0 -1  0  1 -1  1 -1  1 -1  1  0  0] (Indices: [0, 5, 6, 7, 8, 9, 12, 14, 16, 18, 19]), Candidate: [ 1  1  1  0  2  1  1  0  1  0  0  2  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0 -1  1  0  0 -1  1 -1  0  1  0 -1  1] (Indices: [0, 5, 6, 7, 8, 10, 11, 12, 14, 17, 18]), Candidate: [ 1  1  1  0  2  1  1  0  0  2  0  1  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0 -1  1 -1  1  0  0  0 -1  0  1 -1  1] (Indices: [0, 5, 6, 7, 8, 10, 12, 13, 14, 15, 18]), Candidate: [ 1  1  1  0  2  1  1  0  0  2 -1  2  1  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0 -1  1 -1  0  0  1  0  0 -1  1  0  0] (Indices: [0, 5, 6, 7, 8, 10, 14, 15, 16, 18, 19]), Candidate: [ 1  1  1  0  2  1  1  0  0  2 -1  1  1  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0 -1  0  1 -1  1 -1  1  0  0 -1  1  0] (Indices: [0, 5, 6, 7, 8, 11, 13, 15, 16, 17, 19]), Candidate: [1 1 1 0 2 1 1 0 0 1 1 0 2 0 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 89850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  1  0  0  0  0 -1  0  0  1  0 -1  1] (Indices: [0, 5, 6, 7, 9, 10, 11, 12, 13, 17, 18]), Candidate: [ 1  1  1  0  2  1  1 -1  2  1  0  1  1  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  1  0  0 -1  0  1 -1  1  0 -1  1  0] (Indices: [0, 5, 6, 7, 9, 10, 11, 14, 16, 17, 19]), Candidate: [ 1  1  1  0  2  1  1 -1  2  1  0  0  1  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 89950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  1  0 -1  0  1  0 -1  1  0 -1  1  0] (Indices: [0, 5, 6, 7, 9, 10, 13, 14, 16, 17, 19]), Candidate: [ 1  1  1  0  2  1  1 -1  2  1 -1  1  2  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 90000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  1 -1  1 -1  1  0  0  0 -1  1 -1  1] (Indices: [0, 5, 6, 7, 9, 11, 13, 14, 15, 16, 18]), Candidate: [ 1  1  1  0  2  1  1 -1  2  0  1  0  2  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  0  1  0  0  0  0  0 -1  0  1 -1  1] (Indices: [0, 5, 6, 7, 10, 11, 12, 13, 14, 15, 18]), Candidate: [ 1  1  1  0  2  1  1 -1  1  2  0  1  1  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  0  1  0 -1  0  1  0  0 -1  1  0  0] (Indices: [0, 5, 6, 7, 10, 11, 14, 15, 16, 18, 19]), Candidate: [ 1  1  1  0  2  1  1 -1  1  2  0  0  1  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  0  0  1  0 -1  1  0 -1  1  0  0  0] (Indices: [0, 5, 6, 7, 11, 12, 14, 15, 17, 18, 19]), Candidate: [ 1  1  1  0  2  1  1 -1  1  1  1  1  0  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1  0  0  0  0 -1  0  0  1  0 -1  1  0] (Indices: [0, 5, 6, 8, 9, 10, 11, 12, 16, 17, 19]), Candidate: [1 1 1 0 2 1 0 1 1 1 0 1 0 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 90250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1  0  0 -1  1  0 -1  1  0 -1  0  1  0] (Indices: [0, 5, 6, 8, 9, 10, 12, 13, 15, 16, 19]), Candidate: [ 1  1  1  0  2  1  0  1  1  1 -1  2  1  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1  0 -1  1  0  0  0 -1  1 -1  0  1  0] (Indices: [0, 5, 6, 8, 9, 11, 12, 13, 14, 16, 19]), Candidate: [ 1  1  1  0  2  1  0  1  1  0  1  1  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1  0 -1  0  1  0  0  0  0  0 -1  0  1] (Indices: [0, 5, 6, 8, 9, 12, 13, 14, 15, 16, 17]), Candidate: [1 1 1 0 2 1 0 1 1 0 0 2 1 1 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 90400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1 -1  1  0  0 -1  1  0  0 -1  0  1  0] (Indices: [0, 5, 6, 8, 10, 11, 12, 14, 15, 16, 19]), Candidate: [1 1 1 0 2 1 0 1 0 2 0 1 0 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 90450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1 -1  1 -1  1 -1  1  0  0  0 -1  1  0] (Indices: [0, 5, 6, 8, 10, 12, 14, 15, 16, 17, 19]), Candidate: [ 1  1  1  0  2  1  0  1  0  2 -1  2  0  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  1  0  0  0  0  0  0 -1  0  1 -1  1] (Indices: [0, 5, 6, 9, 10, 11, 12, 13, 14, 15, 18]), Candidate: [1 1 1 0 2 1 0 0 2 1 0 1 1 1 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 90550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  1  0  0 -1  0  1  0  0 -1  1  0  0] (Indices: [0, 5, 6, 9, 10, 11, 14, 15, 16, 18, 19]), Candidate: [1 1 1 0 2 1 0 0 2 1 0 0 1 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 90600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  1 -1  1  0 -1  1  0 -1  1  0  0  0] (Indices: [0, 5, 6, 9, 11, 12, 14, 15, 17, 18, 19]), Candidate: [1 1 1 0 2 1 0 0 2 0 1 1 0 2 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 90650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  0  1 -1  1  0  0 -1  1  0  0  0  0] (Indices: [0, 5, 6, 10, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  1  1  0  2  1  0  0  1  2 -1  2  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 90700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0  0  0  0 -1  1  0  0 -1  0  1 -1  1] (Indices: [0, 5, 7, 8, 9, 10, 11, 13, 14, 15, 18]), Candidate: [1 1 1 0 2 0 2 0 1 1 0 0 2 1 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 90750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0  0  0 -1  1  0 -1  0  1  0 -1  1  0] (Indices: [0, 5, 7, 8, 9, 10, 12, 13, 16, 17, 19]), Candidate: [ 1  1  1  0  2  0  2  0  1  1 -1  2  1  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0  0 -1  1  0  0 -1  1  0 -1  1 -1  1] (Indices: [0, 5, 7, 8, 9, 11, 12, 13, 15, 16, 18]), Candidate: [1 1 1 0 2 0 2 0 1 0 1 1 1 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 90850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0  0 -1  0  1  0  0  0 -1  0  1  0  0] (Indices: [0, 5, 7, 8, 9, 12, 13, 14, 15, 18, 19]), Candidate: [1 1 1 0 2 0 2 0 1 0 0 2 1 1 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 90900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0 -1  1  0  0 -1  1 -1  1  0 -1  1  0] (Indices: [0, 5, 7, 8, 10, 11, 12, 14, 16, 17, 19]), Candidate: [ 1  1  1  0  2  0  2  0  0  2  0  1  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0 -1  1 -1  0  1  0  0  0  0  0 -1  1] (Indices: [0, 5, 7, 8, 10, 13, 14, 15, 16, 17, 18]), Candidate: [ 1  1  1  0  2  0  2  0  0  2 -1  1  2  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  1  0  0  0  0  0 -1  0  1  0 -1  1] (Indices: [0, 5, 7, 9, 10, 11, 12, 13, 14, 17, 18]), Candidate: [ 1  1  1  0  2  0  2 -1  2  1  0  1  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 91050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  1  0 -1  1  0  0  0  0 -1  1 -1  1] (Indices: [0, 5, 7, 9, 10, 12, 13, 14, 15, 16, 18]), Candidate: [ 1  1  1  0  2  0  2 -1  2  1 -1  2  1  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 91100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  1 -1  1 -1  1  0  0  0 -1  1  0  0] (Indices: [0, 5, 7, 9, 11, 13, 14, 15, 16, 18, 19]), Candidate: [ 1  1  1  0  2  0  2 -1  2  0  1  0  2  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  0  0  1  0  0  0  0  0  0 -1  1  0] (Indices: [0, 5, 7, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 1  1  1  0  2  0  2 -1  1  1  1  1  1  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1  0  0  0 -1  1  0 -1  1  0 -1  1  0] (Indices: [0, 5, 8, 9, 10, 11, 13, 14, 16, 17, 19]), Candidate: [ 1  1  1  0  2  0  1  1  1  1  0  0  2  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1  0 -1  1  0  0  0 -1  1 -1  1  0  0] (Indices: [0, 5, 8, 9, 11, 12, 13, 14, 16, 18, 19]), Candidate: [ 1  1  1  0  2  0  1  1  1  0  1  1  1  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1 -1  1  0 -1  1  0  0  0  0 -1  1  0] (Indices: [0, 5, 8, 10, 11, 13, 14, 15, 16, 17, 19]), Candidate: [1 1 1 0 2 0 1 1 0 2 0 0 2 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 91350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  0  1  0  0 -1  0  1  0  0  0  0  0  0] (Indices: [0, 5, 9, 10, 11, 14, 15, 16, 17, 18, 19]), Candidate: [1 1 1 0 2 0 1 0 2 1 0 0 1 2 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 91400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0  0  0  0  0 -1  1 -1  0  1  0 -1  1] (Indices: [0, 6, 7, 8, 9, 10, 11, 12, 14, 17, 18]), Candidate: [ 1  1  1  0  1  2  1  0  1  1  0  1  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0  0  0 -1  1  0  0  0 -1  0  1 -1  1] (Indices: [0, 6, 7, 8, 9, 10, 12, 13, 14, 15, 18]), Candidate: [ 1  1  1  0  1  2  1  0  1  1 -1  2  1  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0  0  0 -1  0  0  1  0  0 -1  1  0  0] (Indices: [0, 6, 7, 8, 9, 10, 14, 15, 16, 18, 19]), Candidate: [ 1  1  1  0  1  2  1  0  1  1 -1  1  1  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0  0 -1  1 -1  1 -1  1  0  0 -1  1  0] (Indices: [0, 6, 7, 8, 9, 11, 13, 15, 16, 17, 19]), Candidate: [1 1 1 0 1 2 1 0 1 0 1 0 2 0 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 91600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0 -1  1  0  0  0 -1  1  0 -1  0  1  0] (Indices: [0, 6, 7, 8, 10, 11, 12, 13, 15, 16, 19]), Candidate: [1 1 1 0 1 2 1 0 0 2 0 1 1 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 91650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0 -1  1 -1  1  0  0 -1  1  0  0 -1  1] (Indices: [0, 6, 7, 8, 10, 12, 13, 14, 16, 17, 18]), Candidate: [ 1  1  1  0  1  2  1  0  0  2 -1  2  1  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 91700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0 -1  0  0  1  0  0  0  0  0  0 -1  1] (Indices: [0, 6, 7, 8, 12, 13, 14, 15, 16, 17, 18]), Candidate: [1 1 1 0 1 2 1 0 0 1 0 2 1 1 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 91750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  1  0  0 -1  1  0 -1  1  0 -1  1  0] (Indices: [0, 6, 7, 9, 10, 11, 13, 14, 16, 17, 19]), Candidate: [ 1  1  1  0  1  2  1 -1  2  1  0  0  2  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 91800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  1 -1  1  0  0  0 -1  1 -1  1  0  0] (Indices: [0, 6, 7, 9, 11, 12, 13, 14, 16, 18, 19]), Candidate: [ 1  1  1  0  1  2  1 -1  2  0  1  1  1  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 91850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  0  1  0 -1  1  0  0  0  0 -1  1  0] (Indices: [0, 6, 7, 10, 11, 13, 14, 15, 16, 17, 19]), Candidate: [ 1  1  1  0  1  2  1 -1  1  2  0  0  2  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1  0  0  0  0 -1  1 -1  1  0 -1  1  0] (Indices: [0, 6, 8, 9, 10, 11, 12, 14, 16, 17, 19]), Candidate: [ 1  1  1  0  1  2  0  1  1  1  0  1  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1  0  0 -1  0  1  0  0  0  0  0 -1  1] (Indices: [0, 6, 8, 9, 10, 13, 14, 15, 16, 17, 18]), Candidate: [ 1  1  1  0  1  2  0  1  1  1 -1  1  2  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1 -1  1  0  0  0  0 -1  1  0 -1  1  0] (Indices: [0, 6, 8, 10, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 1  1  1  0  1  2  0  1  0  2  0  1  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  1  0  0  0  0 -1  1  0 -1  1  0  0] (Indices: [0, 6, 9, 10, 11, 12, 13, 15, 16, 18, 19]), Candidate: [1 1 1 0 1 2 0 0 2 1 0 1 1 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 92100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0  0  0  0  0  0  0 -1  0  1  0 -1  1] (Indices: [0, 7, 8, 9, 10, 11, 12, 13, 14, 17, 18]), Candidate: [ 1  1  1  0  1  1  2  0  1  1  0  1  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0  0  0 -1  1  0  0  0  0 -1  1 -1  1] (Indices: [0, 7, 8, 9, 10, 12, 13, 14, 15, 16, 18]), Candidate: [ 1  1  1  0  1  1  2  0  1  1 -1  2  1  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0  0 -1  1 -1  1  0  0  0 -1  1  0  0] (Indices: [0, 7, 8, 9, 11, 13, 14, 15, 16, 18, 19]), Candidate: [1 1 1 0 1 1 2 0 1 0 1 0 2 1 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 92250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0 -1  0  1  0  0  0  0  0  0 -1  1  0] (Indices: [0, 7, 8, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [1 1 1 0 1 1 2 0 0 1 1 1 1 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 92300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1 -1  1 -1  1  0 -1  1  0  0  0  0  0  0] (Indices: [0, 7, 9, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  1  1  0  1  1  2 -1  2  0  1  1  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  0  1  0 -1  1  0  0  0  0  0  0 -1  1  0] (Indices: [0, 8, 9, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [1 1 1 0 1 1 1 1 1 0 1 1 1 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 92400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0  0 -1  0  1 -1  0  0  0  1 -1  0  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 9, 12, 17]), Candidate: [3 1 1 0 1 1 1 0 1 0 0 2 0 1 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 92450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0 -1  1 -1  0  0  0  1  0 -1  0  0  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 10, 15, 16]), Candidate: [ 3  1  1  0  1  1  1  0  0  2 -1  1  1  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0 -1  0  0  1 -1  0  1 -1  1 -1  0  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 12, 15, 17]), Candidate: [3 1 1 0 1 1 1 0 0 1 0 2 0 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 92550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  1  0  0 -1  0  0  0  0  0  1 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 18]), Candidate: [ 3  1  1  0  1  1  1 -1  2  1  0  0  1  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  1 -1  1 -1  0  0  1 -1  0  1 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 9, 11, 15, 18]), Candidate: [ 3  1  1  0  1  1  1 -1  2  0  1  0  1  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  1 -1  0  0  0  1 -1  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 7, 9, 14, 16, 19]), Candidate: [ 3  1  1  0  1  1  1 -1  2  0  0  1  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 92700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  0  1 -1  1 -1  1 -1  0  1 -1  0  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 10, 12, 14, 17]), Candidate: [ 3  1  1  0  1  1  1 -1  1  2 -1  2  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 92750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  0  0  1  0  0 -1  0  1 -1  0  0  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 11, 12, 13, 16]), Candidate: [ 3  1  1  0  1  1  1 -1  1  1  1  1  1  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  0  0  1 -1  0  0  0  1  0  0 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 11, 16, 17, 18]), Candidate: [ 3  1  1  0  1  1  1 -1  1  1  1  0  1  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  0  0  0  0  1 -1  1  0 -1  1 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 13, 15, 16, 18]), Candidate: [ 3  1  1  0  1  1  1 -1  1  1  0  1  2  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1  0  0 -1  0  0  0  1  0 -1  0  0  0] (Indices: [1, 2, 3, 4, 5, 6, 8, 9, 10, 15, 16]), Candidate: [ 3  1  1  0  1  1  0  1  1  1 -1  1  1  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1  0 -1  0  1 -1  0  1 -1  1 -1  0  0] (Indices: [1, 2, 3, 4, 5, 6, 8, 9, 12, 15, 17]), Candidate: [3 1 1 0 1 1 0 1 1 0 0 2 0 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 93000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1 -1  1  0  0 -1  0  0  0  0  0  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 8, 10, 11, 12, 19]), Candidate: [3 1 1 0 1 1 0 1 0 2 0 1 0 1 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 93050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1 -1  1 -1  0  1 -1  1 -1  0  1 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 8, 10, 13, 15, 18]), Candidate: [ 3  1  1  0  1  1  0  1  0  2 -1  1  2  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1 -1  0  1 -1  1  0 -1  1 -1  0  0  0] (Indices: [1, 2, 3, 4, 5, 6, 8, 11, 13, 14, 16]), Candidate: [ 3  1  1  0  1  1  0  1  0  1  1  0  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1 -1  0  0  1 -1  1  0 -1  1 -1  0  0] (Indices: [1, 2, 3, 4, 5, 6, 8, 12, 14, 15, 17]), Candidate: [3 1 1 0 1 1 0 1 0 1 0 2 0 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 93200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1 -1  0  0  0  0  0  1  0  0 -1  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 8, 15, 16, 17, 19]), Candidate: [3 1 1 0 1 1 0 1 0 1 0 1 1 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 93250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  1  0 -1  1 -1  0  0  0  1  0 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 9, 10, 12, 17, 18]), Candidate: [ 3  1  1  0  1  1  0  0  2  1 -1  2  0  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  1 -1  1  0 -1  0  1 -1  1 -1  0  0] (Indices: [1, 2, 3, 4, 5, 6, 9, 11, 12, 15, 17]), Candidate: [3 1 1 0 1 1 0 0 2 0 1 1 0 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 93350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  1 -1  0  1  0 -1  1 -1  1 -1  0  0] (Indices: [1, 2, 3, 4, 5, 6, 9, 12, 13, 15, 17]), Candidate: [3 1 1 0 1 1 0 0 2 0 0 2 1 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 93400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  1 -1  0  0  0  1  0  0 -1  1 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 9, 14, 15, 16, 18]), Candidate: [3 1 1 0 1 1 0 0 2 0 0 1 1 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 93450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  0  1  0 -1  0  1  0  0 -1  0  0  0] (Indices: [1, 2, 3, 4, 5, 6, 10, 11, 14, 15, 16]), Candidate: [3 1 1 0 1 1 0 0 1 2 0 0 1 2 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 93500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  0  1 -1  1 -1  0  1 -1  0  1  0 -1] (Indices: [1, 2, 3, 4, 5, 6, 10, 12, 15, 18, 19]), Candidate: [ 3  1  1  0  1  1  0  0  1  2 -1  2  0  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  0  0  1  0  0 -1  0  1 -1  1 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 11, 12, 13, 16, 18]), Candidate: [3 1 1 0 1 1 0 0 1 1 1 1 1 0 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 93600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  0  0  1 -1  0  1  0 -1  0  1  0 -1] (Indices: [1, 2, 3, 4, 5, 6, 11, 14, 15, 18, 19]), Candidate: [3 1 1 0 1 1 0 0 1 1 1 0 1 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 93650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  0  0  0  0  1  0  0 -1  0  1  0 -1] (Indices: [1, 2, 3, 4, 5, 6, 13, 14, 15, 18, 19]), Candidate: [3 1 1 0 1 1 0 0 1 1 0 1 2 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 93700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0  0  0 -1  0  0  0  0  0  1 -1  1 -1] (Indices: [1, 2, 3, 4, 5, 7, 8, 9, 10, 17, 19]), Candidate: [ 3  1  1  0  1  0  2  0  1  1 -1  1  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0  0 -1  0  1 -1  0  0  0  0  1  0 -1] (Indices: [1, 2, 3, 4, 5, 7, 8, 9, 12, 18, 19]), Candidate: [3 1 1 0 1 0 2 0 1 0 0 2 0 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 93800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0 -1  1  0 -1  0  1 -1  1 -1  0  0  0] (Indices: [1, 2, 3, 4, 5, 7, 8, 10, 11, 14, 16]), Candidate: [ 3  1  1  0  1  0  2  0  0  2  0  0  1  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0 -1  1 -1  0  0  1  0  0 -1  0  0  0] (Indices: [1, 2, 3, 4, 5, 7, 8, 10, 14, 15, 16]), Candidate: [ 3  1  1  0  1  0  2  0  0  2 -1  1  1  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0 -1  0  1 -1  1 -1  0  1  0 -1  0  0] (Indices: [1, 2, 3, 4, 5, 7, 8, 11, 13, 16, 17]), Candidate: [3 1 1 0 1 0 2 0 0 1 1 0 2 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 93950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0 -1  0  0  1 -1  1 -1  0  0  1  0 -1] (Indices: [1, 2, 3, 4, 5, 7, 8, 12, 14, 18, 19]), Candidate: [ 3  1  1  0  1  0  2  0  0  1  0  2  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  1  0  0  0 -1  0  0  0  1 -1  0  0] (Indices: [1, 2, 3, 4, 5, 7, 9, 10, 11, 12, 17]), Candidate: [ 3  1  1  0  1  0  2 -1  2  1  0  1  0  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  1  0 -1  0  1 -1  1  0 -1  0  0  0] (Indices: [1, 2, 3, 4, 5, 7, 9, 10, 13, 15, 16]), Candidate: [ 3  1  1  0  1  0  2 -1  2  1 -1  1  2  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 94100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  1 -1  1  0 -1  0  0  0  0  1  0 -1] (Indices: [1, 2, 3, 4, 5, 7, 9, 11, 12, 18, 19]), Candidate: [ 3  1  1  0  1  0  2 -1  2  0  1  1  0  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  1 -1  0  1  0 -1  0  0  0  1  0 -1] (Indices: [1, 2, 3, 4, 5, 7, 9, 12, 13, 18, 19]), Candidate: [ 3  1  1  0  1  0  2 -1  2  0  0  2  1  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  1 -1  0  0  0  1 -1  0  1  0  0 -1] (Indices: [1, 2, 3, 4, 5, 7, 9, 14, 17, 18, 19]), Candidate: [ 3  1  1  0  1  0  2 -1  2  0  0  1  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 94250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  0  1  0 -1  0  1 -1  0  1 -1  1 -1] (Indices: [1, 2, 3, 4, 5, 7, 10, 11, 14, 17, 19]), Candidate: [ 3  1  1  0  1  0  2 -1  1  2  0  0  1  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 94300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  0  1 -1  0  1  0  0 -1  0  0  1 -1] (Indices: [1, 2, 3, 4, 5, 7, 10, 13, 14, 15, 19]), Candidate: [ 3  1  1  0  1  0  2 -1  1  2 -1  1  2  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 94350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  0  0  1  0 -1  1  0 -1  0  0  1 -1] (Indices: [1, 2, 3, 4, 5, 7, 11, 12, 14, 15, 19]), Candidate: [ 3  1  1  0  1  0  2 -1  1  1  1  1  0  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  0  0  1 -1  0  0  1 -1  1  0  0 -1] (Indices: [1, 2, 3, 4, 5, 7, 11, 15, 17, 18, 19]), Candidate: [ 3  1  1  0  1  0  2 -1  1  1  1  0  1  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  0  0  0  0  1 -1  1 -1  1  0  0 -1] (Indices: [1, 2, 3, 4, 5, 7, 13, 15, 17, 18, 19]), Candidate: [ 3  1  1  0  1  0  2 -1  1  1  0  1  2  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1  0  0 -1  1 -1  0  1 -1  0  0  1 -1] (Indices: [1, 2, 3, 4, 5, 8, 9, 10, 12, 15, 19]), Candidate: [ 3  1  1  0  1  0  1  1  1  1 -1  2  0  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1  0 -1  1  0 -1  1 -1  0  1 -1  0  0] (Indices: [1, 2, 3, 4, 5, 8, 9, 11, 12, 14, 17]), Candidate: [ 3  1  1  0  1  0  1  1  1  0  1  1  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1  0 -1  0  1  0  0 -1  0  1 -1  0  0] (Indices: [1, 2, 3, 4, 5, 8, 9, 12, 13, 14, 17]), Candidate: [ 3  1  1  0  1  0  1  1  1  0  0  2  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1  0 -1  0  0  1 -1  0  1  0 -1  1 -1] (Indices: [1, 2, 3, 4, 5, 8, 9, 13, 16, 17, 19]), Candidate: [3 1 1 0 1 0 1 1 1 0 0 1 2 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 94700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1 -1  1  0 -1  1 -1  0  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 5, 8, 10, 11, 13, 16, 19]), Candidate: [3 1 1 0 1 0 1 1 0 2 0 0 2 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 94750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1 -1  1 -1  1 -1  0  1  0 -1  1 -1  0] (Indices: [1, 2, 3, 4, 5, 8, 10, 12, 15, 16, 18]), Candidate: [ 3  1  1  0  1  0  1  1  0  2 -1  2  0  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1 -1  0  1  0  0 -1  1 -1  1 -1  0  0] (Indices: [1, 2, 3, 4, 5, 8, 11, 12, 13, 15, 17]), Candidate: [3 1 1 0 1 0 1 1 0 1 1 1 1 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 94850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1 -1  0  1 -1  0  1  0  0 -1  1 -1  0] (Indices: [1, 2, 3, 4, 5, 8, 11, 14, 15, 16, 18]), Candidate: [3 1 1 0 1 0 1 1 0 1 1 0 1 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 94900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1 -1  0  0  0  1  0  0  0 -1  1 -1  0] (Indices: [1, 2, 3, 4, 5, 8, 13, 14, 15, 16, 18]), Candidate: [3 1 1 0 1 0 1 1 0 1 0 1 2 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 94950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  1  0  0 -1  1 -1  0  1  0 -1  0  0] (Indices: [1, 2, 3, 4, 5, 9, 10, 11, 13, 16, 17]), Candidate: [3 1 1 0 1 0 1 0 2 1 0 0 2 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 95000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  1  0 -1  1 -1  1 -1  0  0  1  0 -1] (Indices: [1, 2, 3, 4, 5, 9, 10, 12, 14, 18, 19]), Candidate: [ 3  1  1  0  1  0  1  0  2  1 -1  2  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 95050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  1 -1  1  0  0  0 -1  0  0  0  1 -1] (Indices: [1, 2, 3, 4, 5, 9, 11, 12, 13, 14, 19]), Candidate: [ 3  1  1  0  1  0  1  0  2  0  1  1  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  1 -1  1 -1  1 -1  0  0  1  0  0 -1] (Indices: [1, 2, 3, 4, 5, 9, 11, 13, 17, 18, 19]), Candidate: [3 1 1 0 1 0 1 0 2 0 1 0 2 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 95150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  1 -1  0  1 -1  0  0  1  0  0  0 -1] (Indices: [1, 2, 3, 4, 5, 9, 12, 16, 17, 18, 19]), Candidate: [3 1 1 0 1 0 1 0 2 0 0 2 0 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 95200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  0  1  0  0 -1  0  1 -1  1  0 -1  0] (Indices: [1, 2, 3, 4, 5, 10, 11, 12, 15, 17, 18]), Candidate: [3 1 1 0 1 0 1 0 1 2 0 1 0 1 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 95250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  0  1 -1  1  0  0 -1  0  1 -1  1 -1] (Indices: [1, 2, 3, 4, 5, 10, 12, 13, 14, 17, 19]), Candidate: [ 3  1  1  0  1  0  1  0  1  2 -1  2  1  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 95300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  0  0  1  0  0  0  0 -1  0  1 -1  0] (Indices: [1, 2, 3, 4, 5, 11, 12, 13, 14, 15, 18]), Candidate: [3 1 1 0 1 0 1 0 1 1 1 1 1 1 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 95350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  0  0  1 -1  0  1  0  0 -1  1  0 -1] (Indices: [1, 2, 3, 4, 5, 11, 14, 15, 16, 18, 19]), Candidate: [3 1 1 0 1 0 1 0 1 1 1 0 1 2 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 95400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0  0  0 -1  0  1 -1  0  0  1 -1  0  0] (Indices: [1, 2, 3, 4, 6, 7, 8, 9, 10, 13, 17]), Candidate: [ 3  1  1  0  0  2  1  0  1  1 -1  1  2  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0  0 -1  0  1  0 -1  0  0  0  1 -1  0] (Indices: [1, 2, 3, 4, 6, 7, 8, 9, 12, 13, 18]), Candidate: [3 1 1 0 0 2 1 0 1 0 0 2 1 0 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 95500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0  0 -1  0  0  0  0  0  1 -1  1  0 -1] (Indices: [1, 2, 3, 4, 6, 7, 8, 9, 16, 18, 19]), Candidate: [3 1 1 0 0 2 1 0 1 0 0 1 1 1 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 95550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0 -1  1 -1  1 -1  0  0  0  0  1  0 -1] (Indices: [1, 2, 3, 4, 6, 7, 8, 10, 12, 18, 19]), Candidate: [ 3  1  1  0  0  2  1  0  0  2 -1  2  0  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0 -1  0  1  0 -1  0  1 -1  0  0  1 -1] (Indices: [1, 2, 3, 4, 6, 7, 8, 11, 12, 15, 19]), Candidate: [3 1 1 0 0 2 1 0 0 1 1 1 0 1 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 95650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0 -1  0  0  1  0 -1  1 -1  0  0  1 -1] (Indices: [1, 2, 3, 4, 6, 7, 8, 12, 13, 15, 19]), Candidate: [3 1 1 0 0 2 1 0 0 1 0 2 1 0 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 95700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0 -1  0  0  0  0  1  0 -1  1  0 -1  0] (Indices: [1, 2, 3, 4, 6, 7, 8, 14, 15, 17, 18]), Candidate: [3 1 1 0 0 2 1 0 0 1 0 1 1 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 95750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  1  0 -1  1 -1  1 -1  0  0  0  1 -1] (Indices: [1, 2, 3, 4, 6, 7, 9, 10, 12, 14, 19]), Candidate: [ 3  1  1  0  0  2  1 -1  2  1 -1  2  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 95800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  1 -1  1  0  0 -1  0  0  0  1 -1  0] (Indices: [1, 2, 3, 4, 6, 7, 9, 11, 12, 13, 18]), Candidate: [ 3  1  1  0  0  2  1 -1  2  0  1  1  1  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  1 -1  1 -1  0  0  0  1 -1  1  0 -1] (Indices: [1, 2, 3, 4, 6, 7, 9, 11, 16, 18, 19]), Candidate: [ 3  1  1  0  0  2  1 -1  2  0  1  0  1  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  1 -1  0  0  1 -1  1 -1  1  0 -1  0] (Indices: [1, 2, 3, 4, 6, 7, 9, 13, 15, 17, 18]), Candidate: [ 3  1  1  0  0  2  1 -1  2  0  0  1  2  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  0  1  0 -1  1 -1  1 -1  0  1 -1  0] (Indices: [1, 2, 3, 4, 6, 7, 10, 11, 13, 15, 18]), Candidate: [ 3  1  1  0  0  2  1 -1  1  2  0  0  2  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  0  1 -1  1 -1  1 -1  0  1  0 -1  0] (Indices: [1, 2, 3, 4, 6, 7, 10, 12, 14, 17, 18]), Candidate: [ 3  1  1  0  0  2  1 -1  1  2 -1  2  0  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 96050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  0  0  1  0  0  0 -1  0  1 -1  0  0] (Indices: [1, 2, 3, 4, 6, 7, 11, 12, 13, 14, 17]), Candidate: [ 3  1  1  0  0  2  1 -1  1  1  1  1  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 96100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  0  0  1 -1  1 -1  0  1  0 -1  1 -1] (Indices: [1, 2, 3, 4, 6, 7, 11, 13, 16, 17, 19]), Candidate: [ 3  1  1  0  0  2  1 -1  1  1  1  0  2  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  0  0  0  1 -1  0  1  0 -1  1  0 -1] (Indices: [1, 2, 3, 4, 6, 7, 12, 15, 16, 18, 19]), Candidate: [ 3  1  1  0  0  2  1 -1  1  1  0  2  0  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1  0  0  0 -1  0  0  0  0  1 -1  1 -1] (Indices: [1, 2, 3, 4, 6, 8, 9, 10, 11, 17, 19]), Candidate: [3 1 1 0 0 2 0 1 1 1 0 0 1 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 96250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1  0  0 -1  0  0  0  1  0 -1  0  1 -1] (Indices: [1, 2, 3, 4, 6, 8, 9, 10, 15, 16, 19]), Candidate: [ 3  1  1  0  0  2  0  1  1  1 -1  1  1  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1  0 -1  1 -1  0  1 -1  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 6, 8, 9, 11, 14, 16, 19]), Candidate: [ 3  1  1  0  0  2  0  1  1  0  1  0  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1  0 -1  0  0  1  0  0 -1  1 -1  0  0] (Indices: [1, 2, 3, 4, 6, 8, 9, 13, 14, 15, 17]), Candidate: [3 1 1 0 0 2 0 1 1 0 0 1 2 1 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 96400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1 -1  1  0  0 -1  0  0  1 -1  1 -1  0] (Indices: [1, 2, 3, 4, 6, 8, 10, 11, 12, 16, 18]), Candidate: [3 1 1 0 0 2 0 1 0 2 0 1 0 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 96450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1 -1  1 -1  1  0 -1  0  1 -1  1 -1  0] (Indices: [1, 2, 3, 4, 6, 8, 10, 12, 13, 16, 18]), Candidate: [ 3  1  1  0  0  2  0  1  0  2 -1  2  1  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1 -1  1 -1  0  0  1  0 -1  0  1  0 -1] (Indices: [1, 2, 3, 4, 6, 8, 10, 14, 15, 18, 19]), Candidate: [ 3  1  1  0  0  2  0  1  0  2 -1  1  1  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1 -1  0  1 -1  1  0 -1  1 -1  1 -1  0] (Indices: [1, 2, 3, 4, 6, 8, 11, 13, 14, 16, 18]), Candidate: [ 3  1  1  0  0  2  0  1  0  1  1  0  2  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1 -1  0  0  1 -1  1  0  0  0 -1  0  0] (Indices: [1, 2, 3, 4, 6, 8, 12, 14, 15, 16, 17]), Candidate: [3 1 1 0 0 2 0 1 0 1 0 2 0 2 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 96650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  1  0  0  0 -1  0  1 -1  0  0  1 -1] (Indices: [1, 2, 3, 4, 6, 9, 10, 11, 12, 15, 19]), Candidate: [3 1 1 0 0 2 0 0 2 1 0 1 0 1 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 96700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  1  0 -1  1  0 -1  1 -1  0  0  1 -1] (Indices: [1, 2, 3, 4, 6, 9, 10, 12, 13, 15, 19]), Candidate: [ 3  1  1  0  0  2  0  0  2  1 -1  2  1  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  1  0 -1  0  0  1  0 -1  1  0 -1  0] (Indices: [1, 2, 3, 4, 6, 9, 10, 14, 15, 17, 18]), Candidate: [ 3  1  1  0  0  2  0  0  2  1 -1  1  1  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  1 -1  1 -1  1  0  0 -1  0  0  1 -1] (Indices: [1, 2, 3, 4, 6, 9, 11, 13, 14, 15, 19]), Candidate: [3 1 1 0 0 2 0 0 2 0 1 0 2 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 96850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  1 -1  0  1  0 -1  0  1 -1  1  0 -1] (Indices: [1, 2, 3, 4, 6, 9, 12, 13, 16, 18, 19]), Candidate: [3 1 1 0 0 2 0 0 2 0 0 2 1 0 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 96900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  0  1  0  0  0 -1  0  0  1  0 -1  0] (Indices: [1, 2, 3, 4, 6, 10, 11, 12, 13, 17, 18]), Candidate: [3 1 1 0 0 2 0 0 1 2 0 1 1 0 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 96950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  0  1  0 -1  0  1 -1  1  0 -1  1 -1] (Indices: [1, 2, 3, 4, 6, 10, 11, 14, 16, 17, 19]), Candidate: [ 3  1  1  0  0  2  0  0  1  2  0  0  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 97000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  0  1 -1  0  1  0 -1  1  0 -1  1 -1] (Indices: [1, 2, 3, 4, 6, 10, 13, 14, 16, 17, 19]), Candidate: [ 3  1  1  0  0  2  0  0  1  2 -1  1  2  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 97050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  0  0  1 -1  1  0  0  0 -1  1 -1  0] (Indices: [1, 2, 3, 4, 6, 11, 13, 14, 15, 16, 18]), Candidate: [3 1 1 0 0 2 0 0 1 1 1 0 2 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 97100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0  0  0  0  0 -1  0  1 -1  0  0  0  0] (Indices: [1, 2, 3, 4, 7, 8, 9, 10, 11, 12, 15]), Candidate: [3 1 1 0 0 1 2 0 1 1 0 1 0 1 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 97150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0  0  0 -1  0  1  0 -1  0  0  1 -1  0] (Indices: [1, 2, 3, 4, 7, 8, 9, 10, 13, 14, 18]), Candidate: [ 3  1  1  0  0  1  2  0  1  1 -1  1  2  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 97200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0  0 -1  1  0 -1  0  0  0  1  0 -1  0] (Indices: [1, 2, 3, 4, 7, 8, 9, 11, 12, 17, 18]), Candidate: [3 1 1 0 0 1 2 0 1 0 1 1 0 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 97250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0  0 -1  0  1  0 -1  0  0  1  0 -1  0] (Indices: [1, 2, 3, 4, 7, 8, 9, 12, 13, 17, 18]), Candidate: [3 1 1 0 0 1 2 0 1 0 0 2 1 0 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 97300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0  0 -1  0  0  0  1 -1  1  0 -1  1 -1] (Indices: [1, 2, 3, 4, 7, 8, 9, 14, 16, 17, 19]), Candidate: [ 3  1  1  0  0  1  2  0  1  0  0  1  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 97350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0 -1  1  0 -1  0  1 -1  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 7, 8, 10, 11, 14, 16, 19]), Candidate: [ 3  1  1  0  0  1  2  0  0  2  0  0  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 97400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0 -1  1 -1  0  1  0  0 -1  1 -1  0  0] (Indices: [1, 2, 3, 4, 7, 8, 10, 13, 14, 15, 17]), Candidate: [ 3  1  1  0  0  1  2  0  0  2 -1  1  2  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 97450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0 -1  0  1  0 -1  1  0 -1  1 -1  0  0] (Indices: [1, 2, 3, 4, 7, 8, 11, 12, 14, 15, 17]), Candidate: [3 1 1 0 0 1 2 0 0 1 1 1 0 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 97500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0 -1  0  1 -1  0  0  1  0  0 -1  1 -1] (Indices: [1, 2, 3, 4, 7, 8, 11, 15, 16, 17, 19]), Candidate: [3 1 1 0 0 1 2 0 0 1 1 0 1 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 97550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0 -1  0  0  0  1 -1  1  0  0 -1  1 -1] (Indices: [1, 2, 3, 4, 7, 8, 13, 15, 16, 17, 19]), Candidate: [3 1 1 0 0 1 2 0 0 1 0 1 2 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 97600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  1  0  0 -1  0  1 -1  1  0 -1  0  0] (Indices: [1, 2, 3, 4, 7, 9, 10, 11, 14, 16, 17]), Candidate: [ 3  1  1  0  0  1  2 -1  2  1  0  0  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 97650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  1  0 -1  1 -1  0  0  0  1  0  0 -1] (Indices: [1, 2, 3, 4, 7, 9, 10, 12, 17, 18, 19]), Candidate: [ 3  1  1  0  0  1  2 -1  2  1 -1  2  0  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 97700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  1 -1  1  0  0 -1  0  0  0  1  0 -1] (Indices: [1, 2, 3, 4, 7, 9, 11, 12, 13, 18, 19]), Candidate: [ 3  1  1  0  0  1  2 -1  2  0  1  1  1  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 97750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  1 -1  1 -1  0  1 -1  0  1  0  0 -1] (Indices: [1, 2, 3, 4, 7, 9, 11, 14, 17, 18, 19]), Candidate: [ 3  1  1  0  0  1  2 -1  2  0  1  0  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 97800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  1 -1  0  0  1  0 -1  0  1  0  0 -1] (Indices: [1, 2, 3, 4, 7, 9, 13, 14, 17, 18, 19]), Candidate: [ 3  1  1  0  0  1  2 -1  2  0  0  1  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 97850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  0  1  0 -1  1  0  0 -1  0  0  1 -1] (Indices: [1, 2, 3, 4, 7, 10, 11, 13, 14, 15, 19]), Candidate: [ 3  1  1  0  0  1  2 -1  1  2  0  0  2  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 97900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  0  1 -1  1  0 -1  0  1 -1  1  0 -1] (Indices: [1, 2, 3, 4, 7, 10, 12, 13, 16, 18, 19]), Candidate: [ 3  1  1  0  0  1  2 -1  1  2 -1  2  1  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 97950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  0  0  1  0  0 -1  1  0 -1  0  1 -1] (Indices: [1, 2, 3, 4, 7, 11, 12, 13, 15, 16, 19]), Candidate: [ 3  1  1  0  0  1  2 -1  1  1  1  1  1  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  0  0  0  1  0  0 -1  1  0  0 -1  0] (Indices: [1, 2, 3, 4, 7, 12, 13, 14, 16, 17, 18]), Candidate: [ 3  1  1  0  0  1  2 -1  1  1  0  2  1  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 98050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1  0  0  0 -1  1 -1  1 -1  0  1 -1  0] (Indices: [1, 2, 3, 4, 8, 9, 10, 11, 13, 15, 18]), Candidate: [3 1 1 0 0 1 1 1 1 1 0 0 2 0 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 98100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1  0  0 -1  1 -1  1 -1  0  1  0 -1  0] (Indices: [1, 2, 3, 4, 8, 9, 10, 12, 14, 17, 18]), Candidate: [ 3  1  1  0  0  1  1  1  1  1 -1  2  0  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 98150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1  0 -1  1  0  0  0 -1  0  1 -1  0  0] (Indices: [1, 2, 3, 4, 8, 9, 11, 12, 13, 14, 17]), Candidate: [ 3  1  1  0  0  1  1  1  1  0  1  1  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1  0 -1  1 -1  1 -1  0  1  0 -1  1 -1] (Indices: [1, 2, 3, 4, 8, 9, 11, 13, 16, 17, 19]), Candidate: [3 1 1 0 0 1 1 1 1 0 1 0 2 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 98250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1  0 -1  0  1 -1  0  1  0 -1  1  0 -1] (Indices: [1, 2, 3, 4, 8, 9, 12, 15, 16, 18, 19]), Candidate: [3 1 1 0 0 1 1 1 1 0 0 2 0 1 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 98300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1 -1  1  0  0 -1  0  1  0 -1  1 -1  0] (Indices: [1, 2, 3, 4, 8, 10, 11, 12, 15, 16, 18]), Candidate: [3 1 1 0 0 1 1 1 0 2 0 1 0 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 98350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1 -1  1 -1  1  0  0 -1  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 8, 10, 12, 13, 14, 16, 19]), Candidate: [ 3  1  1  0  0  1  1  1  0  2 -1  2  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 98400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1 -1  0  1  0  0  0  0  0 -1  0  0  0] (Indices: [1, 2, 3, 4, 8, 11, 12, 13, 14, 15, 16]), Candidate: [3 1 1 0 0 1 1 1 0 1 1 1 1 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 98450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1 -1  0  1 -1  0  1  0  0  0  0 -1  0] (Indices: [1, 2, 3, 4, 8, 11, 14, 15, 16, 17, 18]), Candidate: [3 1 1 0 0 1 1 1 0 1 1 0 1 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 98500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  1  0  0  0 -1  1  0 -1  1 -1  0  0] (Indices: [1, 2, 3, 4, 9, 10, 11, 12, 14, 15, 17]), Candidate: [3 1 1 0 0 1 1 0 2 1 0 1 0 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 98550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  1  0  0 -1  0  0  1  0  0 -1  1 -1] (Indices: [1, 2, 3, 4, 9, 10, 11, 15, 16, 17, 19]), Candidate: [3 1 1 0 0 1 1 0 2 1 0 0 1 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 98600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  1  0 -1  0  1 -1  1  0  0 -1  1 -1] (Indices: [1, 2, 3, 4, 9, 10, 13, 15, 16, 17, 19]), Candidate: [ 3  1  1  0  0  1  1  0  2  1 -1  1  2  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  1 -1  1 -1  1  0  0 -1  0  1  0 -1] (Indices: [1, 2, 3, 4, 9, 11, 13, 14, 15, 18, 19]), Candidate: [3 1 1 0 0 1 1 0 2 0 1 0 2 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 98700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  0  1  0  0  0  0 -1  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 10, 11, 12, 13, 14, 16, 19]), Candidate: [ 3  1  1  0  0  1  1  0  1  2  0  1  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  0  1 -1  1  0  0  0  0  0 -1  0  0] (Indices: [1, 2, 3, 4, 10, 12, 13, 14, 15, 16, 17]), Candidate: [ 3  1  1  0  0  1  1  0  1  2 -1  2  1  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  0  0  1 -1  1  0  0  0  0 -1  1 -1] (Indices: [1, 2, 3, 4, 11, 13, 14, 15, 16, 17, 19]), Candidate: [3 1 1 0 0 1 1 0 1 1 1 0 2 1 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 98850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0  0 -1  1  0  0 -1  0  0  0  0  0  0] (Indices: [1, 2, 3, 5, 6, 7, 8, 9, 11, 12, 13]), Candidate: [ 3  1  1 -1  2  1  1  0  1  0  1  1  1  0  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0  0 -1  0  0  1  0 -1  1 -1  0  0  0] (Indices: [1, 2, 3, 5, 6, 7, 8, 9, 13, 14, 16]), Candidate: [ 3  1  1 -1  2  1  1  0  1  0  0  1  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 98950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0 -1  1  0 -1  0  1 -1  0  0  1 -1  0] (Indices: [1, 2, 3, 5, 6, 7, 8, 10, 11, 14, 18]), Candidate: [ 3  1  1 -1  2  1  1  0  0  2  0  0  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 99000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0 -1  1 -1  0  0  1  0 -1  0  1 -1  0] (Indices: [1, 2, 3, 5, 6, 7, 8, 10, 14, 15, 18]), Candidate: [ 3  1  1 -1  2  1  1  0  0  2 -1  1  1  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 99050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0 -1  0  1 -1  1 -1  0  1 -1  0  1 -1] (Indices: [1, 2, 3, 5, 6, 7, 8, 11, 13, 16, 19]), Candidate: [ 3  1  1 -1  2  1  1  0  0  1  1  0  2  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 99100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0 -1  0  0  1 -1  0  1  0 -1  1 -1  0] (Indices: [1, 2, 3, 5, 6, 7, 8, 12, 15, 16, 18]), Candidate: [ 3  1  1 -1  2  1  1  0  0  1  0  2  0  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 99150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  1  0  0  0 -1  0  0  0  0  0  1 -1] (Indices: [1, 2, 3, 5, 6, 7, 9, 10, 11, 12, 19]), Candidate: [ 3  1  1 -1  2  1  1 -1  2  1  0  1  0  1  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 99200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  1  0 -1  0  1 -1  1 -1  0  1 -1  0] (Indices: [1, 2, 3, 5, 6, 7, 9, 10, 13, 15, 18]), Candidate: [ 3  1  1 -1  2  1  1 -1  2  1 -1  1  2  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 99250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  1 -1  1 -1  1  0 -1  1 -1  0  0  0] (Indices: [1, 2, 3, 5, 6, 7, 9, 11, 13, 14, 16]), Candidate: [ 3  1  1 -1  2  1  1 -1  2  0  1  0  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 99300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  1 -1  0  1 -1  1  0 -1  1 -1  0  0] (Indices: [1, 2, 3, 5, 6, 7, 9, 12, 14, 15, 17]), Candidate: [ 3  1  1 -1  2  1  1 -1  2  0  0  2  0  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 99350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  1 -1  0  0  0  0  1  0  0 -1  1 -1] (Indices: [1, 2, 3, 5, 6, 7, 9, 15, 16, 17, 19]), Candidate: [ 3  1  1 -1  2  1  1 -1  2  0  0  1  1  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 99400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  0  1  0 -1  0  0  1  0  0 -1  0  0] (Indices: [1, 2, 3, 5, 6, 7, 10, 11, 15, 16, 17]), Candidate: [ 3  1  1 -1  2  1  1 -1  1  2  0  0  1  1  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 99450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  0  1 -1  0  1  0 -1  1 -1  1 -1  0] (Indices: [1, 2, 3, 5, 6, 7, 10, 13, 14, 16, 18]), Candidate: [ 3  1  1 -1  2  1  1 -1  1  2 -1  1  2  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 99500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  0  0  1  0 -1  1 -1  1 -1  1 -1  0] (Indices: [1, 2, 3, 5, 6, 7, 11, 12, 14, 16, 18]), Candidate: [ 3  1  1 -1  2  1  1 -1  1  1  1  1  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 99550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  0  0  0  1  0  0  0  0 -1  0  0  0] (Indices: [1, 2, 3, 5, 6, 7, 12, 13, 14, 15, 16]), Candidate: [ 3  1  1 -1  2  1  1 -1  1  1  0  2  1  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 99600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  0  0  0  0  0  1  0  0  0  0 -1  0] (Indices: [1, 2, 3, 5, 6, 7, 14, 15, 16, 17, 18]), Candidate: [ 3  1  1 -1  2  1  1 -1  1  1  0  1  1  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 99650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1  0  0 -1  1 -1  0  0  1 -1  1 -1  0] (Indices: [1, 2, 3, 5, 6, 8, 9, 10, 12, 16, 18]), Candidate: [ 3  1  1 -1  2  1  0  1  1  1 -1  2  0  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 99700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1  0 -1  1  0 -1  1 -1  0  0  0  1 -1] (Indices: [1, 2, 3, 5, 6, 8, 9, 11, 12, 14, 19]), Candidate: [ 3  1  1 -1  2  1  0  1  1  0  1  1  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 99750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1  0 -1  0  1  0  0 -1  0  0  0  1 -1] (Indices: [1, 2, 3, 5, 6, 8, 9, 12, 13, 14, 19]), Candidate: [ 3  1  1 -1  2  1  0  1  1  0  0  2  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 99800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1  0 -1  0  0  1 -1  0  0  1  0  0 -1] (Indices: [1, 2, 3, 5, 6, 8, 9, 13, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  1  0  1  1  0  0  1  2  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 99850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1 -1  1  0 -1  1 -1  0  0  1 -1  1 -1] (Indices: [1, 2, 3, 5, 6, 8, 10, 11, 13, 17, 19]), Candidate: [ 3  1  1 -1  2  1  0  1  0  2  0  0  2  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 99900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1 -1  1 -1  1 -1  0  1 -1  1  0 -1  0] (Indices: [1, 2, 3, 5, 6, 8, 10, 12, 15, 17, 18]), Candidate: [ 3  1  1 -1  2  1  0  1  0  2 -1  2  0  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 99950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1 -1  0  1  0  0 -1  1 -1  0  0  1 -1] (Indices: [1, 2, 3, 5, 6, 8, 11, 12, 13, 15, 19]), Candidate: [ 3  1  1 -1  2  1  0  1  0  1  1  1  1  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1 -1  0  1 -1  0  1  0 -1  1  0 -1  0] (Indices: [1, 2, 3, 5, 6, 8, 11, 14, 15, 17, 18]), Candidate: [ 3  1  1 -1  2  1  0  1  0  1  1  0  1  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1 -1  0  0  0  1  0  0 -1  1  0 -1  0] (Indices: [1, 2, 3, 5, 6, 8, 13, 14, 15, 17, 18]), Candidate: [ 3  1  1 -1  2  1  0  1  0  1  0  1  2  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  1  0  0 -1  1 -1  0  1 -1  0  1 -1] (Indices: [1, 2, 3, 5, 6, 9, 10, 11, 13, 16, 19]), Candidate: [ 3  1  1 -1  2  1  0  0  2  1  0  0  2  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  1  0 -1  1 -1  0  1  0 -1  1 -1  0] (Indices: [1, 2, 3, 5, 6, 9, 10, 12, 15, 16, 18]), Candidate: [ 3  1  1 -1  2  1  0  0  2  1 -1  2  0  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  1 -1  1  0  0 -1  1 -1  1 -1  0  0] (Indices: [1, 2, 3, 5, 6, 9, 11, 12, 13, 15, 17]), Candidate: [ 3  1  1 -1  2  1  0  0  2  0  1  1  1  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  1 -1  1 -1  0  1  0  0 -1  1 -1  0] (Indices: [1, 2, 3, 5, 6, 9, 11, 14, 15, 16, 18]), Candidate: [ 3  1  1 -1  2  1  0  0  2  0  1  0  1  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  1 -1  0  0  1  0  0  0 -1  1 -1  0] (Indices: [1, 2, 3, 5, 6, 9, 13, 14, 15, 16, 18]), Candidate: [ 3  1  1 -1  2  1  0  0  2  0  0  1  2  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  0  1  0  0 -1  0  1 -1  0  1  0 -1] (Indices: [1, 2, 3, 5, 6, 10, 11, 12, 15, 18, 19]), Candidate: [ 3  1  1 -1  2  1  0  0  1  2  0  1  0  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  0  1 -1  1  0 -1  1  0  0 -1  0  0] (Indices: [1, 2, 3, 5, 6, 10, 12, 13, 15, 16, 17]), Candidate: [ 3  1  1 -1  2  1  0  0  1  2 -1  2  1  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  0  0  1  0  0  0 -1  1  0 -1  0  0] (Indices: [1, 2, 3, 5, 6, 11, 12, 13, 14, 16, 17]), Candidate: [ 3  1  1 -1  2  1  0  0  1  1  1  1  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  0  0  1 -1  0  1 -1  1  0  0  0 -1] (Indices: [1, 2, 3, 5, 6, 11, 14, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  1  0  0  1  1  1  0  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0  0  0  0 -1  0  0  1 -1  0  1 -1  0] (Indices: [1, 2, 3, 5, 7, 8, 9, 10, 11, 15, 18]), Candidate: [ 3  1  1 -1  2  0  2  0  1  1  0  0  1  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0  0  0 -1  0  0  1 -1  1 -1  0  1 -1] (Indices: [1, 2, 3, 5, 7, 8, 9, 10, 14, 16, 19]), Candidate: [ 3  1  1 -1  2  0  2  0  1  1 -1  1  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 100650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0  0 -1  1 -1  0  1  0  0 -1  0  0  0] (Indices: [1, 2, 3, 5, 7, 8, 9, 11, 14, 15, 16]), Candidate: [ 3  1  1 -1  2  0  2  0  1  0  1  0  1  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0  0 -1  0  1 -1  0  1 -1  0  1  0 -1] (Indices: [1, 2, 3, 5, 7, 8, 9, 12, 15, 18, 19]), Candidate: [ 3  1  1 -1  2  0  2  0  1  0  0  2  0  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0 -1  1  0  0 -1  1 -1  0  0  0  1 -1] (Indices: [1, 2, 3, 5, 7, 8, 10, 11, 12, 14, 19]), Candidate: [ 3  1  1 -1  2  0  2  0  0  2  0  1  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0 -1  1 -1  1  0  0 -1  0  0  0  1 -1] (Indices: [1, 2, 3, 5, 7, 8, 10, 12, 13, 14, 19]), Candidate: [ 3  1  1 -1  2  0  2  0  0  2 -1  2  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 100850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0 -1  1 -1  0  1 -1  0  0  1  0  0 -1] (Indices: [1, 2, 3, 5, 7, 8, 10, 13, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  0  2  0  0  2 -1  1  2  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0 -1  0  1  0 -1  0  0  0  1  0  0 -1] (Indices: [1, 2, 3, 5, 7, 8, 11, 12, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  0  2  0  0  1  1  1  0  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0 -1  0  0  1  0 -1  1 -1  1 -1  1 -1] (Indices: [1, 2, 3, 5, 7, 8, 12, 13, 15, 17, 19]), Candidate: [ 3  1  1 -1  2  0  2  0  0  1  0  2  1  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  1  0  0  0 -1  1 -1  0  1 -1  0  0] (Indices: [1, 2, 3, 5, 7, 9, 10, 11, 12, 14, 17]), Candidate: [ 3  1  1 -1  2  0  2 -1  2  1  0  1  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 101050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  1  0 -1  1  0  0 -1  0  1 -1  0  0] (Indices: [1, 2, 3, 5, 7, 9, 10, 12, 13, 14, 17]), Candidate: [ 3  1  1 -1  2  0  2 -1  2  1 -1  2  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 101100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  1  0 -1  0  1 -1  0  1  0 -1  1 -1] (Indices: [1, 2, 3, 5, 7, 9, 10, 13, 16, 17, 19]), Candidate: [ 3  1  1 -1  2  0  2 -1  2  1 -1  1  2  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 101150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  1 -1  1  0 -1  0  0  1  0 -1  1 -1] (Indices: [1, 2, 3, 5, 7, 9, 11, 12, 16, 17, 19]), Candidate: [ 3  1  1 -1  2  0  2 -1  2  0  1  1  0  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 101200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  1 -1  0  1  0 -1  1  0 -1  0  1 -1] (Indices: [1, 2, 3, 5, 7, 9, 12, 13, 15, 16, 19]), Candidate: [ 3  1  1 -1  2  0  2 -1  2  0  0  2  1  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 101250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  0  1  0  0  0 -1  1 -1  1 -1  0  0] (Indices: [1, 2, 3, 5, 7, 10, 11, 12, 13, 15, 17]), Candidate: [ 3  1  1 -1  2  0  2 -1  1  2  0  1  1  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 101300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  0  1  0 -1  0  1  0  0 -1  1 -1  0] (Indices: [1, 2, 3, 5, 7, 10, 11, 14, 15, 16, 18]), Candidate: [ 3  1  1 -1  2  0  2 -1  1  2  0  0  1  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 101350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  0  1 -1  0  1  0  0  0 -1  1 -1  0] (Indices: [1, 2, 3, 5, 7, 10, 13, 14, 15, 16, 18]), Candidate: [ 3  1  1 -1  2  0  2 -1  1  2 -1  1  2  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 101400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  0  0  1  0 -1  0  1  0  0  0 -1  0] (Indices: [1, 2, 3, 5, 7, 11, 12, 15, 16, 17, 18]), Candidate: [ 3  1  1 -1  2  0  2 -1  1  1  1  1  0  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 101450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  0  0  0  0  1  0  0 -1  1  0  0 -1] (Indices: [1, 2, 3, 5, 7, 13, 14, 15, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  0  2 -1  1  1  0  1  2  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 101500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1  0  0  0 -1  0  0  1  0  0 -1  0  0] (Indices: [1, 2, 3, 5, 8, 9, 10, 11, 15, 16, 17]), Candidate: [ 3  1  1 -1  2  0  1  1  1  1  0  0  1  1  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1  0  0 -1  0  1  0 -1  1 -1  1 -1  0] (Indices: [1, 2, 3, 5, 8, 9, 10, 13, 14, 16, 18]), Candidate: [ 3  1  1 -1  2  0  1  1  1  1 -1  1  2  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 101600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1  0 -1  1  0 -1  1 -1  1 -1  1 -1  0] (Indices: [1, 2, 3, 5, 8, 9, 11, 12, 14, 16, 18]), Candidate: [ 3  1  1 -1  2  0  1  1  1  0  1  1  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 101650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1  0 -1  0  1  0  0  0  0 -1  0  0  0] (Indices: [1, 2, 3, 5, 8, 9, 12, 13, 14, 15, 16]), Candidate: [ 3  1  1 -1  2  0  1  1  1  0  0  2  1  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1  0 -1  0  0  0  1  0  0  0  0 -1  0] (Indices: [1, 2, 3, 5, 8, 9, 14, 15, 16, 17, 18]), Candidate: [ 3  1  1 -1  2  0  1  1  1  0  0  1  1  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1 -1  1  0 -1  1  0 -1  0  0  1  0 -1] (Indices: [1, 2, 3, 5, 8, 10, 11, 13, 14, 18, 19]), Candidate: [ 3  1  1 -1  2  0  1  1  0  2  0  0  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 101800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1 -1  1 -1  1 -1  1  0 -1  1 -1  1 -1] (Indices: [1, 2, 3, 5, 8, 10, 12, 14, 15, 17, 19]), Candidate: [ 3  1  1 -1  2  0  1  1  0  2 -1  2  0  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 101850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1 -1  0  1  0  0 -1  0  1 -1  1  0 -1] (Indices: [1, 2, 3, 5, 8, 11, 12, 13, 16, 18, 19]), Candidate: [ 3  1  1 -1  2  0  1  1  0  1  1  1  1  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1 -1  0  0  1  0 -1  1  0 -1  1  0 -1] (Indices: [1, 2, 3, 5, 8, 12, 13, 15, 16, 18, 19]), Candidate: [ 3  1  1 -1  2  0  1  1  0  1  0  2  1  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  1  0  0  0 -1  0  0  0  1  0  0 -1] (Indices: [1, 2, 3, 5, 9, 10, 11, 12, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  0  1  0  2  1  0  1  0  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  1  0 -1  1  0 -1  1 -1  1 -1  1 -1] (Indices: [1, 2, 3, 5, 9, 10, 12, 13, 15, 17, 19]), Candidate: [ 3  1  1 -1  2  0  1  0  2  1 -1  2  1  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  1 -1  1  0  0  0 -1  0  1 -1  1 -1] (Indices: [1, 2, 3, 5, 9, 11, 12, 13, 14, 17, 19]), Candidate: [ 3  1  1 -1  2  0  1  0  2  0  1  1  1  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  1 -1  0  1  0  0  0  0 -1  0  1 -1] (Indices: [1, 2, 3, 5, 9, 12, 13, 14, 15, 16, 19]), Candidate: [ 3  1  1 -1  2  0  1  0  2  0  0  2  1  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  0  1  0  0 -1  1  0 -1  1 -1  1 -1] (Indices: [1, 2, 3, 5, 10, 11, 12, 14, 15, 17, 19]), Candidate: [ 3  1  1 -1  2  0  1  0  1  2  0  1  0  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  0  1 -1  1 -1  1  0 -1  1  0  0 -1] (Indices: [1, 2, 3, 5, 10, 12, 14, 15, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  0  1  0  1  2 -1  2  0  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0  0  0  0  0 -1  0  0  0  1 -1  0  0] (Indices: [1, 2, 3, 6, 7, 8, 9, 10, 11, 12, 17]), Candidate: [ 3  1  1 -1  1  2  1  0  1  1  0  1  0  1  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0  0  0 -1  0  1 -1  1  0 -1  0  0  0] (Indices: [1, 2, 3, 6, 7, 8, 9, 10, 13, 15, 16]), Candidate: [ 3  1  1 -1  1  2  1  0  1  1 -1  1  2  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0  0 -1  1  0 -1  0  0  0  0  1  0 -1] (Indices: [1, 2, 3, 6, 7, 8, 9, 11, 12, 18, 19]), Candidate: [ 3  1  1 -1  1  2  1  0  1  0  1  1  0  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0  0 -1  0  1  0 -1  0  0  0  1  0 -1] (Indices: [1, 2, 3, 6, 7, 8, 9, 12, 13, 18, 19]), Candidate: [ 3  1  1 -1  1  2  1  0  1  0  0  2  1  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0  0 -1  0  0  0  1 -1  0  1  0  0 -1] (Indices: [1, 2, 3, 6, 7, 8, 9, 14, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  2  1  0  1  0  0  1  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0 -1  1  0 -1  0  1 -1  0  1 -1  1 -1] (Indices: [1, 2, 3, 6, 7, 8, 10, 11, 14, 17, 19]), Candidate: [ 3  1  1 -1  1  2  1  0  0  2  0  0  1  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0 -1  1 -1  0  1  0  0 -1  0  0  1 -1] (Indices: [1, 2, 3, 6, 7, 8, 10, 13, 14, 15, 19]), Candidate: [ 3  1  1 -1  1  2  1  0  0  2 -1  1  2  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0 -1  0  1  0 -1  1  0 -1  0  0  1 -1] (Indices: [1, 2, 3, 6, 7, 8, 11, 12, 14, 15, 19]), Candidate: [ 3  1  1 -1  1  2  1  0  0  1  1  1  0  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0 -1  0  1 -1  0  0  1 -1  1  0  0 -1] (Indices: [1, 2, 3, 6, 7, 8, 11, 15, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  2  1  0  0  1  1  0  1  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0 -1  0  0  0  1 -1  1 -1  1  0  0 -1] (Indices: [1, 2, 3, 6, 7, 8, 13, 15, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  2  1  0  0  1  0  1  2  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  1  0  0 -1  0  1 -1  1 -1  0  1 -1] (Indices: [1, 2, 3, 6, 7, 9, 10, 11, 14, 16, 19]), Candidate: [ 3  1  1 -1  1  2  1 -1  2  1  0  0  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 102800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  1  0 -1  0  1  0  0 -1  1 -1  0  0] (Indices: [1, 2, 3, 6, 7, 9, 10, 13, 14, 15, 17]), Candidate: [ 3  1  1 -1  1  2  1 -1  2  1 -1  1  2  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 102850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  1 -1  1  0 -1  1  0 -1  1 -1  0  0] (Indices: [1, 2, 3, 6, 7, 9, 11, 12, 14, 15, 17]), Candidate: [ 3  1  1 -1  1  2  1 -1  2  0  1  1  0  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  1 -1  1 -1  0  0  1  0  0 -1  1 -1] (Indices: [1, 2, 3, 6, 7, 9, 11, 15, 16, 17, 19]), Candidate: [ 3  1  1 -1  1  2  1 -1  2  0  1  0  1  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  1 -1  0  0  1 -1  1  0  0 -1  1 -1] (Indices: [1, 2, 3, 6, 7, 9, 13, 15, 16, 17, 19]), Candidate: [ 3  1  1 -1  1  2  1 -1  2  0  0  1  2  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 103000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  0  1  0 -1  1  0 -1  1 -1  1 -1  0] (Indices: [1, 2, 3, 6, 7, 10, 11, 13, 14, 16, 18]), Candidate: [ 3  1  1 -1  1  2  1 -1  1  2  0  0  2  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 103050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  0  1 -1  1 -1  1  0  0  0 -1  0  0] (Indices: [1, 2, 3, 6, 7, 10, 12, 14, 15, 16, 17]), Candidate: [ 3  1  1 -1  1  2  1 -1  1  2 -1  2  0  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 103100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  0  0  1  0  0 -1  1 -1  1 -1  1 -1] (Indices: [1, 2, 3, 6, 7, 11, 12, 13, 15, 17, 19]), Candidate: [ 3  1  1 -1  1  2  1 -1  1  1  1  1  1  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 103150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  0  0  0  1  0  0 -1  1 -1  1  0 -1] (Indices: [1, 2, 3, 6, 7, 12, 13, 14, 16, 18, 19]), Candidate: [ 3  1  1 -1  1  2  1 -1  1  1  0  2  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 103200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1  0  0  0 -1  1 -1  0  1  0 -1  0  0] (Indices: [1, 2, 3, 6, 8, 9, 10, 11, 13, 16, 17]), Candidate: [ 3  1  1 -1  1  2  0  1  1  1  0  0  2  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1  0  0 -1  1 -1  1 -1  0  0  1  0 -1] (Indices: [1, 2, 3, 6, 8, 9, 10, 12, 14, 18, 19]), Candidate: [ 3  1  1 -1  1  2  0  1  1  1 -1  2  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 103300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1  0 -1  1  0  0  0 -1  0  0  0  1 -1] (Indices: [1, 2, 3, 6, 8, 9, 11, 12, 13, 14, 19]), Candidate: [ 3  1  1 -1  1  2  0  1  1  0  1  1  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 103350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1  0 -1  1 -1  1 -1  0  0  1  0  0 -1] (Indices: [1, 2, 3, 6, 8, 9, 11, 13, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  2  0  1  1  0  1  0  2  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1  0 -1  0  1 -1  0  0  1  0  0  0 -1] (Indices: [1, 2, 3, 6, 8, 9, 12, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  2  0  1  1  0  0  2  0  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1 -1  1  0  0 -1  0  1 -1  1  0 -1  0] (Indices: [1, 2, 3, 6, 8, 10, 11, 12, 15, 17, 18]), Candidate: [ 3  1  1 -1  1  2  0  1  0  2  0  1  0  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1 -1  1 -1  1  0  0 -1  0  1 -1  1 -1] (Indices: [1, 2, 3, 6, 8, 10, 12, 13, 14, 17, 19]), Candidate: [ 3  1  1 -1  1  2  0  1  0  2 -1  2  1  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 103550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1 -1  0  1  0  0  0  0 -1  0  1 -1  0] (Indices: [1, 2, 3, 6, 8, 11, 12, 13, 14, 15, 18]), Candidate: [ 3  1  1 -1  1  2  0  1  0  1  1  1  1  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1 -1  0  1 -1  0  1  0  0 -1  1  0 -1] (Indices: [1, 2, 3, 6, 8, 11, 14, 15, 16, 18, 19]), Candidate: [ 3  1  1 -1  1  2  0  1  0  1  1  0  1  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  1  0  0  0 -1  1  0 -1  0  0  1 -1] (Indices: [1, 2, 3, 6, 9, 10, 11, 12, 14, 15, 19]), Candidate: [ 3  1  1 -1  1  2  0  0  2  1  0  1  0  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  1  0  0 -1  0  0  1 -1  1  0  0 -1] (Indices: [1, 2, 3, 6, 9, 10, 11, 15, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  2  0  0  2  1  0  0  1  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  1  0 -1  0  1 -1  1 -1  1  0  0 -1] (Indices: [1, 2, 3, 6, 9, 10, 13, 15, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  2  0  0  2  1 -1  1  2  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 103800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  1 -1  1 -1  1  0 -1  1  0 -1  1 -1] (Indices: [1, 2, 3, 6, 9, 11, 13, 14, 16, 17, 19]), Candidate: [ 3  1  1 -1  1  2  0  0  2  0  1  0  2  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 103850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  0  1  0  0  0  0 -1  0  1 -1  1 -1] (Indices: [1, 2, 3, 6, 10, 11, 12, 13, 14, 17, 19]), Candidate: [ 3  1  1 -1  1  2  0  0  1  2  0  1  1  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 103900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  0  1 -1  1  0  0  0  0 -1  0  1 -1] (Indices: [1, 2, 3, 6, 10, 12, 13, 14, 15, 16, 19]), Candidate: [ 3  1  1 -1  1  2  0  0  1  2 -1  2  1  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 103950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  0  0  1 -1  1  0  0 -1  1  0  0 -1] (Indices: [1, 2, 3, 6, 11, 13, 14, 15, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  2  0  0  1  1  1  0  2  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0  0  0  0 -1  0  1  0 -1  0  1 -1  0] (Indices: [1, 2, 3, 7, 8, 9, 10, 11, 14, 15, 18]), Candidate: [ 3  1  1 -1  1  1  2  0  1  1  0  0  1  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0  0  0 -1  1 -1  0  0  1  0 -1  1 -1] (Indices: [1, 2, 3, 7, 8, 9, 10, 12, 16, 17, 19]), Candidate: [ 3  1  1 -1  1  1  2  0  1  1 -1  2  0  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 104100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0  0 -1  1  0  0 -1  0  0  1  0 -1  0] (Indices: [1, 2, 3, 7, 8, 9, 11, 12, 13, 17, 18]), Candidate: [ 3  1  1 -1  1  1  2  0  1  0  1  1  1  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0  0 -1  1 -1  0  1 -1  1  0 -1  1 -1] (Indices: [1, 2, 3, 7, 8, 9, 11, 14, 16, 17, 19]), Candidate: [ 3  1  1 -1  1  1  2  0  1  0  1  0  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 104200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0  0 -1  0  0  1  0 -1  1  0 -1  1 -1] (Indices: [1, 2, 3, 7, 8, 9, 13, 14, 16, 17, 19]), Candidate: [ 3  1  1 -1  1  1  2  0  1  0  0  1  2  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 104250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0 -1  1  0 -1  1  0  0 -1  1 -1  0  0] (Indices: [1, 2, 3, 7, 8, 10, 11, 13, 14, 15, 17]), Candidate: [ 3  1  1 -1  1  1  2  0  0  2  0  0  2  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0 -1  1 -1  1  0 -1  0  1  0  0 -1  0] (Indices: [1, 2, 3, 7, 8, 10, 12, 13, 16, 17, 18]), Candidate: [ 3  1  1 -1  1  1  2  0  0  2 -1  2  1  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 104350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0 -1  0  1  0  0 -1  1  0  0 -1  0  0] (Indices: [1, 2, 3, 7, 8, 11, 12, 13, 15, 16, 17]), Candidate: [ 3  1  1 -1  1  1  2  0  0  1  1  1  1  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0 -1  0  0  1  0  0  0 -1  1 -1  1 -1] (Indices: [1, 2, 3, 7, 8, 12, 13, 14, 15, 17, 19]), Candidate: [ 3  1  1 -1  1  1  2  0  0  1  0  2  1  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  1  0  0  0 -1  0  1  0 -1  1 -1  0] (Indices: [1, 2, 3, 7, 9, 10, 11, 12, 15, 16, 18]), Candidate: [ 3  1  1 -1  1  1  2 -1  2  1  0  1  0  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 104500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  1  0 -1  1  0  0 -1  1 -1  0  1 -1] (Indices: [1, 2, 3, 7, 9, 10, 12, 13, 14, 16, 19]), Candidate: [ 3  1  1 -1  1  1  2 -1  2  1 -1  2  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 104550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  1 -1  1  0  0  0  0  0 -1  0  0  0] (Indices: [1, 2, 3, 7, 9, 11, 12, 13, 14, 15, 16]), Candidate: [ 3  1  1 -1  1  1  2 -1  2  0  1  1  1  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 104600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  1 -1  1 -1  0  1  0  0  0  0 -1  0] (Indices: [1, 2, 3, 7, 9, 11, 14, 15, 16, 17, 18]), Candidate: [ 3  1  1 -1  1  1  2 -1  2  0  1  0  1  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 104650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  0  1  0  0  0 -1  0  1  0  0 -1  0] (Indices: [1, 2, 3, 7, 10, 11, 12, 13, 16, 17, 18]), Candidate: [ 3  1  1 -1  1  1  2 -1  1  2  0  1  1  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 104700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  0  1 -1  1  0 -1  1  0  0  0 -1  0] (Indices: [1, 2, 3, 7, 10, 12, 13, 15, 16, 17, 18]), Candidate: [ 3  1  1 -1  1  1  2 -1  1  2 -1  2  1  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 104750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  0  0  0  1  0  0 -1  1  0  0  0 -1] (Indices: [1, 2, 3, 7, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  1  2 -1  1  1  0  2  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 104800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1  0  0  0 -1  1 -1  1  0 -1  1 -1  0] (Indices: [1, 2, 3, 8, 9, 10, 11, 13, 15, 16, 18]), Candidate: [ 3  1  1 -1  1  1  1  1  1  1  0  0  2  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1  0  0 -1  1 -1  1 -1  1  0  0 -1  0] (Indices: [1, 2, 3, 8, 9, 10, 12, 14, 16, 17, 18]), Candidate: [ 3  1  1 -1  1  1  1  1  1  1 -1  2  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 104900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1  0 -1  1  0 -1  1  0  0  0 -1  0  0] (Indices: [1, 2, 3, 8, 9, 11, 12, 14, 15, 16, 17]), Candidate: [ 3  1  1 -1  1  1  1  1  1  0  1  1  0  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1  0 -1  0  1  0 -1  0  1  0  0  0 -1] (Indices: [1, 2, 3, 8, 9, 12, 13, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  1  1  1  1  0  0  2  1  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1 -1  1  0 -1  1  0  0  0 -1  1 -1  0] (Indices: [1, 2, 3, 8, 10, 11, 13, 14, 15, 16, 18]), Candidate: [ 3  1  1 -1  1  1  1  1  0  2  0  0  2  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1 -1  0  1  0  0  0  0  0 -1  0  1 -1] (Indices: [1, 2, 3, 8, 11, 12, 13, 14, 15, 16, 19]), Candidate: [ 3  1  1 -1  1  1  1  1  0  1  1  1  1  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  1  0  0  0  0 -1  0  1  0  0 -1  0] (Indices: [1, 2, 3, 9, 10, 11, 12, 13, 16, 17, 18]), Candidate: [ 3  1  1 -1  1  1  1  0  2  1  0  1  1  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  1  0 -1  1  0 -1  1  0  0  0 -1  0] (Indices: [1, 2, 3, 9, 10, 12, 13, 15, 16, 17, 18]), Candidate: [ 3  1  1 -1  1  1  1  0  2  1 -1  2  1  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 105200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  1 -1  0  1  0  0 -1  1  0  0  0 -1] (Indices: [1, 2, 3, 9, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  1  1  0  2  0  0  2  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 105250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0  0  0  0 -1  1 -1  0  0  0  0  0  0] (Indices: [1, 2, 4, 5, 6, 7, 8, 9, 10, 11, 13]), Candidate: [3 1 0 1 1 1 1 0 1 1 0 0 2 0 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 105300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0  0 -1  1 -1  0  1 -1  0  1 -1  0  0] (Indices: [1, 2, 4, 5, 6, 7, 8, 9, 11, 14, 17]), Candidate: [ 3  1  0  1  1  1  1  0  1  0  1  0  1  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0  0 -1  0  0  0  1  0 -1  1 -1  0  0] (Indices: [1, 2, 4, 5, 6, 7, 8, 9, 14, 15, 17]), Candidate: [3 1 0 1 1 1 1 0 1 0 0 1 1 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 105400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0 -1  1 -1  1  0 -1  0  0  1 -1  0  0] (Indices: [1, 2, 4, 5, 6, 7, 8, 10, 12, 13, 17]), Candidate: [ 3  1  0  1  1  1  1  0  0  2 -1  2  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0 -1  1 -1  0  0  0  0  1  0 -1  1 -1] (Indices: [1, 2, 4, 5, 6, 7, 8, 10, 16, 17, 19]), Candidate: [ 3  1  0  1  1  1  1  0  0  2 -1  1  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0 -1  0  1 -1  0  0  1  0 -1  1 -1  0] (Indices: [1, 2, 4, 5, 6, 7, 8, 11, 15, 16, 18]), Candidate: [3 1 0 1 1 1 1 0 0 1 1 0 1 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 105550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0 -1  0  0  0  1  0 -1  1 -1  0  1 -1] (Indices: [1, 2, 4, 5, 6, 7, 8, 13, 14, 16, 19]), Candidate: [ 3  1  0  1  1  1  1  0  0  1  0  1  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  1  0  0 -1  0  0  1 -1  0  0  1 -1] (Indices: [1, 2, 4, 5, 6, 7, 9, 10, 11, 15, 19]), Candidate: [ 3  1  0  1  1  1  1 -1  2  1  0  0  1  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  1  0 -1  0  0  1 -1  0  1  0 -1  0] (Indices: [1, 2, 4, 5, 6, 7, 9, 10, 14, 17, 18]), Candidate: [ 3  1  0  1  1  1  1 -1  2  1 -1  1  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 105700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  1 -1  1 -1  0  1  0 -1  1 -1  0  0] (Indices: [1, 2, 4, 5, 6, 7, 9, 11, 14, 15, 17]), Candidate: [ 3  1  0  1  1  1  1 -1  2  0  1  0  1  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  1 -1  0  1 -1  0  0  1  0  0 -1  0] (Indices: [1, 2, 4, 5, 6, 7, 9, 12, 16, 17, 18]), Candidate: [ 3  1  0  1  1  1  1 -1  2  0  0  2  0  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  0  1  0  0 -1  0  1  0 -1  0  0  0] (Indices: [1, 2, 4, 5, 6, 7, 10, 11, 12, 15, 16]), Candidate: [ 3  1  0  1  1  1  1 -1  1  2  0  1  0  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  0  1 -1  1  0 -1  1  0 -1  0  0  0] (Indices: [1, 2, 4, 5, 6, 7, 10, 12, 13, 15, 16]), Candidate: [ 3  1  0  1  1  1  1 -1  1  2 -1  2  1  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 105900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  0  1 -1  0  0  1  0  0  0 -1  0  0] (Indices: [1, 2, 4, 5, 6, 7, 10, 14, 15, 16, 17]), Candidate: [ 3  1  0  1  1  1  1 -1  1  2 -1  1  1  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 105950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  0  0  1 -1  1  0  0  0 -1  0  0  0] (Indices: [1, 2, 4, 5, 6, 7, 11, 13, 14, 15, 16]), Candidate: [ 3  1  0  1  1  1  1 -1  1  1  1  0  2  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 106000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  0  0  0  1  0 -1  1 -1  0  1  0 -1] (Indices: [1, 2, 4, 5, 6, 7, 12, 13, 15, 18, 19]), Candidate: [ 3  1  0  1  1  1  1 -1  1  1  0  2  1  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 106050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1  0  0  0 -1  1 -1  0  1 -1  0  0  0] (Indices: [1, 2, 4, 5, 6, 8, 9, 10, 11, 13, 16]), Candidate: [3 1 0 1 1 1 0 1 1 1 0 0 2 0 0 2 0 1 1 6]
 -> Valid neighbor added.
Attempt 106100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1  0  0 -1  0  1 -1  0  1 -1  1 -1  0] (Indices: [1, 2, 4, 5, 6, 8, 9, 10, 13, 16, 18]), Candidate: [ 3  1  0  1  1  1  0  1  1  1 -1  1  2  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 106150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1  0 -1  1 -1  1  0 -1  0  0  0  1 -1] (Indices: [1, 2, 4, 5, 6, 8, 9, 11, 13, 14, 19]), Candidate: [ 3  1  0  1  1  1  0  1  1  0  1  0  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 106200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1  0 -1  0  1 -1  1 -1  1  0 -1  0  0] (Indices: [1, 2, 4, 5, 6, 8, 9, 12, 14, 16, 17]), Candidate: [ 3  1  0  1  1  1  0  1  1  0  0  2  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 106250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1  0 -1  0  0  0  0  0  1  0  0  0 -1] (Indices: [1, 2, 4, 5, 6, 8, 9, 16, 17, 18, 19]), Candidate: [3 1 0 1 1 1 0 1 1 0 0 1 1 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 106300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1 -1  1  0 -1  0  0  1 -1  1  0 -1  0] (Indices: [1, 2, 4, 5, 6, 8, 10, 11, 15, 17, 18]), Candidate: [3 1 0 1 1 1 0 1 0 2 0 0 1 1 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 106350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1 -1  1 -1  0  1  0 -1  0  1 -1  1 -1] (Indices: [1, 2, 4, 5, 6, 8, 10, 13, 14, 17, 19]), Candidate: [ 3  1  0  1  1  1  0  1  0  2 -1  1  2  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 106400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1 -1  0  1  0 -1  1 -1  0  1 -1  1 -1] (Indices: [1, 2, 4, 5, 6, 8, 11, 12, 14, 17, 19]), Candidate: [ 3  1  0  1  1  1  0  1  0  1  1  1  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 106450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1 -1  0  0  1  0  0  0 -1  0  0  1 -1] (Indices: [1, 2, 4, 5, 6, 8, 12, 13, 14, 15, 19]), Candidate: [3 1 0 1 1 1 0 1 0 1 0 2 1 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 106500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1 -1  0  0  0  0  1  0 -1  1  0  0 -1] (Indices: [1, 2, 4, 5, 6, 8, 14, 15, 17, 18, 19]), Candidate: [3 1 0 1 1 1 0 1 0 1 0 1 1 2 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 106550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  1  0  0 -1  0  0  1  0 -1  1 -1  0] (Indices: [1, 2, 4, 5, 6, 9, 10, 11, 15, 16, 18]), Candidate: [3 1 0 1 1 1 0 0 2 1 0 0 1 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 106600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  1  0 -1  0  1  0 -1  1 -1  0  1 -1] (Indices: [1, 2, 4, 5, 6, 9, 10, 13, 14, 16, 19]), Candidate: [ 3  1  0  1  1  1  0  0  2  1 -1  1  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 106650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  1 -1  1  0 -1  1 -1  1 -1  0  1 -1] (Indices: [1, 2, 4, 5, 6, 9, 11, 12, 14, 16, 19]), Candidate: [ 3  1  0  1  1  1  0  0  2  0  1  1  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 106700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  1 -1  0  1  0  0  0 -1  1 -1  0  0] (Indices: [1, 2, 4, 5, 6, 9, 12, 13, 14, 15, 17]), Candidate: [3 1 0 1 1 1 0 0 2 0 0 2 1 1 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 106750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  1 -1  0  0  0  1  0  0  0 -1  1 -1] (Indices: [1, 2, 4, 5, 6, 9, 14, 15, 16, 17, 19]), Candidate: [3 1 0 1 1 1 0 0 2 0 0 1 1 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 106800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  0  1  0 -1  1 -1  1  0  0 -1  0  0] (Indices: [1, 2, 4, 5, 6, 10, 11, 13, 15, 16, 17]), Candidate: [3 1 0 1 1 1 0 0 1 2 0 0 2 0 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 106850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  0  1 -1  1 -1  1  0 -1  0  1  0 -1] (Indices: [1, 2, 4, 5, 6, 10, 12, 14, 15, 18, 19]), Candidate: [ 3  1  0  1  1  1  0  0  1  2 -1  2  0  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 106900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  0  0  1  0  0 -1  0  0  1  0  0 -1] (Indices: [1, 2, 4, 5, 6, 11, 12, 13, 17, 18, 19]), Candidate: [3 1 0 1 1 1 0 0 1 1 1 1 1 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 106950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  0  0  0  1  0 -1  1 -1  1  0  0 -1] (Indices: [1, 2, 4, 5, 6, 12, 13, 15, 17, 18, 19]), Candidate: [3 1 0 1 1 1 0 0 1 1 0 2 1 0 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 107000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0  0  0 -1  1 -1  1 -1  1 -1  0  0  0] (Indices: [1, 2, 4, 5, 7, 8, 9, 10, 12, 14, 16]), Candidate: [ 3  1  0  1  1  0  2  0  1  1 -1  2  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 107050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0  0 -1  1  0  0 -1  1 -1  0  0  0  0] (Indices: [1, 2, 4, 5, 7, 8, 9, 11, 12, 13, 15]), Candidate: [3 1 0 1 1 0 2 0 1 0 1 1 1 0 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 107100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0  0 -1  1 -1  0  0  1 -1  0  1  0 -1] (Indices: [1, 2, 4, 5, 7, 8, 9, 11, 15, 18, 19]), Candidate: [3 1 0 1 1 0 2 0 1 0 1 0 1 1 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 107150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0  0 -1  0  0  1 -1  1  0  0 -1  0  0] (Indices: [1, 2, 4, 5, 7, 8, 9, 13, 15, 16, 17]), Candidate: [3 1 0 1 1 0 2 0 1 0 0 1 2 0 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 107200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0 -1  1  0 -1  1  0 -1  0  0  0  1 -1] (Indices: [1, 2, 4, 5, 7, 8, 10, 11, 13, 14, 19]), Candidate: [ 3  1  0  1  1  0  2  0  0  2  0  0  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0 -1  1 -1  1 -1  1 -1  1  0 -1  0  0] (Indices: [1, 2, 4, 5, 7, 8, 10, 12, 14, 16, 17]), Candidate: [ 3  1  0  1  1  0  2  0  0  2 -1  2  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 107300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0 -1  1 -1  0  0  0  0  1  0  0  0 -1] (Indices: [1, 2, 4, 5, 7, 8, 10, 16, 17, 18, 19]), Candidate: [ 3  1  0  1  1  0  2  0  0  2 -1  1  1  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0 -1  0  1 -1  1 -1  1 -1  1 -1  1 -1] (Indices: [1, 2, 4, 5, 7, 8, 11, 13, 15, 17, 19]), Candidate: [3 1 0 1 1 0 2 0 0 1 1 0 2 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 107400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0 -1  0  0  1 -1  1 -1  0  1  0  0 -1] (Indices: [1, 2, 4, 5, 7, 8, 12, 14, 17, 18, 19]), Candidate: [ 3  1  0  1  1  0  2  0  0  1  0  2  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  1  0  0 -1  1  0 -1  0  1 -1  0  0] (Indices: [1, 2, 4, 5, 7, 9, 10, 11, 13, 14, 17]), Candidate: [ 3  1  0  1  1  0  2 -1  2  1  0  0  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 107500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  1  0 -1  1 -1  1  0 -1  0  1 -1  0] (Indices: [1, 2, 4, 5, 7, 9, 10, 12, 14, 15, 18]), Candidate: [ 3  1  0  1  1  0  2 -1  2  1 -1  2  0  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 107550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  1  0 -1  0  0  0  1  0 -1  1  0 -1] (Indices: [1, 2, 4, 5, 7, 9, 10, 15, 16, 18, 19]), Candidate: [ 3  1  0  1  1  0  2 -1  2  1 -1  1  1  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 107600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  1 -1  1 -1  1 -1  1  0 -1  0  1 -1] (Indices: [1, 2, 4, 5, 7, 9, 11, 13, 15, 16, 19]), Candidate: [ 3  1  0  1  1  0  2 -1  2  0  1  0  2  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  1 -1  0  1 -1  1 -1  1  0 -1  1 -1] (Indices: [1, 2, 4, 5, 7, 9, 12, 14, 16, 17, 19]), Candidate: [ 3  1  0  1  1  0  2 -1  2  0  0  2  0  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 107700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  0  1  0  0 -1  1 -1  1 -1  0  1 -1] (Indices: [1, 2, 4, 5, 7, 10, 11, 12, 14, 16, 19]), Candidate: [ 3  1  0  1  1  0  2 -1  1  2  0  1  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 107750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  0  1 -1  1  0  0  0 -1  1 -1  0  0] (Indices: [1, 2, 4, 5, 7, 10, 12, 13, 14, 15, 17]), Candidate: [ 3  1  0  1  1  0  2 -1  1  2 -1  2  1  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 107800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  0  1 -1  0  0  1  0  0  0 -1  1 -1] (Indices: [1, 2, 4, 5, 7, 10, 14, 15, 16, 17, 19]), Candidate: [ 3  1  0  1  1  0  2 -1  1  2 -1  1  1  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 107850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  0  0  1 -1  1 -1  1  0  0  0 -1  0] (Indices: [1, 2, 4, 5, 7, 11, 13, 15, 16, 17, 18]), Candidate: [ 3  1  0  1  1  0  2 -1  1  1  1  0  2  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1  0  0  0  0 -1  0  1  0 -1  0  0  0] (Indices: [1, 2, 4, 5, 8, 9, 10, 11, 12, 15, 16]), Candidate: [3 1 0 1 1 0 1 1 1 1 0 1 0 1 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 107950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1  0  0 -1  1  0 -1  1  0 -1  0  0  0] (Indices: [1, 2, 4, 5, 8, 9, 10, 12, 13, 15, 16]), Candidate: [ 3  1  0  1  1  0  1  1  1  1 -1  2  1  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1  0  0 -1  0  0  1  0  0  0 -1  0  0] (Indices: [1, 2, 4, 5, 8, 9, 10, 14, 15, 16, 17]), Candidate: [ 3  1  0  1  1  0  1  1  1  1 -1  1  1  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1  0 -1  1 -1  1  0  0  0 -1  0  0  0] (Indices: [1, 2, 4, 5, 8, 9, 11, 13, 14, 15, 16]), Candidate: [3 1 0 1 1 0 1 1 1 0 1 0 2 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 108100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1  0 -1  0  1  0 -1  1 -1  0  1  0 -1] (Indices: [1, 2, 4, 5, 8, 9, 12, 13, 15, 18, 19]), Candidate: [3 1 0 1 1 0 1 1 1 0 0 2 1 0 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 108150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1 -1  1  0  0  0 -1  0  1  0 -1  0  0] (Indices: [1, 2, 4, 5, 8, 10, 11, 12, 13, 16, 17]), Candidate: [3 1 0 1 1 0 1 1 0 2 0 1 1 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 108200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1 -1  1  0 -1  0  1  0 -1  1 -1  1 -1] (Indices: [1, 2, 4, 5, 8, 10, 11, 14, 15, 17, 19]), Candidate: [3 1 0 1 1 0 1 1 0 2 0 0 1 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 108250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1 -1  1 -1  0  1  0  0 -1  1 -1  1 -1] (Indices: [1, 2, 4, 5, 8, 10, 13, 14, 15, 17, 19]), Candidate: [ 3  1  0  1  1  0  1  1  0  2 -1  1  2  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1 -1  0  1  0 -1  0  1 -1  1  0  0 -1] (Indices: [1, 2, 4, 5, 8, 11, 12, 15, 17, 18, 19]), Candidate: [3 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 108350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1 -1  0  0  0  0  1  0  0  0  0  0 -1] (Indices: [1, 2, 4, 5, 8, 14, 15, 16, 17, 18, 19]), Candidate: [3 1 0 1 1 0 1 1 0 1 0 1 1 2 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 108400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  1  0  0 -1  1 -1  1 -1  1 -1  1 -1] (Indices: [1, 2, 4, 5, 9, 10, 11, 13, 15, 17, 19]), Candidate: [3 1 0 1 1 0 1 0 2 1 0 0 2 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 108450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  1  0 -1  1 -1  1 -1  0  1  0  0 -1] (Indices: [1, 2, 4, 5, 9, 10, 12, 14, 17, 18, 19]), Candidate: [ 3  1  0  1  1  0  1  0  2  1 -1  2  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 108500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  1 -1  1  0 -1  1  0 -1  1  0 -1  0] (Indices: [1, 2, 4, 5, 9, 11, 12, 14, 15, 17, 18]), Candidate: [3 1 0 1 1 0 1 0 2 0 1 1 0 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 108550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  1 -1  0  1 -1  1  0  0 -1  1  0 -1] (Indices: [1, 2, 4, 5, 9, 12, 14, 15, 16, 18, 19]), Candidate: [3 1 0 1 1 0 1 0 2 0 0 2 0 2 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 108600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  0  1  0 -1  1  0  0 -1  1 -1  1 -1] (Indices: [1, 2, 4, 5, 10, 11, 13, 14, 15, 17, 19]), Candidate: [3 1 0 1 1 0 1 0 1 2 0 0 2 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 108650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  0  0  1  0  0  0  0 -1  0  1  0 -1] (Indices: [1, 2, 4, 5, 11, 12, 13, 14, 15, 18, 19]), Candidate: [3 1 0 1 1 0 1 0 1 1 1 1 1 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 108700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0  0  0  0 -1  0  0  1 -1  1 -1  0  0] (Indices: [1, 2, 4, 6, 7, 8, 9, 10, 11, 15, 17]), Candidate: [3 1 0 1 0 2 1 0 1 1 0 0 1 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 108750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0  0  0 -1  0  0  1 -1  1 -1  1 -1  0] (Indices: [1, 2, 4, 6, 7, 8, 9, 10, 14, 16, 18]), Candidate: [ 3  1  0  1  0  2  1  0  1  1 -1  1  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 108800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0  0 -1  1 -1  1 -1  0  0  0  1  0 -1] (Indices: [1, 2, 4, 6, 7, 8, 9, 11, 13, 18, 19]), Candidate: [3 1 0 1 0 2 1 0 1 0 1 0 2 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 108850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0  0 -1  0  1 -1  0  1 -1  1 -1  1 -1] (Indices: [1, 2, 4, 6, 7, 8, 9, 12, 15, 17, 19]), Candidate: [3 1 0 1 0 2 1 0 1 0 0 2 0 1 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 108900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0 -1  1  0  0 -1  1 -1  0  0  1 -1  0] (Indices: [1, 2, 4, 6, 7, 8, 10, 11, 12, 14, 18]), Candidate: [ 3  1  0  1  0  2  1  0  0  2  0  1  0  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0 -1  1 -1  1  0  0 -1  0  0  1 -1  0] (Indices: [1, 2, 4, 6, 7, 8, 10, 12, 13, 14, 18]), Candidate: [ 3  1  0  1  0  2  1  0  0  2 -1  2  1  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 109000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0 -1  1 -1  0  1 -1  0  1 -1  1  0 -1] (Indices: [1, 2, 4, 6, 7, 8, 10, 13, 16, 18, 19]), Candidate: [ 3  1  0  1  0  2  1  0  0  2 -1  1  2  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0 -1  0  1  0 -1  0  0  1 -1  1  0 -1] (Indices: [1, 2, 4, 6, 7, 8, 11, 12, 16, 18, 19]), Candidate: [3 1 0 1 0 2 1 0 0 1 1 1 0 1 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 109100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0 -1  0  0  1  0 -1  1 -1  1  0 -1  0] (Indices: [1, 2, 4, 6, 7, 8, 12, 13, 15, 17, 18]), Candidate: [3 1 0 1 0 2 1 0 0 1 0 2 1 0 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 109150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  1  0  0  0 -1  1 -1  1 -1  0  0  0] (Indices: [1, 2, 4, 6, 7, 9, 10, 11, 12, 14, 16]), Candidate: [ 3  1  0  1  0  2  1 -1  2  1  0  1  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 109200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  1  0 -1  1  0  0 -1  1 -1  0  0  0] (Indices: [1, 2, 4, 6, 7, 9, 10, 12, 13, 14, 16]), Candidate: [ 3  1  0  1  0  2  1 -1  2  1 -1  2  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 109250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  1  0 -1  0  1 -1  0  1  0  0 -1  0] (Indices: [1, 2, 4, 6, 7, 9, 10, 13, 16, 17, 18]), Candidate: [ 3  1  0  1  0  2  1 -1  2  1 -1  1  2  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 109300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  1 -1  1  0 -1  0  0  1  0  0 -1  0] (Indices: [1, 2, 4, 6, 7, 9, 11, 12, 16, 17, 18]), Candidate: [ 3  1  0  1  0  2  1 -1  2  0  1  1  0  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  1 -1  0  1  0 -1  1  0 -1  1 -1  0] (Indices: [1, 2, 4, 6, 7, 9, 12, 13, 15, 16, 18]), Candidate: [ 3  1  0  1  0  2  1 -1  2  0  0  2  1  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  0  1  0  0  0 -1  1  0 -1  0  0  0] (Indices: [1, 2, 4, 6, 7, 10, 11, 12, 13, 15, 16]), Candidate: [ 3  1  0  1  0  2  1 -1  1  2  0  1  1  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  0  1  0 -1  0  1  0  0  0 -1  0  0] (Indices: [1, 2, 4, 6, 7, 10, 11, 14, 15, 16, 17]), Candidate: [ 3  1  0  1  0  2  1 -1  1  2  0  0  1  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  0  1 -1  0  1  0  0  0  0 -1  0  0] (Indices: [1, 2, 4, 6, 7, 10, 13, 14, 15, 16, 17]), Candidate: [ 3  1  0  1  0  2  1 -1  1  2 -1  1  2  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 109550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  0  0  1  0 -1  1 -1  0  1  0  0 -1] (Indices: [1, 2, 4, 6, 7, 11, 12, 14, 17, 18, 19]), Candidate: [ 3  1  0  1  0  2  1 -1  1  1  1  1  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 109600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  0  0  0  0  1  0  0  0 -1  1  0 -1] (Indices: [1, 2, 4, 6, 7, 13, 14, 15, 16, 18, 19]), Candidate: [ 3  1  0  1  0  2  1 -1  1  1  0  1  2  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1  0  0  0 -1  0  1 -1  0  0  1  0 -1] (Indices: [1, 2, 4, 6, 8, 9, 10, 11, 14, 18, 19]), Candidate: [ 3  1  0  1  0  2  0  1  1  1  0  0  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1  0  0 -1  0  1  0 -1  1  0 -1  0  0] (Indices: [1, 2, 4, 6, 8, 9, 10, 13, 14, 16, 17]), Candidate: [ 3  1  0  1  0  2  0  1  1  1 -1  1  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 109750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1  0 -1  1  0 -1  1 -1  1  0 -1  0  0] (Indices: [1, 2, 4, 6, 8, 9, 11, 12, 14, 16, 17]), Candidate: [ 3  1  0  1  0  2  0  1  1  0  1  1  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1  0 -1  1 -1  0  0  0  1  0  0  0 -1] (Indices: [1, 2, 4, 6, 8, 9, 11, 16, 17, 18, 19]), Candidate: [3 1 0 1 0 2 0 1 1 0 1 0 1 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 109850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1  0 -1  0  0  1 -1  0  1  0  0  0 -1] (Indices: [1, 2, 4, 6, 8, 9, 13, 16, 17, 18, 19]), Candidate: [3 1 0 1 0 2 0 1 1 0 0 1 2 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 109900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1 -1  1  0 -1  1  0 -1  0  1 -1  1 -1] (Indices: [1, 2, 4, 6, 8, 10, 11, 13, 14, 17, 19]), Candidate: [ 3  1  0  1  0  2  0  1  0  2  0  0  2  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1 -1  1 -1  1 -1  1  0 -1  1  0 -1  0] (Indices: [1, 2, 4, 6, 8, 10, 12, 14, 15, 17, 18]), Candidate: [ 3  1  0  1  0  2  0  1  0  2 -1  2  0  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1 -1  0  1  0  0 -1  0  1  0 -1  1 -1] (Indices: [1, 2, 4, 6, 8, 11, 12, 13, 16, 17, 19]), Candidate: [3 1 0 1 0 2 0 1 0 1 1 1 1 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 110050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1 -1  0  0  1  0 -1  1  0  0 -1  1 -1] (Indices: [1, 2, 4, 6, 8, 12, 13, 15, 16, 17, 19]), Candidate: [3 1 0 1 0 2 0 1 0 1 0 2 1 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 110100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  1  0  0  0 -1  0  0  1 -1  1  0 -1] (Indices: [1, 2, 4, 6, 9, 10, 11, 12, 16, 18, 19]), Candidate: [3 1 0 1 0 2 0 0 2 1 0 1 0 1 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 110150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  1  0 -1  1  0 -1  1 -1  1  0 -1  0] (Indices: [1, 2, 4, 6, 9, 10, 12, 13, 15, 17, 18]), Candidate: [ 3  1  0  1  0  2  0  0  2  1 -1  2  1  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  1 -1  1  0  0  0 -1  0  1  0 -1  0] (Indices: [1, 2, 4, 6, 9, 11, 12, 13, 14, 17, 18]), Candidate: [ 3  1  0  1  0  2  0  0  2  0  1  1  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  1 -1  0  1  0  0  0  0 -1  1 -1  0] (Indices: [1, 2, 4, 6, 9, 12, 13, 14, 15, 16, 18]), Candidate: [3 1 0 1 0 2 0 0 2 0 0 2 1 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 110300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  0  1  0  0 -1  1  0 -1  1  0 -1  0] (Indices: [1, 2, 4, 6, 10, 11, 12, 14, 15, 17, 18]), Candidate: [3 1 0 1 0 2 0 0 1 2 0 1 0 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 110350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  0  1 -1  1 -1  1  0  0 -1  1  0 -1] (Indices: [1, 2, 4, 6, 10, 12, 14, 15, 16, 18, 19]), Candidate: [ 3  1  0  1  0  2  0  0  1  2 -1  2  0  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0  0  0  0  0  0 -1  0  0  1 -1  0  0] (Indices: [1, 2, 4, 7, 8, 9, 10, 11, 12, 13, 17]), Candidate: [3 1 0 1 0 1 2 0 1 1 0 1 1 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 110450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0  0  0  0 -1  0  0  0  1  0 -1  1 -1] (Indices: [1, 2, 4, 7, 8, 9, 10, 11, 16, 17, 19]), Candidate: [3 1 0 1 0 1 2 0 1 1 0 0 1 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 110500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0  0  0 -1  0  1 -1  1  0 -1  0  1 -1] (Indices: [1, 2, 4, 7, 8, 9, 10, 13, 15, 16, 19]), Candidate: [ 3  1  0  1  0  1  2  0  1  1 -1  1  2  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0  0 -1  1  0 -1  0  1  0 -1  0  1 -1] (Indices: [1, 2, 4, 7, 8, 9, 11, 12, 15, 16, 19]), Candidate: [3 1 0 1 0 1 2 0 1 0 1 1 0 1 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 110600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0  0 -1  0  1  0  0 -1  0  1  0 -1  0] (Indices: [1, 2, 4, 7, 8, 9, 12, 13, 14, 17, 18]), Candidate: [ 3  1  0  1  0  1  2  0  1  0  0  2  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0 -1  1  0  0  0  0 -1  1 -1  0  0  0] (Indices: [1, 2, 4, 7, 8, 10, 11, 12, 13, 14, 16]), Candidate: [ 3  1  0  1  0  1  2  0  0  2  0  1  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0 -1  1  0 -1  1 -1  0  1  0  0 -1  0] (Indices: [1, 2, 4, 7, 8, 10, 11, 13, 16, 17, 18]), Candidate: [3 1 0 1 0 1 2 0 0 2 0 0 2 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 110750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0 -1  1 -1  1 -1  0  1  0  0 -1  1 -1] (Indices: [1, 2, 4, 7, 8, 10, 12, 15, 16, 17, 19]), Candidate: [ 3  1  0  1  0  1  2  0  0  2 -1  2  0  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0 -1  0  1  0 -1  1  0 -1  0  1  0 -1] (Indices: [1, 2, 4, 7, 8, 11, 12, 14, 15, 18, 19]), Candidate: [3 1 0 1 0 1 2 0 0 1 1 1 0 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 110850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0 -1  0  0  1 -1  1 -1  1  0  0  0 -1] (Indices: [1, 2, 4, 7, 8, 12, 14, 16, 17, 18, 19]), Candidate: [ 3  1  0  1  0  1  2  0  0  1  0  2  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  1  0  0 -1  1  0 -1  1 -1  0  1 -1] (Indices: [1, 2, 4, 7, 9, 10, 11, 13, 14, 16, 19]), Candidate: [ 3  1  0  1  0  1  2 -1  2  1  0  0  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 110950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  1  0 -1  1 -1  1  0  0 -1  1 -1  0] (Indices: [1, 2, 4, 7, 9, 10, 12, 14, 15, 16, 18]), Candidate: [ 3  1  0  1  0  1  2 -1  2  1 -1  2  0  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 111000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  1 -1  1  0  0 -1  1 -1  0  1  0 -1] (Indices: [1, 2, 4, 7, 9, 11, 12, 13, 15, 18, 19]), Candidate: [ 3  1  0  1  0  1  2 -1  2  0  1  1  1  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  1 -1  0  1  0  0 -1  0  1  0  0 -1] (Indices: [1, 2, 4, 7, 9, 12, 13, 14, 17, 18, 19]), Candidate: [ 3  1  0  1  0  1  2 -1  2  0  0  2  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 111100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  0  1  0  0 -1  0  1  0  0 -1  1 -1] (Indices: [1, 2, 4, 7, 10, 11, 12, 15, 16, 17, 19]), Candidate: [ 3  1  0  1  0  1  2 -1  1  2  0  1  0  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  0  1 -1  0  1  0 -1  1  0  0  0 -1] (Indices: [1, 2, 4, 7, 10, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  1  0  1  0  1  2 -1  1  2 -1  1  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 111200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1  0  0  0  0  0 -1  0  1 -1  0  1 -1] (Indices: [1, 2, 4, 8, 9, 10, 11, 12, 13, 16, 19]), Candidate: [3 1 0 1 0 1 1 1 1 1 0 1 1 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 111250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1  0  0  0 -1  0  1 -1  1  0  0 -1  0] (Indices: [1, 2, 4, 8, 9, 10, 11, 14, 16, 17, 18]), Candidate: [ 3  1  0  1  0  1  1  1  1  1  0  0  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1  0  0 -1  0  1  0 -1  1  0  0 -1  0] (Indices: [1, 2, 4, 8, 9, 10, 13, 14, 16, 17, 18]), Candidate: [ 3  1  0  1  0  1  1  1  1  1 -1  1  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 111350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1  0 -1  1 -1  1  0  0  0  0 -1  0  0] (Indices: [1, 2, 4, 8, 9, 11, 13, 14, 15, 16, 17]), Candidate: [3 1 0 1 0 1 1 1 1 0 1 0 2 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 111400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1 -1  1  0  0  0  0  0 -1  1 -1  0  0] (Indices: [1, 2, 4, 8, 10, 11, 12, 13, 14, 15, 17]), Candidate: [3 1 0 1 0 1 1 1 0 2 0 1 1 1 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 111450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1 -1  1  0 -1  0  1  0  0  0 -1  1 -1] (Indices: [1, 2, 4, 8, 10, 11, 14, 15, 16, 17, 19]), Candidate: [3 1 0 1 0 1 1 1 0 2 0 0 1 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 111500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1 -1  0  1  0 -1  1  0  0 -1  1  0 -1] (Indices: [1, 2, 4, 8, 11, 12, 14, 15, 16, 18, 19]), Candidate: [3 1 0 1 0 1 1 1 0 1 1 1 0 2 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 111550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  1  0  0  0 -1  0  1  0  0 -1  1 -1] (Indices: [1, 2, 4, 9, 10, 11, 12, 15, 16, 17, 19]), Candidate: [3 1 0 1 0 1 1 0 2 1 0 1 0 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 111600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  1  0 -1  0  1  0 -1  1  0  0  0 -1] (Indices: [1, 2, 4, 9, 10, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  1  0  1  0  1  1  0  2  1 -1  1  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 111650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  0  1  0  0  0 -1  1  0  0 -1  1 -1] (Indices: [1, 2, 4, 10, 11, 12, 13, 15, 16, 17, 19]), Candidate: [3 1 0 1 0 1 1 0 1 2 0 1 1 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 111700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0  0  0  0 -1  0  1 -1  0  0  1 -1  0] (Indices: [1, 2, 5, 6, 7, 8, 9, 10, 11, 14, 18]), Candidate: [ 3  1  0  0  2  1  1  0  1  1  0  0  1  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0  0  0 -1  0  0  1  0 -1  0  1 -1  0] (Indices: [1, 2, 5, 6, 7, 8, 9, 10, 14, 15, 18]), Candidate: [ 3  1  0  0  2  1  1  0  1  1 -1  1  1  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0  0 -1  1 -1  1 -1  0  1 -1  0  1 -1] (Indices: [1, 2, 5, 6, 7, 8, 9, 11, 13, 16, 19]), Candidate: [3 1 0 0 2 1 1 0 1 0 1 0 2 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 111850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0  0 -1  0  1 -1  0  1  0 -1  1 -1  0] (Indices: [1, 2, 5, 6, 7, 8, 9, 12, 15, 16, 18]), Candidate: [3 1 0 0 2 1 1 0 1 0 0 2 0 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 111900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0 -1  1  0  0 -1  1  0 -1  0  0  0  0] (Indices: [1, 2, 5, 6, 7, 8, 10, 11, 12, 14, 15]), Candidate: [3 1 0 0 2 1 1 0 0 2 0 1 0 2 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 111950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0 -1  1 -1  1  0  0  0 -1  0  0  0  0] (Indices: [1, 2, 5, 6, 7, 8, 10, 12, 13, 14, 15]), Candidate: [ 3  1  0  0  2  1  1  0  0  2 -1  2  1  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0 -1  1 -1  0  1 -1  1 -1  0  1  0 -1] (Indices: [1, 2, 5, 6, 7, 8, 10, 13, 15, 18, 19]), Candidate: [ 3  1  0  0  2  1  1  0  0  2 -1  1  2  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0 -1  0  1  0 -1  0  1 -1  0  1  0 -1] (Indices: [1, 2, 5, 6, 7, 8, 11, 12, 15, 18, 19]), Candidate: [3 1 0 0 2 1 1 0 0 1 1 1 0 1 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 112100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0 -1  0  0  1  0 -1  1  0  0 -1  0  0] (Indices: [1, 2, 5, 6, 7, 8, 12, 13, 15, 16, 17]), Candidate: [3 1 0 0 2 1 1 0 0 1 0 2 1 0 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 112150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  1  0  0  0  0 -1  0  0  0  1 -1  0] (Indices: [1, 2, 5, 6, 7, 9, 10, 11, 12, 13, 18]), Candidate: [ 3  1  0  0  2  1  1 -1  2  1  0  1  1  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  1  0  0 -1  0  0  0  1 -1  1  0 -1] (Indices: [1, 2, 5, 6, 7, 9, 10, 11, 16, 18, 19]), Candidate: [ 3  1  0  0  2  1  1 -1  2  1  0  0  1  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  1  0 -1  0  1 -1  1 -1  1  0 -1  0] (Indices: [1, 2, 5, 6, 7, 9, 10, 13, 15, 17, 18]), Candidate: [ 3  1  0  0  2  1  1 -1  2  1 -1  1  2  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 112300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  1 -1  1  0 -1  0  1 -1  1  0 -1  0] (Indices: [1, 2, 5, 6, 7, 9, 11, 12, 15, 17, 18]), Candidate: [ 3  1  0  0  2  1  1 -1  2  0  1  1  0  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  1 -1  0  1  0  0 -1  0  1 -1  1 -1] (Indices: [1, 2, 5, 6, 7, 9, 12, 13, 14, 17, 19]), Candidate: [ 3  1  0  0  2  1  1 -1  2  0  0  2  1  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 112400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  0  1  0  0  0  0 -1  0  1 -1  0  0] (Indices: [1, 2, 5, 6, 7, 10, 11, 12, 13, 14, 17]), Candidate: [ 3  1  0  0  2  1  1 -1  1  2  0  1  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 112450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  0  1  0 -1  1 -1  0  1  0 -1  1 -1] (Indices: [1, 2, 5, 6, 7, 10, 11, 13, 16, 17, 19]), Candidate: [ 3  1  0  0  2  1  1 -1  1  2  0  0  2  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  0  1 -1  1 -1  0  1  0 -1  1  0 -1] (Indices: [1, 2, 5, 6, 7, 10, 12, 15, 16, 18, 19]), Candidate: [ 3  1  0  0  2  1  1 -1  1  2 -1  2  0  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 112550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  0  0  1  0 -1  1 -1  1  0  0 -1  0] (Indices: [1, 2, 5, 6, 7, 11, 12, 14, 16, 17, 18]), Candidate: [ 3  1  0  0  2  1  1 -1  1  1  1  1  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 112600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  0  0  0  1 -1  0  1  0  0  0  0 -1] (Indices: [1, 2, 5, 6, 7, 12, 15, 16, 17, 18, 19]), Candidate: [ 3  1  0  0  2  1  1 -1  1  1  0  2  0  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1  0  0  0 -1  0  1 -1  1 -1  0  1 -1] (Indices: [1, 2, 5, 6, 8, 9, 10, 11, 14, 16, 19]), Candidate: [ 3  1  0  0  2  1  0  1  1  1  0  0  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1  0  0 -1  0  1  0  0 -1  1 -1  0  0] (Indices: [1, 2, 5, 6, 8, 9, 10, 13, 14, 15, 17]), Candidate: [ 3  1  0  0  2  1  0  1  1  1 -1  1  2  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1  0 -1  1  0 -1  1  0 -1  1 -1  0  0] (Indices: [1, 2, 5, 6, 8, 9, 11, 12, 14, 15, 17]), Candidate: [3 1 0 0 2 1 0 1 1 0 1 1 0 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 112800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1  0 -1  1 -1  0  0  1  0  0 -1  1 -1] (Indices: [1, 2, 5, 6, 8, 9, 11, 15, 16, 17, 19]), Candidate: [3 1 0 0 2 1 0 1 1 0 1 0 1 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 112850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1  0 -1  0  0  1 -1  1  0  0 -1  1 -1] (Indices: [1, 2, 5, 6, 8, 9, 13, 15, 16, 17, 19]), Candidate: [3 1 0 0 2 1 0 1 1 0 0 1 2 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 112900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1 -1  1  0 -1  1  0 -1  1 -1  1 -1  0] (Indices: [1, 2, 5, 6, 8, 10, 11, 13, 14, 16, 18]), Candidate: [ 3  1  0  0  2  1  0  1  0  2  0  0  2  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1 -1  1 -1  1 -1  1  0  0  0 -1  0  0] (Indices: [1, 2, 5, 6, 8, 10, 12, 14, 15, 16, 17]), Candidate: [ 3  1  0  0  2  1  0  1  0  2 -1  2  0  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1 -1  0  1  0  0 -1  1 -1  1 -1  1 -1] (Indices: [1, 2, 5, 6, 8, 11, 12, 13, 15, 17, 19]), Candidate: [3 1 0 0 2 1 0 1 0 1 1 1 1 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 113050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1 -1  0  0  1  0  0 -1  1 -1  1  0 -1] (Indices: [1, 2, 5, 6, 8, 12, 13, 14, 16, 18, 19]), Candidate: [ 3  1  0  0  2  1  0  1  0  1  0  2  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  1  0  0  0 -1  0  1 -1  0  1  0 -1] (Indices: [1, 2, 5, 6, 9, 10, 11, 12, 15, 18, 19]), Candidate: [3 1 0 0 2 1 0 0 2 1 0 1 0 1 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 113150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  1  0 -1  1  0 -1  1  0  0 -1  0  0] (Indices: [1, 2, 5, 6, 9, 10, 12, 13, 15, 16, 17]), Candidate: [ 3  1  0  0  2  1  0  0  2  1 -1  2  1  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  1 -1  1  0  0  0 -1  1  0 -1  0  0] (Indices: [1, 2, 5, 6, 9, 11, 12, 13, 14, 16, 17]), Candidate: [ 3  1  0  0  2  1  0  0  2  0  1  1  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  1 -1  1 -1  0  1 -1  1  0  0  0 -1] (Indices: [1, 2, 5, 6, 9, 11, 14, 16, 17, 18, 19]), Candidate: [ 3  1  0  0  2  1  0  0  2  0  1  0  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  0  1  0  0 -1  1  0  0  0 -1  0  0] (Indices: [1, 2, 5, 6, 10, 11, 12, 14, 15, 16, 17]), Candidate: [3 1 0 0 2 1 0 0 1 2 0 1 0 2 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 113350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  0  1 -1  1  0 -1  0  1  0  0  0 -1] (Indices: [1, 2, 5, 6, 10, 12, 13, 16, 17, 18, 19]), Candidate: [ 3  1  0  0  2  1  0  0  1  2 -1  2  1  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0  0  0  0  0  0  0 -1  0  0  0  0  0] (Indices: [1, 2, 5, 7, 8, 9, 10, 11, 12, 13, 14]), Candidate: [ 3  1  0  0  2  0  2  0  1  1  0  1  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0  0  0  0 -1  0  0  1 -1  1 -1  1 -1] (Indices: [1, 2, 5, 7, 8, 9, 10, 11, 15, 17, 19]), Candidate: [3 1 0 0 2 0 2 0 1 1 0 0 1 1 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 113500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0  0  0 -1  0  1  0 -1  0  0  1  0 -1] (Indices: [1, 2, 5, 7, 8, 9, 10, 13, 14, 18, 19]), Candidate: [ 3  1  0  0  2  0  2  0  1  1 -1  1  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 113550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0  0 -1  1  0 -1  1 -1  0  0  1  0 -1] (Indices: [1, 2, 5, 7, 8, 9, 11, 12, 14, 18, 19]), Candidate: [ 3  1  0  0  2  0  2  0  1  0  1  1  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0  0 -1  0  1  0  0 -1  1  0 -1  0  0] (Indices: [1, 2, 5, 7, 8, 9, 12, 13, 14, 16, 17]), Candidate: [ 3  1  0  0  2  0  2  0  1  0  0  2  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0  0 -1  0  0  0  1 -1  1  0  0  0 -1] (Indices: [1, 2, 5, 7, 8, 9, 14, 16, 17, 18, 19]), Candidate: [ 3  1  0  0  2  0  2  0  1  0  0  1  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0 -1  1  0 -1  1 -1  1 -1  1  0 -1  0] (Indices: [1, 2, 5, 7, 8, 10, 11, 13, 15, 17, 18]), Candidate: [3 1 0 0 2 0 2 0 0 2 0 0 2 0 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 113750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0 -1  1 -1  1 -1  1 -1  1 -1  1  0 -1] (Indices: [1, 2, 5, 7, 8, 10, 12, 14, 16, 18, 19]), Candidate: [ 3  1  0  0  2  0  2  0  0  2 -1  2  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 113800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0 -1  0  1  0 -1  1  0  0 -1  0  1 -1] (Indices: [1, 2, 5, 7, 8, 11, 12, 14, 15, 16, 19]), Candidate: [3 1 0 0 2 0 2 0 0 1 1 1 0 2 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 113850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0 -1  0  0  1 -1  1  0  0  0 -1  1 -1] (Indices: [1, 2, 5, 7, 8, 12, 14, 15, 16, 17, 19]), Candidate: [3 1 0 0 2 0 2 0 0 1 0 2 0 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 113900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  1  0  0 -1  1  0  0 -1  0  0  1 -1] (Indices: [1, 2, 5, 7, 9, 10, 11, 13, 14, 15, 19]), Candidate: [ 3  1  0  0  2  0  2 -1  2  1  0  0  2  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  1  0 -1  1  0 -1  0  1 -1  1  0 -1] (Indices: [1, 2, 5, 7, 9, 10, 12, 13, 16, 18, 19]), Candidate: [ 3  1  0  0  2  0  2 -1  2  1 -1  2  1  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 114000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  1 -1  1  0  0 -1  1  0 -1  0  1 -1] (Indices: [1, 2, 5, 7, 9, 11, 12, 13, 15, 16, 19]), Candidate: [ 3  1  0  0  2  0  2 -1  2  0  1  1  1  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  1 -1  0  1  0  0 -1  1  0  0 -1  0] (Indices: [1, 2, 5, 7, 9, 12, 13, 14, 16, 17, 18]), Candidate: [ 3  1  0  0  2  0  2 -1  2  0  0  2  1  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 114100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  0  1  0  0 -1  1 -1  1 -1  1  0 -1] (Indices: [1, 2, 5, 7, 10, 11, 12, 14, 16, 18, 19]), Candidate: [ 3  1  0  0  2  0  2 -1  1  2  0  1  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 114150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  0  1 -1  0  1  0  0  0  0 -1  1 -1] (Indices: [1, 2, 5, 7, 10, 13, 14, 15, 16, 17, 19]), Candidate: [ 3  1  0  0  2  0  2 -1  1  2 -1  1  2  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 114200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1  0  0  0  0  0 -1  1 -1  0  0  1 -1] (Indices: [1, 2, 5, 8, 9, 10, 11, 12, 13, 15, 19]), Candidate: [3 1 0 0 2 0 1 1 1 1 0 1 1 0 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 114250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1  0  0  0 -1  0  1  0 -1  1  0 -1  0] (Indices: [1, 2, 5, 8, 9, 10, 11, 14, 15, 17, 18]), Candidate: [3 1 0 0 2 0 1 1 1 1 0 0 1 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 114300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1  0  0 -1  0  1  0  0 -1  1  0 -1  0] (Indices: [1, 2, 5, 8, 9, 10, 13, 14, 15, 17, 18]), Candidate: [ 3  1  0  0  2  0  1  1  1  1 -1  1  2  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1  0 -1  1  0 -1  0  1  0 -1  1  0 -1] (Indices: [1, 2, 5, 8, 9, 11, 12, 15, 16, 18, 19]), Candidate: [3 1 0 0 2 0 1 1 1 0 1 1 0 1 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 114400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1  0 -1  0  0  1 -1  1  0  0  0  0 -1] (Indices: [1, 2, 5, 8, 9, 13, 15, 16, 17, 18, 19]), Candidate: [3 1 0 0 2 0 1 1 1 0 0 1 2 0 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 114450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1 -1  1  0 -1  1 -1  1 -1  1  0  0 -1] (Indices: [1, 2, 5, 8, 10, 11, 13, 15, 17, 18, 19]), Candidate: [3 1 0 0 2 0 1 1 0 2 0 0 2 0 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 114500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1 -1  0  1  0  0 -1  0  1  0  0  0 -1] (Indices: [1, 2, 5, 8, 11, 12, 13, 16, 17, 18, 19]), Candidate: [3 1 0 0 2 0 1 1 0 1 1 1 1 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 114550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  1  0  0  0 -1  1 -1  1 -1  1  0 -1] (Indices: [1, 2, 5, 9, 10, 11, 12, 14, 16, 18, 19]), Candidate: [ 3  1  0  0  2  0  1  0  2  1  0  1  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  1  0 -1  0  1  0  0  0  0 -1  1 -1] (Indices: [1, 2, 5, 9, 10, 13, 14, 15, 16, 17, 19]), Candidate: [ 3  1  0  0  2  0  1  0  2  1 -1  1  2  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  0  1  0  0  0  0 -1  1 -1  1  0 -1] (Indices: [1, 2, 5, 10, 11, 12, 13, 14, 16, 18, 19]), Candidate: [ 3  1  0  0  2  0  1  0  1  2  0  1  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0  0  0  0  0 -1  0  1 -1  0  1 -1  0] (Indices: [1, 2, 6, 7, 8, 9, 10, 11, 12, 15, 18]), Candidate: [3 1 0 0 1 2 1 0 1 1 0 1 0 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 114750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0  0  0 -1  1  0 -1  1 -1  0  1 -1  0] (Indices: [1, 2, 6, 7, 8, 9, 10, 12, 13, 15, 18]), Candidate: [ 3  1  0  0  1  2  1  0  1  1 -1  2  1  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0  0  0 -1  0  0  1  0  0 -1  0  1 -1] (Indices: [1, 2, 6, 7, 8, 9, 10, 14, 15, 16, 19]), Candidate: [ 3  1  0  0  1  2  1  0  1  1 -1  1  1  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0  0 -1  1 -1  1  0  0 -1  0  1 -1  0] (Indices: [1, 2, 6, 7, 8, 9, 11, 13, 14, 15, 18]), Candidate: [3 1 0 0 1 2 1 0 1 0 1 0 2 1 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 114900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0  0 -1  0  1  0 -1  0  1  0 -1  1 -1] (Indices: [1, 2, 6, 7, 8, 9, 12, 13, 16, 17, 19]), Candidate: [3 1 0 0 1 2 1 0 1 0 0 2 1 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 114950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0 -1  1  0  0  0 -1  0  1 -1  0  1 -1] (Indices: [1, 2, 6, 7, 8, 10, 11, 12, 13, 16, 19]), Candidate: [3 1 0 0 1 2 1 0 0 2 0 1 1 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 115000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0 -1  1  0 -1  0  1 -1  1  0  0 -1  0] (Indices: [1, 2, 6, 7, 8, 10, 11, 14, 16, 17, 18]), Candidate: [ 3  1  0  0  1  2  1  0  0  2  0  0  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0 -1  1 -1  0  1  0 -1  1  0  0 -1  0] (Indices: [1, 2, 6, 7, 8, 10, 13, 14, 16, 17, 18]), Candidate: [ 3  1  0  0  1  2  1  0  0  2 -1  1  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 115100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0 -1  0  1 -1  1  0  0  0  0 -1  0  0] (Indices: [1, 2, 6, 7, 8, 11, 13, 14, 15, 16, 17]), Candidate: [3 1 0 0 1 2 1 0 0 1 1 0 2 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 115150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  1  0  0  0  0  0 -1  1 -1  0  0  0] (Indices: [1, 2, 6, 7, 9, 10, 11, 12, 13, 14, 16]), Candidate: [ 3  1  0  0  1  2  1 -1  2  1  0  1  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 115200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  1  0  0 -1  1 -1  0  1  0  0 -1  0] (Indices: [1, 2, 6, 7, 9, 10, 11, 13, 16, 17, 18]), Candidate: [ 3  1  0  0  1  2  1 -1  2  1  0  0  2  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  1  0 -1  1 -1  0  1  0  0 -1  1 -1] (Indices: [1, 2, 6, 7, 9, 10, 12, 15, 16, 17, 19]), Candidate: [ 3  1  0  0  1  2  1 -1  2  1 -1  2  0  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 115300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  1 -1  1  0 -1  1  0 -1  0  1  0 -1] (Indices: [1, 2, 6, 7, 9, 11, 12, 14, 15, 18, 19]), Candidate: [ 3  1  0  0  1  2  1 -1  2  0  1  1  0  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  1 -1  0  1 -1  1 -1  1  0  0  0 -1] (Indices: [1, 2, 6, 7, 9, 12, 14, 16, 17, 18, 19]), Candidate: [ 3  1  0  0  1  2  1 -1  2  0  0  2  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 115400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  0  1  0 -1  1  0 -1  1  0  0 -1  0] (Indices: [1, 2, 6, 7, 10, 11, 13, 14, 16, 17, 18]), Candidate: [ 3  1  0  0  1  2  1 -1  1  2  0  0  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 115450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  0  0  1  0  0  0 -1  1  0 -1  1 -1] (Indices: [1, 2, 6, 7, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 3  1  0  0  1  2  1 -1  1  1  1  1  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 115500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1  0  0  0  0 -1  1 -1  1 -1  0  1 -1] (Indices: [1, 2, 6, 8, 9, 10, 11, 12, 14, 16, 19]), Candidate: [ 3  1  0  0  1  2  0  1  1  1  0  1  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1  0  0 -1  1  0  0  0 -1  1 -1  0  0] (Indices: [1, 2, 6, 8, 9, 10, 12, 13, 14, 15, 17]), Candidate: [ 3  1  0  0  1  2  0  1  1  1 -1  2  1  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1  0  0 -1  0  0  1  0  0  0 -1  1 -1] (Indices: [1, 2, 6, 8, 9, 10, 14, 15, 16, 17, 19]), Candidate: [ 3  1  0  0  1  2  0  1  1  1 -1  1  1  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1  0 -1  1 -1  1 -1  1  0  0  0 -1  0] (Indices: [1, 2, 6, 8, 9, 11, 13, 15, 16, 17, 18]), Candidate: [3 1 0 0 1 2 0 1 1 0 1 0 2 0 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 115700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1 -1  1  0  0  0 -1  1  0 -1  1 -1  0] (Indices: [1, 2, 6, 8, 10, 11, 12, 13, 15, 16, 18]), Candidate: [3 1 0 0 1 2 0 1 0 2 0 1 1 0 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 115750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1 -1  1 -1  1  0  0  0 -1  0  1  0 -1] (Indices: [1, 2, 6, 8, 10, 12, 13, 14, 15, 18, 19]), Candidate: [ 3  1  0  0  1  2  0  1  0  2 -1  2  1  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1 -1  0  1 -1  0  1  0  0  0  0  0 -1] (Indices: [1, 2, 6, 8, 11, 14, 15, 16, 17, 18, 19]), Candidate: [3 1 0 0 1 2 0 1 0 1 1 0 1 2 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 115850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  1  0  0 -1  1  0 -1  1  0  0 -1  0] (Indices: [1, 2, 6, 9, 10, 11, 13, 14, 16, 17, 18]), Candidate: [ 3  1  0  0  1  2  0  0  2  1  0  0  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  1 -1  1  0  0  0 -1  1  0 -1  1 -1] (Indices: [1, 2, 6, 9, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 3  1  0  0  1  2  0  0  2  0  1  1  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  0  1  0 -1  1  0  0  0  0  0 -1  0] (Indices: [1, 2, 6, 10, 11, 13, 14, 15, 16, 17, 18]), Candidate: [3 1 0 0 1 2 0 0 1 2 0 0 2 1 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 116000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0  0  0  0  0 -1  0  1  0 -1  1 -1  0] (Indices: [1, 2, 7, 8, 9, 10, 11, 12, 15, 16, 18]), Candidate: [3 1 0 0 1 1 2 0 1 1 0 1 0 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 116050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0  0  0 -1  1  0  0 -1  1 -1  0  1 -1] (Indices: [1, 2, 7, 8, 9, 10, 12, 13, 14, 16, 19]), Candidate: [ 3  1  0  0  1  1  2  0  1  1 -1  2  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 116100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0  0 -1  1  0  0  0  0  0 -1  0  0  0] (Indices: [1, 2, 7, 8, 9, 11, 12, 13, 14, 15, 16]), Candidate: [3 1 0 0 1 1 2 0 1 0 1 1 1 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 116150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0  0 -1  1 -1  0  1  0  0  0  0 -1  0] (Indices: [1, 2, 7, 8, 9, 11, 14, 15, 16, 17, 18]), Candidate: [3 1 0 0 1 1 2 0 1 0 1 0 1 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 116200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0 -1  1  0  0  0 -1  0  1  0  0 -1  0] (Indices: [1, 2, 7, 8, 10, 11, 12, 13, 16, 17, 18]), Candidate: [3 1 0 0 1 1 2 0 0 2 0 1 1 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 116250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0 -1  1 -1  1  0 -1  1  0  0  0 -1  0] (Indices: [1, 2, 7, 8, 10, 12, 13, 15, 16, 17, 18]), Candidate: [ 3  1  0  0  1  1  2  0  0  2 -1  2  1  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0 -1  0  0  1  0  0 -1  1  0  0  0 -1] (Indices: [1, 2, 7, 8, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  1  0  0  1  1  2  0  0  1  0  2  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  1  0  0 -1  1 -1  1  0  0 -1  1 -1] (Indices: [1, 2, 7, 9, 10, 11, 13, 15, 16, 17, 19]), Candidate: [ 3  1  0  0  1  1  2 -1  2  1  0  0  2  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  1 -1  1  0  0 -1  1  0 -1  1  0 -1] (Indices: [1, 2, 7, 9, 11, 12, 13, 15, 16, 18, 19]), Candidate: [ 3  1  0  0  1  1  2 -1  2  0  1  1  1  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  0  1  0 -1  1 -1  1  0  0  0  0 -1] (Indices: [1, 2, 7, 10, 11, 13, 15, 16, 17, 18, 19]), Candidate: [ 3  1  0  0  1  1  2 -1  1  2  0  0  2  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1  0  0  0  0 -1  0  1  0  0 -1  1 -1] (Indices: [1, 2, 8, 9, 10, 11, 12, 15, 16, 17, 19]), Candidate: [3 1 0 0 1 1 1 1 1 1 0 1 0 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 116550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1  0  0 -1  0  1  0 -1  1  0  0  0 -1] (Indices: [1, 2, 8, 9, 10, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  1  0  0  1  1  1  1  1  1 -1  1  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 116600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1 -1  1  0  0  0 -1  1  0  0 -1  1 -1] (Indices: [1, 2, 8, 10, 11, 12, 13, 15, 16, 17, 19]), Candidate: [3 1 0 0 1 1 1 1 0 2 0 1 1 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 116650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  0  1  0  0  0 -1  1  0  0  0 -1  1 -1] (Indices: [1, 2, 9, 10, 11, 12, 14, 15, 16, 17, 19]), Candidate: [3 1 0 0 1 1 1 0 2 1 0 1 0 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 116700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0  0  0 -1  1 -1  0  0  1 -1  0  0  0] (Indices: [1, 3, 4, 5, 6, 7, 8, 9, 10, 12, 16]), Candidate: [ 3  0  2  0  1  1  1  0  1  1 -1  2  0  1  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0  0 -1  1 -1  0  0  0  0  1  0 -1  0] (Indices: [1, 3, 4, 5, 6, 7, 8, 9, 11, 17, 18]), Candidate: [3 0 2 0 1 1 1 0 1 0 1 0 1 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 116800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0  0 -1  0  0  0  0  1  0 -1  1 -1  0] (Indices: [1, 3, 4, 5, 6, 7, 8, 9, 15, 16, 18]), Candidate: [3 0 2 0 1 1 1 0 1 0 0 1 1 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 116850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0 -1  1 -1  1 -1  0  1 -1  0  1 -1  0] (Indices: [1, 3, 4, 5, 6, 7, 8, 10, 12, 15, 18]), Candidate: [ 3  0  2  0  1  1  1  0  0  2 -1  2  0  1  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0 -1  0  1  0 -1  1 -1  1 -1  0  0  0] (Indices: [1, 3, 4, 5, 6, 7, 8, 11, 12, 14, 16]), Candidate: [ 3  0  2  0  1  1  1  0  0  1  1  1  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0 -1  0  0  1  0  0 -1  1 -1  0  0  0] (Indices: [1, 3, 4, 5, 6, 7, 8, 12, 13, 14, 16]), Candidate: [ 3  0  2  0  1  1  1  0  0  1  0  2  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0 -1  0  0  0  1 -1  0  1  0  0 -1  0] (Indices: [1, 3, 4, 5, 6, 7, 8, 13, 16, 17, 18]), Candidate: [3 0 2 0 1 1 1 0 0 1 0 1 2 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 117050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  1  0 -1  1  0 -1  0  0  1 -1  0  0] (Indices: [1, 3, 4, 5, 6, 7, 9, 10, 12, 13, 17]), Candidate: [ 3  0  2  0  1  1  1 -1  2  1 -1  2  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 117100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  1  0 -1  0  0  0  0  1  0 -1  1 -1] (Indices: [1, 3, 4, 5, 6, 7, 9, 10, 16, 17, 19]), Candidate: [ 3  0  2  0  1  1  1 -1  2  1 -1  1  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 117150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  1 -1  1 -1  0  0  1  0 -1  1 -1  0] (Indices: [1, 3, 4, 5, 6, 7, 9, 11, 15, 16, 18]), Candidate: [ 3  0  2  0  1  1  1 -1  2  0  1  0  1  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  1 -1  0  0  1  0 -1  1 -1  0  1 -1] (Indices: [1, 3, 4, 5, 6, 7, 9, 13, 14, 16, 19]), Candidate: [ 3  0  2  0  1  1  1 -1  2  0  0  1  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 117250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  0  1  0 -1  1  0  0 -1  0  0  0  0] (Indices: [1, 3, 4, 5, 6, 7, 10, 11, 13, 14, 15]), Candidate: [ 3  0  2  0  1  1  1 -1  1  2  0  0  2  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  0  1 -1  1 -1  1  0  0 -1  0  0  0] (Indices: [1, 3, 4, 5, 6, 7, 10, 12, 14, 15, 16]), Candidate: [ 3  0  2  0  1  1  1 -1  1  2 -1  2  0  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 117350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  0  1 -1  0  0  0  1  0  0  0 -1  0] (Indices: [1, 3, 4, 5, 6, 7, 10, 15, 16, 17, 18]), Candidate: [ 3  0  2  0  1  1  1 -1  1  2 -1  1  1  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 117400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  0  0  1 -1  1 -1  1  0  0 -1  0  0] (Indices: [1, 3, 4, 5, 6, 7, 11, 13, 15, 16, 17]), Candidate: [ 3  0  2  0  1  1  1 -1  1  1  1  0  2  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  0  0  0  1 -1  1  0 -1  0  1  0 -1] (Indices: [1, 3, 4, 5, 6, 7, 12, 14, 15, 18, 19]), Candidate: [ 3  0  2  0  1  1  1 -1  1  1  0  2  0  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1  0  0  0 -1  0  0  1 -1  1 -1  0  0] (Indices: [1, 3, 4, 5, 6, 8, 9, 10, 11, 15, 17]), Candidate: [3 0 2 0 1 1 0 1 1 1 0 0 1 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 117550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1  0  0 -1  0  0  1 -1  1 -1  1 -1  0] (Indices: [1, 3, 4, 5, 6, 8, 9, 10, 14, 16, 18]), Candidate: [ 3  0  2  0  1  1  0  1  1  1 -1  1  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 117600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1  0 -1  1 -1  1 -1  0  0  0  1  0 -1] (Indices: [1, 3, 4, 5, 6, 8, 9, 11, 13, 18, 19]), Candidate: [3 0 2 0 1 1 0 1 1 0 1 0 2 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 117650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1  0 -1  0  1 -1  0  1 -1  1 -1  1 -1] (Indices: [1, 3, 4, 5, 6, 8, 9, 12, 15, 17, 19]), Candidate: [3 0 2 0 1 1 0 1 1 0 0 2 0 1 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 117700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1 -1  1  0  0 -1  1 -1  0  0  1 -1  0] (Indices: [1, 3, 4, 5, 6, 8, 10, 11, 12, 14, 18]), Candidate: [ 3  0  2  0  1  1  0  1  0  2  0  1  0  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1 -1  1 -1  1  0  0 -1  0  0  1 -1  0] (Indices: [1, 3, 4, 5, 6, 8, 10, 12, 13, 14, 18]), Candidate: [ 3  0  2  0  1  1  0  1  0  2 -1  2  1  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 117800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1 -1  1 -1  0  1 -1  0  1 -1  1  0 -1] (Indices: [1, 3, 4, 5, 6, 8, 10, 13, 16, 18, 19]), Candidate: [ 3  0  2  0  1  1  0  1  0  2 -1  1  2  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1 -1  0  1  0 -1  0  0  1 -1  1  0 -1] (Indices: [1, 3, 4, 5, 6, 8, 11, 12, 16, 18, 19]), Candidate: [3 0 2 0 1 1 0 1 0 1 1 1 0 1 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 117900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1 -1  0  0  1  0 -1  1 -1  1  0 -1  0] (Indices: [1, 3, 4, 5, 6, 8, 12, 13, 15, 17, 18]), Candidate: [3 0 2 0 1 1 0 1 0 1 0 2 1 0 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 117950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  1  0  0  0 -1  1 -1  1 -1  0  0  0] (Indices: [1, 3, 4, 5, 6, 9, 10, 11, 12, 14, 16]), Candidate: [ 3  0  2  0  1  1  0  0  2  1  0  1  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  1  0 -1  1  0  0 -1  1 -1  0  0  0] (Indices: [1, 3, 4, 5, 6, 9, 10, 12, 13, 14, 16]), Candidate: [ 3  0  2  0  1  1  0  0  2  1 -1  2  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 118050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  1  0 -1  0  1 -1  0  1  0  0 -1  0] (Indices: [1, 3, 4, 5, 6, 9, 10, 13, 16, 17, 18]), Candidate: [ 3  0  2  0  1  1  0  0  2  1 -1  1  2  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  1 -1  1  0 -1  0  0  1  0  0 -1  0] (Indices: [1, 3, 4, 5, 6, 9, 11, 12, 16, 17, 18]), Candidate: [3 0 2 0 1 1 0 0 2 0 1 1 0 1 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 118150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  1 -1  0  1  0 -1  1  0 -1  1 -1  0] (Indices: [1, 3, 4, 5, 6, 9, 12, 13, 15, 16, 18]), Candidate: [3 0 2 0 1 1 0 0 2 0 0 2 1 0 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 118200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  0  1  0  0  0 -1  1  0 -1  0  0  0] (Indices: [1, 3, 4, 5, 6, 10, 11, 12, 13, 15, 16]), Candidate: [3 0 2 0 1 1 0 0 1 2 0 1 1 0 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 118250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  0  1  0 -1  0  1  0  0  0 -1  0  0] (Indices: [1, 3, 4, 5, 6, 10, 11, 14, 15, 16, 17]), Candidate: [3 0 2 0 1 1 0 0 1 2 0 0 1 2 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 118300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  0  1 -1  0  1  0  0  0  0 -1  0  0] (Indices: [1, 3, 4, 5, 6, 10, 13, 14, 15, 16, 17]), Candidate: [ 3  0  2  0  1  1  0  0  1  2 -1  1  2  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  0  0  1  0 -1  1 -1  0  1  0  0 -1] (Indices: [1, 3, 4, 5, 6, 11, 12, 14, 17, 18, 19]), Candidate: [ 3  0  2  0  1  1  0  0  1  1  1  1  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  0  0  0  0  1  0  0  0 -1  1  0 -1] (Indices: [1, 3, 4, 5, 6, 13, 14, 15, 16, 18, 19]), Candidate: [3 0 2 0 1 1 0 0 1 1 0 1 2 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 118450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0  0  0 -1  1 -1  0  0  1 -1  0  1 -1] (Indices: [1, 3, 4, 5, 7, 8, 9, 10, 12, 16, 19]), Candidate: [ 3  0  2  0  1  0  2  0  1  1 -1  2  0  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0  0 -1  1  0 -1  0  1  0 -1  0  0  0] (Indices: [1, 3, 4, 5, 7, 8, 9, 11, 12, 15, 16]), Candidate: [3 0 2 0 1 0 2 0 1 0 1 1 0 1 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 118550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0  0 -1  0  1  0 -1  1  0 -1  0  0  0] (Indices: [1, 3, 4, 5, 7, 8, 9, 12, 13, 15, 16]), Candidate: [3 0 2 0 1 0 2 0 1 0 0 2 1 0 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 118600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0  0 -1  0  0  0  1  0  0  0 -1  0  0] (Indices: [1, 3, 4, 5, 7, 8, 9, 14, 15, 16, 17]), Candidate: [3 0 2 0 1 0 2 0 1 0 0 1 1 2 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 118650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0 -1  1  0 -1  1 -1  0  0  0  1  0 -1] (Indices: [1, 3, 4, 5, 7, 8, 10, 11, 13, 18, 19]), Candidate: [3 0 2 0 1 0 2 0 0 2 0 0 2 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 118700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0 -1  1 -1  1 -1  0  1 -1  1 -1  1 -1] (Indices: [1, 3, 4, 5, 7, 8, 10, 12, 15, 17, 19]), Candidate: [ 3  0  2  0  1  0  2  0  0  2 -1  2  0  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0 -1  0  1  0  0 -1  0  1  0 -1  0  0] (Indices: [1, 3, 4, 5, 7, 8, 11, 12, 13, 16, 17]), Candidate: [3 0 2 0 1 0 2 0 0 1 1 1 1 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 118800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0 -1  0  1 -1  0  1  0 -1  1 -1  1 -1] (Indices: [1, 3, 4, 5, 7, 8, 11, 14, 15, 17, 19]), Candidate: [3 0 2 0 1 0 2 0 0 1 1 0 1 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 118850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0 -1  0  0  0  1  0  0 -1  1 -1  1 -1] (Indices: [1, 3, 4, 5, 7, 8, 13, 14, 15, 17, 19]), Candidate: [3 0 2 0 1 0 2 0 0 1 0 1 2 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 118900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  1  0  0 -1  1 -1  0  0  1  0 -1  0] (Indices: [1, 3, 4, 5, 7, 9, 10, 11, 13, 17, 18]), Candidate: [ 3  0  2  0  1  0  2 -1  2  1  0  0  2  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  1  0 -1  1 -1  0  1  0 -1  0  1 -1] (Indices: [1, 3, 4, 5, 7, 9, 10, 12, 15, 16, 19]), Candidate: [ 3  0  2  0  1  0  2 -1  2  1 -1  2  0  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 119000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  1 -1  1  0  0 -1  1 -1  0  1 -1  0] (Indices: [1, 3, 4, 5, 7, 9, 11, 12, 13, 15, 18]), Candidate: [ 3  0  2  0  1  0  2 -1  2  0  1  1  1  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  1 -1  1 -1  0  1  0  0 -1  0  1 -1] (Indices: [1, 3, 4, 5, 7, 9, 11, 14, 15, 16, 19]), Candidate: [ 3  0  2  0  1  0  2 -1  2  0  1  0  1  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  1 -1  0  0  1  0  0  0 -1  0  1 -1] (Indices: [1, 3, 4, 5, 7, 9, 13, 14, 15, 16, 19]), Candidate: [ 3  0  2  0  1  0  2 -1  2  0  0  1  2  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  0  1  0  0 -1  0  0  1  0  0 -1  0] (Indices: [1, 3, 4, 5, 7, 10, 11, 12, 16, 17, 18]), Candidate: [ 3  0  2  0  1  0  2 -1  1  2  0  1  0  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  0  1 -1  1  0 -1  1  0 -1  1 -1  0] (Indices: [1, 3, 4, 5, 7, 10, 12, 13, 15, 16, 18]), Candidate: [ 3  0  2  0  1  0  2 -1  1  2 -1  2  1  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 119250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  0  0  1  0  0  0 -1  1 -1  1 -1  0] (Indices: [1, 3, 4, 5, 7, 11, 12, 13, 14, 16, 18]), Candidate: [ 3  0  2  0  1  0  2 -1  1  1  1  1  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 119300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  0  0  1 -1  0  0  1  0  0  0  0 -1] (Indices: [1, 3, 4, 5, 7, 11, 15, 16, 17, 18, 19]), Candidate: [ 3  0  2  0  1  0  2 -1  1  1  1  0  1  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1  0  0  0 -1  1  0  0 -1  0  0  0  0] (Indices: [1, 3, 4, 5, 8, 9, 10, 11, 13, 14, 15]), Candidate: [3 0 2 0 1 0 1 1 1 1 0 0 2 1 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 119400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1  0  0 -1  1 -1  1  0  0 -1  0  0  0] (Indices: [1, 3, 4, 5, 8, 9, 10, 12, 14, 15, 16]), Candidate: [ 3  0  2  0  1  0  1  1  1  1 -1  2  0  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1  0  0 -1  0  0  0  1  0  0  0 -1  0] (Indices: [1, 3, 4, 5, 8, 9, 10, 15, 16, 17, 18]), Candidate: [ 3  0  2  0  1  0  1  1  1  1 -1  1  1  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1  0 -1  1 -1  1 -1  1  0  0 -1  0  0] (Indices: [1, 3, 4, 5, 8, 9, 11, 13, 15, 16, 17]), Candidate: [3 0 2 0 1 0 1 1 1 0 1 0 2 0 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 119550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1  0 -1  0  1 -1  1  0 -1  0  1  0 -1] (Indices: [1, 3, 4, 5, 8, 9, 12, 14, 15, 18, 19]), Candidate: [3 0 2 0 1 0 1 1 1 0 0 2 0 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 119600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1 -1  1  0  0 -1  1 -1  1  0 -1  0  0] (Indices: [1, 3, 4, 5, 8, 10, 11, 12, 14, 16, 17]), Candidate: [ 3  0  2  0  1  0  1  1  0  2  0  1  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1 -1  1  0 -1  0  0  0  1  0  0  0 -1] (Indices: [1, 3, 4, 5, 8, 10, 11, 16, 17, 18, 19]), Candidate: [3 0 2 0 1 0 1 1 0 2 0 0 1 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 119700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1 -1  1 -1  0  1 -1  0  1  0  0  0 -1] (Indices: [1, 3, 4, 5, 8, 10, 13, 16, 17, 18, 19]), Candidate: [ 3  0  2  0  1  0  1  1  0  2 -1  1  2  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1 -1  0  1 -1  1  0 -1  1 -1  1  0 -1] (Indices: [1, 3, 4, 5, 8, 11, 13, 14, 16, 18, 19]), Candidate: [ 3  0  2  0  1  0  1  1  0  1  1  0  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  1  0  0  0  0 -1  0  1  0 -1  0  0] (Indices: [1, 3, 4, 5, 9, 10, 11, 12, 13, 16, 17]), Candidate: [3 0 2 0 1 0 1 0 2 1 0 1 1 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 119850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  1  0  0 -1  0  1  0 -1  1 -1  1 -1] (Indices: [1, 3, 4, 5, 9, 10, 11, 14, 15, 17, 19]), Candidate: [3 0 2 0 1 0 1 0 2 1 0 0 1 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 119900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  1  0 -1  0  1  0  0 -1  1 -1  1 -1] (Indices: [1, 3, 4, 5, 9, 10, 13, 14, 15, 17, 19]), Candidate: [ 3  0  2  0  1  0  1  0  2  1 -1  1  2  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  1 -1  1  0 -1  0  1 -1  1  0  0 -1] (Indices: [1, 3, 4, 5, 9, 11, 12, 15, 17, 18, 19]), Candidate: [3 0 2 0 1 0 1 0 2 0 1 1 0 1 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 120000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  1 -1  0  0  0  1  0  0  0  0  0 -1] (Indices: [1, 3, 4, 5, 9, 14, 15, 16, 17, 18, 19]), Candidate: [3 0 2 0 1 0 1 0 2 0 0 1 1 2 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 120050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  0  1  0 -1  1 -1  0  1  0  0  0 -1] (Indices: [1, 3, 4, 5, 10, 11, 13, 16, 17, 18, 19]), Candidate: [3 0 2 0 1 0 1 0 1 2 0 0 2 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 120100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  0  0  1  0 -1  1  0  0  0  0 -1  0] (Indices: [1, 3, 4, 5, 11, 12, 14, 15, 16, 17, 18]), Candidate: [3 0 2 0 1 0 1 0 1 1 1 1 0 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 120150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0  0  0 -1  1  0 -1  1 -1  0  0  0  0] (Indices: [1, 3, 4, 6, 7, 8, 9, 10, 12, 13, 15]), Candidate: [ 3  0  2  0  0  2  1  0  1  1 -1  2  1  0  1  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0  0  0 -1  0  0  0  1 -1  0  1  0 -1] (Indices: [1, 3, 4, 6, 7, 8, 9, 10, 15, 18, 19]), Candidate: [ 3  0  2  0  0  2  1  0  1  1 -1  1  1  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0  0 -1  1 -1  0  1 -1  0  0  1  0 -1] (Indices: [1, 3, 4, 6, 7, 8, 9, 11, 14, 18, 19]), Candidate: [ 3  0  2  0  0  2  1  0  1  0  1  0  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0  0 -1  0  0  1  0 -1  1  0 -1  0  0] (Indices: [1, 3, 4, 6, 7, 8, 9, 13, 14, 16, 17]), Candidate: [ 3  0  2  0  0  2  1  0  1  0  0  1  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0 -1  1  0  0 -1  0  0  0  1 -1  1 -1] (Indices: [1, 3, 4, 6, 7, 8, 10, 11, 12, 17, 19]), Candidate: [3 0 2 0 0 2 1 0 0 2 0 1 0 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 120400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0 -1  1 -1  1  0 -1  0  0  1 -1  1 -1] (Indices: [1, 3, 4, 6, 7, 8, 10, 12, 13, 17, 19]), Candidate: [ 3  0  2  0  0  2  1  0  0  2 -1  2  1  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0 -1  1 -1  0  0  1 -1  1 -1  1  0 -1] (Indices: [1, 3, 4, 6, 7, 8, 10, 14, 16, 18, 19]), Candidate: [ 3  0  2  0  0  2  1  0  0  2 -1  1  1  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 120500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0 -1  0  1 -1  1  0 -1  0  1 -1  1 -1] (Indices: [1, 3, 4, 6, 7, 8, 11, 13, 14, 17, 19]), Candidate: [ 3  0  2  0  0  2  1  0  0  1  1  0  2  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0 -1  0  0  1 -1  1  0 -1  1  0 -1  0] (Indices: [1, 3, 4, 6, 7, 8, 12, 14, 15, 17, 18]), Candidate: [3 0 2 0 0 2 1 0 0 1 0 2 0 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 120600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  1  0  0  0 -1  0  0  1 -1  0  1 -1] (Indices: [1, 3, 4, 6, 7, 9, 10, 11, 12, 16, 19]), Candidate: [ 3  0  2  0  0  2  1 -1  2  1  0  1  0  1  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  1  0 -1  1  0 -1  0  1 -1  0  1 -1] (Indices: [1, 3, 4, 6, 7, 9, 10, 12, 13, 16, 19]), Candidate: [ 3  0  2  0  0  2  1 -1  2  1 -1  2  1  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 120700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  1  0 -1  0  0  1 -1  1  0  0 -1  0] (Indices: [1, 3, 4, 6, 7, 9, 10, 14, 16, 17, 18]), Candidate: [ 3  0  2  0  0  2  1 -1  2  1 -1  1  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 120750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  1 -1  1 -1  1  0 -1  1 -1  0  1 -1] (Indices: [1, 3, 4, 6, 7, 9, 11, 13, 14, 16, 19]), Candidate: [ 3  0  2  0  0  2  1 -1  2  0  1  0  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 120800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  1 -1  0  1 -1  1  0  0 -1  1 -1  0] (Indices: [1, 3, 4, 6, 7, 9, 12, 14, 15, 16, 18]), Candidate: [ 3  0  2  0  0  2  1 -1  2  0  0  2  0  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  0  1  0  0 -1  1  0  0 -1  0  0  0] (Indices: [1, 3, 4, 6, 7, 10, 11, 12, 14, 15, 16]), Candidate: [ 3  0  2  0  0  2  1 -1  1  2  0  1  0  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  0  1  0 -1  0  0  1  0  0  0 -1  0] (Indices: [1, 3, 4, 6, 7, 10, 11, 15, 16, 17, 18]), Candidate: [ 3  0  2  0  0  2  1 -1  1  2  0  0  1  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  0  1 -1  0  1 -1  1  0  0  0 -1  0] (Indices: [1, 3, 4, 6, 7, 10, 13, 15, 16, 17, 18]), Candidate: [ 3  0  2  0  0  2  1 -1  1  2 -1  1  2  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 121000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  0  0  1 -1  1  0  0 -1  1 -1  1 -1] (Indices: [1, 3, 4, 6, 7, 11, 13, 14, 15, 17, 19]), Candidate: [ 3  0  2  0  0  2  1 -1  1  1  1  0  2  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1  0  0  0  0  0 -1  0  0  0  0  1 -1] (Indices: [1, 3, 4, 6, 8, 9, 10, 11, 12, 13, 19]), Candidate: [3 0 2 0 0 2 0 1 1 1 0 1 1 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 121100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1  0  0  0 -1  0  0  0  0  1  0  0 -1] (Indices: [1, 3, 4, 6, 8, 9, 10, 11, 17, 18, 19]), Candidate: [3 0 2 0 0 2 0 1 1 1 0 0 1 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 121150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1  0  0 -1  0  1 -1  1 -1  1 -1  1 -1] (Indices: [1, 3, 4, 6, 8, 9, 10, 13, 15, 17, 19]), Candidate: [ 3  0  2  0  0  2  0  1  1  1 -1  1  2  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1  0 -1  1  0 -1  0  1 -1  1 -1  1 -1] (Indices: [1, 3, 4, 6, 8, 9, 11, 12, 15, 17, 19]), Candidate: [3 0 2 0 0 2 0 1 1 0 1 1 0 1 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 121250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1  0 -1  0  1  0  0 -1  0  0  1  0 -1] (Indices: [1, 3, 4, 6, 8, 9, 12, 13, 14, 18, 19]), Candidate: [ 3  0  2  0  0  2  0  1  1  0  0  2  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1 -1  1  0  0  0  0 -1  0  0  1 -1  0] (Indices: [1, 3, 4, 6, 8, 10, 11, 12, 13, 14, 18]), Candidate: [ 3  0  2  0  0  2  0  1  0  2  0  1  1  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1 -1  1  0 -1  1 -1  0  1 -1  1  0 -1] (Indices: [1, 3, 4, 6, 8, 10, 11, 13, 16, 18, 19]), Candidate: [3 0 2 0 0 2 0 1 0 2 0 0 2 0 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 121400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1 -1  1 -1  1 -1  0  1 -1  1  0  0 -1] (Indices: [1, 3, 4, 6, 8, 10, 12, 15, 17, 18, 19]), Candidate: [ 3  0  2  0  0  2  0  1  0  2 -1  2  0  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1 -1  0  1  0 -1  1 -1  1  0 -1  1 -1] (Indices: [1, 3, 4, 6, 8, 11, 12, 14, 16, 17, 19]), Candidate: [ 3  0  2  0  0  2  0  1  0  1  1  1  0  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1 -1  0  0  0  1  0  0  0  0  0 -1  0] (Indices: [1, 3, 4, 6, 8, 13, 14, 15, 16, 17, 18]), Candidate: [3 0 2 0 0 2 0 1 0 1 0 1 2 1 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 121550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  1  0  0 -1  1  0 -1  0  1 -1  1 -1] (Indices: [1, 3, 4, 6, 9, 10, 11, 13, 14, 17, 19]), Candidate: [ 3  0  2  0  0  2  0  0  2  1  0  0  2  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  1  0 -1  1 -1  1  0 -1  1  0 -1  0] (Indices: [1, 3, 4, 6, 9, 10, 12, 14, 15, 17, 18]), Candidate: [ 3  0  2  0  0  2  0  0  2  1 -1  2  0  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  1 -1  1  0  0 -1  0  1  0 -1  1 -1] (Indices: [1, 3, 4, 6, 9, 11, 12, 13, 16, 17, 19]), Candidate: [3 0 2 0 0 2 0 0 2 0 1 1 1 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 121700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  1 -1  0  1  0 -1  1  0  0 -1  1 -1] (Indices: [1, 3, 4, 6, 9, 12, 13, 15, 16, 17, 19]), Candidate: [3 0 2 0 0 2 0 0 2 0 0 2 1 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 121750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  0  1  0  0 -1  0  1 -1  1  0  0 -1] (Indices: [1, 3, 4, 6, 10, 11, 12, 15, 17, 18, 19]), Candidate: [3 0 2 0 0 2 0 0 1 2 0 1 0 1 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 121800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  0  1 -1  0  0  1  0  0  0  0  0 -1] (Indices: [1, 3, 4, 6, 10, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  0  2  0  0  2  0  0  1  2 -1  1  1  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0  0  0  0  0 -1  0  1 -1  0  1 -1  0] (Indices: [1, 3, 4, 7, 8, 9, 10, 11, 12, 15, 18]), Candidate: [3 0 2 0 0 1 2 0 1 1 0 1 0 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 121900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0  0  0 -1  1  0 -1  1 -1  0  1 -1  0] (Indices: [1, 3, 4, 7, 8, 9, 10, 12, 13, 15, 18]), Candidate: [ 3  0  2  0  0  1  2  0  1  1 -1  2  1  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0  0  0 -1  0  0  1  0  0 -1  0  1 -1] (Indices: [1, 3, 4, 7, 8, 9, 10, 14, 15, 16, 19]), Candidate: [ 3  0  2  0  0  1  2  0  1  1 -1  1  1  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0  0 -1  1 -1  1  0  0 -1  0  1 -1  0] (Indices: [1, 3, 4, 7, 8, 9, 11, 13, 14, 15, 18]), Candidate: [3 0 2 0 0 1 2 0 1 0 1 0 2 1 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 122050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0  0 -1  0  1  0 -1  0  1  0 -1  1 -1] (Indices: [1, 3, 4, 7, 8, 9, 12, 13, 16, 17, 19]), Candidate: [3 0 2 0 0 1 2 0 1 0 0 2 1 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 122100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0 -1  1  0  0  0 -1  0  1 -1  0  1 -1] (Indices: [1, 3, 4, 7, 8, 10, 11, 12, 13, 16, 19]), Candidate: [3 0 2 0 0 1 2 0 0 2 0 1 1 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 122150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0 -1  1  0 -1  0  1 -1  1  0  0 -1  0] (Indices: [1, 3, 4, 7, 8, 10, 11, 14, 16, 17, 18]), Candidate: [ 3  0  2  0  0  1  2  0  0  2  0  0  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0 -1  1 -1  0  1  0 -1  1  0  0 -1  0] (Indices: [1, 3, 4, 7, 8, 10, 13, 14, 16, 17, 18]), Candidate: [ 3  0  2  0  0  1  2  0  0  2 -1  1  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 122250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0 -1  0  1 -1  1  0  0  0  0 -1  0  0] (Indices: [1, 3, 4, 7, 8, 11, 13, 14, 15, 16, 17]), Candidate: [3 0 2 0 0 1 2 0 0 1 1 0 2 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 122300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  1  0  0  0  0  0 -1  1 -1  0  0  0] (Indices: [1, 3, 4, 7, 9, 10, 11, 12, 13, 14, 16]), Candidate: [ 3  0  2  0  0  1  2 -1  2  1  0  1  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 122350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  1  0  0 -1  1 -1  0  1  0  0 -1  0] (Indices: [1, 3, 4, 7, 9, 10, 11, 13, 16, 17, 18]), Candidate: [ 3  0  2  0  0  1  2 -1  2  1  0  0  2  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  1  0 -1  1 -1  0  1  0  0 -1  1 -1] (Indices: [1, 3, 4, 7, 9, 10, 12, 15, 16, 17, 19]), Candidate: [ 3  0  2  0  0  1  2 -1  2  1 -1  2  0  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 122450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  1 -1  1  0 -1  1  0 -1  0  1  0 -1] (Indices: [1, 3, 4, 7, 9, 11, 12, 14, 15, 18, 19]), Candidate: [ 3  0  2  0  0  1  2 -1  2  0  1  1  0  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  1 -1  0  1 -1  1 -1  1  0  0  0 -1] (Indices: [1, 3, 4, 7, 9, 12, 14, 16, 17, 18, 19]), Candidate: [ 3  0  2  0  0  1  2 -1  2  0  0  2  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 122550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  0  1  0 -1  1  0 -1  1  0  0 -1  0] (Indices: [1, 3, 4, 7, 10, 11, 13, 14, 16, 17, 18]), Candidate: [ 3  0  2  0  0  1  2 -1  1  2  0  0  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 122600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  0  0  1  0  0  0 -1  1  0 -1  1 -1] (Indices: [1, 3, 4, 7, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 3  0  2  0  0  1  2 -1  1  1  1  1  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 122650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1  0  0  0  0 -1  1 -1  1 -1  0  1 -1] (Indices: [1, 3, 4, 8, 9, 10, 11, 12, 14, 16, 19]), Candidate: [ 3  0  2  0  0  1  1  1  1  1  0  1  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1  0  0 -1  1  0  0  0 -1  1 -1  0  0] (Indices: [1, 3, 4, 8, 9, 10, 12, 13, 14, 15, 17]), Candidate: [ 3  0  2  0  0  1  1  1  1  1 -1  2  1  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1  0  0 -1  0  0  1  0  0  0 -1  1 -1] (Indices: [1, 3, 4, 8, 9, 10, 14, 15, 16, 17, 19]), Candidate: [ 3  0  2  0  0  1  1  1  1  1 -1  1  1  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1  0 -1  1 -1  1 -1  1  0  0  0 -1  0] (Indices: [1, 3, 4, 8, 9, 11, 13, 15, 16, 17, 18]), Candidate: [3 0 2 0 0 1 1 1 1 0 1 0 2 0 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 122850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1 -1  1  0  0  0 -1  1  0 -1  1 -1  0] (Indices: [1, 3, 4, 8, 10, 11, 12, 13, 15, 16, 18]), Candidate: [3 0 2 0 0 1 1 1 0 2 0 1 1 0 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 122900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1 -1  1 -1  1  0  0  0 -1  0  1  0 -1] (Indices: [1, 3, 4, 8, 10, 12, 13, 14, 15, 18, 19]), Candidate: [ 3  0  2  0  0  1  1  1  0  2 -1  2  1  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1 -1  0  1 -1  0  1  0  0  0  0  0 -1] (Indices: [1, 3, 4, 8, 11, 14, 15, 16, 17, 18, 19]), Candidate: [3 0 2 0 0 1 1 1 0 1 1 0 1 2 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 123000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  1  0  0 -1  1  0 -1  1  0  0 -1  0] (Indices: [1, 3, 4, 9, 10, 11, 13, 14, 16, 17, 18]), Candidate: [ 3  0  2  0  0  1  1  0  2  1  0  0  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  1 -1  1  0  0  0 -1  1  0 -1  1 -1] (Indices: [1, 3, 4, 9, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 3  0  2  0  0  1  1  0  2  0  1  1  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  0  1  0 -1  1  0  0  0  0  0 -1  0] (Indices: [1, 3, 4, 10, 11, 13, 14, 15, 16, 17, 18]), Candidate: [3 0 2 0 0 1 1 0 1 2 0 0 2 1 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 123150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0  0  0  0 -1  0  0  0  0  1 -1  1 -1] (Indices: [1, 3, 5, 6, 7, 8, 9, 10, 11, 17, 19]), Candidate: [ 3  0  2 -1  2  1  1  0  1  1  0  0  1  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0  0  0 -1  0  0  0  1  0 -1  0  1 -1] (Indices: [1, 3, 5, 6, 7, 8, 9, 10, 15, 16, 19]), Candidate: [ 3  0  2 -1  2  1  1  0  1  1 -1  1  1  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 123250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0  0 -1  1 -1  0  1 -1  1 -1  0  1 -1] (Indices: [1, 3, 5, 6, 7, 8, 9, 11, 14, 16, 19]), Candidate: [ 3  0  2 -1  2  1  1  0  1  0  1  0  1  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 123300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0  0 -1  0  0  1  0  0 -1  1 -1  0  0] (Indices: [1, 3, 5, 6, 7, 8, 9, 13, 14, 15, 17]), Candidate: [ 3  0  2 -1  2  1  1  0  1  0  0  1  2  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0 -1  1  0  0 -1  0  0  1 -1  1 -1  0] (Indices: [1, 3, 5, 6, 7, 8, 10, 11, 12, 16, 18]), Candidate: [ 3  0  2 -1  2  1  1  0  0  2  0  1  0  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0 -1  1 -1  1  0 -1  0  1 -1  1 -1  0] (Indices: [1, 3, 5, 6, 7, 8, 10, 12, 13, 16, 18]), Candidate: [ 3  0  2 -1  2  1  1  0  0  2 -1  2  1  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 123450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0 -1  1 -1  0  0  1  0 -1  0  1  0 -1] (Indices: [1, 3, 5, 6, 7, 8, 10, 14, 15, 18, 19]), Candidate: [ 3  0  2 -1  2  1  1  0  0  2 -1  1  1  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 123500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0 -1  0  1 -1  1  0 -1  1 -1  1 -1  0] (Indices: [1, 3, 5, 6, 7, 8, 11, 13, 14, 16, 18]), Candidate: [ 3  0  2 -1  2  1  1  0  0  1  1  0  2  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 123550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0 -1  0  0  1 -1  1  0  0  0 -1  0  0] (Indices: [1, 3, 5, 6, 7, 8, 12, 14, 15, 16, 17]), Candidate: [ 3  0  2 -1  2  1  1  0  0  1  0  2  0  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  1  0  0  0 -1  0  1 -1  0  0  1 -1] (Indices: [1, 3, 5, 6, 7, 9, 10, 11, 12, 15, 19]), Candidate: [ 3  0  2 -1  2  1  1 -1  2  1  0  1  0  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 123650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  1  0 -1  1  0 -1  1 -1  0  0  1 -1] (Indices: [1, 3, 5, 6, 7, 9, 10, 12, 13, 15, 19]), Candidate: [ 3  0  2 -1  2  1  1 -1  2  1 -1  2  1  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 123700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  1  0 -1  0  0  1  0 -1  1  0 -1  0] (Indices: [1, 3, 5, 6, 7, 9, 10, 14, 15, 17, 18]), Candidate: [ 3  0  2 -1  2  1  1 -1  2  1 -1  1  1  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 123750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  1 -1  1 -1  1  0  0 -1  0  0  1 -1] (Indices: [1, 3, 5, 6, 7, 9, 11, 13, 14, 15, 19]), Candidate: [ 3  0  2 -1  2  1  1 -1  2  0  1  0  2  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 123800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  1 -1  0  1  0 -1  0  1 -1  1  0 -1] (Indices: [1, 3, 5, 6, 7, 9, 12, 13, 16, 18, 19]), Candidate: [ 3  0  2 -1  2  1  1 -1  2  0  0  2  1  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 123850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  0  1  0  0  0 -1  0  0  1  0 -1  0] (Indices: [1, 3, 5, 6, 7, 10, 11, 12, 13, 17, 18]), Candidate: [ 3  0  2 -1  2  1  1 -1  1  2  0  1  1  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 123900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  0  1  0 -1  0  1 -1  1  0 -1  1 -1] (Indices: [1, 3, 5, 6, 7, 10, 11, 14, 16, 17, 19]), Candidate: [ 3  0  2 -1  2  1  1 -1  1  2  0  0  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 123950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  0  1 -1  0  1  0 -1  1  0 -1  1 -1] (Indices: [1, 3, 5, 6, 7, 10, 13, 14, 16, 17, 19]), Candidate: [ 3  0  2 -1  2  1  1 -1  1  2 -1  1  2  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 124000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  0  0  1 -1  1  0  0  0 -1  1 -1  0] (Indices: [1, 3, 5, 6, 7, 11, 13, 14, 15, 16, 18]), Candidate: [ 3  0  2 -1  2  1  1 -1  1  1  1  0  2  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1  0  0  0  0  0 -1  0  1 -1  0  0  0] (Indices: [1, 3, 5, 6, 8, 9, 10, 11, 12, 13, 16]), Candidate: [ 3  0  2 -1  2  1  0  1  1  1  0  1  1  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 124100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1  0  0  0 -1  0  0  0  1  0  0 -1  0] (Indices: [1, 3, 5, 6, 8, 9, 10, 11, 16, 17, 18]), Candidate: [ 3  0  2 -1  2  1  0  1  1  1  0  0  1  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 124150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1  0  0 -1  0  1 -1  1  0 -1  1 -1  0] (Indices: [1, 3, 5, 6, 8, 9, 10, 13, 15, 16, 18]), Candidate: [ 3  0  2 -1  2  1  0  1  1  1 -1  1  2  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1  0 -1  1  0 -1  0  1  0 -1  1 -1  0] (Indices: [1, 3, 5, 6, 8, 9, 11, 12, 15, 16, 18]), Candidate: [ 3  0  2 -1  2  1  0  1  1  0  1  1  0  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 124250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1  0 -1  0  1  0  0 -1  1 -1  0  1 -1] (Indices: [1, 3, 5, 6, 8, 9, 12, 13, 14, 16, 19]), Candidate: [ 3  0  2 -1  2  1  0  1  1  0  0  2  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1 -1  1  0  0  0  0  0 -1  0  0  0  0] (Indices: [1, 3, 5, 6, 8, 10, 11, 12, 13, 14, 15]), Candidate: [ 3  0  2 -1  2  1  0  1  0  2  0  1  1  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 124350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1 -1  1  0 -1  1 -1  1 -1  0  1  0 -1] (Indices: [1, 3, 5, 6, 8, 10, 11, 13, 15, 18, 19]), Candidate: [ 3  0  2 -1  2  1  0  1  0  2  0  0  2  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 124400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1 -1  1 -1  1 -1  0  1  0  0  0 -1  0] (Indices: [1, 3, 5, 6, 8, 10, 12, 15, 16, 17, 18]), Candidate: [ 3  0  2 -1  2  1  0  1  0  2 -1  2  0  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1 -1  0  1  0 -1  1  0 -1  1 -1  1 -1] (Indices: [1, 3, 5, 6, 8, 11, 12, 14, 15, 17, 19]), Candidate: [ 3  0  2 -1  2  1  0  1  0  1  1  1  0  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 124500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1 -1  0  0  1 -1  1  0 -1  1  0  0 -1] (Indices: [1, 3, 5, 6, 8, 12, 14, 15, 17, 18, 19]), Candidate: [ 3  0  2 -1  2  1  0  1  0  1  0  2  0  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 124550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  1  0  0 -1  1  0 -1  1 -1  1 -1  0] (Indices: [1, 3, 5, 6, 9, 10, 11, 13, 14, 16, 18]), Candidate: [ 3  0  2 -1  2  1  0  0  2  1  0  0  2  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  1  0 -1  1 -1  1  0  0  0 -1  0  0] (Indices: [1, 3, 5, 6, 9, 10, 12, 14, 15, 16, 17]), Candidate: [ 3  0  2 -1  2  1  0  0  2  1 -1  2  0  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  1 -1  1  0  0 -1  1 -1  1 -1  1 -1] (Indices: [1, 3, 5, 6, 9, 11, 12, 13, 15, 17, 19]), Candidate: [ 3  0  2 -1  2  1  0  0  2  0  1  1  1  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 124700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  1 -1  0  1  0  0 -1  1 -1  1  0 -1] (Indices: [1, 3, 5, 6, 9, 12, 13, 14, 16, 18, 19]), Candidate: [ 3  0  2 -1  2  1  0  0  2  0  0  2  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  0  1  0  0 -1  0  1  0  0  0 -1  0] (Indices: [1, 3, 5, 6, 10, 11, 12, 15, 16, 17, 18]), Candidate: [ 3  0  2 -1  2  1  0  0  1  2  0  1  0  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 124800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  0  1 -1  0  1  0  0 -1  1  0  0 -1] (Indices: [1, 3, 5, 6, 10, 13, 14, 15, 17, 18, 19]), Candidate: [ 3  0  2 -1  2  1  0  0  1  2 -1  1  2  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0  0  0  0  0 -1  1 -1  0  0  0  1 -1] (Indices: [1, 3, 5, 7, 8, 9, 10, 11, 12, 14, 19]), Candidate: [ 3  0  2 -1  2  0  2  0  1  1  0  1  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0  0  0 -1  1  0  0 -1  0  0  0  1 -1] (Indices: [1, 3, 5, 7, 8, 9, 10, 12, 13, 14, 19]), Candidate: [ 3  0  2 -1  2  0  2  0  1  1 -1  2  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 124950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0  0  0 -1  0  1 -1  0  0  1  0  0 -1] (Indices: [1, 3, 5, 7, 8, 9, 10, 13, 17, 18, 19]), Candidate: [ 3  0  2 -1  2  0  2  0  1  1 -1  1  2  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0  0 -1  1  0 -1  0  0  0  1  0  0 -1] (Indices: [1, 3, 5, 7, 8, 9, 11, 12, 17, 18, 19]), Candidate: [ 3  0  2 -1  2  0  2  0  1  0  1  1  0  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 125050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0  0 -1  0  1  0 -1  1 -1  1 -1  1 -1] (Indices: [1, 3, 5, 7, 8, 9, 12, 13, 15, 17, 19]), Candidate: [ 3  0  2 -1  2  0  2  0  1  0  0  2  1  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 125100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0 -1  1  0  0  0 -1  1 -1  0  0  1 -1] (Indices: [1, 3, 5, 7, 8, 10, 11, 12, 13, 15, 19]), Candidate: [ 3  0  2 -1  2  0  2  0  0  2  0  1  1  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 125150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0 -1  1  0 -1  0  1  0 -1  1  0 -1  0] (Indices: [1, 3, 5, 7, 8, 10, 11, 14, 15, 17, 18]), Candidate: [ 3  0  2 -1  2  0  2  0  0  2  0  0  1  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 125200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0 -1  1 -1  0  1  0  0 -1  1  0 -1  0] (Indices: [1, 3, 5, 7, 8, 10, 13, 14, 15, 17, 18]), Candidate: [ 3  0  2 -1  2  0  2  0  0  2 -1  1  2  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0 -1  0  1  0 -1  0  1  0 -1  1  0 -1] (Indices: [1, 3, 5, 7, 8, 11, 12, 15, 16, 18, 19]), Candidate: [ 3  0  2 -1  2  0  2  0  0  1  1  1  0  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 125300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0 -1  0  0  0  1 -1  1  0  0  0  0 -1] (Indices: [1, 3, 5, 7, 8, 13, 15, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  2  0  2  0  0  1  0  1  2  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 125350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  1  0  0 -1  1 -1  1 -1  1  0 -1  0] (Indices: [1, 3, 5, 7, 9, 10, 11, 13, 15, 17, 18]), Candidate: [ 3  0  2 -1  2  0  2 -1  2  1  0  0  2  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  1  0 -1  1 -1  1 -1  1 -1  1  0 -1] (Indices: [1, 3, 5, 7, 9, 10, 12, 14, 16, 18, 19]), Candidate: [ 3  0  2 -1  2  0  2 -1  2  1 -1  2  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 125450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  1 -1  1  0 -1  1  0  0 -1  0  1 -1] (Indices: [1, 3, 5, 7, 9, 11, 12, 14, 15, 16, 19]), Candidate: [ 3  0  2 -1  2  0  2 -1  2  0  1  1  0  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  1 -1  0  1 -1  1  0  0  0 -1  1 -1] (Indices: [1, 3, 5, 7, 9, 12, 14, 15, 16, 17, 19]), Candidate: [ 3  0  2 -1  2  0  2 -1  2  0  0  2  0  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  0  1  0 -1  1  0  0 -1  1  0 -1  0] (Indices: [1, 3, 5, 7, 10, 11, 13, 14, 15, 17, 18]), Candidate: [ 3  0  2 -1  2  0  2 -1  1  2  0  0  2  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  0  0  1  0  0  0  0 -1  1 -1  1 -1] (Indices: [1, 3, 5, 7, 11, 12, 13, 14, 15, 17, 19]), Candidate: [ 3  0  2 -1  2  0  2 -1  1  1  1  1  1  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1  0  0  0  0 -1  1  0 -1  0  0  1 -1] (Indices: [1, 3, 5, 8, 9, 10, 11, 12, 14, 15, 19]), Candidate: [ 3  0  2 -1  2  0  1  1  1  1  0  1  0  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 125700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1  0  0  0 -1  0  0  1 -1  1  0  0 -1] (Indices: [1, 3, 5, 8, 9, 10, 11, 15, 17, 18, 19]), Candidate: [ 3  0  2 -1  2  0  1  1  1  1  0  0  1  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 125750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1  0  0 -1  0  1 -1  1 -1  1  0  0 -1] (Indices: [1, 3, 5, 8, 9, 10, 13, 15, 17, 18, 19]), Candidate: [ 3  0  2 -1  2  0  1  1  1  1 -1  1  2  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1  0 -1  1 -1  1  0 -1  1  0 -1  1 -1] (Indices: [1, 3, 5, 8, 9, 11, 13, 14, 16, 17, 19]), Candidate: [ 3  0  2 -1  2  0  1  1  1  0  1  0  2  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1 -1  1  0  0  0  0 -1  0  1 -1  1 -1] (Indices: [1, 3, 5, 8, 10, 11, 12, 13, 14, 17, 19]), Candidate: [ 3  0  2 -1  2  0  1  1  0  2  0  1  1  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1 -1  1 -1  1  0  0  0  0 -1  0  1 -1] (Indices: [1, 3, 5, 8, 10, 12, 13, 14, 15, 16, 19]), Candidate: [ 3  0  2 -1  2  0  1  1  0  2 -1  2  1  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1 -1  0  1 -1  1  0  0 -1  1  0  0 -1] (Indices: [1, 3, 5, 8, 11, 13, 14, 15, 17, 18, 19]), Candidate: [ 3  0  2 -1  2  0  1  1  0  1  1  0  2  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 126000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  1  0  0 -1  1  0  0 -1  1  0 -1  0] (Indices: [1, 3, 5, 9, 10, 11, 13, 14, 15, 17, 18]), Candidate: [ 3  0  2 -1  2  0  1  0  2  1  0  0  2  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 126050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  1 -1  1  0  0  0  0 -1  1 -1  1 -1] (Indices: [1, 3, 5, 9, 11, 12, 13, 14, 15, 17, 19]), Candidate: [ 3  0  2 -1  2  0  1  0  2  0  1  1  1  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 126100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  0  1  0  0 -1  1  0 -1  1  0  0 -1] (Indices: [1, 3, 5, 10, 11, 12, 14, 15, 17, 18, 19]), Candidate: [ 3  0  2 -1  2  0  1  0  1  2  0  1  0  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 126150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0  0  0  0 -1  1  0 -1  0  1 -1  0  0] (Indices: [1, 3, 6, 7, 8, 9, 10, 11, 13, 14, 17]), Candidate: [ 3  0  2 -1  1  2  1  0  1  1  0  0  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 126200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0  0  0 -1  1 -1  1  0 -1  0  1 -1  0] (Indices: [1, 3, 6, 7, 8, 9, 10, 12, 14, 15, 18]), Candidate: [ 3  0  2 -1  1  2  1  0  1  1 -1  2  0  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 126250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0  0  0 -1  0  0  0  1  0 -1  1  0 -1] (Indices: [1, 3, 6, 7, 8, 9, 10, 15, 16, 18, 19]), Candidate: [ 3  0  2 -1  1  2  1  0  1  1 -1  1  1  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 126300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0  0 -1  1 -1  1 -1  1  0 -1  0  1 -1] (Indices: [1, 3, 6, 7, 8, 9, 11, 13, 15, 16, 19]), Candidate: [ 3  0  2 -1  1  2  1  0  1  0  1  0  2  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 126350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0  0 -1  0  1 -1  1 -1  1  0 -1  1 -1] (Indices: [1, 3, 6, 7, 8, 9, 12, 14, 16, 17, 19]), Candidate: [ 3  0  2 -1  1  2  1  0  1  0  0  2  0  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 126400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0 -1  1  0  0 -1  1 -1  1 -1  0  1 -1] (Indices: [1, 3, 6, 7, 8, 10, 11, 12, 14, 16, 19]), Candidate: [ 3  0  2 -1  1  2  1  0  0  2  0  1  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 126450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0 -1  1 -1  1  0  0  0 -1  1 -1  0  0] (Indices: [1, 3, 6, 7, 8, 10, 12, 13, 14, 15, 17]), Candidate: [ 3  0  2 -1  1  2  1  0  0  2 -1  2  1  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 126500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0 -1  1 -1  0  0  1  0  0  0 -1  1 -1] (Indices: [1, 3, 6, 7, 8, 10, 14, 15, 16, 17, 19]), Candidate: [ 3  0  2 -1  1  2  1  0  0  2 -1  1  1  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 126550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0 -1  0  1 -1  1 -1  1  0  0  0 -1  0] (Indices: [1, 3, 6, 7, 8, 11, 13, 15, 16, 17, 18]), Candidate: [ 3  0  2 -1  1  2  1  0  0  1  1  0  2  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 126600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  1  0  0  0  0 -1  0  1 -1  0  1 -1] (Indices: [1, 3, 6, 7, 9, 10, 11, 12, 13, 16, 19]), Candidate: [ 3  0  2 -1  1  2  1 -1  2  1  0  1  1  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 126650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  1  0  0 -1  0  1 -1  1  0  0 -1  0] (Indices: [1, 3, 6, 7, 9, 10, 11, 14, 16, 17, 18]), Candidate: [ 3  0  2 -1  1  2  1 -1  2  1  0  0  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 126700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  1  0 -1  0  1  0 -1  1  0  0 -1  0] (Indices: [1, 3, 6, 7, 9, 10, 13, 14, 16, 17, 18]), Candidate: [ 3  0  2 -1  1  2  1 -1  2  1 -1  1  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 126750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  1 -1  1 -1  1  0  0  0  0 -1  0  0] (Indices: [1, 3, 6, 7, 9, 11, 13, 14, 15, 16, 17]), Candidate: [ 3  0  2 -1  1  2  1 -1  2  0  1  0  2  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 126800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  0  1  0  0  0  0  0 -1  1 -1  0  0] (Indices: [1, 3, 6, 7, 10, 11, 12, 13, 14, 15, 17]), Candidate: [ 3  0  2 -1  1  2  1 -1  1  2  0  1  1  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 126850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  0  1  0 -1  0  1  0  0  0 -1  1 -1] (Indices: [1, 3, 6, 7, 10, 11, 14, 15, 16, 17, 19]), Candidate: [ 3  0  2 -1  1  2  1 -1  1  2  0  0  1  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 126900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  0  0  1  0 -1  1  0  0 -1  1  0 -1] (Indices: [1, 3, 6, 7, 11, 12, 14, 15, 16, 18, 19]), Candidate: [ 3  0  2 -1  1  2  1 -1  1  1  1  1  0  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 126950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1  0  0  0  0 -1  0  0  1  0  0 -1  0] (Indices: [1, 3, 6, 8, 9, 10, 11, 12, 16, 17, 18]), Candidate: [ 3  0  2 -1  1  2  0  1  1  1  0  1  0  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 127000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1  0  0 -1  1  0 -1  1  0 -1  1 -1  0] (Indices: [1, 3, 6, 8, 9, 10, 12, 13, 15, 16, 18]), Candidate: [ 3  0  2 -1  1  2  0  1  1  1 -1  2  1  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 127050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1  0 -1  1  0  0  0 -1  1 -1  1 -1  0] (Indices: [1, 3, 6, 8, 9, 11, 12, 13, 14, 16, 18]), Candidate: [ 3  0  2 -1  1  2  0  1  1  0  1  1  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 127100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1  0 -1  1 -1  0  0  1  0  0  0  0 -1] (Indices: [1, 3, 6, 8, 9, 11, 15, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  1  2  0  1  1  0  1  0  1  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 127150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1 -1  1  0  0 -1  1  0  0 -1  1 -1  0] (Indices: [1, 3, 6, 8, 10, 11, 12, 14, 15, 16, 18]), Candidate: [ 3  0  2 -1  1  2  0  1  0  2  0  1  0  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 127200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1 -1  1 -1  1 -1  1  0  0  0  0 -1  0] (Indices: [1, 3, 6, 8, 10, 12, 14, 15, 16, 17, 18]), Candidate: [ 3  0  2 -1  1  2  0  1  0  2 -1  2  0  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 127250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  1  0  0  0  0  0  0 -1  1 -1  0  0] (Indices: [1, 3, 6, 9, 10, 11, 12, 13, 14, 15, 17]), Candidate: [ 3  0  2 -1  1  2  0  0  2  1  0  1  1  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 127300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  1  0  0 -1  0  1  0  0  0 -1  1 -1] (Indices: [1, 3, 6, 9, 10, 11, 14, 15, 16, 17, 19]), Candidate: [ 3  0  2 -1  1  2  0  0  2  1  0  0  1  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 127350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  1 -1  1  0 -1  1  0  0 -1  1  0 -1] (Indices: [1, 3, 6, 9, 11, 12, 14, 15, 16, 18, 19]), Candidate: [ 3  0  2 -1  1  2  0  0  2  0  1  1  0  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 127400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  0  1 -1  1  0  0  0 -1  1  0  0 -1] (Indices: [1, 3, 6, 10, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 3  0  2 -1  1  2  0  0  1  2 -1  2  1  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 127450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0  0  0  0 -1  1  0  0 -1  1 -1  0  0] (Indices: [1, 3, 7, 8, 9, 10, 11, 13, 14, 15, 17]), Candidate: [ 3  0  2 -1  1  1  2  0  1  1  0  0  2  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 127500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0  0  0 -1  1  0 -1  0  1  0  0 -1  0] (Indices: [1, 3, 7, 8, 9, 10, 12, 13, 16, 17, 18]), Candidate: [ 3  0  2 -1  1  1  2  0  1  1 -1  2  1  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 127550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0  0 -1  1  0  0 -1  1  0  0 -1  0  0] (Indices: [1, 3, 7, 8, 9, 11, 12, 13, 15, 16, 17]), Candidate: [ 3  0  2 -1  1  1  2  0  1  0  1  1  1  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 127600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0  0 -1  0  1  0  0  0 -1  1 -1  1 -1] (Indices: [1, 3, 7, 8, 9, 12, 13, 14, 15, 17, 19]), Candidate: [ 3  0  2 -1  1  1  2  0  1  0  0  2  1  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 127650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0 -1  1  0  0 -1  1 -1  1  0  0 -1  0] (Indices: [1, 3, 7, 8, 10, 11, 12, 14, 16, 17, 18]), Candidate: [ 3  0  2 -1  1  1  2  0  0  2  0  1  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 127700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0 -1  1 -1  1 -1  0  1  0  0  0  0 -1] (Indices: [1, 3, 7, 8, 10, 12, 15, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  1  1  2  0  0  2 -1  2  0  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 127750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  1  0  0  0  0  0 -1  1 -1  0  1 -1] (Indices: [1, 3, 7, 9, 10, 11, 12, 13, 14, 16, 19]), Candidate: [ 3  0  2 -1  1  1  2 -1  2  1  0  1  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 127800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  1  0 -1  1  0  0  0  0  0 -1  0  0] (Indices: [1, 3, 7, 9, 10, 12, 13, 14, 15, 16, 17]), Candidate: [ 3  0  2 -1  1  1  2 -1  2  1 -1  2  1  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 127850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  1 -1  1 -1  1  0  0  0  0 -1  1 -1] (Indices: [1, 3, 7, 9, 11, 13, 14, 15, 16, 17, 19]), Candidate: [ 3  0  2 -1  1  1  2 -1  2  0  1  0  2  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 127900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  0  0  1  0  0  0  0  0  0  0 -1  0] (Indices: [1, 3, 7, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 3  0  2 -1  1  1  2 -1  1  1  1  1  1  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 127950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1  0  0  0 -1  1  0 -1  1  0  0 -1  0] (Indices: [1, 3, 8, 9, 10, 11, 13, 14, 16, 17, 18]), Candidate: [ 3  0  2 -1  1  1  1  1  1  1  0  0  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 128000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1  0 -1  1  0  0  0 -1  1  0 -1  1 -1] (Indices: [1, 3, 8, 9, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 3  0  2 -1  1  1  1  1  1  0  1  1  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 128050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1 -1  1  0 -1  1  0  0  0  0  0 -1  0] (Indices: [1, 3, 8, 10, 11, 13, 14, 15, 16, 17, 18]), Candidate: [ 3  0  2 -1  1  1  1  1  0  2  0  0  2  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 128100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  0  1  0  0 -1  1 -1  1  0  0  0  0 -1] (Indices: [1, 3, 9, 10, 11, 13, 15, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  1  1  1  0  2  1  0  0  2  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 128150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0  0  0  0 -1  0  0  1 -1  0  0  1 -1] (Indices: [1, 4, 5, 6, 7, 8, 9, 10, 11, 15, 19]), Candidate: [3 0 1 1 1 1 1 0 1 1 0 0 1 1 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 128200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0  0  0 -1  0  0  1 -1  0  1  0 -1  0] (Indices: [1, 4, 5, 6, 7, 8, 9, 10, 14, 17, 18]), Candidate: [ 3  0  1  1  1  1  1  0  1  1 -1  1  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 128250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0  0 -1  1 -1  0  1  0 -1  1 -1  0  0] (Indices: [1, 4, 5, 6, 7, 8, 9, 11, 14, 15, 17]), Candidate: [3 0 1 1 1 1 1 0 1 0 1 0 1 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 128300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0  0 -1  0  1 -1  0  0  1  0  0 -1  0] (Indices: [1, 4, 5, 6, 7, 8, 9, 12, 16, 17, 18]), Candidate: [3 0 1 1 1 1 1 0 1 0 0 2 0 1 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 128350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0 -1  1  0  0 -1  0  1  0 -1  0  0  0] (Indices: [1, 4, 5, 6, 7, 8, 10, 11, 12, 15, 16]), Candidate: [3 0 1 1 1 1 1 0 0 2 0 1 0 1 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 128400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0 -1  1 -1  1  0 -1  1  0 -1  0  0  0] (Indices: [1, 4, 5, 6, 7, 8, 10, 12, 13, 15, 16]), Candidate: [ 3  0  1  1  1  1  1  0  0  2 -1  2  1  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 128450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0 -1  1 -1  0  0  1  0  0  0 -1  0  0] (Indices: [1, 4, 5, 6, 7, 8, 10, 14, 15, 16, 17]), Candidate: [ 3  0  1  1  1  1  1  0  0  2 -1  1  1  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 128500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0 -1  0  1 -1  1  0  0  0 -1  0  0  0] (Indices: [1, 4, 5, 6, 7, 8, 11, 13, 14, 15, 16]), Candidate: [3 0 1 1 1 1 1 0 0 1 1 0 2 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 128550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0 -1  0  0  1  0 -1  1 -1  0  1  0 -1] (Indices: [1, 4, 5, 6, 7, 8, 12, 13, 15, 18, 19]), Candidate: [3 0 1 1 1 1 1 0 0 1 0 2 1 0 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 128600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  1  0  0  0 -1  1 -1  0  0  1 -1  0] (Indices: [1, 4, 5, 6, 7, 9, 10, 11, 12, 14, 18]), Candidate: [ 3  0  1  1  1  1  1 -1  2  1  0  1  0  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 128650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  1  0 -1  1  0  0 -1  0  0  1 -1  0] (Indices: [1, 4, 5, 6, 7, 9, 10, 12, 13, 14, 18]), Candidate: [ 3  0  1  1  1  1  1 -1  2  1 -1  2  1  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 128700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  1  0 -1  0  1 -1  0  1 -1  1  0 -1] (Indices: [1, 4, 5, 6, 7, 9, 10, 13, 16, 18, 19]), Candidate: [ 3  0  1  1  1  1  1 -1  2  1 -1  1  2  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 128750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  1 -1  1  0 -1  0  0  1 -1  1  0 -1] (Indices: [1, 4, 5, 6, 7, 9, 11, 12, 16, 18, 19]), Candidate: [ 3  0  1  1  1  1  1 -1  2  0  1  1  0  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 128800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  1 -1  0  1  0 -1  1 -1  1  0 -1  0] (Indices: [1, 4, 5, 6, 7, 9, 12, 13, 15, 17, 18]), Candidate: [ 3  0  1  1  1  1  1 -1  2  0  0  2  1  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 128850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  0  1  0  0  0 -1  1 -1  0  1 -1  0] (Indices: [1, 4, 5, 6, 7, 10, 11, 12, 13, 15, 18]), Candidate: [ 3  0  1  1  1  1  1 -1  1  2  0  1  1  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 128900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  0  1  0 -1  0  1  0  0 -1  0  1 -1] (Indices: [1, 4, 5, 6, 7, 10, 11, 14, 15, 16, 19]), Candidate: [ 3  0  1  1  1  1  1 -1  1  2  0  0  1  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 128950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  0  1 -1  0  1  0  0  0 -1  0  1 -1] (Indices: [1, 4, 5, 6, 7, 10, 13, 14, 15, 16, 19]), Candidate: [ 3  0  1  1  1  1  1 -1  1  2 -1  1  2  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 129000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  0  0  1  0 -1  0  1  0  0 -1  1 -1] (Indices: [1, 4, 5, 6, 7, 11, 12, 15, 16, 17, 19]), Candidate: [ 3  0  1  1  1  1  1 -1  1  1  1  1  0  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 129050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  0  0  0  0  1  0 -1  1  0  0  0 -1] (Indices: [1, 4, 5, 6, 7, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  0  1  1  1  1  1 -1  1  1  0  1  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 129100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1  0  0  0 -1  0  0  1  0 -1  1 -1  0] (Indices: [1, 4, 5, 6, 8, 9, 10, 11, 15, 16, 18]), Candidate: [3 0 1 1 1 1 0 1 1 1 0 0 1 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 129150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1  0  0 -1  0  1  0 -1  1 -1  0  1 -1] (Indices: [1, 4, 5, 6, 8, 9, 10, 13, 14, 16, 19]), Candidate: [ 3  0  1  1  1  1  0  1  1  1 -1  1  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 129200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1  0 -1  1  0 -1  1 -1  1 -1  0  1 -1] (Indices: [1, 4, 5, 6, 8, 9, 11, 12, 14, 16, 19]), Candidate: [ 3  0  1  1  1  1  0  1  1  0  1  1  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 129250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1  0 -1  0  1  0  0  0 -1  1 -1  0  0] (Indices: [1, 4, 5, 6, 8, 9, 12, 13, 14, 15, 17]), Candidate: [3 0 1 1 1 1 0 1 1 0 0 2 1 1 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 129300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1  0 -1  0  0  0  1  0  0  0 -1  1 -1] (Indices: [1, 4, 5, 6, 8, 9, 14, 15, 16, 17, 19]), Candidate: [3 0 1 1 1 1 0 1 1 0 0 1 1 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 129350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1 -1  1  0 -1  1 -1  1  0  0 -1  0  0] (Indices: [1, 4, 5, 6, 8, 10, 11, 13, 15, 16, 17]), Candidate: [3 0 1 1 1 1 0 1 0 2 0 0 2 0 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 129400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1 -1  1 -1  1 -1  1  0 -1  0  1  0 -1] (Indices: [1, 4, 5, 6, 8, 10, 12, 14, 15, 18, 19]), Candidate: [ 3  0  1  1  1  1  0  1  0  2 -1  2  0  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 129450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1 -1  0  1  0  0 -1  0  0  1  0  0 -1] (Indices: [1, 4, 5, 6, 8, 11, 12, 13, 17, 18, 19]), Candidate: [3 0 1 1 1 1 0 1 0 1 1 1 1 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 129500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1 -1  0  0  1  0 -1  1 -1  1  0  0 -1] (Indices: [1, 4, 5, 6, 8, 12, 13, 15, 17, 18, 19]), Candidate: [3 0 1 1 1 1 0 1 0 1 0 2 1 0 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 129550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  1  0  0 -1  1  0  0  0 -1  0  0  0] (Indices: [1, 4, 5, 6, 9, 10, 11, 13, 14, 15, 16]), Candidate: [3 0 1 1 1 1 0 0 2 1 0 0 2 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 129600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  1  0 -1  1  0 -1  1 -1  0  1  0 -1] (Indices: [1, 4, 5, 6, 9, 10, 12, 13, 15, 18, 19]), Candidate: [ 3  0  1  1  1  1  0  0  2  1 -1  2  1  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 129650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  1 -1  1  0  0  0 -1  0  0  1  0 -1] (Indices: [1, 4, 5, 6, 9, 11, 12, 13, 14, 18, 19]), Candidate: [ 3  0  1  1  1  1  0  0  2  0  1  1  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 129700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  1 -1  0  1  0  0  0 -1  1  0 -1  0] (Indices: [1, 4, 5, 6, 9, 12, 13, 14, 15, 17, 18]), Candidate: [3 0 1 1 1 1 0 0 2 0 0 2 1 1 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 129750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  0  1  0  0 -1  1  0 -1  0  1  0 -1] (Indices: [1, 4, 5, 6, 10, 11, 12, 14, 15, 18, 19]), Candidate: [3 0 1 1 1 1 0 0 1 2 0 1 0 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 129800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  0  1 -1  1 -1  1 -1  1  0  0  0 -1] (Indices: [1, 4, 5, 6, 10, 12, 14, 16, 17, 18, 19]), Candidate: [ 3  0  1  1  1  1  0  0  1  2 -1  2  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 129850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0  0  0  0  0  0 -1  0  0  0  0  1 -1] (Indices: [1, 4, 5, 7, 8, 9, 10, 11, 12, 13, 19]), Candidate: [3 0 1 1 1 0 2 0 1 1 0 1 1 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 129900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0  0  0  0 -1  0  0  0  0  1  0  0 -1] (Indices: [1, 4, 5, 7, 8, 9, 10, 11, 17, 18, 19]), Candidate: [3 0 1 1 1 0 2 0 1 1 0 0 1 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 129950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0  0  0 -1  0  1 -1  1 -1  1 -1  1 -1] (Indices: [1, 4, 5, 7, 8, 9, 10, 13, 15, 17, 19]), Candidate: [ 3  0  1  1  1  0  2  0  1  1 -1  1  2  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 130000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0  0 -1  1  0 -1  0  1 -1  1 -1  1 -1] (Indices: [1, 4, 5, 7, 8, 9, 11, 12, 15, 17, 19]), Candidate: [3 0 1 1 1 0 2 0 1 0 1 1 0 1 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 130050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0  0 -1  0  1  0  0 -1  0  0  1  0 -1] (Indices: [1, 4, 5, 7, 8, 9, 12, 13, 14, 18, 19]), Candidate: [ 3  0  1  1  1  0  2  0  1  0  0  2  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 130100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0 -1  1  0  0  0  0 -1  0  0  1 -1  0] (Indices: [1, 4, 5, 7, 8, 10, 11, 12, 13, 14, 18]), Candidate: [ 3  0  1  1  1  0  2  0  0  2  0  1  1  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 130150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0 -1  1  0 -1  1 -1  0  1 -1  1  0 -1] (Indices: [1, 4, 5, 7, 8, 10, 11, 13, 16, 18, 19]), Candidate: [3 0 1 1 1 0 2 0 0 2 0 0 2 0 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 130200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0 -1  1 -1  1 -1  0  1 -1  1  0  0 -1] (Indices: [1, 4, 5, 7, 8, 10, 12, 15, 17, 18, 19]), Candidate: [ 3  0  1  1  1  0  2  0  0  2 -1  2  0  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 130250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0 -1  0  1  0 -1  1 -1  1  0 -1  1 -1] (Indices: [1, 4, 5, 7, 8, 11, 12, 14, 16, 17, 19]), Candidate: [ 3  0  1  1  1  0  2  0  0  1  1  1  0  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 130300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0 -1  0  0  0  1  0  0  0  0  0 -1  0] (Indices: [1, 4, 5, 7, 8, 13, 14, 15, 16, 17, 18]), Candidate: [3 0 1 1 1 0 2 0 0 1 0 1 2 1 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 130350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  1  0  0 -1  1  0 -1  0  1 -1  1 -1] (Indices: [1, 4, 5, 7, 9, 10, 11, 13, 14, 17, 19]), Candidate: [ 3  0  1  1  1  0  2 -1  2  1  0  0  2  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 130400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  1  0 -1  1 -1  1  0 -1  1  0 -1  0] (Indices: [1, 4, 5, 7, 9, 10, 12, 14, 15, 17, 18]), Candidate: [ 3  0  1  1  1  0  2 -1  2  1 -1  2  0  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 130450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  1 -1  1  0  0 -1  0  1  0 -1  1 -1] (Indices: [1, 4, 5, 7, 9, 11, 12, 13, 16, 17, 19]), Candidate: [ 3  0  1  1  1  0  2 -1  2  0  1  1  1  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 130500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  1 -1  0  1  0 -1  1  0  0 -1  1 -1] (Indices: [1, 4, 5, 7, 9, 12, 13, 15, 16, 17, 19]), Candidate: [ 3  0  1  1  1  0  2 -1  2  0  0  2  1  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 130550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  0  1  0  0 -1  0  1 -1  1  0  0 -1] (Indices: [1, 4, 5, 7, 10, 11, 12, 15, 17, 18, 19]), Candidate: [ 3  0  1  1  1  0  2 -1  1  2  0  1  0  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 130600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  0  1 -1  0  0  1  0  0  0  0  0 -1] (Indices: [1, 4, 5, 7, 10, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  0  1  1  1  0  2 -1  1  2 -1  1  1  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 130650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1  0  0  0  0  0 -1  0  0  1 -1  1 -1] (Indices: [1, 4, 5, 8, 9, 10, 11, 12, 13, 17, 19]), Candidate: [3 0 1 1 1 0 1 1 1 1 0 1 1 0 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 130700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1  0  0  0 -1  0  1 -1  1 -1  1  0 -1] (Indices: [1, 4, 5, 8, 9, 10, 11, 14, 16, 18, 19]), Candidate: [ 3  0  1  1  1  0  1  1  1  1  0  0  1  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 130750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1  0  0 -1  0  1  0 -1  1 -1  1  0 -1] (Indices: [1, 4, 5, 8, 9, 10, 13, 14, 16, 18, 19]), Candidate: [ 3  0  1  1  1  0  1  1  1  1 -1  1  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 130800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1  0 -1  1 -1  1  0  0  0 -1  0  1 -1] (Indices: [1, 4, 5, 8, 9, 11, 13, 14, 15, 16, 19]), Candidate: [3 0 1 1 1 0 1 1 1 0 1 0 2 1 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 130850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1 -1  1  0  0  0  0  0 -1  0  0  1 -1] (Indices: [1, 4, 5, 8, 10, 11, 12, 13, 14, 15, 19]), Candidate: [3 0 1 1 1 0 1 1 0 2 0 1 1 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 130900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1 -1  1  0 -1  0  1  0 -1  1  0  0 -1] (Indices: [1, 4, 5, 8, 10, 11, 14, 15, 17, 18, 19]), Candidate: [3 0 1 1 1 0 1 1 0 2 0 0 1 2 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 130950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1 -1  0  1  0 -1  1 -1  1  0  0  0 -1] (Indices: [1, 4, 5, 8, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 3  0  1  1  1  0  1  1  0  1  1  1  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 131000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  1  0  0  0 -1  0  1 -1  1  0  0 -1] (Indices: [1, 4, 5, 9, 10, 11, 12, 15, 17, 18, 19]), Candidate: [3 0 1 1 1 0 1 0 2 1 0 1 0 1 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 131050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  1  0 -1  0  0  1  0  0  0  0  0 -1] (Indices: [1, 4, 5, 9, 10, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  0  1  1  1  0  1  0  2  1 -1  1  1  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 131100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  0  1  0  0  0 -1  1 -1  1  0  0 -1] (Indices: [1, 4, 5, 10, 11, 12, 13, 15, 17, 18, 19]), Candidate: [3 0 1 1 1 0 1 0 1 2 0 1 1 0 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 131150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0  0  0  0  0 -1  0  0  0  1  0 -1  0] (Indices: [1, 4, 6, 7, 8, 9, 10, 11, 12, 17, 18]), Candidate: [3 0 1 1 0 2 1 0 1 1 0 1 0 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 131200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0  0  0 -1  1  0 -1  0  0  1  0 -1  0] (Indices: [1, 4, 6, 7, 8, 9, 10, 12, 13, 17, 18]), Candidate: [ 3  0  1  1  0  2  1  0  1  1 -1  2  1  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 131250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0  0  0 -1  0  0  1 -1  1  0 -1  1 -1] (Indices: [1, 4, 6, 7, 8, 9, 10, 14, 16, 17, 19]), Candidate: [ 3  0  1  1  0  2  1  0  1  1 -1  1  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 131300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0  0 -1  1 -1  1  0 -1  0  1  0 -1  0] (Indices: [1, 4, 6, 7, 8, 9, 11, 13, 14, 17, 18]), Candidate: [ 3  0  1  1  0  2  1  0  1  0  1  0  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 131350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0  0 -1  0  1 -1  1  0  0 -1  0  1 -1] (Indices: [1, 4, 6, 7, 8, 9, 12, 14, 15, 16, 19]), Candidate: [3 0 1 1 0 2 1 0 1 0 0 2 0 2 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 131400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0 -1  1  0  0 -1  1  0 -1  1 -1  0  0] (Indices: [1, 4, 6, 7, 8, 10, 11, 12, 14, 15, 17]), Candidate: [3 0 1 1 0 2 1 0 0 2 0 1 0 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 131450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0 -1  1  0 -1  0  0  1  0  0 -1  1 -1] (Indices: [1, 4, 6, 7, 8, 10, 11, 15, 16, 17, 19]), Candidate: [3 0 1 1 0 2 1 0 0 2 0 0 1 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 131500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0 -1  1 -1  0  1 -1  1  0  0 -1  1 -1] (Indices: [1, 4, 6, 7, 8, 10, 13, 15, 16, 17, 19]), Candidate: [ 3  0  1  1  0  2  1  0  0  2 -1  1  2  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 131550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0 -1  0  1 -1  1  0  0 -1  0  1  0 -1] (Indices: [1, 4, 6, 7, 8, 11, 13, 14, 15, 18, 19]), Candidate: [3 0 1 1 0 2 1 0 0 1 1 0 2 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 131600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  1  0  0  0  0 -1  1 -1  1 -1  0  0] (Indices: [1, 4, 6, 7, 9, 10, 11, 12, 13, 15, 17]), Candidate: [ 3  0  1  1  0  2  1 -1  2  1  0  1  1  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 131650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  1  0  0 -1  0  1  0  0 -1  1 -1  0] (Indices: [1, 4, 6, 7, 9, 10, 11, 14, 15, 16, 18]), Candidate: [ 3  0  1  1  0  2  1 -1  2  1  0  0  1  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 131700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  1  0 -1  0  1  0  0  0 -1  1 -1  0] (Indices: [1, 4, 6, 7, 9, 10, 13, 14, 15, 16, 18]), Candidate: [ 3  0  1  1  0  2  1 -1  2  1 -1  1  2  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 131750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  1 -1  1  0 -1  0  1  0  0  0 -1  0] (Indices: [1, 4, 6, 7, 9, 11, 12, 15, 16, 17, 18]), Candidate: [ 3  0  1  1  0  2  1 -1  2  0  1  1  0  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 131800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  1 -1  0  0  1  0  0 -1  1  0  0 -1] (Indices: [1, 4, 6, 7, 9, 13, 14, 15, 17, 18, 19]), Candidate: [ 3  0  1  1  0  2  1 -1  2  0  0  1  2  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 131850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  0  1  0 -1  1 -1  1  0  0 -1  1 -1] (Indices: [1, 4, 6, 7, 10, 11, 13, 15, 16, 17, 19]), Candidate: [ 3  0  1  1  0  2  1 -1  1  2  0  0  2  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 131900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  0  0  1  0  0 -1  1  0 -1  1  0 -1] (Indices: [1, 4, 6, 7, 11, 12, 13, 15, 16, 18, 19]), Candidate: [ 3  0  1  1  0  2  1 -1  1  1  1  1  1  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 131950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1  0  0  0  0 -1  0  1  0 -1  1 -1  0] (Indices: [1, 4, 6, 8, 9, 10, 11, 12, 15, 16, 18]), Candidate: [3 0 1 1 0 2 0 1 1 1 0 1 0 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 132000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1  0  0 -1  1  0  0 -1  1 -1  0  1 -1] (Indices: [1, 4, 6, 8, 9, 10, 12, 13, 14, 16, 19]), Candidate: [ 3  0  1  1  0  2  0  1  1  1 -1  2  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 132050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1  0 -1  1  0  0  0  0  0 -1  0  0  0] (Indices: [1, 4, 6, 8, 9, 11, 12, 13, 14, 15, 16]), Candidate: [3 0 1 1 0 2 0 1 1 0 1 1 1 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 132100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1  0 -1  1 -1  0  1  0  0  0  0 -1  0] (Indices: [1, 4, 6, 8, 9, 11, 14, 15, 16, 17, 18]), Candidate: [3 0 1 1 0 2 0 1 1 0 1 0 1 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 132150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1 -1  1  0  0  0 -1  0  1  0  0 -1  0] (Indices: [1, 4, 6, 8, 10, 11, 12, 13, 16, 17, 18]), Candidate: [3 0 1 1 0 2 0 1 0 2 0 1 1 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 132200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1 -1  1 -1  1  0 -1  1  0  0  0 -1  0] (Indices: [1, 4, 6, 8, 10, 12, 13, 15, 16, 17, 18]), Candidate: [ 3  0  1  1  0  2  0  1  0  2 -1  2  1  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 132250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1 -1  0  0  1  0  0 -1  1  0  0  0 -1] (Indices: [1, 4, 6, 8, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  0  1  1  0  2  0  1  0  1  0  2  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 132300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  1  0  0 -1  1 -1  1  0  0 -1  1 -1] (Indices: [1, 4, 6, 9, 10, 11, 13, 15, 16, 17, 19]), Candidate: [3 0 1 1 0 2 0 0 2 1 0 0 2 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 132350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  1 -1  1  0  0 -1  1  0 -1  1  0 -1] (Indices: [1, 4, 6, 9, 11, 12, 13, 15, 16, 18, 19]), Candidate: [3 0 1 1 0 2 0 0 2 0 1 1 1 0 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 132400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  0  1  0 -1  1 -1  1  0  0  0  0 -1] (Indices: [1, 4, 6, 10, 11, 13, 15, 16, 17, 18, 19]), Candidate: [3 0 1 1 0 2 0 0 1 2 0 0 2 0 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 132450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0  0  0  0  0 -1  0  0  1  0  0 -1  0] (Indices: [1, 4, 7, 8, 9, 10, 11, 12, 16, 17, 18]), Candidate: [3 0 1 1 0 1 2 0 1 1 0 1 0 1 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 132500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0  0  0 -1  1  0 -1  1  0 -1  1 -1  0] (Indices: [1, 4, 7, 8, 9, 10, 12, 13, 15, 16, 18]), Candidate: [ 3  0  1  1  0  1  2  0  1  1 -1  2  1  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 132550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0  0 -1  1  0  0  0 -1  1 -1  1 -1  0] (Indices: [1, 4, 7, 8, 9, 11, 12, 13, 14, 16, 18]), Candidate: [ 3  0  1  1  0  1  2  0  1  0  1  1  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 132600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0  0 -1  1 -1  0  0  1  0  0  0  0 -1] (Indices: [1, 4, 7, 8, 9, 11, 15, 16, 17, 18, 19]), Candidate: [3 0 1 1 0 1 2 0 1 0 1 0 1 1 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 132650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0 -1  1  0  0 -1  1  0  0 -1  1 -1  0] (Indices: [1, 4, 7, 8, 10, 11, 12, 14, 15, 16, 18]), Candidate: [3 0 1 1 0 1 2 0 0 2 0 1 0 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 132700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0 -1  1 -1  1 -1  1  0  0  0  0 -1  0] (Indices: [1, 4, 7, 8, 10, 12, 14, 15, 16, 17, 18]), Candidate: [ 3  0  1  1  0  1  2  0  0  2 -1  2  0  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 132750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  1  0  0  0  0  0  0 -1  1 -1  0  0] (Indices: [1, 4, 7, 9, 10, 11, 12, 13, 14, 15, 17]), Candidate: [ 3  0  1  1  0  1  2 -1  2  1  0  1  1  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 132800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  1  0  0 -1  0  1  0  0  0 -1  1 -1] (Indices: [1, 4, 7, 9, 10, 11, 14, 15, 16, 17, 19]), Candidate: [ 3  0  1  1  0  1  2 -1  2  1  0  0  1  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 132850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  1 -1  1  0 -1  1  0  0 -1  1  0 -1] (Indices: [1, 4, 7, 9, 11, 12, 14, 15, 16, 18, 19]), Candidate: [ 3  0  1  1  0  1  2 -1  2  0  1  1  0  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 132900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  0  1 -1  1  0  0  0 -1  1  0  0 -1] (Indices: [1, 4, 7, 10, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 3  0  1  1  0  1  2 -1  1  2 -1  2  1  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 132950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1  0  0  0 -1  1  0  0  0 -1  1 -1  0] (Indices: [1, 4, 8, 9, 10, 11, 13, 14, 15, 16, 18]), Candidate: [3 0 1 1 0 1 1 1 1 1 0 0 2 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 133000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1  0 -1  1  0  0  0  0  0 -1  0  1 -1] (Indices: [1, 4, 8, 9, 11, 12, 13, 14, 15, 16, 19]), Candidate: [3 0 1 1 0 1 1 1 1 0 1 1 1 1 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 133050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1 -1  1  0  0 -1  1  0  0  0 -1  1 -1] (Indices: [1, 4, 8, 10, 11, 12, 14, 15, 16, 17, 19]), Candidate: [3 0 1 1 0 1 1 1 0 2 0 1 0 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 133100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  0  1  0  0 -1  1  0  0  0  0  0 -1  0] (Indices: [1, 4, 9, 10, 11, 13, 14, 15, 16, 17, 18]), Candidate: [3 0 1 1 0 1 1 0 2 1 0 0 2 1 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 133150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0  0  0  0  0 -1  0  0  1 -1  1 -1  0] (Indices: [1, 5, 6, 7, 8, 9, 10, 11, 12, 16, 18]), Candidate: [3 0 1 0 2 1 1 0 1 1 0 1 0 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 133200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0  0  0 -1  1  0 -1  0  1 -1  1 -1  0] (Indices: [1, 5, 6, 7, 8, 9, 10, 12, 13, 16, 18]), Candidate: [ 3  0  1  0  2  1  1  0  1  1 -1  2  1  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 133250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0  0  0 -1  0  0  1  0 -1  0  1  0 -1] (Indices: [1, 5, 6, 7, 8, 9, 10, 14, 15, 18, 19]), Candidate: [ 3  0  1  0  2  1  1  0  1  1 -1  1  1  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 133300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0  0 -1  1 -1  1  0 -1  1 -1  1 -1  0] (Indices: [1, 5, 6, 7, 8, 9, 11, 13, 14, 16, 18]), Candidate: [ 3  0  1  0  2  1  1  0  1  0  1  0  2  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 133350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0  0 -1  0  1 -1  1  0  0  0 -1  0  0] (Indices: [1, 5, 6, 7, 8, 9, 12, 14, 15, 16, 17]), Candidate: [3 0 1 0 2 1 1 0 1 0 0 2 0 2 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 133400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0 -1  1  0  0  0 -1  0  0  0  1  0 -1] (Indices: [1, 5, 6, 7, 8, 10, 11, 12, 13, 18, 19]), Candidate: [3 0 1 0 2 1 1 0 0 2 0 1 1 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 133450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0 -1  1  0 -1  0  1 -1  0  1  0  0 -1] (Indices: [1, 5, 6, 7, 8, 10, 11, 14, 17, 18, 19]), Candidate: [ 3  0  1  0  2  1  1  0  0  2  0  0  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 133500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0 -1  1 -1  0  1  0 -1  0  1  0  0 -1] (Indices: [1, 5, 6, 7, 8, 10, 13, 14, 17, 18, 19]), Candidate: [ 3  0  1  0  2  1  1  0  0  2 -1  1  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 133550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0 -1  0  1 -1  1  0  0 -1  1  0 -1  0] (Indices: [1, 5, 6, 7, 8, 11, 13, 14, 15, 17, 18]), Candidate: [3 0 1 0 2 1 1 0 0 1 1 0 2 1 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 133600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  1  0  0  0  0  0 -1  0  0  0  1 -1] (Indices: [1, 5, 6, 7, 9, 10, 11, 12, 13, 14, 19]), Candidate: [ 3  0  1  0  2  1  1 -1  2  1  0  1  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 133650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  1  0  0 -1  1 -1  0  0  1  0  0 -1] (Indices: [1, 5, 6, 7, 9, 10, 11, 13, 17, 18, 19]), Candidate: [ 3  0  1  0  2  1  1 -1  2  1  0  0  2  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 133700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  1  0 -1  1 -1  0  0  1  0  0  0 -1] (Indices: [1, 5, 6, 7, 9, 10, 12, 16, 17, 18, 19]), Candidate: [ 3  0  1  0  2  1  1 -1  2  1 -1  2  0  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 133750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  1 -1  1  0 -1  1 -1  1 -1  1  0 -1] (Indices: [1, 5, 6, 7, 9, 11, 12, 14, 16, 18, 19]), Candidate: [ 3  0  1  0  2  1  1 -1  2  0  1  1  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 133800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  1 -1  0  0  1  0  0  0  0 -1  1 -1] (Indices: [1, 5, 6, 7, 9, 13, 14, 15, 16, 17, 19]), Candidate: [ 3  0  1  0  2  1  1 -1  2  0  0  1  2  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 133850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  0  1  0 -1  1  0 -1  0  1  0  0 -1] (Indices: [1, 5, 6, 7, 10, 11, 13, 14, 17, 18, 19]), Candidate: [ 3  0  1  0  2  1  1 -1  1  2  0  0  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 133900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  0  0  1  0  0 -1  1  0  0  0 -1  0] (Indices: [1, 5, 6, 7, 11, 12, 13, 15, 16, 17, 18]), Candidate: [ 3  0  1  0  2  1  1 -1  1  1  1  1  1  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 133950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1  0  0  0  0 -1  1 -1  0  0  1  0 -1] (Indices: [1, 5, 6, 8, 9, 10, 11, 12, 14, 18, 19]), Candidate: [ 3  0  1  0  2  1  0  1  1  1  0  1  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 134000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1  0  0 -1  1  0  0 -1  1  0 -1  0  0] (Indices: [1, 5, 6, 8, 9, 10, 12, 13, 14, 16, 17]), Candidate: [ 3  0  1  0  2  1  0  1  1  1 -1  2  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 134050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1  0  0 -1  0  0  1 -1  1  0  0  0 -1] (Indices: [1, 5, 6, 8, 9, 10, 14, 16, 17, 18, 19]), Candidate: [ 3  0  1  0  2  1  0  1  1  1 -1  1  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 134100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1  0 -1  1 -1  1 -1  1 -1  1  0  0 -1] (Indices: [1, 5, 6, 8, 9, 11, 13, 15, 17, 18, 19]), Candidate: [3 0 1 0 2 1 0 1 1 0 1 0 2 0 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 134150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1 -1  1  0  0  0 -1  1 -1  1 -1  1 -1] (Indices: [1, 5, 6, 8, 10, 11, 12, 13, 15, 17, 19]), Candidate: [3 0 1 0 2 1 0 1 0 2 0 1 1 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 134200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1 -1  1 -1  1  0  0 -1  1 -1  1  0 -1] (Indices: [1, 5, 6, 8, 10, 12, 13, 14, 16, 18, 19]), Candidate: [ 3  0  1  0  2  1  0  1  0  2 -1  2  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 134250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1 -1  0  0  1  0  0  0  0 -1  1  0 -1] (Indices: [1, 5, 6, 8, 12, 13, 14, 15, 16, 18, 19]), Candidate: [3 0 1 0 2 1 0 1 0 1 0 2 1 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 134300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  1  0  0 -1  1  0 -1  0  1  0  0 -1] (Indices: [1, 5, 6, 9, 10, 11, 13, 14, 17, 18, 19]), Candidate: [ 3  0  1  0  2  1  0  0  2  1  0  0  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 134350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  1 -1  1  0  0 -1  1  0  0  0 -1  0] (Indices: [1, 5, 6, 9, 11, 12, 13, 15, 16, 17, 18]), Candidate: [3 0 1 0 2 1 0 0 2 0 1 1 1 0 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 134400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  0  1  0 -1  1  0  0 -1  1  0  0 -1] (Indices: [1, 5, 6, 10, 11, 13, 14, 15, 17, 18, 19]), Candidate: [3 0 1 0 2 1 0 0 1 2 0 0 2 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 134450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0  0  0  0  0 -1  0  1 -1  1 -1  1 -1] (Indices: [1, 5, 7, 8, 9, 10, 11, 12, 15, 17, 19]), Candidate: [3 0 1 0 2 0 2 0 1 1 0 1 0 1 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 134500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0  0  0 -1  1  0  0 -1  0  0  1  0 -1] (Indices: [1, 5, 7, 8, 9, 10, 12, 13, 14, 18, 19]), Candidate: [ 3  0  1  0  2  0  2  0  1  1 -1  2  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 134550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0  0 -1  1  0  0  0  0 -1  0  0  1 -1] (Indices: [1, 5, 7, 8, 9, 11, 12, 13, 14, 15, 19]), Candidate: [3 0 1 0 2 0 2 0 1 0 1 1 1 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 134600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0  0 -1  1 -1  0  1  0 -1  1  0  0 -1] (Indices: [1, 5, 7, 8, 9, 11, 14, 15, 17, 18, 19]), Candidate: [3 0 1 0 2 0 2 0 1 0 1 0 1 2 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 134650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0 -1  1  0  0  0 -1  0  0  1  0  0 -1] (Indices: [1, 5, 7, 8, 10, 11, 12, 13, 17, 18, 19]), Candidate: [3 0 1 0 2 0 2 0 0 2 0 1 1 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 134700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0 -1  1 -1  1  0 -1  1 -1  1  0  0 -1] (Indices: [1, 5, 7, 8, 10, 12, 13, 15, 17, 18, 19]), Candidate: [ 3  0  1  0  2  0  2  0  0  2 -1  2  1  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 134750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0 -1  0  0  0  1  0  0  0  0  0  0 -1] (Indices: [1, 5, 7, 8, 13, 14, 15, 16, 17, 18, 19]), Candidate: [3 0 1 0 2 0 2 0 0 1 0 1 2 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 134800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  1  0  0 -1  1 -1  0  1  0  0  0 -1] (Indices: [1, 5, 7, 9, 10, 11, 13, 16, 17, 18, 19]), Candidate: [ 3  0  1  0  2  0  2 -1  2  1  0  0  2  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 134850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  1 -1  1  0 -1  1  0  0  0  0 -1  0] (Indices: [1, 5, 7, 9, 11, 12, 14, 15, 16, 17, 18]), Candidate: [ 3  0  1  0  2  0  2 -1  2  0  1  1  0  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 134900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  0  1 -1  1  0  0  0  0  0 -1  1 -1] (Indices: [1, 5, 7, 10, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 3  0  1  0  2  0  2 -1  1  2 -1  2  1  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 134950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1  0  0  0  0 -1  0  0  1  0  0  0 -1] (Indices: [1, 5, 8, 9, 10, 11, 12, 16, 17, 18, 19]), Candidate: [3 0 1 0 2 0 1 1 1 1 0 1 0 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 135000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1  0 -1  1  0  0  0  0  0  0 -1  0  0] (Indices: [1, 5, 8, 9, 11, 12, 13, 14, 15, 16, 17]), Candidate: [3 0 1 0 2 0 1 1 1 0 1 1 1 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 135050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1 -1  1  0  0  0 -1  0  1  0  0  0 -1] (Indices: [1, 5, 8, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [3 0 1 0 2 0 1 1 0 2 0 1 1 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 135100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  0  1  0  0  0 -1  1 -1  1  0  0  0 -1] (Indices: [1, 5, 9, 10, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 3  0  1  0  2  0  1  0  2  1  0  1  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 135150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0  0  0  0  0  0 -1  0  0  0  1  0 -1] (Indices: [1, 6, 7, 8, 9, 10, 11, 12, 13, 18, 19]), Candidate: [3 0 1 0 1 2 1 0 1 1 0 1 1 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 135200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0  0  0  0 -1  0  1 -1  0  1  0  0 -1] (Indices: [1, 6, 7, 8, 9, 10, 11, 14, 17, 18, 19]), Candidate: [ 3  0  1  0  1  2  1  0  1  1  0  0  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 135250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0  0  0 -1  0  1  0 -1  0  1  0  0 -1] (Indices: [1, 6, 7, 8, 9, 10, 13, 14, 17, 18, 19]), Candidate: [ 3  0  1  0  1  2  1  0  1  1 -1  1  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 135300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0  0 -1  1 -1  1  0  0 -1  1  0 -1  0] (Indices: [1, 6, 7, 8, 9, 11, 13, 14, 15, 17, 18]), Candidate: [3 0 1 0 1 2 1 0 1 0 1 0 2 1 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 135350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0 -1  1  0  0  0  0 -1  1  0 -1  0  0] (Indices: [1, 6, 7, 8, 10, 11, 12, 13, 14, 16, 17]), Candidate: [ 3  0  1  0  1  2  1  0  0  2  0  1  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 135400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0 -1  1  0 -1  0  1 -1  1  0  0  0 -1] (Indices: [1, 6, 7, 8, 10, 11, 14, 16, 17, 18, 19]), Candidate: [ 3  0  1  0  1  2  1  0  0  2  0  0  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 135450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0 -1  0  1  0 -1  0  1  0  0  0  0 -1] (Indices: [1, 6, 7, 8, 11, 12, 15, 16, 17, 18, 19]), Candidate: [3 0 1 0 1 2 1 0 0 1 1 1 0 1 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 135500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  1  0  0  0 -1  0  0  1  0  0  0 -1] (Indices: [1, 6, 7, 9, 10, 11, 12, 16, 17, 18, 19]), Candidate: [ 3  0  1  0  1  2  1 -1  2  1  0  1  0  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 135550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  1 -1  1  0  0  0  0  0  0 -1  0  0] (Indices: [1, 6, 7, 9, 11, 12, 13, 14, 15, 16, 17]), Candidate: [ 3  0  1  0  1  2  1 -1  2  0  1  1  1  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 135600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  0  1  0  0  0 -1  0  1  0  0  0 -1] (Indices: [1, 6, 7, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [ 3  0  1  0  1  2  1 -1  1  2  0  1  1  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 135650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1  0  0  0  0  0 -1  0  0  1  0  0 -1] (Indices: [1, 6, 8, 9, 10, 11, 12, 13, 17, 18, 19]), Candidate: [3 0 1 0 1 2 0 1 1 1 0 1 1 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 135700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1  0  0 -1  1  0 -1  1 -1  1  0  0 -1] (Indices: [1, 6, 8, 9, 10, 12, 13, 15, 17, 18, 19]), Candidate: [ 3  0  1  0  1  2  0  1  1  1 -1  2  1  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 135750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1  0 -1  0  0  1  0  0  0  0  0  0 -1] (Indices: [1, 6, 8, 9, 13, 14, 15, 16, 17, 18, 19]), Candidate: [3 0 1 0 1 2 0 1 1 0 0 1 2 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 135800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  1  0  0  0  0  0  0 -1  1 -1  1 -1] (Indices: [1, 6, 9, 10, 11, 12, 13, 14, 15, 17, 19]), Candidate: [3 0 1 0 1 2 0 0 2 1 0 1 1 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 135850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  0  0  0  1  0  0  0  0  0  0  0  0 -1] (Indices: [1, 6, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [3 0 1 0 1 2 0 0 1 1 1 1 1 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 135900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0  0  0  0 -1  1 -1  0  1  0  0  0 -1] (Indices: [1, 7, 8, 9, 10, 11, 13, 16, 17, 18, 19]), Candidate: [3 0 1 0 1 1 2 0 1 1 0 0 2 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 135950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0  0 -1  1  0 -1  1  0  0  0  0 -1  0] (Indices: [1, 7, 8, 9, 11, 12, 14, 15, 16, 17, 18]), Candidate: [3 0 1 0 1 1 2 0 1 0 1 1 0 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 136000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0 -1  1 -1  1  0  0  0  0  0 -1  1 -1] (Indices: [1, 7, 8, 10, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 3  0  1  0  1  1  2  0  0  2 -1  2  1  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 136050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1 -1  1  0 -1  1 -1  1  0  0  0  0  0 -1] (Indices: [1, 7, 9, 10, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  0  1  0  1  1  2 -1  2  1 -1  2  0  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 136100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1  0  0 -1  1  0  0  0  0  0 -1  1 -1] (Indices: [1, 8, 9, 10, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 3  0  1  0  1  1  1  1  1  1 -1  2  1  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 136150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0  0  0 -1  1 -1  0  0  0  0  1 -1  0] (Indices: [2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 18]), Candidate: [ 2  2  1  0  1  1  1  0  1  1 -1  2  0  1  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 136200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0  0 -1  1 -1  0  0  0  0  0  1  0 -1] (Indices: [2, 3, 4, 5, 6, 7, 8, 9, 11, 18, 19]), Candidate: [2 2 1 0 1 1 1 0 1 0 1 0 1 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 136250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0  0 -1  0  0  0  0  1 -1  1  0 -1  0] (Indices: [2, 3, 4, 5, 6, 7, 8, 9, 15, 17, 18]), Candidate: [2 2 1 0 1 1 1 0 1 0 0 1 1 1 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 136300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0 -1  1 -1  1 -1  0  0  1  0 -1  0  0] (Indices: [2, 3, 4, 5, 6, 7, 8, 10, 12, 16, 17]), Candidate: [ 2  2  1  0  1  1  1  0  0  2 -1  2  0  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 136350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0 -1  0  1  0 -1  1 -1  0  0  1 -1  0] (Indices: [2, 3, 4, 5, 6, 7, 8, 11, 12, 14, 18]), Candidate: [ 2  2  1  0  1  1  1  0  0  1  1  1  0  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 136400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0 -1  0  0  1  0  0 -1  0  0  1 -1  0] (Indices: [2, 3, 4, 5, 6, 7, 8, 12, 13, 14, 18]), Candidate: [ 2  2  1  0  1  1  1  0  0  1  0  2  1  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 136450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0 -1  0  0  0  1 -1  0  1 -1  1  0 -1] (Indices: [2, 3, 4, 5, 6, 7, 8, 13, 16, 18, 19]), Candidate: [2 2 1 0 1 1 1 0 0 1 0 1 2 0 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 136500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  1  0 -1  1  0 -1  0  0  0  0  1 -1] (Indices: [2, 3, 4, 5, 6, 7, 9, 10, 12, 13, 19]), Candidate: [ 2  2  1  0  1  1  1 -1  2  1 -1  2  1  0  0  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 136550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  1  0 -1  0  0  0  0  0  1  0  0 -1] (Indices: [2, 3, 4, 5, 6, 7, 9, 10, 17, 18, 19]), Candidate: [ 2  2  1  0  1  1  1 -1  2  1 -1  1  1  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 136600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  1 -1  1 -1  0  0  1 -1  1  0 -1  0] (Indices: [2, 3, 4, 5, 6, 7, 9, 11, 15, 17, 18]), Candidate: [ 2  2  1  0  1  1  1 -1  2  0  1  0  1  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 136650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  1 -1  0  0  1  0 -1  0  1 -1  1 -1] (Indices: [2, 3, 4, 5, 6, 7, 9, 13, 14, 17, 19]), Candidate: [ 2  2  1  0  1  1  1 -1  2  0  0  1  2  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 136700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  0  1  0 -1  1  0 -1  0  1 -1  0  0] (Indices: [2, 3, 4, 5, 6, 7, 10, 11, 13, 14, 17]), Candidate: [ 2  2  1  0  1  1  1 -1  1  2  0  0  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 136750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  0  1 -1  1 -1  1  0 -1  0  1 -1  0] (Indices: [2, 3, 4, 5, 6, 7, 10, 12, 14, 15, 18]), Candidate: [ 2  2  1  0  1  1  1 -1  1  2 -1  2  0  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 136800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  0  1 -1  0  0  0  1  0 -1  1  0 -1] (Indices: [2, 3, 4, 5, 6, 7, 10, 15, 16, 18, 19]), Candidate: [ 2  2  1  0  1  1  1 -1  1  2 -1  1  1  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 136850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  0  0  1 -1  1 -1  1  0 -1  0  1 -1] (Indices: [2, 3, 4, 5, 6, 7, 11, 13, 15, 16, 19]), Candidate: [ 2  2  1  0  1  1  1 -1  1  1  1  0  2  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 136900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  0  0  0  1 -1  1 -1  1  0 -1  1 -1] (Indices: [2, 3, 4, 5, 6, 7, 12, 14, 16, 17, 19]), Candidate: [ 2  2  1  0  1  1  1 -1  1  1  0  2  0  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 136950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1  0  0  0 -1  0  0  1 -1  0  0  1 -1] (Indices: [2, 3, 4, 5, 6, 8, 9, 10, 11, 15, 19]), Candidate: [2 2 1 0 1 1 0 1 1 1 0 0 1 1 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 137000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1  0  0 -1  0  0  1 -1  0  1  0 -1  0] (Indices: [2, 3, 4, 5, 6, 8, 9, 10, 14, 17, 18]), Candidate: [ 2  2  1  0  1  1  0  1  1  1 -1  1  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 137050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1  0 -1  1 -1  0  1  0 -1  1 -1  0  0] (Indices: [2, 3, 4, 5, 6, 8, 9, 11, 14, 15, 17]), Candidate: [2 2 1 0 1 1 0 1 1 0 1 0 1 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 137100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1  0 -1  0  1 -1  0  0  1  0  0 -1  0] (Indices: [2, 3, 4, 5, 6, 8, 9, 12, 16, 17, 18]), Candidate: [2 2 1 0 1 1 0 1 1 0 0 2 0 1 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 137150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1 -1  1  0  0 -1  0  1  0 -1  0  0  0] (Indices: [2, 3, 4, 5, 6, 8, 10, 11, 12, 15, 16]), Candidate: [2 2 1 0 1 1 0 1 0 2 0 1 0 1 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 137200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1 -1  1 -1  1  0 -1  1  0 -1  0  0  0] (Indices: [2, 3, 4, 5, 6, 8, 10, 12, 13, 15, 16]), Candidate: [ 2  2  1  0  1  1  0  1  0  2 -1  2  1  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 137250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1 -1  1 -1  0  0  1  0  0  0 -1  0  0] (Indices: [2, 3, 4, 5, 6, 8, 10, 14, 15, 16, 17]), Candidate: [ 2  2  1  0  1  1  0  1  0  2 -1  1  1  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 137300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1 -1  0  1 -1  1  0  0  0 -1  0  0  0] (Indices: [2, 3, 4, 5, 6, 8, 11, 13, 14, 15, 16]), Candidate: [2 2 1 0 1 1 0 1 0 1 1 0 2 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 137350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1 -1  0  0  1  0 -1  1 -1  0  1  0 -1] (Indices: [2, 3, 4, 5, 6, 8, 12, 13, 15, 18, 19]), Candidate: [2 2 1 0 1 1 0 1 0 1 0 2 1 0 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 137400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  1  0  0  0 -1  1 -1  0  0  1 -1  0] (Indices: [2, 3, 4, 5, 6, 9, 10, 11, 12, 14, 18]), Candidate: [ 2  2  1  0  1  1  0  0  2  1  0  1  0  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 137450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  1  0 -1  1  0  0 -1  0  0  1 -1  0] (Indices: [2, 3, 4, 5, 6, 9, 10, 12, 13, 14, 18]), Candidate: [ 2  2  1  0  1  1  0  0  2  1 -1  2  1  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 137500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  1  0 -1  0  1 -1  0  1 -1  1  0 -1] (Indices: [2, 3, 4, 5, 6, 9, 10, 13, 16, 18, 19]), Candidate: [ 2  2  1  0  1  1  0  0  2  1 -1  1  2  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 137550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  1 -1  1  0 -1  0  0  1 -1  1  0 -1] (Indices: [2, 3, 4, 5, 6, 9, 11, 12, 16, 18, 19]), Candidate: [2 2 1 0 1 1 0 0 2 0 1 1 0 1 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 137600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  1 -1  0  1  0 -1  1 -1  1  0 -1  0] (Indices: [2, 3, 4, 5, 6, 9, 12, 13, 15, 17, 18]), Candidate: [2 2 1 0 1 1 0 0 2 0 0 2 1 0 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 137650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  0  1  0  0  0 -1  1 -1  0  1 -1  0] (Indices: [2, 3, 4, 5, 6, 10, 11, 12, 13, 15, 18]), Candidate: [2 2 1 0 1 1 0 0 1 2 0 1 1 0 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 137700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  0  1  0 -1  0  1  0  0 -1  0  1 -1] (Indices: [2, 3, 4, 5, 6, 10, 11, 14, 15, 16, 19]), Candidate: [2 2 1 0 1 1 0 0 1 2 0 0 1 2 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 137750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  0  1 -1  0  1  0  0  0 -1  0  1 -1] (Indices: [2, 3, 4, 5, 6, 10, 13, 14, 15, 16, 19]), Candidate: [ 2  2  1  0  1  1  0  0  1  2 -1  1  2  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 137800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  0  0  1  0 -1  0  1  0  0 -1  1 -1] (Indices: [2, 3, 4, 5, 6, 11, 12, 15, 16, 17, 19]), Candidate: [2 2 1 0 1 1 0 0 1 1 1 1 0 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 137850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  0  0  0  0  1  0 -1  1  0  0  0 -1] (Indices: [2, 3, 4, 5, 6, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  2  1  0  1  1  0  0  1  1  0  1  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 137900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0  0  0 -1  1 -1  0  0  0  1 -1  1 -1] (Indices: [2, 3, 4, 5, 7, 8, 9, 10, 12, 17, 19]), Candidate: [ 2  2  1  0  1  0  2  0  1  1 -1  2  0  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 137950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0  0 -1  1  0 -1  0  1 -1  0  1 -1  0] (Indices: [2, 3, 4, 5, 7, 8, 9, 11, 12, 15, 18]), Candidate: [2 2 1 0 1 0 2 0 1 0 1 1 0 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 138000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0  0 -1  0  1  0 -1  1 -1  0  1 -1  0] (Indices: [2, 3, 4, 5, 7, 8, 9, 12, 13, 15, 18]), Candidate: [2 2 1 0 1 0 2 0 1 0 0 2 1 0 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 138050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0  0 -1  0  0  0  1  0  0 -1  0  1 -1] (Indices: [2, 3, 4, 5, 7, 8, 9, 14, 15, 16, 19]), Candidate: [2 2 1 0 1 0 2 0 1 0 0 1 1 2 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 138100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0 -1  1  0 -1  0  1  0 -1  1 -1  0  0] (Indices: [2, 3, 4, 5, 7, 8, 10, 11, 14, 15, 17]), Candidate: [2 2 1 0 1 0 2 0 0 2 0 0 1 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 138150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0 -1  1 -1  1 -1  0  0  1  0  0 -1  0] (Indices: [2, 3, 4, 5, 7, 8, 10, 12, 16, 17, 18]), Candidate: [ 2  2  1  0  1  0  2  0  0  2 -1  2  0  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 138200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0 -1  0  1  0  0 -1  0  1 -1  0  1 -1] (Indices: [2, 3, 4, 5, 7, 8, 11, 12, 13, 16, 19]), Candidate: [2 2 1 0 1 0 2 0 0 1 1 1 1 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 138250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0 -1  0  1 -1  0  1 -1  1  0  0 -1  0] (Indices: [2, 3, 4, 5, 7, 8, 11, 14, 16, 17, 18]), Candidate: [ 2  2  1  0  1  0  2  0  0  1  1  0  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 138300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0 -1  0  0  0  1  0 -1  1  0  0 -1  0] (Indices: [2, 3, 4, 5, 7, 8, 13, 14, 16, 17, 18]), Candidate: [ 2  2  1  0  1  0  2  0  0  1  0  1  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 138350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  1  0  0 -1  1 -1  0  0  0  1  0 -1] (Indices: [2, 3, 4, 5, 7, 9, 10, 11, 13, 18, 19]), Candidate: [ 2  2  1  0  1  0  2 -1  2  1  0  0  2  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 138400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  1  0 -1  1 -1  0  1 -1  1 -1  1 -1] (Indices: [2, 3, 4, 5, 7, 9, 10, 12, 15, 17, 19]), Candidate: [ 2  2  1  0  1  0  2 -1  2  1 -1  2  0  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 138450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  1 -1  1  0  0 -1  0  1  0 -1  0  0] (Indices: [2, 3, 4, 5, 7, 9, 11, 12, 13, 16, 17]), Candidate: [ 2  2  1  0  1  0  2 -1  2  0  1  1  1  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 138500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  1 -1  1 -1  0  1  0 -1  1 -1  1 -1] (Indices: [2, 3, 4, 5, 7, 9, 11, 14, 15, 17, 19]), Candidate: [ 2  2  1  0  1  0  2 -1  2  0  1  0  1  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 138550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  1 -1  0  0  1  0  0 -1  1 -1  1 -1] (Indices: [2, 3, 4, 5, 7, 9, 13, 14, 15, 17, 19]), Candidate: [ 2  2  1  0  1  0  2 -1  2  0  0  1  2  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 138600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  0  1  0  0 -1  0  0  1 -1  1  0 -1] (Indices: [2, 3, 4, 5, 7, 10, 11, 12, 16, 18, 19]), Candidate: [ 2  2  1  0  1  0  2 -1  1  2  0  1  0  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 138650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  0  1 -1  1  0 -1  1 -1  1  0 -1  0] (Indices: [2, 3, 4, 5, 7, 10, 12, 13, 15, 17, 18]), Candidate: [ 2  2  1  0  1  0  2 -1  1  2 -1  2  1  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 138700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  0  0  1  0  0  0 -1  0  1  0 -1  0] (Indices: [2, 3, 4, 5, 7, 11, 12, 13, 14, 17, 18]), Candidate: [ 2  2  1  0  1  0  2 -1  1  1  1  1  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 138750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  0  0  0  1  0  0  0  0 -1  1 -1  0] (Indices: [2, 3, 4, 5, 7, 12, 13, 14, 15, 16, 18]), Candidate: [ 2  2  1  0  1  0  2 -1  1  1  0  2  1  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 138800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1  0  0  0 -1  1  0 -1  0  1 -1  0  0] (Indices: [2, 3, 4, 5, 8, 9, 10, 11, 13, 14, 17]), Candidate: [ 2  2  1  0  1  0  1  1  1  1  0  0  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 138850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1  0  0 -1  1 -1  1  0 -1  0  1 -1  0] (Indices: [2, 3, 4, 5, 8, 9, 10, 12, 14, 15, 18]), Candidate: [ 2  2  1  0  1  0  1  1  1  1 -1  2  0  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 138900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1  0  0 -1  0  0  0  1  0 -1  1  0 -1] (Indices: [2, 3, 4, 5, 8, 9, 10, 15, 16, 18, 19]), Candidate: [ 2  2  1  0  1  0  1  1  1  1 -1  1  1  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 138950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1  0 -1  1 -1  1 -1  1  0 -1  0  1 -1] (Indices: [2, 3, 4, 5, 8, 9, 11, 13, 15, 16, 19]), Candidate: [2 2 1 0 1 0 1 1 1 0 1 0 2 0 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 139000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1  0 -1  0  1 -1  1 -1  1  0 -1  1 -1] (Indices: [2, 3, 4, 5, 8, 9, 12, 14, 16, 17, 19]), Candidate: [ 2  2  1  0  1  0  1  1  1  0  0  2  0  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 139050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1 -1  1  0  0 -1  1 -1  1 -1  0  1 -1] (Indices: [2, 3, 4, 5, 8, 10, 11, 12, 14, 16, 19]), Candidate: [ 2  2  1  0  1  0  1  1  0  2  0  1  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 139100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1 -1  1 -1  1  0  0  0 -1  1 -1  0  0] (Indices: [2, 3, 4, 5, 8, 10, 12, 13, 14, 15, 17]), Candidate: [ 2  2  1  0  1  0  1  1  0  2 -1  2  1  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 139150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1 -1  1 -1  0  0  1  0  0  0 -1  1 -1] (Indices: [2, 3, 4, 5, 8, 10, 14, 15, 16, 17, 19]), Candidate: [ 2  2  1  0  1  0  1  1  0  2 -1  1  1  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 139200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1 -1  0  1 -1  1 -1  1  0  0  0 -1  0] (Indices: [2, 3, 4, 5, 8, 11, 13, 15, 16, 17, 18]), Candidate: [2 2 1 0 1 0 1 1 0 1 1 0 2 0 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 139250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  1  0  0  0  0 -1  0  1 -1  0  1 -1] (Indices: [2, 3, 4, 5, 9, 10, 11, 12, 13, 16, 19]), Candidate: [2 2 1 0 1 0 1 0 2 1 0 1 1 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 139300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  1  0  0 -1  0  1 -1  1  0  0 -1  0] (Indices: [2, 3, 4, 5, 9, 10, 11, 14, 16, 17, 18]), Candidate: [ 2  2  1  0  1  0  1  0  2  1  0  0  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 139350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  1  0 -1  0  1  0 -1  1  0  0 -1  0] (Indices: [2, 3, 4, 5, 9, 10, 13, 14, 16, 17, 18]), Candidate: [ 2  2  1  0  1  0  1  0  2  1 -1  1  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 139400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  1 -1  1 -1  1  0  0  0  0 -1  0  0] (Indices: [2, 3, 4, 5, 9, 11, 13, 14, 15, 16, 17]), Candidate: [2 2 1 0 1 0 1 0 2 0 1 0 2 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 139450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  0  1  0  0  0  0  0 -1  1 -1  0  0] (Indices: [2, 3, 4, 5, 10, 11, 12, 13, 14, 15, 17]), Candidate: [2 2 1 0 1 0 1 0 1 2 0 1 1 1 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 139500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  0  1  0 -1  0  1  0  0  0 -1  1 -1] (Indices: [2, 3, 4, 5, 10, 11, 14, 15, 16, 17, 19]), Candidate: [2 2 1 0 1 0 1 0 1 2 0 0 1 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 139550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  0  0  1  0 -1  1  0  0 -1  1  0 -1] (Indices: [2, 3, 4, 5, 11, 12, 14, 15, 16, 18, 19]), Candidate: [2 2 1 0 1 0 1 0 1 1 1 1 0 2 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 139600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0  0  0 -1  1  0 -1  0  0  1 -1  0  0] (Indices: [2, 3, 4, 6, 7, 8, 9, 10, 12, 13, 17]), Candidate: [ 2  2  1  0  0  2  1  0  1  1 -1  2  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 139650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0  0  0 -1  0  0  0  0  1  0 -1  1 -1] (Indices: [2, 3, 4, 6, 7, 8, 9, 10, 16, 17, 19]), Candidate: [ 2  2  1  0  0  2  1  0  1  1 -1  1  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 139700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0  0 -1  1 -1  0  0  1  0 -1  1 -1  0] (Indices: [2, 3, 4, 6, 7, 8, 9, 11, 15, 16, 18]), Candidate: [2 2 1 0 0 2 1 0 1 0 1 0 1 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 139750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0  0 -1  0  0  1  0 -1  1 -1  0  1 -1] (Indices: [2, 3, 4, 6, 7, 8, 9, 13, 14, 16, 19]), Candidate: [ 2  2  1  0  0  2  1  0  1  0  0  1  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 139800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0 -1  1  0 -1  1  0  0 -1  0  0  0  0] (Indices: [2, 3, 4, 6, 7, 8, 10, 11, 13, 14, 15]), Candidate: [2 2 1 0 0 2 1 0 0 2 0 0 2 1 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 139850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0 -1  1 -1  1 -1  1  0  0 -1  0  0  0] (Indices: [2, 3, 4, 6, 7, 8, 10, 12, 14, 15, 16]), Candidate: [ 2  2  1  0  0  2  1  0  0  2 -1  2  0  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 139900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0 -1  1 -1  0  0  0  1  0  0  0 -1  0] (Indices: [2, 3, 4, 6, 7, 8, 10, 15, 16, 17, 18]), Candidate: [ 2  2  1  0  0  2  1  0  0  2 -1  1  1  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 139950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0 -1  0  1 -1  1 -1  1  0  0 -1  0  0] (Indices: [2, 3, 4, 6, 7, 8, 11, 13, 15, 16, 17]), Candidate: [2 2 1 0 0 2 1 0 0 1 1 0 2 0 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 140000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0 -1  0  0  1 -1  1  0 -1  0  1  0 -1] (Indices: [2, 3, 4, 6, 7, 8, 12, 14, 15, 18, 19]), Candidate: [2 2 1 0 0 2 1 0 0 1 0 2 0 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 140050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  1  0  0  0 -1  0  0  0  1 -1  1 -1] (Indices: [2, 3, 4, 6, 7, 9, 10, 11, 12, 17, 19]), Candidate: [ 2  2  1  0  0  2  1 -1  2  1  0  1  0  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 140100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  1  0 -1  1  0 -1  0  0  1 -1  1 -1] (Indices: [2, 3, 4, 6, 7, 9, 10, 12, 13, 17, 19]), Candidate: [ 2  2  1  0  0  2  1 -1  2  1 -1  2  1  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 140150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  1  0 -1  0  0  1 -1  1 -1  1  0 -1] (Indices: [2, 3, 4, 6, 7, 9, 10, 14, 16, 18, 19]), Candidate: [ 2  2  1  0  0  2  1 -1  2  1 -1  1  1  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 140200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  1 -1  1 -1  1  0 -1  0  1 -1  1 -1] (Indices: [2, 3, 4, 6, 7, 9, 11, 13, 14, 17, 19]), Candidate: [ 2  2  1  0  0  2  1 -1  2  0  1  0  2  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 140250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  1 -1  0  1 -1  1  0 -1  1  0 -1  0] (Indices: [2, 3, 4, 6, 7, 9, 12, 14, 15, 17, 18]), Candidate: [ 2  2  1  0  0  2  1 -1  2  0  0  2  0  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 140300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  0  1  0  0 -1  1  0 -1  0  1 -1  0] (Indices: [2, 3, 4, 6, 7, 10, 11, 12, 14, 15, 18]), Candidate: [ 2  2  1  0  0  2  1 -1  1  2  0  1  0  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 140350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  0  1  0 -1  0  0  1  0 -1  1  0 -1] (Indices: [2, 3, 4, 6, 7, 10, 11, 15, 16, 18, 19]), Candidate: [ 2  2  1  0  0  2  1 -1  1  2  0  0  1  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 140400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  0  1 -1  0  1 -1  1  0 -1  1  0 -1] (Indices: [2, 3, 4, 6, 7, 10, 13, 15, 16, 18, 19]), Candidate: [ 2  2  1  0  0  2  1 -1  1  2 -1  1  2  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 140450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  0  0  1 -1  1  0 -1  1  0  0 -1  0] (Indices: [2, 3, 4, 6, 7, 11, 13, 14, 16, 17, 18]), Candidate: [ 2  2  1  0  0  2  1 -1  1  1  1  0  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 140500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1  0  0  0  0 -1  1 -1  1 -1  0  0  0] (Indices: [2, 3, 4, 6, 8, 9, 10, 11, 12, 14, 16]), Candidate: [ 2  2  1  0  0  2  0  1  1  1  0  1  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 140550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1  0  0 -1  1  0  0 -1  1 -1  0  0  0] (Indices: [2, 3, 4, 6, 8, 9, 10, 12, 13, 14, 16]), Candidate: [ 2  2  1  0  0  2  0  1  1  1 -1  2  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 140600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1  0  0 -1  0  1 -1  0  1  0  0 -1  0] (Indices: [2, 3, 4, 6, 8, 9, 10, 13, 16, 17, 18]), Candidate: [ 2  2  1  0  0  2  0  1  1  1 -1  1  2  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 140650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1  0 -1  1  0 -1  0  0  1  0  0 -1  0] (Indices: [2, 3, 4, 6, 8, 9, 11, 12, 16, 17, 18]), Candidate: [2 2 1 0 0 2 0 1 1 0 1 1 0 1 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 140700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1  0 -1  0  1  0 -1  1  0 -1  1 -1  0] (Indices: [2, 3, 4, 6, 8, 9, 12, 13, 15, 16, 18]), Candidate: [2 2 1 0 0 2 0 1 1 0 0 2 1 0 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 140750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1 -1  1  0  0  0 -1  1  0 -1  0  0  0] (Indices: [2, 3, 4, 6, 8, 10, 11, 12, 13, 15, 16]), Candidate: [2 2 1 0 0 2 0 1 0 2 0 1 1 0 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 140800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1 -1  1  0 -1  0  1  0  0  0 -1  0  0] (Indices: [2, 3, 4, 6, 8, 10, 11, 14, 15, 16, 17]), Candidate: [2 2 1 0 0 2 0 1 0 2 0 0 1 2 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 140850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1 -1  1 -1  0  1  0  0  0  0 -1  0  0] (Indices: [2, 3, 4, 6, 8, 10, 13, 14, 15, 16, 17]), Candidate: [ 2  2  1  0  0  2  0  1  0  2 -1  1  2  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 140900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1 -1  0  1  0 -1  1 -1  0  1  0  0 -1] (Indices: [2, 3, 4, 6, 8, 11, 12, 14, 17, 18, 19]), Candidate: [ 2  2  1  0  0  2  0  1  0  1  1  1  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 140950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1 -1  0  0  0  1  0  0  0 -1  1  0 -1] (Indices: [2, 3, 4, 6, 8, 13, 14, 15, 16, 18, 19]), Candidate: [2 2 1 0 0 2 0 1 0 1 0 1 2 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 141000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  1  0  0 -1  1 -1  1  0  0 -1  0  0] (Indices: [2, 3, 4, 6, 9, 10, 11, 13, 15, 16, 17]), Candidate: [2 2 1 0 0 2 0 0 2 1 0 0 2 0 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 141050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  1  0 -1  1 -1  1  0 -1  0  1  0 -1] (Indices: [2, 3, 4, 6, 9, 10, 12, 14, 15, 18, 19]), Candidate: [ 2  2  1  0  0  2  0  0  2  1 -1  2  0  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 141100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  1 -1  1  0  0 -1  0  0  1  0  0 -1] (Indices: [2, 3, 4, 6, 9, 11, 12, 13, 17, 18, 19]), Candidate: [2 2 1 0 0 2 0 0 2 0 1 1 1 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 141150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  1 -1  0  1  0 -1  1 -1  1  0  0 -1] (Indices: [2, 3, 4, 6, 9, 12, 13, 15, 17, 18, 19]), Candidate: [2 2 1 0 0 2 0 0 2 0 0 2 1 0 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 141200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  0  1  0 -1  1  0  0  0  0 -1  0  0] (Indices: [2, 3, 4, 6, 10, 11, 13, 14, 15, 16, 17]), Candidate: [2 2 1 0 0 2 0 0 1 2 0 0 2 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 141250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  0  0  1  0  0  0  0  0 -1  1 -1  0] (Indices: [2, 3, 4, 6, 11, 12, 13, 14, 15, 16, 18]), Candidate: [2 2 1 0 0 2 0 0 1 1 1 1 1 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 141300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0  0  0  0  0 -1  0  0  1  0 -1  0  0] (Indices: [2, 3, 4, 7, 8, 9, 10, 11, 12, 16, 17]), Candidate: [2 2 1 0 0 1 2 0 1 1 0 1 0 1 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 141350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0  0  0 -1  1  0 -1  0  1  0 -1  0  0] (Indices: [2, 3, 4, 7, 8, 9, 10, 12, 13, 16, 17]), Candidate: [ 2  2  1  0  0  1  2  0  1  1 -1  2  1  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 141400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0  0  0 -1  0  0  1  0 -1  1 -1  1 -1] (Indices: [2, 3, 4, 7, 8, 9, 10, 14, 15, 17, 19]), Candidate: [ 2  2  1  0  0  1  2  0  1  1 -1  1  1  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 141450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0  0 -1  1 -1  1  0 -1  1  0 -1  0  0] (Indices: [2, 3, 4, 7, 8, 9, 11, 13, 14, 16, 17]), Candidate: [ 2  2  1  0  0  1  2  0  1  0  1  0  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 141500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0  0 -1  0  1  0 -1  0  0  1  0  0 -1] (Indices: [2, 3, 4, 7, 8, 9, 12, 13, 17, 18, 19]), Candidate: [2 2 1 0 0 1 2 0 1 0 0 2 1 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 141550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0 -1  1  0  0  0 -1  0  0  1 -1  1 -1] (Indices: [2, 3, 4, 7, 8, 10, 11, 12, 13, 17, 19]), Candidate: [2 2 1 0 0 1 2 0 0 2 0 1 1 0 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 141600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0 -1  1  0 -1  0  1 -1  1 -1  1  0 -1] (Indices: [2, 3, 4, 7, 8, 10, 11, 14, 16, 18, 19]), Candidate: [ 2  2  1  0  0  1  2  0  0  2  0  0  1  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 141650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0 -1  1 -1  0  1  0 -1  1 -1  1  0 -1] (Indices: [2, 3, 4, 7, 8, 10, 13, 14, 16, 18, 19]), Candidate: [ 2  2  1  0  0  1  2  0  0  2 -1  1  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 141700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0 -1  0  1 -1  1  0  0  0 -1  0  1 -1] (Indices: [2, 3, 4, 7, 8, 11, 13, 14, 15, 16, 19]), Candidate: [2 2 1 0 0 1 2 0 0 1 1 0 2 1 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 141750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  1  0  0  0  0  0 -1  0  0  1 -1  0] (Indices: [2, 3, 4, 7, 9, 10, 11, 12, 13, 14, 18]), Candidate: [ 2  2  1  0  0  1  2 -1  2  1  0  1  1  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 141800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  1  0  0 -1  1 -1  0  1 -1  1  0 -1] (Indices: [2, 3, 4, 7, 9, 10, 11, 13, 16, 18, 19]), Candidate: [ 2  2  1  0  0  1  2 -1  2  1  0  0  2  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 141850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  1  0 -1  1 -1  0  1 -1  1  0  0 -1] (Indices: [2, 3, 4, 7, 9, 10, 12, 15, 17, 18, 19]), Candidate: [ 2  2  1  0  0  1  2 -1  2  1 -1  2  0  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 141900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  1 -1  1  0 -1  1 -1  1  0 -1  1 -1] (Indices: [2, 3, 4, 7, 9, 11, 12, 14, 16, 17, 19]), Candidate: [ 2  2  1  0  0  1  2 -1  2  0  1  1  0  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 141950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  1 -1  0  0  1  0  0  0  0  0 -1  0] (Indices: [2, 3, 4, 7, 9, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  2  1  0  0  1  2 -1  2  0  0  1  2  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 142000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  0  1  0 -1  1  0 -1  1 -1  1  0 -1] (Indices: [2, 3, 4, 7, 10, 11, 13, 14, 16, 18, 19]), Candidate: [ 2  2  1  0  0  1  2 -1  1  2  0  0  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 142050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  0  0  1  0  0  0 -1  0  1  0  0 -1] (Indices: [2, 3, 4, 7, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  2  1  0  0  1  2 -1  1  1  1  1  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 142100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1  0  0  0  0 -1  1 -1  0  1 -1  1 -1] (Indices: [2, 3, 4, 8, 9, 10, 11, 12, 14, 17, 19]), Candidate: [ 2  2  1  0  0  1  1  1  1  1  0  1  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 142150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1  0  0 -1  1  0  0  0 -1  0  0  1 -1] (Indices: [2, 3, 4, 8, 9, 10, 12, 13, 14, 15, 19]), Candidate: [ 2  2  1  0  0  1  1  1  1  1 -1  2  1  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 142200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1  0  0 -1  0  0  1  0 -1  1  0  0 -1] (Indices: [2, 3, 4, 8, 9, 10, 14, 15, 17, 18, 19]), Candidate: [ 2  2  1  0  0  1  1  1  1  1 -1  1  1  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 142250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1  0 -1  1 -1  1 -1  1  0 -1  1  0 -1] (Indices: [2, 3, 4, 8, 9, 11, 13, 15, 16, 18, 19]), Candidate: [2 2 1 0 0 1 1 1 1 0 1 0 2 0 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 142300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1 -1  1  0  0  0 -1  1 -1  1  0 -1  0] (Indices: [2, 3, 4, 8, 10, 11, 12, 13, 15, 17, 18]), Candidate: [2 2 1 0 0 1 1 1 0 2 0 1 1 0 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 142350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1 -1  1 -1  1  0  0 -1  1  0 -1  1 -1] (Indices: [2, 3, 4, 8, 10, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  2  1  0  0  1  1  1  0  2 -1  2  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 142400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1 -1  0  0  1  0  0  0  0  0 -1  1 -1] (Indices: [2, 3, 4, 8, 12, 13, 14, 15, 16, 17, 19]), Candidate: [2 2 1 0 0 1 1 1 0 1 0 2 1 1 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 142450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  1  0  0 -1  1  0 -1  1 -1  1  0 -1] (Indices: [2, 3, 4, 9, 10, 11, 13, 14, 16, 18, 19]), Candidate: [ 2  2  1  0  0  1  1  0  2  1  0  0  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 142500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  1 -1  1  0  0  0 -1  0  1  0  0 -1] (Indices: [2, 3, 4, 9, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  2  1  0  0  1  1  0  2  0  1  1  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 142550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  0  1  0 -1  1  0  0  0 -1  1  0 -1] (Indices: [2, 3, 4, 10, 11, 13, 14, 15, 16, 18, 19]), Candidate: [2 2 1 0 0 1 1 0 1 2 0 0 2 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 142600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0  0  0 -1  1  0  0 -1  0  0  0  0  0] (Indices: [2, 3, 5, 6, 7, 8, 9, 10, 12, 13, 14]), Candidate: [ 2  2  1 -1  2  1  1  0  1  1 -1  2  1  1 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 142650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0  0  0 -1  0  0  0  1 -1  1 -1  1 -1] (Indices: [2, 3, 5, 6, 7, 8, 9, 10, 15, 17, 19]), Candidate: [ 2  2  1 -1  2  1  1  0  1  1 -1  1  1  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 142700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0  0 -1  1 -1  0  1 -1  0  1 -1  1 -1] (Indices: [2, 3, 5, 6, 7, 8, 9, 11, 14, 17, 19]), Candidate: [ 2  2  1 -1  2  1  1  0  1  0  1  0  1  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 142750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0  0 -1  0  0  1  0  0 -1  0  0  1 -1] (Indices: [2, 3, 5, 6, 7, 8, 9, 13, 14, 15, 19]), Candidate: [ 2  2  1 -1  2  1  1  0  1  0  0  1  2  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 142800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0 -1  1  0  0 -1  0  0  0  1  0 -1  0] (Indices: [2, 3, 5, 6, 7, 8, 10, 11, 12, 17, 18]), Candidate: [ 2  2  1 -1  2  1  1  0  0  2  0  1  0  1  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 142850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0 -1  1 -1  1  0 -1  0  0  1  0 -1  0] (Indices: [2, 3, 5, 6, 7, 8, 10, 12, 13, 17, 18]), Candidate: [ 2  2  1 -1  2  1  1  0  0  2 -1  2  1  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 142900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0 -1  1 -1  0  0  1 -1  1  0 -1  1 -1] (Indices: [2, 3, 5, 6, 7, 8, 10, 14, 16, 17, 19]), Candidate: [ 2  2  1 -1  2  1  1  0  0  2 -1  1  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 142950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0 -1  0  1 -1  1  0 -1  0  1  0 -1  0] (Indices: [2, 3, 5, 6, 7, 8, 11, 13, 14, 17, 18]), Candidate: [ 2  2  1 -1  2  1  1  0  0  1  1  0  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 143000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0 -1  0  0  1 -1  1  0  0 -1  0  1 -1] (Indices: [2, 3, 5, 6, 7, 8, 12, 14, 15, 16, 19]), Candidate: [ 2  2  1 -1  2  1  1  0  0  1  0  2  0  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 143050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  1  0  0  0 -1  0  0  1 -1  1 -1  0] (Indices: [2, 3, 5, 6, 7, 9, 10, 11, 12, 16, 18]), Candidate: [ 2  2  1 -1  2  1  1 -1  2  1  0  1  0  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 143100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  1  0 -1  1  0 -1  0  1 -1  1 -1  0] (Indices: [2, 3, 5, 6, 7, 9, 10, 12, 13, 16, 18]), Candidate: [ 2  2  1 -1  2  1  1 -1  2  1 -1  2  1  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 143150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  1  0 -1  0  0  1  0 -1  0  1  0 -1] (Indices: [2, 3, 5, 6, 7, 9, 10, 14, 15, 18, 19]), Candidate: [ 2  2  1 -1  2  1  1 -1  2  1 -1  1  1  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 143200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  1 -1  1 -1  1  0 -1  1 -1  1 -1  0] (Indices: [2, 3, 5, 6, 7, 9, 11, 13, 14, 16, 18]), Candidate: [ 2  2  1 -1  2  1  1 -1  2  0  1  0  2  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 143250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  1 -1  0  1 -1  1  0  0  0 -1  0  0] (Indices: [2, 3, 5, 6, 7, 9, 12, 14, 15, 16, 17]), Candidate: [ 2  2  1 -1  2  1  1 -1  2  0  0  2  0  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 143300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  0  1  0  0  0 -1  0  0  0  1  0 -1] (Indices: [2, 3, 5, 6, 7, 10, 11, 12, 13, 18, 19]), Candidate: [ 2  2  1 -1  2  1  1 -1  1  2  0  1  1  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 143350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  0  1  0 -1  0  1 -1  0  1  0  0 -1] (Indices: [2, 3, 5, 6, 7, 10, 11, 14, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  1  1 -1  1  2  0  0  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 143400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  0  1 -1  0  1  0 -1  0  1  0  0 -1] (Indices: [2, 3, 5, 6, 7, 10, 13, 14, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  1  1 -1  1  2 -1  1  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 143450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  0  0  1 -1  1  0  0 -1  1  0 -1  0] (Indices: [2, 3, 5, 6, 7, 11, 13, 14, 15, 17, 18]), Candidate: [ 2  2  1 -1  2  1  1 -1  1  1  1  0  2  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 143500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1  0  0  0  0  0 -1  0  0  0  1 -1  0] (Indices: [2, 3, 5, 6, 8, 9, 10, 11, 12, 13, 18]), Candidate: [ 2  2  1 -1  2  1  0  1  1  1  0  1  1  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 143550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1  0  0  0 -1  0  0  0  1 -1  1  0 -1] (Indices: [2, 3, 5, 6, 8, 9, 10, 11, 16, 18, 19]), Candidate: [ 2  2  1 -1  2  1  0  1  1  1  0  0  1  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 143600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1  0  0 -1  0  1 -1  1 -1  1  0 -1  0] (Indices: [2, 3, 5, 6, 8, 9, 10, 13, 15, 17, 18]), Candidate: [ 2  2  1 -1  2  1  0  1  1  1 -1  1  2  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 143650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1  0 -1  1  0 -1  0  1 -1  1  0 -1  0] (Indices: [2, 3, 5, 6, 8, 9, 11, 12, 15, 17, 18]), Candidate: [ 2  2  1 -1  2  1  0  1  1  0  1  1  0  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 143700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1  0 -1  0  1  0  0 -1  0  1 -1  1 -1] (Indices: [2, 3, 5, 6, 8, 9, 12, 13, 14, 17, 19]), Candidate: [ 2  2  1 -1  2  1  0  1  1  0  0  2  1  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 143750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1 -1  1  0  0  0  0 -1  0  1 -1  0  0] (Indices: [2, 3, 5, 6, 8, 10, 11, 12, 13, 14, 17]), Candidate: [ 2  2  1 -1  2  1  0  1  0  2  0  1  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 143800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1 -1  1  0 -1  1 -1  0  1  0 -1  1 -1] (Indices: [2, 3, 5, 6, 8, 10, 11, 13, 16, 17, 19]), Candidate: [ 2  2  1 -1  2  1  0  1  0  2  0  0  2  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 143850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1 -1  1 -1  1 -1  0  1  0 -1  1  0 -1] (Indices: [2, 3, 5, 6, 8, 10, 12, 15, 16, 18, 19]), Candidate: [ 2  2  1 -1  2  1  0  1  0  2 -1  2  0  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 143900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1 -1  0  1  0 -1  1 -1  1  0  0 -1  0] (Indices: [2, 3, 5, 6, 8, 11, 12, 14, 16, 17, 18]), Candidate: [ 2  2  1 -1  2  1  0  1  0  1  1  1  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 143950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1 -1  0  0  1 -1  0  1  0  0  0  0 -1] (Indices: [2, 3, 5, 6, 8, 12, 15, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  1  0  1  0  1  0  2  0  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 144000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  1  0  0 -1  1  0 -1  0  1  0 -1  0] (Indices: [2, 3, 5, 6, 9, 10, 11, 13, 14, 17, 18]), Candidate: [ 2  2  1 -1  2  1  0  0  2  1  0  0  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 144050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  1  0 -1  1 -1  1  0  0 -1  0  1 -1] (Indices: [2, 3, 5, 6, 9, 10, 12, 14, 15, 16, 19]), Candidate: [ 2  2  1 -1  2  1  0  0  2  1 -1  2  0  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 144100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  1 -1  1  0  0 -1  0  1  0  0 -1  0] (Indices: [2, 3, 5, 6, 9, 11, 12, 13, 16, 17, 18]), Candidate: [ 2  2  1 -1  2  1  0  0  2  0  1  1  1  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 144150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  1 -1  0  1  0 -1  1  0  0  0 -1  0] (Indices: [2, 3, 5, 6, 9, 12, 13, 15, 16, 17, 18]), Candidate: [ 2  2  1 -1  2  1  0  0  2  0  0  2  1  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 144200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  0  1  0  0 -1  0  1  0 -1  1  0 -1] (Indices: [2, 3, 5, 6, 10, 11, 12, 15, 16, 18, 19]), Candidate: [ 2  2  1 -1  2  1  0  0  1  2  0  1  0  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 144250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  0  1 -1  0  1 -1  1  0  0  0  0 -1] (Indices: [2, 3, 5, 6, 10, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  1  0  0  1  2 -1  1  2  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 144300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0  0  0  0  0 -1  0  1 -1  1 -1  0  0] (Indices: [2, 3, 5, 7, 8, 9, 10, 11, 12, 15, 17]), Candidate: [ 2  2  1 -1  2  0  2  0  1  1  0  1  0  1  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 144350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0  0  0 -1  1  0 -1  1 -1  1 -1  0  0] (Indices: [2, 3, 5, 7, 8, 9, 10, 12, 13, 15, 17]), Candidate: [ 2  2  1 -1  2  0  2  0  1  1 -1  2  1  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 144400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0  0  0 -1  0  0  1  0  0 -1  1 -1  0] (Indices: [2, 3, 5, 7, 8, 9, 10, 14, 15, 16, 18]), Candidate: [ 2  2  1 -1  2  0  2  0  1  1 -1  1  1  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 144450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0  0 -1  1 -1  1  0  0 -1  1 -1  0  0] (Indices: [2, 3, 5, 7, 8, 9, 11, 13, 14, 15, 17]), Candidate: [ 2  2  1 -1  2  0  2  0  1  0  1  0  2  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 144500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0  0 -1  0  1  0 -1  0  1  0  0 -1  0] (Indices: [2, 3, 5, 7, 8, 9, 12, 13, 16, 17, 18]), Candidate: [ 2  2  1 -1  2  0  2  0  1  0  0  2  1  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 144550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0 -1  1  0  0  0 -1  0  1 -1  1 -1  0] (Indices: [2, 3, 5, 7, 8, 10, 11, 12, 13, 16, 18]), Candidate: [ 2  2  1 -1  2  0  2  0  0  2  0  1  1  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 144600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0 -1  1  0 -1  0  1  0 -1  0  1  0 -1] (Indices: [2, 3, 5, 7, 8, 10, 11, 14, 15, 18, 19]), Candidate: [ 2  2  1 -1  2  0  2  0  0  2  0  0  1  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 144650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0 -1  1 -1  0  1  0  0 -1  0  1  0 -1] (Indices: [2, 3, 5, 7, 8, 10, 13, 14, 15, 18, 19]), Candidate: [ 2  2  1 -1  2  0  2  0  0  2 -1  1  2  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 144700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0 -1  0  1  0 -1  0  0  1  0  0  0 -1] (Indices: [2, 3, 5, 7, 8, 11, 12, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  0  2  0  0  1  1  1  0  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 144750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  1  0  0  0  0  0  0 -1  0  0  0  0] (Indices: [2, 3, 5, 7, 9, 10, 11, 12, 13, 14, 15]), Candidate: [ 2  2  1 -1  2  0  2 -1  2  1  0  1  1  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 144800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  1  0  0 -1  1 -1  1 -1  0  1  0 -1] (Indices: [2, 3, 5, 7, 9, 10, 11, 13, 15, 18, 19]), Candidate: [ 2  2  1 -1  2  0  2 -1  2  1  0  0  2  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 144850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  1  0 -1  1 -1  0  1  0  0  0 -1  0] (Indices: [2, 3, 5, 7, 9, 10, 12, 15, 16, 17, 18]), Candidate: [ 2  2  1 -1  2  0  2 -1  2  1 -1  2  0  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 144900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  1 -1  1  0 -1  1  0 -1  1 -1  1 -1] (Indices: [2, 3, 5, 7, 9, 11, 12, 14, 15, 17, 19]), Candidate: [ 2  2  1 -1  2  0  2 -1  2  0  1  1  0  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 144950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  1 -1  0  1 -1  1  0 -1  1  0  0 -1] (Indices: [2, 3, 5, 7, 9, 12, 14, 15, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  0  2 -1  2  0  0  2  0  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 145000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  0  1  0 -1  1  0  0 -1  0  1  0 -1] (Indices: [2, 3, 5, 7, 10, 11, 13, 14, 15, 18, 19]), Candidate: [ 2  2  1 -1  2  0  2 -1  1  2  0  0  2  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 145050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  0  0  1  0  0  0 -1  1  0  0 -1  0] (Indices: [2, 3, 5, 7, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 2  2  1 -1  2  0  2 -1  1  1  1  1  1  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 145100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1  0  0  0  0 -1  1 -1  1 -1  1 -1  0] (Indices: [2, 3, 5, 8, 9, 10, 11, 12, 14, 16, 18]), Candidate: [ 2  2  1 -1  2  0  1  1  1  1  0  1  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 145150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1  0  0 -1  1  0  0  0  0 -1  0  0  0] (Indices: [2, 3, 5, 8, 9, 10, 12, 13, 14, 15, 16]), Candidate: [ 2  2  1 -1  2  0  1  1  1  1 -1  2  1  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 145200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1  0  0 -1  0  0  1  0  0  0  0 -1  0] (Indices: [2, 3, 5, 8, 9, 10, 14, 15, 16, 17, 18]), Candidate: [ 2  2  1 -1  2  0  1  1  1  1 -1  1  1  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 145250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1  0 -1  1 -1  1  0 -1  0  1  0  0 -1] (Indices: [2, 3, 5, 8, 9, 11, 13, 14, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  0  1  1  1  0  1  0  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 145300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1 -1  1  0  0  0 -1  1  0  0 -1  0  0] (Indices: [2, 3, 5, 8, 10, 11, 12, 13, 15, 16, 17]), Candidate: [ 2  2  1 -1  2  0  1  1  0  2  0  1  1  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 145350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1 -1  1 -1  1  0  0  0 -1  1 -1  1 -1] (Indices: [2, 3, 5, 8, 10, 12, 13, 14, 15, 17, 19]), Candidate: [ 2  2  1 -1  2  0  1  1  0  2 -1  2  1  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 145400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1 -1  0  1 -1  1 -1  1  0  0  0  0 -1] (Indices: [2, 3, 5, 8, 11, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  0  1  1  0  1  1  0  2  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 145450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  1  0  0 -1  1  0  0 -1  0  1  0 -1] (Indices: [2, 3, 5, 9, 10, 11, 13, 14, 15, 18, 19]), Candidate: [ 2  2  1 -1  2  0  1  0  2  1  0  0  2  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 145500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  1 -1  1  0  0  0 -1  1  0  0 -1  0] (Indices: [2, 3, 5, 9, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 2  2  1 -1  2  0  1  0  2  0  1  1  1  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 145550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  0  1  0  0 -1  0  1  0  0  0  0 -1] (Indices: [2, 3, 5, 10, 11, 12, 15, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  0  1  0  1  2  0  1  0  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 145600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0  0  0  0 -1  1  0 -1  0  0  0  1 -1] (Indices: [2, 3, 6, 7, 8, 9, 10, 11, 13, 14, 19]), Candidate: [ 2  2  1 -1  1  2  1  0  1  1  0  0  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 145650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0  0  0 -1  1 -1  1 -1  1  0 -1  0  0] (Indices: [2, 3, 6, 7, 8, 9, 10, 12, 14, 16, 17]), Candidate: [ 2  2  1 -1  1  2  1  0  1  1 -1  2  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 145700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0  0  0 -1  0  0  0  0  1  0  0  0 -1] (Indices: [2, 3, 6, 7, 8, 9, 10, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  1  2  1  0  1  1 -1  1  1  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 145750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0  0 -1  1 -1  1 -1  1 -1  1 -1  1 -1] (Indices: [2, 3, 6, 7, 8, 9, 11, 13, 15, 17, 19]), Candidate: [ 2  2  1 -1  1  2  1  0  1  0  1  0  2  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 145800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0  0 -1  0  1 -1  1 -1  0  1  0  0 -1] (Indices: [2, 3, 6, 7, 8, 9, 12, 14, 17, 18, 19]), Candidate: [ 2  2  1 -1  1  2  1  0  1  0  0  2  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 145850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0 -1  1  0  0 -1  1 -1  0  1 -1  1 -1] (Indices: [2, 3, 6, 7, 8, 10, 11, 12, 14, 17, 19]), Candidate: [ 2  2  1 -1  1  2  1  0  0  2  0  1  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 145900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0 -1  1 -1  1  0  0  0 -1  0  0  1 -1] (Indices: [2, 3, 6, 7, 8, 10, 12, 13, 14, 15, 19]), Candidate: [ 2  2  1 -1  1  2  1  0  0  2 -1  2  1  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 145950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0 -1  1 -1  0  0  1  0 -1  1  0  0 -1] (Indices: [2, 3, 6, 7, 8, 10, 14, 15, 17, 18, 19]), Candidate: [ 2  2  1 -1  1  2  1  0  0  2 -1  1  1  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 146000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0 -1  0  1 -1  1 -1  1  0 -1  1  0 -1] (Indices: [2, 3, 6, 7, 8, 11, 13, 15, 16, 18, 19]), Candidate: [ 2  2  1 -1  1  2  1  0  0  1  1  0  2  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 146050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  1  0  0  0  0 -1  0  0  1 -1  1 -1] (Indices: [2, 3, 6, 7, 9, 10, 11, 12, 13, 17, 19]), Candidate: [ 2  2  1 -1  1  2  1 -1  2  1  0  1  1  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 146100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  1  0  0 -1  0  1 -1  1 -1  1  0 -1] (Indices: [2, 3, 6, 7, 9, 10, 11, 14, 16, 18, 19]), Candidate: [ 2  2  1 -1  1  2  1 -1  2  1  0  0  1  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 146150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  1  0 -1  0  1  0 -1  1 -1  1  0 -1] (Indices: [2, 3, 6, 7, 9, 10, 13, 14, 16, 18, 19]), Candidate: [ 2  2  1 -1  1  2  1 -1  2  1 -1  1  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 146200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  1 -1  1 -1  1  0  0  0 -1  0  1 -1] (Indices: [2, 3, 6, 7, 9, 11, 13, 14, 15, 16, 19]), Candidate: [ 2  2  1 -1  1  2  1 -1  2  0  1  0  2  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 146250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  0  1  0  0  0  0  0 -1  0  0  1 -1] (Indices: [2, 3, 6, 7, 10, 11, 12, 13, 14, 15, 19]), Candidate: [ 2  2  1 -1  1  2  1 -1  1  2  0  1  1  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 146300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  0  1  0 -1  0  1  0 -1  1  0  0 -1] (Indices: [2, 3, 6, 7, 10, 11, 14, 15, 17, 18, 19]), Candidate: [ 2  2  1 -1  1  2  1 -1  1  2  0  0  1  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 146350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  0  0  1  0 -1  1 -1  1  0  0  0 -1] (Indices: [2, 3, 6, 7, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  1  2  1 -1  1  1  1  1  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 146400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1  0  0  0  0 -1  0  0  1 -1  1  0 -1] (Indices: [2, 3, 6, 8, 9, 10, 11, 12, 16, 18, 19]), Candidate: [ 2  2  1 -1  1  2  0  1  1  1  0  1  0  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 146450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1  0  0 -1  1  0 -1  1 -1  1  0 -1  0] (Indices: [2, 3, 6, 8, 9, 10, 12, 13, 15, 17, 18]), Candidate: [ 2  2  1 -1  1  2  0  1  1  1 -1  2  1  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 146500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1  0 -1  1  0  0  0 -1  0  1  0 -1  0] (Indices: [2, 3, 6, 8, 9, 11, 12, 13, 14, 17, 18]), Candidate: [ 2  2  1 -1  1  2  0  1  1  0  1  1  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 146550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1  0 -1  0  1  0  0  0  0 -1  1 -1  0] (Indices: [2, 3, 6, 8, 9, 12, 13, 14, 15, 16, 18]), Candidate: [ 2  2  1 -1  1  2  0  1  1  0  0  2  1  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 146600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1 -1  1  0  0 -1  1  0 -1  1  0 -1  0] (Indices: [2, 3, 6, 8, 10, 11, 12, 14, 15, 17, 18]), Candidate: [ 2  2  1 -1  1  2  0  1  0  2  0  1  0  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 146650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1 -1  1 -1  1 -1  1  0  0 -1  1  0 -1] (Indices: [2, 3, 6, 8, 10, 12, 14, 15, 16, 18, 19]), Candidate: [ 2  2  1 -1  1  2  0  1  0  2 -1  2  0  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 146700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  1  0  0  0  0  0  0 -1  0  0  1 -1] (Indices: [2, 3, 6, 9, 10, 11, 12, 13, 14, 15, 19]), Candidate: [ 2  2  1 -1  1  2  0  0  2  1  0  1  1  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 146750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  1  0  0 -1  0  1  0 -1  1  0  0 -1] (Indices: [2, 3, 6, 9, 10, 11, 14, 15, 17, 18, 19]), Candidate: [ 2  2  1 -1  1  2  0  0  2  1  0  0  1  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 146800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  1 -1  1  0 -1  1 -1  1  0  0  0 -1] (Indices: [2, 3, 6, 9, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  1  2  0  0  2  0  1  1  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 146850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  0  1 -1  1  0 -1  1  0  0  0  0 -1] (Indices: [2, 3, 6, 10, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  1  2  0  0  1  2 -1  2  1  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 146900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0  0  0  0 -1  1  0  0 -1  0  0  1 -1] (Indices: [2, 3, 7, 8, 9, 10, 11, 13, 14, 15, 19]), Candidate: [ 2  2  1 -1  1  1  2  0  1  1  0  0  2  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 146950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0  0  0 -1  1  0 -1  0  1 -1  1  0 -1] (Indices: [2, 3, 7, 8, 9, 10, 12, 13, 16, 18, 19]), Candidate: [ 2  2  1 -1  1  1  2  0  1  1 -1  2  1  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 147000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0  0 -1  1  0  0 -1  1  0 -1  0  1 -1] (Indices: [2, 3, 7, 8, 9, 11, 12, 13, 15, 16, 19]), Candidate: [ 2  2  1 -1  1  1  2  0  1  0  1  1  1  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 147050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0  0 -1  0  1  0  0 -1  1  0  0 -1  0] (Indices: [2, 3, 7, 8, 9, 12, 13, 14, 16, 17, 18]), Candidate: [ 2  2  1 -1  1  1  2  0  1  0  0  2  1  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 147100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0 -1  1  0  0 -1  1 -1  1 -1  1  0 -1] (Indices: [2, 3, 7, 8, 10, 11, 12, 14, 16, 18, 19]), Candidate: [ 2  2  1 -1  1  1  2  0  0  2  0  1  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 147150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0 -1  1 -1  0  1  0  0  0  0 -1  1 -1] (Indices: [2, 3, 7, 8, 10, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  2  1 -1  1  1  2  0  0  2 -1  1  2  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 147200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  1  0  0  0  0  0 -1  0  1 -1  1 -1] (Indices: [2, 3, 7, 9, 10, 11, 12, 13, 14, 17, 19]), Candidate: [ 2  2  1 -1  1  1  2 -1  2  1  0  1  1  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 147250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  1  0 -1  1  0  0  0  0 -1  0  1 -1] (Indices: [2, 3, 7, 9, 10, 12, 13, 14, 15, 16, 19]), Candidate: [ 2  2  1 -1  1  1  2 -1  2  1 -1  2  1  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 147300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  1 -1  1 -1  1  0  0 -1  1  0  0 -1] (Indices: [2, 3, 7, 9, 11, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  2  1 -1  1  1  2 -1  2  0  1  0  2  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 147350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  0  0  1  0  0  0  0  0 -1  1  0 -1] (Indices: [2, 3, 7, 11, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  2  1 -1  1  1  2 -1  1  1  1  1  1  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 147400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1  0  0  0 -1  1  0 -1  1 -1  1  0 -1] (Indices: [2, 3, 8, 9, 10, 11, 13, 14, 16, 18, 19]), Candidate: [ 2  2  1 -1  1  1  1  1  1  1  0  0  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 147450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1  0 -1  1  0  0  0 -1  0  1  0  0 -1] (Indices: [2, 3, 8, 9, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  2  1 -1  1  1  1  1  1  0  1  1  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 147500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1 -1  1  0 -1  1  0  0  0 -1  1  0 -1] (Indices: [2, 3, 8, 10, 11, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  2  1 -1  1  1  1  1  0  2  0  0  2  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 147550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  0  1  0 -1  1  0  0  0  0  0  0 -1  0] (Indices: [2, 3, 9, 10, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  2  1 -1  1  1  1  0  2  1 -1  2  1  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 147600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0  0  0  0 -1  0  0  0  1 -1  1 -1  0] (Indices: [2, 4, 5, 6, 7, 8, 9, 10, 11, 16, 18]), Candidate: [2 2 0 1 1 1 1 0 1 1 0 0 1 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 147650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0  0  0 -1  0  0  1 -1  0  0  1  0 -1] (Indices: [2, 4, 5, 6, 7, 8, 9, 10, 14, 18, 19]), Candidate: [ 2  2  0  1  1  1  1  0  1  1 -1  1  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 147700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0  0 -1  1 -1  0  1  0 -1  0  0  1 -1] (Indices: [2, 4, 5, 6, 7, 8, 9, 11, 14, 15, 19]), Candidate: [2 2 0 1 1 1 1 0 1 0 1 0 1 2 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 147750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0  0 -1  0  1 -1  0  0  1 -1  1  0 -1] (Indices: [2, 4, 5, 6, 7, 8, 9, 12, 16, 18, 19]), Candidate: [2 2 0 1 1 1 1 0 1 0 0 2 0 1 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 147800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0 -1  1  0  0 -1  0  1 -1  0  1 -1  0] (Indices: [2, 4, 5, 6, 7, 8, 10, 11, 12, 15, 18]), Candidate: [2 2 0 1 1 1 1 0 0 2 0 1 0 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 147850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0 -1  1 -1  1  0 -1  1 -1  0  1 -1  0] (Indices: [2, 4, 5, 6, 7, 8, 10, 12, 13, 15, 18]), Candidate: [ 2  2  0  1  1  1  1  0  0  2 -1  2  1  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 147900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0 -1  1 -1  0  0  1  0  0 -1  0  1 -1] (Indices: [2, 4, 5, 6, 7, 8, 10, 14, 15, 16, 19]), Candidate: [ 2  2  0  1  1  1  1  0  0  2 -1  1  1  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 147950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0 -1  0  1 -1  1  0  0 -1  0  1 -1  0] (Indices: [2, 4, 5, 6, 7, 8, 11, 13, 14, 15, 18]), Candidate: [2 2 0 1 1 1 1 0 0 1 1 0 2 1 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 148000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0 -1  0  0  1  0 -1  0  1  0 -1  1 -1] (Indices: [2, 4, 5, 6, 7, 8, 12, 13, 16, 17, 19]), Candidate: [2 2 0 1 1 1 1 0 0 1 0 2 1 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 148050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  1  0  0  0 -1  0  1  0 -1  0  0  0] (Indices: [2, 4, 5, 6, 7, 9, 10, 11, 12, 15, 16]), Candidate: [ 2  2  0  1  1  1  1 -1  2  1  0  1  0  1  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 148100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  1  0 -1  1  0 -1  1  0 -1  0  0  0] (Indices: [2, 4, 5, 6, 7, 9, 10, 12, 13, 15, 16]), Candidate: [ 2  2  0  1  1  1  1 -1  2  1 -1  2  1  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 148150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  1  0 -1  0  0  1  0  0  0 -1  0  0] (Indices: [2, 4, 5, 6, 7, 9, 10, 14, 15, 16, 17]), Candidate: [ 2  2  0  1  1  1  1 -1  2  1 -1  1  1  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 148200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  1 -1  1 -1  1  0  0  0 -1  0  0  0] (Indices: [2, 4, 5, 6, 7, 9, 11, 13, 14, 15, 16]), Candidate: [ 2  2  0  1  1  1  1 -1  2  0  1  0  2  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 148250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  1 -1  0  1  0 -1  1 -1  0  1  0 -1] (Indices: [2, 4, 5, 6, 7, 9, 12, 13, 15, 18, 19]), Candidate: [ 2  2  0  1  1  1  1 -1  2  0  0  2  1  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 148300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  0  1  0  0  0 -1  0  1  0 -1  0  0] (Indices: [2, 4, 5, 6, 7, 10, 11, 12, 13, 16, 17]), Candidate: [ 2  2  0  1  1  1  1 -1  1  2  0  1  1  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 148350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  0  1  0 -1  0  1  0 -1  1 -1  1 -1] (Indices: [2, 4, 5, 6, 7, 10, 11, 14, 15, 17, 19]), Candidate: [ 2  2  0  1  1  1  1 -1  1  2  0  0  1  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 148400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  0  1 -1  0  1  0  0 -1  1 -1  1 -1] (Indices: [2, 4, 5, 6, 7, 10, 13, 14, 15, 17, 19]), Candidate: [ 2  2  0  1  1  1  1 -1  1  2 -1  1  2  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 148450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  0  0  1  0 -1  0  1 -1  1  0  0 -1] (Indices: [2, 4, 5, 6, 7, 11, 12, 15, 17, 18, 19]), Candidate: [ 2  2  0  1  1  1  1 -1  1  1  1  1  0  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 148500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  0  0  0  0  0  1  0  0  0  0  0 -1] (Indices: [2, 4, 5, 6, 7, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  2  0  1  1  1  1 -1  1  1  0  1  1  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 148550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1  0  0  0 -1  0  0  1 -1  1  0 -1  0] (Indices: [2, 4, 5, 6, 8, 9, 10, 11, 15, 17, 18]), Candidate: [2 2 0 1 1 1 0 1 1 1 0 0 1 1 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 148600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1  0  0 -1  0  1  0 -1  0  1 -1  1 -1] (Indices: [2, 4, 5, 6, 8, 9, 10, 13, 14, 17, 19]), Candidate: [ 2  2  0  1  1  1  0  1  1  1 -1  1  2  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 148650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1  0 -1  1  0 -1  1 -1  0  1 -1  1 -1] (Indices: [2, 4, 5, 6, 8, 9, 11, 12, 14, 17, 19]), Candidate: [ 2  2  0  1  1  1  0  1  1  0  1  1  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 148700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1  0 -1  0  1  0  0  0 -1  0  0  1 -1] (Indices: [2, 4, 5, 6, 8, 9, 12, 13, 14, 15, 19]), Candidate: [2 2 0 1 1 1 0 1 1 0 0 2 1 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 148750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1  0 -1  0  0  0  1  0 -1  1  0  0 -1] (Indices: [2, 4, 5, 6, 8, 9, 14, 15, 17, 18, 19]), Candidate: [2 2 0 1 1 1 0 1 1 0 0 1 1 2 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 148800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1 -1  1  0 -1  1 -1  1  0 -1  0  1 -1] (Indices: [2, 4, 5, 6, 8, 10, 11, 13, 15, 16, 19]), Candidate: [2 2 0 1 1 1 0 1 0 2 0 0 2 0 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 148850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1 -1  1 -1  1 -1  1 -1  1  0 -1  1 -1] (Indices: [2, 4, 5, 6, 8, 10, 12, 14, 16, 17, 19]), Candidate: [ 2  2  0  1  1  1  0  1  0  2 -1  2  0  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 148900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1 -1  0  1  0 -1  1  0  0 -1  1 -1  0] (Indices: [2, 4, 5, 6, 8, 11, 12, 14, 15, 16, 18]), Candidate: [2 2 0 1 1 1 0 1 0 1 1 1 0 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 148950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1 -1  0  0  1 -1  1  0  0  0  0 -1  0] (Indices: [2, 4, 5, 6, 8, 12, 14, 15, 16, 17, 18]), Candidate: [2 2 0 1 1 1 0 1 0 1 0 2 0 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 149000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  1  0  0 -1  1  0  0 -1  0  1 -1  0] (Indices: [2, 4, 5, 6, 9, 10, 11, 13, 14, 15, 18]), Candidate: [2 2 0 1 1 1 0 0 2 1 0 0 2 1 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 149050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  1  0 -1  1  0 -1  0  1  0 -1  1 -1] (Indices: [2, 4, 5, 6, 9, 10, 12, 13, 16, 17, 19]), Candidate: [ 2  2  0  1  1  1  0  0  2  1 -1  2  1  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 149100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  1 -1  1  0  0 -1  1  0 -1  1 -1  0] (Indices: [2, 4, 5, 6, 9, 11, 12, 13, 15, 16, 18]), Candidate: [2 2 0 1 1 1 0 0 2 0 1 1 1 0 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 149150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  1 -1  0  1  0  0  0 -1  0  1  0 -1] (Indices: [2, 4, 5, 6, 9, 12, 13, 14, 15, 18, 19]), Candidate: [2 2 0 1 1 1 0 0 2 0 0 2 1 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 149200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  0  1  0  0 -1  1 -1  1  0 -1  1 -1] (Indices: [2, 4, 5, 6, 10, 11, 12, 14, 16, 17, 19]), Candidate: [ 2  2  0  1  1  1  0  0  1  2  0  1  0  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 149250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  0  1 -1  0  1  0  0  0  0  0 -1  0] (Indices: [2, 4, 5, 6, 10, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  2  0  1  1  1  0  0  1  2 -1  1  2  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 149300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0  0  0  0  0 -1  1 -1  1 -1  0  0  0] (Indices: [2, 4, 5, 7, 8, 9, 10, 11, 12, 14, 16]), Candidate: [ 2  2  0  1  1  0  2  0  1  1  0  1  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 149350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0  0  0 -1  1  0  0 -1  1 -1  0  0  0] (Indices: [2, 4, 5, 7, 8, 9, 10, 12, 13, 14, 16]), Candidate: [ 2  2  0  1  1  0  2  0  1  1 -1  2  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 149400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0  0  0 -1  0  1 -1  0  1  0  0 -1  0] (Indices: [2, 4, 5, 7, 8, 9, 10, 13, 16, 17, 18]), Candidate: [ 2  2  0  1  1  0  2  0  1  1 -1  1  2  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 149450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0  0 -1  1  0 -1  0  0  1  0  0 -1  0] (Indices: [2, 4, 5, 7, 8, 9, 11, 12, 16, 17, 18]), Candidate: [2 2 0 1 1 0 2 0 1 0 1 1 0 1 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 149500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0  0 -1  0  1  0 -1  1  0 -1  1 -1  0] (Indices: [2, 4, 5, 7, 8, 9, 12, 13, 15, 16, 18]), Candidate: [2 2 0 1 1 0 2 0 1 0 0 2 1 0 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 149550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0 -1  1  0  0  0 -1  1  0 -1  0  0  0] (Indices: [2, 4, 5, 7, 8, 10, 11, 12, 13, 15, 16]), Candidate: [2 2 0 1 1 0 2 0 0 2 0 1 1 0 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 149600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0 -1  1  0 -1  0  1  0  0  0 -1  0  0] (Indices: [2, 4, 5, 7, 8, 10, 11, 14, 15, 16, 17]), Candidate: [2 2 0 1 1 0 2 0 0 2 0 0 1 2 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 149650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0 -1  1 -1  0  1  0  0  0  0 -1  0  0] (Indices: [2, 4, 5, 7, 8, 10, 13, 14, 15, 16, 17]), Candidate: [ 2  2  0  1  1  0  2  0  0  2 -1  1  2  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 149700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0 -1  0  1  0 -1  1 -1  0  1  0  0 -1] (Indices: [2, 4, 5, 7, 8, 11, 12, 14, 17, 18, 19]), Candidate: [ 2  2  0  1  1  0  2  0  0  1  1  1  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 149750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0 -1  0  0  0  1  0  0  0 -1  1  0 -1] (Indices: [2, 4, 5, 7, 8, 13, 14, 15, 16, 18, 19]), Candidate: [2 2 0 1 1 0 2 0 0 1 0 1 2 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 149800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  1  0  0 -1  1 -1  1  0  0 -1  0  0] (Indices: [2, 4, 5, 7, 9, 10, 11, 13, 15, 16, 17]), Candidate: [ 2  2  0  1  1  0  2 -1  2  1  0  0  2  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 149850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  1  0 -1  1 -1  1  0 -1  0  1  0 -1] (Indices: [2, 4, 5, 7, 9, 10, 12, 14, 15, 18, 19]), Candidate: [ 2  2  0  1  1  0  2 -1  2  1 -1  2  0  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 149900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  1 -1  1  0  0 -1  0  0  1  0  0 -1] (Indices: [2, 4, 5, 7, 9, 11, 12, 13, 17, 18, 19]), Candidate: [ 2  2  0  1  1  0  2 -1  2  0  1  1  1  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 149950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  1 -1  0  1  0 -1  1 -1  1  0  0 -1] (Indices: [2, 4, 5, 7, 9, 12, 13, 15, 17, 18, 19]), Candidate: [ 2  2  0  1  1  0  2 -1  2  0  0  2  1  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 150000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  0  1  0 -1  1  0  0  0  0 -1  0  0] (Indices: [2, 4, 5, 7, 10, 11, 13, 14, 15, 16, 17]), Candidate: [ 2  2  0  1  1  0  2 -1  1  2  0  0  2  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 150050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  0  0  1  0  0  0  0  0 -1  1 -1  0] (Indices: [2, 4, 5, 7, 11, 12, 13, 14, 15, 16, 18]), Candidate: [ 2  2  0  1  1  0  2 -1  1  1  1  1  1  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 150100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1  0  0  0  0 -1  1  0  0 -1  0  0  0] (Indices: [2, 4, 5, 8, 9, 10, 11, 12, 14, 15, 16]), Candidate: [2 2 0 1 1 0 1 1 1 1 0 1 0 2 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 150150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1  0  0  0 -1  0  0  1  0  0  0 -1  0] (Indices: [2, 4, 5, 8, 9, 10, 11, 15, 16, 17, 18]), Candidate: [2 2 0 1 1 0 1 1 1 1 0 0 1 1 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 150200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1  0  0 -1  0  1 -1  1  0  0  0 -1  0] (Indices: [2, 4, 5, 8, 9, 10, 13, 15, 16, 17, 18]), Candidate: [ 2  2  0  1  1  0  1  1  1  1 -1  1  2  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 150250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1  0 -1  1 -1  1  0  0 -1  1 -1  1 -1] (Indices: [2, 4, 5, 8, 9, 11, 13, 14, 15, 17, 19]), Candidate: [2 2 0 1 1 0 1 1 1 0 1 0 2 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 150300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1 -1  1  0  0  0  0 -1  1 -1  1 -1  0] (Indices: [2, 4, 5, 8, 10, 11, 12, 13, 14, 16, 18]), Candidate: [ 2  2  0  1  1  0  1  1  0  2  0  1  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 150350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1 -1  1  0 -1  0  0  1  0  0  0  0 -1] (Indices: [2, 4, 5, 8, 10, 11, 15, 16, 17, 18, 19]), Candidate: [2 2 0 1 1 0 1 1 0 2 0 0 1 1 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 150400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1 -1  0  1 -1  1  0  0  0  0  0 -1  0] (Indices: [2, 4, 5, 8, 11, 13, 14, 15, 16, 17, 18]), Candidate: [2 2 0 1 1 0 1 1 0 1 1 0 2 1 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 150450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  1  0  0 -1  1  0  0  0  0 -1  0  0] (Indices: [2, 4, 5, 9, 10, 11, 13, 14, 15, 16, 17]), Candidate: [2 2 0 1 1 0 1 0 2 1 0 0 2 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 150500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  1 -1  1  0  0  0  0  0 -1  1 -1  0] (Indices: [2, 4, 5, 9, 11, 12, 13, 14, 15, 16, 18]), Candidate: [2 2 0 1 1 0 1 0 2 0 1 1 1 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 150550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  0  1  0  0 -1  1  0  0  0  0 -1  0] (Indices: [2, 4, 5, 10, 11, 12, 14, 15, 16, 17, 18]), Candidate: [2 2 0 1 1 0 1 0 1 2 0 1 0 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 150600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0  0  0  0  0 -1  0  0  0  0  1  0 -1] (Indices: [2, 4, 6, 7, 8, 9, 10, 11, 12, 18, 19]), Candidate: [2 2 0 1 0 2 1 0 1 1 0 1 0 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 150650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0  0  0 -1  1  0 -1  0  0  0  1  0 -1] (Indices: [2, 4, 6, 7, 8, 9, 10, 12, 13, 18, 19]), Candidate: [ 2  2  0  1  0  2  1  0  1  1 -1  2  1  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 150700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0  0  0 -1  0  0  1 -1  0  1  0  0 -1] (Indices: [2, 4, 6, 7, 8, 9, 10, 14, 17, 18, 19]), Candidate: [ 2  2  0  1  0  2  1  0  1  1 -1  1  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 150750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0  0 -1  1 -1  1  0 -1  0  0  1  0 -1] (Indices: [2, 4, 6, 7, 8, 9, 11, 13, 14, 18, 19]), Candidate: [ 2  2  0  1  0  2  1  0  1  0  1  0  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 150800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0  0 -1  0  1 -1  1  0 -1  1 -1  1 -1] (Indices: [2, 4, 6, 7, 8, 9, 12, 14, 15, 17, 19]), Candidate: [2 2 0 1 0 2 1 0 1 0 0 2 0 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 150850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0 -1  1  0  0 -1  1  0 -1  0  0  1 -1] (Indices: [2, 4, 6, 7, 8, 10, 11, 12, 14, 15, 19]), Candidate: [2 2 0 1 0 2 1 0 0 2 0 1 0 2 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 150900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0 -1  1  0 -1  0  0  1 -1  1  0  0 -1] (Indices: [2, 4, 6, 7, 8, 10, 11, 15, 17, 18, 19]), Candidate: [2 2 0 1 0 2 1 0 0 2 0 0 1 1 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 150950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0 -1  1 -1  0  1 -1  1 -1  1  0  0 -1] (Indices: [2, 4, 6, 7, 8, 10, 13, 15, 17, 18, 19]), Candidate: [ 2  2  0  1  0  2  1  0  0  2 -1  1  2  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 151000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0 -1  0  1 -1  1  0 -1  1  0 -1  1 -1] (Indices: [2, 4, 6, 7, 8, 11, 13, 14, 16, 17, 19]), Candidate: [ 2  2  0  1  0  2  1  0  0  1  1  0  2  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 151050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  1  0  0  0  0 -1  1 -1  0  0  1 -1] (Indices: [2, 4, 6, 7, 9, 10, 11, 12, 13, 15, 19]), Candidate: [ 2  2  0  1  0  2  1 -1  2  1  0  1  1  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 151100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  1  0  0 -1  0  1  0 -1  1  0 -1  0] (Indices: [2, 4, 6, 7, 9, 10, 11, 14, 15, 17, 18]), Candidate: [ 2  2  0  1  0  2  1 -1  2  1  0  0  1  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 151150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  1  0 -1  0  1  0  0 -1  1  0 -1  0] (Indices: [2, 4, 6, 7, 9, 10, 13, 14, 15, 17, 18]), Candidate: [ 2  2  0  1  0  2  1 -1  2  1 -1  1  2  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 151200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  1 -1  1  0 -1  0  1  0 -1  1  0 -1] (Indices: [2, 4, 6, 7, 9, 11, 12, 15, 16, 18, 19]), Candidate: [ 2  2  0  1  0  2  1 -1  2  0  1  1  0  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 151250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  1 -1  0  0  1 -1  1  0  0  0  0 -1] (Indices: [2, 4, 6, 7, 9, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  2  0  1  0  2  1 -1  2  0  0  1  2  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 151300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  0  1  0 -1  1 -1  1 -1  1  0  0 -1] (Indices: [2, 4, 6, 7, 10, 11, 13, 15, 17, 18, 19]), Candidate: [ 2  2  0  1  0  2  1 -1  1  2  0  0  2  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 151350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  0  0  1  0  0 -1  0  1  0  0  0 -1] (Indices: [2, 4, 6, 7, 11, 12, 13, 16, 17, 18, 19]), Candidate: [ 2  2  0  1  0  2  1 -1  1  1  1  1  1  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 151400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1  0  0  0  0 -1  0  1 -1  1  0 -1  0] (Indices: [2, 4, 6, 8, 9, 10, 11, 12, 15, 17, 18]), Candidate: [2 2 0 1 0 2 0 1 1 1 0 1 0 1 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 151450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1  0  0 -1  1  0  0 -1  0  1 -1  1 -1] (Indices: [2, 4, 6, 8, 9, 10, 12, 13, 14, 17, 19]), Candidate: [ 2  2  0  1  0  2  0  1  1  1 -1  2  1  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 151500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1  0 -1  1  0  0  0  0 -1  0  1 -1  0] (Indices: [2, 4, 6, 8, 9, 11, 12, 13, 14, 15, 18]), Candidate: [2 2 0 1 0 2 0 1 1 0 1 1 1 1 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 151550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1  0 -1  1 -1  0  1  0  0 -1  1  0 -1] (Indices: [2, 4, 6, 8, 9, 11, 14, 15, 16, 18, 19]), Candidate: [2 2 0 1 0 2 0 1 1 0 1 0 1 2 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 151600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1 -1  1  0  0  0 -1  0  1 -1  1  0 -1] (Indices: [2, 4, 6, 8, 10, 11, 12, 13, 16, 18, 19]), Candidate: [2 2 0 1 0 2 0 1 0 2 0 1 1 0 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 151650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1 -1  1 -1  1  0 -1  1  0 -1  1  0 -1] (Indices: [2, 4, 6, 8, 10, 12, 13, 15, 16, 18, 19]), Candidate: [ 2  2  0  1  0  2  0  1  0  2 -1  2  1  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 151700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1 -1  0  0  1 -1  1  0  0  0  0  0 -1] (Indices: [2, 4, 6, 8, 12, 14, 15, 16, 17, 18, 19]), Candidate: [2 2 0 1 0 2 0 1 0 1 0 2 0 2 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 151750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  1  0  0 -1  1 -1  1 -1  1  0  0 -1] (Indices: [2, 4, 6, 9, 10, 11, 13, 15, 17, 18, 19]), Candidate: [2 2 0 1 0 2 0 0 2 1 0 0 2 0 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 151800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  1 -1  1  0  0 -1  0  1  0  0  0 -1] (Indices: [2, 4, 6, 9, 11, 12, 13, 16, 17, 18, 19]), Candidate: [2 2 0 1 0 2 0 0 2 0 1 1 1 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 151850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  0  1 -1  1  0  0  0  0  0  0 -1  0] (Indices: [2, 4, 6, 10, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  2  0  1  0  2  0  0  1  2 -1  2  1  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 151900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0  0  0  0  0 -1  0  0  1 -1  1  0 -1] (Indices: [2, 4, 7, 8, 9, 10, 11, 12, 16, 18, 19]), Candidate: [2 2 0 1 0 1 2 0 1 1 0 1 0 1 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 151950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0  0  0 -1  1  0 -1  1 -1  1  0 -1  0] (Indices: [2, 4, 7, 8, 9, 10, 12, 13, 15, 17, 18]), Candidate: [ 2  2  0  1  0  1  2  0  1  1 -1  2  1  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 152000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0  0 -1  1  0  0  0 -1  0  1  0 -1  0] (Indices: [2, 4, 7, 8, 9, 11, 12, 13, 14, 17, 18]), Candidate: [ 2  2  0  1  0  1  2  0  1  0  1  1  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 152050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0  0 -1  0  1  0  0  0  0 -1  1 -1  0] (Indices: [2, 4, 7, 8, 9, 12, 13, 14, 15, 16, 18]), Candidate: [2 2 0 1 0 1 2 0 1 0 0 2 1 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 152100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0 -1  1  0  0 -1  1  0 -1  1  0 -1  0] (Indices: [2, 4, 7, 8, 10, 11, 12, 14, 15, 17, 18]), Candidate: [2 2 0 1 0 1 2 0 0 2 0 1 0 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 152150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0 -1  1 -1  1 -1  1  0  0 -1  1  0 -1] (Indices: [2, 4, 7, 8, 10, 12, 14, 15, 16, 18, 19]), Candidate: [ 2  2  0  1  0  1  2  0  0  2 -1  2  0  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 152200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  1  0  0  0  0  0  0 -1  0  0  1 -1] (Indices: [2, 4, 7, 9, 10, 11, 12, 13, 14, 15, 19]), Candidate: [ 2  2  0  1  0  1  2 -1  2  1  0  1  1  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 152250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  1  0  0 -1  0  1  0 -1  1  0  0 -1] (Indices: [2, 4, 7, 9, 10, 11, 14, 15, 17, 18, 19]), Candidate: [ 2  2  0  1  0  1  2 -1  2  1  0  0  1  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 152300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  1 -1  1  0 -1  1 -1  1  0  0  0 -1] (Indices: [2, 4, 7, 9, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  2  0  1  0  1  2 -1  2  0  1  1  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 152350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  0  1 -1  1  0 -1  1  0  0  0  0 -1] (Indices: [2, 4, 7, 10, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  2  0  1  0  1  2 -1  1  2 -1  2  1  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 152400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1  0  0  0 -1  1  0  0 -1  1  0 -1  0] (Indices: [2, 4, 8, 9, 10, 11, 13, 14, 15, 17, 18]), Candidate: [2 2 0 1 0 1 1 1 1 1 0 0 2 1 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 152450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1  0 -1  1  0  0  0  0 -1  1 -1  1 -1] (Indices: [2, 4, 8, 9, 11, 12, 13, 14, 15, 17, 19]), Candidate: [2 2 0 1 0 1 1 1 1 0 1 1 1 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 152500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1 -1  1  0  0 -1  1  0 -1  1  0  0 -1] (Indices: [2, 4, 8, 10, 11, 12, 14, 15, 17, 18, 19]), Candidate: [2 2 0 1 0 1 1 1 0 2 0 1 0 2 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 152550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  0  1  0  0 -1  1  0  0  0 -1  1  0 -1] (Indices: [2, 4, 9, 10, 11, 13, 14, 15, 16, 18, 19]), Candidate: [2 2 0 1 0 1 1 0 2 1 0 0 2 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 152600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0  0  0  0  0 -1  0  0  0  1  0 -1  0] (Indices: [2, 5, 6, 7, 8, 9, 10, 11, 12, 17, 18]), Candidate: [2 2 0 0 2 1 1 0 1 1 0 1 0 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 152650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0  0  0 -1  1  0 -1  0  0  1  0 -1  0] (Indices: [2, 5, 6, 7, 8, 9, 10, 12, 13, 17, 18]), Candidate: [ 2  2  0  0  2  1  1  0  1  1 -1  2  1  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 152700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0  0  0 -1  0  0  1 -1  1  0 -1  1 -1] (Indices: [2, 5, 6, 7, 8, 9, 10, 14, 16, 17, 19]), Candidate: [ 2  2  0  0  2  1  1  0  1  1 -1  1  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 152750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0  0 -1  1 -1  1  0 -1  0  1  0 -1  0] (Indices: [2, 5, 6, 7, 8, 9, 11, 13, 14, 17, 18]), Candidate: [ 2  2  0  0  2  1  1  0  1  0  1  0  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 152800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0  0 -1  0  1 -1  1  0  0 -1  0  1 -1] (Indices: [2, 5, 6, 7, 8, 9, 12, 14, 15, 16, 19]), Candidate: [2 2 0 0 2 1 1 0 1 0 0 2 0 2 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 152850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0 -1  1  0  0 -1  1  0 -1  1 -1  0  0] (Indices: [2, 5, 6, 7, 8, 10, 11, 12, 14, 15, 17]), Candidate: [2 2 0 0 2 1 1 0 0 2 0 1 0 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 152900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0 -1  1  0 -1  0  0  1  0  0 -1  1 -1] (Indices: [2, 5, 6, 7, 8, 10, 11, 15, 16, 17, 19]), Candidate: [2 2 0 0 2 1 1 0 0 2 0 0 1 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 152950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0 -1  1 -1  0  1 -1  1  0  0 -1  1 -1] (Indices: [2, 5, 6, 7, 8, 10, 13, 15, 16, 17, 19]), Candidate: [ 2  2  0  0  2  1  1  0  0  2 -1  1  2  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 153000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0 -1  0  1 -1  1  0  0 -1  0  1  0 -1] (Indices: [2, 5, 6, 7, 8, 11, 13, 14, 15, 18, 19]), Candidate: [2 2 0 0 2 1 1 0 0 1 1 0 2 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 153050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  1  0  0  0  0 -1  1 -1  1 -1  0  0] (Indices: [2, 5, 6, 7, 9, 10, 11, 12, 13, 15, 17]), Candidate: [ 2  2  0  0  2  1  1 -1  2  1  0  1  1  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 153100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  1  0  0 -1  0  1  0  0 -1  1 -1  0] (Indices: [2, 5, 6, 7, 9, 10, 11, 14, 15, 16, 18]), Candidate: [ 2  2  0  0  2  1  1 -1  2  1  0  0  1  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 153150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  1  0 -1  0  1  0  0  0 -1  1 -1  0] (Indices: [2, 5, 6, 7, 9, 10, 13, 14, 15, 16, 18]), Candidate: [ 2  2  0  0  2  1  1 -1  2  1 -1  1  2  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 153200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  1 -1  1  0 -1  0  1  0  0  0 -1  0] (Indices: [2, 5, 6, 7, 9, 11, 12, 15, 16, 17, 18]), Candidate: [ 2  2  0  0  2  1  1 -1  2  0  1  1  0  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 153250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  1 -1  0  0  1  0  0 -1  1  0  0 -1] (Indices: [2, 5, 6, 7, 9, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  2  0  0  2  1  1 -1  2  0  0  1  2  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 153300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  0  1  0 -1  1 -1  1  0  0 -1  1 -1] (Indices: [2, 5, 6, 7, 10, 11, 13, 15, 16, 17, 19]), Candidate: [ 2  2  0  0  2  1  1 -1  1  2  0  0  2  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 153350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  0  0  1  0  0 -1  1  0 -1  1  0 -1] (Indices: [2, 5, 6, 7, 11, 12, 13, 15, 16, 18, 19]), Candidate: [ 2  2  0  0  2  1  1 -1  1  1  1  1  1  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 153400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1  0  0  0  0 -1  0  1  0 -1  1 -1  0] (Indices: [2, 5, 6, 8, 9, 10, 11, 12, 15, 16, 18]), Candidate: [2 2 0 0 2 1 0 1 1 1 0 1 0 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 153450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1  0  0 -1  1  0  0 -1  1 -1  0  1 -1] (Indices: [2, 5, 6, 8, 9, 10, 12, 13, 14, 16, 19]), Candidate: [ 2  2  0  0  2  1  0  1  1  1 -1  2  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 153500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1  0 -1  1  0  0  0  0  0 -1  0  0  0] (Indices: [2, 5, 6, 8, 9, 11, 12, 13, 14, 15, 16]), Candidate: [2 2 0 0 2 1 0 1 1 0 1 1 1 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 153550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1  0 -1  1 -1  0  1  0  0  0  0 -1  0] (Indices: [2, 5, 6, 8, 9, 11, 14, 15, 16, 17, 18]), Candidate: [2 2 0 0 2 1 0 1 1 0 1 0 1 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 153600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1 -1  1  0  0  0 -1  0  1  0  0 -1  0] (Indices: [2, 5, 6, 8, 10, 11, 12, 13, 16, 17, 18]), Candidate: [2 2 0 0 2 1 0 1 0 2 0 1 1 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 153650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1 -1  1 -1  1  0 -1  1  0  0  0 -1  0] (Indices: [2, 5, 6, 8, 10, 12, 13, 15, 16, 17, 18]), Candidate: [ 2  2  0  0  2  1  0  1  0  2 -1  2  1  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 153700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1 -1  0  0  1  0  0 -1  1  0  0  0 -1] (Indices: [2, 5, 6, 8, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  2  0  0  2  1  0  1  0  1  0  2  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 153750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  1  0  0 -1  1 -1  1  0  0 -1  1 -1] (Indices: [2, 5, 6, 9, 10, 11, 13, 15, 16, 17, 19]), Candidate: [2 2 0 0 2 1 0 0 2 1 0 0 2 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 153800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  1 -1  1  0  0 -1  1  0 -1  1  0 -1] (Indices: [2, 5, 6, 9, 11, 12, 13, 15, 16, 18, 19]), Candidate: [2 2 0 0 2 1 0 0 2 0 1 1 1 0 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 153850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  0  1  0 -1  1 -1  1  0  0  0  0 -1] (Indices: [2, 5, 6, 10, 11, 13, 15, 16, 17, 18, 19]), Candidate: [2 2 0 0 2 1 0 0 1 2 0 0 2 0 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 153900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0  0  0  0  0 -1  0  0  1  0  0 -1  0] (Indices: [2, 5, 7, 8, 9, 10, 11, 12, 16, 17, 18]), Candidate: [2 2 0 0 2 0 2 0 1 1 0 1 0 1 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 153950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0  0  0 -1  1  0 -1  1  0 -1  1 -1  0] (Indices: [2, 5, 7, 8, 9, 10, 12, 13, 15, 16, 18]), Candidate: [ 2  2  0  0  2  0  2  0  1  1 -1  2  1  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 154000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0  0 -1  1  0  0  0 -1  1 -1  1 -1  0] (Indices: [2, 5, 7, 8, 9, 11, 12, 13, 14, 16, 18]), Candidate: [ 2  2  0  0  2  0  2  0  1  0  1  1  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 154050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0  0 -1  1 -1  0  0  1  0  0  0  0 -1] (Indices: [2, 5, 7, 8, 9, 11, 15, 16, 17, 18, 19]), Candidate: [2 2 0 0 2 0 2 0 1 0 1 0 1 1 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 154100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0 -1  1  0  0 -1  1  0  0 -1  1 -1  0] (Indices: [2, 5, 7, 8, 10, 11, 12, 14, 15, 16, 18]), Candidate: [2 2 0 0 2 0 2 0 0 2 0 1 0 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 154150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0 -1  1 -1  1 -1  1  0  0  0  0 -1  0] (Indices: [2, 5, 7, 8, 10, 12, 14, 15, 16, 17, 18]), Candidate: [ 2  2  0  0  2  0  2  0  0  2 -1  2  0  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 154200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  1  0  0  0  0  0  0 -1  1 -1  0  0] (Indices: [2, 5, 7, 9, 10, 11, 12, 13, 14, 15, 17]), Candidate: [ 2  2  0  0  2  0  2 -1  2  1  0  1  1  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 154250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  1  0  0 -1  0  1  0  0  0 -1  1 -1] (Indices: [2, 5, 7, 9, 10, 11, 14, 15, 16, 17, 19]), Candidate: [ 2  2  0  0  2  0  2 -1  2  1  0  0  1  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 154300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  1 -1  1  0 -1  1  0  0 -1  1  0 -1] (Indices: [2, 5, 7, 9, 11, 12, 14, 15, 16, 18, 19]), Candidate: [ 2  2  0  0  2  0  2 -1  2  0  1  1  0  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 154350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  0  1 -1  1  0  0  0 -1  1  0  0 -1] (Indices: [2, 5, 7, 10, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  2  0  0  2  0  2 -1  1  2 -1  2  1  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 154400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1  0  0  0 -1  1  0  0  0 -1  1 -1  0] (Indices: [2, 5, 8, 9, 10, 11, 13, 14, 15, 16, 18]), Candidate: [2 2 0 0 2 0 1 1 1 1 0 0 2 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 154450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1  0 -1  1  0  0  0  0  0 -1  0  1 -1] (Indices: [2, 5, 8, 9, 11, 12, 13, 14, 15, 16, 19]), Candidate: [2 2 0 0 2 0 1 1 1 0 1 1 1 1 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 154500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1 -1  1  0  0 -1  1  0  0  0 -1  1 -1] (Indices: [2, 5, 8, 10, 11, 12, 14, 15, 16, 17, 19]), Candidate: [2 2 0 0 2 0 1 1 0 2 0 1 0 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 154550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  0  1  0  0 -1  1  0  0  0  0  0 -1  0] (Indices: [2, 5, 9, 10, 11, 13, 14, 15, 16, 17, 18]), Candidate: [2 2 0 0 2 0 1 0 2 1 0 0 2 1 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 154600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0  0  0  0  0 -1  1  0 -1  1 -1  0  0] (Indices: [2, 6, 7, 8, 9, 10, 11, 12, 14, 15, 17]), Candidate: [2 2 0 0 1 2 1 0 1 1 0 1 0 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 154650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0  0  0  0 -1  0  0  1  0  0 -1  1 -1] (Indices: [2, 6, 7, 8, 9, 10, 11, 15, 16, 17, 19]), Candidate: [2 2 0 0 1 2 1 0 1 1 0 0 1 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 154700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0  0  0 -1  0  1 -1  1  0  0 -1  1 -1] (Indices: [2, 6, 7, 8, 9, 10, 13, 15, 16, 17, 19]), Candidate: [ 2  2  0  0  1  2  1  0  1  1 -1  1  2  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 154750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0  0 -1  1 -1  1  0  0 -1  0  1  0 -1] (Indices: [2, 6, 7, 8, 9, 11, 13, 14, 15, 18, 19]), Candidate: [2 2 0 0 1 2 1 0 1 0 1 0 2 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 154800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0 -1  1  0  0  0  0 -1  1 -1  0  1 -1] (Indices: [2, 6, 7, 8, 10, 11, 12, 13, 14, 16, 19]), Candidate: [ 2  2  0  0  1  2  1  0  0  2  0  1  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 154850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0 -1  1 -1  1  0  0  0  0  0 -1  0  0] (Indices: [2, 6, 7, 8, 10, 12, 13, 14, 15, 16, 17]), Candidate: [ 2  2  0  0  1  2  1  0  0  2 -1  2  1  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 154900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0 -1  0  1 -1  1  0  0  0  0 -1  1 -1] (Indices: [2, 6, 7, 8, 11, 13, 14, 15, 16, 17, 19]), Candidate: [2 2 0 0 1 2 1 0 0 1 1 0 2 1 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 154950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  1  0  0 -1  1  0  0  0 -1  1 -1  0] (Indices: [2, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18]), Candidate: [ 2  2  0  0  1  2  1 -1  2  1  0  0  2  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 155000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  1 -1  1  0  0  0  0  0 -1  0  1 -1] (Indices: [2, 6, 7, 9, 11, 12, 13, 14, 15, 16, 19]), Candidate: [ 2  2  0  0  1  2  1 -1  2  0  1  1  1  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 155050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  0  1  0  0 -1  1  0  0  0 -1  1 -1] (Indices: [2, 6, 7, 10, 11, 12, 14, 15, 16, 17, 19]), Candidate: [ 2  2  0  0  1  2  1 -1  1  2  0  1  0  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 155100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1  0  0  0  0 -1  1  0  0 -1  1 -1  0] (Indices: [2, 6, 8, 9, 10, 11, 12, 14, 15, 16, 18]), Candidate: [2 2 0 0 1 2 0 1 1 1 0 1 0 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 155150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1  0  0 -1  1 -1  1  0  0  0  0 -1  0] (Indices: [2, 6, 8, 9, 10, 12, 14, 15, 16, 17, 18]), Candidate: [ 2  2  0  0  1  2  0  1  1  1 -1  2  0  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 155200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1 -1  1  0  0  0  0  0  0 -1  1 -1  0] (Indices: [2, 6, 8, 10, 11, 12, 13, 14, 15, 16, 18]), Candidate: [2 2 0 0 1 2 0 1 0 2 0 1 1 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 155250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  1  0  0  0  0  0 -1  1  0  0 -1  0] (Indices: [2, 6, 9, 10, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 2  2  0  0  1  2  0  0  2  1  0  1  1  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 155300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0  0  0  0  0  0  0  0 -1  1 -1  0  0] (Indices: [2, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17]), Candidate: [2 2 0 0 1 1 2 0 1 1 0 1 1 1 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 155350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0  0  0  0 -1  0  1  0  0  0 -1  1 -1] (Indices: [2, 7, 8, 9, 10, 11, 14, 15, 16, 17, 19]), Candidate: [2 2 0 0 1 1 2 0 1 1 0 0 1 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 155400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0  0 -1  1  0 -1  1  0  0 -1  1  0 -1] (Indices: [2, 7, 8, 9, 11, 12, 14, 15, 16, 18, 19]), Candidate: [2 2 0 0 1 1 2 0 1 0 1 1 0 2 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 155450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0 -1  1 -1  1  0  0  0 -1  1  0  0 -1] (Indices: [2, 7, 8, 10, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  2  0  0  1  1  2  0  0  2 -1  2  1  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 155500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1 -1  1 -1  1  0  0  0  0  0  0  0 -1  0] (Indices: [2, 7, 9, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  2  0  0  1  1  2 -1  2  0  1  1  1  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 155550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  0  1  0  0 -1  1  0  0  0 -1  1  0  0 -1] (Indices: [2, 8, 9, 10, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  2  0  0  1  1  1  1  1  1 -1  2  1  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 155600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0  0  0  0 -1  0  1 -1  0  1 -1  0  0] (Indices: [3, 4, 5, 6, 7, 8, 9, 10, 11, 14, 17]), Candidate: [ 2  1  2  0  1  1  1  0  1  1  0  0  1  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 155650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0  0  0 -1  0  0  1  0 -1  1 -1  0  0] (Indices: [3, 4, 5, 6, 7, 8, 9, 10, 14, 15, 17]), Candidate: [ 2  1  2  0  1  1  1  0  1  1 -1  1  1  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 155700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0  0 -1  1 -1  1 -1  0  1 -1  1 -1  0] (Indices: [3, 4, 5, 6, 7, 8, 9, 11, 13, 16, 18]), Candidate: [2 1 2 0 1 1 1 0 1 0 1 0 2 0 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 155750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0  0 -1  0  1 -1  0  1  0  0 -1  0  0] (Indices: [3, 4, 5, 6, 7, 8, 9, 12, 15, 16, 17]), Candidate: [2 1 2 0 1 1 1 0 1 0 0 2 0 1 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 155800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0 -1  1  0  0  0 -1  0  0  0  0  1 -1] (Indices: [3, 4, 5, 6, 7, 8, 10, 11, 12, 13, 19]), Candidate: [2 1 2 0 1 1 1 0 0 2 0 1 1 0 0 1 1 1 2 5]
 -> Valid neighbor added.
Attempt 155850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0 -1  1  0 -1  0  0  0  0  1  0  0 -1] (Indices: [3, 4, 5, 6, 7, 8, 10, 11, 17, 18, 19]), Candidate: [2 1 2 0 1 1 1 0 0 2 0 0 1 1 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 155900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0 -1  1 -1  0  1 -1  1 -1  1 -1  1 -1] (Indices: [3, 4, 5, 6, 7, 8, 10, 13, 15, 17, 19]), Candidate: [ 2  1  2  0  1  1  1  0  0  2 -1  1  2  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 155950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0 -1  0  1  0 -1  0  1 -1  1 -1  1 -1] (Indices: [3, 4, 5, 6, 7, 8, 11, 12, 15, 17, 19]), Candidate: [2 1 2 0 1 1 1 0 0 1 1 1 0 1 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 156000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0 -1  0  0  1  0  0 -1  0  0  1  0 -1] (Indices: [3, 4, 5, 6, 7, 8, 12, 13, 14, 18, 19]), Candidate: [ 2  1  2  0  1  1  1  0  0  1  0  2  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 156050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  1  0  0  0  0 -1  0  0  1 -1  0  0] (Indices: [3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 17]), Candidate: [ 2  1  2  0  1  1  1 -1  2  1  0  1  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 156100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  1  0  0 -1  0  0  0  1  0 -1  1 -1] (Indices: [3, 4, 5, 6, 7, 9, 10, 11, 16, 17, 19]), Candidate: [ 2  1  2  0  1  1  1 -1  2  1  0  0  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 156150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  1  0 -1  0  1 -1  1  0 -1  0  1 -1] (Indices: [3, 4, 5, 6, 7, 9, 10, 13, 15, 16, 19]), Candidate: [ 2  1  2  0  1  1  1 -1  2  1 -1  1  2  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 156200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  1 -1  1  0 -1  0  1  0 -1  0  1 -1] (Indices: [3, 4, 5, 6, 7, 9, 11, 12, 15, 16, 19]), Candidate: [ 2  1  2  0  1  1  1 -1  2  0  1  1  0  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 156250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  1 -1  0  1  0  0 -1  0  1  0 -1  0] (Indices: [3, 4, 5, 6, 7, 9, 12, 13, 14, 17, 18]), Candidate: [ 2  1  2  0  1  1  1 -1  2  0  0  2  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 156300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  0  1  0  0  0  0 -1  1 -1  0  0  0] (Indices: [3, 4, 5, 6, 7, 10, 11, 12, 13, 14, 16]), Candidate: [ 2  1  2  0  1  1  1 -1  1  2  0  1  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 156350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  0  1  0 -1  1 -1  0  1  0  0 -1  0] (Indices: [3, 4, 5, 6, 7, 10, 11, 13, 16, 17, 18]), Candidate: [ 2  1  2  0  1  1  1 -1  1  2  0  0  2  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 156400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  0  1 -1  1 -1  0  1  0  0 -1  1 -1] (Indices: [3, 4, 5, 6, 7, 10, 12, 15, 16, 17, 19]), Candidate: [ 2  1  2  0  1  1  1 -1  1  2 -1  2  0  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 156450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  0  0  1  0 -1  1  0 -1  0  1  0 -1] (Indices: [3, 4, 5, 6, 7, 11, 12, 14, 15, 18, 19]), Candidate: [ 2  1  2  0  1  1  1 -1  1  1  1  1  0  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 156500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  0  0  0  1 -1  1 -1  1  0  0  0 -1] (Indices: [3, 4, 5, 6, 7, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  1  2  0  1  1  1 -1  1  1  0  2  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 156550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1  0  0  0 -1  0  1 -1  1 -1  1 -1  0] (Indices: [3, 4, 5, 6, 8, 9, 10, 11, 14, 16, 18]), Candidate: [ 2  1  2  0  1  1  0  1  1  1  0  0  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 156600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1  0  0 -1  0  1  0  0  0 -1  0  0  0] (Indices: [3, 4, 5, 6, 8, 9, 10, 13, 14, 15, 16]), Candidate: [ 2  1  2  0  1  1  0  1  1  1 -1  1  2  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 156650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1  0 -1  1  0 -1  1  0  0 -1  0  0  0] (Indices: [3, 4, 5, 6, 8, 9, 11, 12, 14, 15, 16]), Candidate: [2 1 2 0 1 1 0 1 1 0 1 1 0 2 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 156700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1  0 -1  1 -1  0  0  1  0  0  0 -1  0] (Indices: [3, 4, 5, 6, 8, 9, 11, 15, 16, 17, 18]), Candidate: [2 1 2 0 1 1 0 1 1 0 1 0 1 1 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 156750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1  0 -1  0  0  1 -1  1  0  0  0 -1  0] (Indices: [3, 4, 5, 6, 8, 9, 13, 15, 16, 17, 18]), Candidate: [2 1 2 0 1 1 0 1 1 0 0 1 2 0 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 156800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1 -1  1  0 -1  1  0 -1  1  0 -1  0  0] (Indices: [3, 4, 5, 6, 8, 10, 11, 13, 14, 16, 17]), Candidate: [ 2  1  2  0  1  1  0  1  0  2  0  0  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 156850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1 -1  1 -1  1  0 -1  0  0  1  0  0 -1] (Indices: [3, 4, 5, 6, 8, 10, 12, 13, 17, 18, 19]), Candidate: [ 2  1  2  0  1  1  0  1  0  2 -1  2  1  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 156900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1 -1  0  1  0  0 -1  1 -1  1  0 -1  0] (Indices: [3, 4, 5, 6, 8, 11, 12, 13, 15, 17, 18]), Candidate: [2 1 2 0 1 1 0 1 0 1 1 1 1 0 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 156950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1 -1  0  0  1  0  0 -1  1  0 -1  1 -1] (Indices: [3, 4, 5, 6, 8, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  1  2  0  1  1  0  1  0  1  0  2  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 157000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  1  0  0  0 -1  0  1 -1  1 -1  1 -1] (Indices: [3, 4, 5, 6, 9, 10, 11, 12, 15, 17, 19]), Candidate: [2 1 2 0 1 1 0 0 2 1 0 1 0 1 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 157050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  1  0 -1  1  0  0 -1  0  0  1  0 -1] (Indices: [3, 4, 5, 6, 9, 10, 12, 13, 14, 18, 19]), Candidate: [ 2  1  2  0  1  1  0  0  2  1 -1  2  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 157100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  1 -1  1  0  0  0  0 -1  0  0  1 -1] (Indices: [3, 4, 5, 6, 9, 11, 12, 13, 14, 15, 19]), Candidate: [2 1 2 0 1 1 0 0 2 0 1 1 1 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 157150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  1 -1  1 -1  0  1  0 -1  1  0  0 -1] (Indices: [3, 4, 5, 6, 9, 11, 14, 15, 17, 18, 19]), Candidate: [2 1 2 0 1 1 0 0 2 0 1 0 1 2 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 157200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  0  1  0  0  0 -1  0  0  1  0  0 -1] (Indices: [3, 4, 5, 6, 10, 11, 12, 13, 17, 18, 19]), Candidate: [2 1 2 0 1 1 0 0 1 2 0 1 1 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 157250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  0  1 -1  1  0 -1  1 -1  1  0  0 -1] (Indices: [3, 4, 5, 6, 10, 12, 13, 15, 17, 18, 19]), Candidate: [ 2  1  2  0  1  1  0  0  1  2 -1  2  1  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 157300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  0  0  0  0  1  0  0  0  0  0  0 -1] (Indices: [3, 4, 5, 6, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 1 2 0 1 1 0 0 1 1 0 1 2 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 157350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0  0  0  0 -1  0  0  1 -1  1  0 -1  0] (Indices: [3, 4, 5, 7, 8, 9, 10, 11, 15, 17, 18]), Candidate: [2 1 2 0 1 0 2 0 1 1 0 0 1 1 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 157400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0  0  0 -1  0  1  0 -1  0  1 -1  1 -1] (Indices: [3, 4, 5, 7, 8, 9, 10, 13, 14, 17, 19]), Candidate: [ 2  1  2  0  1  0  2  0  1  1 -1  1  2  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 157450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0  0 -1  1  0 -1  1 -1  0  1 -1  1 -1] (Indices: [3, 4, 5, 7, 8, 9, 11, 12, 14, 17, 19]), Candidate: [ 2  1  2  0  1  0  2  0  1  0  1  1  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 157500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0  0 -1  0  1  0  0  0 -1  0  0  1 -1] (Indices: [3, 4, 5, 7, 8, 9, 12, 13, 14, 15, 19]), Candidate: [2 1 2 0 1 0 2 0 1 0 0 2 1 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 157550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0  0 -1  0  0  0  1  0 -1  1  0  0 -1] (Indices: [3, 4, 5, 7, 8, 9, 14, 15, 17, 18, 19]), Candidate: [2 1 2 0 1 0 2 0 1 0 0 1 1 2 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 157600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0 -1  1  0 -1  1 -1  1  0 -1  0  1 -1] (Indices: [3, 4, 5, 7, 8, 10, 11, 13, 15, 16, 19]), Candidate: [2 1 2 0 1 0 2 0 0 2 0 0 2 0 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 157650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0 -1  1 -1  1 -1  1 -1  1  0 -1  1 -1] (Indices: [3, 4, 5, 7, 8, 10, 12, 14, 16, 17, 19]), Candidate: [ 2  1  2  0  1  0  2  0  0  2 -1  2  0  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 157700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0 -1  0  1  0 -1  1  0  0 -1  1 -1  0] (Indices: [3, 4, 5, 7, 8, 11, 12, 14, 15, 16, 18]), Candidate: [2 1 2 0 1 0 2 0 0 1 1 1 0 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 157750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0 -1  0  0  1 -1  1  0  0  0  0 -1  0] (Indices: [3, 4, 5, 7, 8, 12, 14, 15, 16, 17, 18]), Candidate: [2 1 2 0 1 0 2 0 0 1 0 2 0 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 157800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  1  0  0 -1  1  0  0 -1  0  1 -1  0] (Indices: [3, 4, 5, 7, 9, 10, 11, 13, 14, 15, 18]), Candidate: [ 2  1  2  0  1  0  2 -1  2  1  0  0  2  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 157850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  1  0 -1  1  0 -1  0  1  0 -1  1 -1] (Indices: [3, 4, 5, 7, 9, 10, 12, 13, 16, 17, 19]), Candidate: [ 2  1  2  0  1  0  2 -1  2  1 -1  2  1  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 157900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  1 -1  1  0  0 -1  1  0 -1  1 -1  0] (Indices: [3, 4, 5, 7, 9, 11, 12, 13, 15, 16, 18]), Candidate: [ 2  1  2  0  1  0  2 -1  2  0  1  1  1  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 157950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  1 -1  0  1  0  0  0 -1  0  1  0 -1] (Indices: [3, 4, 5, 7, 9, 12, 13, 14, 15, 18, 19]), Candidate: [ 2  1  2  0  1  0  2 -1  2  0  0  2  1  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 158000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  0  1  0  0 -1  1 -1  1  0 -1  1 -1] (Indices: [3, 4, 5, 7, 10, 11, 12, 14, 16, 17, 19]), Candidate: [ 2  1  2  0  1  0  2 -1  1  2  0  1  0  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 158050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  0  1 -1  0  1  0  0  0  0  0 -1  0] (Indices: [3, 4, 5, 7, 10, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  1  2  0  1  0  2 -1  1  2 -1  1  2  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 158100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1  0  0  0  0  0 -1  1 -1  0  1 -1  0] (Indices: [3, 4, 5, 8, 9, 10, 11, 12, 13, 15, 18]), Candidate: [2 1 2 0 1 0 1 1 1 1 0 1 1 0 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 158150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1  0  0  0 -1  0  1  0  0 -1  0  1 -1] (Indices: [3, 4, 5, 8, 9, 10, 11, 14, 15, 16, 19]), Candidate: [2 1 2 0 1 0 1 1 1 1 0 0 1 2 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 158200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1  0  0 -1  0  1  0  0  0 -1  0  1 -1] (Indices: [3, 4, 5, 8, 9, 10, 13, 14, 15, 16, 19]), Candidate: [ 2  1  2  0  1  0  1  1  1  1 -1  1  2  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 158250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1  0 -1  1  0 -1  0  1  0  0 -1  1 -1] (Indices: [3, 4, 5, 8, 9, 11, 12, 15, 16, 17, 19]), Candidate: [2 1 2 0 1 0 1 1 1 0 1 1 0 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 158300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1  0 -1  0  0  1  0 -1  1  0  0  0 -1] (Indices: [3, 4, 5, 8, 9, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  2  0  1  0  1  1  1  0  0  1  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 158350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1 -1  1  0 -1  1 -1  1  0 -1  1  0 -1] (Indices: [3, 4, 5, 8, 10, 11, 13, 15, 16, 18, 19]), Candidate: [2 1 2 0 1 0 1 1 0 2 0 0 2 0 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 158400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1 -1  0  1  0  0 -1  1 -1  1  0  0 -1] (Indices: [3, 4, 5, 8, 11, 12, 13, 15, 17, 18, 19]), Candidate: [2 1 2 0 1 0 1 1 0 1 1 1 1 0 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 158450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  1  0  0  0 -1  1 -1  1  0 -1  1 -1] (Indices: [3, 4, 5, 9, 10, 11, 12, 14, 16, 17, 19]), Candidate: [ 2  1  2  0  1  0  1  0  2  1  0  1  0  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 158500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  1  0 -1  0  1  0  0  0  0  0 -1  0] (Indices: [3, 4, 5, 9, 10, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  1  2  0  1  0  1  0  2  1 -1  1  2  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 158550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  0  1  0  0  0  0 -1  1  0 -1  1 -1] (Indices: [3, 4, 5, 10, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  1  2  0  1  0  1  0  1  2  0  1  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 158600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0  0  0  0  0 -1  0  1 -1  1 -1  0  0] (Indices: [3, 4, 6, 7, 8, 9, 10, 11, 12, 15, 17]), Candidate: [2 1 2 0 0 2 1 0 1 1 0 1 0 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 158650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0  0  0 -1  1  0 -1  1 -1  1 -1  0  0] (Indices: [3, 4, 6, 7, 8, 9, 10, 12, 13, 15, 17]), Candidate: [ 2  1  2  0  0  2  1  0  1  1 -1  2  1  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 158700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0  0  0 -1  0  0  1  0  0 -1  1 -1  0] (Indices: [3, 4, 6, 7, 8, 9, 10, 14, 15, 16, 18]), Candidate: [ 2  1  2  0  0  2  1  0  1  1 -1  1  1  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 158750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0  0 -1  1 -1  1  0  0 -1  1 -1  0  0] (Indices: [3, 4, 6, 7, 8, 9, 11, 13, 14, 15, 17]), Candidate: [2 1 2 0 0 2 1 0 1 0 1 0 2 1 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 158800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0  0 -1  0  1  0 -1  0  1  0  0 -1  0] (Indices: [3, 4, 6, 7, 8, 9, 12, 13, 16, 17, 18]), Candidate: [2 1 2 0 0 2 1 0 1 0 0 2 1 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 158850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0 -1  1  0  0  0 -1  0  1 -1  1 -1  0] (Indices: [3, 4, 6, 7, 8, 10, 11, 12, 13, 16, 18]), Candidate: [2 1 2 0 0 2 1 0 0 2 0 1 1 0 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 158900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0 -1  1  0 -1  0  1  0 -1  0  1  0 -1] (Indices: [3, 4, 6, 7, 8, 10, 11, 14, 15, 18, 19]), Candidate: [2 1 2 0 0 2 1 0 0 2 0 0 1 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 158950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0 -1  1 -1  0  1  0  0 -1  0  1  0 -1] (Indices: [3, 4, 6, 7, 8, 10, 13, 14, 15, 18, 19]), Candidate: [ 2  1  2  0  0  2  1  0  0  2 -1  1  2  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 159000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0 -1  0  1  0 -1  0  0  1  0  0  0 -1] (Indices: [3, 4, 6, 7, 8, 11, 12, 16, 17, 18, 19]), Candidate: [2 1 2 0 0 2 1 0 0 1 1 1 0 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 159050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  1  0  0  0  0  0  0 -1  0  0  0  0] (Indices: [3, 4, 6, 7, 9, 10, 11, 12, 13, 14, 15]), Candidate: [ 2  1  2  0  0  2  1 -1  2  1  0  1  1  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 159100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  1  0  0 -1  1 -1  1 -1  0  1  0 -1] (Indices: [3, 4, 6, 7, 9, 10, 11, 13, 15, 18, 19]), Candidate: [ 2  1  2  0  0  2  1 -1  2  1  0  0  2  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 159150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  1  0 -1  1 -1  0  1  0  0  0 -1  0] (Indices: [3, 4, 6, 7, 9, 10, 12, 15, 16, 17, 18]), Candidate: [ 2  1  2  0  0  2  1 -1  2  1 -1  2  0  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 159200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  1 -1  1  0 -1  1  0 -1  1 -1  1 -1] (Indices: [3, 4, 6, 7, 9, 11, 12, 14, 15, 17, 19]), Candidate: [ 2  1  2  0  0  2  1 -1  2  0  1  1  0  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 159250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  1 -1  0  1 -1  1  0 -1  1  0  0 -1] (Indices: [3, 4, 6, 7, 9, 12, 14, 15, 17, 18, 19]), Candidate: [ 2  1  2  0  0  2  1 -1  2  0  0  2  0  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 159300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  0  1  0 -1  1  0  0 -1  0  1  0 -1] (Indices: [3, 4, 6, 7, 10, 11, 13, 14, 15, 18, 19]), Candidate: [ 2  1  2  0  0  2  1 -1  1  2  0  0  2  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 159350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  0  0  1  0  0  0 -1  1  0  0 -1  0] (Indices: [3, 4, 6, 7, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 2  1  2  0  0  2  1 -1  1  1  1  1  1  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 159400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1  0  0  0  0 -1  1 -1  1 -1  1 -1  0] (Indices: [3, 4, 6, 8, 9, 10, 11, 12, 14, 16, 18]), Candidate: [ 2  1  2  0  0  2  0  1  1  1  0  1  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 159450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1  0  0 -1  1  0  0  0  0 -1  0  0  0] (Indices: [3, 4, 6, 8, 9, 10, 12, 13, 14, 15, 16]), Candidate: [ 2  1  2  0  0  2  0  1  1  1 -1  2  1  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 159500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1  0  0 -1  0  0  1  0  0  0  0 -1  0] (Indices: [3, 4, 6, 8, 9, 10, 14, 15, 16, 17, 18]), Candidate: [ 2  1  2  0  0  2  0  1  1  1 -1  1  1  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 159550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1  0 -1  1 -1  1  0 -1  0  1  0  0 -1] (Indices: [3, 4, 6, 8, 9, 11, 13, 14, 17, 18, 19]), Candidate: [ 2  1  2  0  0  2  0  1  1  0  1  0  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 159600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1 -1  1  0  0  0 -1  1  0  0 -1  0  0] (Indices: [3, 4, 6, 8, 10, 11, 12, 13, 15, 16, 17]), Candidate: [2 1 2 0 0 2 0 1 0 2 0 1 1 0 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 159650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1 -1  1 -1  1  0  0  0 -1  1 -1  1 -1] (Indices: [3, 4, 6, 8, 10, 12, 13, 14, 15, 17, 19]), Candidate: [ 2  1  2  0  0  2  0  1  0  2 -1  2  1  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 159700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1 -1  0  1 -1  1 -1  1  0  0  0  0 -1] (Indices: [3, 4, 6, 8, 11, 13, 15, 16, 17, 18, 19]), Candidate: [2 1 2 0 0 2 0 1 0 1 1 0 2 0 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 159750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  1  0  0 -1  1  0  0 -1  0  1  0 -1] (Indices: [3, 4, 6, 9, 10, 11, 13, 14, 15, 18, 19]), Candidate: [2 1 2 0 0 2 0 0 2 1 0 0 2 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 159800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  1 -1  1  0  0  0 -1  1  0  0 -1  0] (Indices: [3, 4, 6, 9, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 2  1  2  0  0  2  0  0  2  0  1  1  1  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 159850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  0  1  0  0 -1  0  1  0  0  0  0 -1] (Indices: [3, 4, 6, 10, 11, 12, 15, 16, 17, 18, 19]), Candidate: [2 1 2 0 0 2 0 0 1 2 0 1 0 1 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 159900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0  0  0  0  0 -1  0  1  0  0 -1  0  0] (Indices: [3, 4, 7, 8, 9, 10, 11, 12, 15, 16, 17]), Candidate: [2 1 2 0 0 1 2 0 1 1 0 1 0 1 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 159950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0  0  0 -1  1  0  0 -1  1 -1  1 -1  0] (Indices: [3, 4, 7, 8, 9, 10, 12, 13, 14, 16, 18]), Candidate: [ 2  1  2  0  0  1  2  0  1  1 -1  2  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 160000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0  0  0 -1  0  0  0  1  0  0  0  0 -1] (Indices: [3, 4, 7, 8, 9, 10, 15, 16, 17, 18, 19]), Candidate: [ 2  1  2  0  0  1  2  0  1  1 -1  1  1  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 160050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0  0 -1  1 -1  1 -1  0  1  0  0  0 -1] (Indices: [3, 4, 7, 8, 9, 11, 13, 16, 17, 18, 19]), Candidate: [2 1 2 0 0 1 2 0 1 0 1 0 2 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 160100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0 -1  1  0  0  0 -1  1 -1  0  1  0 -1] (Indices: [3, 4, 7, 8, 10, 11, 12, 13, 15, 18, 19]), Candidate: [2 1 2 0 0 1 2 0 0 2 0 1 1 0 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 160150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0 -1  1 -1  1  0  0 -1  0  1  0  0 -1] (Indices: [3, 4, 7, 8, 10, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  1  2  0  0  1  2  0  0  2 -1  2  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 160200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0 -1  0  0  1  0  0  0 -1  1  0  0 -1] (Indices: [3, 4, 7, 8, 12, 13, 14, 15, 17, 18, 19]), Candidate: [2 1 2 0 0 1 2 0 0 1 0 2 1 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 160250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  1  0  0 -1  1 -1  1  0  0  0 -1  0] (Indices: [3, 4, 7, 9, 10, 11, 13, 15, 16, 17, 18]), Candidate: [ 2  1  2  0  0  1  2 -1  2  1  0  0  2  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 160300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  1 -1  1  0  0 -1  1  0  0 -1  1 -1] (Indices: [3, 4, 7, 9, 11, 12, 13, 15, 16, 17, 19]), Candidate: [ 2  1  2  0  0  1  2 -1  2  0  1  1  1  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 160350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  0  1  0 -1  1  0 -1  1  0  0  0 -1] (Indices: [3, 4, 7, 10, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  2  0  0  1  2 -1  1  2  0  0  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 160400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1  0  0  0  0 -1  0  1  0  0  0 -1  0] (Indices: [3, 4, 8, 9, 10, 11, 12, 15, 16, 17, 18]), Candidate: [2 1 2 0 0 1 1 1 1 1 0 1 0 1 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 160450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1  0  0 -1  0  1  0  0 -1  1  0  0 -1] (Indices: [3, 4, 8, 9, 10, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  1  2  0  0  1  1  1  1  1 -1  1  2  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 160500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1 -1  1  0  0  0 -1  1  0  0  0 -1  0] (Indices: [3, 4, 8, 10, 11, 12, 13, 15, 16, 17, 18]), Candidate: [2 1 2 0 0 1 1 1 0 2 0 1 1 0 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 160550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  0  1  0  0  0 -1  1  0  0  0  0 -1  0] (Indices: [3, 4, 9, 10, 11, 12, 14, 15, 16, 17, 18]), Candidate: [2 1 2 0 0 1 1 0 2 1 0 1 0 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 160600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0  0  0  0  0 -1  1 -1  0  0  0  1 -1] (Indices: [3, 5, 6, 7, 8, 9, 10, 11, 12, 14, 19]), Candidate: [ 2  1  2 -1  2  1  1  0  1  1  0  1  0  2 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 160650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0  0  0 -1  1  0  0 -1  0  0  0  1 -1] (Indices: [3, 5, 6, 7, 8, 9, 10, 12, 13, 14, 19]), Candidate: [ 2  1  2 -1  2  1  1  0  1  1 -1  2  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 160700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0  0  0 -1  0  1 -1  0  0  1  0  0 -1] (Indices: [3, 5, 6, 7, 8, 9, 10, 13, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  1  1  0  1  1 -1  1  2  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 160750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0  0 -1  1  0 -1  0  0  0  1  0  0 -1] (Indices: [3, 5, 6, 7, 8, 9, 11, 12, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  1  1  0  1  0  1  1  0  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 160800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0  0 -1  0  1  0 -1  1 -1  1 -1  1 -1] (Indices: [3, 5, 6, 7, 8, 9, 12, 13, 15, 17, 19]), Candidate: [ 2  1  2 -1  2  1  1  0  1  0  0  2  1  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 160850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0 -1  1  0  0  0 -1  1 -1  0  0  1 -1] (Indices: [3, 5, 6, 7, 8, 10, 11, 12, 13, 15, 19]), Candidate: [ 2  1  2 -1  2  1  1  0  0  2  0  1  1  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 160900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0 -1  1  0 -1  0  1  0 -1  1  0 -1  0] (Indices: [3, 5, 6, 7, 8, 10, 11, 14, 15, 17, 18]), Candidate: [ 2  1  2 -1  2  1  1  0  0  2  0  0  1  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 160950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0 -1  1 -1  0  1  0  0 -1  1  0 -1  0] (Indices: [3, 5, 6, 7, 8, 10, 13, 14, 15, 17, 18]), Candidate: [ 2  1  2 -1  2  1  1  0  0  2 -1  1  2  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 161000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0 -1  0  1  0 -1  0  1  0 -1  1  0 -1] (Indices: [3, 5, 6, 7, 8, 11, 12, 15, 16, 18, 19]), Candidate: [ 2  1  2 -1  2  1  1  0  0  1  1  1  0  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 161050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0 -1  0  0  0  1 -1  1  0  0  0  0 -1] (Indices: [3, 5, 6, 7, 8, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  1  1  0  0  1  0  1  2  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 161100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  1  0  0 -1  1 -1  1 -1  1  0 -1  0] (Indices: [3, 5, 6, 7, 9, 10, 11, 13, 15, 17, 18]), Candidate: [ 2  1  2 -1  2  1  1 -1  2  1  0  0  2  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 161150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  1  0 -1  1 -1  1 -1  1 -1  1  0 -1] (Indices: [3, 5, 6, 7, 9, 10, 12, 14, 16, 18, 19]), Candidate: [ 2  1  2 -1  2  1  1 -1  2  1 -1  2  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 161200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  1 -1  1  0 -1  1  0  0 -1  0  1 -1] (Indices: [3, 5, 6, 7, 9, 11, 12, 14, 15, 16, 19]), Candidate: [ 2  1  2 -1  2  1  1 -1  2  0  1  1  0  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 161250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  1 -1  0  1 -1  1  0  0  0 -1  1 -1] (Indices: [3, 5, 6, 7, 9, 12, 14, 15, 16, 17, 19]), Candidate: [ 2  1  2 -1  2  1  1 -1  2  0  0  2  0  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 161300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  0  1  0 -1  1  0  0 -1  1  0 -1  0] (Indices: [3, 5, 6, 7, 10, 11, 13, 14, 15, 17, 18]), Candidate: [ 2  1  2 -1  2  1  1 -1  1  2  0  0  2  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 161350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  0  0  1  0  0  0  0 -1  1 -1  1 -1] (Indices: [3, 5, 6, 7, 11, 12, 13, 14, 15, 17, 19]), Candidate: [ 2  1  2 -1  2  1  1 -1  1  1  1  1  1  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 161400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1  0  0  0  0 -1  1  0 -1  0  0  1 -1] (Indices: [3, 5, 6, 8, 9, 10, 11, 12, 14, 15, 19]), Candidate: [ 2  1  2 -1  2  1  0  1  1  1  0  1  0  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 161450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1  0  0  0 -1  0  0  1 -1  1  0  0 -1] (Indices: [3, 5, 6, 8, 9, 10, 11, 15, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  1  0  1  1  1  0  0  1  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 161500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1  0  0 -1  0  1 -1  1 -1  1  0  0 -1] (Indices: [3, 5, 6, 8, 9, 10, 13, 15, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  1  0  1  1  1 -1  1  2  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 161550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1  0 -1  1 -1  1  0 -1  1  0 -1  1 -1] (Indices: [3, 5, 6, 8, 9, 11, 13, 14, 16, 17, 19]), Candidate: [ 2  1  2 -1  2  1  0  1  1  0  1  0  2  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 161600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1 -1  1  0  0  0  0 -1  0  1 -1  1 -1] (Indices: [3, 5, 6, 8, 10, 11, 12, 13, 14, 17, 19]), Candidate: [ 2  1  2 -1  2  1  0  1  0  2  0  1  1  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 161650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1 -1  1 -1  1  0  0  0  0 -1  0  1 -1] (Indices: [3, 5, 6, 8, 10, 12, 13, 14, 15, 16, 19]), Candidate: [ 2  1  2 -1  2  1  0  1  0  2 -1  2  1  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 161700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1 -1  0  1 -1  1  0  0 -1  1  0  0 -1] (Indices: [3, 5, 6, 8, 11, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  1  0  1  0  1  1  0  2  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 161750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  1  0  0 -1  1  0  0 -1  1  0 -1  0] (Indices: [3, 5, 6, 9, 10, 11, 13, 14, 15, 17, 18]), Candidate: [ 2  1  2 -1  2  1  0  0  2  1  0  0  2  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 161800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  1 -1  1  0  0  0  0 -1  1 -1  1 -1] (Indices: [3, 5, 6, 9, 11, 12, 13, 14, 15, 17, 19]), Candidate: [ 2  1  2 -1  2  1  0  0  2  0  1  1  1  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 161850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  0  1  0  0 -1  1  0 -1  1  0  0 -1] (Indices: [3, 5, 6, 10, 11, 12, 14, 15, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  1  0  0  1  2  0  1  0  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 161900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0  0  0  0  0 -1  1 -1  0  1 -1  1 -1] (Indices: [3, 5, 7, 8, 9, 10, 11, 12, 14, 17, 19]), Candidate: [ 2  1  2 -1  2  0  2  0  1  1  0  1  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 161950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0  0  0 -1  1  0  0  0 -1  0  0  1 -1] (Indices: [3, 5, 7, 8, 9, 10, 12, 13, 14, 15, 19]), Candidate: [ 2  1  2 -1  2  0  2  0  1  1 -1  2  1  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 162000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0  0  0 -1  0  0  1  0 -1  1  0  0 -1] (Indices: [3, 5, 7, 8, 9, 10, 14, 15, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  0  2  0  1  1 -1  1  1  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 162050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0  0 -1  1 -1  1 -1  1  0 -1  1  0 -1] (Indices: [3, 5, 7, 8, 9, 11, 13, 15, 16, 18, 19]), Candidate: [ 2  1  2 -1  2  0  2  0  1  0  1  0  2  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 162100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0 -1  1  0  0  0 -1  1 -1  1  0 -1  0] (Indices: [3, 5, 7, 8, 10, 11, 12, 13, 15, 17, 18]), Candidate: [ 2  1  2 -1  2  0  2  0  0  2  0  1  1  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 162150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0 -1  1 -1  1  0  0 -1  1  0 -1  1 -1] (Indices: [3, 5, 7, 8, 10, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  1  2 -1  2  0  2  0  0  2 -1  2  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 162200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0 -1  0  0  1  0  0  0  0  0 -1  1 -1] (Indices: [3, 5, 7, 8, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  1  2 -1  2  0  2  0  0  1  0  2  1  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 162250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  1  0  0 -1  1  0 -1  1 -1  1  0 -1] (Indices: [3, 5, 7, 9, 10, 11, 13, 14, 16, 18, 19]), Candidate: [ 2  1  2 -1  2  0  2 -1  2  1  0  0  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 162300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  1 -1  1  0  0  0 -1  0  1  0  0 -1] (Indices: [3, 5, 7, 9, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  0  2 -1  2  0  1  1  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 162350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  0  1  0 -1  1  0  0  0 -1  1  0 -1] (Indices: [3, 5, 7, 10, 11, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  1  2 -1  2  0  2 -1  1  2  0  0  2  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 162400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1  0  0  0  0 -1  1 -1  1 -1  1  0 -1] (Indices: [3, 5, 8, 9, 10, 11, 12, 14, 16, 18, 19]), Candidate: [ 2  1  2 -1  2  0  1  1  1  1  0  1  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 162450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1  0  0 -1  0  1  0  0  0  0 -1  1 -1] (Indices: [3, 5, 8, 9, 10, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  1  2 -1  2  0  1  1  1  1 -1  1  2  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 162500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1 -1  1  0  0  0  0 -1  1 -1  1  0 -1] (Indices: [3, 5, 8, 10, 11, 12, 13, 14, 16, 18, 19]), Candidate: [ 2  1  2 -1  2  0  1  1  0  2  0  1  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 162550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  0  1  0  0  0  0 -1  1 -1  1  0  0 -1] (Indices: [3, 5, 9, 10, 11, 12, 13, 15, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  0  1  0  2  1  0  1  1  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 162600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0  0  0  0  0  0 -1  1 -1  0  0  1 -1] (Indices: [3, 6, 7, 8, 9, 10, 11, 12, 13, 15, 19]), Candidate: [ 2  1  2 -1  1  2  1  0  1  1  0  1  1  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 162650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0  0  0  0 -1  0  1  0 -1  1  0 -1  0] (Indices: [3, 6, 7, 8, 9, 10, 11, 14, 15, 17, 18]), Candidate: [ 2  1  2 -1  1  2  1  0  1  1  0  0  1  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 162700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0  0  0 -1  0  1  0  0 -1  1  0 -1  0] (Indices: [3, 6, 7, 8, 9, 10, 13, 14, 15, 17, 18]), Candidate: [ 2  1  2 -1  1  2  1  0  1  1 -1  1  2  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 162750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0  0 -1  1  0 -1  0  1  0 -1  1  0 -1] (Indices: [3, 6, 7, 8, 9, 11, 12, 15, 16, 18, 19]), Candidate: [ 2  1  2 -1  1  2  1  0  1  0  1  1  0  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 162800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0  0 -1  0  0  1 -1  1  0  0  0  0 -1] (Indices: [3, 6, 7, 8, 9, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  2  1  0  1  0  0  1  2  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 162850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0 -1  1  0 -1  1 -1  1 -1  1  0  0 -1] (Indices: [3, 6, 7, 8, 10, 11, 13, 15, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  2  1  0  0  2  0  0  2  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 162900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0 -1  0  1  0  0 -1  0  1  0  0  0 -1] (Indices: [3, 6, 7, 8, 11, 12, 13, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  2  1  0  0  1  1  1  1  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 162950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  1  0  0  0 -1  1 -1  1 -1  1  0 -1] (Indices: [3, 6, 7, 9, 10, 11, 12, 14, 16, 18, 19]), Candidate: [ 2  1  2 -1  1  2  1 -1  2  1  0  1  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 163000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  1  0 -1  0  1  0  0  0  0 -1  1 -1] (Indices: [3, 6, 7, 9, 10, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  1  2 -1  1  2  1 -1  2  1 -1  1  2  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 163050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  0  1  0  0  0  0 -1  1 -1  1  0 -1] (Indices: [3, 6, 7, 10, 11, 12, 13, 14, 16, 18, 19]), Candidate: [ 2  1  2 -1  1  2  1 -1  1  2  0  1  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 163100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1  0  0  0  0  0 -1  1 -1  1  0 -1  0] (Indices: [3, 6, 8, 9, 10, 11, 12, 13, 15, 17, 18]), Candidate: [ 2  1  2 -1  1  2  0  1  1  1  0  1  1  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 163150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1  0  0 -1  1  0  0 -1  1  0 -1  1 -1] (Indices: [3, 6, 8, 9, 10, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  1  2 -1  1  2  0  1  1  1 -1  2  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 163200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1  0 -1  0  1  0  0  0  0  0 -1  1 -1] (Indices: [3, 6, 8, 9, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  1  2 -1  1  2  0  1  1  0  0  2  1  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 163250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1 -1  0  1 -1  1  0  0  0  0  0  0 -1] (Indices: [3, 6, 8, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  2  0  1  0  1  1  0  2  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 163300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  0  0  1  0  0  0  0  0 -1  1  0  0 -1] (Indices: [3, 6, 10, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  2  0  0  1  2  0  1  1  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 163350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0  0  0  0 -1  1  0 -1  1 -1  1  0 -1] (Indices: [3, 7, 8, 9, 10, 11, 13, 14, 16, 18, 19]), Candidate: [ 2  1  2 -1  1  1  2  0  1  1  0  0  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 163400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0  0 -1  1  0  0  0 -1  0  1  0  0 -1] (Indices: [3, 7, 8, 9, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  1  2  0  1  0  1  1  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 163450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0 -1  1  0 -1  1  0  0  0 -1  1  0 -1] (Indices: [3, 7, 8, 10, 11, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  1  2 -1  1  1  2  0  0  2  0  0  2  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 163500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1 -1  1  0 -1  1  0  0  0  0  0  0 -1  0] (Indices: [3, 7, 9, 10, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  1  2 -1  1  1  2 -1  2  1 -1  2  1  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 163550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  1  0  0  0 -1  1  0  0  0 -1  1  0 -1] (Indices: [3, 8, 9, 10, 11, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  1  2 -1  1  1  1  1  1  1  0  0  2  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 163600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0  0  0  0  0 -1  1 -1  1 -1  0  0  0] (Indices: [4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 16]), Candidate: [ 2  1  1  1  1  1  1  0  1  1  0  1  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 163650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0  0  0 -1  1  0  0 -1  1 -1  0  0  0] (Indices: [4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 16]), Candidate: [ 2  1  1  1  1  1  1  0  1  1 -1  2  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 163700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0  0  0 -1  0  1 -1  0  1  0  0 -1  0] (Indices: [4, 5, 6, 7, 8, 9, 10, 13, 16, 17, 18]), Candidate: [ 2  1  1  1  1  1  1  0  1  1 -1  1  2  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 163750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0  0 -1  1  0 -1  0  0  1  0  0 -1  0] (Indices: [4, 5, 6, 7, 8, 9, 11, 12, 16, 17, 18]), Candidate: [2 1 1 1 1 1 1 0 1 0 1 1 0 1 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 163800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0  0 -1  0  1  0 -1  1  0 -1  1 -1  0] (Indices: [4, 5, 6, 7, 8, 9, 12, 13, 15, 16, 18]), Candidate: [2 1 1 1 1 1 1 0 1 0 0 2 1 0 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 163850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0 -1  1  0  0  0 -1  1  0 -1  0  0  0] (Indices: [4, 5, 6, 7, 8, 10, 11, 12, 13, 15, 16]), Candidate: [2 1 1 1 1 1 1 0 0 2 0 1 1 0 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 163900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0 -1  1  0 -1  0  1  0  0  0 -1  0  0] (Indices: [4, 5, 6, 7, 8, 10, 11, 14, 15, 16, 17]), Candidate: [2 1 1 1 1 1 1 0 0 2 0 0 1 2 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 163950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0 -1  1 -1  0  1  0  0  0  0 -1  0  0] (Indices: [4, 5, 6, 7, 8, 10, 13, 14, 15, 16, 17]), Candidate: [ 2  1  1  1  1  1  1  0  0  2 -1  1  2  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 164000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0 -1  0  1  0 -1  1 -1  0  1  0  0 -1] (Indices: [4, 5, 6, 7, 8, 11, 12, 14, 17, 18, 19]), Candidate: [ 2  1  1  1  1  1  1  0  0  1  1  1  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 164050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0 -1  0  0  0  1  0  0  0 -1  1  0 -1] (Indices: [4, 5, 6, 7, 8, 13, 14, 15, 16, 18, 19]), Candidate: [2 1 1 1 1 1 1 0 0 1 0 1 2 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 164100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  1  0  0 -1  1 -1  1  0  0 -1  0  0] (Indices: [4, 5, 6, 7, 9, 10, 11, 13, 15, 16, 17]), Candidate: [ 2  1  1  1  1  1  1 -1  2  1  0  0  2  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 164150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  1  0 -1  1 -1  1  0 -1  0  1  0 -1] (Indices: [4, 5, 6, 7, 9, 10, 12, 14, 15, 18, 19]), Candidate: [ 2  1  1  1  1  1  1 -1  2  1 -1  2  0  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 164200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  1 -1  1  0  0 -1  0  0  1  0  0 -1] (Indices: [4, 5, 6, 7, 9, 11, 12, 13, 17, 18, 19]), Candidate: [ 2  1  1  1  1  1  1 -1  2  0  1  1  1  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 164250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  1 -1  0  1  0 -1  1 -1  1  0  0 -1] (Indices: [4, 5, 6, 7, 9, 12, 13, 15, 17, 18, 19]), Candidate: [ 2  1  1  1  1  1  1 -1  2  0  0  2  1  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 164300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  0  1  0 -1  1  0  0  0  0 -1  0  0] (Indices: [4, 5, 6, 7, 10, 11, 13, 14, 15, 16, 17]), Candidate: [ 2  1  1  1  1  1  1 -1  1  2  0  0  2  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 164350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  0  0  1  0  0  0  0  0 -1  1 -1  0] (Indices: [4, 5, 6, 7, 11, 12, 13, 14, 15, 16, 18]), Candidate: [ 2  1  1  1  1  1  1 -1  1  1  1  1  1  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 164400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1  0  0  0  0 -1  1  0  0 -1  0  0  0] (Indices: [4, 5, 6, 8, 9, 10, 11, 12, 14, 15, 16]), Candidate: [2 1 1 1 1 1 0 1 1 1 0 1 0 2 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 164450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1  0  0  0 -1  0  0  1  0  0  0 -1  0] (Indices: [4, 5, 6, 8, 9, 10, 11, 15, 16, 17, 18]), Candidate: [2 1 1 1 1 1 0 1 1 1 0 0 1 1 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 164500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1  0  0 -1  0  1 -1  1  0  0  0 -1  0] (Indices: [4, 5, 6, 8, 9, 10, 13, 15, 16, 17, 18]), Candidate: [ 2  1  1  1  1  1  0  1  1  1 -1  1  2  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 164550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1  0 -1  1 -1  1  0  0 -1  1 -1  1 -1] (Indices: [4, 5, 6, 8, 9, 11, 13, 14, 15, 17, 19]), Candidate: [2 1 1 1 1 1 0 1 1 0 1 0 2 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 164600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1 -1  1  0  0  0  0 -1  1 -1  1 -1  0] (Indices: [4, 5, 6, 8, 10, 11, 12, 13, 14, 16, 18]), Candidate: [ 2  1  1  1  1  1  0  1  0  2  0  1  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 164650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1 -1  1  0 -1  0  0  1  0  0  0  0 -1] (Indices: [4, 5, 6, 8, 10, 11, 15, 16, 17, 18, 19]), Candidate: [2 1 1 1 1 1 0 1 0 2 0 0 1 1 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 164700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1 -1  0  1 -1  1  0  0  0  0  0 -1  0] (Indices: [4, 5, 6, 8, 11, 13, 14, 15, 16, 17, 18]), Candidate: [2 1 1 1 1 1 0 1 0 1 1 0 2 1 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 164750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  1  0  0 -1  1  0  0  0  0 -1  0  0] (Indices: [4, 5, 6, 9, 10, 11, 13, 14, 15, 16, 17]), Candidate: [2 1 1 1 1 1 0 0 2 1 0 0 2 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 164800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  1 -1  1  0  0  0  0  0 -1  1 -1  0] (Indices: [4, 5, 6, 9, 11, 12, 13, 14, 15, 16, 18]), Candidate: [2 1 1 1 1 1 0 0 2 0 1 1 1 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 164850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  0  1  0  0 -1  1  0  0  0  0 -1  0] (Indices: [4, 5, 6, 10, 11, 12, 14, 15, 16, 17, 18]), Candidate: [2 1 1 1 1 1 0 0 1 2 0 1 0 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 164900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0  0  0  0  0 -1  1 -1  1 -1  1 -1  0] (Indices: [4, 5, 7, 8, 9, 10, 11, 12, 14, 16, 18]), Candidate: [ 2  1  1  1  1  0  2  0  1  1  0  1  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 164950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0  0  0 -1  1  0  0  0  0 -1  0  0  0] (Indices: [4, 5, 7, 8, 9, 10, 12, 13, 14, 15, 16]), Candidate: [ 2  1  1  1  1  0  2  0  1  1 -1  2  1  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 165000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0  0  0 -1  0  0  1  0  0  0  0 -1  0] (Indices: [4, 5, 7, 8, 9, 10, 14, 15, 16, 17, 18]), Candidate: [ 2  1  1  1  1  0  2  0  1  1 -1  1  1  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 165050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0  0 -1  1 -1  1  0 -1  0  1  0  0 -1] (Indices: [4, 5, 7, 8, 9, 11, 13, 14, 17, 18, 19]), Candidate: [ 2  1  1  1  1  0  2  0  1  0  1  0  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 165100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0 -1  1  0  0  0 -1  1  0  0 -1  0  0] (Indices: [4, 5, 7, 8, 10, 11, 12, 13, 15, 16, 17]), Candidate: [2 1 1 1 1 0 2 0 0 2 0 1 1 0 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 165150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0 -1  1 -1  1  0  0  0 -1  1 -1  1 -1] (Indices: [4, 5, 7, 8, 10, 12, 13, 14, 15, 17, 19]), Candidate: [ 2  1  1  1  1  0  2  0  0  2 -1  2  1  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 165200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0 -1  0  1 -1  1 -1  1  0  0  0  0 -1] (Indices: [4, 5, 7, 8, 11, 13, 15, 16, 17, 18, 19]), Candidate: [2 1 1 1 1 0 2 0 0 1 1 0 2 0 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 165250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  1  0  0 -1  1  0  0 -1  0  1  0 -1] (Indices: [4, 5, 7, 9, 10, 11, 13, 14, 15, 18, 19]), Candidate: [ 2  1  1  1  1  0  2 -1  2  1  0  0  2  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 165300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  1 -1  1  0  0  0 -1  1  0  0 -1  0] (Indices: [4, 5, 7, 9, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 2  1  1  1  1  0  2 -1  2  0  1  1  1  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 165350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  0  1  0  0 -1  0  1  0  0  0  0 -1] (Indices: [4, 5, 7, 10, 11, 12, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1  1  1  0  2 -1  1  2  0  1  0  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 165400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1  0  0  0  0 -1  1  0 -1  0  1  0 -1] (Indices: [4, 5, 8, 9, 10, 11, 12, 14, 15, 18, 19]), Candidate: [2 1 1 1 1 0 1 1 1 1 0 1 0 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 165450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1  0  0 -1  1 -1  1 -1  1  0  0  0 -1] (Indices: [4, 5, 8, 9, 10, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  1  1  0  1  1  1  1 -1  2  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 165500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1 -1  1  0  0  0  0  0 -1  0  1  0 -1] (Indices: [4, 5, 8, 10, 11, 12, 13, 14, 15, 18, 19]), Candidate: [2 1 1 1 1 0 1 1 0 2 0 1 1 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 165550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  1  0  0  0  0 -1  1  0  0  0 -1  0] (Indices: [4, 5, 9, 10, 11, 12, 13, 15, 16, 17, 18]), Candidate: [2 1 1 1 1 0 1 0 2 1 0 1 1 0 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 165600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0  0  0  0  0  0 -1  1  0 -1  0  0  0] (Indices: [4, 6, 7, 8, 9, 10, 11, 12, 13, 15, 16]), Candidate: [2 1 1 1 0 2 1 0 1 1 0 1 1 0 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 165650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0  0  0  0 -1  0  1  0  0  0 -1  0  0] (Indices: [4, 6, 7, 8, 9, 10, 11, 14, 15, 16, 17]), Candidate: [2 1 1 1 0 2 1 0 1 1 0 0 1 2 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 165700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0  0  0 -1  0  1  0  0  0  0 -1  0  0] (Indices: [4, 6, 7, 8, 9, 10, 13, 14, 15, 16, 17]), Candidate: [ 2  1  1  1  0  2  1  0  1  1 -1  1  2  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 165750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0  0 -1  1  0 -1  1 -1  0  1  0  0 -1] (Indices: [4, 6, 7, 8, 9, 11, 12, 14, 17, 18, 19]), Candidate: [ 2  1  1  1  0  2  1  0  1  0  1  1  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 165800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0  0 -1  0  0  1  0  0  0 -1  1  0 -1] (Indices: [4, 6, 7, 8, 9, 13, 14, 15, 16, 18, 19]), Candidate: [2 1 1 1 0 2 1 0 1 0 0 1 2 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 165850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0 -1  1  0 -1  1 -1  1  0  0  0 -1  0] (Indices: [4, 6, 7, 8, 10, 11, 13, 15, 16, 17, 18]), Candidate: [2 1 1 1 0 2 1 0 0 2 0 0 2 0 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 165900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0 -1  0  1  0  0 -1  1  0  0 -1  1 -1] (Indices: [4, 6, 7, 8, 11, 12, 13, 15, 16, 17, 19]), Candidate: [2 1 1 1 0 2 1 0 0 1 1 1 1 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 165950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  1  0  0  0 -1  1  0 -1  0  1  0 -1] (Indices: [4, 6, 7, 9, 10, 11, 12, 14, 15, 18, 19]), Candidate: [ 2  1  1  1  0  2  1 -1  2  1  0  1  0  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 166000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  1  0 -1  1 -1  1 -1  1  0  0  0 -1] (Indices: [4, 6, 7, 9, 10, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  1  0  2  1 -1  2  1 -1  2  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 166050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  0  1  0  0  0  0  0 -1  0  1  0 -1] (Indices: [4, 6, 7, 10, 11, 12, 13, 14, 15, 18, 19]), Candidate: [ 2  1  1  1  0  2  1 -1  1  2  0  1  1  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 166100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1  0  0  0  0  0 -1  1  0  0 -1  0  0] (Indices: [4, 6, 8, 9, 10, 11, 12, 13, 15, 16, 17]), Candidate: [2 1 1 1 0 2 0 1 1 1 0 1 1 0 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 166150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1  0  0 -1  1  0  0  0 -1  1 -1  1 -1] (Indices: [4, 6, 8, 9, 10, 12, 13, 14, 15, 17, 19]), Candidate: [ 2  1  1  1  0  2  0  1  1  1 -1  2  1  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 166200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1  0 -1  1 -1  1 -1  1  0  0  0  0 -1] (Indices: [4, 6, 8, 9, 11, 13, 15, 16, 17, 18, 19]), Candidate: [2 1 1 1 0 2 0 1 1 0 1 0 2 0 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 166250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1 -1  0  1  0  0  0 -1  1  0  0  0 -1] (Indices: [4, 6, 8, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  1  0  2  0  1  0  1  1  1  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 166300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  0  0  1  0  0  0  0  0  0  0  0 -1  0] (Indices: [4, 6, 10, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [2 1 1 1 0 2 0 0 1 2 0 1 1 1 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 166350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0  0  0  0 -1  1  0  0 -1  0  1  0 -1] (Indices: [4, 7, 8, 9, 10, 11, 13, 14, 15, 18, 19]), Candidate: [2 1 1 1 0 1 2 0 1 1 0 0 2 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 166400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0  0 -1  1  0  0  0 -1  1  0  0 -1  0] (Indices: [4, 7, 8, 9, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 2  1  1  1  0  1  2  0  1  0  1  1  1  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 166450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0 -1  1  0  0 -1  0  1  0  0  0  0 -1] (Indices: [4, 7, 8, 10, 11, 12, 15, 16, 17, 18, 19]), Candidate: [2 1 1 1 0 1 2 0 0 2 0 1 0 1 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 166500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  1  0  0 -1  1  0 -1  1  0  0  0 -1] (Indices: [4, 7, 9, 10, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  1  0  1  2 -1  2  1  0  0  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 166550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  0  1  0  0  0  0 -1  0  1  0  0  0  0 -1] (Indices: [4, 8, 9, 10, 11, 12, 15, 16, 17, 18, 19]), Candidate: [2 1 1 1 0 1 1 1 1 1 0 1 0 1 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 166600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0  0  0  0  0  0  0 -1  0  0  0  1 -1] (Indices: [5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 19]), Candidate: [ 2  1  1  0  2  1  1  0  1  1  0  1  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 166650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0  0  0  0 -1  1 -1  0  0  1  0  0 -1] (Indices: [5, 6, 7, 8, 9, 10, 11, 13, 17, 18, 19]), Candidate: [2 1 1 0 2 1 1 0 1 1 0 0 2 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 166700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0  0  0 -1  1 -1  0  0  1  0  0  0 -1] (Indices: [5, 6, 7, 8, 9, 10, 12, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  2  1  1  0  1  1 -1  2  0  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 166750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0  0 -1  1  0 -1  1 -1  1 -1  1  0 -1] (Indices: [5, 6, 7, 8, 9, 11, 12, 14, 16, 18, 19]), Candidate: [ 2  1  1  0  2  1  1  0  1  0  1  1  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 166800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0  0 -1  0  0  1  0  0  0  0 -1  1 -1] (Indices: [5, 6, 7, 8, 9, 13, 14, 15, 16, 17, 19]), Candidate: [2 1 1 0 2 1 1 0 1 0 0 1 2 1 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 166850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0 -1  1  0 -1  1  0 -1  0  1  0  0 -1] (Indices: [5, 6, 7, 8, 10, 11, 13, 14, 17, 18, 19]), Candidate: [ 2  1  1  0  2  1  1  0  0  2  0  0  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 166900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0 -1  0  1  0  0 -1  1  0  0  0 -1  0] (Indices: [5, 6, 7, 8, 11, 12, 13, 15, 16, 17, 18]), Candidate: [2 1 1 0 2 1 1 0 0 1 1 1 1 0 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 166950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  1  0  0  0 -1  1  0 -1  1 -1  1 -1] (Indices: [5, 6, 7, 9, 10, 11, 12, 14, 15, 17, 19]), Candidate: [ 2  1  1  0  2  1  1 -1  2  1  0  1  0  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 167000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  1  0 -1  1 -1  1  0 -1  1  0  0 -1] (Indices: [5, 6, 7, 9, 10, 12, 14, 15, 17, 18, 19]), Candidate: [ 2  1  1  0  2  1  1 -1  2  1 -1  2  0  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 167050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  0  1  0  0  0  0  0 -1  1 -1  1 -1] (Indices: [5, 6, 7, 10, 11, 12, 13, 14, 15, 17, 19]), Candidate: [ 2  1  1  0  2  1  1 -1  1  2  0  1  1  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 167100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1  0  0  0  0  0  0 -1  0  0  1  0 -1] (Indices: [5, 6, 8, 9, 10, 11, 12, 13, 14, 18, 19]), Candidate: [ 2  1  1  0  2  1  0  1  1  1  0  1  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 167150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1  0  0 -1  1  0  0  0 -1  1  0 -1  0] (Indices: [5, 6, 8, 9, 10, 12, 13, 14, 15, 17, 18]), Candidate: [ 2  1  1  0  2  1  0  1  1  1 -1  2  1  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 167200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1  0 -1  1 -1  1  0 -1  1  0  0  0 -1] (Indices: [5, 6, 8, 9, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  2  1  0  1  1  0  1  0  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 167250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1 -1  0  1  0  0  0  0 -1  1  0  0 -1] (Indices: [5, 6, 8, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [2 1 1 0 2 1 0 1 0 1 1 1 1 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 167300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  1 -1  0  1  0  0  0  0  0  0  0 -1] (Indices: [5, 6, 9, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 1 1 0 2 1 0 0 2 0 0 2 1 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 167350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0  0  0  0 -1  1  0  0 -1  1 -1  1 -1] (Indices: [5, 7, 8, 9, 10, 11, 13, 14, 15, 17, 19]), Candidate: [2 1 1 0 2 0 2 0 1 1 0 0 2 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 167400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0  0 -1  1  0  0  0  0 -1  0  1  0 -1] (Indices: [5, 7, 8, 9, 11, 12, 13, 14, 15, 18, 19]), Candidate: [2 1 1 0 2 0 2 0 1 0 1 1 1 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 167450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0 -1  1  0  0 -1  1 -1  1  0  0  0 -1] (Indices: [5, 7, 8, 10, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  2  0  2  0  0  2  0  1  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 167500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1 -1  1  0  0 -1  1  0  0 -1  1  0  0 -1] (Indices: [5, 7, 9, 10, 11, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  1  1  0  2  0  2 -1  2  1  0  0  2  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 167550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  0  1  0  0  0  0 -1  1 -1  1  0  0  0 -1] (Indices: [5, 8, 9, 10, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  2  0  1  1  1  1  0  1  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 167600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 -1  0  0  1 -1] (Indices: [6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 19]), Candidate: [2 1 1 0 1 2 1 0 1 1 0 1 1 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 167650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0  0  0  0 -1  0  1  0 -1  1  0  0 -1] (Indices: [6, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19]), Candidate: [2 1 1 0 1 2 1 0 1 1 0 0 1 2 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 167700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0  0 -1  1  0 -1  1 -1  1  0  0  0 -1] (Indices: [6, 7, 8, 9, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  1  2  1  0  1  0  1  1  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 167750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0 -1  1 -1  1  0 -1  1  0  0  0  0 -1] (Indices: [6, 7, 8, 10, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  1  2  1  0  0  2 -1  2  1  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 167800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0 -1  1 -1  1  0  0  0  0  0 -1  1  0 -1] (Indices: [6, 7, 9, 11, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  1  1  0  1  2  1 -1  2  0  1  1  1  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 167850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1  0  0 -1  1  0 -1  1  0  0  0  0 -1] (Indices: [6, 8, 9, 10, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  1  2  0  1  1  1 -1  2  1  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 167900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  1  0  0  0  0  0 -1  1  0  0 -1  1  0 -1] (Indices: [7, 8, 9, 10, 11, 12, 14, 15, 16, 18, 19]), Candidate: [2 1 1 0 1 1 2 0 1 1 0 1 0 2 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 167950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 -1  1 -1] (Indices: [8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [2 1 1 0 1 1 1 1 1 1 0 1 1 1 0 1 1 0 2 5]
 -> Valid neighbor added.
Finished generating neighbors. Total valid neighbors found: 50348
  Size of neighborhood t=11: 50348
  Using 'fork' start method for multiprocessing.
  No improvement found for t=11 after processing 50348 neighbors.
No improving solution found or error occurred for t=11.

Attempting neighborhood t=12 (current best cost: 98.4663)
  Exploring neighborhood t=12 in parallel (current cost: 98.4663)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Attempt 50: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0 -1  1  0 -1  0  0  0  1 -1  0  0  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 16]), Candidate: [2 1 1 0 1 1 1 0 0 2 0 0 1 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0 -1  0  1 -1  0  0  1  0 -1  0  0  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 11, 15, 16]), Candidate: [2 1 1 0 1 1 1 0 0 1 1 0 1 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0 -1  0  0  0  0  1 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 14, 16, 17]), Candidate: [ 2  1  1  0  1  1  1  0  0  1  0  1  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  1  0 -1  0  0  0  0  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 17, 19]), Candidate: [ 2  1  1  0  1  1  1 -1  2  1 -1  1  1  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  1 -1  0  1 -1  0  0  0  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 9, 12, 18, 19]), Candidate: [ 2  1  1  0  1  1  1 -1  2  0  0  2  0  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  0  1  0 -1  0  1 -1  1 -1  0  0  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 10, 11, 14, 16]), Candidate: [ 2  1  1  0  1  1  1 -1  1  2  0  0  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  0  1 -1  0  0  1  0  0 -1  0  0  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 10, 14, 15, 16]), Candidate: [ 2  1  1  0  1  1  1 -1  1  2 -1  1  1  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  0  0  1 -1  1 -1  0  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 11, 13, 16, 17]), Candidate: [ 2  1  1  0  1  1  1 -1  1  1  1  0  2  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  0  0  0  1 -1  1 -1  0  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 12, 14, 18, 19]), Candidate: [ 2  1  1  0  1  1  1 -1  1  1  0  2  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1  0  0  0 -1  0  0  0  1 -1  0  0  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 9, 10, 11, 16]), Candidate: [2 1 1 0 1 1 0 1 1 1 0 0 1 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1  0 -1  1 -1  0  0  1  0 -1  0  0  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 9, 11, 15, 16]), Candidate: [2 1 1 0 1 1 0 1 1 0 1 0 1 1 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1  0 -1  0  0  0  1 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 9, 14, 16, 17]), Candidate: [ 2  1  1  0  1  1  0  1  1  0  0  1  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1 -1  1 -1  1 -1  1  0 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 10, 12, 14, 15]), Candidate: [ 2  1  1  0  1  1  0  1  0  2 -1  2  0  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1 -1  0  1  0  0  0 -1  0  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 11, 12, 13, 14]), Candidate: [ 2  1  1  0  1  1  0  1  0  1  1  1  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1 -1  0  1 -1  0  0  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 11, 15, 17, 19]), Candidate: [2 1 1 0 1 1 0 1 0 1 1 0 1 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1 -1  0  0  0  1  0 -1  0  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 13, 14, 18, 19]), Candidate: [ 2  1  1  0  1  1  0  1  0  1  0  1  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  1  0  0 -1  0  0  0  1 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 9, 10, 11, 16, 19]), Candidate: [2 1 1 0 1 1 0 0 2 1 0 0 1 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  1  0 -1  0  0  0  1  0  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 9, 10, 15, 16, 17]), Candidate: [ 2  1  1  0  1  1  0  0  2  1 -1  1  1  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  1 -1  1 -1  0  1 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 9, 11, 14, 16, 17]), Candidate: [ 2  1  1  0  1  1  0  0  2  0  1  0  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  1 -1  0  1 -1  0  0  0  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 9, 12, 17, 18, 19]), Candidate: [2 1 1 0 1 1 0 0 2 0 0 2 0 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 1050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  0  1  0  0 -1  0  1 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 10, 11, 12, 15, 19]), Candidate: [2 1 1 0 1 1 0 0 1 2 0 1 0 1 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 1100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  0  1 -1  1  0 -1  1 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 10, 12, 13, 15, 19]), Candidate: [ 2  1  1  0  1  1  0  0  1  2 -1  2  1  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  0  1 -1  0  0  1  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 10, 14, 15, 17, 18]), Candidate: [ 2  1  1  0  1  1  0  0  1  2 -1  1  1  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  0  0  1 -1  1  0  0 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 11, 13, 14, 15, 19]), Candidate: [2 1 1 0 1 1 0 0 1 1 1 0 2 1 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 1250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  0  0  0  1  0 -1  0  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 12, 13, 16, 18, 19]), Candidate: [2 1 1 0 1 1 0 0 1 1 0 2 1 0 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 1300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0  0  0 -1  1 -1  0  0  0  1 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 9, 10, 12, 17]), Candidate: [ 2  1  1  0  1  0  2  0  1  1 -1  2  0  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0  0 -1  1 -1  0  0  0  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 9, 11, 17, 19]), Candidate: [2 1 1 0 1 0 2 0 1 0 1 0 1 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 1400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0  0 -1  0  0  0  0  1  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 9, 15, 16, 19]), Candidate: [2 1 1 0 1 0 2 0 1 0 0 1 1 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 1450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0 -1  1 -1  1 -1  0  1 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 10, 12, 15, 19]), Candidate: [ 2  1  1  0  1  0  2  0  0  2 -1  2  0  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0 -1  0  1  0 -1  1 -1  0  1 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 11, 12, 14, 17]), Candidate: [ 2  1  1  0  1  0  2  0  0  1  1  1  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0 -1  0  0  1  0  0 -1  0  1 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 12, 13, 14, 17]), Candidate: [ 2  1  1  0  1  0  2  0  0  1  0  2  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0 -1  0  0  0  1 -1  0  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 13, 16, 17, 19]), Candidate: [2 1 1 0 1 0 2 0 0 1 0 1 2 0 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 1650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  1  0 -1  1  0 -1  0  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 9, 10, 12, 13, 18]), Candidate: [ 2  1  1  0  1  0  2 -1  2  1 -1  2  1  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  1  0 -1  0  0  0  0  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 9, 10, 16, 18, 19]), Candidate: [ 2  1  1  0  1  0  2 -1  2  1 -1  1  1  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  1 -1  1 -1  0  0  1  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 9, 11, 15, 16, 19]), Candidate: [ 2  1  1  0  1  0  2 -1  2  0  1  0  1  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  1 -1  0  0  1  0 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 9, 13, 14, 17, 18]), Candidate: [ 2  1  1  0  1  0  2 -1  2  0  0  1  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  0  1  0 -1  1  0 -1  1 -1  0  0  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 10, 11, 13, 14, 16]), Candidate: [ 2  1  1  0  1  0  2 -1  1  2  0  0  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  0  1 -1  1 -1  1  0 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 10, 12, 14, 15, 17]), Candidate: [ 2  1  1  0  1  0  2 -1  1  2 -1  2  0  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  0  1 -1  0  0  0  1  0  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 10, 15, 16, 17, 19]), Candidate: [ 2  1  1  0  1  0  2 -1  1  2 -1  1  1  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  0  0  1 -1  1 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 11, 13, 15, 16, 18]), Candidate: [ 2  1  1  0  1  0  2 -1  1  1  1  0  2  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  0  0  0  1 -1  1 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 12, 14, 16, 17, 18]), Candidate: [ 2  1  1  0  1  0  2 -1  1  1  0  2  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1  0  0  0 -1  0  0  1 -1  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 8, 9, 10, 11, 15, 18]), Candidate: [2 1 1 0 1 0 1 1 1 1 0 0 1 1 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 2150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1  0  0 -1  0  0  1 -1  1 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 8, 9, 10, 14, 16, 19]), Candidate: [ 2  1  1  0  1  0  1  1  1  1 -1  1  1  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1  0 -1  1 -1  0  1  0  0 -1  0  0  1] (Indices: [0, 1, 2, 3, 4, 5, 8, 9, 11, 14, 15, 16]), Candidate: [2 1 1 0 1 0 1 1 1 0 1 0 1 2 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 2250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1  0 -1  0  1 -1  0  1 -1  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 8, 9, 12, 15, 18, 19]), Candidate: [2 1 1 0 1 0 1 1 1 0 0 2 0 1 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 2300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1 -1  1  0  0 -1  1 -1  0  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 8, 10, 11, 12, 14, 19]), Candidate: [ 2  1  1  0  1  0  1  1  0  2  0  1  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1 -1  1 -1  1  0  0 -1  0  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 8, 10, 12, 13, 14, 19]), Candidate: [ 2  1  1  0  1  0  1  1  0  2 -1  2  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1 -1  1 -1  0  1 -1  0  0  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 8, 10, 13, 17, 18, 19]), Candidate: [ 2  1  1  0  1  0  1  1  0  2 -1  1  2  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1 -1  0  1  0 -1  0  0  0  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 8, 11, 12, 17, 18, 19]), Candidate: [2 1 1 0 1 0 1 1 0 1 1 1 0 1 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 2500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1 -1  0  0  1  0 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 8, 12, 13, 15, 17, 19]), Candidate: [2 1 1 0 1 0 1 1 0 1 0 2 1 0 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 2550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  1  0  0  0 -1  1 -1  0  1 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 9, 10, 11, 12, 14, 17]), Candidate: [ 2  1  1  0  1  0  1  0  2  1  0  1  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  1  0 -1  1  0  0 -1  0  1 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 9, 10, 12, 13, 14, 17]), Candidate: [ 2  1  1  0  1  0  1  0  2  1 -1  2  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  1  0 -1  0  1 -1  0  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 9, 10, 13, 16, 17, 19]), Candidate: [ 2  1  1  0  1  0  1  0  2  1 -1  1  2  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  1 -1  1  0 -1  0  0  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 9, 11, 12, 16, 17, 19]), Candidate: [2 1 1 0 1 0 1 0 2 0 1 1 0 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 2750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  1 -1  0  1  0 -1  1  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 9, 12, 13, 15, 16, 19]), Candidate: [2 1 1 0 1 0 1 0 2 0 0 2 1 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 2800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  0  1  0  0  0 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 10, 11, 12, 13, 15, 17]), Candidate: [2 1 1 0 1 0 1 0 1 2 0 1 1 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 2850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  0  1  0 -1  0  1  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 10, 11, 14, 15, 16, 18]), Candidate: [2 1 1 0 1 0 1 0 1 2 0 0 1 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 2900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  0  1 -1  0  1  0  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 10, 13, 14, 15, 16, 18]), Candidate: [ 2  1  1  0  1  0  1  0  1  2 -1  1  2  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  0  0  1  0 -1  0  1  0  0  0 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 11, 12, 15, 16, 17, 18]), Candidate: [2 1 1 0 1 0 1 0 1 1 1 1 0 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 3000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  0  0  0  0  1  0  0 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 13, 14, 15, 17, 18, 19]), Candidate: [2 1 1 0 1 0 1 0 1 1 0 1 2 1 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 3050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0  0 -1  1 -1  1 -1  0  0  1 -1  0  1] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 9, 11, 13, 17]), Candidate: [2 1 1 0 0 2 1 0 1 0 1 0 2 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 3100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0  0 -1  0  0  1 -1  0  1 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 9, 13, 16, 19]), Candidate: [2 1 1 0 0 2 1 0 1 0 0 1 2 0 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 3150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0 -1  1  0 -1  0  0  0  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 10, 11, 17, 19]), Candidate: [2 1 1 0 0 2 1 0 0 2 0 0 1 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 3200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0 -1  1 -1  0  0  0  1  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 10, 15, 16, 19]), Candidate: [ 2  1  1  0  0  2  1  0  0  2 -1  1  1  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0 -1  0  1 -1  0  1 -1  1 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 11, 14, 16, 19]), Candidate: [ 2  1  1  0  0  2  1  0  0  1  1  0  1  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0 -1  0  0  0  1  0  0 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 13, 14, 15, 17]), Candidate: [2 1 1 0 0 2 1 0 0 1 0 1 2 1 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 3350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  1  0  0 -1  0  1 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 7, 9, 10, 11, 14, 18]), Candidate: [ 2  1  1  0  0  2  1 -1  2  1  0  0  1  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  1  0 -1  0  0  1  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 7, 9, 10, 14, 15, 18]), Candidate: [ 2  1  1  0  0  2  1 -1  2  1 -1  1  1  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  1 -1  1 -1  1 -1  0  1 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 9, 11, 13, 16, 19]), Candidate: [ 2  1  1  0  0  2  1 -1  2  0  1  0  2  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  1 -1  0  1 -1  0  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 7, 9, 12, 15, 16, 18]), Candidate: [ 2  1  1  0  0  2  1 -1  2  0  0  2  0  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  0  1  0  0 -1  1  0 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 6, 7, 10, 11, 12, 14, 15]), Candidate: [ 2  1  1  0  0  2  1 -1  1  2  0  1  0  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  0  1 -1  1  0  0  0 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 6, 7, 10, 12, 13, 14, 15]), Candidate: [ 2  1  1  0  0  2  1 -1  1  2 -1  2  1  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  0  1 -1  0  1 -1  1 -1  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 10, 13, 15, 18, 19]), Candidate: [ 2  1  1  0  0  2  1 -1  1  2 -1  1  2  0  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  0  0  1  0 -1  0  1 -1  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 11, 12, 15, 18, 19]), Candidate: [ 2  1  1  0  0  2  1 -1  1  1  1  1  0  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  0  0  0  1  0 -1  1  0  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 6, 7, 12, 13, 15, 16, 17]), Candidate: [ 2  1  1  0  0  2  1 -1  1  1  0  2  1  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1  0  0  0  0 -1  0  0  0  1 -1  0  1] (Indices: [0, 1, 2, 3, 4, 6, 8, 9, 10, 11, 12, 17]), Candidate: [2 1 1 0 0 2 0 1 1 1 0 1 0 1 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 3850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1  0  0 -1  0  1 -1  1  0 -1  0  0  1] (Indices: [0, 1, 2, 3, 4, 6, 8, 9, 10, 13, 15, 16]), Candidate: [ 2  1  1  0  0  2  0  1  1  1 -1  1  2  0  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1  0 -1  1  0 -1  0  0  0  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 6, 8, 9, 11, 12, 18, 19]), Candidate: [2 1 1 0 0 2 0 1 1 0 1 1 0 1 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 3950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1  0 -1  0  1  0 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 6, 8, 9, 12, 13, 18, 19]), Candidate: [2 1 1 0 0 2 0 1 1 0 0 2 1 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 4000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1  0 -1  0  0  0  1 -1  0  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 6, 8, 9, 14, 17, 18, 19]), Candidate: [ 2  1  1  0  0  2  0  1  1  0  0  1  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1 -1  1  0 -1  0  1 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 6, 8, 10, 11, 14, 17, 19]), Candidate: [ 2  1  1  0  0  2  0  1  0  2  0  0  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1 -1  1 -1  0  1  0  0 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 6, 8, 10, 13, 14, 15, 19]), Candidate: [ 2  1  1  0  0  2  0  1  0  2 -1  1  2  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1 -1  0  1  0 -1  1  0 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 6, 8, 11, 12, 14, 15, 19]), Candidate: [2 1 1 0 0 2 0 1 0 1 1 1 0 2 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 4200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1 -1  0  1 -1  0  0  1 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 6, 8, 11, 15, 17, 18, 19]), Candidate: [2 1 1 0 0 2 0 1 0 1 1 0 1 1 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 4250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1 -1  0  0  0  1 -1  1 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 6, 8, 13, 15, 17, 18, 19]), Candidate: [2 1 1 0 0 2 0 1 0 1 0 1 2 0 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 4300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  1  0  0 -1  0  1 -1  1 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 6, 9, 10, 11, 14, 16, 19]), Candidate: [ 2  1  1  0  0  2  0  0  2  1  0  0  1  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  1  0 -1  0  1  0  0 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 4, 6, 9, 10, 13, 14, 15, 17]), Candidate: [ 2  1  1  0  0  2  0  0  2  1 -1  1  2  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  1 -1  1  0 -1  1  0 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 4, 6, 9, 11, 12, 14, 15, 17]), Candidate: [2 1 1 0 0 2 0 0 2 0 1 1 0 2 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 4450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  1 -1  1 -1  0  0  1  0  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 6, 9, 11, 15, 16, 17, 19]), Candidate: [2 1 1 0 0 2 0 0 2 0 1 0 1 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 4500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  1 -1  0  0  1 -1  1  0  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 6, 9, 13, 15, 16, 17, 19]), Candidate: [2 1 1 0 0 2 0 0 2 0 0 1 2 0 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 4550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  0  1  0 -1  1  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 10, 11, 13, 14, 16, 18]), Candidate: [ 2  1  1  0  0  2  0  0  1  2  0  0  2  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  0  1 -1  1 -1  1  0  0  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 6, 10, 12, 14, 15, 16, 17]), Candidate: [ 2  1  1  0  0  2  0  0  1  2 -1  2  0  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  0  0  1  0  0 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 6, 11, 12, 13, 15, 17, 19]), Candidate: [2 1 1 0 0 2 0 0 1 1 1 1 1 0 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 4700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  0  0  0  1  0  0 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 6, 12, 13, 14, 16, 18, 19]), Candidate: [ 2  1  1  0  0  2  0  0  1  1  0  2  1  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0  0  0 -1  1  0 -1  0  1 -1  0  0  1] (Indices: [0, 1, 2, 3, 4, 7, 8, 9, 10, 12, 13, 16]), Candidate: [ 2  1  1  0  0  1  2  0  1  1 -1  2  1  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0  0  0 -1  0  0  0  0  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 4, 7, 8, 9, 10, 16, 17, 18]), Candidate: [ 2  1  1  0  0  1  2  0  1  1 -1  1  1  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0  0 -1  1 -1  0  0  1  0  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 7, 8, 9, 11, 15, 16, 17]), Candidate: [2 1 1 0 0 1 2 0 1 0 1 0 1 1 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 4900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0  0 -1  0  0  1  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 3, 4, 7, 8, 9, 13, 14, 16, 18]), Candidate: [ 2  1  1  0  0  1  2  0  1  0  0  1  2  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0 -1  1  0  0 -1  0  0  0  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 7, 8, 10, 11, 12, 18, 19]), Candidate: [2 1 1 0 0 1 2 0 0 2 0 1 0 1 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 5000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0 -1  1 -1  1  0 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 7, 8, 10, 12, 13, 18, 19]), Candidate: [ 2  1  1  0  0  1  2  0  0  2 -1  2  1  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0 -1  1 -1  0  0  1 -1  0  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 7, 8, 10, 14, 17, 18, 19]), Candidate: [ 2  1  1  0  0  1  2  0  0  2 -1  1  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0 -1  0  1 -1  1  0 -1  0  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 7, 8, 11, 13, 14, 18, 19]), Candidate: [ 2  1  1  0  0  1  2  0  0  1  1  0  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0 -1  0  0  1 -1  1  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 7, 8, 12, 14, 15, 17, 19]), Candidate: [2 1 1 0 0 1 2 0 0 1 0 2 0 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 5200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  1  0  0  0 -1  0  0  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 4, 7, 9, 10, 11, 12, 17, 18]), Candidate: [ 2  1  1  0  0  1  2 -1  2  1  0  1  0  1  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  1  0 -1  1  0 -1  0  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 4, 7, 9, 10, 12, 13, 17, 18]), Candidate: [ 2  1  1  0  0  1  2 -1  2  1 -1  2  1  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  1  0 -1  0  0  1 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 7, 9, 10, 14, 16, 17, 19]), Candidate: [ 2  1  1  0  0  1  2 -1  2  1 -1  1  1  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 5350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  1 -1  1 -1  1  0 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 4, 7, 9, 11, 13, 14, 17, 18]), Candidate: [ 2  1  1  0  0  1  2 -1  2  0  1  0  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  1 -1  0  1 -1  1  0  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 7, 9, 12, 14, 15, 16, 19]), Candidate: [ 2  1  1  0  0  1  2 -1  2  0  0  2  0  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  0  1  0  0 -1  1  0 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 4, 7, 10, 11, 12, 14, 15, 17]), Candidate: [ 2  1  1  0  0  1  2 -1  1  2  0  1  0  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  0  1  0 -1  0  0  1  0  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 7, 10, 11, 15, 16, 17, 19]), Candidate: [ 2  1  1  0  0  1  2 -1  1  2  0  0  1  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  0  1 -1  0  1 -1  1  0  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 7, 10, 13, 15, 16, 17, 19]), Candidate: [ 2  1  1  0  0  1  2 -1  1  2 -1  1  2  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  0  0  1 -1  1  0  0 -1  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 7, 11, 13, 14, 15, 18, 19]), Candidate: [ 2  1  1  0  0  1  2 -1  1  1  1  0  2  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1  0  0  0  0 -1  1  0 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 8, 9, 10, 11, 12, 14, 15]), Candidate: [2 1 1 0 0 1 1 1 1 1 0 1 0 2 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 5700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1  0  0 -1  1  0  0  0 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 8, 9, 10, 12, 13, 14, 15]), Candidate: [ 2  1  1  0  0  1  1  1  1  1 -1  2  1  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1  0  0 -1  0  1 -1  1 -1  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 8, 9, 10, 13, 15, 18, 19]), Candidate: [ 2  1  1  0  0  1  1  1  1  1 -1  1  2  0  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1  0 -1  1  0 -1  0  1 -1  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 8, 9, 11, 12, 15, 18, 19]), Candidate: [2 1 1 0 0 1 1 1 1 0 1 1 0 1 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 5850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1  0 -1  0  1  0 -1  1  0  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 8, 9, 12, 13, 15, 16, 17]), Candidate: [2 1 1 0 0 1 1 1 1 0 0 2 1 0 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 5900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1 -1  1  0  0  0  0 -1  0  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 8, 10, 11, 12, 13, 14, 19]), Candidate: [ 2  1  1  0  0  1  1  1  0  2  0  1  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1 -1  1  0 -1  1 -1  0  0  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 8, 10, 11, 13, 17, 18, 19]), Candidate: [2 1 1 0 0 1 1 1 0 2 0 0 2 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 6000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1 -1  1 -1  1 -1  0  0  1  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 8, 10, 12, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  0  1  1  1  0  2 -1  2  0  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1 -1  0  1  0 -1  1 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 8, 11, 12, 14, 16, 18, 19]), Candidate: [ 2  1  1  0  0  1  1  1  0  1  1  1  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1 -1  0  0  0  1  0  0  0  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 8, 13, 14, 15, 16, 17, 19]), Candidate: [2 1 1 0 0 1 1 1 0 1 0 1 2 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 6150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  1  0  0 -1  1  0 -1  0  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 9, 10, 11, 13, 14, 18, 19]), Candidate: [ 2  1  1  0  0  1  1  0  2  1  0  0  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  1  0 -1  1 -1  1  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 9, 10, 12, 14, 15, 17, 19]), Candidate: [ 2  1  1  0  0  1  1  0  2  1 -1  2  0  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  1 -1  1  0  0 -1  0  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 9, 11, 12, 13, 16, 18, 19]), Candidate: [2 1 1 0 0 1 1 0 2 0 1 1 1 0 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 6300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  1 -1  0  1  0 -1  1  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 9, 12, 13, 15, 16, 18, 19]), Candidate: [2 1 1 0 0 1 1 0 2 0 0 2 1 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 6350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  0  1  0  0 -1  0  0  1  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 10, 11, 12, 16, 17, 18, 19]), Candidate: [2 1 1 0 0 1 1 0 1 2 0 1 0 1 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 6400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  0  0  1  0  0  0  0  0  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 11, 12, 13, 14, 15, 16, 17]), Candidate: [2 1 1 0 0 1 1 0 1 1 1 1 1 1 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 6450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0  0  0 -1  1 -1  0  0  0  0  0  1  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 9, 10, 12, 19]), Candidate: [ 2  1  1 -1  2  1  1  0  1  1 -1  2  0  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0  0 -1  0  1  0  0 -1  0  0  0  0  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 9, 12, 13, 14]), Candidate: [ 2  1  1 -1  2  1  1  0  1  0  0  2  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0  0 -1  0  0  0  0  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 9, 15, 17, 19]), Candidate: [ 2  1  1 -1  2  1  1  0  1  0  0  1  1  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0 -1  1 -1  1 -1  0  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 10, 12, 16, 18]), Candidate: [ 2  1  1 -1  2  1  1  0  0  2 -1  2  0  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0 -1  0  1  0 -1  1 -1  0  0  0  1  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 11, 12, 14, 19]), Candidate: [ 2  1  1 -1  2  1  1  0  0  1  1  1  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0 -1  0  0  1  0  0 -1  0  0  0  1  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 12, 13, 14, 19]), Candidate: [ 2  1  1 -1  2  1  1  0  0  1  0  2  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0 -1  0  0  0  1 -1  0  0  1  0  0  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 13, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  1  1  0  0  1  0  1  2  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  1  0 -1  1 -1  1  0 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 9, 10, 12, 14, 15]), Candidate: [ 2  1  1 -1  2  1  1 -1  2  1 -1  2  0  2  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 6850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  1 -1  1  0  0  0 -1  0  0  0  0  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 9, 11, 12, 13, 14]), Candidate: [ 2  1  1 -1  2  1  1 -1  2  0  1  1  1  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 6900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  1 -1  1 -1  0  0  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 9, 11, 15, 17, 19]), Candidate: [ 2  1  1 -1  2  1  1 -1  2  0  1  0  1  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  1 -1  0  0  1  0 -1  0  0  1  0  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 9, 13, 14, 18, 19]), Candidate: [ 2  1  1 -1  2  1  1 -1  2  0  0  1  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 7000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  0  1  0 -1  1  0 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 10, 11, 13, 14, 18]), Candidate: [ 2  1  1 -1  2  1  1 -1  1  2  0  0  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 7050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  0  1 -1  1 -1  1  0 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 10, 12, 14, 15, 19]), Candidate: [ 2  1  1 -1  2  1  1 -1  1  2 -1  2  0  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 7100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  0  1 -1  0  0  0  1 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 10, 15, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  1  1 -1  1  2 -1  1  1  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 7150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  0  0  1 -1  1 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 11, 13, 15, 17, 18]), Candidate: [ 2  1  1 -1  2  1  1 -1  1  1  1  0  2  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  0  0  0  1 -1  1 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 12, 14, 16, 18, 19]), Candidate: [ 2  1  1 -1  2  1  1 -1  1  1  0  2  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 7250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1  0  0  0 -1  0  0  0  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 5, 6, 8, 9, 10, 11, 16, 17]), Candidate: [ 2  1  1 -1  2  1  0  1  1  1  0  0  1  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1  0  0 -1  0  0  1 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 5, 6, 8, 9, 10, 14, 17, 19]), Candidate: [ 2  1  1 -1  2  1  0  1  1  1 -1  1  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 7350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1  0 -1  1 -1  0  1  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 8, 9, 11, 14, 15, 18]), Candidate: [ 2  1  1 -1  2  1  0  1  1  0  1  0  1  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1  0 -1  0  1 -1  0  0  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 5, 6, 8, 9, 12, 16, 17, 19]), Candidate: [ 2  1  1 -1  2  1  0  1  1  0  0  2  0  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1 -1  1  0  0 -1  0  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 5, 6, 8, 10, 11, 12, 15, 17]), Candidate: [ 2  1  1 -1  2  1  0  1  0  2  0  1  0  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1 -1  1 -1  1  0 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 5, 6, 8, 10, 12, 13, 15, 17]), Candidate: [ 2  1  1 -1  2  1  0  1  0  2 -1  2  1  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1 -1  1 -1  0  0  1  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 8, 10, 14, 15, 16, 18]), Candidate: [ 2  1  1 -1  2  1  0  1  0  2 -1  1  1  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1 -1  0  1 -1  1  0  0 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 5, 6, 8, 11, 13, 14, 15, 17]), Candidate: [ 2  1  1 -1  2  1  0  1  0  1  1  0  2  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1 -1  0  0  1  0 -1  0  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 8, 12, 13, 16, 17, 18]), Candidate: [ 2  1  1 -1  2  1  0  1  0  1  0  2  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  1  0  0  0 -1  1 -1  0  0  0  1  0] (Indices: [0, 1, 2, 3, 5, 6, 9, 10, 11, 12, 14, 19]), Candidate: [ 2  1  1 -1  2  1  0  0  2  1  0  1  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  1  0 -1  1  0  0 -1  0  0  0  1  0] (Indices: [0, 1, 2, 3, 5, 6, 9, 10, 12, 13, 14, 19]), Candidate: [ 2  1  1 -1  2  1  0  0  2  1 -1  2  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 7800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  1  0 -1  0  1 -1  0  0  1  0  0  0] (Indices: [0, 1, 2, 3, 5, 6, 9, 10, 13, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  1  0  0  2  1 -1  1  2  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  1 -1  1  0 -1  0  0  0  1  0  0  0] (Indices: [0, 1, 2, 3, 5, 6, 9, 11, 12, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  1  0  0  2  0  1  1  0  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  1 -1  0  1  0 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 5, 6, 9, 12, 13, 15, 17, 19]), Candidate: [ 2  1  1 -1  2  1  0  0  2  0  0  2  1  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  0  1  0  0  0 -1  1 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 5, 6, 10, 11, 12, 13, 15, 19]), Candidate: [ 2  1  1 -1  2  1  0  0  1  2  0  1  1  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  0  1  0 -1  0  1  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 10, 11, 14, 15, 17, 18]), Candidate: [ 2  1  1 -1  2  1  0  0  1  2  0  0  1  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  0  1 -1  0  1  0  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 10, 13, 14, 15, 17, 18]), Candidate: [ 2  1  1 -1  2  1  0  0  1  2 -1  1  2  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  0  0  1  0 -1  0  1  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 5, 6, 11, 12, 15, 16, 18, 19]), Candidate: [ 2  1  1 -1  2  1  0  0  1  1  1  1  0  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  0  0  0  0  1 -1  1  0  0  0  0  0] (Indices: [0, 1, 2, 3, 5, 6, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  1  0  0  1  1  0  1  2  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0  0  0 -1  1 -1  0  0  0  0  1  0  0] (Indices: [0, 1, 2, 3, 5, 7, 8, 9, 10, 12, 18, 19]), Candidate: [ 2  1  1 -1  2  0  2  0  1  1 -1  2  0  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0  0 -1  1  0 -1  0  1 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 5, 7, 8, 9, 11, 12, 15, 19]), Candidate: [ 2  1  1 -1  2  0  2  0  1  0  1  1  0  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0  0 -1  0  1  0 -1  1 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 5, 7, 8, 9, 12, 13, 15, 19]), Candidate: [ 2  1  1 -1  2  0  2  0  1  0  0  2  1  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0  0 -1  0  0  0  1  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 5, 7, 8, 9, 14, 15, 17, 18]), Candidate: [ 2  1  1 -1  2  0  2  0  1  0  0  1  1  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0 -1  1  0 -1  0  1  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 3, 5, 7, 8, 10, 11, 14, 15, 18]), Candidate: [ 2  1  1 -1  2  0  2  0  0  2  0  0  1  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0 -1  1 -1  1 -1  0  0  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 5, 7, 8, 10, 12, 16, 17, 19]), Candidate: [ 2  1  1 -1  2  0  2  0  0  2 -1  2  0  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0 -1  0  1  0  0 -1  0  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 5, 7, 8, 11, 12, 13, 17, 18]), Candidate: [ 2  1  1 -1  2  0  2  0  0  1  1  1  1  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0 -1  0  1 -1  0  1 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 5, 7, 8, 11, 14, 16, 17, 19]), Candidate: [ 2  1  1 -1  2  0  2  0  0  1  1  0  1  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0 -1  0  0  0  1  0 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 5, 7, 8, 13, 14, 16, 17, 19]), Candidate: [ 2  1  1 -1  2  0  2  0  0  1  0  1  2  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  1  0  0 -1  0  1  0  0 -1  0  0  1] (Indices: [0, 1, 2, 3, 5, 7, 9, 10, 11, 14, 15, 16]), Candidate: [ 2  1  1 -1  2  0  2 -1  2  1  0  0  1  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  1  0 -1  1 -1  0  1 -1  0  1  0  0] (Indices: [0, 1, 2, 3, 5, 7, 9, 10, 12, 15, 18, 19]), Candidate: [ 2  1  1 -1  2  0  2 -1  2  1 -1  2  0  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 8750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  1 -1  1  0  0 -1  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 3, 5, 7, 9, 11, 12, 13, 16, 18]), Candidate: [ 2  1  1 -1  2  0  2 -1  2  0  1  1  1  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  1 -1  1 -1  0  1  0 -1  0  1  0  0] (Indices: [0, 1, 2, 3, 5, 7, 9, 11, 14, 15, 18, 19]), Candidate: [ 2  1  1 -1  2  0  2 -1  2  0  1  0  1  2  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  1 -1  0  0  1  0  0 -1  0  1  0  0] (Indices: [0, 1, 2, 3, 5, 7, 9, 13, 14, 15, 18, 19]), Candidate: [ 2  1  1 -1  2  0  2 -1  2  0  0  1  2  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  0  1  0  0 -1  0  0  0  1  0  0  0] (Indices: [0, 1, 2, 3, 5, 7, 10, 11, 12, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  0  2 -1  1  2  0  1  0  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  0  1 -1  1  0 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 5, 7, 10, 12, 13, 15, 17, 19]), Candidate: [ 2  1  1 -1  2  0  2 -1  1  2 -1  2  1  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 9000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  0  0  1  0  0  0 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 5, 7, 11, 12, 13, 14, 17, 19]), Candidate: [ 2  1  1 -1  2  0  2 -1  1  1  1  1  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 9050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  0  0  0  1  0  0  0  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 5, 7, 12, 13, 14, 15, 16, 19]), Candidate: [ 2  1  1 -1  2  0  2 -1  1  1  0  2  1  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1  0  0  0 -1  1  0 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 5, 8, 9, 10, 11, 13, 14, 18]), Candidate: [ 2  1  1 -1  2  0  1  1  1  1  0  0  2  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1  0  0 -1  1 -1  1  0 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 5, 8, 9, 10, 12, 14, 15, 19]), Candidate: [ 2  1  1 -1  2  0  1  1  1  1 -1  2  0  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1  0  0 -1  0  0  0  1 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 5, 8, 9, 10, 15, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  0  1  1  1  1 -1  1  1  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1  0 -1  1 -1  1 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 5, 8, 9, 11, 13, 15, 17, 18]), Candidate: [ 2  1  1 -1  2  0  1  1  1  0  1  0  2  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1  0 -1  0  1 -1  1 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 5, 8, 9, 12, 14, 16, 18, 19]), Candidate: [ 2  1  1 -1  2  0  1  1  1  0  0  2  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1 -1  1  0  0 -1  1 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 5, 8, 10, 11, 12, 14, 17, 18]), Candidate: [ 2  1  1 -1  2  0  1  1  0  2  0  1  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1 -1  1 -1  1  0  0  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 3, 5, 8, 10, 12, 13, 14, 15, 18]), Candidate: [ 2  1  1 -1  2  0  1  1  0  2 -1  2  1  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1 -1  1 -1  0  0  1  0  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 5, 8, 10, 14, 15, 16, 18, 19]), Candidate: [ 2  1  1 -1  2  0  1  1  0  2 -1  1  1  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1 -1  0  1 -1  1 -1  1  0  0 -1  1  0] (Indices: [0, 1, 2, 3, 5, 8, 11, 13, 15, 16, 17, 19]), Candidate: [ 2  1  1 -1  2  0  1  1  0  1  1  0  2  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  1  0  0  0  0 -1  0  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 5, 9, 10, 11, 12, 13, 17, 18]), Candidate: [ 2  1  1 -1  2  0  1  0  2  1  0  1  1  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  1  0  0 -1  0  1 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 5, 9, 10, 11, 14, 16, 17, 19]), Candidate: [ 2  1  1 -1  2  0  1  0  2  1  0  0  1  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  1  0 -1  0  1  0 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 5, 9, 10, 13, 14, 16, 17, 19]), Candidate: [ 2  1  1 -1  2  0  1  0  2  1 -1  1  2  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 9700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  1 -1  1 -1  1  0  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 5, 9, 11, 13, 14, 15, 16, 18]), Candidate: [ 2  1  1 -1  2  0  1  0  2  0  1  0  2  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  0  1  0  0  0  0  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 3, 5, 10, 11, 12, 13, 14, 15, 18]), Candidate: [ 2  1  1 -1  2  0  1  0  1  2  0  1  1  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  0  1  0 -1  0  1  0  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 5, 10, 11, 14, 15, 16, 18, 19]), Candidate: [ 2  1  1 -1  2  0  1  0  1  2  0  0  1  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  0  0  1  0 -1  1  0 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 5, 11, 12, 14, 15, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  0  1  0  1  1  1  1  0  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0  0  0 -1  1  0 -1  0  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 6, 7, 8, 9, 10, 12, 13, 18]), Candidate: [ 2  1  1 -1  1  2  1  0  1  1 -1  2  1  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0  0  0 -1  0  0  0  0  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 6, 7, 8, 9, 10, 16, 18, 19]), Candidate: [ 2  1  1 -1  1  2  1  0  1  1 -1  1  1  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0  0 -1  1 -1  0  0  1  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 6, 7, 8, 9, 11, 15, 16, 19]), Candidate: [ 2  1  1 -1  1  2  1  0  1  0  1  0  1  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0  0 -1  0  0  1  0 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 6, 7, 8, 9, 13, 14, 17, 18]), Candidate: [ 2  1  1 -1  1  2  1  0  1  0  0  1  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0 -1  1  0 -1  1  0 -1  1 -1  0  0  1] (Indices: [0, 1, 2, 3, 6, 7, 8, 10, 11, 13, 14, 16]), Candidate: [ 2  1  1 -1  1  2  1  0  0  2  0  0  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0 -1  1 -1  1 -1  1  0 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 6, 7, 8, 10, 12, 14, 15, 17]), Candidate: [ 2  1  1 -1  1  2  1  0  0  2 -1  2  0  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0 -1  1 -1  0  0  0  1  0  0 -1  1  0] (Indices: [0, 1, 2, 3, 6, 7, 8, 10, 15, 16, 17, 19]), Candidate: [ 2  1  1 -1  1  2  1  0  0  2 -1  1  1  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0 -1  0  1 -1  1 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 6, 7, 8, 11, 13, 15, 16, 18]), Candidate: [ 2  1  1 -1  1  2  1  0  0  1  1  0  2  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0 -1  0  0  1 -1  1 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 6, 7, 8, 12, 14, 16, 17, 18]), Candidate: [ 2  1  1 -1  1  2  1  0  0  1  0  2  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  1  0  0  0 -1  0  0  0  0  1  0  0] (Indices: [0, 1, 2, 3, 6, 7, 9, 10, 11, 12, 18, 19]), Candidate: [ 2  1  1 -1  1  2  1 -1  2  1  0  1  0  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  1  0 -1  1  0 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 3, 6, 7, 9, 10, 12, 13, 18, 19]), Candidate: [ 2  1  1 -1  1  2  1 -1  2  1 -1  2  1  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 10450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  1  0 -1  0  0  1 -1  0  1  0  0  0] (Indices: [0, 1, 2, 3, 6, 7, 9, 10, 14, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  2  1 -1  2  1 -1  1  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 10500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  1 -1  1 -1  1  0 -1  0  0  1  0  0] (Indices: [0, 1, 2, 3, 6, 7, 9, 11, 13, 14, 18, 19]), Candidate: [ 2  1  1 -1  1  2  1 -1  2  0  1  0  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 10550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  1 -1  0  1 -1  1  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 6, 7, 9, 12, 14, 15, 17, 19]), Candidate: [ 2  1  1 -1  1  2  1 -1  2  0  0  2  0  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  0  1  0  0 -1  1  0 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 6, 7, 10, 11, 12, 14, 15, 19]), Candidate: [ 2  1  1 -1  1  2  1 -1  1  2  0  1  0  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  0  1  0 -1  0  0  1 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 6, 7, 10, 11, 15, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  2  1 -1  1  2  0  0  1  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  0  1 -1  0  1 -1  1 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 6, 7, 10, 13, 15, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  2  1 -1  1  2 -1  1  2  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 10750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  0  0  1 -1  1  0 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 6, 7, 11, 13, 14, 16, 17, 19]), Candidate: [ 2  1  1 -1  1  2  1 -1  1  1  1  0  2  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 10800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1  0  0  0  0 -1  1 -1  0  1 -1  0  1] (Indices: [0, 1, 2, 3, 6, 8, 9, 10, 11, 12, 14, 17]), Candidate: [ 2  1  1 -1  1  2  0  1  1  1  0  1  0  2 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1  0  0 -1  1  0  0 -1  0  1 -1  0  1] (Indices: [0, 1, 2, 3, 6, 8, 9, 10, 12, 13, 14, 17]), Candidate: [ 2  1  1 -1  1  2  0  1  1  1 -1  2  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 10900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1  0  0 -1  0  1 -1  0  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 6, 8, 9, 10, 13, 16, 17, 19]), Candidate: [ 2  1  1 -1  1  2  0  1  1  1 -1  1  2  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1  0 -1  1  0 -1  0  0  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 6, 8, 9, 11, 12, 16, 17, 19]), Candidate: [ 2  1  1 -1  1  2  0  1  1  0  1  1  0  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1  0 -1  0  1  0 -1  1  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 6, 8, 9, 12, 13, 15, 16, 19]), Candidate: [ 2  1  1 -1  1  2  0  1  1  0  0  2  1  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1 -1  1  0  0  0 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 6, 8, 10, 11, 12, 13, 15, 17]), Candidate: [ 2  1  1 -1  1  2  0  1  0  2  0  1  1  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1 -1  1  0 -1  0  1  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 6, 8, 10, 11, 14, 15, 16, 18]), Candidate: [ 2  1  1 -1  1  2  0  1  0  2  0  0  1  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1 -1  1 -1  0  1  0  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 6, 8, 10, 13, 14, 15, 16, 18]), Candidate: [ 2  1  1 -1  1  2  0  1  0  2 -1  1  2  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 11200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1 -1  0  1  0 -1  0  1  0  0  0 -1  1] (Indices: [0, 1, 2, 3, 6, 8, 11, 12, 15, 16, 17, 18]), Candidate: [ 2  1  1 -1  1  2  0  1  0  1  1  1  0  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1 -1  0  0  0  1  0  0 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 6, 8, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  2  0  1  0  1  0  1  2  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  1  0  0 -1  1 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 6, 9, 10, 11, 13, 15, 16, 18]), Candidate: [ 2  1  1 -1  1  2  0  0  2  1  0  0  2  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  1  0 -1  1 -1  1 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 6, 9, 10, 12, 14, 16, 17, 18]), Candidate: [ 2  1  1 -1  1  2  0  0  2  1 -1  2  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 11400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  1 -1  1  0 -1  1  0  0  0 -1  0  1] (Indices: [0, 1, 2, 3, 6, 9, 11, 12, 14, 15, 16, 17]), Candidate: [ 2  1  1 -1  1  2  0  0  2  0  1  1  0  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  1 -1  0  1  0 -1  0  1  0  0  0  0] (Indices: [0, 1, 2, 3, 6, 9, 12, 13, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  2  0  0  2  0  0  2  1  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  0  1  0 -1  1  0  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 6, 10, 11, 13, 14, 15, 16, 18]), Candidate: [ 2  1  1 -1  1  2  0  0  1  2  0  0  2  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  0  0  1  0  0  0  0  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 6, 11, 12, 13, 14, 15, 16, 19]), Candidate: [ 2  1  1 -1  1  2  0  0  1  1  1  1  1  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0  0  0  0  0 -1  0  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 3, 7, 8, 9, 10, 11, 12, 16, 18]), Candidate: [ 2  1  1 -1  1  1  2  0  1  1  0  1  0  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0  0  0 -1  1  0 -1  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 3, 7, 8, 9, 10, 12, 13, 16, 18]), Candidate: [ 2  1  1 -1  1  1  2  0  1  1 -1  2  1  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 11700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0  0  0 -1  0  0  1  0 -1  0  1  0  0] (Indices: [0, 1, 2, 3, 7, 8, 9, 10, 14, 15, 18, 19]), Candidate: [ 2  1  1 -1  1  1  2  0  1  1 -1  1  1  2  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 11750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0  0 -1  1 -1  1  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 3, 7, 8, 9, 11, 13, 14, 16, 18]), Candidate: [ 2  1  1 -1  1  1  2  0  1  0  1  0  2  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 11800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0  0 -1  0  1 -1  1  0  0  0 -1  0  1] (Indices: [0, 1, 2, 3, 7, 8, 9, 12, 14, 15, 16, 17]), Candidate: [ 2  1  1 -1  1  1  2  0  1  0  0  2  0  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0 -1  1  0  0  0 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 3, 7, 8, 10, 11, 12, 13, 18, 19]), Candidate: [ 2  1  1 -1  1  1  2  0  0  2  0  1  1  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0 -1  1  0 -1  0  1 -1  0  1  0  0  0] (Indices: [0, 1, 2, 3, 7, 8, 10, 11, 14, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  1  2  0  0  2  0  0  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 11950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0 -1  1 -1  0  1  0 -1  0  1  0  0  0] (Indices: [0, 1, 2, 3, 7, 8, 10, 13, 14, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  1  2  0  0  2 -1  1  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 12000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0 -1  0  1 -1  1  0  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 7, 8, 11, 13, 14, 15, 17, 18]), Candidate: [ 2  1  1 -1  1  1  2  0  0  1  1  0  2  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  1  0  0  0  0  0 -1  0  0  0  1  0] (Indices: [0, 1, 2, 3, 7, 9, 10, 11, 12, 13, 14, 19]), Candidate: [ 2  1  1 -1  1  1  2 -1  2  1  0  1  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 12100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  1  0  0 -1  1 -1  0  0  1  0  0  0] (Indices: [0, 1, 2, 3, 7, 9, 10, 11, 13, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  1  2 -1  2  1  0  0  2  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 12150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  1  0 -1  1 -1  0  0  1  0  0  0  0] (Indices: [0, 1, 2, 3, 7, 9, 10, 12, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  1  2 -1  2  1 -1  2  0  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 12200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  1 -1  1  0 -1  1 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 7, 9, 11, 12, 14, 16, 18, 19]), Candidate: [ 2  1  1 -1  1  1  2 -1  2  0  1  1  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 12250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  1 -1  0  0  1  0  0  0  0 -1  1  0] (Indices: [0, 1, 2, 3, 7, 9, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  1  1 -1  1  1  2 -1  2  0  0  1  2  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 12300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  0  1  0 -1  1  0 -1  0  1  0  0  0] (Indices: [0, 1, 2, 3, 7, 10, 11, 13, 14, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  1  2 -1  1  2  0  0  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 12350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  0  0  1  0  0 -1  1  0  0  0 -1  1] (Indices: [0, 1, 2, 3, 7, 11, 12, 13, 15, 16, 17, 18]), Candidate: [ 2  1  1 -1  1  1  2 -1  1  1  1  1  1  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 12400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1  0  0  0  0 -1  1 -1  0  0  1  0  0] (Indices: [0, 1, 2, 3, 8, 9, 10, 11, 12, 14, 18, 19]), Candidate: [ 2  1  1 -1  1  1  1  1  1  1  0  1  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 12450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1  0  0 -1  1  0  0 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 8, 9, 10, 12, 13, 14, 16, 17]), Candidate: [ 2  1  1 -1  1  1  1  1  1  1 -1  2  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 12500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1  0  0 -1  0  0  1 -1  1  0  0  0  0] (Indices: [0, 1, 2, 3, 8, 9, 10, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  1  1  1  1  1 -1  1  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 12550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1  0 -1  1 -1  1 -1  1 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 8, 9, 11, 13, 15, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  1  1  1  1  0  1  0  2  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1 -1  1  0  0  0 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 8, 10, 11, 12, 13, 15, 17, 19]), Candidate: [ 2  1  1 -1  1  1  1  1  0  2  0  1  1  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1 -1  1 -1  1  0  0 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 8, 10, 12, 13, 14, 16, 18, 19]), Candidate: [ 2  1  1 -1  1  1  1  1  0  2 -1  2  1  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 12700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1 -1  0  0  1  0  0  0  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 8, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  1  1 -1  1  1  1  1  0  1  0  2  1  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  1  0  0 -1  1  0 -1  0  1  0  0  0] (Indices: [0, 1, 2, 3, 9, 10, 11, 13, 14, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  1  1  0  2  1  0  0  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 12800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  1 -1  1  0  0 -1  1  0  0  0 -1  1] (Indices: [0, 1, 2, 3, 9, 11, 12, 13, 15, 16, 17, 18]), Candidate: [ 2  1  1 -1  1  1  1  0  2  0  1  1  1  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  0  1  0 -1  1  0  0 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 10, 11, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  1  1  0  1  2  0  0  2  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0  0  0 -1  0  0  0  1 -1  0  0  1  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 9, 10, 15, 19]), Candidate: [ 2  1  0  1  1  1  1  0  1  1 -1  1  1  1  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0  0 -1  0  1 -1  0  0  1  0 -1  0  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 9, 12, 16, 17]), Candidate: [2 1 0 1 1 1 1 0 1 0 0 2 0 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 13000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0 -1  1  0 -1  1 -1  0  1 -1  0  0  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 10, 11, 13, 16]), Candidate: [2 1 0 1 1 1 1 0 0 2 0 0 2 0 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 13050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0 -1  1 -1  0  1 -1  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 10, 13, 16, 18]), Candidate: [ 2  1  0  1  1  1  1  0  0  2 -1  1  2  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0 -1  0  1 -1  1  0 -1  0  0  0  1  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 11, 13, 14, 19]), Candidate: [ 2  1  0  1  1  1  1  0  0  1  1  0  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0 -1  0  0  1 -1  1 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 12, 14, 16, 17]), Candidate: [ 2  1  0  1  1  1  1  0  0  1  0  2  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0 -1  0  0  0  0  0  0  1  0  0  0  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 16, 17, 18, 19]), Candidate: [2 1 0 1 1 1 1 0 0 1 0 1 1 1 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 13250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  1  0 -1  0  1  0  0 -1  0  0  0  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 9, 10, 13, 14, 15]), Candidate: [ 2  1  0  1  1  1  1 -1  2  1 -1  1  2  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 13300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  1 -1  1  0 -1  0  0  1  0 -1  0  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 9, 11, 12, 16, 17]), Candidate: [ 2  1  0  1  1  1  1 -1  2  0  1  1  0  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  1 -1  0  1  0 -1  0  1  0 -1  0  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 9, 12, 13, 16, 17]), Candidate: [ 2  1  0  1  1  1  1 -1  2  0  0  2  1  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  1 -1  0  0  0  1  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 9, 14, 15, 17, 19]), Candidate: [ 2  1  0  1  1  1  1 -1  2  0  0  1  1  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  0  1  0 -1  0  1  0 -1  0  0  1  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 10, 11, 14, 15, 19]), Candidate: [ 2  1  0  1  1  1  1 -1  1  2  0  0  1  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  0  1 -1  1 -1  0  0  1 -1  1  0  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 10, 12, 16, 18, 19]), Candidate: [ 2  1  0  1  1  1  1 -1  1  2 -1  2  0  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 13550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  0  0  1  0  0 -1  0  0  1 -1  1  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 11, 12, 13, 17, 19]), Candidate: [ 2  1  0  1  1  1  1 -1  1  1  1  1  1  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  0  0  1 -1  0  1 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 11, 14, 16, 18, 19]), Candidate: [ 2  1  0  1  1  1  1 -1  1  1  1  0  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 13650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  0  0  0  0  1  0 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 13, 14, 16, 18, 19]), Candidate: [ 2  1  0  1  1  1  1 -1  1  1  0  1  2  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 13700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1  0  0 -1  1 -1  1 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 4, 5, 6, 8, 9, 10, 12, 14, 18]), Candidate: [ 2  1  0  1  1  1  0  1  1  1 -1  2  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 13750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1  0 -1  1  0  0 -1  0  0  1 -1  0  1] (Indices: [0, 1, 2, 4, 5, 6, 8, 9, 11, 12, 13, 17]), Candidate: [2 1 0 1 1 1 0 1 1 0 1 1 1 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 13800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1  0 -1  1 -1  0  0  0  1  0 -1  1  0] (Indices: [0, 1, 2, 4, 5, 6, 8, 9, 11, 16, 17, 19]), Candidate: [2 1 0 1 1 1 0 1 1 0 1 0 1 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 13850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1  0 -1  0  0  1 -1  1  0 -1  0  1  0] (Indices: [0, 1, 2, 4, 5, 6, 8, 9, 13, 15, 16, 19]), Candidate: [2 1 0 1 1 1 0 1 1 0 0 1 2 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 13900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1 -1  1  0 -1  1 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 4, 5, 6, 8, 10, 11, 13, 15, 17]), Candidate: [2 1 0 1 1 1 0 1 0 2 0 0 2 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 13950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1 -1  1 -1  1 -1  1 -1  1 -1  0  1  0] (Indices: [0, 1, 2, 4, 5, 6, 8, 10, 12, 14, 16, 19]), Candidate: [ 2  1  0  1  1  1  0  1  0  2 -1  2  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 14000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1 -1  0  1  0  0  0 -1  1 -1  0  0  1] (Indices: [0, 1, 2, 4, 5, 6, 8, 11, 12, 13, 14, 16]), Candidate: [ 2  1  0  1  1  1  0  1  0  1  1  1  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1 -1  0  1 -1  1 -1  0  1  0  0 -1  1] (Indices: [0, 1, 2, 4, 5, 6, 8, 11, 13, 16, 17, 18]), Candidate: [2 1 0 1 1 1 0 1 0 1 1 0 2 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 14100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1 -1  0  0  1 -1  0  1  0  0 -1  1  0] (Indices: [0, 1, 2, 4, 5, 6, 8, 12, 15, 16, 17, 19]), Candidate: [2 1 0 1 1 1 0 1 0 1 0 2 0 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 14150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  1  0  0 -1  1  0 -1  0  0  0  1  0] (Indices: [0, 1, 2, 4, 5, 6, 9, 10, 11, 13, 14, 19]), Candidate: [ 2  1  0  1  1  1  0  0  2  1  0  0  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  1  0 -1  1 -1  1 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 4, 5, 6, 9, 10, 12, 14, 16, 17]), Candidate: [ 2  1  0  1  1  1  0  0  2  1 -1  2  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 14250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  1  0 -1  0  0  0  0  1  0  0  0  0] (Indices: [0, 1, 2, 4, 5, 6, 9, 10, 16, 17, 18, 19]), Candidate: [ 2  1  0  1  1  1  0  0  2  1 -1  1  1  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  1 -1  1 -1  1 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 4, 5, 6, 9, 11, 13, 15, 17, 19]), Candidate: [2 1 0 1 1 1 0 0 2 0 1 0 2 0 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 14350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  1 -1  0  1 -1  1 -1  0  1  0  0  0] (Indices: [0, 1, 2, 4, 5, 6, 9, 12, 14, 17, 18, 19]), Candidate: [ 2  1  0  1  1  1  0  0  2  0  0  2  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  0  1  0  0 -1  1 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 4, 5, 6, 10, 11, 12, 14, 17, 19]), Candidate: [ 2  1  0  1  1  1  0  0  1  2  0  1  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  0  1 -1  1  0  0  0 -1  0  0  1  0] (Indices: [0, 1, 2, 4, 5, 6, 10, 12, 13, 14, 15, 19]), Candidate: [ 2  1  0  1  1  1  0  0  1  2 -1  2  1  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  0  1 -1  0  0  1  0 -1  1  0  0  0] (Indices: [0, 1, 2, 4, 5, 6, 10, 14, 15, 17, 18, 19]), Candidate: [ 2  1  0  1  1  1  0  0  1  2 -1  1  1  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  0  0  1 -1  1 -1  1  0 -1  1  0  0] (Indices: [0, 1, 2, 4, 5, 6, 11, 13, 15, 16, 18, 19]), Candidate: [2 1 0 1 1 1 0 0 1 1 1 0 2 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 14600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0  0  0  0 -1  0  1  0 -1  0  0  0  1] (Indices: [0, 1, 2, 4, 5, 7, 8, 9, 10, 11, 14, 15]), Candidate: [2 1 0 1 1 0 2 0 1 1 0 0 1 2 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 14650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0  0  0 -1  0  1 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 4, 5, 7, 8, 9, 10, 13, 18, 19]), Candidate: [ 2  1  0  1  1  0  2  0  1  1 -1  1  2  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0  0 -1  1 -1  1 -1  1 -1  0  0  1  0] (Indices: [0, 1, 2, 4, 5, 7, 8, 9, 11, 13, 15, 19]), Candidate: [2 1 0 1 1 0 2 0 1 0 1 0 2 0 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 14750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0  0 -1  0  1 -1  1 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 4, 5, 7, 8, 9, 12, 14, 17, 19]), Candidate: [ 2  1  0  1  1  0  2  0  1  0  0  2  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0 -1  1  0  0  0 -1  0  0  1 -1  0  1] (Indices: [0, 1, 2, 4, 5, 7, 8, 10, 11, 12, 13, 17]), Candidate: [2 1 0 1 1 0 2 0 0 2 0 1 1 0 0 1 2 0 1 7]
 -> Valid neighbor added.
Attempt 14850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0 -1  1  0 -1  0  0  0  1  0 -1  1  0] (Indices: [0, 1, 2, 4, 5, 7, 8, 10, 11, 16, 17, 19]), Candidate: [2 1 0 1 1 0 2 0 0 2 0 0 1 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 14900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0 -1  1 -1  0  1 -1  1  0 -1  0  1  0] (Indices: [0, 1, 2, 4, 5, 7, 8, 10, 13, 15, 16, 19]), Candidate: [ 2  1  0  1  1  0  2  0  0  2 -1  1  2  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0 -1  0  1  0 -1  0  1  0 -1  0  1  0] (Indices: [0, 1, 2, 4, 5, 7, 8, 11, 12, 15, 16, 19]), Candidate: [2 1 0 1 1 0 2 0 0 1 1 1 0 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 15000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0 -1  0  0  1  0  0 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 4, 5, 7, 8, 12, 13, 14, 17, 18]), Candidate: [ 2  1  0  1  1  0  2  0  0  1  0  2  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  1  0  0  0  0 -1  1 -1  0  0  0  1] (Indices: [0, 1, 2, 4, 5, 7, 9, 10, 11, 12, 13, 15]), Candidate: [ 2  1  0  1  1  0  2 -1  2  1  0  1  1  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  1  0  0 -1  0  0  1 -1  0  1  0  0] (Indices: [0, 1, 2, 4, 5, 7, 9, 10, 11, 15, 18, 19]), Candidate: [ 2  1  0  1  1  0  2 -1  2  1  0  0  1  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  1  0 -1  0  1 -1  1  0  0 -1  0  1] (Indices: [0, 1, 2, 4, 5, 7, 9, 10, 13, 15, 16, 17]), Candidate: [ 2  1  0  1  1  0  2 -1  2  1 -1  1  2  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  1 -1  1  0 -1  0  1  0  0 -1  0  1] (Indices: [0, 1, 2, 4, 5, 7, 9, 11, 12, 15, 16, 17]), Candidate: [ 2  1  0  1  1  0  2 -1  2  0  1  1  0  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  1 -1  0  1  0  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 4, 5, 7, 9, 12, 13, 14, 16, 18]), Candidate: [ 2  1  0  1  1  0  2 -1  2  0  0  2  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  1 -1  0  0  0  0  1  0  0  0  0  0] (Indices: [0, 1, 2, 4, 5, 7, 9, 15, 16, 17, 18, 19]), Candidate: [ 2  1  0  1  1  0  2 -1  2  0  0  1  1  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  0  1  0 -1  1 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 4, 5, 7, 10, 11, 13, 15, 17, 19]), Candidate: [ 2  1  0  1  1  0  2 -1  1  2  0  0  2  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  0  1 -1  1 -1  1 -1  0  1  0  0  0] (Indices: [0, 1, 2, 4, 5, 7, 10, 12, 14, 17, 18, 19]), Candidate: [ 2  1  0  1  1  0  2 -1  1  2 -1  2  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 15450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  0  0  1  0 -1  1  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 4, 5, 7, 11, 12, 14, 15, 17, 18]), Candidate: [ 2  1  0  1  1  0  2 -1  1  1  1  1  0  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  0  0  0  1 -1  1  0  0 -1  1  0  0] (Indices: [0, 1, 2, 4, 5, 7, 12, 14, 15, 16, 18, 19]), Candidate: [ 2  1  0  1  1  0  2 -1  1  1  0  2  0  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1  0  0  0 -1  0  1  0 -1  0  0  1  0] (Indices: [0, 1, 2, 4, 5, 8, 9, 10, 11, 14, 15, 19]), Candidate: [2 1 0 1 1 0 1 1 1 1 0 0 1 2 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 15600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1  0  0 -1  1 -1  0  0  1 -1  1  0  0] (Indices: [0, 1, 2, 4, 5, 8, 9, 10, 12, 16, 18, 19]), Candidate: [ 2  1  0  1  1  0  1  1  1  1 -1  2  0  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1  0 -1  1  0  0 -1  0  0  1 -1  1  0] (Indices: [0, 1, 2, 4, 5, 8, 9, 11, 12, 13, 17, 19]), Candidate: [2 1 0 1 1 0 1 1 1 0 1 1 1 0 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 15700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1  0 -1  1 -1  0  1 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 4, 5, 8, 9, 11, 14, 16, 18, 19]), Candidate: [ 2  1  0  1  1  0  1  1  1  0  1  0  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1  0 -1  0  0  1  0 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 4, 5, 8, 9, 13, 14, 16, 18, 19]), Candidate: [ 2  1  0  1  1  0  1  1  1  0  0  1  2  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1 -1  1  0 -1  1  0  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 4, 5, 8, 10, 11, 13, 14, 15, 18]), Candidate: [2 1 0 1 1 0 1 1 0 2 0 0 2 1 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 15850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1 -1  1 -1  1  0 -1  0  1  0 -1  1  0] (Indices: [0, 1, 2, 4, 5, 8, 10, 12, 13, 16, 17, 19]), Candidate: [ 2  1  0  1  1  0  1  1  0  2 -1  2  1  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1 -1  0  1  0  0 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 4, 5, 8, 11, 12, 13, 15, 16, 18]), Candidate: [2 1 0 1 1 0 1 1 0 1 1 1 1 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 15950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1 -1  0  0  1  0  0  0 -1  0  1  0  0] (Indices: [0, 1, 2, 4, 5, 8, 12, 13, 14, 15, 18, 19]), Candidate: [2 1 0 1 1 0 1 1 0 1 0 2 1 1 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 16000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  1  0  0  0 -1  0  1  0 -1  0  1  0] (Indices: [0, 1, 2, 4, 5, 9, 10, 11, 12, 15, 16, 19]), Candidate: [2 1 0 1 1 0 1 0 2 1 0 1 0 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 16050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  1  0 -1  1  0  0 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 4, 5, 9, 10, 12, 13, 14, 17, 18]), Candidate: [ 2  1  0  1  1  0  1  0  2  1 -1  2  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  1 -1  1  0  0  0  0 -1  1 -1  0  1] (Indices: [0, 1, 2, 4, 5, 9, 11, 12, 13, 14, 15, 17]), Candidate: [2 1 0 1 1 0 1 0 2 0 1 1 1 1 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 16150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  1 -1  1 -1  0  1  0  0  0 -1  1  0] (Indices: [0, 1, 2, 4, 5, 9, 11, 14, 15, 16, 17, 19]), Candidate: [2 1 0 1 1 0 1 0 2 0 1 0 1 2 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 16200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  0  1  0  0  0 -1  0  1  0 -1  1  0] (Indices: [0, 1, 2, 4, 5, 10, 11, 12, 13, 16, 17, 19]), Candidate: [2 1 0 1 1 0 1 0 1 2 0 1 1 0 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 16250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  0  1 -1  1  0 -1  1  0  0 -1  1  0] (Indices: [0, 1, 2, 4, 5, 10, 12, 13, 15, 16, 17, 19]), Candidate: [ 2  1  0  1  1  0  1  0  1  2 -1  2  1  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  0  0  0  1  0 -1  1  0  0  0  0  0] (Indices: [0, 1, 2, 4, 5, 12, 13, 15, 16, 17, 18, 19]), Candidate: [2 1 0 1 1 0 1 0 1 1 0 2 1 0 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 16350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0  0  0 -1  1 -1  0  0  0  1 -1  1  0] (Indices: [0, 1, 2, 4, 6, 7, 8, 9, 10, 12, 17, 19]), Candidate: [ 2  1  0  1  0  2  1  0  1  1 -1  2  0  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0  0 -1  1  0 -1  0  1 -1  0  1 -1  1] (Indices: [0, 1, 2, 4, 6, 7, 8, 9, 11, 12, 15, 18]), Candidate: [2 1 0 1 0 2 1 0 1 0 1 1 0 1 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 16450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0  0 -1  0  1  0 -1  1 -1  0  1 -1  1] (Indices: [0, 1, 2, 4, 6, 7, 8, 9, 12, 13, 15, 18]), Candidate: [2 1 0 1 0 2 1 0 1 0 0 2 1 0 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 16500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0  0 -1  0  0  0  1  0  0 -1  0  1  0] (Indices: [0, 1, 2, 4, 6, 7, 8, 9, 14, 15, 16, 19]), Candidate: [2 1 0 1 0 2 1 0 1 0 0 1 1 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 16550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0 -1  1  0 -1  0  1  0 -1  1 -1  0  1] (Indices: [0, 1, 2, 4, 6, 7, 8, 10, 11, 14, 15, 17]), Candidate: [2 1 0 1 0 2 1 0 0 2 0 0 1 2 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 16600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0 -1  1 -1  1 -1  0  0  1  0  0 -1  1] (Indices: [0, 1, 2, 4, 6, 7, 8, 10, 12, 16, 17, 18]), Candidate: [ 2  1  0  1  0  2  1  0  0  2 -1  2  0  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0 -1  0  1  0  0 -1  0  1 -1  0  1  0] (Indices: [0, 1, 2, 4, 6, 7, 8, 11, 12, 13, 16, 19]), Candidate: [2 1 0 1 0 2 1 0 0 1 1 1 1 0 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 16700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0 -1  0  1 -1  0  1 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 4, 6, 7, 8, 11, 14, 16, 17, 18]), Candidate: [ 2  1  0  1  0  2  1  0  0  1  1  0  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0 -1  0  0  0  1  0 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 4, 6, 7, 8, 13, 14, 16, 17, 18]), Candidate: [ 2  1  0  1  0  2  1  0  0  1  0  1  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  1  0  0 -1  1 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 4, 6, 7, 9, 10, 11, 13, 18, 19]), Candidate: [ 2  1  0  1  0  2  1 -1  2  1  0  0  2  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  1  0 -1  1 -1  0  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 4, 6, 7, 9, 10, 12, 15, 17, 19]), Candidate: [ 2  1  0  1  0  2  1 -1  2  1 -1  2  0  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  1 -1  1  0  0 -1  0  1  0 -1  0  1] (Indices: [0, 1, 2, 4, 6, 7, 9, 11, 12, 13, 16, 17]), Candidate: [ 2  1  0  1  0  2  1 -1  2  0  1  1  1  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  1 -1  1 -1  0  1  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 4, 6, 7, 9, 11, 14, 15, 17, 19]), Candidate: [ 2  1  0  1  0  2  1 -1  2  0  1  0  1  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  1 -1  0  0  1  0  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 4, 6, 7, 9, 13, 14, 15, 17, 19]), Candidate: [ 2  1  0  1  0  2  1 -1  2  0  0  1  2  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  0  1  0  0 -1  0  0  1 -1  1  0  0] (Indices: [0, 1, 2, 4, 6, 7, 10, 11, 12, 16, 18, 19]), Candidate: [ 2  1  0  1  0  2  1 -1  1  2  0  1  0  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  0  1 -1  1  0 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 4, 6, 7, 10, 12, 13, 15, 17, 18]), Candidate: [ 2  1  0  1  0  2  1 -1  1  2 -1  2  1  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 17150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  0  0  1  0  0  0 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 4, 6, 7, 11, 12, 13, 14, 17, 18]), Candidate: [ 2  1  0  1  0  2  1 -1  1  1  1  1  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 17200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  0  0  0  1  0  0  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 4, 6, 7, 12, 13, 14, 15, 16, 18]), Candidate: [ 2  1  0  1  0  2  1 -1  1  1  0  2  1  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1  0  0  0 -1  1  0 -1  0  1 -1  0  1] (Indices: [0, 1, 2, 4, 6, 8, 9, 10, 11, 13, 14, 17]), Candidate: [ 2  1  0  1  0  2  0  1  1  1  0  0  2  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1  0  0 -1  1 -1  1  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 4, 6, 8, 9, 10, 12, 14, 15, 18]), Candidate: [ 2  1  0  1  0  2  0  1  1  1 -1  2  0  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1  0  0 -1  0  0  0  1  0 -1  1  0  0] (Indices: [0, 1, 2, 4, 6, 8, 9, 10, 15, 16, 18, 19]), Candidate: [ 2  1  0  1  0  2  0  1  1  1 -1  1  1  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1  0 -1  1 -1  1 -1  1  0 -1  0  1  0] (Indices: [0, 1, 2, 4, 6, 8, 9, 11, 13, 15, 16, 19]), Candidate: [2 1 0 1 0 2 0 1 1 0 1 0 2 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 17450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1  0 -1  0  1 -1  1 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 4, 6, 8, 9, 12, 14, 16, 17, 19]), Candidate: [ 2  1  0  1  0  2  0  1  1  0  0  2  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1 -1  1  0  0 -1  1 -1  1 -1  0  1  0] (Indices: [0, 1, 2, 4, 6, 8, 10, 11, 12, 14, 16, 19]), Candidate: [ 2  1  0  1  0  2  0  1  0  2  0  1  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1 -1  1 -1  1  0  0  0 -1  1 -1  0  1] (Indices: [0, 1, 2, 4, 6, 8, 10, 12, 13, 14, 15, 17]), Candidate: [ 2  1  0  1  0  2  0  1  0  2 -1  2  1  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1 -1  1 -1  0  0  1  0  0  0 -1  1  0] (Indices: [0, 1, 2, 4, 6, 8, 10, 14, 15, 16, 17, 19]), Candidate: [ 2  1  0  1  0  2  0  1  0  2 -1  1  1  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1 -1  0  1 -1  1 -1  1  0  0  0 -1  1] (Indices: [0, 1, 2, 4, 6, 8, 11, 13, 15, 16, 17, 18]), Candidate: [2 1 0 1 0 2 0 1 0 1 1 0 2 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 17700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  1  0  0  0  0 -1  0  1 -1  0  1  0] (Indices: [0, 1, 2, 4, 6, 9, 10, 11, 12, 13, 16, 19]), Candidate: [2 1 0 1 0 2 0 0 2 1 0 1 1 0 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 17750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  1  0  0 -1  0  1 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 4, 6, 9, 10, 11, 14, 16, 17, 18]), Candidate: [ 2  1  0  1  0  2  0  0  2  1  0  0  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  1  0 -1  0  1  0 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 4, 6, 9, 10, 13, 14, 16, 17, 18]), Candidate: [ 2  1  0  1  0  2  0  0  2  1 -1  1  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 17850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  1 -1  1 -1  1  0  0  0  0 -1  0  1] (Indices: [0, 1, 2, 4, 6, 9, 11, 13, 14, 15, 16, 17]), Candidate: [2 1 0 1 0 2 0 0 2 0 1 0 2 1 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 17900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  0  1  0  0  0  0  0 -1  1 -1  0  1] (Indices: [0, 1, 2, 4, 6, 10, 11, 12, 13, 14, 15, 17]), Candidate: [2 1 0 1 0 2 0 0 1 2 0 1 1 1 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 17950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  0  1  0 -1  0  1  0  0  0 -1  1  0] (Indices: [0, 1, 2, 4, 6, 10, 11, 14, 15, 16, 17, 19]), Candidate: [2 1 0 1 0 2 0 0 1 2 0 0 1 2 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 18000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  0  0  1  0 -1  1  0  0 -1  1  0  0] (Indices: [0, 1, 2, 4, 6, 11, 12, 14, 15, 16, 18, 19]), Candidate: [2 1 0 1 0 2 0 0 1 1 1 1 0 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 18050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0  0  0  0 -1  1 -1  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 4, 7, 8, 9, 10, 11, 13, 16, 18]), Candidate: [2 1 0 1 0 1 2 0 1 1 0 0 2 0 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 18100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0  0  0 -1  1 -1  0  1  0  0 -1  0  1] (Indices: [0, 1, 2, 4, 7, 8, 9, 10, 12, 15, 16, 17]), Candidate: [ 2  1  0  1  0  1  2  0  1  1 -1  2  0  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0  0 -1  1  0  0 -1  1  0 -1  0  0  1] (Indices: [0, 1, 2, 4, 7, 8, 9, 11, 12, 13, 15, 16]), Candidate: [2 1 0 1 0 1 2 0 1 0 1 1 1 0 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 18200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0  0 -1  1 -1  0  1  0  0  0 -1  0  1] (Indices: [0, 1, 2, 4, 7, 8, 9, 11, 14, 15, 16, 17]), Candidate: [2 1 0 1 0 1 2 0 1 0 1 0 1 2 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 18250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0  0 -1  0  0  1  0  0  0  0 -1  0  1] (Indices: [0, 1, 2, 4, 7, 8, 9, 13, 14, 15, 16, 17]), Candidate: [2 1 0 1 0 1 2 0 1 0 0 1 2 1 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 18300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0 -1  1  0  0 -1  0  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 4, 7, 8, 10, 11, 12, 15, 17, 19]), Candidate: [2 1 0 1 0 1 2 0 0 2 0 1 0 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 18350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0 -1  1 -1  1  0  0 -1  0  0  1  0  0] (Indices: [0, 1, 2, 4, 7, 8, 10, 12, 13, 14, 18, 19]), Candidate: [ 2  1  0  1  0  1  2  0  0  2 -1  2  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0 -1  0  1  0  0  0  0 -1  0  0  1  0] (Indices: [0, 1, 2, 4, 7, 8, 11, 12, 13, 14, 15, 19]), Candidate: [2 1 0 1 0 1 2 0 0 1 1 1 1 1 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 18450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0 -1  0  1 -1  0  1  0 -1  1  0  0  0] (Indices: [0, 1, 2, 4, 7, 8, 11, 14, 15, 17, 18, 19]), Candidate: [2 1 0 1 0 1 2 0 0 1 1 0 1 2 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 18500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  1  0  0  0 -1  1 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 4, 7, 9, 10, 11, 12, 14, 16, 17]), Candidate: [ 2  1  0  1  0  1  2 -1  2  1  0  1  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  1  0  0 -1  0  0  0  1  0  0  0  0] (Indices: [0, 1, 2, 4, 7, 9, 10, 11, 16, 17, 18, 19]), Candidate: [ 2  1  0  1  0  1  2 -1  2  1  0  0  1  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  1  0 -1  0  1 -1  0  1  0  0  0  0] (Indices: [0, 1, 2, 4, 7, 9, 10, 13, 16, 17, 18, 19]), Candidate: [ 2  1  0  1  0  1  2 -1  2  1 -1  1  2  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  1 -1  1 -1  1  0 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 4, 7, 9, 11, 13, 14, 16, 18, 19]), Candidate: [ 2  1  0  1  0  1  2 -1  2  0  1  0  2  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  0  1  0  0  0  0 -1  0  0  1  0  0] (Indices: [0, 1, 2, 4, 7, 10, 11, 12, 13, 14, 18, 19]), Candidate: [ 2  1  0  1  0  1  2 -1  1  2  0  1  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  0  1 -1  1  0  0  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 4, 7, 10, 12, 13, 14, 15, 17, 18]), Candidate: [ 2  1  0  1  0  1  2 -1  1  2 -1  2  1  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  0  0  1 -1  1  0 -1  1  0  0  0  0] (Indices: [0, 1, 2, 4, 7, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  0  1  0  1  2 -1  1  1  1  0  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1  0  0  0 -1  1  0 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 4, 8, 9, 10, 11, 13, 14, 16, 17]), Candidate: [ 2  1  0  1  0  1  1  1  1  1  0  0  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1  0  0 -1  1  0 -1  0  0  1  0  0  0] (Indices: [0, 1, 2, 4, 8, 9, 10, 12, 13, 17, 18, 19]), Candidate: [ 2  1  0  1  0  1  1  1  1  1 -1  2  1  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1  0 -1  1  0  0 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 4, 8, 9, 11, 12, 13, 15, 17, 18]), Candidate: [2 1 0 1 0 1 1 1 1 0 1 1 1 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 19000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1  0 -1  0  1  0  0 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 4, 8, 9, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  1  0  1  0  1  1  1  1  0  0  2  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1 -1  1  0  0 -1  1 -1  0  1  0  0  0] (Indices: [0, 1, 2, 4, 8, 10, 11, 12, 14, 17, 18, 19]), Candidate: [ 2  1  0  1  0  1  1  1  0  2  0  1  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1 -1  1 -1  0  1  0  0  0 -1  1  0  0] (Indices: [0, 1, 2, 4, 8, 10, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  1  0  1  0  1  1  1  0  2 -1  1  2  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  1  0  0  0  0  0 -1  0  0  1  0  0] (Indices: [0, 1, 2, 4, 9, 10, 11, 12, 13, 14, 18, 19]), Candidate: [ 2  1  0  1  0  1  1  0  2  1  0  1  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  1  0 -1  1  0  0  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 4, 9, 10, 12, 13, 14, 15, 17, 18]), Candidate: [ 2  1  0  1  0  1  1  0  2  1 -1  2  1  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  1 -1  1 -1  1  0 -1  1  0  0  0  0] (Indices: [0, 1, 2, 4, 9, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  0  1  0  1  1  0  2  0  1  0  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  0  0  1  0  0  0  0 -1  1  0  0  0] (Indices: [0, 1, 2, 4, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [2 1 0 1 0 1 1 0 1 1 1 1 1 1 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 19350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0  0  0 -1  1 -1  0  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 5, 6, 7, 8, 9, 10, 12, 16, 18]), Candidate: [ 2  1  0  0  2  1  1  0  1  1 -1  2  0  1  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0  0 -1  1  0 -1  1 -1  0  0  0  1  0] (Indices: [0, 1, 2, 5, 6, 7, 8, 9, 11, 12, 14, 19]), Candidate: [ 2  1  0  0  2  1  1  0  1  0  1  1  0  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0  0 -1  0  1  0  0 -1  0  0  0  1  0] (Indices: [0, 1, 2, 5, 6, 7, 8, 9, 12, 13, 14, 19]), Candidate: [ 2  1  0  0  2  1  1  0  1  0  0  2  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0  0 -1  0  0  1 -1  0  0  1  0  0  0] (Indices: [0, 1, 2, 5, 6, 7, 8, 9, 13, 17, 18, 19]), Candidate: [2 1 0 0 2 1 1 0 1 0 0 1 2 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 19550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0 -1  1  0 -1  1 -1  0  0  1 -1  1  0] (Indices: [0, 1, 2, 5, 6, 7, 8, 10, 11, 13, 17, 19]), Candidate: [2 1 0 0 2 1 1 0 0 2 0 0 2 0 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 19600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0 -1  1 -1  1 -1  0  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 5, 6, 7, 8, 10, 12, 15, 17, 18]), Candidate: [ 2  1  0  0  2  1  1  0  0  2 -1  2  0  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0 -1  0  1  0  0 -1  1 -1  0  0  1  0] (Indices: [0, 1, 2, 5, 6, 7, 8, 11, 12, 13, 15, 19]), Candidate: [2 1 0 0 2 1 1 0 0 1 1 1 1 0 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 19700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0 -1  0  1 -1  0  1  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 5, 6, 7, 8, 11, 14, 15, 17, 18]), Candidate: [2 1 0 0 2 1 1 0 0 1 1 0 1 2 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 19750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0 -1  0  0  0  1  0  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 5, 6, 7, 8, 13, 14, 15, 17, 18]), Candidate: [2 1 0 0 2 1 1 0 0 1 0 1 2 1 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 19800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  1  0  0 -1  1 -1  0  1 -1  0  1  0] (Indices: [0, 1, 2, 5, 6, 7, 9, 10, 11, 13, 16, 19]), Candidate: [ 2  1  0  0  2  1  1 -1  2  1  0  0  2  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  1  0 -1  1 -1  0  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 5, 6, 7, 9, 10, 12, 15, 16, 18]), Candidate: [ 2  1  0  0  2  1  1 -1  2  1 -1  2  0  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 19900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  1 -1  1  0  0 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 5, 6, 7, 9, 11, 12, 13, 15, 17]), Candidate: [ 2  1  0  0  2  1  1 -1  2  0  1  1  1  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  1 -1  1 -1  0  1  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 5, 6, 7, 9, 11, 14, 15, 16, 18]), Candidate: [ 2  1  0  0  2  1  1 -1  2  0  1  0  1  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  1 -1  0  0  1  0  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 5, 6, 7, 9, 13, 14, 15, 16, 18]), Candidate: [ 2  1  0  0  2  1  1 -1  2  0  0  1  2  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  0  1  0  0 -1  0  1 -1  0  1  0  0] (Indices: [0, 1, 2, 5, 6, 7, 10, 11, 12, 15, 18, 19]), Candidate: [ 2  1  0  0  2  1  1 -1  1  2  0  1  0  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  0  1 -1  1  0 -1  1  0  0 -1  0  1] (Indices: [0, 1, 2, 5, 6, 7, 10, 12, 13, 15, 16, 17]), Candidate: [ 2  1  0  0  2  1  1 -1  1  2 -1  2  1  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  0  0  1  0  0  0 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 5, 6, 7, 11, 12, 13, 14, 16, 17]), Candidate: [ 2  1  0  0  2  1  1 -1  1  1  1  1  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  0  0  1 -1  0  1 -1  1  0  0  0  0] (Indices: [0, 1, 2, 5, 6, 7, 11, 14, 16, 17, 18, 19]), Candidate: [ 2  1  0  0  2  1  1 -1  1  1  1  0  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1  0  0  0  0 -1  0  0  0  0  1  0  0] (Indices: [0, 1, 2, 5, 6, 8, 9, 10, 11, 12, 18, 19]), Candidate: [2 1 0 0 2 1 0 1 1 1 0 1 0 1 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 20300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1  0  0 -1  1  0 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 5, 6, 8, 9, 10, 12, 13, 18, 19]), Candidate: [ 2  1  0  0  2  1  0  1  1  1 -1  2  1  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1  0  0 -1  0  0  1 -1  0  1  0  0  0] (Indices: [0, 1, 2, 5, 6, 8, 9, 10, 14, 17, 18, 19]), Candidate: [ 2  1  0  0  2  1  0  1  1  1 -1  1  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1  0 -1  1 -1  1  0 -1  0  0  1  0  0] (Indices: [0, 1, 2, 5, 6, 8, 9, 11, 13, 14, 18, 19]), Candidate: [ 2  1  0  0  2  1  0  1  1  0  1  0  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1  0 -1  0  1 -1  1  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 5, 6, 8, 9, 12, 14, 15, 17, 19]), Candidate: [2 1 0 0 2 1 0 1 1 0 0 2 0 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 20500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1 -1  1  0  0 -1  1  0 -1  0  0  1  0] (Indices: [0, 1, 2, 5, 6, 8, 10, 11, 12, 14, 15, 19]), Candidate: [2 1 0 0 2 1 0 1 0 2 0 1 0 2 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 20550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1 -1  1  0 -1  0  0  1 -1  1  0  0  0] (Indices: [0, 1, 2, 5, 6, 8, 10, 11, 15, 17, 18, 19]), Candidate: [2 1 0 0 2 1 0 1 0 2 0 0 1 1 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 20600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1 -1  1 -1  0  1 -1  1 -1  1  0  0  0] (Indices: [0, 1, 2, 5, 6, 8, 10, 13, 15, 17, 18, 19]), Candidate: [ 2  1  0  0  2  1  0  1  0  2 -1  1  2  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1 -1  0  1 -1  1  0 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 5, 6, 8, 11, 13, 14, 16, 17, 19]), Candidate: [ 2  1  0  0  2  1  0  1  0  1  1  0  2  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  1  0  0  0  0 -1  1 -1  0  0  1  0] (Indices: [0, 1, 2, 5, 6, 9, 10, 11, 12, 13, 15, 19]), Candidate: [2 1 0 0 2 1 0 0 2 1 0 1 1 0 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 20750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  1  0  0 -1  0  1  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 5, 6, 9, 10, 11, 14, 15, 17, 18]), Candidate: [2 1 0 0 2 1 0 0 2 1 0 0 1 2 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 20800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  1  0 -1  0  1  0  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 5, 6, 9, 10, 13, 14, 15, 17, 18]), Candidate: [ 2  1  0  0  2  1  0  0  2  1 -1  1  2  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  1 -1  1  0 -1  0  1  0 -1  1  0  0] (Indices: [0, 1, 2, 5, 6, 9, 11, 12, 15, 16, 18, 19]), Candidate: [2 1 0 0 2 1 0 0 2 0 1 1 0 1 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 20900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  1 -1  0  0  1 -1  1  0  0  0  0  0] (Indices: [0, 1, 2, 5, 6, 9, 13, 15, 16, 17, 18, 19]), Candidate: [2 1 0 0 2 1 0 0 2 0 0 1 2 0 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 20950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  0  1  0 -1  1 -1  1 -1  1  0  0  0] (Indices: [0, 1, 2, 5, 6, 10, 11, 13, 15, 17, 18, 19]), Candidate: [2 1 0 0 2 1 0 0 1 2 0 0 2 0 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 21000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  0  0  1  0  0 -1  0  1  0  0  0  0] (Indices: [0, 1, 2, 5, 6, 11, 12, 13, 16, 17, 18, 19]), Candidate: [2 1 0 0 2 1 0 0 1 1 1 1 1 0 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 21050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0  0  0  0 -1  1 -1  1 -1  0  1 -1  1] (Indices: [0, 1, 2, 5, 7, 8, 9, 10, 11, 13, 15, 18]), Candidate: [2 1 0 0 2 0 2 0 1 1 0 0 2 0 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 21100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0  0  0 -1  1 -1  1 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 5, 7, 8, 9, 10, 12, 14, 17, 18]), Candidate: [ 2  1  0  0  2  0  2  0  1  1 -1  2  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0  0 -1  1  0  0  0 -1  0  1 -1  0  1] (Indices: [0, 1, 2, 5, 7, 8, 9, 11, 12, 13, 14, 17]), Candidate: [ 2  1  0  0  2  0  2  0  1  0  1  1  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0  0 -1  1 -1  1 -1  0  1  0 -1  1  0] (Indices: [0, 1, 2, 5, 7, 8, 9, 11, 13, 16, 17, 19]), Candidate: [2 1 0 0 2 0 2 0 1 0 1 0 2 0 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 21250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0  0 -1  0  1 -1  0  1  0 -1  1  0  0] (Indices: [0, 1, 2, 5, 7, 8, 9, 12, 15, 16, 18, 19]), Candidate: [2 1 0 0 2 0 2 0 1 0 0 2 0 1 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 21300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0 -1  1  0  0 -1  0  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 5, 7, 8, 10, 11, 12, 15, 16, 18]), Candidate: [2 1 0 0 2 0 2 0 0 2 0 1 0 1 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 21350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0 -1  1 -1  1  0  0 -1  1 -1  0  1  0] (Indices: [0, 1, 2, 5, 7, 8, 10, 12, 13, 14, 16, 19]), Candidate: [ 2  1  0  0  2  0  2  0  0  2 -1  2  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0 -1  0  1  0  0  0  0  0 -1  0  0  1] (Indices: [0, 1, 2, 5, 7, 8, 11, 12, 13, 14, 15, 16]), Candidate: [2 1 0 0 2 0 2 0 0 1 1 1 1 1 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 21450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0 -1  0  1 -1  0  1  0  0  0  0 -1  1] (Indices: [0, 1, 2, 5, 7, 8, 11, 14, 15, 16, 17, 18]), Candidate: [2 1 0 0 2 0 2 0 0 1 1 0 1 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 21500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  1  0  0  0 -1  1  0 -1  1 -1  0  1] (Indices: [0, 1, 2, 5, 7, 9, 10, 11, 12, 14, 15, 17]), Candidate: [ 2  1  0  0  2  0  2 -1  2  1  0  1  0  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  1  0  0 -1  0  0  1  0  0 -1  1  0] (Indices: [0, 1, 2, 5, 7, 9, 10, 11, 15, 16, 17, 19]), Candidate: [ 2  1  0  0  2  0  2 -1  2  1  0  0  1  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  1  0 -1  0  1 -1  1  0  0 -1  1  0] (Indices: [0, 1, 2, 5, 7, 9, 10, 13, 15, 16, 17, 19]), Candidate: [ 2  1  0  0  2  0  2 -1  2  1 -1  1  2  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  1 -1  1 -1  1  0  0 -1  0  1  0  0] (Indices: [0, 1, 2, 5, 7, 9, 11, 13, 14, 15, 18, 19]), Candidate: [ 2  1  0  0  2  0  2 -1  2  0  1  0  2  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  0  1  0  0  0  0 -1  1 -1  0  1  0] (Indices: [0, 1, 2, 5, 7, 10, 11, 12, 13, 14, 16, 19]), Candidate: [ 2  1  0  0  2  0  2 -1  1  2  0  1  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  0  1 -1  1  0  0  0  0  0 -1  0  1] (Indices: [0, 1, 2, 5, 7, 10, 12, 13, 14, 15, 16, 17]), Candidate: [ 2  1  0  0  2  0  2 -1  1  2 -1  2  1  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  0  0  1 -1  1  0  0  0  0 -1  1  0] (Indices: [0, 1, 2, 5, 7, 11, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  1  0  0  2  0  2 -1  1  1  1  0  2  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1  0  0  0 -1  1  0  0 -1  1 -1  0  1] (Indices: [0, 1, 2, 5, 8, 9, 10, 11, 13, 14, 15, 17]), Candidate: [2 1 0 0 2 0 1 1 1 1 0 0 2 1 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 21900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1  0  0 -1  1  0 -1  0  1  0  0 -1  1] (Indices: [0, 1, 2, 5, 8, 9, 10, 12, 13, 16, 17, 18]), Candidate: [ 2  1  0  0  2  0  1  1  1  1 -1  2  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1  0 -1  1  0  0 -1  1  0  0 -1  0  1] (Indices: [0, 1, 2, 5, 8, 9, 11, 12, 13, 15, 16, 17]), Candidate: [2 1 0 0 2 0 1 1 1 0 1 1 1 0 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 22000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1  0 -1  0  1  0  0  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 5, 8, 9, 12, 13, 14, 15, 17, 19]), Candidate: [2 1 0 0 2 0 1 1 1 0 0 2 1 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 22050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1 -1  1  0  0 -1  1 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 5, 8, 10, 11, 12, 14, 16, 17, 18]), Candidate: [ 2  1  0  0  2  0  1  1  0  2  0  1  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1 -1  1 -1  1 -1  0  1  0  0  0  0  0] (Indices: [0, 1, 2, 5, 8, 10, 12, 15, 16, 17, 18, 19]), Candidate: [ 2  1  0  0  2  0  1  1  0  2 -1  2  0  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  1  0  0  0  0  0 -1  1 -1  0  1  0] (Indices: [0, 1, 2, 5, 9, 10, 11, 12, 13, 14, 16, 19]), Candidate: [ 2  1  0  0  2  0  1  0  2  1  0  1  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  1  0 -1  1  0  0  0  0  0 -1  0  1] (Indices: [0, 1, 2, 5, 9, 10, 12, 13, 14, 15, 16, 17]), Candidate: [ 2  1  0  0  2  0  1  0  2  1 -1  2  1  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  1 -1  1 -1  1  0  0  0  0 -1  1  0] (Indices: [0, 1, 2, 5, 9, 11, 13, 14, 15, 16, 17, 19]), Candidate: [2 1 0 0 2 0 1 0 2 0 1 0 2 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 22300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  0  0  1  0  0  0  0  0  0  0 -1  1] (Indices: [0, 1, 2, 5, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [2 1 0 0 2 0 1 0 1 1 1 1 1 1 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 22350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0  0  0  0 -1  0  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 6, 7, 8, 9, 10, 11, 14, 16, 18]), Candidate: [ 2  1  0  0  1  2  1  0  1  1  0  0  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0  0  0 -1  0  1  0  0  0 -1  0  0  1] (Indices: [0, 1, 2, 6, 7, 8, 9, 10, 13, 14, 15, 16]), Candidate: [ 2  1  0  0  1  2  1  0  1  1 -1  1  2  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0  0 -1  1  0 -1  1  0  0 -1  0  0  1] (Indices: [0, 1, 2, 6, 7, 8, 9, 11, 12, 14, 15, 16]), Candidate: [2 1 0 0 1 2 1 0 1 0 1 1 0 2 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 22500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0  0 -1  1 -1  0  0  1  0  0  0 -1  1] (Indices: [0, 1, 2, 6, 7, 8, 9, 11, 15, 16, 17, 18]), Candidate: [2 1 0 0 1 2 1 0 1 0 1 0 1 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 22550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0  0 -1  0  0  1 -1  1  0  0  0 -1  1] (Indices: [0, 1, 2, 6, 7, 8, 9, 13, 15, 16, 17, 18]), Candidate: [2 1 0 0 1 2 1 0 1 0 0 1 2 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 22600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0 -1  1  0 -1  1  0 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 6, 7, 8, 10, 11, 13, 14, 16, 17]), Candidate: [ 2  1  0  0  1  2  1  0  0  2  0  0  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0 -1  1 -1  1  0 -1  0  0  1  0  0  0] (Indices: [0, 1, 2, 6, 7, 8, 10, 12, 13, 17, 18, 19]), Candidate: [ 2  1  0  0  1  2  1  0  0  2 -1  2  1  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0 -1  0  1  0  0 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 6, 7, 8, 11, 12, 13, 15, 17, 18]), Candidate: [2 1 0 0 1 2 1 0 0 1 1 1 1 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 22750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0 -1  0  0  1  0  0 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 6, 7, 8, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  1  0  0  1  2  1  0  0  1  0  2  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  1  0  0  0 -1  0  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 6, 7, 9, 10, 11, 12, 15, 17, 19]), Candidate: [ 2  1  0  0  1  2  1 -1  2  1  0  1  0  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  1  0 -1  1  0  0 -1  0  0  1  0  0] (Indices: [0, 1, 2, 6, 7, 9, 10, 12, 13, 14, 18, 19]), Candidate: [ 2  1  0  0  1  2  1 -1  2  1 -1  2  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 22900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  1 -1  1  0  0  0  0 -1  0  0  1  0] (Indices: [0, 1, 2, 6, 7, 9, 11, 12, 13, 14, 15, 19]), Candidate: [ 2  1  0  0  1  2  1 -1  2  0  1  1  1  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  1 -1  1 -1  0  1  0 -1  1  0  0  0] (Indices: [0, 1, 2, 6, 7, 9, 11, 14, 15, 17, 18, 19]), Candidate: [ 2  1  0  0  1  2  1 -1  2  0  1  0  1  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  0  1  0  0  0 -1  0  0  1  0  0  0] (Indices: [0, 1, 2, 6, 7, 10, 11, 12, 13, 17, 18, 19]), Candidate: [ 2  1  0  0  1  2  1 -1  1  2  0  1  1  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  0  1 -1  1  0 -1  1 -1  1  0  0  0] (Indices: [0, 1, 2, 6, 7, 10, 12, 13, 15, 17, 18, 19]), Candidate: [ 2  1  0  0  1  2  1 -1  1  2 -1  2  1  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 23100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  0  0  0  0  1  0  0  0  0  0  0  0] (Indices: [0, 1, 2, 6, 7, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  0  0  1  2  1 -1  1  1  0  1  2  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1  0  0  0 -1  1 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 6, 8, 9, 10, 11, 13, 15, 17, 19]), Candidate: [2 1 0 0 1 2 0 1 1 1 0 0 2 0 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 23200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1  0  0 -1  1 -1  1 -1  0  1  0  0  0] (Indices: [0, 1, 2, 6, 8, 9, 10, 12, 14, 17, 18, 19]), Candidate: [ 2  1  0  0  1  2  0  1  1  1 -1  2  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 23250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1  0 -1  1  0 -1  1  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 6, 8, 9, 11, 12, 14, 15, 17, 18]), Candidate: [2 1 0 0 1 2 0 1 1 0 1 1 0 2 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 23300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1  0 -1  0  1 -1  1  0  0 -1  1  0  0] (Indices: [0, 1, 2, 6, 8, 9, 12, 14, 15, 16, 18, 19]), Candidate: [2 1 0 0 1 2 0 1 1 0 0 2 0 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 23350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1 -1  1  0 -1  1  0  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 6, 8, 10, 11, 13, 14, 15, 17, 19]), Candidate: [2 1 0 0 1 2 0 1 0 2 0 0 2 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 23400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1 -1  0  1  0  0  0  0 -1  0  1  0  0] (Indices: [0, 1, 2, 6, 8, 11, 12, 13, 14, 15, 18, 19]), Candidate: [2 1 0 0 1 2 0 1 0 1 1 1 1 1 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 23450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  1  0  0  0  0 -1  0  0  1  0  0  0] (Indices: [0, 1, 2, 6, 9, 10, 11, 12, 13, 17, 18, 19]), Candidate: [2 1 0 0 1 2 0 0 2 1 0 1 1 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 23500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  1  0 -1  1  0 -1  1 -1  1  0  0  0] (Indices: [0, 1, 2, 6, 9, 10, 12, 13, 15, 17, 18, 19]), Candidate: [ 2  1  0  0  1  2  0  0  2  1 -1  2  1  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  1 -1  0  0  1  0  0  0  0  0  0  0] (Indices: [0, 1, 2, 6, 9, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 1 0 0 1 2 0 0 2 0 0 1 2 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 23600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0  0  0  0  0  0  0 -1  0  0  0  1  0] (Indices: [0, 1, 2, 7, 8, 9, 10, 11, 12, 13, 14, 19]), Candidate: [ 2  1  0  0  1  1  2  0  1  1  0  1  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0  0  0  0 -1  1 -1  0  0  1  0  0  0] (Indices: [0, 1, 2, 7, 8, 9, 10, 11, 13, 17, 18, 19]), Candidate: [2 1 0 0 1 1 2 0 1 1 0 0 2 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 23700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0  0  0 -1  1 -1  0  0  1  0  0  0  0] (Indices: [0, 1, 2, 7, 8, 9, 10, 12, 16, 17, 18, 19]), Candidate: [ 2  1  0  0  1  1  2  0  1  1 -1  2  0  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0  0 -1  1  0 -1  1 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 7, 8, 9, 11, 12, 14, 16, 18, 19]), Candidate: [ 2  1  0  0  1  1  2  0  1  0  1  1  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0  0 -1  0  0  1  0  0  0  0 -1  1  0] (Indices: [0, 1, 2, 7, 8, 9, 13, 14, 15, 16, 17, 19]), Candidate: [2 1 0 0 1 1 2 0 1 0 0 1 2 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 23850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0 -1  1  0 -1  1  0 -1  0  1  0  0  0] (Indices: [0, 1, 2, 7, 8, 10, 11, 13, 14, 17, 18, 19]), Candidate: [ 2  1  0  0  1  1  2  0  0  2  0  0  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0 -1  0  1  0  0 -1  1  0  0  0 -1  1] (Indices: [0, 1, 2, 7, 8, 11, 12, 13, 15, 16, 17, 18]), Candidate: [2 1 0 0 1 1 2 0 0 1 1 1 1 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 23950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  1  0  0  0 -1  1  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 7, 9, 10, 11, 12, 14, 15, 17, 19]), Candidate: [ 2  1  0  0  1  1  2 -1  2  1  0  1  0  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  1  0 -1  1 -1  1  0 -1  1  0  0  0] (Indices: [0, 1, 2, 7, 9, 10, 12, 14, 15, 17, 18, 19]), Candidate: [ 2  1  0  0  1  1  2 -1  2  1 -1  2  0  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 24050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  0  1  0  0  0  0  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 7, 10, 11, 12, 13, 14, 15, 17, 19]), Candidate: [ 2  1  0  0  1  1  2 -1  1  2  0  1  1  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1  0  0  0  0  0  0 -1  0  0  1  0  0] (Indices: [0, 1, 2, 8, 9, 10, 11, 12, 13, 14, 18, 19]), Candidate: [ 2  1  0  0  1  1  1  1  1  1  0  1  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1  0  0 -1  1  0  0  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 8, 9, 10, 12, 13, 14, 15, 17, 18]), Candidate: [ 2  1  0  0  1  1  1  1  1  1 -1  2  1  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1  0 -1  1 -1  1  0 -1  1  0  0  0  0] (Indices: [0, 1, 2, 8, 9, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  0  0  1  1  1  1  1  0  1  0  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1 -1  0  1  0  0  0  0 -1  1  0  0  0] (Indices: [0, 1, 2, 8, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [2 1 0 0 1 1 1 1 0 1 1 1 1 1 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 24300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  0  1 -1  0  1  0  0  0  0  0  0  0  0] (Indices: [0, 1, 2, 9, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 1 0 0 1 1 1 0 2 0 0 2 1 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 24350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0  0 -1  1  0 -1  0  0  1 -1  0  0  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 9, 11, 12, 16]), Candidate: [2 0 2 0 1 1 1 0 1 0 1 1 0 1 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 24400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0  0 -1  0  0  1  0 -1  0  0  0  1  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 9, 13, 14, 19]), Candidate: [ 2  0  2  0  1  1  1  0  1  0  0  1  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0 -1  1  0 -1  0  0  1 -1  1 -1  0  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 10, 11, 15, 17]), Candidate: [2 0 2 0 1 1 1 0 0 2 0 0 1 1 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 24500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0 -1  1 -1  0  0  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 10, 14, 16, 18]), Candidate: [ 2  0  2  0  1  1  1  0  0  2 -1  1  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 24550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0 -1  0  1 -1  1 -1  0  0  0  1  0  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 11, 13, 18, 19]), Candidate: [2 0 2 0 1 1 1 0 0 1 1 0 2 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 24600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0 -1  0  0  1 -1  0  1 -1  1 -1  1  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 12, 15, 17, 19]), Candidate: [2 0 2 0 1 1 1 0 0 1 0 2 0 1 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 24650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  1  0  0 -1  1 -1  0  1 -1  0  0  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 9, 10, 11, 13, 16]), Candidate: [ 2  0  2  0  1  1  1 -1  2  1  0  0  2  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  1  0 -1  0  1 -1  0  1 -1  1 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 9, 10, 13, 16, 18]), Candidate: [ 2  0  2  0  1  1  1 -1  2  1 -1  1  2  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 24750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  1 -1  1 -1  1  0 -1  0  0  0  1  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 9, 11, 13, 14, 19]), Candidate: [ 2  0  2  0  1  1  1 -1  2  0  1  0  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 24800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  1 -1  0  1 -1  1 -1  1  0 -1  0  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 9, 12, 14, 16, 17]), Candidate: [ 2  0  2  0  1  1  1 -1  2  0  0  2  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 24850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  1 -1  0  0  0  0  0  1  0  0  0  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 9, 16, 17, 18, 19]), Candidate: [ 2  0  2  0  1  1  1 -1  2  0  0  1  1  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  0  1  0 -1  0  0  1 -1  1  0 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 10, 11, 15, 17, 18]), Candidate: [ 2  0  2  0  1  1  1 -1  1  2  0  0  1  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  0  1 -1  0  1  0 -1  0  1 -1  1  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 10, 13, 14, 17, 19]), Candidate: [ 2  0  2  0  1  1  1 -1  1  2 -1  1  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 25000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  0  0  1  0 -1  1 -1  0  1 -1  1  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 11, 12, 14, 17, 19]), Candidate: [ 2  0  2  0  1  1  1 -1  1  1  1  1  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 25050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  0  0  0  1  0  0  0 -1  0  0  1  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 12, 13, 14, 15, 19]), Candidate: [ 2  0  2  0  1  1  1 -1  1  1  0  2  1  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  0  0  0  0  0  1  0 -1  1  0  0  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 14, 15, 17, 18, 19]), Candidate: [ 2  0  2  0  1  1  1 -1  1  1  0  1  1  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1  0  0 -1  1 -1  0  0  0  1 -1  1  0] (Indices: [0, 1, 3, 4, 5, 6, 8, 9, 10, 12, 17, 19]), Candidate: [ 2  0  2  0  1  1  0  1  1  1 -1  2  0  1  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1  0 -1  1  0 -1  0  1 -1  0  1 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 8, 9, 11, 12, 15, 18]), Candidate: [2 0 2 0 1 1 0 1 1 0 1 1 0 1 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 25250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1  0 -1  0  1  0 -1  1 -1  0  1 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 8, 9, 12, 13, 15, 18]), Candidate: [2 0 2 0 1 1 0 1 1 0 0 2 1 0 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 25300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1  0 -1  0  0  0  1  0  0 -1  0  1  0] (Indices: [0, 1, 3, 4, 5, 6, 8, 9, 14, 15, 16, 19]), Candidate: [2 0 2 0 1 1 0 1 1 0 0 1 1 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 25350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1 -1  1  0 -1  0  1  0 -1  1 -1  0  1] (Indices: [0, 1, 3, 4, 5, 6, 8, 10, 11, 14, 15, 17]), Candidate: [2 0 2 0 1 1 0 1 0 2 0 0 1 2 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 25400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1 -1  1 -1  1 -1  0  0  1  0  0 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 8, 10, 12, 16, 17, 18]), Candidate: [ 2  0  2  0  1  1  0  1  0  2 -1  2  0  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1 -1  0  1  0  0 -1  0  1 -1  0  1  0] (Indices: [0, 1, 3, 4, 5, 6, 8, 11, 12, 13, 16, 19]), Candidate: [2 0 2 0 1 1 0 1 0 1 1 1 1 0 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 25500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1 -1  0  1 -1  0  1 -1  1  0  0 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 8, 11, 14, 16, 17, 18]), Candidate: [ 2  0  2  0  1  1  0  1  0  1  1  0  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1 -1  0  0  0  1  0 -1  1  0  0 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 8, 13, 14, 16, 17, 18]), Candidate: [ 2  0  2  0  1  1  0  1  0  1  0  1  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  1  0  0 -1  1 -1  0  0  0  1  0  0] (Indices: [0, 1, 3, 4, 5, 6, 9, 10, 11, 13, 18, 19]), Candidate: [2 0 2 0 1 1 0 0 2 1 0 0 2 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 25650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  1  0 -1  1 -1  0  1 -1  1 -1  1  0] (Indices: [0, 1, 3, 4, 5, 6, 9, 10, 12, 15, 17, 19]), Candidate: [ 2  0  2  0  1  1  0  0  2  1 -1  2  0  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  1 -1  1  0  0 -1  0  1  0 -1  0  1] (Indices: [0, 1, 3, 4, 5, 6, 9, 11, 12, 13, 16, 17]), Candidate: [2 0 2 0 1 1 0 0 2 0 1 1 1 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 25750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  1 -1  1 -1  0  1  0 -1  1 -1  1  0] (Indices: [0, 1, 3, 4, 5, 6, 9, 11, 14, 15, 17, 19]), Candidate: [2 0 2 0 1 1 0 0 2 0 1 0 1 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 25800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  1 -1  0  0  1  0  0 -1  1 -1  1  0] (Indices: [0, 1, 3, 4, 5, 6, 9, 13, 14, 15, 17, 19]), Candidate: [2 0 2 0 1 1 0 0 2 0 0 1 2 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 25850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  0  1  0  0 -1  0  0  1 -1  1  0  0] (Indices: [0, 1, 3, 4, 5, 6, 10, 11, 12, 16, 18, 19]), Candidate: [2 0 2 0 1 1 0 0 1 2 0 1 0 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 25900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  0  1 -1  1  0 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 10, 12, 13, 15, 17, 18]), Candidate: [ 2  0  2  0  1  1  0  0  1  2 -1  2  1  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  0  0  1  0  0  0 -1  0  1  0 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 11, 12, 13, 14, 17, 18]), Candidate: [ 2  0  2  0  1  1  0  0  1  1  1  1  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  0  0  0  1  0  0  0  0 -1  1 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 12, 13, 14, 15, 16, 18]), Candidate: [2 0 2 0 1 1 0 0 1 1 0 2 1 1 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 26050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0  0  0  0 -1  0  0  0  1 -1  1 -1  1] (Indices: [0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 16, 18]), Candidate: [2 0 2 0 1 0 2 0 1 1 0 0 1 1 0 2 0 2 0 7]
 -> Valid neighbor added.
Attempt 26100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0  0  0 -1  0  0  1 -1  0  0  1  0  0] (Indices: [0, 1, 3, 4, 5, 7, 8, 9, 10, 14, 18, 19]), Candidate: [ 2  0  2  0  1  0  2  0  1  1 -1  1  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 26150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0  0 -1  1 -1  0  1  0 -1  0  0  1  0] (Indices: [0, 1, 3, 4, 5, 7, 8, 9, 11, 14, 15, 19]), Candidate: [2 0 2 0 1 0 2 0 1 0 1 0 1 2 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 26200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0  0 -1  0  1 -1  0  0  1 -1  1  0  0] (Indices: [0, 1, 3, 4, 5, 7, 8, 9, 12, 16, 18, 19]), Candidate: [2 0 2 0 1 0 2 0 1 0 0 2 0 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 26250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0 -1  1  0  0 -1  0  1 -1  0  1 -1  1] (Indices: [0, 1, 3, 4, 5, 7, 8, 10, 11, 12, 15, 18]), Candidate: [2 0 2 0 1 0 2 0 0 2 0 1 0 1 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 26300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0 -1  1 -1  1  0 -1  1 -1  0  1 -1  1] (Indices: [0, 1, 3, 4, 5, 7, 8, 10, 12, 13, 15, 18]), Candidate: [ 2  0  2  0  1  0  2  0  0  2 -1  2  1  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0 -1  1 -1  0  0  1  0  0 -1  0  1  0] (Indices: [0, 1, 3, 4, 5, 7, 8, 10, 14, 15, 16, 19]), Candidate: [ 2  0  2  0  1  0  2  0  0  2 -1  1  1  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0 -1  0  1 -1  1  0  0 -1  0  1 -1  1] (Indices: [0, 1, 3, 4, 5, 7, 8, 11, 13, 14, 15, 18]), Candidate: [2 0 2 0 1 0 2 0 0 1 1 0 2 1 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 26450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0 -1  0  0  1  0 -1  0  1  0 -1  1  0] (Indices: [0, 1, 3, 4, 5, 7, 8, 12, 13, 16, 17, 19]), Candidate: [2 0 2 0 1 0 2 0 0 1 0 2 1 0 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 26500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  1  0  0  0 -1  0  1  0 -1  0  0  1] (Indices: [0, 1, 3, 4, 5, 7, 9, 10, 11, 12, 15, 16]), Candidate: [ 2  0  2  0  1  0  2 -1  2  1  0  1  0  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  1  0 -1  1  0 -1  1  0 -1  0  0  1] (Indices: [0, 1, 3, 4, 5, 7, 9, 10, 12, 13, 15, 16]), Candidate: [ 2  0  2  0  1  0  2 -1  2  1 -1  2  1  0  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 26600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  1  0 -1  0  0  1  0  0  0 -1  0  1] (Indices: [0, 1, 3, 4, 5, 7, 9, 10, 14, 15, 16, 17]), Candidate: [ 2  0  2  0  1  0  2 -1  2  1 -1  1  1  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 26650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  1 -1  1 -1  1  0  0  0 -1  0  0  1] (Indices: [0, 1, 3, 4, 5, 7, 9, 11, 13, 14, 15, 16]), Candidate: [ 2  0  2  0  1  0  2 -1  2  0  1  0  2  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  1 -1  0  1  0 -1  1 -1  0  1  0  0] (Indices: [0, 1, 3, 4, 5, 7, 9, 12, 13, 15, 18, 19]), Candidate: [ 2  0  2  0  1  0  2 -1  2  0  0  2  1  0  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  0  1  0  0  0 -1  0  1  0 -1  0  1] (Indices: [0, 1, 3, 4, 5, 7, 10, 11, 12, 13, 16, 17]), Candidate: [ 2  0  2  0  1  0  2 -1  1  2  0  1  1  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  0  1  0 -1  0  1  0 -1  1 -1  1  0] (Indices: [0, 1, 3, 4, 5, 7, 10, 11, 14, 15, 17, 19]), Candidate: [ 2  0  2  0  1  0  2 -1  1  2  0  0  1  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  0  1 -1  0  1  0  0 -1  1 -1  1  0] (Indices: [0, 1, 3, 4, 5, 7, 10, 13, 14, 15, 17, 19]), Candidate: [ 2  0  2  0  1  0  2 -1  1  2 -1  1  2  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 26900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  0  0  1  0 -1  0  1 -1  1  0  0  0] (Indices: [0, 1, 3, 4, 5, 7, 11, 12, 15, 17, 18, 19]), Candidate: [ 2  0  2  0  1  0  2 -1  1  1  1  1  0  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  0  0  0  0  0  1  0  0  0  0  0  0] (Indices: [0, 1, 3, 4, 5, 7, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2  0  1  0  2 -1  1  1  0  1  1  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1  0  0  0 -1  0  0  1 -1  1  0 -1  1] (Indices: [0, 1, 3, 4, 5, 8, 9, 10, 11, 15, 17, 18]), Candidate: [2 0 2 0 1 0 1 1 1 1 0 0 1 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 27050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1  0  0 -1  0  1  0 -1  0  1 -1  1  0] (Indices: [0, 1, 3, 4, 5, 8, 9, 10, 13, 14, 17, 19]), Candidate: [ 2  0  2  0  1  0  1  1  1  1 -1  1  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1  0 -1  1  0 -1  1 -1  0  1 -1  1  0] (Indices: [0, 1, 3, 4, 5, 8, 9, 11, 12, 14, 17, 19]), Candidate: [ 2  0  2  0  1  0  1  1  1  0  1  1  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1  0 -1  0  1  0  0  0 -1  0  0  1  0] (Indices: [0, 1, 3, 4, 5, 8, 9, 12, 13, 14, 15, 19]), Candidate: [2 0 2 0 1 0 1 1 1 0 0 2 1 1 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 27200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1  0 -1  0  0  0  1  0 -1  1  0  0  0] (Indices: [0, 1, 3, 4, 5, 8, 9, 14, 15, 17, 18, 19]), Candidate: [2 0 2 0 1 0 1 1 1 0 0 1 1 2 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 27250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1 -1  1  0 -1  1 -1  1  0 -1  0  1  0] (Indices: [0, 1, 3, 4, 5, 8, 10, 11, 13, 15, 16, 19]), Candidate: [2 0 2 0 1 0 1 1 0 2 0 0 2 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 27300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1 -1  1 -1  1 -1  1 -1  1  0 -1  1  0] (Indices: [0, 1, 3, 4, 5, 8, 10, 12, 14, 16, 17, 19]), Candidate: [ 2  0  2  0  1  0  1  1  0  2 -1  2  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1 -1  0  1  0 -1  1  0  0 -1  1 -1  1] (Indices: [0, 1, 3, 4, 5, 8, 11, 12, 14, 15, 16, 18]), Candidate: [2 0 2 0 1 0 1 1 0 1 1 1 0 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 27400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1 -1  0  0  1 -1  1  0  0  0  0 -1  1] (Indices: [0, 1, 3, 4, 5, 8, 12, 14, 15, 16, 17, 18]), Candidate: [2 0 2 0 1 0 1 1 0 1 0 2 0 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 27450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  1  0  0 -1  1  0  0 -1  0  1 -1  1] (Indices: [0, 1, 3, 4, 5, 9, 10, 11, 13, 14, 15, 18]), Candidate: [2 0 2 0 1 0 1 0 2 1 0 0 2 1 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 27500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  1  0 -1  1  0 -1  0  1  0 -1  1  0] (Indices: [0, 1, 3, 4, 5, 9, 10, 12, 13, 16, 17, 19]), Candidate: [ 2  0  2  0  1  0  1  0  2  1 -1  2  1  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  1 -1  1  0  0 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 3, 4, 5, 9, 11, 12, 13, 15, 16, 18]), Candidate: [2 0 2 0 1 0 1 0 2 0 1 1 1 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 27600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  1 -1  0  1  0  0  0 -1  0  1  0  0] (Indices: [0, 1, 3, 4, 5, 9, 12, 13, 14, 15, 18, 19]), Candidate: [2 0 2 0 1 0 1 0 2 0 0 2 1 1 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 27650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  0  1  0  0 -1  1 -1  1  0 -1  1  0] (Indices: [0, 1, 3, 4, 5, 10, 11, 12, 14, 16, 17, 19]), Candidate: [ 2  0  2  0  1  0  1  0  1  2  0  1  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  0  1 -1  0  1  0  0  0  0  0 -1  1] (Indices: [0, 1, 3, 4, 5, 10, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  0  2  0  1  0  1  0  1  2 -1  1  2  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0  0  0  0 -1  1  0 -1  0  0  0  0  1] (Indices: [0, 1, 3, 4, 6, 7, 8, 9, 10, 11, 13, 14]), Candidate: [ 2  0  2  0  0  2  1  0  1  1  0  0  2  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0  0  0 -1  0  1 -1  1 -1  0  0  1  0] (Indices: [0, 1, 3, 4, 6, 7, 8, 9, 10, 13, 15, 19]), Candidate: [ 2  0  2  0  0  2  1  0  1  1 -1  1  2  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0  0 -1  1 -1  1  0 -1  0  1 -1  0  1] (Indices: [0, 1, 3, 4, 6, 7, 8, 9, 11, 13, 14, 17]), Candidate: [ 2  0  2  0  0  2  1  0  1  0  1  0  2  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0  0 -1  0  1 -1  1  0 -1  0  1 -1  1] (Indices: [0, 1, 3, 4, 6, 7, 8, 9, 12, 14, 15, 18]), Candidate: [2 0 2 0 0 2 1 0 1 0 0 2 0 2 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 27950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0  0 -1  0  0  0  0  1  0 -1  1  0  0] (Indices: [0, 1, 3, 4, 6, 7, 8, 9, 15, 16, 18, 19]), Candidate: [2 0 2 0 0 2 1 0 1 0 0 1 1 1 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 28000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0 -1  1  0 -1  0  0  1  0 -1  1 -1  1] (Indices: [0, 1, 3, 4, 6, 7, 8, 10, 11, 15, 16, 18]), Candidate: [2 0 2 0 0 2 1 0 0 2 0 0 1 1 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 28050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0 -1  1 -1  0  1  0 -1  1 -1  0  1  0] (Indices: [0, 1, 3, 4, 6, 7, 8, 10, 13, 14, 16, 19]), Candidate: [ 2  0  2  0  0  2  1  0  0  2 -1  1  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0 -1  0  1  0 -1  1 -1  1 -1  0  1  0] (Indices: [0, 1, 3, 4, 6, 7, 8, 11, 12, 14, 16, 19]), Candidate: [ 2  0  2  0  0  2  1  0  0  1  1  1  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0 -1  0  0  1  0  0  0 -1  1 -1  0  1] (Indices: [0, 1, 3, 4, 6, 7, 8, 12, 13, 14, 15, 17]), Candidate: [2 0 2 0 0 2 1 0 0 1 0 2 1 1 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 28200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0 -1  0  0  0  0  1  0  0  0 -1  1  0] (Indices: [0, 1, 3, 4, 6, 7, 8, 14, 15, 16, 17, 19]), Candidate: [2 0 2 0 0 2 1 0 0 1 0 1 1 2 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 28250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  1  0  0 -1  0  1 -1  0  0  1  0  0] (Indices: [0, 1, 3, 4, 6, 7, 9, 10, 11, 14, 18, 19]), Candidate: [ 2  0  2  0  0  2  1 -1  2  1  0  0  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  1  0 -1  0  1  0 -1  1  0 -1  0  1] (Indices: [0, 1, 3, 4, 6, 7, 9, 10, 13, 14, 16, 17]), Candidate: [ 2  0  2  0  0  2  1 -1  2  1 -1  1  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 28350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  1 -1  1  0 -1  1 -1  1  0 -1  0  1] (Indices: [0, 1, 3, 4, 6, 7, 9, 11, 12, 14, 16, 17]), Candidate: [ 2  0  2  0  0  2  1 -1  2  0  1  1  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  1 -1  1 -1  0  0  0  1  0  0  0  0] (Indices: [0, 1, 3, 4, 6, 7, 9, 11, 16, 17, 18, 19]), Candidate: [ 2  0  2  0  0  2  1 -1  2  0  1  0  1  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  1 -1  0  0  1 -1  0  1  0  0  0  0] (Indices: [0, 1, 3, 4, 6, 7, 9, 13, 16, 17, 18, 19]), Candidate: [ 2  0  2  0  0  2  1 -1  2  0  0  1  2  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  0  1  0 -1  1  0 -1  0  1 -1  1  0] (Indices: [0, 1, 3, 4, 6, 7, 10, 11, 13, 14, 17, 19]), Candidate: [ 2  0  2  0  0  2  1 -1  1  2  0  0  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  0  1 -1  1 -1  1  0 -1  1  0 -1  1] (Indices: [0, 1, 3, 4, 6, 7, 10, 12, 14, 15, 17, 18]), Candidate: [ 2  0  2  0  0  2  1 -1  1  2 -1  2  0  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  0  0  1  0  0 -1  0  1  0 -1  1  0] (Indices: [0, 1, 3, 4, 6, 7, 11, 12, 13, 16, 17, 19]), Candidate: [ 2  0  2  0  0  2  1 -1  1  1  1  1  1  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  0  0  0  1  0 -1  1  0  0 -1  1  0] (Indices: [0, 1, 3, 4, 6, 7, 12, 13, 15, 16, 17, 19]), Candidate: [ 2  0  2  0  0  2  1 -1  1  1  0  2  1  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1  0  0  0 -1  1 -1  0  0  1  0 -1  1] (Indices: [0, 1, 3, 4, 6, 8, 9, 10, 11, 13, 17, 18]), Candidate: [2 0 2 0 0 2 0 1 1 1 0 0 2 0 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 28750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1  0  0 -1  1 -1  0  1  0 -1  0  1  0] (Indices: [0, 1, 3, 4, 6, 8, 9, 10, 12, 15, 16, 19]), Candidate: [ 2  0  2  0  0  2  0  1  1  1 -1  2  0  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1  0 -1  1  0  0 -1  1 -1  0  1 -1  1] (Indices: [0, 1, 3, 4, 6, 8, 9, 11, 12, 13, 15, 18]), Candidate: [2 0 2 0 0 2 0 1 1 0 1 1 1 0 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 28850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1  0 -1  1 -1  0  1  0  0 -1  0  1  0] (Indices: [0, 1, 3, 4, 6, 8, 9, 11, 14, 15, 16, 19]), Candidate: [2 0 2 0 0 2 0 1 1 0 1 0 1 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 28900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1  0 -1  0  0  1  0  0  0 -1  0  1  0] (Indices: [0, 1, 3, 4, 6, 8, 9, 13, 14, 15, 16, 19]), Candidate: [2 0 2 0 0 2 0 1 1 0 0 1 2 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 28950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1 -1  1  0  0 -1  0  0  1  0  0 -1  1] (Indices: [0, 1, 3, 4, 6, 8, 10, 11, 12, 16, 17, 18]), Candidate: [2 0 2 0 0 2 0 1 0 2 0 1 0 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 29000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1 -1  1 -1  1  0 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 3, 4, 6, 8, 10, 12, 13, 15, 16, 18]), Candidate: [ 2  0  2  0  0  2  0  1  0  2 -1  2  1  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1 -1  0  1  0  0  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 3, 4, 6, 8, 11, 12, 13, 14, 16, 18]), Candidate: [ 2  0  2  0  0  2  0  1  0  1  1  1  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1 -1  0  1 -1  0  0  1  0  0  0  0  0] (Indices: [0, 1, 3, 4, 6, 8, 11, 15, 16, 17, 18, 19]), Candidate: [2 0 2 0 0 2 0 1 0 1 1 0 1 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 29150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  1  0  0  0 -1  1 -1  1 -1  0  1  0] (Indices: [0, 1, 3, 4, 6, 9, 10, 11, 12, 14, 16, 19]), Candidate: [ 2  0  2  0  0  2  0  0  2  1  0  1  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  1  0 -1  1  0  0  0 -1  1 -1  0  1] (Indices: [0, 1, 3, 4, 6, 9, 10, 12, 13, 14, 15, 17]), Candidate: [ 2  0  2  0  0  2  0  0  2  1 -1  2  1  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  1  0 -1  0  0  1  0  0  0 -1  1  0] (Indices: [0, 1, 3, 4, 6, 9, 10, 14, 15, 16, 17, 19]), Candidate: [ 2  0  2  0  0  2  0  0  2  1 -1  1  1  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  1 -1  1 -1  1 -1  1  0  0  0 -1  1] (Indices: [0, 1, 3, 4, 6, 9, 11, 13, 15, 16, 17, 18]), Candidate: [2 0 2 0 0 2 0 0 2 0 1 0 2 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 29350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  0  1  0  0  0 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 3, 4, 6, 10, 11, 12, 13, 15, 16, 18]), Candidate: [2 0 2 0 0 2 0 0 1 2 0 1 1 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 29400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  0  1 -1  1  0  0  0 -1  0  1  0  0] (Indices: [0, 1, 3, 4, 6, 10, 12, 13, 14, 15, 18, 19]), Candidate: [ 2  0  2  0  0  2  0  0  1  2 -1  2  1  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  0  0  1 -1  0  1  0  0  0  0  0  0] (Indices: [0, 1, 3, 4, 6, 11, 14, 15, 16, 17, 18, 19]), Candidate: [2 0 2 0 0 2 0 0 1 1 1 0 1 2 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 29500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0  0  0  0 -1  0  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 3, 4, 7, 8, 9, 10, 11, 14, 16, 18]), Candidate: [ 2  0  2  0  0  1  2  0  1  1  0  0  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0  0  0 -1  0  1  0  0  0 -1  0  0  1] (Indices: [0, 1, 3, 4, 7, 8, 9, 10, 13, 14, 15, 16]), Candidate: [ 2  0  2  0  0  1  2  0  1  1 -1  1  2  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0  0 -1  1  0 -1  1  0  0 -1  0  0  1] (Indices: [0, 1, 3, 4, 7, 8, 9, 11, 12, 14, 15, 16]), Candidate: [2 0 2 0 0 1 2 0 1 0 1 1 0 2 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 29650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0  0 -1  1 -1  0  0  1  0  0  0 -1  1] (Indices: [0, 1, 3, 4, 7, 8, 9, 11, 15, 16, 17, 18]), Candidate: [2 0 2 0 0 1 2 0 1 0 1 0 1 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 29700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0  0 -1  0  0  1 -1  1  0  0  0 -1  1] (Indices: [0, 1, 3, 4, 7, 8, 9, 13, 15, 16, 17, 18]), Candidate: [2 0 2 0 0 1 2 0 1 0 0 1 2 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 29750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0 -1  1  0 -1  1  0 -1  1  0 -1  0  1] (Indices: [0, 1, 3, 4, 7, 8, 10, 11, 13, 14, 16, 17]), Candidate: [ 2  0  2  0  0  1  2  0  0  2  0  0  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0 -1  1 -1  1  0 -1  0  0  1  0  0  0] (Indices: [0, 1, 3, 4, 7, 8, 10, 12, 13, 17, 18, 19]), Candidate: [ 2  0  2  0  0  1  2  0  0  2 -1  2  1  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0 -1  0  1  0  0 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 3, 4, 7, 8, 11, 12, 13, 15, 17, 18]), Candidate: [2 0 2 0 0 1 2 0 0 1 1 1 1 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 29900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0 -1  0  0  1  0  0 -1  1  0 -1  1  0] (Indices: [0, 1, 3, 4, 7, 8, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  0  2  0  0  1  2  0  0  1  0  2  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  1  0  0  0 -1  0  1 -1  1 -1  1  0] (Indices: [0, 1, 3, 4, 7, 9, 10, 11, 12, 15, 17, 19]), Candidate: [ 2  0  2  0  0  1  2 -1  2  1  0  1  0  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  1  0 -1  1  0  0 -1  0  0  1  0  0] (Indices: [0, 1, 3, 4, 7, 9, 10, 12, 13, 14, 18, 19]), Candidate: [ 2  0  2  0  0  1  2 -1  2  1 -1  2  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 30050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  1 -1  1  0  0  0  0 -1  0  0  1  0] (Indices: [0, 1, 3, 4, 7, 9, 11, 12, 13, 14, 15, 19]), Candidate: [ 2  0  2  0  0  1  2 -1  2  0  1  1  1  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  1 -1  1 -1  0  1  0 -1  1  0  0  0] (Indices: [0, 1, 3, 4, 7, 9, 11, 14, 15, 17, 18, 19]), Candidate: [ 2  0  2  0  0  1  2 -1  2  0  1  0  1  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  0  1  0  0  0 -1  0  0  1  0  0  0] (Indices: [0, 1, 3, 4, 7, 10, 11, 12, 13, 17, 18, 19]), Candidate: [ 2  0  2  0  0  1  2 -1  1  2  0  1  1  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  0  1 -1  1  0 -1  1 -1  1  0  0  0] (Indices: [0, 1, 3, 4, 7, 10, 12, 13, 15, 17, 18, 19]), Candidate: [ 2  0  2  0  0  1  2 -1  1  2 -1  2  1  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 30250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  0  0  0  0  1  0  0  0  0  0  0  0] (Indices: [0, 1, 3, 4, 7, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2  0  0  1  2 -1  1  1  0  1  2  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1  0  0  0 -1  1 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 3, 4, 8, 9, 10, 11, 13, 15, 17, 19]), Candidate: [2 0 2 0 0 1 1 1 1 1 0 0 2 0 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 30350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1  0  0 -1  1 -1  1 -1  0  1  0  0  0] (Indices: [0, 1, 3, 4, 8, 9, 10, 12, 14, 17, 18, 19]), Candidate: [ 2  0  2  0  0  1  1  1  1  1 -1  2  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 30400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1  0 -1  1  0 -1  1  0 -1  1  0 -1  1] (Indices: [0, 1, 3, 4, 8, 9, 11, 12, 14, 15, 17, 18]), Candidate: [2 0 2 0 0 1 1 1 1 0 1 1 0 2 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 30450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1  0 -1  0  1 -1  1  0  0 -1  1  0  0] (Indices: [0, 1, 3, 4, 8, 9, 12, 14, 15, 16, 18, 19]), Candidate: [2 0 2 0 0 1 1 1 1 0 0 2 0 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 30500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1 -1  1  0 -1  1  0  0 -1  1 -1  1  0] (Indices: [0, 1, 3, 4, 8, 10, 11, 13, 14, 15, 17, 19]), Candidate: [2 0 2 0 0 1 1 1 0 2 0 0 2 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 30550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1 -1  0  1  0  0  0  0 -1  0  1  0  0] (Indices: [0, 1, 3, 4, 8, 11, 12, 13, 14, 15, 18, 19]), Candidate: [2 0 2 0 0 1 1 1 0 1 1 1 1 1 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 30600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  1  0  0  0  0 -1  0  0  1  0  0  0] (Indices: [0, 1, 3, 4, 9, 10, 11, 12, 13, 17, 18, 19]), Candidate: [2 0 2 0 0 1 1 0 2 1 0 1 1 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 30650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  1  0 -1  1  0 -1  1 -1  1  0  0  0] (Indices: [0, 1, 3, 4, 9, 10, 12, 13, 15, 17, 18, 19]), Candidate: [ 2  0  2  0  0  1  1  0  2  1 -1  2  1  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  1 -1  0  0  1  0  0  0  0  0  0  0] (Indices: [0, 1, 3, 4, 9, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 0 2 0 0 1 1 0 2 0 0 1 2 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 30750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0  0  0  0  0 -1  0  0  0  1 -1  0  1] (Indices: [0, 1, 3, 5, 6, 7, 8, 9, 10, 11, 12, 17]), Candidate: [ 2  0  2 -1  2  1  1  0  1  1  0  1  0  1  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0  0  0 -1  0  1 -1  1  0 -1  0  0  1] (Indices: [0, 1, 3, 5, 6, 7, 8, 9, 10, 13, 15, 16]), Candidate: [ 2  0  2 -1  2  1  1  0  1  1 -1  1  2  0  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 30850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0  0 -1  1  0 -1  0  0  0  0  1  0  0] (Indices: [0, 1, 3, 5, 6, 7, 8, 9, 11, 12, 18, 19]), Candidate: [ 2  0  2 -1  2  1  1  0  1  0  1  1  0  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0  0 -1  0  1  0 -1  0  0  0  1  0  0] (Indices: [0, 1, 3, 5, 6, 7, 8, 9, 12, 13, 18, 19]), Candidate: [ 2  0  2 -1  2  1  1  0  1  0  0  2  1  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0  0 -1  0  0  0  1 -1  0  1  0  0  0] (Indices: [0, 1, 3, 5, 6, 7, 8, 9, 14, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  1  1  0  1  0  0  1  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0 -1  1  0 -1  0  1 -1  0  1 -1  1  0] (Indices: [0, 1, 3, 5, 6, 7, 8, 10, 11, 14, 17, 19]), Candidate: [ 2  0  2 -1  2  1  1  0  0  2  0  0  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0 -1  1 -1  0  1  0  0 -1  0  0  1  0] (Indices: [0, 1, 3, 5, 6, 7, 8, 10, 13, 14, 15, 19]), Candidate: [ 2  0  2 -1  2  1  1  0  0  2 -1  1  2  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0 -1  0  1  0 -1  1  0 -1  0  0  1  0] (Indices: [0, 1, 3, 5, 6, 7, 8, 11, 12, 14, 15, 19]), Candidate: [ 2  0  2 -1  2  1  1  0  0  1  1  1  0  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0 -1  0  1 -1  0  0  1 -1  1  0  0  0] (Indices: [0, 1, 3, 5, 6, 7, 8, 11, 15, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  1  1  0  0  1  1  0  1  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0 -1  0  0  0  1 -1  1 -1  1  0  0  0] (Indices: [0, 1, 3, 5, 6, 7, 8, 13, 15, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  1  1  0  0  1  0  1  2  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  1  0  0 -1  0  1 -1  1 -1  0  1  0] (Indices: [0, 1, 3, 5, 6, 7, 9, 10, 11, 14, 16, 19]), Candidate: [ 2  0  2 -1  2  1  1 -1  2  1  0  0  1  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 31300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  1  0 -1  0  1  0  0 -1  1 -1  0  1] (Indices: [0, 1, 3, 5, 6, 7, 9, 10, 13, 14, 15, 17]), Candidate: [ 2  0  2 -1  2  1  1 -1  2  1 -1  1  2  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 31350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  1 -1  1  0 -1  1  0 -1  1 -1  0  1] (Indices: [0, 1, 3, 5, 6, 7, 9, 11, 12, 14, 15, 17]), Candidate: [ 2  0  2 -1  2  1  1 -1  2  0  1  1  0  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  1 -1  1 -1  0  0  1  0  0 -1  1  0] (Indices: [0, 1, 3, 5, 6, 7, 9, 11, 15, 16, 17, 19]), Candidate: [ 2  0  2 -1  2  1  1 -1  2  0  1  0  1  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  1 -1  0  0  1 -1  1  0  0 -1  1  0] (Indices: [0, 1, 3, 5, 6, 7, 9, 13, 15, 16, 17, 19]), Candidate: [ 2  0  2 -1  2  1  1 -1  2  0  0  1  2  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  0  1  0 -1  1  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 3, 5, 6, 7, 10, 11, 13, 14, 16, 18]), Candidate: [ 2  0  2 -1  2  1  1 -1  1  2  0  0  2  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 31550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  0  1 -1  1 -1  1  0  0  0 -1  0  1] (Indices: [0, 1, 3, 5, 6, 7, 10, 12, 14, 15, 16, 17]), Candidate: [ 2  0  2 -1  2  1  1 -1  1  2 -1  2  0  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 31600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  0  0  1  0  0 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 3, 5, 6, 7, 11, 12, 13, 15, 17, 19]), Candidate: [ 2  0  2 -1  2  1  1 -1  1  1  1  1  1  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  0  0  0  1  0  0 -1  1 -1  1  0  0] (Indices: [0, 1, 3, 5, 6, 7, 12, 13, 14, 16, 18, 19]), Candidate: [ 2  0  2 -1  2  1  1 -1  1  1  0  2  1  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 31700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1  0  0  0 -1  1 -1  0  1  0 -1  0  1] (Indices: [0, 1, 3, 5, 6, 8, 9, 10, 11, 13, 16, 17]), Candidate: [ 2  0  2 -1  2  1  0  1  1  1  0  0  2  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1  0  0 -1  1 -1  1 -1  0  0  1  0  0] (Indices: [0, 1, 3, 5, 6, 8, 9, 10, 12, 14, 18, 19]), Candidate: [ 2  0  2 -1  2  1  0  1  1  1 -1  2  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 31800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1  0 -1  1  0  0  0 -1  0  0  0  1  0] (Indices: [0, 1, 3, 5, 6, 8, 9, 11, 12, 13, 14, 19]), Candidate: [ 2  0  2 -1  2  1  0  1  1  0  1  1  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1  0 -1  1 -1  1 -1  0  0  1  0  0  0] (Indices: [0, 1, 3, 5, 6, 8, 9, 11, 13, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  1  0  1  1  0  1  0  2  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1  0 -1  0  1 -1  0  0  1  0  0  0  0] (Indices: [0, 1, 3, 5, 6, 8, 9, 12, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  1  0  1  1  0  0  2  0  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1 -1  1  0  0 -1  0  1 -1  1  0 -1  1] (Indices: [0, 1, 3, 5, 6, 8, 10, 11, 12, 15, 17, 18]), Candidate: [ 2  0  2 -1  2  1  0  1  0  2  0  1  0  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1 -1  1 -1  1  0  0 -1  0  1 -1  1  0] (Indices: [0, 1, 3, 5, 6, 8, 10, 12, 13, 14, 17, 19]), Candidate: [ 2  0  2 -1  2  1  0  1  0  2 -1  2  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 32050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1 -1  0  1  0  0  0  0 -1  0  1 -1  1] (Indices: [0, 1, 3, 5, 6, 8, 11, 12, 13, 14, 15, 18]), Candidate: [ 2  0  2 -1  2  1  0  1  0  1  1  1  1  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1 -1  0  1 -1  0  1  0  0 -1  1  0  0] (Indices: [0, 1, 3, 5, 6, 8, 11, 14, 15, 16, 18, 19]), Candidate: [ 2  0  2 -1  2  1  0  1  0  1  1  0  1  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  1  0  0  0 -1  1  0 -1  0  0  1  0] (Indices: [0, 1, 3, 5, 6, 9, 10, 11, 12, 14, 15, 19]), Candidate: [ 2  0  2 -1  2  1  0  0  2  1  0  1  0  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  1  0  0 -1  0  0  1 -1  1  0  0  0] (Indices: [0, 1, 3, 5, 6, 9, 10, 11, 15, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  1  0  0  2  1  0  0  1  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  1  0 -1  0  1 -1  1 -1  1  0  0  0] (Indices: [0, 1, 3, 5, 6, 9, 10, 13, 15, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  1  0  0  2  1 -1  1  2  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  1 -1  1 -1  1  0 -1  1  0 -1  1  0] (Indices: [0, 1, 3, 5, 6, 9, 11, 13, 14, 16, 17, 19]), Candidate: [ 2  0  2 -1  2  1  0  0  2  0  1  0  2  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  0  1  0  0  0  0 -1  0  1 -1  1  0] (Indices: [0, 1, 3, 5, 6, 10, 11, 12, 13, 14, 17, 19]), Candidate: [ 2  0  2 -1  2  1  0  0  1  2  0  1  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  0  1 -1  1  0  0  0  0 -1  0  1  0] (Indices: [0, 1, 3, 5, 6, 10, 12, 13, 14, 15, 16, 19]), Candidate: [ 2  0  2 -1  2  1  0  0  1  2 -1  2  1  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  0  0  1 -1  1  0  0 -1  1  0  0  0] (Indices: [0, 1, 3, 5, 6, 11, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  1  0  0  1  1  1  0  2  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0  0  0  0 -1  0  1  0 -1  0  1 -1  1] (Indices: [0, 1, 3, 5, 7, 8, 9, 10, 11, 14, 15, 18]), Candidate: [ 2  0  2 -1  2  0  2  0  1  1  0  0  1  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0  0  0 -1  1 -1  0  0  1  0 -1  1  0] (Indices: [0, 1, 3, 5, 7, 8, 9, 10, 12, 16, 17, 19]), Candidate: [ 2  0  2 -1  2  0  2  0  1  1 -1  2  0  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0  0 -1  1  0  0 -1  0  0  1  0 -1  1] (Indices: [0, 1, 3, 5, 7, 8, 9, 11, 12, 13, 17, 18]), Candidate: [ 2  0  2 -1  2  0  2  0  1  0  1  1  1  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0  0 -1  1 -1  0  1 -1  1  0 -1  1  0] (Indices: [0, 1, 3, 5, 7, 8, 9, 11, 14, 16, 17, 19]), Candidate: [ 2  0  2 -1  2  0  2  0  1  0  1  0  1  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0  0 -1  0  0  1  0 -1  1  0 -1  1  0] (Indices: [0, 1, 3, 5, 7, 8, 9, 13, 14, 16, 17, 19]), Candidate: [ 2  0  2 -1  2  0  2  0  1  0  0  1  2  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0 -1  1  0 -1  1  0  0 -1  1 -1  0  1] (Indices: [0, 1, 3, 5, 7, 8, 10, 11, 13, 14, 15, 17]), Candidate: [ 2  0  2 -1  2  0  2  0  0  2  0  0  2  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0 -1  1 -1  1  0 -1  0  1  0  0 -1  1] (Indices: [0, 1, 3, 5, 7, 8, 10, 12, 13, 16, 17, 18]), Candidate: [ 2  0  2 -1  2  0  2  0  0  2 -1  2  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0 -1  0  1  0  0 -1  1  0  0 -1  0  1] (Indices: [0, 1, 3, 5, 7, 8, 11, 12, 13, 15, 16, 17]), Candidate: [ 2  0  2 -1  2  0  2  0  0  1  1  1  1  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0 -1  0  0  1  0  0  0 -1  1 -1  1  0] (Indices: [0, 1, 3, 5, 7, 8, 12, 13, 14, 15, 17, 19]), Candidate: [ 2  0  2 -1  2  0  2  0  0  1  0  2  1  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  1  0  0  0 -1  0  1  0 -1  1 -1  1] (Indices: [0, 1, 3, 5, 7, 9, 10, 11, 12, 15, 16, 18]), Candidate: [ 2  0  2 -1  2  0  2 -1  2  1  0  1  0  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 33000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  1  0 -1  1  0  0 -1  1 -1  0  1  0] (Indices: [0, 1, 3, 5, 7, 9, 10, 12, 13, 14, 16, 19]), Candidate: [ 2  0  2 -1  2  0  2 -1  2  1 -1  2  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 33050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  1 -1  1  0  0  0  0  0 -1  0  0  1] (Indices: [0, 1, 3, 5, 7, 9, 11, 12, 13, 14, 15, 16]), Candidate: [ 2  0  2 -1  2  0  2 -1  2  0  1  1  1  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 33100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  1 -1  1 -1  0  1  0  0  0  0 -1  1] (Indices: [0, 1, 3, 5, 7, 9, 11, 14, 15, 16, 17, 18]), Candidate: [ 2  0  2 -1  2  0  2 -1  2  0  1  0  1  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 33150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  0  1  0  0  0 -1  0  1  0  0 -1  1] (Indices: [0, 1, 3, 5, 7, 10, 11, 12, 13, 16, 17, 18]), Candidate: [ 2  0  2 -1  2  0  2 -1  1  2  0  1  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 33200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  0  1 -1  1  0 -1  1  0  0  0 -1  1] (Indices: [0, 1, 3, 5, 7, 10, 12, 13, 15, 16, 17, 18]), Candidate: [ 2  0  2 -1  2  0  2 -1  1  2 -1  2  1  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 33250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  0  0  0  1  0  0 -1  1  0  0  0  0] (Indices: [0, 1, 3, 5, 7, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  0  2 -1  1  1  0  2  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 33300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1  0  0  0 -1  1 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 3, 5, 8, 9, 10, 11, 13, 15, 16, 18]), Candidate: [ 2  0  2 -1  2  0  1  1  1  1  0  0  2  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1  0  0 -1  1 -1  1 -1  1  0  0 -1  1] (Indices: [0, 1, 3, 5, 8, 9, 10, 12, 14, 16, 17, 18]), Candidate: [ 2  0  2 -1  2  0  1  1  1  1 -1  2  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 33400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1  0 -1  1  0 -1  1  0  0  0 -1  0  1] (Indices: [0, 1, 3, 5, 8, 9, 11, 12, 14, 15, 16, 17]), Candidate: [ 2  0  2 -1  2  0  1  1  1  0  1  1  0  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1  0 -1  0  1  0 -1  0  1  0  0  0  0] (Indices: [0, 1, 3, 5, 8, 9, 12, 13, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  0  1  1  1  0  0  2  1  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1 -1  1  0 -1  1  0  0  0 -1  1 -1  1] (Indices: [0, 1, 3, 5, 8, 10, 11, 13, 14, 15, 16, 18]), Candidate: [ 2  0  2 -1  2  0  1  1  0  2  0  0  2  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1 -1  0  1  0  0  0  0  0 -1  0  1  0] (Indices: [0, 1, 3, 5, 8, 11, 12, 13, 14, 15, 16, 19]), Candidate: [ 2  0  2 -1  2  0  1  1  0  1  1  1  1  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  1  0  0  0  0 -1  0  1  0  0 -1  1] (Indices: [0, 1, 3, 5, 9, 10, 11, 12, 13, 16, 17, 18]), Candidate: [ 2  0  2 -1  2  0  1  0  2  1  0  1  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  1  0 -1  1  0 -1  1  0  0  0 -1  1] (Indices: [0, 1, 3, 5, 9, 10, 12, 13, 15, 16, 17, 18]), Candidate: [ 2  0  2 -1  2  0  1  0  2  1 -1  2  1  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 33700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  1 -1  0  1  0  0 -1  1  0  0  0  0] (Indices: [0, 1, 3, 5, 9, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  0  1  0  2  0  0  2  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 33750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0  0  0  0  0  0 -1  1 -1  0  0  0  1] (Indices: [0, 1, 3, 6, 7, 8, 9, 10, 11, 12, 13, 15]), Candidate: [ 2  0  2 -1  1  2  1  0  1  1  0  1  1  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0  0  0  0 -1  0  0  1 -1  0  1  0  0] (Indices: [0, 1, 3, 6, 7, 8, 9, 10, 11, 15, 18, 19]), Candidate: [ 2  0  2 -1  1  2  1  0  1  1  0  0  1  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0  0  0 -1  0  1 -1  1  0  0 -1  0  1] (Indices: [0, 1, 3, 6, 7, 8, 9, 10, 13, 15, 16, 17]), Candidate: [ 2  0  2 -1  1  2  1  0  1  1 -1  1  2  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 33900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0  0 -1  1  0 -1  0  1  0  0 -1  0  1] (Indices: [0, 1, 3, 6, 7, 8, 9, 11, 12, 15, 16, 17]), Candidate: [ 2  0  2 -1  1  2  1  0  1  0  1  1  0  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0  0 -1  0  1  0  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 3, 6, 7, 8, 9, 12, 13, 14, 16, 18]), Candidate: [ 2  0  2 -1  1  2  1  0  1  0  0  2  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0  0 -1  0  0  0  0  1  0  0  0  0  0] (Indices: [0, 1, 3, 6, 7, 8, 9, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  2  1  0  1  0  0  1  1  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0 -1  1  0 -1  1 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 3, 6, 7, 8, 10, 11, 13, 15, 17, 19]), Candidate: [ 2  0  2 -1  1  2  1  0  0  2  0  0  2  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0 -1  1 -1  1 -1  1 -1  0  1  0  0  0] (Indices: [0, 1, 3, 6, 7, 8, 10, 12, 14, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  2  1  0  0  2 -1  2  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 34150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0 -1  0  1  0 -1  1  0 -1  1  0 -1  1] (Indices: [0, 1, 3, 6, 7, 8, 11, 12, 14, 15, 17, 18]), Candidate: [ 2  0  2 -1  1  2  1  0  0  1  1  1  0  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0 -1  0  0  1 -1  1  0  0 -1  1  0  0] (Indices: [0, 1, 3, 6, 7, 8, 12, 14, 15, 16, 18, 19]), Candidate: [ 2  0  2 -1  1  2  1  0  0  1  0  2  0  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  1  0  0 -1  1  0 -1  1  0 -1  0  1] (Indices: [0, 1, 3, 6, 7, 9, 10, 11, 13, 14, 16, 17]), Candidate: [ 2  0  2 -1  1  2  1 -1  2  1  0  0  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 34300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  1  0 -1  1  0 -1  0  0  1  0  0  0] (Indices: [0, 1, 3, 6, 7, 9, 10, 12, 13, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  2  1 -1  2  1 -1  2  1  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 34350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  1 -1  1  0  0 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 3, 6, 7, 9, 11, 12, 13, 15, 17, 18]), Candidate: [ 2  0  2 -1  1  2  1 -1  2  0  1  1  1  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  1 -1  0  1  0  0 -1  1  0 -1  1  0] (Indices: [0, 1, 3, 6, 7, 9, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  0  2 -1  1  2  1 -1  2  0  0  2  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 34450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  0  1  0  0 -1  1 -1  0  1  0  0  0] (Indices: [0, 1, 3, 6, 7, 10, 11, 12, 14, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  2  1 -1  1  2  0  1  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 34500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  0  1 -1  0  1  0  0  0 -1  1  0  0] (Indices: [0, 1, 3, 6, 7, 10, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  0  2 -1  1  2  1 -1  1  2 -1  1  2  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 34550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1  0  0  0  0  0 -1  0  1  0 -1  0  1] (Indices: [0, 1, 3, 6, 8, 9, 10, 11, 12, 13, 16, 17]), Candidate: [ 2  0  2 -1  1  2  0  1  1  1  0  1  1  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1  0  0  0 -1  0  1  0 -1  1 -1  1  0] (Indices: [0, 1, 3, 6, 8, 9, 10, 11, 14, 15, 17, 19]), Candidate: [ 2  0  2 -1  1  2  0  1  1  1  0  0  1  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1  0  0 -1  0  1  0  0 -1  1 -1  1  0] (Indices: [0, 1, 3, 6, 8, 9, 10, 13, 14, 15, 17, 19]), Candidate: [ 2  0  2 -1  1  2  0  1  1  1 -1  1  2  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1  0 -1  1  0 -1  0  1 -1  1  0  0  0] (Indices: [0, 1, 3, 6, 8, 9, 11, 12, 15, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  2  0  1  1  0  1  1  0  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1  0 -1  0  0  0  1  0  0  0  0  0  0] (Indices: [0, 1, 3, 6, 8, 9, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  2  0  1  1  0  0  1  1  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1 -1  1  0 -1  1 -1  0  1  0  0  0  0] (Indices: [0, 1, 3, 6, 8, 10, 11, 13, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  2  0  1  0  2  0  0  2  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1 -1  0  1  0 -1  1  0  0  0  0 -1  1] (Indices: [0, 1, 3, 6, 8, 11, 12, 14, 15, 16, 17, 18]), Candidate: [ 2  0  2 -1  1  2  0  1  0  1  1  1  0  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  1  0  0  0 -1  1 -1  0  1  0  0  0] (Indices: [0, 1, 3, 6, 9, 10, 11, 12, 14, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  2  0  0  2  1  0  1  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  1  0 -1  0  1  0  0  0 -1  1  0  0] (Indices: [0, 1, 3, 6, 9, 10, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  0  2 -1  1  2  0  0  2  1 -1  1  2  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  0  1  0  0  0  0 -1  0  1  0  0  0] (Indices: [0, 1, 3, 6, 10, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  2  0  0  1  2  0  1  1  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0  0  0  0  0  0 -1  0  0  0  1  0  0] (Indices: [0, 1, 3, 7, 8, 9, 10, 11, 12, 13, 18, 19]), Candidate: [ 2  0  2 -1  1  1  2  0  1  1  0  1  1  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0  0  0  0 -1  0  1 -1  0  1  0  0  0] (Indices: [0, 1, 3, 7, 8, 9, 10, 11, 14, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  2  0  1  1  0  0  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0  0  0 -1  0  1  0 -1  0  1  0  0  0] (Indices: [0, 1, 3, 7, 8, 9, 10, 13, 14, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  2  0  1  1 -1  1  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 35200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0  0 -1  1 -1  1  0  0 -1  1  0 -1  1] (Indices: [0, 1, 3, 7, 8, 9, 11, 13, 14, 15, 17, 18]), Candidate: [ 2  0  2 -1  1  1  2  0  1  0  1  0  2  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0 -1  1  0  0  0  0 -1  1  0 -1  0  1] (Indices: [0, 1, 3, 7, 8, 10, 11, 12, 13, 14, 16, 17]), Candidate: [ 2  0  2 -1  1  1  2  0  0  2  0  1  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0 -1  1  0 -1  0  1 -1  1  0  0  0  0] (Indices: [0, 1, 3, 7, 8, 10, 11, 14, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  2  0  0  2  0  0  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0 -1  0  1  0 -1  0  1  0  0  0  0  0] (Indices: [0, 1, 3, 7, 8, 11, 12, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  2  0  0  1  1  1  0  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  1  0  0  0 -1  0  0  1  0  0  0  0] (Indices: [0, 1, 3, 7, 9, 10, 11, 12, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  2 -1  2  1  0  1  0  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  1 -1  1  0  0  0  0  0  0 -1  0  1] (Indices: [0, 1, 3, 7, 9, 11, 12, 13, 14, 15, 16, 17]), Candidate: [ 2  0  2 -1  1  1  2 -1  2  0  1  1  1  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  0  1  0  0  0 -1  0  1  0  0  0  0] (Indices: [0, 1, 3, 7, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  2 -1  1  2  0  1  1  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1  0  0  0  0  0 -1  0  0  1  0  0  0] (Indices: [0, 1, 3, 8, 9, 10, 11, 12, 13, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  1  1  1  1  0  1  1  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1  0  0 -1  1  0 -1  1 -1  1  0  0  0] (Indices: [0, 1, 3, 8, 9, 10, 12, 13, 15, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  1  1  1  1 -1  2  1  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1  0 -1  0  0  1  0  0  0  0  0  0  0] (Indices: [0, 1, 3, 8, 9, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  1  1  1  0  0  1  2  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  1  0  0  0  0  0  0 -1  1 -1  1  0] (Indices: [0, 1, 3, 9, 10, 11, 12, 13, 14, 15, 17, 19]), Candidate: [ 2  0  2 -1  1  1  1  0  2  1  0  1  1  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0] (Indices: [0, 1, 3, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  1  0  1  1  1  1  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0  0  0 -1  0  1  0  0 -1  0  0  0  1] (Indices: [0, 1, 4, 5, 6, 7, 8, 9, 10, 13, 14, 15]), Candidate: [ 2  0  1  1  1  1  1  0  1  1 -1  1  2  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0  0 -1  1  0 -1  0  0  1  0 -1  0  1] (Indices: [0, 1, 4, 5, 6, 7, 8, 9, 11, 12, 16, 17]), Candidate: [2 0 1 1 1 1 1 0 1 0 1 1 0 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 35900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0  0 -1  0  1  0 -1  0  1  0 -1  0  1] (Indices: [0, 1, 4, 5, 6, 7, 8, 9, 12, 13, 16, 17]), Candidate: [2 0 1 1 1 1 1 0 1 0 0 2 1 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 35950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0  0 -1  0  0  0  1  0 -1  1 -1  1  0] (Indices: [0, 1, 4, 5, 6, 7, 8, 9, 14, 15, 17, 19]), Candidate: [2 0 1 1 1 1 1 0 1 0 0 1 1 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 36000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0 -1  1  0 -1  0  1  0 -1  0  0  1  0] (Indices: [0, 1, 4, 5, 6, 7, 8, 10, 11, 14, 15, 19]), Candidate: [2 0 1 1 1 1 1 0 0 2 0 0 1 2 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 36050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0 -1  1 -1  1 -1  0  0  1 -1  1  0  0] (Indices: [0, 1, 4, 5, 6, 7, 8, 10, 12, 16, 18, 19]), Candidate: [ 2  0  1  1  1  1  1  0  0  2 -1  2  0  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0 -1  0  1  0  0 -1  0  0  1 -1  1  0] (Indices: [0, 1, 4, 5, 6, 7, 8, 11, 12, 13, 17, 19]), Candidate: [2 0 1 1 1 1 1 0 0 1 1 1 1 0 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 36150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0 -1  0  1 -1  0  1 -1  1 -1  1  0  0] (Indices: [0, 1, 4, 5, 6, 7, 8, 11, 14, 16, 18, 19]), Candidate: [ 2  0  1  1  1  1  1  0  0  1  1  0  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0 -1  0  0  0  1  0 -1  1 -1  1  0  0] (Indices: [0, 1, 4, 5, 6, 7, 8, 13, 14, 16, 18, 19]), Candidate: [ 2  0  1  1  1  1  1  0  0  1  0  1  2  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  1  0  0 -1  0  1  0 -1  1 -1  0  1] (Indices: [0, 1, 4, 5, 6, 7, 9, 10, 11, 14, 15, 17]), Candidate: [ 2  0  1  1  1  1  1 -1  2  1  0  0  1  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  1  0 -1  1 -1  0  0  1  0  0 -1  1] (Indices: [0, 1, 4, 5, 6, 7, 9, 10, 12, 16, 17, 18]), Candidate: [ 2  0  1  1  1  1  1 -1  2  1 -1  2  0  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  1 -1  1  0  0 -1  0  1 -1  0  1  0] (Indices: [0, 1, 4, 5, 6, 7, 9, 11, 12, 13, 16, 19]), Candidate: [ 2  0  1  1  1  1  1 -1  2  0  1  1  1  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  1 -1  1 -1  0  1 -1  1  0  0 -1  1] (Indices: [0, 1, 4, 5, 6, 7, 9, 11, 14, 16, 17, 18]), Candidate: [ 2  0  1  1  1  1  1 -1  2  0  1  0  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  1 -1  0  0  1  0 -1  1  0  0 -1  1] (Indices: [0, 1, 4, 5, 6, 7, 9, 13, 14, 16, 17, 18]), Candidate: [ 2  0  1  1  1  1  1 -1  2  0  0  1  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  0  1  0 -1  1  0  0  0 -1  0  0  1] (Indices: [0, 1, 4, 5, 6, 7, 10, 11, 13, 14, 15, 16]), Candidate: [ 2  0  1  1  1  1  1 -1  1  2  0  0  2  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  0  1 -1  1  0 -1  1 -1  0  1  0  0] (Indices: [0, 1, 4, 5, 6, 7, 10, 12, 13, 15, 18, 19]), Candidate: [ 2  0  1  1  1  1  1 -1  1  2 -1  2  1  0  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  0  0  1  0  0  0 -1  0  0  1  0  0] (Indices: [0, 1, 4, 5, 6, 7, 11, 12, 13, 14, 18, 19]), Candidate: [ 2  0  1  1  1  1  1 -1  1  1  1  1  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  0  0  0  1  0  0  0 -1  1  0 -1  1] (Indices: [0, 1, 4, 5, 6, 7, 12, 13, 14, 15, 17, 18]), Candidate: [ 2  0  1  1  1  1  1 -1  1  1  0  2  1  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1  0  0  0 -1  1  0 -1  0  0  0  1  0] (Indices: [0, 1, 4, 5, 6, 8, 9, 10, 11, 13, 14, 19]), Candidate: [ 2  0  1  1  1  1  0  1  1  1  0  0  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1  0  0 -1  1 -1  1 -1  1  0 -1  0  1] (Indices: [0, 1, 4, 5, 6, 8, 9, 10, 12, 14, 16, 17]), Candidate: [ 2  0  1  1  1  1  0  1  1  1 -1  2  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1  0  0 -1  0  0  0  0  1  0  0  0  0] (Indices: [0, 1, 4, 5, 6, 8, 9, 10, 16, 17, 18, 19]), Candidate: [ 2  0  1  1  1  1  0  1  1  1 -1  1  1  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1  0 -1  1 -1  1 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 4, 5, 6, 8, 9, 11, 13, 15, 17, 19]), Candidate: [2 0 1 1 1 1 0 1 1 0 1 0 2 0 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 36900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1  0 -1  0  1 -1  1 -1  0  1  0  0  0] (Indices: [0, 1, 4, 5, 6, 8, 9, 12, 14, 17, 18, 19]), Candidate: [ 2  0  1  1  1  1  0  1  1  0  0  2  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1 -1  1  0  0 -1  1 -1  0  1 -1  1  0] (Indices: [0, 1, 4, 5, 6, 8, 10, 11, 12, 14, 17, 19]), Candidate: [ 2  0  1  1  1  1  0  1  0  2  0  1  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1 -1  1 -1  1  0  0  0 -1  0  0  1  0] (Indices: [0, 1, 4, 5, 6, 8, 10, 12, 13, 14, 15, 19]), Candidate: [ 2  0  1  1  1  1  0  1  0  2 -1  2  1  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1 -1  1 -1  0  0  1  0 -1  1  0  0  0] (Indices: [0, 1, 4, 5, 6, 8, 10, 14, 15, 17, 18, 19]), Candidate: [ 2  0  1  1  1  1  0  1  0  2 -1  1  1  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1 -1  0  1 -1  1 -1  1  0 -1  1  0  0] (Indices: [0, 1, 4, 5, 6, 8, 11, 13, 15, 16, 18, 19]), Candidate: [2 0 1 1 1 1 0 1 0 1 1 0 2 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 37150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  1  0  0  0  0 -1  0  0  1 -1  1  0] (Indices: [0, 1, 4, 5, 6, 9, 10, 11, 12, 13, 17, 19]), Candidate: [2 0 1 1 1 1 0 0 2 1 0 1 1 0 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 37200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  1  0  0 -1  0  1 -1  1 -1  1  0  0] (Indices: [0, 1, 4, 5, 6, 9, 10, 11, 14, 16, 18, 19]), Candidate: [ 2  0  1  1  1  1  0  0  2  1  0  0  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  1  0 -1  0  1  0 -1  1 -1  1  0  0] (Indices: [0, 1, 4, 5, 6, 9, 10, 13, 14, 16, 18, 19]), Candidate: [ 2  0  1  1  1  1  0  0  2  1 -1  1  2  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  1 -1  1 -1  1  0  0  0 -1  0  1  0] (Indices: [0, 1, 4, 5, 6, 9, 11, 13, 14, 15, 16, 19]), Candidate: [2 0 1 1 1 1 0 0 2 0 1 0 2 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 37350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  0  1  0  0  0  0  0 -1  0  0  1  0] (Indices: [0, 1, 4, 5, 6, 10, 11, 12, 13, 14, 15, 19]), Candidate: [2 0 1 1 1 1 0 0 1 2 0 1 1 1 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 37400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  0  1  0 -1  0  1  0 -1  1  0  0  0] (Indices: [0, 1, 4, 5, 6, 10, 11, 14, 15, 17, 18, 19]), Candidate: [2 0 1 1 1 1 0 0 1 2 0 0 1 2 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 37450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  0  0  1  0 -1  1 -1  1  0  0  0  0] (Indices: [0, 1, 4, 5, 6, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  0  1  1  1  1  0  0  1  1  1  1  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0  0  0  0 -1  1 -1  0  0  1  0 -1  1] (Indices: [0, 1, 4, 5, 7, 8, 9, 10, 11, 13, 17, 18]), Candidate: [2 0 1 1 1 0 2 0 1 1 0 0 2 0 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 37550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0  0  0 -1  1 -1  0  1  0 -1  0  1  0] (Indices: [0, 1, 4, 5, 7, 8, 9, 10, 12, 15, 16, 19]), Candidate: [ 2  0  1  1  1  0  2  0  1  1 -1  2  0  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0  0 -1  1  0  0 -1  1 -1  0  1 -1  1] (Indices: [0, 1, 4, 5, 7, 8, 9, 11, 12, 13, 15, 18]), Candidate: [2 0 1 1 1 0 2 0 1 0 1 1 1 0 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 37650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0  0 -1  1 -1  0  1  0  0 -1  0  1  0] (Indices: [0, 1, 4, 5, 7, 8, 9, 11, 14, 15, 16, 19]), Candidate: [2 0 1 1 1 0 2 0 1 0 1 0 1 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 37700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0  0 -1  0  0  1  0  0  0 -1  0  1  0] (Indices: [0, 1, 4, 5, 7, 8, 9, 13, 14, 15, 16, 19]), Candidate: [2 0 1 1 1 0 2 0 1 0 0 1 2 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 37750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0 -1  1  0  0 -1  0  0  1  0  0 -1  1] (Indices: [0, 1, 4, 5, 7, 8, 10, 11, 12, 16, 17, 18]), Candidate: [2 0 1 1 1 0 2 0 0 2 0 1 0 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 37800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0 -1  1 -1  1  0 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 4, 5, 7, 8, 10, 12, 13, 15, 16, 18]), Candidate: [ 2  0  1  1  1  0  2  0  0  2 -1  2  1  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0 -1  0  1  0  0  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 4, 5, 7, 8, 11, 12, 13, 14, 16, 18]), Candidate: [ 2  0  1  1  1  0  2  0  0  1  1  1  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0 -1  0  1 -1  0  0  1  0  0  0  0  0] (Indices: [0, 1, 4, 5, 7, 8, 11, 15, 16, 17, 18, 19]), Candidate: [2 0 1 1 1 0 2 0 0 1 1 0 1 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 37950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  1  0  0  0 -1  1 -1  1 -1  0  1  0] (Indices: [0, 1, 4, 5, 7, 9, 10, 11, 12, 14, 16, 19]), Candidate: [ 2  0  1  1  1  0  2 -1  2  1  0  1  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  1  0 -1  1  0  0  0 -1  1 -1  0  1] (Indices: [0, 1, 4, 5, 7, 9, 10, 12, 13, 14, 15, 17]), Candidate: [ 2  0  1  1  1  0  2 -1  2  1 -1  2  1  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  1  0 -1  0  0  1  0  0  0 -1  1  0] (Indices: [0, 1, 4, 5, 7, 9, 10, 14, 15, 16, 17, 19]), Candidate: [ 2  0  1  1  1  0  2 -1  2  1 -1  1  1  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  1 -1  1 -1  1 -1  1  0  0  0 -1  1] (Indices: [0, 1, 4, 5, 7, 9, 11, 13, 15, 16, 17, 18]), Candidate: [ 2  0  1  1  1  0  2 -1  2  0  1  0  2  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  0  1  0  0  0 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 4, 5, 7, 10, 11, 12, 13, 15, 16, 18]), Candidate: [ 2  0  1  1  1  0  2 -1  1  2  0  1  1  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  0  1 -1  1  0  0  0 -1  0  1  0  0] (Indices: [0, 1, 4, 5, 7, 10, 12, 13, 14, 15, 18, 19]), Candidate: [ 2  0  1  1  1  0  2 -1  1  2 -1  2  1  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  0  0  1 -1  0  1  0  0  0  0  0  0] (Indices: [0, 1, 4, 5, 7, 11, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  0  1  1  1  0  2 -1  1  1  1  0  1  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1  0  0  0 -1  1  0 -1  1 -1  0  1  0] (Indices: [0, 1, 4, 5, 8, 9, 10, 11, 13, 14, 16, 19]), Candidate: [ 2  0  1  1  1  0  1  1  1  1  0  0  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1  0  0 -1  1 -1  1  0  0 -1  1 -1  1] (Indices: [0, 1, 4, 5, 8, 9, 10, 12, 14, 15, 16, 18]), Candidate: [ 2  0  1  1  1  0  1  1  1  1 -1  2  0  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1  0 -1  1  0  0 -1  1 -1  0  1  0  0] (Indices: [0, 1, 4, 5, 8, 9, 11, 12, 13, 15, 18, 19]), Candidate: [2 0 1 1 1 0 1 1 1 0 1 1 1 0 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 38450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1  0 -1  0  1  0  0 -1  0  1  0  0  0] (Indices: [0, 1, 4, 5, 8, 9, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  0  1  1  1  0  1  1  1  0  0  2  1  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1 -1  1  0  0 -1  0  1  0  0 -1  1  0] (Indices: [0, 1, 4, 5, 8, 10, 11, 12, 15, 16, 17, 19]), Candidate: [2 0 1 1 1 0 1 1 0 2 0 1 0 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 38550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1 -1  1 -1  0  1  0 -1  1  0  0  0  0] (Indices: [0, 1, 4, 5, 8, 10, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  0  1  1  1  0  1  1  0  2 -1  1  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  1  0  0  0  0 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 4, 5, 9, 10, 11, 12, 13, 15, 16, 18]), Candidate: [2 0 1 1 1 0 1 0 2 1 0 1 1 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 38650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  1  0 -1  1  0  0  0 -1  0  1  0  0] (Indices: [0, 1, 4, 5, 9, 10, 12, 13, 14, 15, 18, 19]), Candidate: [ 2  0  1  1  1  0  1  0  2  1 -1  2  1  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  1 -1  1 -1  0  1  0  0  0  0  0  0] (Indices: [0, 1, 4, 5, 9, 11, 14, 15, 16, 17, 18, 19]), Candidate: [2 0 1 1 1 0 1 0 2 0 1 0 1 2 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 38750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  0  0  1  0  0 -1  1  0  0  0  0  0] (Indices: [0, 1, 4, 5, 11, 12, 13, 15, 16, 17, 18, 19]), Candidate: [2 0 1 1 1 0 1 0 1 1 1 1 1 0 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 38800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0  0  0  0 -1  0  0  1  0  0 -1  0  1] (Indices: [0, 1, 4, 6, 7, 8, 9, 10, 11, 15, 16, 17]), Candidate: [2 0 1 1 0 2 1 0 1 1 0 0 1 1 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 38850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0  0  0 -1  0  1  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 4, 6, 7, 8, 9, 10, 13, 14, 16, 18]), Candidate: [ 2  0  1  1  0  2  1  0  1  1 -1  1  2  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0  0 -1  1  0 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 4, 6, 7, 8, 9, 11, 12, 14, 16, 18]), Candidate: [ 2  0  1  1  0  2  1  0  1  0  1  1  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0  0 -1  0  1  0  0  0  0 -1  0  0  1] (Indices: [0, 1, 4, 6, 7, 8, 9, 12, 13, 14, 15, 16]), Candidate: [2 0 1 1 0 2 1 0 1 0 0 2 1 1 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 39000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0  0 -1  0  0  0  1  0  0  0  0 -1  1] (Indices: [0, 1, 4, 6, 7, 8, 9, 14, 15, 16, 17, 18]), Candidate: [2 0 1 1 0 2 1 0 1 0 0 1 1 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 39050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0 -1  1  0 -1  1  0 -1  0  0  1  0  0] (Indices: [0, 1, 4, 6, 7, 8, 10, 11, 13, 14, 18, 19]), Candidate: [ 2  0  1  1  0  2  1  0  0  2  0  0  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0 -1  1 -1  1 -1  1  0 -1  1 -1  1  0] (Indices: [0, 1, 4, 6, 7, 8, 10, 12, 14, 15, 17, 19]), Candidate: [ 2  0  1  1  0  2  1  0  0  2 -1  2  0  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0 -1  0  1  0  0 -1  0  1 -1  1  0  0] (Indices: [0, 1, 4, 6, 7, 8, 11, 12, 13, 16, 18, 19]), Candidate: [2 0 1 1 0 2 1 0 0 1 1 1 1 0 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 39200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0 -1  0  0  1  0 -1  1  0 -1  1  0  0] (Indices: [0, 1, 4, 6, 7, 8, 12, 13, 15, 16, 18, 19]), Candidate: [2 0 1 1 0 2 1 0 0 1 0 2 1 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 39250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  1  0  0  0 -1  0  0  0  1  0  0  0] (Indices: [0, 1, 4, 6, 7, 9, 10, 11, 12, 17, 18, 19]), Candidate: [ 2  0  1  1  0  2  1 -1  2  1  0  1  0  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  1  0 -1  1  0 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 4, 6, 7, 9, 10, 12, 13, 15, 17, 19]), Candidate: [ 2  0  1  1  0  2  1 -1  2  1 -1  2  1  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  1 -1  1  0  0  0 -1  0  1 -1  1  0] (Indices: [0, 1, 4, 6, 7, 9, 11, 12, 13, 14, 17, 19]), Candidate: [ 2  0  1  1  0  2  1 -1  2  0  1  1  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  1 -1  0  1  0  0  0  0 -1  0  1  0] (Indices: [0, 1, 4, 6, 7, 9, 12, 13, 14, 15, 16, 19]), Candidate: [ 2  0  1  1  0  2  1 -1  2  0  0  2  1  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  0  1  0  0 -1  1  0 -1  1 -1  1  0] (Indices: [0, 1, 4, 6, 7, 10, 11, 12, 14, 15, 17, 19]), Candidate: [ 2  0  1  1  0  2  1 -1  1  2  0  1  0  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  0  1 -1  1 -1  1  0 -1  1  0  0  0] (Indices: [0, 1, 4, 6, 7, 10, 12, 14, 15, 17, 18, 19]), Candidate: [ 2  0  1  1  0  2  1 -1  1  2 -1  2  0  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1  0  0  0  0  0  0 -1  0  0  0  1  0] (Indices: [0, 1, 4, 6, 8, 9, 10, 11, 12, 13, 14, 19]), Candidate: [ 2  0  1  1  0  2  0  1  1  1  0  1  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1  0  0  0 -1  1 -1  0  0  1  0  0  0] (Indices: [0, 1, 4, 6, 8, 9, 10, 11, 13, 17, 18, 19]), Candidate: [2 0 1 1 0 2 0 1 1 1 0 0 2 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 39650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1  0  0 -1  1 -1  0  0  1  0  0  0  0] (Indices: [0, 1, 4, 6, 8, 9, 10, 12, 16, 17, 18, 19]), Candidate: [ 2  0  1  1  0  2  0  1  1  1 -1  2  0  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1  0 -1  1  0 -1  1 -1  1 -1  1  0  0] (Indices: [0, 1, 4, 6, 8, 9, 11, 12, 14, 16, 18, 19]), Candidate: [ 2  0  1  1  0  2  0  1  1  0  1  1  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1  0 -1  0  0  1  0  0  0  0 -1  1  0] (Indices: [0, 1, 4, 6, 8, 9, 13, 14, 15, 16, 17, 19]), Candidate: [2 0 1 1 0 2 0 1 1 0 0 1 2 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 39800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1 -1  1  0 -1  1  0 -1  0  1  0  0  0] (Indices: [0, 1, 4, 6, 8, 10, 11, 13, 14, 17, 18, 19]), Candidate: [ 2  0  1  1  0  2  0  1  0  2  0  0  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1 -1  0  1  0  0 -1  1  0  0  0 -1  1] (Indices: [0, 1, 4, 6, 8, 11, 12, 13, 15, 16, 17, 18]), Candidate: [2 0 1 1 0 2 0 1 0 1 1 1 1 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 39900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  1  0  0  0 -1  1  0 -1  1 -1  1  0] (Indices: [0, 1, 4, 6, 9, 10, 11, 12, 14, 15, 17, 19]), Candidate: [2 0 1 1 0 2 0 0 2 1 0 1 0 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 39950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  1  0 -1  1 -1  1  0 -1  1  0  0  0] (Indices: [0, 1, 4, 6, 9, 10, 12, 14, 15, 17, 18, 19]), Candidate: [ 2  0  1  1  0  2  0  0  2  1 -1  2  0  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  0  1  0  0  0  0  0 -1  1 -1  1  0] (Indices: [0, 1, 4, 6, 10, 11, 12, 13, 14, 15, 17, 19]), Candidate: [2 0 1 1 0 2 0 0 1 2 0 1 1 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 40050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0  0  0  0  0  0 -1  0  1  0 -1  0  1] (Indices: [0, 1, 4, 7, 8, 9, 10, 11, 12, 13, 16, 17]), Candidate: [2 0 1 1 0 1 2 0 1 1 0 1 1 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 40100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0  0  0  0 -1  0  1  0 -1  1 -1  1  0] (Indices: [0, 1, 4, 7, 8, 9, 10, 11, 14, 15, 17, 19]), Candidate: [2 0 1 1 0 1 2 0 1 1 0 0 1 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 40150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0  0  0 -1  0  1  0  0 -1  1 -1  1  0] (Indices: [0, 1, 4, 7, 8, 9, 10, 13, 14, 15, 17, 19]), Candidate: [ 2  0  1  1  0  1  2  0  1  1 -1  1  2  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0  0 -1  1  0 -1  0  1 -1  1  0  0  0] (Indices: [0, 1, 4, 7, 8, 9, 11, 12, 15, 17, 18, 19]), Candidate: [2 0 1 1 0 1 2 0 1 0 1 1 0 1 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 40250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0  0 -1  0  0  0  1  0  0  0  0  0  0] (Indices: [0, 1, 4, 7, 8, 9, 14, 15, 16, 17, 18, 19]), Candidate: [2 0 1 1 0 1 2 0 1 0 0 1 1 2 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 40300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0 -1  1  0 -1  1 -1  0  1  0  0  0  0] (Indices: [0, 1, 4, 7, 8, 10, 11, 13, 16, 17, 18, 19]), Candidate: [2 0 1 1 0 1 2 0 0 2 0 0 2 0 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 40350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0 -1  0  1  0 -1  1  0  0  0  0 -1  1] (Indices: [0, 1, 4, 7, 8, 11, 12, 14, 15, 16, 17, 18]), Candidate: [2 0 1 1 0 1 2 0 0 1 1 1 0 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 40400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  1  0  0  0 -1  1 -1  0  1  0  0  0] (Indices: [0, 1, 4, 7, 9, 10, 11, 12, 14, 17, 18, 19]), Candidate: [ 2  0  1  1  0  1  2 -1  2  1  0  1  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 40450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  1  0 -1  0  1  0  0  0 -1  1  0  0] (Indices: [0, 1, 4, 7, 9, 10, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  0  1  1  0  1  2 -1  2  1 -1  1  2  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 40500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  0  1  0  0  0  0 -1  0  1  0  0  0] (Indices: [0, 1, 4, 7, 10, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  0  1  1  0  1  2 -1  1  2  0  1  1  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 40550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1  0  0  0  0  0 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 4, 8, 9, 10, 11, 12, 13, 15, 17, 19]), Candidate: [2 0 1 1 0 1 1 1 1 1 0 1 1 0 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 40600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1  0  0 -1  1  0  0 -1  1 -1  1  0  0] (Indices: [0, 1, 4, 8, 9, 10, 12, 13, 14, 16, 18, 19]), Candidate: [ 2  0  1  1  0  1  1  1  1  1 -1  2  1  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 40650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1  0 -1  0  1  0  0  0  0 -1  1  0  0] (Indices: [0, 1, 4, 8, 9, 12, 13, 14, 15, 16, 18, 19]), Candidate: [2 0 1 1 0 1 1 1 1 0 0 2 1 1 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 40700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1 -1  0  0  1  0  0  0  0  0  0  0  0] (Indices: [0, 1, 4, 8, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 0 1 1 0 1 1 1 0 1 0 2 1 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 40750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  0  1  0  0  0  0 -1  1  0  0  0  0] (Indices: [0, 1, 4, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  0  1  1  0  1  1  0  1  2  0  1  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0  0  0  0 -1  0  1 -1  0  1 -1  1  0] (Indices: [0, 1, 5, 6, 7, 8, 9, 10, 11, 14, 17, 19]), Candidate: [ 2  0  1  0  2  1  1  0  1  1  0  0  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0  0  0 -1  0  1  0  0 -1  0  0  1  0] (Indices: [0, 1, 5, 6, 7, 8, 9, 10, 13, 14, 15, 19]), Candidate: [ 2  0  1  0  2  1  1  0  1  1 -1  1  2  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0  0 -1  1  0 -1  1  0 -1  0  0  1  0] (Indices: [0, 1, 5, 6, 7, 8, 9, 11, 12, 14, 15, 19]), Candidate: [2 0 1 0 2 1 1 0 1 0 1 1 0 2 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 40950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0  0 -1  1 -1  0  0  1 -1  1  0  0  0] (Indices: [0, 1, 5, 6, 7, 8, 9, 11, 15, 17, 18, 19]), Candidate: [2 0 1 0 2 1 1 0 1 0 1 0 1 1 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 41000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0  0 -1  0  0  1 -1  1 -1  1  0  0  0] (Indices: [0, 1, 5, 6, 7, 8, 9, 13, 15, 17, 18, 19]), Candidate: [2 0 1 0 2 1 1 0 1 0 0 1 2 0 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 41050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0 -1  1  0 -1  1  0 -1  0  1  0 -1  1] (Indices: [0, 1, 5, 6, 7, 8, 10, 11, 13, 14, 17, 18]), Candidate: [ 2  0  1  0  2  1  1  0  0  2  0  0  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0 -1  1 -1  1 -1  1  0  0 -1  0  1  0] (Indices: [0, 1, 5, 6, 7, 8, 10, 12, 14, 15, 16, 19]), Candidate: [ 2  0  1  0  2  1  1  0  0  2 -1  2  0  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0 -1  0  1  0  0 -1  0  1  0  0 -1  1] (Indices: [0, 1, 5, 6, 7, 8, 11, 12, 13, 16, 17, 18]), Candidate: [2 0 1 0 2 1 1 0 0 1 1 1 1 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 41200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0 -1  0  0  1  0 -1  1  0  0  0 -1  1] (Indices: [0, 1, 5, 6, 7, 8, 12, 13, 15, 16, 17, 18]), Candidate: [2 0 1 0 2 1 1 0 0 1 0 2 1 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 41250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  1  0  0  0 -1  0  0  1  0 -1  1  0] (Indices: [0, 1, 5, 6, 7, 9, 10, 11, 12, 16, 17, 19]), Candidate: [ 2  0  1  0  2  1  1 -1  2  1  0  1  0  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  1  0 -1  1  0 -1  1  0 -1  0  1  0] (Indices: [0, 1, 5, 6, 7, 9, 10, 12, 13, 15, 16, 19]), Candidate: [ 2  0  1  0  2  1  1 -1  2  1 -1  2  1  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 41350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  1 -1  1  0  0  0 -1  1 -1  0  1  0] (Indices: [0, 1, 5, 6, 7, 9, 11, 12, 13, 14, 16, 19]), Candidate: [ 2  0  1  0  2  1  1 -1  2  0  1  1  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 41400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  1 -1  0  1  0  0  0  0  0 -1  0  1] (Indices: [0, 1, 5, 6, 7, 9, 12, 13, 14, 15, 16, 17]), Candidate: [ 2  0  1  0  2  1  1 -1  2  0  0  2  1  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  0  1  0  0 -1  1  0  0 -1  0  1  0] (Indices: [0, 1, 5, 6, 7, 10, 11, 12, 14, 15, 16, 19]), Candidate: [ 2  0  1  0  2  1  1 -1  1  2  0  1  0  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  0  1 -1  1 -1  1  0  0  0 -1  1  0] (Indices: [0, 1, 5, 6, 7, 10, 12, 14, 15, 16, 17, 19]), Candidate: [ 2  0  1  0  2  1  1 -1  1  2 -1  2  0  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 41550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1  0  0  0  0  0  0 -1  0  1 -1  0  1] (Indices: [0, 1, 5, 6, 8, 9, 10, 11, 12, 13, 14, 17]), Candidate: [ 2  0  1  0  2  1  0  1  1  1  0  1  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1  0  0  0 -1  1 -1  0  1  0 -1  1  0] (Indices: [0, 1, 5, 6, 8, 9, 10, 11, 13, 16, 17, 19]), Candidate: [2 0 1 0 2 1 0 1 1 1 0 0 2 0 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 41650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1  0  0 -1  1 -1  0  1  0 -1  1  0  0] (Indices: [0, 1, 5, 6, 8, 9, 10, 12, 15, 16, 18, 19]), Candidate: [ 2  0  1  0  2  1  0  1  1  1 -1  2  0  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1  0 -1  1  0 -1  1 -1  1  0  0 -1  1] (Indices: [0, 1, 5, 6, 8, 9, 11, 12, 14, 16, 17, 18]), Candidate: [ 2  0  1  0  2  1  0  1  1  0  1  1  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1  0 -1  0  1 -1  0  1  0  0  0  0  0] (Indices: [0, 1, 5, 6, 8, 9, 12, 15, 16, 17, 18, 19]), Candidate: [2 0 1 0 2 1 0 1 1 0 0 2 0 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 41800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1 -1  1  0 -1  1  0 -1  1  0 -1  1  0] (Indices: [0, 1, 5, 6, 8, 10, 11, 13, 14, 16, 17, 19]), Candidate: [ 2  0  1  0  2  1  0  1  0  2  0  0  2  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1 -1  0  1  0  0  0 -1  1 -1  1  0  0] (Indices: [0, 1, 5, 6, 8, 11, 12, 13, 14, 16, 18, 19]), Candidate: [ 2  0  1  0  2  1  0  1  0  1  1  1  1  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  1  0  0  0 -1  1  0  0 -1  0  1  0] (Indices: [0, 1, 5, 6, 9, 10, 11, 12, 14, 15, 16, 19]), Candidate: [2 0 1 0 2 1 0 0 2 1 0 1 0 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 41950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  1  0 -1  1 -1  1  0  0  0 -1  1  0] (Indices: [0, 1, 5, 6, 9, 10, 12, 14, 15, 16, 17, 19]), Candidate: [ 2  0  1  0  2  1  0  0  2  1 -1  2  0  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  0  1  0  0  0  0  0  0 -1  0  1  0] (Indices: [0, 1, 5, 6, 10, 11, 12, 13, 14, 15, 16, 19]), Candidate: [2 0 1 0 2 1 0 0 1 2 0 1 1 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 42050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0  0  0  0  0  0 -1  1 -1  0  1 -1  1] (Indices: [0, 1, 5, 7, 8, 9, 10, 11, 12, 13, 15, 18]), Candidate: [2 0 1 0 2 0 2 0 1 1 0 1 1 0 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 42100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0  0  0  0 -1  0  1  0  0 -1  0  1  0] (Indices: [0, 1, 5, 7, 8, 9, 10, 11, 14, 15, 16, 19]), Candidate: [2 0 1 0 2 0 2 0 1 1 0 0 1 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 42150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0  0  0 -1  0  1  0  0  0 -1  0  1  0] (Indices: [0, 1, 5, 7, 8, 9, 10, 13, 14, 15, 16, 19]), Candidate: [ 2  0  1  0  2  0  2  0  1  1 -1  1  2  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0  0 -1  1  0 -1  0  1  0  0 -1  1  0] (Indices: [0, 1, 5, 7, 8, 9, 11, 12, 15, 16, 17, 19]), Candidate: [2 0 1 0 2 0 2 0 1 0 1 1 0 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 42250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0  0 -1  0  0  1  0 -1  1  0  0  0  0] (Indices: [0, 1, 5, 7, 8, 9, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  0  1  0  2  0  2  0  1  0  0  1  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0 -1  1  0 -1  1 -1  1  0 -1  1  0  0] (Indices: [0, 1, 5, 7, 8, 10, 11, 13, 15, 16, 18, 19]), Candidate: [2 0 1 0 2 0 2 0 0 2 0 0 2 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 42350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0 -1  0  1  0  0 -1  1 -1  1  0  0  0] (Indices: [0, 1, 5, 7, 8, 11, 12, 13, 15, 17, 18, 19]), Candidate: [2 0 1 0 2 0 2 0 0 1 1 1 1 0 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 42400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  1  0  0  0 -1  1 -1  1  0 -1  1  0] (Indices: [0, 1, 5, 7, 9, 10, 11, 12, 14, 16, 17, 19]), Candidate: [ 2  0  1  0  2  0  2 -1  2  1  0  1  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 42450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  1  0 -1  0  1  0  0  0  0  0 -1  1] (Indices: [0, 1, 5, 7, 9, 10, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  0  1  0  2  0  2 -1  2  1 -1  1  2  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 42500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  0  1  0  0  0  0 -1  1  0 -1  1  0] (Indices: [0, 1, 5, 7, 10, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  0  1  0  2  0  2 -1  1  2  0  1  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 42550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1  0  0  0  0  0 -1  1  0 -1  0  1  0] (Indices: [0, 1, 5, 8, 9, 10, 11, 12, 13, 15, 16, 19]), Candidate: [2 0 1 0 2 0 1 1 1 1 0 1 1 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 42600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1  0  0 -1  1  0  0 -1  1  0  0 -1  1] (Indices: [0, 1, 5, 8, 9, 10, 12, 13, 14, 16, 17, 18]), Candidate: [ 2  0  1  0  2  0  1  1  1  1 -1  2  1  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 42650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1  0 -1  0  1  0  0  0  0  0  0 -1  1] (Indices: [0, 1, 5, 8, 9, 12, 13, 14, 15, 16, 17, 18]), Candidate: [2 0 1 0 2 0 1 1 1 0 0 2 1 1 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 42700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1 -1  0  1  0 -1  1  0  0  0  0  0  0] (Indices: [0, 1, 5, 8, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [2 0 1 0 2 0 1 1 0 1 1 1 0 2 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 42750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  0  1  0  0  0  0  0  0 -1  1  0  0] (Indices: [0, 1, 5, 10, 11, 12, 13, 14, 15, 16, 18, 19]), Candidate: [2 0 1 0 2 0 1 0 1 2 0 1 1 1 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 42800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0  0  0  0 -1  1  0 -1  0  1  0 -1  1] (Indices: [0, 1, 6, 7, 8, 9, 10, 11, 13, 14, 17, 18]), Candidate: [ 2  0  1  0  1  2  1  0  1  1  0  0  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0  0  0 -1  1 -1  1  0  0 -1  0  1  0] (Indices: [0, 1, 6, 7, 8, 9, 10, 12, 14, 15, 16, 19]), Candidate: [ 2  0  1  0  1  2  1  0  1  1 -1  2  0  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0  0 -1  1  0  0 -1  0  1  0  0 -1  1] (Indices: [0, 1, 6, 7, 8, 9, 11, 12, 13, 16, 17, 18]), Candidate: [2 0 1 0 1 2 1 0 1 0 1 1 1 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 42950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0  0 -1  0  1  0 -1  1  0  0  0 -1  1] (Indices: [0, 1, 6, 7, 8, 9, 12, 13, 15, 16, 17, 18]), Candidate: [2 0 1 0 1 2 1 0 1 0 0 2 1 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 43000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0 -1  1  0  0 -1  0  1  0 -1  1  0  0] (Indices: [0, 1, 6, 7, 8, 10, 11, 12, 15, 16, 18, 19]), Candidate: [2 0 1 0 1 2 1 0 0 2 0 1 0 1 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 43050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0 -1  1 -1  0  1 -1  1  0  0  0  0  0] (Indices: [0, 1, 6, 7, 8, 10, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  0  1  0  1  2  1  0  0  2 -1  1  2  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  1  0  0  0  0 -1  1  0 -1  0  1  0] (Indices: [0, 1, 6, 7, 9, 10, 11, 12, 13, 15, 16, 19]), Candidate: [ 2  0  1  0  1  2  1 -1  2  1  0  1  1  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  1  0 -1  1  0  0 -1  1  0  0 -1  1] (Indices: [0, 1, 6, 7, 9, 10, 12, 13, 14, 16, 17, 18]), Candidate: [ 2  0  1  0  1  2  1 -1  2  1 -1  2  1  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 43200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  1 -1  0  1  0  0  0  0  0  0 -1  1] (Indices: [0, 1, 6, 7, 9, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  0  1  0  1  2  1 -1  2  0  0  2  1  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  0  0  1  0 -1  1  0  0  0  0  0  0] (Indices: [0, 1, 6, 7, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  0  1  0  1  2  1 -1  1  1  1  1  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1  0  0  0 -1  1 -1  1  0 -1  1  0  0] (Indices: [0, 1, 6, 8, 9, 10, 11, 13, 15, 16, 18, 19]), Candidate: [2 0 1 0 1 2 0 1 1 1 0 0 2 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 43350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1  0 -1  1  0  0 -1  1 -1  1  0  0  0] (Indices: [0, 1, 6, 8, 9, 11, 12, 13, 15, 17, 18, 19]), Candidate: [2 0 1 0 1 2 0 1 1 0 1 1 1 0 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 43400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1 -1  1  0 -1  0  1  0  0  0  0  0  0] (Indices: [0, 1, 6, 8, 10, 11, 14, 15, 16, 17, 18, 19]), Candidate: [2 0 1 0 1 2 0 1 0 2 0 0 1 2 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 43450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  0  1  0 -1  1  0  0 -1  1  0  0  0  0] (Indices: [0, 1, 6, 9, 10, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  0  1  0  1  2  0  0  2  1 -1  2  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 43500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0  0  0  0  0 -1  1 -1  1  0 -1  1  0] (Indices: [0, 1, 7, 8, 9, 10, 11, 12, 14, 16, 17, 19]), Candidate: [ 2  0  1  0  1  1  2  0  1  1  0  1  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0  0  0 -1  0  1  0  0  0  0  0 -1  1] (Indices: [0, 1, 7, 8, 9, 10, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  0  1  0  1  1  2  0  1  1 -1  1  2  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0 -1  1  0  0  0  0 -1  1  0 -1  1  0] (Indices: [0, 1, 7, 8, 10, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  0  1  0  1  1  2  0  0  2  0  1  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1 -1  1  0  0  0  0 -1  1  0 -1  1  0  0] (Indices: [0, 1, 7, 9, 10, 11, 12, 13, 15, 16, 18, 19]), Candidate: [ 2  0  1  0  1  1  2 -1  2  1  0  1  1  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  1  0  0  0  0  0  0 -1  1  0 -1  1  0] (Indices: [0, 1, 8, 9, 10, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  0  1  0  1  1  1  1  1  1  0  1  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  0  0  1  0  0  0  0  0  0  0 -1  1  0  0] (Indices: [0, 1, 9, 10, 11, 12, 13, 14, 15, 16, 18, 19]), Candidate: [2 0 1 0 1 1 1 0 2 1 0 1 1 1 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 43800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0  0 -1  1  0 -1  0  0  0  0  1 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 18]), Candidate: [1 2 1 0 1 1 1 0 1 0 1 1 0 1 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 43850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0  0 -1  0  0  1 -1  1 -1  1 -1  0  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 9, 13, 15, 17]), Candidate: [1 2 1 0 1 1 1 0 1 0 0 1 2 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 43900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0 -1  1  0 -1  0  0  1 -1  0  0  1  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 10, 11, 15, 19]), Candidate: [1 2 1 0 1 1 1 0 0 2 0 0 1 1 1 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 43950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0 -1  1 -1  0  0  1 -1  0  1  0 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 10, 14, 17, 18]), Candidate: [ 1  2  1  0  1  1  1  0  0  2 -1  1  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 44000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0 -1  0  1 -1  0  1  0 -1  1 -1  0  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 11, 14, 15, 17]), Candidate: [1 2 1 0 1 1 1 0 0 1 1 0 1 2 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 44050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0 -1  0  0  1 -1  0  0  1  0  0 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 12, 16, 17, 18]), Candidate: [1 2 1 0 1 1 1 0 0 1 0 2 0 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 44100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  1  0  0 -1  1 -1  0  0  0  1 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 18]), Candidate: [ 1  2  1  0  1  1  1 -1  2  1  0  0  2  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  1  0 -1  0  1 -1  0  0  1  0 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 9, 10, 13, 17, 18]), Candidate: [ 1  2  1  0  1  1  1 -1  2  1 -1  1  2  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 44200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  1 -1  1 -1  1 -1  1 -1  1 -1  0  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 9, 11, 13, 15, 17]), Candidate: [ 1  2  1  0  1  1  1 -1  2  0  1  0  2  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  1 -1  0  1 -1  1 -1  1 -1  0  1  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 9, 12, 14, 16, 19]), Candidate: [ 1  2  1  0  1  1  1 -1  2  0  0  2  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 44300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  0  1  0  0  0 -1  1 -1  0  0  0  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 10, 11, 12, 13, 15]), Candidate: [ 1  2  1  0  1  1  1 -1  1  2  0  1  1  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  0  1  0 -1  0  0  1 -1  0  1  0  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 10, 11, 15, 18, 19]), Candidate: [ 1  2  1  0  1  1  1 -1  1  2  0  0  1  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  0  1 -1  0  1 -1  1  0  0 -1  0  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 10, 13, 15, 16, 17]), Candidate: [ 1  2  1  0  1  1  1 -1  1  2 -1  1  2  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 44450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  0  0  1  0 -1  0  1  0  0 -1  0  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 11, 12, 15, 16, 17]), Candidate: [ 1  2  1  0  1  1  1 -1  1  1  1  1  0  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  0  0  0  1  0  0 -1  1 -1  1 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 12, 13, 14, 16, 18]), Candidate: [ 1  2  1  0  1  1  1 -1  1  1  0  2  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 44550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  0  0  0  0  0  0  1  0  0  0  0  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 15, 16, 17, 18, 19]), Candidate: [ 1  2  1  0  1  1  1 -1  1  1  0  1  1  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1  0  0 -1  0  1  0  0 -1  0  0  0  1] (Indices: [0, 2, 3, 4, 5, 6, 8, 9, 10, 13, 14, 15]), Candidate: [ 1  2  1  0  1  1  0  1  1  1 -1  1  2  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1  0 -1  1  0 -1  0  0  1  0 -1  0  1] (Indices: [0, 2, 3, 4, 5, 6, 8, 9, 11, 12, 16, 17]), Candidate: [1 2 1 0 1 1 0 1 1 0 1 1 0 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 44700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1  0 -1  0  1  0 -1  0  1  0 -1  0  1] (Indices: [0, 2, 3, 4, 5, 6, 8, 9, 12, 13, 16, 17]), Candidate: [1 2 1 0 1 1 0 1 1 0 0 2 1 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 44750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1  0 -1  0  0  0  1  0 -1  1 -1  1  0] (Indices: [0, 2, 3, 4, 5, 6, 8, 9, 14, 15, 17, 19]), Candidate: [1 2 1 0 1 1 0 1 1 0 0 1 1 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 44800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1 -1  1  0 -1  0  1  0 -1  0  0  1  0] (Indices: [0, 2, 3, 4, 5, 6, 8, 10, 11, 14, 15, 19]), Candidate: [1 2 1 0 1 1 0 1 0 2 0 0 1 2 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 44850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1 -1  1 -1  1 -1  0  0  1 -1  1  0  0] (Indices: [0, 2, 3, 4, 5, 6, 8, 10, 12, 16, 18, 19]), Candidate: [ 1  2  1  0  1  1  0  1  0  2 -1  2  0  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1 -1  0  1  0  0 -1  0  0  1 -1  1  0] (Indices: [0, 2, 3, 4, 5, 6, 8, 11, 12, 13, 17, 19]), Candidate: [1 2 1 0 1 1 0 1 0 1 1 1 1 0 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 44950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1 -1  0  1 -1  0  1 -1  1 -1  1  0  0] (Indices: [0, 2, 3, 4, 5, 6, 8, 11, 14, 16, 18, 19]), Candidate: [ 1  2  1  0  1  1  0  1  0  1  1  0  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1 -1  0  0  0  1  0 -1  1 -1  1  0  0] (Indices: [0, 2, 3, 4, 5, 6, 8, 13, 14, 16, 18, 19]), Candidate: [ 1  2  1  0  1  1  0  1  0  1  0  1  2  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  1  0  0 -1  0  1  0 -1  1 -1  0  1] (Indices: [0, 2, 3, 4, 5, 6, 9, 10, 11, 14, 15, 17]), Candidate: [1 2 1 0 1 1 0 0 2 1 0 0 1 2 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 45100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  1  0 -1  1 -1  0  0  1  0  0 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 9, 10, 12, 16, 17, 18]), Candidate: [ 1  2  1  0  1  1  0  0  2  1 -1  2  0  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  1 -1  1  0  0 -1  0  1 -1  0  1  0] (Indices: [0, 2, 3, 4, 5, 6, 9, 11, 12, 13, 16, 19]), Candidate: [1 2 1 0 1 1 0 0 2 0 1 1 1 0 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 45200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  1 -1  1 -1  0  1 -1  1  0  0 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 9, 11, 14, 16, 17, 18]), Candidate: [ 1  2  1  0  1  1  0  0  2  0  1  0  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  1 -1  0  0  1  0 -1  1  0  0 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 9, 13, 14, 16, 17, 18]), Candidate: [ 1  2  1  0  1  1  0  0  2  0  0  1  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  0  1  0 -1  1  0  0  0 -1  0  0  1] (Indices: [0, 2, 3, 4, 5, 6, 10, 11, 13, 14, 15, 16]), Candidate: [1 2 1 0 1 1 0 0 1 2 0 0 2 1 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 45350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  0  1 -1  1  0 -1  1 -1  0  1  0  0] (Indices: [0, 2, 3, 4, 5, 6, 10, 12, 13, 15, 18, 19]), Candidate: [ 1  2  1  0  1  1  0  0  1  2 -1  2  1  0  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  0  0  1  0  0  0 -1  0  0  1  0  0] (Indices: [0, 2, 3, 4, 5, 6, 11, 12, 13, 14, 18, 19]), Candidate: [ 1  2  1  0  1  1  0  0  1  1  1  1  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  0  0  0  1  0  0  0 -1  1  0 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 12, 13, 14, 15, 17, 18]), Candidate: [1 2 1 0 1 1 0 0 1 1 0 2 1 1 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 45500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0  0  0  0 -1  0  0  0  0  1  0 -1  1] (Indices: [0, 2, 3, 4, 5, 7, 8, 9, 10, 11, 17, 18]), Candidate: [1 2 1 0 1 0 2 0 1 1 0 0 1 1 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 45550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0  0  0 -1  0  0  0  1  0 -1  1 -1  1] (Indices: [0, 2, 3, 4, 5, 7, 8, 9, 10, 15, 16, 18]), Candidate: [ 1  2  1  0  1  0  2  0  1  1 -1  1  1  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0  0 -1  1 -1  0  1 -1  1 -1  1 -1  1] (Indices: [0, 2, 3, 4, 5, 7, 8, 9, 11, 14, 16, 18]), Candidate: [ 1  2  1  0  1  0  2  0  1  0  1  0  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0  0 -1  0  0  1  0  0  0 -1  0  0  1] (Indices: [0, 2, 3, 4, 5, 7, 8, 9, 13, 14, 15, 16]), Candidate: [1 2 1 0 1 0 2 0 1 0 0 1 2 1 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 45700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0 -1  1  0  0 -1  0  0  1  0 -1  0  1] (Indices: [0, 2, 3, 4, 5, 7, 8, 10, 11, 12, 16, 17]), Candidate: [1 2 1 0 1 0 2 0 0 2 0 1 0 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 45750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0 -1  1 -1  1  0 -1  0  1  0 -1  0  1] (Indices: [0, 2, 3, 4, 5, 7, 8, 10, 12, 13, 16, 17]), Candidate: [ 1  2  1  0  1  0  2  0  0  2 -1  2  1  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0 -1  1 -1  0  0  1  0 -1  1 -1  1  0] (Indices: [0, 2, 3, 4, 5, 7, 8, 10, 14, 15, 17, 19]), Candidate: [ 1  2  1  0  1  0  2  0  0  2 -1  1  1  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0 -1  0  1 -1  1  0 -1  1  0 -1  0  1] (Indices: [0, 2, 3, 4, 5, 7, 8, 11, 13, 14, 16, 17]), Candidate: [ 1  2  1  0  1  0  2  0  0  1  1  0  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0 -1  0  0  1  0 -1  0  0  1  0  0  0] (Indices: [0, 2, 3, 4, 5, 7, 8, 12, 13, 17, 18, 19]), Candidate: [1 2 1 0 1 0 2 0 0 1 0 2 1 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 45950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  1  0  0  0 -1  0  1 -1  0  1 -1  1] (Indices: [0, 2, 3, 4, 5, 7, 9, 10, 11, 12, 15, 18]), Candidate: [ 1  2  1  0  1  0  2 -1  2  1  0  1  0  1  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  1  0 -1  1  0 -1  1 -1  0  1 -1  1] (Indices: [0, 2, 3, 4, 5, 7, 9, 10, 12, 13, 15, 18]), Candidate: [ 1  2  1  0  1  0  2 -1  2  1 -1  2  1  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 46050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  1  0 -1  0  0  1  0  0 -1  0  1  0] (Indices: [0, 2, 3, 4, 5, 7, 9, 10, 14, 15, 16, 19]), Candidate: [ 1  2  1  0  1  0  2 -1  2  1 -1  1  1  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 46100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  1 -1  1 -1  1  0  0 -1  0  1 -1  1] (Indices: [0, 2, 3, 4, 5, 7, 9, 11, 13, 14, 15, 18]), Candidate: [ 1  2  1  0  1  0  2 -1  2  0  1  0  2  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  1 -1  0  1  0 -1  0  1  0 -1  1  0] (Indices: [0, 2, 3, 4, 5, 7, 9, 12, 13, 16, 17, 19]), Candidate: [ 1  2  1  0  1  0  2 -1  2  0  0  2  1  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  0  1  0  0  0 -1  0  1 -1  0  1  0] (Indices: [0, 2, 3, 4, 5, 7, 10, 11, 12, 13, 16, 19]), Candidate: [ 1  2  1  0  1  0  2 -1  1  2  0  1  1  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  0  1  0 -1  0  1 -1  1  0  0 -1  1] (Indices: [0, 2, 3, 4, 5, 7, 10, 11, 14, 16, 17, 18]), Candidate: [ 1  2  1  0  1  0  2 -1  1  2  0  0  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 46300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  0  1 -1  0  1  0 -1  1  0  0 -1  1] (Indices: [0, 2, 3, 4, 5, 7, 10, 13, 14, 16, 17, 18]), Candidate: [ 1  2  1  0  1  0  2 -1  1  2 -1  1  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 46350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  0  0  1 -1  1  0  0  0  0 -1  0  1] (Indices: [0, 2, 3, 4, 5, 7, 11, 13, 14, 15, 16, 17]), Candidate: [ 1  2  1  0  1  0  2 -1  1  1  1  0  2  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1  0  0  0  0  0 -1  1 -1  0  0  0  1] (Indices: [0, 2, 3, 4, 5, 8, 9, 10, 11, 12, 13, 15]), Candidate: [1 2 1 0 1 0 1 1 1 1 0 1 1 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 46450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1  0  0  0 -1  0  0  1 -1  0  1  0  0] (Indices: [0, 2, 3, 4, 5, 8, 9, 10, 11, 15, 18, 19]), Candidate: [1 2 1 0 1 0 1 1 1 1 0 0 1 1 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 46500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1  0  0 -1  0  1 -1  1  0  0 -1  0  1] (Indices: [0, 2, 3, 4, 5, 8, 9, 10, 13, 15, 16, 17]), Candidate: [ 1  2  1  0  1  0  1  1  1  1 -1  1  2  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1  0 -1  1  0 -1  0  1  0  0 -1  0  1] (Indices: [0, 2, 3, 4, 5, 8, 9, 11, 12, 15, 16, 17]), Candidate: [1 2 1 0 1 0 1 1 1 0 1 1 0 1 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 46600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1  0 -1  0  1  0  0 -1  1 -1  1 -1  1] (Indices: [0, 2, 3, 4, 5, 8, 9, 12, 13, 14, 16, 18]), Candidate: [ 1  2  1  0  1  0  1  1  1  0  0  2  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1  0 -1  0  0  0  0  1  0  0  0  0  0] (Indices: [0, 2, 3, 4, 5, 8, 9, 15, 16, 17, 18, 19]), Candidate: [1 2 1 0 1 0 1 1 1 0 0 1 1 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 46700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1 -1  1  0 -1  1 -1  1 -1  1 -1  1  0] (Indices: [0, 2, 3, 4, 5, 8, 10, 11, 13, 15, 17, 19]), Candidate: [1 2 1 0 1 0 1 1 0 2 0 0 2 0 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 46750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1 -1  1 -1  1 -1  1 -1  0  1  0  0  0] (Indices: [0, 2, 3, 4, 5, 8, 10, 12, 14, 17, 18, 19]), Candidate: [ 1  2  1  0  1  0  1  1  0  2 -1  2  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 46800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1 -1  0  1  0 -1  1  0 -1  1  0 -1  1] (Indices: [0, 2, 3, 4, 5, 8, 11, 12, 14, 15, 17, 18]), Candidate: [1 2 1 0 1 0 1 1 0 1 1 1 0 2 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 46850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1 -1  0  0  1 -1  1  0  0 -1  1  0  0] (Indices: [0, 2, 3, 4, 5, 8, 12, 14, 15, 16, 18, 19]), Candidate: [1 2 1 0 1 0 1 1 0 1 0 2 0 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 46900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  1  0  0 -1  1  0 -1  1  0 -1  0  1] (Indices: [0, 2, 3, 4, 5, 9, 10, 11, 13, 14, 16, 17]), Candidate: [ 1  2  1  0  1  0  1  0  2  1  0  0  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  1  0 -1  1  0 -1  0  0  1  0  0  0] (Indices: [0, 2, 3, 4, 5, 9, 10, 12, 13, 17, 18, 19]), Candidate: [ 1  2  1  0  1  0  1  0  2  1 -1  2  1  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  1 -1  1  0  0 -1  1 -1  1  0 -1  1] (Indices: [0, 2, 3, 4, 5, 9, 11, 12, 13, 15, 17, 18]), Candidate: [1 2 1 0 1 0 1 0 2 0 1 1 1 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 47050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  1 -1  0  1  0  0 -1  1  0 -1  1  0] (Indices: [0, 2, 3, 4, 5, 9, 12, 13, 14, 16, 17, 19]), Candidate: [ 1  2  1  0  1  0  1  0  2  0  0  2  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  0  1  0  0 -1  1 -1  0  1  0  0  0] (Indices: [0, 2, 3, 4, 5, 10, 11, 12, 14, 17, 18, 19]), Candidate: [ 1  2  1  0  1  0  1  0  1  2  0  1  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  0  1 -1  0  1  0  0  0 -1  1  0  0] (Indices: [0, 2, 3, 4, 5, 10, 13, 14, 15, 16, 18, 19]), Candidate: [ 1  2  1  0  1  0  1  0  1  2 -1  1  2  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0  0  0  0 -1  1 -1  0  1 -1  0  0  1] (Indices: [0, 2, 3, 4, 6, 7, 8, 9, 10, 11, 13, 16]), Candidate: [1 2 1 0 0 2 1 0 1 1 0 0 2 0 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 47250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0  0  0 -1  0  1 -1  0  1 -1  1 -1  1] (Indices: [0, 2, 3, 4, 6, 7, 8, 9, 10, 13, 16, 18]), Candidate: [ 1  2  1  0  0  2  1  0  1  1 -1  1  2  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0  0 -1  1 -1  1  0 -1  0  0  0  1  0] (Indices: [0, 2, 3, 4, 6, 7, 8, 9, 11, 13, 14, 19]), Candidate: [ 1  2  1  0  0  2  1  0  1  0  1  0  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0  0 -1  0  1 -1  1 -1  1  0 -1  0  1] (Indices: [0, 2, 3, 4, 6, 7, 8, 9, 12, 14, 16, 17]), Candidate: [ 1  2  1  0  0  2  1  0  1  0  0  2  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0  0 -1  0  0  0  0  0  1  0  0  0  0] (Indices: [0, 2, 3, 4, 6, 7, 8, 9, 16, 17, 18, 19]), Candidate: [1 2 1 0 0 2 1 0 1 0 0 1 1 1 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 47450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0 -1  1  0 -1  0  0  1 -1  1  0 -1  1] (Indices: [0, 2, 3, 4, 6, 7, 8, 10, 11, 15, 17, 18]), Candidate: [1 2 1 0 0 2 1 0 0 2 0 0 1 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 47500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0 -1  1 -1  0  1  0 -1  0  1 -1  1  0] (Indices: [0, 2, 3, 4, 6, 7, 8, 10, 13, 14, 17, 19]), Candidate: [ 1  2  1  0  0  2  1  0  0  2 -1  1  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 47550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0 -1  0  1  0 -1  1 -1  0  1 -1  1  0] (Indices: [0, 2, 3, 4, 6, 7, 8, 11, 12, 14, 17, 19]), Candidate: [ 1  2  1  0  0  2  1  0  0  1  1  1  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0 -1  0  0  1  0  0  0 -1  0  0  1  0] (Indices: [0, 2, 3, 4, 6, 7, 8, 12, 13, 14, 15, 19]), Candidate: [1 2 1 0 0 2 1 0 0 1 0 2 1 1 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 47650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0 -1  0  0  0  0  1  0 -1  1  0  0  0] (Indices: [0, 2, 3, 4, 6, 7, 8, 14, 15, 17, 18, 19]), Candidate: [1 2 1 0 0 2 1 0 0 1 0 1 1 2 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 47700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  1  0  0 -1  0  0  1  0 -1  1 -1  1] (Indices: [0, 2, 3, 4, 6, 7, 9, 10, 11, 15, 16, 18]), Candidate: [ 1  2  1  0  0  2  1 -1  2  1  0  0  1  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  1  0 -1  0  1  0 -1  1 -1  0  1  0] (Indices: [0, 2, 3, 4, 6, 7, 9, 10, 13, 14, 16, 19]), Candidate: [ 1  2  1  0  0  2  1 -1  2  1 -1  1  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 47800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  1 -1  1  0 -1  1 -1  1 -1  0  1  0] (Indices: [0, 2, 3, 4, 6, 7, 9, 11, 12, 14, 16, 19]), Candidate: [ 1  2  1  0  0  2  1 -1  2  0  1  1  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 47850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  1 -1  0  1  0  0  0 -1  1 -1  0  1] (Indices: [0, 2, 3, 4, 6, 7, 9, 12, 13, 14, 15, 17]), Candidate: [ 1  2  1  0  0  2  1 -1  2  0  0  2  1  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  1 -1  0  0  0  1  0  0  0 -1  1  0] (Indices: [0, 2, 3, 4, 6, 7, 9, 14, 15, 16, 17, 19]), Candidate: [ 1  2  1  0  0  2  1 -1  2  0  0  1  1  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  0  1  0 -1  1 -1  1  0  0 -1  0  1] (Indices: [0, 2, 3, 4, 6, 7, 10, 11, 13, 15, 16, 17]), Candidate: [ 1  2  1  0  0  2  1 -1  1  2  0  0  2  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  0  1 -1  1 -1  1  0 -1  0  1  0  0] (Indices: [0, 2, 3, 4, 6, 7, 10, 12, 14, 15, 18, 19]), Candidate: [ 1  2  1  0  0  2  1 -1  1  2 -1  2  0  2  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 48050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  0  0  1  0  0 -1  0  0  1  0  0  0] (Indices: [0, 2, 3, 4, 6, 7, 11, 12, 13, 17, 18, 19]), Candidate: [ 1  2  1  0  0  2  1 -1  1  1  1  1  1  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  0  0  0  1  0 -1  1 -1  1  0  0  0] (Indices: [0, 2, 3, 4, 6, 7, 12, 13, 15, 17, 18, 19]), Candidate: [ 1  2  1  0  0  2  1 -1  1  1  0  2  1  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1  0  0  0 -1  1 -1  0  0  0  1  0  0] (Indices: [0, 2, 3, 4, 6, 8, 9, 10, 11, 13, 18, 19]), Candidate: [1 2 1 0 0 2 0 1 1 1 0 0 2 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 48200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1  0  0 -1  1 -1  0  1 -1  1 -1  1  0] (Indices: [0, 2, 3, 4, 6, 8, 9, 10, 12, 15, 17, 19]), Candidate: [ 1  2  1  0  0  2  0  1  1  1 -1  2  0  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1  0 -1  1  0  0 -1  0  1  0 -1  0  1] (Indices: [0, 2, 3, 4, 6, 8, 9, 11, 12, 13, 16, 17]), Candidate: [1 2 1 0 0 2 0 1 1 0 1 1 1 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 48300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1  0 -1  1 -1  0  1  0 -1  1 -1  1  0] (Indices: [0, 2, 3, 4, 6, 8, 9, 11, 14, 15, 17, 19]), Candidate: [1 2 1 0 0 2 0 1 1 0 1 0 1 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 48350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1  0 -1  0  0  1  0  0 -1  1 -1  1  0] (Indices: [0, 2, 3, 4, 6, 8, 9, 13, 14, 15, 17, 19]), Candidate: [1 2 1 0 0 2 0 1 1 0 0 1 2 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 48400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1 -1  1  0  0 -1  0  0  1 -1  1  0  0] (Indices: [0, 2, 3, 4, 6, 8, 10, 11, 12, 16, 18, 19]), Candidate: [1 2 1 0 0 2 0 1 0 2 0 1 0 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 48450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1 -1  1 -1  1  0 -1  1 -1  1  0 -1  1] (Indices: [0, 2, 3, 4, 6, 8, 10, 12, 13, 15, 17, 18]), Candidate: [ 1  2  1  0  0  2  0  1  0  2 -1  2  1  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1 -1  0  1  0  0  0 -1  0  1  0 -1  1] (Indices: [0, 2, 3, 4, 6, 8, 11, 12, 13, 14, 17, 18]), Candidate: [ 1  2  1  0  0  2  0  1  0  1  1  1  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1 -1  0  0  1  0  0  0  0 -1  1 -1  1] (Indices: [0, 2, 3, 4, 6, 8, 12, 13, 14, 15, 16, 18]), Candidate: [1 2 1 0 0 2 0 1 0 1 0 2 1 1 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 48600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  1  0  0  0 -1  1 -1  0  1 -1  1  0] (Indices: [0, 2, 3, 4, 6, 9, 10, 11, 12, 14, 17, 19]), Candidate: [ 1  2  1  0  0  2  0  0  2  1  0  1  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  1  0 -1  1  0  0  0 -1  0  0  1  0] (Indices: [0, 2, 3, 4, 6, 9, 10, 12, 13, 14, 15, 19]), Candidate: [ 1  2  1  0  0  2  0  0  2  1 -1  2  1  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  1  0 -1  0  0  1  0 -1  1  0  0  0] (Indices: [0, 2, 3, 4, 6, 9, 10, 14, 15, 17, 18, 19]), Candidate: [ 1  2  1  0  0  2  0  0  2  1 -1  1  1  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  1 -1  1 -1  1 -1  1  0 -1  1  0  0] (Indices: [0, 2, 3, 4, 6, 9, 11, 13, 15, 16, 18, 19]), Candidate: [1 2 1 0 0 2 0 0 2 0 1 0 2 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 48800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  0  1  0  0  0 -1  1 -1  1  0 -1  1] (Indices: [0, 2, 3, 4, 6, 10, 11, 12, 13, 15, 17, 18]), Candidate: [1 2 1 0 0 2 0 0 1 2 0 1 1 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 48850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  0  1 -1  1  0  0 -1  1  0 -1  1  0] (Indices: [0, 2, 3, 4, 6, 10, 12, 13, 14, 16, 17, 19]), Candidate: [ 1  2  1  0  0  2  0  0  1  2 -1  2  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 48900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  0  0  0  1  0  0  0  0  0 -1  1  0] (Indices: [0, 2, 3, 4, 6, 12, 13, 14, 15, 16, 17, 19]), Candidate: [1 2 1 0 0 2 0 0 1 1 0 2 1 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 48950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0  0  0  0 -1  0  1 -1  0  1  0 -1  1] (Indices: [0, 2, 3, 4, 7, 8, 9, 10, 11, 14, 17, 18]), Candidate: [ 1  2  1  0  0  1  2  0  1  1  0  0  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0  0  0 -1  0  1  0  0 -1  0  1 -1  1] (Indices: [0, 2, 3, 4, 7, 8, 9, 10, 13, 14, 15, 18]), Candidate: [ 1  2  1  0  0  1  2  0  1  1 -1  1  2  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0  0 -1  1  0 -1  1  0 -1  0  1 -1  1] (Indices: [0, 2, 3, 4, 7, 8, 9, 11, 12, 14, 15, 18]), Candidate: [1 2 1 0 0 1 2 0 1 0 1 1 0 2 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 49100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0  0 -1  1 -1  0  0  1  0 -1  1  0  0] (Indices: [0, 2, 3, 4, 7, 8, 9, 11, 15, 16, 18, 19]), Candidate: [1 2 1 0 0 1 2 0 1 0 1 0 1 1 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 49150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0  0 -1  0  0  1 -1  1  0 -1  1  0  0] (Indices: [0, 2, 3, 4, 7, 8, 9, 13, 15, 16, 18, 19]), Candidate: [1 2 1 0 0 1 2 0 1 0 0 1 2 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 49200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0 -1  1  0 -1  1  0 -1  1 -1  0  1  0] (Indices: [0, 2, 3, 4, 7, 8, 10, 11, 13, 14, 16, 19]), Candidate: [ 1  2  1  0  0  1  2  0  0  2  0  0  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0 -1  1 -1  1 -1  1  0  0 -1  1 -1  1] (Indices: [0, 2, 3, 4, 7, 8, 10, 12, 14, 15, 16, 18]), Candidate: [ 1  2  1  0  0  1  2  0  0  2 -1  2  0  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0 -1  0  1  0  0 -1  1 -1  0  1  0  0] (Indices: [0, 2, 3, 4, 7, 8, 11, 12, 13, 15, 18, 19]), Candidate: [1 2 1 0 0 1 2 0 0 1 1 1 1 0 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 49350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0 -1  0  0  1  0  0 -1  0  1  0  0  0] (Indices: [0, 2, 3, 4, 7, 8, 12, 13, 14, 17, 18, 19]), Candidate: [ 1  2  1  0  0  1  2  0  0  1  0  2  1  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  1  0  0  0 -1  0  0  1  0  0 -1  1] (Indices: [0, 2, 3, 4, 7, 9, 10, 11, 12, 16, 17, 18]), Candidate: [ 1  2  1  0  0  1  2 -1  2  1  0  1  0  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  1  0 -1  1  0 -1  1  0 -1  1 -1  1] (Indices: [0, 2, 3, 4, 7, 9, 10, 12, 13, 15, 16, 18]), Candidate: [ 1  2  1  0  0  1  2 -1  2  1 -1  2  1  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 49500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  1 -1  1  0  0  0 -1  1 -1  1 -1  1] (Indices: [0, 2, 3, 4, 7, 9, 11, 12, 13, 14, 16, 18]), Candidate: [ 1  2  1  0  0  1  2 -1  2  0  1  1  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 49550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  1 -1  1 -1  0  0  1  0  0  0  0  0] (Indices: [0, 2, 3, 4, 7, 9, 11, 15, 16, 17, 18, 19]), Candidate: [ 1  2  1  0  0  1  2 -1  2  0  1  0  1  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  0  1  0  0 -1  1  0  0 -1  1 -1  1] (Indices: [0, 2, 3, 4, 7, 10, 11, 12, 14, 15, 16, 18]), Candidate: [ 1  2  1  0  0  1  2 -1  1  2  0  1  0  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  0  1 -1  1 -1  1  0  0  0  0 -1  1] (Indices: [0, 2, 3, 4, 7, 10, 12, 14, 15, 16, 17, 18]), Candidate: [ 1  2  1  0  0  1  2 -1  1  2 -1  2  0  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 49700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1  0  0  0  0  0  0 -1  1 -1  0  0  1] (Indices: [0, 2, 3, 4, 8, 9, 10, 11, 12, 13, 14, 16]), Candidate: [ 1  2  1  0  0  1  1  1  1  1  0  1  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1  0  0  0 -1  1 -1  0  1  0  0 -1  1] (Indices: [0, 2, 3, 4, 8, 9, 10, 11, 13, 16, 17, 18]), Candidate: [1 2 1 0 0 1 1 1 1 1 0 0 2 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 49800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1  0  0 -1  1 -1  0  1  0  0 -1  1  0] (Indices: [0, 2, 3, 4, 8, 9, 10, 12, 15, 16, 17, 19]), Candidate: [ 1  2  1  0  0  1  1  1  1  1 -1  2  0  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1  0 -1  1  0 -1  1  0 -1  0  1  0  0] (Indices: [0, 2, 3, 4, 8, 9, 11, 12, 14, 15, 18, 19]), Candidate: [1 2 1 0 0 1 1 1 1 0 1 1 0 2 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 49900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1  0 -1  0  1 -1  1 -1  1  0  0  0  0] (Indices: [0, 2, 3, 4, 8, 9, 12, 14, 16, 17, 18, 19]), Candidate: [ 1  2  1  0  0  1  1  1  1  0  0  2  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1 -1  1  0 -1  1  0 -1  1  0  0 -1  1] (Indices: [0, 2, 3, 4, 8, 10, 11, 13, 14, 16, 17, 18]), Candidate: [ 1  2  1  0  0  1  1  1  0  2  0  0  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1 -1  0  1  0  0  0 -1  1  0 -1  1  0] (Indices: [0, 2, 3, 4, 8, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 1  2  1  0  0  1  1  1  0  1  1  1  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  1  0  0  0 -1  1  0  0 -1  1 -1  1] (Indices: [0, 2, 3, 4, 9, 10, 11, 12, 14, 15, 16, 18]), Candidate: [1 2 1 0 0 1 1 0 2 1 0 1 0 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 50100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  1  0 -1  1 -1  1  0  0  0  0 -1  1] (Indices: [0, 2, 3, 4, 9, 10, 12, 14, 15, 16, 17, 18]), Candidate: [ 1  2  1  0  0  1  1  0  2  1 -1  2  0  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  0  1  0  0  0  0  0  0 -1  1 -1  1] (Indices: [0, 2, 3, 4, 10, 11, 12, 13, 14, 15, 16, 18]), Candidate: [1 2 1 0 0 1 1 0 1 2 0 1 1 1 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 50200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0  0  0  0  0 -1  0  0  0  0  0  1  0] (Indices: [0, 2, 3, 5, 6, 7, 8, 9, 10, 11, 12, 19]), Candidate: [ 1  2  1 -1  2  1  1  0  1  1  0  1  0  1  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0  0  0 -1  0  1 -1  1 -1  0  1 -1  1] (Indices: [0, 2, 3, 5, 6, 7, 8, 9, 10, 13, 15, 18]), Candidate: [ 1  2  1 -1  2  1  1  0  1  1 -1  1  2  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 50300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0  0 -1  1 -1  1  0 -1  1 -1  0  0  1] (Indices: [0, 2, 3, 5, 6, 7, 8, 9, 11, 13, 14, 16]), Candidate: [ 1  2  1 -1  2  1  1  0  1  0  1  0  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 50350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0  0 -1  0  1 -1  1  0 -1  1 -1  0  1] (Indices: [0, 2, 3, 5, 6, 7, 8, 9, 12, 14, 15, 17]), Candidate: [ 1  2  1 -1  2  1  1  0  1  0  0  2  0  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0  0 -1  0  0  0  0  1  0  0 -1  1  0] (Indices: [0, 2, 3, 5, 6, 7, 8, 9, 15, 16, 17, 19]), Candidate: [ 1  2  1 -1  2  1  1  0  1  0  0  1  1  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0 -1  1  0 -1  0  0  1  0  0 -1  0  1] (Indices: [0, 2, 3, 5, 6, 7, 8, 10, 11, 15, 16, 17]), Candidate: [ 1  2  1 -1  2  1  1  0  0  2  0  0  1  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0 -1  1 -1  0  1  0 -1  1 -1  1 -1  1] (Indices: [0, 2, 3, 5, 6, 7, 8, 10, 13, 14, 16, 18]), Candidate: [ 1  2  1 -1  2  1  1  0  0  2 -1  1  2  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 50550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0 -1  0  1  0 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 2, 3, 5, 6, 7, 8, 11, 12, 14, 16, 18]), Candidate: [ 1  2  1 -1  2  1  1  0  0  1  1  1  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 50600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0 -1  0  0  1  0  0  0  0 -1  0  0  1] (Indices: [0, 2, 3, 5, 6, 7, 8, 12, 13, 14, 15, 16]), Candidate: [ 1  2  1 -1  2  1  1  0  0  1  0  2  1  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0 -1  0  0  0  0  1  0  0  0  0 -1  1] (Indices: [0, 2, 3, 5, 6, 7, 8, 14, 15, 16, 17, 18]), Candidate: [ 1  2  1 -1  2  1  1  0  0  1  0  1  1  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  1  0  0 -1  0  1 -1  0  1 -1  1  0] (Indices: [0, 2, 3, 5, 6, 7, 9, 10, 11, 14, 17, 19]), Candidate: [ 1  2  1 -1  2  1  1 -1  2  1  0  0  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 50750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  1  0 -1  0  1  0  0 -1  0  0  1  0] (Indices: [0, 2, 3, 5, 6, 7, 9, 10, 13, 14, 15, 19]), Candidate: [ 1  2  1 -1  2  1  1 -1  2  1 -1  1  2  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 50800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  1 -1  1  0 -1  1  0 -1  0  0  1  0] (Indices: [0, 2, 3, 5, 6, 7, 9, 11, 12, 14, 15, 19]), Candidate: [ 1  2  1 -1  2  1  1 -1  2  0  1  1  0  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 50850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  1 -1  1 -1  0  0  1 -1  1  0  0  0] (Indices: [0, 2, 3, 5, 6, 7, 9, 11, 15, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  1  1 -1  2  0  1  0  1  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 50900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  1 -1  0  0  1 -1  1 -1  1  0  0  0] (Indices: [0, 2, 3, 5, 6, 7, 9, 13, 15, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  1  1 -1  2  0  0  1  2  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 50950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  0  1  0 -1  1  0 -1  0  1  0 -1  1] (Indices: [0, 2, 3, 5, 6, 7, 10, 11, 13, 14, 17, 18]), Candidate: [ 1  2  1 -1  2  1  1 -1  1  2  0  0  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 51000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  0  1 -1  1 -1  1  0  0 -1  0  1  0] (Indices: [0, 2, 3, 5, 6, 7, 10, 12, 14, 15, 16, 19]), Candidate: [ 1  2  1 -1  2  1  1 -1  1  2 -1  2  0  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 51050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  0  0  1  0  0 -1  0  1  0  0 -1  1] (Indices: [0, 2, 3, 5, 6, 7, 11, 12, 13, 16, 17, 18]), Candidate: [ 1  2  1 -1  2  1  1 -1  1  1  1  1  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 51100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  0  0  0  1  0 -1  1  0  0  0 -1  1] (Indices: [0, 2, 3, 5, 6, 7, 12, 13, 15, 16, 17, 18]), Candidate: [ 1  2  1 -1  2  1  1 -1  1  1  0  2  1  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 51150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1  0  0  0 -1  1 -1  0  1 -1  0  1  0] (Indices: [0, 2, 3, 5, 6, 8, 9, 10, 11, 13, 16, 19]), Candidate: [ 1  2  1 -1  2  1  0  1  1  1  0  0  2  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1  0  0 -1  1 -1  0  1  0 -1  1 -1  1] (Indices: [0, 2, 3, 5, 6, 8, 9, 10, 12, 15, 16, 18]), Candidate: [ 1  2  1 -1  2  1  0  1  1  1 -1  2  0  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 51250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1  0 -1  1  0  0 -1  1 -1  1 -1  0  1] (Indices: [0, 2, 3, 5, 6, 8, 9, 11, 12, 13, 15, 17]), Candidate: [ 1  2  1 -1  2  1  0  1  1  0  1  1  1  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1  0 -1  1 -1  0  1  0  0 -1  1 -1  1] (Indices: [0, 2, 3, 5, 6, 8, 9, 11, 14, 15, 16, 18]), Candidate: [ 1  2  1 -1  2  1  0  1  1  0  1  0  1  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1  0 -1  0  0  1  0  0  0 -1  1 -1  1] (Indices: [0, 2, 3, 5, 6, 8, 9, 13, 14, 15, 16, 18]), Candidate: [ 1  2  1 -1  2  1  0  1  1  0  0  1  2  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1 -1  1  0  0 -1  0  1 -1  0  1  0  0] (Indices: [0, 2, 3, 5, 6, 8, 10, 11, 12, 15, 18, 19]), Candidate: [ 1  2  1 -1  2  1  0  1  0  2  0  1  0  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1 -1  1 -1  1  0 -1  1  0  0 -1  0  1] (Indices: [0, 2, 3, 5, 6, 8, 10, 12, 13, 15, 16, 17]), Candidate: [ 1  2  1 -1  2  1  0  1  0  2 -1  2  1  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 51500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1 -1  0  1  0  0  0 -1  1  0 -1  0  1] (Indices: [0, 2, 3, 5, 6, 8, 11, 12, 13, 14, 16, 17]), Candidate: [ 1  2  1 -1  2  1  0  1  0  1  1  1  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 51550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1 -1  0  1 -1  0  1 -1  1  0  0  0  0] (Indices: [0, 2, 3, 5, 6, 8, 11, 14, 16, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  1  0  1  0  1  1  0  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 51600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  1  0  0  0 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 2, 3, 5, 6, 9, 10, 11, 12, 14, 16, 18]), Candidate: [ 1  2  1 -1  2  1  0  0  2  1  0  1  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 51650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  1  0 -1  1  0  0  0  0 -1  0  0  1] (Indices: [0, 2, 3, 5, 6, 9, 10, 12, 13, 14, 15, 16]), Candidate: [ 1  2  1 -1  2  1  0  0  2  1 -1  2  1  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 51700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  1  0 -1  0  0  1  0  0  0  0 -1  1] (Indices: [0, 2, 3, 5, 6, 9, 10, 14, 15, 16, 17, 18]), Candidate: [ 1  2  1 -1  2  1  0  0  2  1 -1  1  1  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 51750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  1 -1  1 -1  1  0 -1  0  1  0  0  0] (Indices: [0, 2, 3, 5, 6, 9, 11, 13, 14, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  1  0  0  2  0  1  0  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 51800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  0  1  0  0  0 -1  1  0  0 -1  0  1] (Indices: [0, 2, 3, 5, 6, 10, 11, 12, 13, 15, 16, 17]), Candidate: [ 1  2  1 -1  2  1  0  0  1  2  0  1  1  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  0  1 -1  1  0  0  0 -1  1 -1  1  0] (Indices: [0, 2, 3, 5, 6, 10, 12, 13, 14, 15, 17, 19]), Candidate: [ 1  2  1 -1  2  1  0  0  1  2 -1  2  1  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 51900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  0  0  1 -1  1 -1  1  0  0  0  0  0] (Indices: [0, 2, 3, 5, 6, 11, 13, 15, 16, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  1  0  0  1  1  1  0  2  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0  0  0  0 -1  0  1 -1  1  0 -1  0  1] (Indices: [0, 2, 3, 5, 7, 8, 9, 10, 11, 14, 16, 17]), Candidate: [ 1  2  1 -1  2  0  2  0  1  1  0  0  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0  0  0 -1  1 -1  0  0  0  1  0  0  0] (Indices: [0, 2, 3, 5, 7, 8, 9, 10, 12, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  0  2  0  1  1 -1  2  0  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0  0 -1  1  0  0 -1  0  0  0  1  0  0] (Indices: [0, 2, 3, 5, 7, 8, 9, 11, 12, 13, 18, 19]), Candidate: [ 1  2  1 -1  2  0  2  0  1  0  1  1  1  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0  0 -1  1 -1  0  1 -1  0  1  0  0  0] (Indices: [0, 2, 3, 5, 7, 8, 9, 11, 14, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  0  2  0  1  0  1  0  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0  0 -1  0  0  1  0 -1  0  1  0  0  0] (Indices: [0, 2, 3, 5, 7, 8, 9, 13, 14, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  0  2  0  1  0  0  1  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0 -1  1  0 -1  1  0  0 -1  0  0  1  0] (Indices: [0, 2, 3, 5, 7, 8, 10, 11, 13, 14, 15, 19]), Candidate: [ 1  2  1 -1  2  0  2  0  0  2  0  0  2  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0 -1  1 -1  1  0 -1  0  1 -1  1  0  0] (Indices: [0, 2, 3, 5, 7, 8, 10, 12, 13, 16, 18, 19]), Candidate: [ 1  2  1 -1  2  0  2  0  0  2 -1  2  1  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0 -1  0  1  0  0 -1  1  0 -1  0  1  0] (Indices: [0, 2, 3, 5, 7, 8, 11, 12, 13, 15, 16, 19]), Candidate: [ 1  2  1 -1  2  0  2  0  0  1  1  1  1  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0 -1  0  0  1  0  0 -1  1  0  0 -1  1] (Indices: [0, 2, 3, 5, 7, 8, 12, 13, 14, 16, 17, 18]), Candidate: [ 1  2  1 -1  2  0  2  0  0  1  0  2  1  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  1  0  0  0 -1  0  1 -1  1  0 -1  1] (Indices: [0, 2, 3, 5, 7, 9, 10, 11, 12, 15, 17, 18]), Candidate: [ 1  2  1 -1  2  0  2 -1  2  1  0  1  0  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  1  0 -1  1  0  0 -1  0  1 -1  1  0] (Indices: [0, 2, 3, 5, 7, 9, 10, 12, 13, 14, 17, 19]), Candidate: [ 1  2  1 -1  2  0  2 -1  2  1 -1  2  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 52500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  1 -1  1  0  0  0  0 -1  0  1 -1  1] (Indices: [0, 2, 3, 5, 7, 9, 11, 12, 13, 14, 15, 18]), Candidate: [ 1  2  1 -1  2  0  2 -1  2  0  1  1  1  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  1 -1  1 -1  0  1  0  0 -1  1  0  0] (Indices: [0, 2, 3, 5, 7, 9, 11, 14, 15, 16, 18, 19]), Candidate: [ 1  2  1 -1  2  0  2 -1  2  0  1  0  1  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  0  1  0  0  0 -1  0  1 -1  1  0  0] (Indices: [0, 2, 3, 5, 7, 10, 11, 12, 13, 16, 18, 19]), Candidate: [ 1  2  1 -1  2  0  2 -1  1  2  0  1  1  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  0  1 -1  1  0 -1  1  0 -1  1  0  0] (Indices: [0, 2, 3, 5, 7, 10, 12, 13, 15, 16, 18, 19]), Candidate: [ 1  2  1 -1  2  0  2 -1  1  2 -1  2  1  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 52700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  0  0  0  1 -1  1  0  0  0  0  0  0] (Indices: [0, 2, 3, 5, 7, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  0  2 -1  1  1  0  2  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1  0  0  0 -1  1 -1  1 -1  1  0 -1  1] (Indices: [0, 2, 3, 5, 8, 9, 10, 11, 13, 15, 17, 18]), Candidate: [ 1  2  1 -1  2  0  1  1  1  1  0  0  2  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1  0  0 -1  1 -1  1 -1  1 -1  1  0  0] (Indices: [0, 2, 3, 5, 8, 9, 10, 12, 14, 16, 18, 19]), Candidate: [ 1  2  1 -1  2  0  1  1  1  1 -1  2  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 52850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1  0 -1  1  0 -1  1  0  0 -1  0  1  0] (Indices: [0, 2, 3, 5, 8, 9, 11, 12, 14, 15, 16, 19]), Candidate: [ 1  2  1 -1  2  0  1  1  1  0  1  1  0  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1  0 -1  0  1 -1  1  0  0  0 -1  1  0] (Indices: [0, 2, 3, 5, 8, 9, 12, 14, 15, 16, 17, 19]), Candidate: [ 1  2  1 -1  2  0  1  1  1  0  0  2  0  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1 -1  1  0 -1  1  0  0 -1  1  0 -1  1] (Indices: [0, 2, 3, 5, 8, 10, 11, 13, 14, 15, 17, 18]), Candidate: [ 1  2  1 -1  2  0  1  1  0  2  0  0  2  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1 -1  0  1  0  0  0  0 -1  1 -1  1  0] (Indices: [0, 2, 3, 5, 8, 11, 12, 13, 14, 15, 17, 19]), Candidate: [ 1  2  1 -1  2  0  1  1  0  1  1  1  1  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  1  0  0  0  0 -1  0  1 -1  1  0  0] (Indices: [0, 2, 3, 5, 9, 10, 11, 12, 13, 16, 18, 19]), Candidate: [ 1  2  1 -1  2  0  1  0  2  1  0  1  1  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  1  0 -1  1  0 -1  1  0 -1  1  0  0] (Indices: [0, 2, 3, 5, 9, 10, 12, 13, 15, 16, 18, 19]), Candidate: [ 1  2  1 -1  2  0  1  0  2  1 -1  2  1  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 53150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  1 -1  0  1 -1  1  0  0  0  0  0  0] (Indices: [0, 2, 3, 5, 9, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  0  1  0  2  0  0  2  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0  0  0  0  0  0 -1  0  0  1 -1  0  1] (Indices: [0, 2, 3, 6, 7, 8, 9, 10, 11, 12, 13, 17]), Candidate: [ 1  2  1 -1  1  2  1  0  1  1  0  1  1  0  0  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0  0  0  0 -1  0  0  0  1  0 -1  1  0] (Indices: [0, 2, 3, 6, 7, 8, 9, 10, 11, 16, 17, 19]), Candidate: [ 1  2  1 -1  1  2  1  0  1  1  0  0  1  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0  0  0 -1  0  1 -1  1  0 -1  0  1  0] (Indices: [0, 2, 3, 6, 7, 8, 9, 10, 13, 15, 16, 19]), Candidate: [ 1  2  1 -1  1  2  1  0  1  1 -1  1  2  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 53350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0  0 -1  1  0 -1  0  1  0 -1  0  1  0] (Indices: [0, 2, 3, 6, 7, 8, 9, 11, 12, 15, 16, 19]), Candidate: [ 1  2  1 -1  1  2  1  0  1  0  1  1  0  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0  0 -1  0  1  0  0 -1  0  1  0 -1  1] (Indices: [0, 2, 3, 6, 7, 8, 9, 12, 13, 14, 17, 18]), Candidate: [ 1  2  1 -1  1  2  1  0  1  0  0  2  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 53450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0 -1  1  0  0  0  0 -1  1 -1  0  0  1] (Indices: [0, 2, 3, 6, 7, 8, 10, 11, 12, 13, 14, 16]), Candidate: [ 1  2  1 -1  1  2  1  0  0  2  0  1  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 53500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0 -1  1  0 -1  1 -1  0  1  0  0 -1  1] (Indices: [0, 2, 3, 6, 7, 8, 10, 11, 13, 16, 17, 18]), Candidate: [ 1  2  1 -1  1  2  1  0  0  2  0  0  2  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0 -1  1 -1  1 -1  0  1  0  0 -1  1  0] (Indices: [0, 2, 3, 6, 7, 8, 10, 12, 15, 16, 17, 19]), Candidate: [ 1  2  1 -1  1  2  1  0  0  2 -1  2  0  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 53600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0 -1  0  1  0 -1  1  0 -1  0  1  0  0] (Indices: [0, 2, 3, 6, 7, 8, 11, 12, 14, 15, 18, 19]), Candidate: [ 1  2  1 -1  1  2  1  0  0  1  1  1  0  2  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0 -1  0  0  1 -1  1 -1  1  0  0  0  0] (Indices: [0, 2, 3, 6, 7, 8, 12, 14, 16, 17, 18, 19]), Candidate: [ 1  2  1 -1  1  2  1  0  0  1  0  2  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 53700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  1  0  0 -1  1  0 -1  1 -1  0  1  0] (Indices: [0, 2, 3, 6, 7, 9, 10, 11, 13, 14, 16, 19]), Candidate: [ 1  2  1 -1  1  2  1 -1  2  1  0  0  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 53750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  1  0 -1  1 -1  1  0  0 -1  1 -1  1] (Indices: [0, 2, 3, 6, 7, 9, 10, 12, 14, 15, 16, 18]), Candidate: [ 1  2  1 -1  1  2  1 -1  2  1 -1  2  0  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 53800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  1 -1  1  0  0 -1  1 -1  0  1  0  0] (Indices: [0, 2, 3, 6, 7, 9, 11, 12, 13, 15, 18, 19]), Candidate: [ 1  2  1 -1  1  2  1 -1  2  0  1  1  1  0  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 53850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  1 -1  0  1  0  0 -1  0  1  0  0  0] (Indices: [0, 2, 3, 6, 7, 9, 12, 13, 14, 17, 18, 19]), Candidate: [ 1  2  1 -1  1  2  1 -1  2  0  0  2  1  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 53900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  0  1  0  0 -1  0  1  0  0 -1  1  0] (Indices: [0, 2, 3, 6, 7, 10, 11, 12, 15, 16, 17, 19]), Candidate: [ 1  2  1 -1  1  2  1 -1  1  2  0  1  0  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 53950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  0  1 -1  0  1  0 -1  1  0  0  0  0] (Indices: [0, 2, 3, 6, 7, 10, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  2  1 -1  1  2  1 -1  1  2 -1  1  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 54000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1  0  0  0  0  0 -1  0  1 -1  0  1  0] (Indices: [0, 2, 3, 6, 8, 9, 10, 11, 12, 13, 16, 19]), Candidate: [ 1  2  1 -1  1  2  0  1  1  1  0  1  1  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1  0  0  0 -1  0  1 -1  1  0  0 -1  1] (Indices: [0, 2, 3, 6, 8, 9, 10, 11, 14, 16, 17, 18]), Candidate: [ 1  2  1 -1  1  2  0  1  1  1  0  0  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 54100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1  0  0 -1  0  1  0 -1  1  0  0 -1  1] (Indices: [0, 2, 3, 6, 8, 9, 10, 13, 14, 16, 17, 18]), Candidate: [ 1  2  1 -1  1  2  0  1  1  1 -1  1  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 54150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1  0 -1  1 -1  1  0  0  0  0 -1  0  1] (Indices: [0, 2, 3, 6, 8, 9, 11, 13, 14, 15, 16, 17]), Candidate: [ 1  2  1 -1  1  2  0  1  1  0  1  0  2  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1 -1  1  0  0  0  0  0 -1  1 -1  0  1] (Indices: [0, 2, 3, 6, 8, 10, 11, 12, 13, 14, 15, 17]), Candidate: [ 1  2  1 -1  1  2  0  1  0  2  0  1  1  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1 -1  1  0 -1  0  1  0  0  0 -1  1  0] (Indices: [0, 2, 3, 6, 8, 10, 11, 14, 15, 16, 17, 19]), Candidate: [ 1  2  1 -1  1  2  0  1  0  2  0  0  1  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1 -1  0  1  0 -1  1  0  0 -1  1  0  0] (Indices: [0, 2, 3, 6, 8, 11, 12, 14, 15, 16, 18, 19]), Candidate: [ 1  2  1 -1  1  2  0  1  0  1  1  1  0  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  1  0  0  0 -1  0  1  0  0 -1  1  0] (Indices: [0, 2, 3, 6, 9, 10, 11, 12, 15, 16, 17, 19]), Candidate: [ 1  2  1 -1  1  2  0  0  2  1  0  1  0  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  1  0 -1  0  1  0 -1  1  0  0  0  0] (Indices: [0, 2, 3, 6, 9, 10, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  2  1 -1  1  2  0  0  2  1 -1  1  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 54450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  0  1  0  0  0 -1  1  0  0 -1  1  0] (Indices: [0, 2, 3, 6, 10, 11, 12, 13, 15, 16, 17, 19]), Candidate: [ 1  2  1 -1  1  2  0  0  1  2  0  1  1  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0  0  0  0  0 -1  1  0 -1  1 -1  0  1] (Indices: [0, 2, 3, 7, 8, 9, 10, 11, 12, 14, 15, 17]), Candidate: [ 1  2  1 -1  1  1  2  0  1  1  0  1  0  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0  0  0  0 -1  0  0  1  0  0 -1  1  0] (Indices: [0, 2, 3, 7, 8, 9, 10, 11, 15, 16, 17, 19]), Candidate: [ 1  2  1 -1  1  1  2  0  1  1  0  0  1  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0  0  0 -1  0  1 -1  1  0  0 -1  1  0] (Indices: [0, 2, 3, 7, 8, 9, 10, 13, 15, 16, 17, 19]), Candidate: [ 1  2  1 -1  1  1  2  0  1  1 -1  1  2  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 54650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0  0 -1  1 -1  1  0  0 -1  0  1  0  0] (Indices: [0, 2, 3, 7, 8, 9, 11, 13, 14, 15, 18, 19]), Candidate: [ 1  2  1 -1  1  1  2  0  1  0  1  0  2  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0 -1  1  0  0  0  0 -1  1 -1  0  1  0] (Indices: [0, 2, 3, 7, 8, 10, 11, 12, 13, 14, 16, 19]), Candidate: [ 1  2  1 -1  1  1  2  0  0  2  0  1  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 54750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0 -1  1 -1  1  0  0  0  0  0 -1  0  1] (Indices: [0, 2, 3, 7, 8, 10, 12, 13, 14, 15, 16, 17]), Candidate: [ 1  2  1 -1  1  1  2  0  0  2 -1  2  1  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 54800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0 -1  0  1 -1  1  0  0  0  0 -1  1  0] (Indices: [0, 2, 3, 7, 8, 11, 13, 14, 15, 16, 17, 19]), Candidate: [ 1  2  1 -1  1  1  2  0  0  1  1  0  2  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  1  0  0 -1  1  0  0  0 -1  1 -1  1] (Indices: [0, 2, 3, 7, 9, 10, 11, 13, 14, 15, 16, 18]), Candidate: [ 1  2  1 -1  1  1  2 -1  2  1  0  0  2  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 54900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  1 -1  1  0  0  0  0  0 -1  0  1  0] (Indices: [0, 2, 3, 7, 9, 11, 12, 13, 14, 15, 16, 19]), Candidate: [ 1  2  1 -1  1  1  2 -1  2  0  1  1  1  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 54950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  0  1  0  0 -1  1  0  0  0 -1  1  0] (Indices: [0, 2, 3, 7, 10, 11, 12, 14, 15, 16, 17, 19]), Candidate: [ 1  2  1 -1  1  1  2 -1  1  2  0  1  0  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1  0  0  0  0 -1  1  0  0 -1  1 -1  1] (Indices: [0, 2, 3, 8, 9, 10, 11, 12, 14, 15, 16, 18]), Candidate: [ 1  2  1 -1  1  1  1  1  1  1  0  1  0  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1  0  0 -1  1 -1  1  0  0  0  0 -1  1] (Indices: [0, 2, 3, 8, 9, 10, 12, 14, 15, 16, 17, 18]), Candidate: [ 1  2  1 -1  1  1  1  1  1  1 -1  2  0  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1 -1  1  0  0  0  0  0  0 -1  1 -1  1] (Indices: [0, 2, 3, 8, 10, 11, 12, 13, 14, 15, 16, 18]), Candidate: [ 1  2  1 -1  1  1  1  1  0  2  0  1  1  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  0  1  0  0  0  0  0 -1  1  0  0 -1  1] (Indices: [0, 2, 3, 9, 10, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 1  2  1 -1  1  1  1  0  2  1  0  1  1  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0  0  0  0  0 -1  1 -1  0  0  0  0  1] (Indices: [0, 2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14]), Candidate: [ 1  2  0  1  1  1  1  0  1  1  0  1  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0  0  0 -1  0  1  0 -1  0  1 -1  0  1] (Indices: [0, 2, 4, 5, 6, 7, 8, 9, 10, 13, 14, 17]), Candidate: [ 1  2  0  1  1  1  1  0  1  1 -1  1  2  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0  0 -1  1  0 -1  0  0  1 -1  0  1  0] (Indices: [0, 2, 4, 5, 6, 7, 8, 9, 11, 12, 16, 19]), Candidate: [1 2 0 1 1 1 1 0 1 0 1 1 0 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 55350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0  0 -1  0  1  0 -1  0  1 -1  0  1  0] (Indices: [0, 2, 4, 5, 6, 7, 8, 9, 12, 13, 16, 19]), Candidate: [1 2 0 1 1 1 1 0 1 0 0 2 1 0 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 55400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0  0 -1  0  0  0  1 -1  1  0  0 -1  1] (Indices: [0, 2, 4, 5, 6, 7, 8, 9, 14, 16, 17, 18]), Candidate: [ 1  2  0  1  1  1  1  0  1  0  0  1  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0 -1  1  0 -1  0  1 -1  1 -1  1 -1  1] (Indices: [0, 2, 4, 5, 6, 7, 8, 10, 11, 14, 16, 18]), Candidate: [ 1  2  0  1  1  1  1  0  0  2  0  0  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0 -1  1 -1  0  1  0  0  0 -1  0  0  1] (Indices: [0, 2, 4, 5, 6, 7, 8, 10, 13, 14, 15, 16]), Candidate: [ 1  2  0  1  1  1  1  0  0  2 -1  1  2  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0 -1  0  1  0 -1  1  0  0 -1  0  0  1] (Indices: [0, 2, 4, 5, 6, 7, 8, 11, 12, 14, 15, 16]), Candidate: [1 2 0 1 1 1 1 0 0 1 1 1 0 2 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 55600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0 -1  0  1 -1  0  0  1  0  0  0 -1  1] (Indices: [0, 2, 4, 5, 6, 7, 8, 11, 15, 16, 17, 18]), Candidate: [1 2 0 1 1 1 1 0 0 1 1 0 1 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 55650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0 -1  0  0  0  1 -1  1  0  0  0 -1  1] (Indices: [0, 2, 4, 5, 6, 7, 8, 13, 15, 16, 17, 18]), Candidate: [1 2 0 1 1 1 1 0 0 1 0 1 2 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 55700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  1  0  0 -1  0  1  0 -1  0  0  1  0] (Indices: [0, 2, 4, 5, 6, 7, 9, 10, 11, 14, 15, 19]), Candidate: [ 1  2  0  1  1  1  1 -1  2  1  0  0  1  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  1  0 -1  1 -1  0  0  1 -1  1  0  0] (Indices: [0, 2, 4, 5, 6, 7, 9, 10, 12, 16, 18, 19]), Candidate: [ 1  2  0  1  1  1  1 -1  2  1 -1  2  0  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  1 -1  1  0  0 -1  0  0  1 -1  1  0] (Indices: [0, 2, 4, 5, 6, 7, 9, 11, 12, 13, 17, 19]), Candidate: [ 1  2  0  1  1  1  1 -1  2  0  1  1  1  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  1 -1  1 -1  0  1 -1  1 -1  1  0  0] (Indices: [0, 2, 4, 5, 6, 7, 9, 11, 14, 16, 18, 19]), Candidate: [ 1  2  0  1  1  1  1 -1  2  0  1  0  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  1 -1  0  0  1  0 -1  1 -1  1  0  0] (Indices: [0, 2, 4, 5, 6, 7, 9, 13, 14, 16, 18, 19]), Candidate: [ 1  2  0  1  1  1  1 -1  2  0  0  1  2  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  0  1  0 -1  1  0  0 -1  0  1 -1  1] (Indices: [0, 2, 4, 5, 6, 7, 10, 11, 13, 14, 15, 18]), Candidate: [ 1  2  0  1  1  1  1 -1  1  2  0  0  2  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  0  1 -1  1  0 -1  0  1  0 -1  1  0] (Indices: [0, 2, 4, 5, 6, 7, 10, 12, 13, 16, 17, 19]), Candidate: [ 1  2  0  1  1  1  1 -1  1  2 -1  2  1  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  0  0  1  0  0 -1  1  0 -1  1 -1  1] (Indices: [0, 2, 4, 5, 6, 7, 11, 12, 13, 15, 16, 18]), Candidate: [ 1  2  0  1  1  1  1 -1  1  1  1  1  1  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  0  0  0  1  0  0  0 -1  0  1  0  0] (Indices: [0, 2, 4, 5, 6, 7, 12, 13, 14, 15, 18, 19]), Candidate: [ 1  2  0  1  1  1  1 -1  1  1  0  2  1  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1  0  0  0 -1  1 -1  1 -1  1 -1  0  1] (Indices: [0, 2, 4, 5, 6, 8, 9, 10, 11, 13, 15, 17]), Candidate: [1 2 0 1 1 1 0 1 1 1 0 0 2 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 56200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1  0  0 -1  1 -1  1 -1  1 -1  0  1  0] (Indices: [0, 2, 4, 5, 6, 8, 9, 10, 12, 14, 16, 19]), Candidate: [ 1  2  0  1  1  1  0  1  1  1 -1  2  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1  0 -1  1  0  0  0 -1  1 -1  0  0  1] (Indices: [0, 2, 4, 5, 6, 8, 9, 11, 12, 13, 14, 16]), Candidate: [ 1  2  0  1  1  1  0  1  1  0  1  1  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1  0 -1  1 -1  1 -1  0  1  0  0 -1  1] (Indices: [0, 2, 4, 5, 6, 8, 9, 11, 13, 16, 17, 18]), Candidate: [1 2 0 1 1 1 0 1 1 0 1 0 2 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 56350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1  0 -1  0  1 -1  0  1  0  0 -1  1  0] (Indices: [0, 2, 4, 5, 6, 8, 9, 12, 15, 16, 17, 19]), Candidate: [1 2 0 1 1 1 0 1 1 0 0 2 0 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 56400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1 -1  1  0  0 -1  0  1  0  0 -1  0  1] (Indices: [0, 2, 4, 5, 6, 8, 10, 11, 12, 15, 16, 17]), Candidate: [1 2 0 1 1 1 0 1 0 2 0 1 0 1 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 56450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1 -1  1 -1  1  0  0 -1  1 -1  1 -1  1] (Indices: [0, 2, 4, 5, 6, 8, 10, 12, 13, 14, 16, 18]), Candidate: [ 1  2  0  1  1  1  0  1  0  2 -1  2  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1 -1  1 -1  0  0  0  1  0  0  0  0  0] (Indices: [0, 2, 4, 5, 6, 8, 10, 15, 16, 17, 18, 19]), Candidate: [ 1  2  0  1  1  1  0  1  0  2 -1  1  1  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1 -1  0  1 -1  1 -1  0  1  0  0  0  0] (Indices: [0, 2, 4, 5, 6, 8, 11, 13, 16, 17, 18, 19]), Candidate: [1 2 0 1 1 1 0 1 0 1 1 0 2 0 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 56600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  1  0  0  0 -1  1  0  0 -1  0  0  1] (Indices: [0, 2, 4, 5, 6, 9, 10, 11, 12, 14, 15, 16]), Candidate: [1 2 0 1 1 1 0 0 2 1 0 1 0 2 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 56650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  1  0  0 -1  0  0  1  0  0  0 -1  1] (Indices: [0, 2, 4, 5, 6, 9, 10, 11, 15, 16, 17, 18]), Candidate: [1 2 0 1 1 1 0 0 2 1 0 0 1 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 56700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  1  0 -1  0  1 -1  1  0  0  0 -1  1] (Indices: [0, 2, 4, 5, 6, 9, 10, 13, 15, 16, 17, 18]), Candidate: [ 1  2  0  1  1  1  0  0  2  1 -1  1  2  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  1 -1  1 -1  1  0  0 -1  1 -1  1  0] (Indices: [0, 2, 4, 5, 6, 9, 11, 13, 14, 15, 17, 19]), Candidate: [1 2 0 1 1 1 0 0 2 0 1 0 2 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 56800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  0  1  0  0  0  0 -1  1 -1  1 -1  1] (Indices: [0, 2, 4, 5, 6, 10, 11, 12, 13, 14, 16, 18]), Candidate: [ 1  2  0  1  1  1  0  0  1  2  0  1  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  0  1  0 -1  0  0  1  0  0  0  0  0] (Indices: [0, 2, 4, 5, 6, 10, 11, 15, 16, 17, 18, 19]), Candidate: [1 2 0 1 1 1 0 0 1 2 0 0 1 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 56900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  0  0  1 -1  1  0  0  0  0  0 -1  1] (Indices: [0, 2, 4, 5, 6, 11, 13, 14, 15, 16, 17, 18]), Candidate: [1 2 0 1 1 1 0 0 1 1 1 0 2 1 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 56950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0  0  0  0 -1  1 -1  0  0  0  1  0  0] (Indices: [0, 2, 4, 5, 7, 8, 9, 10, 11, 13, 18, 19]), Candidate: [1 2 0 1 1 0 2 0 1 1 0 0 2 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 57000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0  0  0 -1  1 -1  0  1 -1  1 -1  1  0] (Indices: [0, 2, 4, 5, 7, 8, 9, 10, 12, 15, 17, 19]), Candidate: [ 1  2  0  1  1  0  2  0  1  1 -1  2  0  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0  0 -1  1  0  0 -1  0  1  0 -1  0  1] (Indices: [0, 2, 4, 5, 7, 8, 9, 11, 12, 13, 16, 17]), Candidate: [1 2 0 1 1 0 2 0 1 0 1 1 1 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 57100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0  0 -1  1 -1  0  1  0 -1  1 -1  1  0] (Indices: [0, 2, 4, 5, 7, 8, 9, 11, 14, 15, 17, 19]), Candidate: [1 2 0 1 1 0 2 0 1 0 1 0 1 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 57150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0  0 -1  0  0  1  0  0 -1  1 -1  1  0] (Indices: [0, 2, 4, 5, 7, 8, 9, 13, 14, 15, 17, 19]), Candidate: [1 2 0 1 1 0 2 0 1 0 0 1 2 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 57200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0 -1  1  0  0 -1  0  0  1 -1  1  0  0] (Indices: [0, 2, 4, 5, 7, 8, 10, 11, 12, 16, 18, 19]), Candidate: [1 2 0 1 1 0 2 0 0 2 0 1 0 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 57250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0 -1  1 -1  1  0 -1  1 -1  1  0 -1  1] (Indices: [0, 2, 4, 5, 7, 8, 10, 12, 13, 15, 17, 18]), Candidate: [ 1  2  0  1  1  0  2  0  0  2 -1  2  1  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0 -1  0  1  0  0  0 -1  0  1  0 -1  1] (Indices: [0, 2, 4, 5, 7, 8, 11, 12, 13, 14, 17, 18]), Candidate: [ 1  2  0  1  1  0  2  0  0  1  1  1  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0 -1  0  0  1  0  0  0  0 -1  1 -1  1] (Indices: [0, 2, 4, 5, 7, 8, 12, 13, 14, 15, 16, 18]), Candidate: [1 2 0 1 1 0 2 0 0 1 0 2 1 1 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 57400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  1  0  0  0 -1  1 -1  0  1 -1  1  0] (Indices: [0, 2, 4, 5, 7, 9, 10, 11, 12, 14, 17, 19]), Candidate: [ 1  2  0  1  1  0  2 -1  2  1  0  1  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  1  0 -1  1  0  0  0 -1  0  0  1  0] (Indices: [0, 2, 4, 5, 7, 9, 10, 12, 13, 14, 15, 19]), Candidate: [ 1  2  0  1  1  0  2 -1  2  1 -1  2  1  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  1  0 -1  0  0  1  0 -1  1  0  0  0] (Indices: [0, 2, 4, 5, 7, 9, 10, 14, 15, 17, 18, 19]), Candidate: [ 1  2  0  1  1  0  2 -1  2  1 -1  1  1  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  1 -1  1 -1  1 -1  1  0 -1  1  0  0] (Indices: [0, 2, 4, 5, 7, 9, 11, 13, 15, 16, 18, 19]), Candidate: [ 1  2  0  1  1  0  2 -1  2  0  1  0  2  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  0  1  0  0  0 -1  1 -1  1  0 -1  1] (Indices: [0, 2, 4, 5, 7, 10, 11, 12, 13, 15, 17, 18]), Candidate: [ 1  2  0  1  1  0  2 -1  1  2  0  1  1  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  0  1 -1  1  0  0 -1  1  0 -1  1  0] (Indices: [0, 2, 4, 5, 7, 10, 12, 13, 14, 16, 17, 19]), Candidate: [ 1  2  0  1  1  0  2 -1  1  2 -1  2  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 57700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  0  0  0  1  0  0  0  0  0 -1  1  0] (Indices: [0, 2, 4, 5, 7, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 1  2  0  1  1  0  2 -1  1  1  0  2  1  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1  0  0  0 -1  1  0 -1  0  1 -1  1  0] (Indices: [0, 2, 4, 5, 8, 9, 10, 11, 13, 14, 17, 19]), Candidate: [ 1  2  0  1  1  0  1  1  1  1  0  0  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1  0  0 -1  1 -1  1  0 -1  1  0 -1  1] (Indices: [0, 2, 4, 5, 8, 9, 10, 12, 14, 15, 17, 18]), Candidate: [ 1  2  0  1  1  0  1  1  1  1 -1  2  0  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1  0 -1  1  0  0 -1  0  1  0 -1  1  0] (Indices: [0, 2, 4, 5, 8, 9, 11, 12, 13, 16, 17, 19]), Candidate: [1 2 0 1 1 0 1 1 1 0 1 1 1 0 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 57900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1  0 -1  0  1  0 -1  1  0  0 -1  1  0] (Indices: [0, 2, 4, 5, 8, 9, 12, 13, 15, 16, 17, 19]), Candidate: [1 2 0 1 1 0 1 1 1 0 0 2 1 0 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 57950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1 -1  1  0  0 -1  0  1 -1  1  0  0  0] (Indices: [0, 2, 4, 5, 8, 10, 11, 12, 15, 17, 18, 19]), Candidate: [1 2 0 1 1 0 1 1 0 2 0 1 0 1 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 58000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1 -1  1 -1  0  0  1  0  0  0  0  0  0] (Indices: [0, 2, 4, 5, 8, 10, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  2  0  1  1  0  1  1  0  2 -1  1  1  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  1  0  0  0  0 -1  1 -1  1  0 -1  1] (Indices: [0, 2, 4, 5, 9, 10, 11, 12, 13, 15, 17, 18]), Candidate: [1 2 0 1 1 0 1 0 2 1 0 1 1 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 58100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  1  0 -1  1  0  0 -1  1  0 -1  1  0] (Indices: [0, 2, 4, 5, 9, 10, 12, 13, 14, 16, 17, 19]), Candidate: [ 1  2  0  1  1  0  1  0  2  1 -1  2  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  1 -1  0  1  0  0  0  0  0 -1  1  0] (Indices: [0, 2, 4, 5, 9, 12, 13, 14, 15, 16, 17, 19]), Candidate: [1 2 0 1 1 0 1 0 2 0 0 2 1 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 58200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  0  0  1 -1  1  0  0  0  0  0  0  0] (Indices: [0, 2, 4, 5, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [1 2 0 1 1 0 1 0 1 1 1 0 2 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 58250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0  0  0  0 -1  0  0  1  0 -1  0  1  0] (Indices: [0, 2, 4, 6, 7, 8, 9, 10, 11, 15, 16, 19]), Candidate: [1 2 0 1 0 2 1 0 1 1 0 0 1 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 58300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0  0  0 -1  0  1  0 -1  0  1  0 -1  1] (Indices: [0, 2, 4, 6, 7, 8, 9, 10, 13, 14, 17, 18]), Candidate: [ 1  2  0  1  0  2  1  0  1  1 -1  1  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0  0 -1  1  0 -1  1 -1  0  1  0 -1  1] (Indices: [0, 2, 4, 6, 7, 8, 9, 11, 12, 14, 17, 18]), Candidate: [ 1  2  0  1  0  2  1  0  1  0  1  1  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0  0 -1  0  1  0  0  0 -1  0  1 -1  1] (Indices: [0, 2, 4, 6, 7, 8, 9, 12, 13, 14, 15, 18]), Candidate: [1 2 0 1 0 2 1 0 1 0 0 2 1 1 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 58450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0  0 -1  0  0  0  1  0  0 -1  1  0  0] (Indices: [0, 2, 4, 6, 7, 8, 9, 14, 15, 16, 18, 19]), Candidate: [1 2 0 1 0 2 1 0 1 0 0 1 1 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 58500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0 -1  1  0 -1  1 -1  1  0 -1  1 -1  1] (Indices: [0, 2, 4, 6, 7, 8, 10, 11, 13, 15, 16, 18]), Candidate: [1 2 0 1 0 2 1 0 0 2 0 0 2 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 58550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0 -1  1 -1  1 -1  1 -1  1  0  0 -1  1] (Indices: [0, 2, 4, 6, 7, 8, 10, 12, 14, 16, 17, 18]), Candidate: [ 1  2  0  1  0  2  1  0  0  2 -1  2  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0 -1  0  1  0 -1  1  0  0  0 -1  0  1] (Indices: [0, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17]), Candidate: [1 2 0 1 0 2 1 0 0 1 1 1 0 2 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 58650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0 -1  0  0  1  0 -1  0  1  0  0  0  0] (Indices: [0, 2, 4, 6, 7, 8, 12, 13, 16, 17, 18, 19]), Candidate: [1 2 0 1 0 2 1 0 0 1 0 2 1 0 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 58700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  1  0  0 -1  1  0  0 -1  1 -1  0  1] (Indices: [0, 2, 4, 6, 7, 9, 10, 11, 13, 14, 15, 17]), Candidate: [ 1  2  0  1  0  2  1 -1  2  1  0  0  2  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  1  0 -1  1  0 -1  0  1  0  0 -1  1] (Indices: [0, 2, 4, 6, 7, 9, 10, 12, 13, 16, 17, 18]), Candidate: [ 1  2  0  1  0  2  1 -1  2  1 -1  2  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  1 -1  1  0  0 -1  1  0  0 -1  0  1] (Indices: [0, 2, 4, 6, 7, 9, 11, 12, 13, 15, 16, 17]), Candidate: [ 1  2  0  1  0  2  1 -1  2  0  1  1  1  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  1 -1  0  1  0  0  0 -1  1 -1  1  0] (Indices: [0, 2, 4, 6, 7, 9, 12, 13, 14, 15, 17, 19]), Candidate: [ 1  2  0  1  0  2  1 -1  2  0  0  2  1  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  0  1  0  0 -1  1 -1  1  0  0 -1  1] (Indices: [0, 2, 4, 6, 7, 10, 11, 12, 14, 16, 17, 18]), Candidate: [ 1  2  0  1  0  2  1 -1  1  2  0  1  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  0  1 -1  1 -1  0  1  0  0  0  0  0] (Indices: [0, 2, 4, 6, 7, 10, 12, 15, 16, 17, 18, 19]), Candidate: [ 1  2  0  1  0  2  1 -1  1  2 -1  2  0  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 59000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1  0  0  0  0  0 -1  1 -1  1 -1  0  1] (Indices: [0, 2, 4, 6, 8, 9, 10, 11, 12, 13, 15, 17]), Candidate: [1 2 0 1 0 2 0 1 1 1 0 1 1 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 59050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1  0  0  0 -1  0  1  0  0 -1  1 -1  1] (Indices: [0, 2, 4, 6, 8, 9, 10, 11, 14, 15, 16, 18]), Candidate: [1 2 0 1 0 2 0 1 1 1 0 0 1 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 59100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1  0  0 -1  0  1  0  0  0 -1  1 -1  1] (Indices: [0, 2, 4, 6, 8, 9, 10, 13, 14, 15, 16, 18]), Candidate: [ 1  2  0  1  0  2  0  1  1  1 -1  1  2  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1  0 -1  1  0 -1  0  1  0  0  0 -1  1] (Indices: [0, 2, 4, 6, 8, 9, 11, 12, 15, 16, 17, 18]), Candidate: [1 2 0 1 0 2 0 1 1 0 1 1 0 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 59200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1  0 -1  0  0  1  0  0 -1  1  0  0  0] (Indices: [0, 2, 4, 6, 8, 9, 13, 14, 15, 17, 18, 19]), Candidate: [1 2 0 1 0 2 0 1 1 0 0 1 2 1 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 59250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1 -1  1  0 -1  1 -1  1  0  0 -1  1  0] (Indices: [0, 2, 4, 6, 8, 10, 11, 13, 15, 16, 17, 19]), Candidate: [1 2 0 1 0 2 0 1 0 2 0 0 2 0 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 59300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1 -1  0  1  0  0 -1  1  0 -1  1  0  0] (Indices: [0, 2, 4, 6, 8, 11, 12, 13, 15, 16, 18, 19]), Candidate: [1 2 0 1 0 2 0 1 0 1 1 1 1 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 59350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  1  0  0  0 -1  1 -1  1  0  0 -1  1] (Indices: [0, 2, 4, 6, 9, 10, 11, 12, 14, 16, 17, 18]), Candidate: [ 1  2  0  1  0  2  0  0  2  1  0  1  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  1  0 -1  1 -1  0  1  0  0  0  0  0] (Indices: [0, 2, 4, 6, 9, 10, 12, 15, 16, 17, 18, 19]), Candidate: [ 1  2  0  1  0  2  0  0  2  1 -1  2  0  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  0  1  0  0  0  0 -1  1  0  0 -1  1] (Indices: [0, 2, 4, 6, 10, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 1  2  0  1  0  2  0  0  1  2  0  1  1  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0  0  0  0  0  0 -1  0  1 -1  0  1  0] (Indices: [0, 2, 4, 7, 8, 9, 10, 11, 12, 13, 16, 19]), Candidate: [1 2 0 1 0 1 2 0 1 1 0 1 1 0 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 59550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0  0  0  0 -1  0  1 -1  1  0  0 -1  1] (Indices: [0, 2, 4, 7, 8, 9, 10, 11, 14, 16, 17, 18]), Candidate: [ 1  2  0  1  0  1  2  0  1  1  0  0  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0  0  0 -1  0  1  0 -1  1  0  0 -1  1] (Indices: [0, 2, 4, 7, 8, 9, 10, 13, 14, 16, 17, 18]), Candidate: [ 1  2  0  1  0  1  2  0  1  1 -1  1  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 59650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0  0 -1  1 -1  1  0  0  0  0 -1  0  1] (Indices: [0, 2, 4, 7, 8, 9, 11, 13, 14, 15, 16, 17]), Candidate: [1 2 0 1 0 1 2 0 1 0 1 0 2 1 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 59700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0 -1  1  0  0  0  0  0 -1  1 -1  0  1] (Indices: [0, 2, 4, 7, 8, 10, 11, 12, 13, 14, 15, 17]), Candidate: [1 2 0 1 0 1 2 0 0 2 0 1 1 1 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 59750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0 -1  1  0 -1  0  1  0  0  0 -1  1  0] (Indices: [0, 2, 4, 7, 8, 10, 11, 14, 15, 16, 17, 19]), Candidate: [1 2 0 1 0 1 2 0 0 2 0 0 1 2 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 59800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0 -1  0  1  0 -1  1  0  0 -1  1  0  0] (Indices: [0, 2, 4, 7, 8, 11, 12, 14, 15, 16, 18, 19]), Candidate: [1 2 0 1 0 1 2 0 0 1 1 1 0 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 59850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  1  0  0  0 -1  0  1  0  0 -1  1  0] (Indices: [0, 2, 4, 7, 9, 10, 11, 12, 15, 16, 17, 19]), Candidate: [ 1  2  0  1  0  1  2 -1  2  1  0  1  0  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  1  0 -1  0  1  0 -1  1  0  0  0  0] (Indices: [0, 2, 4, 7, 9, 10, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  2  0  1  0  1  2 -1  2  1 -1  1  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 59950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  0  1  0  0  0 -1  1  0  0 -1  1  0] (Indices: [0, 2, 4, 7, 10, 11, 12, 13, 15, 16, 17, 19]), Candidate: [ 1  2  0  1  0  1  2 -1  1  2  0  1  1  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1  0  0  0  0  0 -1  0  1  0  0 -1  1] (Indices: [0, 2, 4, 8, 9, 10, 11, 12, 13, 16, 17, 18]), Candidate: [1 2 0 1 0 1 1 1 1 1 0 1 1 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 60050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1  0  0 -1  1  0 -1  1  0  0  0 -1  1] (Indices: [0, 2, 4, 8, 9, 10, 12, 13, 15, 16, 17, 18]), Candidate: [ 1  2  0  1  0  1  1  1  1  1 -1  2  1  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1  0 -1  0  1  0  0 -1  1  0  0  0  0] (Indices: [0, 2, 4, 8, 9, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  2  0  1  0  1  1  1  1  0  0  2  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  1  0  0  0  0  0  0  0 -1  1 -1  1] (Indices: [0, 2, 4, 9, 10, 11, 12, 13, 14, 15, 16, 18]), Candidate: [1 2 0 1 0 1 1 0 2 1 0 1 1 1 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 60200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  0  0  1  0  0 -1  1  0  0  0  0  0  0] (Indices: [0, 2, 4, 10, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [1 2 0 1 0 1 1 0 1 2 0 1 0 2 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 60250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0  0  0  0 -1  0  0  1  0  0 -1  0  1] (Indices: [0, 2, 5, 6, 7, 8, 9, 10, 11, 15, 16, 17]), Candidate: [1 2 0 0 2 1 1 0 1 1 0 0 1 1 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 60300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0  0  0 -1  0  1  0 -1  1 -1  1 -1  1] (Indices: [0, 2, 5, 6, 7, 8, 9, 10, 13, 14, 16, 18]), Candidate: [ 1  2  0  0  2  1  1  0  1  1 -1  1  2  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 60350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0  0 -1  1  0 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 2, 5, 6, 7, 8, 9, 11, 12, 14, 16, 18]), Candidate: [ 1  2  0  0  2  1  1  0  1  0  1  1  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0  0 -1  0  1  0  0  0  0 -1  0  0  1] (Indices: [0, 2, 5, 6, 7, 8, 9, 12, 13, 14, 15, 16]), Candidate: [1 2 0 0 2 1 1 0 1 0 0 2 1 1 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 60450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0  0 -1  0  0  0  1  0  0  0  0 -1  1] (Indices: [0, 2, 5, 6, 7, 8, 9, 14, 15, 16, 17, 18]), Candidate: [1 2 0 0 2 1 1 0 1 0 0 1 1 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 60500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0 -1  1  0 -1  1  0 -1  0  0  1  0  0] (Indices: [0, 2, 5, 6, 7, 8, 10, 11, 13, 14, 18, 19]), Candidate: [ 1  2  0  0  2  1  1  0  0  2  0  0  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0 -1  1 -1  1 -1  1  0 -1  1 -1  1  0] (Indices: [0, 2, 5, 6, 7, 8, 10, 12, 14, 15, 17, 19]), Candidate: [ 1  2  0  0  2  1  1  0  0  2 -1  2  0  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0 -1  0  1  0  0 -1  0  1 -1  1  0  0] (Indices: [0, 2, 5, 6, 7, 8, 11, 12, 13, 16, 18, 19]), Candidate: [1 2 0 0 2 1 1 0 0 1 1 1 1 0 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 60650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0 -1  0  0  1  0 -1  1  0 -1  1  0  0] (Indices: [0, 2, 5, 6, 7, 8, 12, 13, 15, 16, 18, 19]), Candidate: [1 2 0 0 2 1 1 0 0 1 0 2 1 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 60700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  1  0  0  0 -1  0  0  0  1  0  0  0] (Indices: [0, 2, 5, 6, 7, 9, 10, 11, 12, 17, 18, 19]), Candidate: [ 1  2  0  0  2  1  1 -1  2  1  0  1  0  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  1  0 -1  1  0 -1  1 -1  1 -1  1  0] (Indices: [0, 2, 5, 6, 7, 9, 10, 12, 13, 15, 17, 19]), Candidate: [ 1  2  0  0  2  1  1 -1  2  1 -1  2  1  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 60800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  1 -1  1  0  0  0 -1  0  1 -1  1  0] (Indices: [0, 2, 5, 6, 7, 9, 11, 12, 13, 14, 17, 19]), Candidate: [ 1  2  0  0  2  1  1 -1  2  0  1  1  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 60850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  1 -1  0  1  0  0  0  0 -1  0  1  0] (Indices: [0, 2, 5, 6, 7, 9, 12, 13, 14, 15, 16, 19]), Candidate: [ 1  2  0  0  2  1  1 -1  2  0  0  2  1  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  0  1  0  0 -1  1  0 -1  1 -1  1  0] (Indices: [0, 2, 5, 6, 7, 10, 11, 12, 14, 15, 17, 19]), Candidate: [ 1  2  0  0  2  1  1 -1  1  2  0  1  0  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  0  1 -1  1 -1  1  0 -1  1  0  0  0] (Indices: [0, 2, 5, 6, 7, 10, 12, 14, 15, 17, 18, 19]), Candidate: [ 1  2  0  0  2  1  1 -1  1  2 -1  2  0  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 61000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1  0  0  0  0  0  0 -1  0  0  0  1  0] (Indices: [0, 2, 5, 6, 8, 9, 10, 11, 12, 13, 14, 19]), Candidate: [ 1  2  0  0  2  1  0  1  1  1  0  1  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1  0  0  0 -1  1 -1  0  0  1  0  0  0] (Indices: [0, 2, 5, 6, 8, 9, 10, 11, 13, 17, 18, 19]), Candidate: [1 2 0 0 2 1 0 1 1 1 0 0 2 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 61100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1  0  0 -1  1 -1  0  0  1  0  0  0  0] (Indices: [0, 2, 5, 6, 8, 9, 10, 12, 16, 17, 18, 19]), Candidate: [ 1  2  0  0  2  1  0  1  1  1 -1  2  0  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1  0 -1  1  0 -1  1 -1  1 -1  1  0  0] (Indices: [0, 2, 5, 6, 8, 9, 11, 12, 14, 16, 18, 19]), Candidate: [ 1  2  0  0  2  1  0  1  1  0  1  1  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1  0 -1  0  0  1  0  0  0  0 -1  1  0] (Indices: [0, 2, 5, 6, 8, 9, 13, 14, 15, 16, 17, 19]), Candidate: [1 2 0 0 2 1 0 1 1 0 0 1 2 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 61250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1 -1  1  0 -1  1  0 -1  0  1  0  0  0] (Indices: [0, 2, 5, 6, 8, 10, 11, 13, 14, 17, 18, 19]), Candidate: [ 1  2  0  0  2  1  0  1  0  2  0  0  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1 -1  0  1  0  0 -1  1  0  0  0 -1  1] (Indices: [0, 2, 5, 6, 8, 11, 12, 13, 15, 16, 17, 18]), Candidate: [1 2 0 0 2 1 0 1 0 1 1 1 1 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 61350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  1  0  0  0 -1  1  0 -1  1 -1  1  0] (Indices: [0, 2, 5, 6, 9, 10, 11, 12, 14, 15, 17, 19]), Candidate: [1 2 0 0 2 1 0 0 2 1 0 1 0 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 61400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  1  0 -1  1 -1  1  0 -1  1  0  0  0] (Indices: [0, 2, 5, 6, 9, 10, 12, 14, 15, 17, 18, 19]), Candidate: [ 1  2  0  0  2  1  0  0  2  1 -1  2  0  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  0  1  0  0  0  0  0 -1  1 -1  1  0] (Indices: [0, 2, 5, 6, 10, 11, 12, 13, 14, 15, 17, 19]), Candidate: [1 2 0 0 2 1 0 0 1 2 0 1 1 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 61500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0  0  0  0  0  0 -1  0  1  0 -1  0  1] (Indices: [0, 2, 5, 7, 8, 9, 10, 11, 12, 13, 16, 17]), Candidate: [1 2 0 0 2 0 2 0 1 1 0 1 1 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 61550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0  0  0  0 -1  0  1  0 -1  1 -1  1  0] (Indices: [0, 2, 5, 7, 8, 9, 10, 11, 14, 15, 17, 19]), Candidate: [1 2 0 0 2 0 2 0 1 1 0 0 1 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 61600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0  0  0 -1  0  1  0  0 -1  1 -1  1  0] (Indices: [0, 2, 5, 7, 8, 9, 10, 13, 14, 15, 17, 19]), Candidate: [ 1  2  0  0  2  0  2  0  1  1 -1  1  2  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0  0 -1  1  0 -1  0  1 -1  1  0  0  0] (Indices: [0, 2, 5, 7, 8, 9, 11, 12, 15, 17, 18, 19]), Candidate: [1 2 0 0 2 0 2 0 1 0 1 1 0 1 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 61700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0  0 -1  0  0  0  1  0  0  0  0  0  0] (Indices: [0, 2, 5, 7, 8, 9, 14, 15, 16, 17, 18, 19]), Candidate: [1 2 0 0 2 0 2 0 1 0 0 1 1 2 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 61750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0 -1  1  0 -1  1 -1  0  1  0  0  0  0] (Indices: [0, 2, 5, 7, 8, 10, 11, 13, 16, 17, 18, 19]), Candidate: [1 2 0 0 2 0 2 0 0 2 0 0 2 0 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 61800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0 -1  0  1  0 -1  1  0  0  0  0 -1  1] (Indices: [0, 2, 5, 7, 8, 11, 12, 14, 15, 16, 17, 18]), Candidate: [1 2 0 0 2 0 2 0 0 1 1 1 0 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 61850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  1  0  0  0 -1  1 -1  0  1  0  0  0] (Indices: [0, 2, 5, 7, 9, 10, 11, 12, 14, 17, 18, 19]), Candidate: [ 1  2  0  0  2  0  2 -1  2  1  0  1  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 61900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  1  0 -1  0  1  0  0  0 -1  1  0  0] (Indices: [0, 2, 5, 7, 9, 10, 13, 14, 15, 16, 18, 19]), Candidate: [ 1  2  0  0  2  0  2 -1  2  1 -1  1  2  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 61950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  0  1  0  0  0  0 -1  0  1  0  0  0] (Indices: [0, 2, 5, 7, 10, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 1  2  0  0  2  0  2 -1  1  2  0  1  1  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 62000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1  0  0  0  0  0 -1  1 -1  1 -1  1  0] (Indices: [0, 2, 5, 8, 9, 10, 11, 12, 13, 15, 17, 19]), Candidate: [1 2 0 0 2 0 1 1 1 1 0 1 1 0 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 62050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1  0  0 -1  1  0  0 -1  1 -1  1  0  0] (Indices: [0, 2, 5, 8, 9, 10, 12, 13, 14, 16, 18, 19]), Candidate: [ 1  2  0  0  2  0  1  1  1  1 -1  2  1  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 62100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1  0 -1  0  1  0  0  0  0 -1  1  0  0] (Indices: [0, 2, 5, 8, 9, 12, 13, 14, 15, 16, 18, 19]), Candidate: [1 2 0 0 2 0 1 1 1 0 0 2 1 1 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 62150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1 -1  0  0  1  0  0  0  0  0  0  0  0] (Indices: [0, 2, 5, 8, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [1 2 0 0 2 0 1 1 0 1 0 2 1 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 62200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  0  0  1  0  0  0  0 -1  1  0  0  0  0] (Indices: [0, 2, 5, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  2  0  0  2  0  1  0  1  2  0  1  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0  0  0  0 -1  1  0 -1  0  0  1  0  0] (Indices: [0, 2, 6, 7, 8, 9, 10, 11, 13, 14, 18, 19]), Candidate: [ 1  2  0  0  1  2  1  0  1  1  0  0  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0  0  0 -1  1 -1  1  0 -1  1 -1  1  0] (Indices: [0, 2, 6, 7, 8, 9, 10, 12, 14, 15, 17, 19]), Candidate: [ 1  2  0  0  1  2  1  0  1  1 -1  2  0  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0  0 -1  1  0  0 -1  0  1 -1  1  0  0] (Indices: [0, 2, 6, 7, 8, 9, 11, 12, 13, 16, 18, 19]), Candidate: [1 2 0 0 1 2 1 0 1 0 1 1 1 0 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 62400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0  0 -1  0  1  0 -1  1  0 -1  1  0  0] (Indices: [0, 2, 6, 7, 8, 9, 12, 13, 15, 16, 18, 19]), Candidate: [1 2 0 0 1 2 1 0 1 0 0 2 1 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 62450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0 -1  1  0  0 -1  0  0  1  0  0  0  0] (Indices: [0, 2, 6, 7, 8, 10, 11, 12, 16, 17, 18, 19]), Candidate: [1 2 0 0 1 2 1 0 0 2 0 1 0 1 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 62500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0 -1  0  1  0  0  0  0  0  0 -1  0  1] (Indices: [0, 2, 6, 7, 8, 11, 12, 13, 14, 15, 16, 17]), Candidate: [1 2 0 0 1 2 1 0 0 1 1 1 1 1 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 62550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  1  0  0  0  0 -1  1 -1  1 -1  1  0] (Indices: [0, 2, 6, 7, 9, 10, 11, 12, 13, 15, 17, 19]), Candidate: [ 1  2  0  0  1  2  1 -1  2  1  0  1  1  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  1  0 -1  1  0  0 -1  1 -1  1  0  0] (Indices: [0, 2, 6, 7, 9, 10, 12, 13, 14, 16, 18, 19]), Candidate: [ 1  2  0  0  1  2  1 -1  2  1 -1  2  1  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 62650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  1 -1  0  1  0  0  0  0 -1  1  0  0] (Indices: [0, 2, 6, 7, 9, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 1  2  0  0  1  2  1 -1  2  0  0  2  1  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  0  0  0  1  0  0  0  0  0  0  0  0] (Indices: [0, 2, 6, 7, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  2  0  0  1  2  1 -1  1  1  0  2  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1  0  0  0 -1  1 -1  0  1  0  0  0  0] (Indices: [0, 2, 6, 8, 9, 10, 11, 13, 16, 17, 18, 19]), Candidate: [1 2 0 0 1 2 0 1 1 1 0 0 2 0 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 62800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1  0 -1  1  0 -1  1  0  0  0  0 -1  1] (Indices: [0, 2, 6, 8, 9, 11, 12, 14, 15, 16, 17, 18]), Candidate: [1 2 0 0 1 2 0 1 1 0 1 1 0 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 62850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1 -1  1 -1  1  0  0  0  0  0 -1  1  0] (Indices: [0, 2, 6, 8, 10, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 1  2  0  0  1  2  0  1  0  2 -1  2  1  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  0  1  0 -1  1 -1  1  0  0  0  0  0  0] (Indices: [0, 2, 6, 9, 10, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  2  0  0  1  2  0  0  2  1 -1  2  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0  0  0  0  0 -1  1 -1  0  1  0  0  0] (Indices: [0, 2, 7, 8, 9, 10, 11, 12, 14, 17, 18, 19]), Candidate: [ 1  2  0  0  1  1  2  0  1  1  0  1  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0  0  0 -1  0  1  0  0  0 -1  1  0  0] (Indices: [0, 2, 7, 8, 9, 10, 13, 14, 15, 16, 18, 19]), Candidate: [ 1  2  0  0  1  1  2  0  1  1 -1  1  2  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0 -1  1  0  0  0  0 -1  0  1  0  0  0] (Indices: [0, 2, 7, 8, 10, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 1  2  0  0  1  1  2  0  0  2  0  1  1  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1 -1  1  0  0  0  0 -1  0  1  0  0  0  0] (Indices: [0, 2, 7, 9, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [ 1  2  0  0  1  1  2 -1  2  1  0  1  1  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  1  0  0  0  0  0  0 -1  0  1  0  0  0] (Indices: [0, 2, 8, 9, 10, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 1  2  0  0  1  1  1  1  1  1  0  1  1  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  1  0  0  0  0  0 -1  1  0  0  0  0] (Indices: [0, 2, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  2  0  0  1  1  1  0  2  1  0  1  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0  0  0 -1  1 -1  0  0  1  0 -1  0  1] (Indices: [0, 3, 4, 5, 6, 7, 8, 9, 10, 12, 16, 17]), Candidate: [ 1  1  2  0  1  1  1  0  1  1 -1  2  0  1  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0  0 -1  1  0 -1  1 -1  0  0  1 -1  1] (Indices: [0, 3, 4, 5, 6, 7, 8, 9, 11, 12, 14, 18]), Candidate: [ 1  1  2  0  1  1  1  0  1  0  1  1  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0  0 -1  0  1  0  0 -1  0  0  1 -1  1] (Indices: [0, 3, 4, 5, 6, 7, 8, 9, 12, 13, 14, 18]), Candidate: [ 1  1  2  0  1  1  1  0  1  0  0  2  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0  0 -1  0  0  1 -1  0  1 -1  1  0  0] (Indices: [0, 3, 4, 5, 6, 7, 8, 9, 13, 16, 18, 19]), Candidate: [1 1 2 0 1 1 1 0 1 0 0 1 2 0 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 63450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0 -1  1  0 -1  1 -1  0  0  1  0 -1  1] (Indices: [0, 3, 4, 5, 6, 7, 8, 10, 11, 13, 17, 18]), Candidate: [1 1 2 0 1 1 1 0 0 2 0 0 2 0 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 63500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0 -1  1 -1  1 -1  0  1  0 -1  0  1  0] (Indices: [0, 3, 4, 5, 6, 7, 8, 10, 12, 15, 16, 19]), Candidate: [ 1  1  2  0  1  1  1  0  0  2 -1  2  0  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0 -1  0  1  0  0 -1  1 -1  0  1 -1  1] (Indices: [0, 3, 4, 5, 6, 7, 8, 11, 12, 13, 15, 18]), Candidate: [1 1 2 0 1 1 1 0 0 1 1 1 1 0 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 63600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0 -1  0  1 -1  0  1  0  0 -1  0  1  0] (Indices: [0, 3, 4, 5, 6, 7, 8, 11, 14, 15, 16, 19]), Candidate: [1 1 2 0 1 1 1 0 0 1 1 0 1 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 63650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0 -1  0  0  0  1  0  0  0 -1  0  1  0] (Indices: [0, 3, 4, 5, 6, 7, 8, 13, 14, 15, 16, 19]), Candidate: [1 1 2 0 1 1 1 0 0 1 0 1 2 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 63700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  1  0  0 -1  1 -1  0  1 -1  1 -1  1] (Indices: [0, 3, 4, 5, 6, 7, 9, 10, 11, 13, 16, 18]), Candidate: [ 1  1  2  0  1  1  1 -1  2  1  0  0  2  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  1  0 -1  1 -1  0  1  0  0 -1  0  1] (Indices: [0, 3, 4, 5, 6, 7, 9, 10, 12, 15, 16, 17]), Candidate: [ 1  1  2  0  1  1  1 -1  2  1 -1  2  0  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 63800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  1 -1  1  0  0 -1  1  0 -1  0  0  1] (Indices: [0, 3, 4, 5, 6, 7, 9, 11, 12, 13, 15, 16]), Candidate: [ 1  1  2  0  1  1  1 -1  2  0  1  1  1  0  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  1 -1  1 -1  0  1  0  0  0 -1  0  1] (Indices: [0, 3, 4, 5, 6, 7, 9, 11, 14, 15, 16, 17]), Candidate: [ 1  1  2  0  1  1  1 -1  2  0  1  0  1  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  1 -1  0  0  1  0  0  0  0 -1  0  1] (Indices: [0, 3, 4, 5, 6, 7, 9, 13, 14, 15, 16, 17]), Candidate: [ 1  1  2  0  1  1  1 -1  2  0  0  1  2  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  0  1  0  0 -1  0  1 -1  1 -1  1  0] (Indices: [0, 3, 4, 5, 6, 7, 10, 11, 12, 15, 17, 19]), Candidate: [ 1  1  2  0  1  1  1 -1  1  2  0  1  0  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  0  1 -1  1  0  0 -1  0  0  1  0  0] (Indices: [0, 3, 4, 5, 6, 7, 10, 12, 13, 14, 18, 19]), Candidate: [ 1  1  2  0  1  1  1 -1  1  2 -1  2  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 64050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  0  0  1  0  0  0  0 -1  0  0  1  0] (Indices: [0, 3, 4, 5, 6, 7, 11, 12, 13, 14, 15, 19]), Candidate: [ 1  1  2  0  1  1  1 -1  1  1  1  1  1  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  0  0  1 -1  0  1  0 -1  1  0  0  0] (Indices: [0, 3, 4, 5, 6, 7, 11, 14, 15, 17, 18, 19]), Candidate: [ 1  1  2  0  1  1  1 -1  1  1  1  0  1  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1  0  0  0  0 -1  0  0  0  1 -1  1  0] (Indices: [0, 3, 4, 5, 6, 8, 9, 10, 11, 12, 17, 19]), Candidate: [1 1 2 0 1 1 0 1 1 1 0 1 0 1 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 64200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1  0  0 -1  1  0 -1  0  0  1 -1  1  0] (Indices: [0, 3, 4, 5, 6, 8, 9, 10, 12, 13, 17, 19]), Candidate: [ 1  1  2  0  1  1  0  1  1  1 -1  2  1  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1  0  0 -1  0  0  1 -1  1 -1  1  0  0] (Indices: [0, 3, 4, 5, 6, 8, 9, 10, 14, 16, 18, 19]), Candidate: [ 1  1  2  0  1  1  0  1  1  1 -1  1  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 64300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1  0 -1  1 -1  1  0 -1  0  1 -1  1  0] (Indices: [0, 3, 4, 5, 6, 8, 9, 11, 13, 14, 17, 19]), Candidate: [ 1  1  2  0  1  1  0  1  1  0  1  0  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1  0 -1  0  1 -1  1  0 -1  1  0 -1  1] (Indices: [0, 3, 4, 5, 6, 8, 9, 12, 14, 15, 17, 18]), Candidate: [1 1 2 0 1 1 0 1 1 0 0 2 0 2 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 64400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1 -1  1  0  0 -1  1  0 -1  0  1 -1  1] (Indices: [0, 3, 4, 5, 6, 8, 10, 11, 12, 14, 15, 18]), Candidate: [1 1 2 0 1 1 0 1 0 2 0 1 0 2 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 64450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1 -1  1  0 -1  0  0  1  0 -1  1  0  0] (Indices: [0, 3, 4, 5, 6, 8, 10, 11, 15, 16, 18, 19]), Candidate: [1 1 2 0 1 1 0 1 0 2 0 0 1 1 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 64500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1 -1  1 -1  0  1 -1  1  0 -1  1  0  0] (Indices: [0, 3, 4, 5, 6, 8, 10, 13, 15, 16, 18, 19]), Candidate: [ 1  1  2  0  1  1  0  1  0  2 -1  1  2  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1 -1  0  1 -1  1  0 -1  1  0  0 -1  1] (Indices: [0, 3, 4, 5, 6, 8, 11, 13, 14, 16, 17, 18]), Candidate: [ 1  1  2  0  1  1  0  1  0  1  1  0  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  1  0  0  0  0 -1  1 -1  0  1 -1  1] (Indices: [0, 3, 4, 5, 6, 9, 10, 11, 12, 13, 15, 18]), Candidate: [1 1 2 0 1 1 0 0 2 1 0 1 1 0 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 64650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  1  0  0 -1  0  1  0  0 -1  0  1  0] (Indices: [0, 3, 4, 5, 6, 9, 10, 11, 14, 15, 16, 19]), Candidate: [1 1 2 0 1 1 0 0 2 1 0 0 1 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 64700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  1  0 -1  0  1  0  0  0 -1  0  1  0] (Indices: [0, 3, 4, 5, 6, 9, 10, 13, 14, 15, 16, 19]), Candidate: [ 1  1  2  0  1  1  0  0  2  1 -1  1  2  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  1 -1  1  0 -1  0  1  0  0 -1  1  0] (Indices: [0, 3, 4, 5, 6, 9, 11, 12, 15, 16, 17, 19]), Candidate: [1 1 2 0 1 1 0 0 2 0 1 1 0 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 64800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  1 -1  0  0  1  0 -1  1  0  0  0  0] (Indices: [0, 3, 4, 5, 6, 9, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  1  2  0  1  1  0  0  2  0  0  1  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  0  1  0 -1  1 -1  1  0 -1  1  0  0] (Indices: [0, 3, 4, 5, 6, 10, 11, 13, 15, 16, 18, 19]), Candidate: [1 1 2 0 1 1 0 0 1 2 0 0 2 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 64900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  0  0  1  0  0 -1  1 -1  1  0  0  0] (Indices: [0, 3, 4, 5, 6, 11, 12, 13, 15, 17, 18, 19]), Candidate: [1 1 2 0 1 1 0 0 1 1 1 1 1 0 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 64950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0  0  0  0 -1  1 -1  1 -1  1 -1  0  1] (Indices: [0, 3, 4, 5, 7, 8, 9, 10, 11, 13, 15, 17]), Candidate: [1 1 2 0 1 0 2 0 1 1 0 0 2 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 65000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0  0  0 -1  1 -1  1 -1  1 -1  0  1  0] (Indices: [0, 3, 4, 5, 7, 8, 9, 10, 12, 14, 16, 19]), Candidate: [ 1  1  2  0  1  0  2  0  1  1 -1  2  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 65050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0  0 -1  1  0  0  0 -1  1 -1  0  0  1] (Indices: [0, 3, 4, 5, 7, 8, 9, 11, 12, 13, 14, 16]), Candidate: [ 1  1  2  0  1  0  2  0  1  0  1  1  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0  0 -1  1 -1  1 -1  0  1  0  0 -1  1] (Indices: [0, 3, 4, 5, 7, 8, 9, 11, 13, 16, 17, 18]), Candidate: [1 1 2 0 1 0 2 0 1 0 1 0 2 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 65150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0  0 -1  0  1 -1  0  1  0  0 -1  1  0] (Indices: [0, 3, 4, 5, 7, 8, 9, 12, 15, 16, 17, 19]), Candidate: [1 1 2 0 1 0 2 0 1 0 0 2 0 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 65200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0 -1  1  0  0 -1  0  1  0  0 -1  0  1] (Indices: [0, 3, 4, 5, 7, 8, 10, 11, 12, 15, 16, 17]), Candidate: [1 1 2 0 1 0 2 0 0 2 0 1 0 1 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 65250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0 -1  1 -1  1  0  0 -1  1 -1  1 -1  1] (Indices: [0, 3, 4, 5, 7, 8, 10, 12, 13, 14, 16, 18]), Candidate: [ 1  1  2  0  1  0  2  0  0  2 -1  2  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 65300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0 -1  1 -1  0  0  0  1  0  0  0  0  0] (Indices: [0, 3, 4, 5, 7, 8, 10, 15, 16, 17, 18, 19]), Candidate: [ 1  1  2  0  1  0  2  0  0  2 -1  1  1  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0 -1  0  1 -1  1 -1  0  1  0  0  0  0] (Indices: [0, 3, 4, 5, 7, 8, 11, 13, 16, 17, 18, 19]), Candidate: [1 1 2 0 1 0 2 0 0 1 1 0 2 0 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 65400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  1  0  0  0 -1  1  0  0 -1  0  0  1] (Indices: [0, 3, 4, 5, 7, 9, 10, 11, 12, 14, 15, 16]), Candidate: [ 1  1  2  0  1  0  2 -1  2  1  0  1  0  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  1  0  0 -1  0  0  1  0  0  0 -1  1] (Indices: [0, 3, 4, 5, 7, 9, 10, 11, 15, 16, 17, 18]), Candidate: [ 1  1  2  0  1  0  2 -1  2  1  0  0  1  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  1  0 -1  0  1 -1  1  0  0  0 -1  1] (Indices: [0, 3, 4, 5, 7, 9, 10, 13, 15, 16, 17, 18]), Candidate: [ 1  1  2  0  1  0  2 -1  2  1 -1  1  2  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 65550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  1 -1  1 -1  1  0  0 -1  1 -1  1  0] (Indices: [0, 3, 4, 5, 7, 9, 11, 13, 14, 15, 17, 19]), Candidate: [ 1  1  2  0  1  0  2 -1  2  0  1  0  2  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  0  1  0  0  0  0 -1  1 -1  1 -1  1] (Indices: [0, 3, 4, 5, 7, 10, 11, 12, 13, 14, 16, 18]), Candidate: [ 1  1  2  0  1  0  2 -1  1  2  0  1  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 65650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  0  1  0 -1  0  0  1  0  0  0  0  0] (Indices: [0, 3, 4, 5, 7, 10, 11, 15, 16, 17, 18, 19]), Candidate: [ 1  1  2  0  1  0  2 -1  1  2  0  0  1  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  0  0  1 -1  1  0  0  0  0  0 -1  1] (Indices: [0, 3, 4, 5, 7, 11, 13, 14, 15, 16, 17, 18]), Candidate: [ 1  1  2  0  1  0  2 -1  1  1  1  0  2  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1  0  0  0 -1  1  0  0  0 -1  0  0  1] (Indices: [0, 3, 4, 5, 8, 9, 10, 11, 13, 14, 15, 16]), Candidate: [1 1 2 0 1 0 1 1 1 1 0 0 2 1 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 65800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1  0  0 -1  1  0 -1  1 -1  0  1  0  0] (Indices: [0, 3, 4, 5, 8, 9, 10, 12, 13, 15, 18, 19]), Candidate: [ 1  1  2  0  1  0  1  1  1  1 -1  2  1  0  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1  0 -1  1  0  0  0 -1  0  0  1  0  0] (Indices: [0, 3, 4, 5, 8, 9, 11, 12, 13, 14, 18, 19]), Candidate: [ 1  1  2  0  1  0  1  1  1  0  1  1  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1  0 -1  0  1  0  0  0 -1  1  0 -1  1] (Indices: [0, 3, 4, 5, 8, 9, 12, 13, 14, 15, 17, 18]), Candidate: [1 1 2 0 1 0 1 1 1 0 0 2 1 1 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 65950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1 -1  1  0  0 -1  1  0 -1  0  1  0  0] (Indices: [0, 3, 4, 5, 8, 10, 11, 12, 14, 15, 18, 19]), Candidate: [1 1 2 0 1 0 1 1 0 2 0 1 0 2 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 66000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1 -1  1 -1  1 -1  1 -1  1  0  0  0  0] (Indices: [0, 3, 4, 5, 8, 10, 12, 14, 16, 17, 18, 19]), Candidate: [ 1  1  2  0  1  0  1  1  0  2 -1  2  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 66050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  1  0  0  0  0  0 -1  1 -1  1 -1  1] (Indices: [0, 3, 4, 5, 9, 10, 11, 12, 13, 14, 16, 18]), Candidate: [ 1  1  2  0  1  0  1  0  2  1  0  1  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  1  0  0 -1  0  0  1  0  0  0  0  0] (Indices: [0, 3, 4, 5, 9, 10, 11, 15, 16, 17, 18, 19]), Candidate: [1 1 2 0 1 0 1 0 2 1 0 0 1 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 66150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  1 -1  1 -1  1  0  0  0  0  0 -1  1] (Indices: [0, 3, 4, 5, 9, 11, 13, 14, 15, 16, 17, 18]), Candidate: [1 1 2 0 1 0 1 0 2 0 1 0 2 1 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 66200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  0  1 -1  0  1  0  0  0  0  0  0  0] (Indices: [0, 3, 4, 5, 10, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  1  2  0  1  0  1  0  1  2 -1  1  2  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0  0  0  0 -1  0  1 -1  1  0 -1  0  1] (Indices: [0, 3, 4, 6, 7, 8, 9, 10, 11, 14, 16, 17]), Candidate: [ 1  1  2  0  0  2  1  0  1  1  0  0  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0  0  0 -1  1 -1  0  0  0  1  0  0  0] (Indices: [0, 3, 4, 6, 7, 8, 9, 10, 12, 17, 18, 19]), Candidate: [ 1  1  2  0  0  2  1  0  1  1 -1  2  0  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0  0 -1  1  0  0 -1  0  0  0  1  0  0] (Indices: [0, 3, 4, 6, 7, 8, 9, 11, 12, 13, 18, 19]), Candidate: [1 1 2 0 0 2 1 0 1 0 1 1 1 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 66400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0  0 -1  1 -1  0  1 -1  0  1  0  0  0] (Indices: [0, 3, 4, 6, 7, 8, 9, 11, 14, 17, 18, 19]), Candidate: [ 1  1  2  0  0  2  1  0  1  0  1  0  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0  0 -1  0  0  1  0 -1  0  1  0  0  0] (Indices: [0, 3, 4, 6, 7, 8, 9, 13, 14, 17, 18, 19]), Candidate: [ 1  1  2  0  0  2  1  0  1  0  0  1  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0 -1  1  0 -1  1  0  0 -1  0  0  1  0] (Indices: [0, 3, 4, 6, 7, 8, 10, 11, 13, 14, 15, 19]), Candidate: [1 1 2 0 0 2 1 0 0 2 0 0 2 1 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 66550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0 -1  1 -1  1  0 -1  0  1 -1  1  0  0] (Indices: [0, 3, 4, 6, 7, 8, 10, 12, 13, 16, 18, 19]), Candidate: [ 1  1  2  0  0  2  1  0  0  2 -1  2  1  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0 -1  0  1  0  0 -1  1  0 -1  0  1  0] (Indices: [0, 3, 4, 6, 7, 8, 11, 12, 13, 15, 16, 19]), Candidate: [1 1 2 0 0 2 1 0 0 1 1 1 1 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 66650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0 -1  0  0  1  0  0 -1  1  0  0 -1  1] (Indices: [0, 3, 4, 6, 7, 8, 12, 13, 14, 16, 17, 18]), Candidate: [ 1  1  2  0  0  2  1  0  0  1  0  2  1  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  1  0  0  0 -1  0  1 -1  1  0 -1  1] (Indices: [0, 3, 4, 6, 7, 9, 10, 11, 12, 15, 17, 18]), Candidate: [ 1  1  2  0  0  2  1 -1  2  1  0  1  0  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  1  0 -1  1  0  0 -1  0  1 -1  1  0] (Indices: [0, 3, 4, 6, 7, 9, 10, 12, 13, 14, 17, 19]), Candidate: [ 1  1  2  0  0  2  1 -1  2  1 -1  2  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 66800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  1 -1  1  0  0  0  0 -1  0  1 -1  1] (Indices: [0, 3, 4, 6, 7, 9, 11, 12, 13, 14, 15, 18]), Candidate: [ 1  1  2  0  0  2  1 -1  2  0  1  1  1  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  1 -1  1 -1  0  1  0  0 -1  1  0  0] (Indices: [0, 3, 4, 6, 7, 9, 11, 14, 15, 16, 18, 19]), Candidate: [ 1  1  2  0  0  2  1 -1  2  0  1  0  1  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  0  1  0  0  0 -1  0  1 -1  1  0  0] (Indices: [0, 3, 4, 6, 7, 10, 11, 12, 13, 16, 18, 19]), Candidate: [ 1  1  2  0  0  2  1 -1  1  2  0  1  1  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  0  1 -1  1  0 -1  1  0 -1  1  0  0] (Indices: [0, 3, 4, 6, 7, 10, 12, 13, 15, 16, 18, 19]), Candidate: [ 1  1  2  0  0  2  1 -1  1  2 -1  2  1  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 67000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  0  0  0  1 -1  1  0  0  0  0  0  0] (Indices: [0, 3, 4, 6, 7, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  1  2  0  0  2  1 -1  1  1  0  2  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1  0  0  0 -1  1 -1  1 -1  1  0 -1  1] (Indices: [0, 3, 4, 6, 8, 9, 10, 11, 13, 15, 17, 18]), Candidate: [1 1 2 0 0 2 0 1 1 1 0 0 2 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 67100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1  0  0 -1  1 -1  1 -1  1 -1  1  0  0] (Indices: [0, 3, 4, 6, 8, 9, 10, 12, 14, 16, 18, 19]), Candidate: [ 1  1  2  0  0  2  0  1  1  1 -1  2  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 67150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1  0 -1  1  0 -1  1  0  0 -1  0  1  0] (Indices: [0, 3, 4, 6, 8, 9, 11, 12, 14, 15, 16, 19]), Candidate: [1 1 2 0 0 2 0 1 1 0 1 1 0 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 67200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1  0 -1  0  1 -1  1  0  0  0 -1  1  0] (Indices: [0, 3, 4, 6, 8, 9, 12, 14, 15, 16, 17, 19]), Candidate: [1 1 2 0 0 2 0 1 1 0 0 2 0 2 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 67250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1 -1  1  0 -1  1  0  0 -1  1  0 -1  1] (Indices: [0, 3, 4, 6, 8, 10, 11, 13, 14, 15, 17, 18]), Candidate: [1 1 2 0 0 2 0 1 0 2 0 0 2 1 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 67300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1 -1  0  1  0  0  0  0 -1  1 -1  1  0] (Indices: [0, 3, 4, 6, 8, 11, 12, 13, 14, 15, 17, 19]), Candidate: [1 1 2 0 0 2 0 1 0 1 1 1 1 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 67350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  1  0  0  0  0 -1  0  1 -1  1  0  0] (Indices: [0, 3, 4, 6, 9, 10, 11, 12, 13, 16, 18, 19]), Candidate: [1 1 2 0 0 2 0 0 2 1 0 1 1 0 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 67400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  1  0 -1  1  0 -1  1  0 -1  1  0  0] (Indices: [0, 3, 4, 6, 9, 10, 12, 13, 15, 16, 18, 19]), Candidate: [ 1  1  2  0  0  2  0  0  2  1 -1  2  1  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  1 -1  0  1 -1  1  0  0  0  0  0  0] (Indices: [0, 3, 4, 6, 9, 12, 14, 15, 16, 17, 18, 19]), Candidate: [1 1 2 0 0 2 0 0 2 0 0 2 0 2 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 67500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0  0  0  0  0  0  0 -1  0  0  1 -1  1] (Indices: [0, 3, 4, 7, 8, 9, 10, 11, 12, 13, 14, 18]), Candidate: [ 1  1  2  0  0  1  2  0  1  1  0  1  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0  0  0  0 -1  1 -1  0  1 -1  1  0  0] (Indices: [0, 3, 4, 7, 8, 9, 10, 11, 13, 16, 18, 19]), Candidate: [1 1 2 0 0 1 2 0 1 1 0 0 2 0 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 67600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0  0  0 -1  1 -1  0  1 -1  1  0  0  0] (Indices: [0, 3, 4, 7, 8, 9, 10, 12, 15, 17, 18, 19]), Candidate: [ 1  1  2  0  0  1  2  0  1  1 -1  2  0  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0  0 -1  1  0 -1  1 -1  1  0 -1  1  0] (Indices: [0, 3, 4, 7, 8, 9, 11, 12, 14, 16, 17, 19]), Candidate: [ 1  1  2  0  0  1  2  0  1  0  1  1  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0  0 -1  0  0  1  0  0  0  0  0 -1  1] (Indices: [0, 3, 4, 7, 8, 9, 13, 14, 15, 16, 17, 18]), Candidate: [1 1 2 0 0 1 2 0 1 0 0 1 2 1 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 67750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0 -1  1  0 -1  1  0 -1  1 -1  1  0  0] (Indices: [0, 3, 4, 7, 8, 10, 11, 13, 14, 16, 18, 19]), Candidate: [ 1  1  2  0  0  1  2  0  0  2  0  0  2  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0 -1  0  1  0  0  0 -1  0  1  0  0  0] (Indices: [0, 3, 4, 7, 8, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 1  1  2  0  0  1  2  0  0  1  1  1  1  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  1  0  0  0 -1  1  0 -1  1  0 -1  1] (Indices: [0, 3, 4, 7, 9, 10, 11, 12, 14, 15, 17, 18]), Candidate: [ 1  1  2  0  0  1  2 -1  2  1  0  1  0  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  1  0 -1  1 -1  1  0  0 -1  1  0  0] (Indices: [0, 3, 4, 7, 9, 10, 12, 14, 15, 16, 18, 19]), Candidate: [ 1  1  2  0  0  1  2 -1  2  1 -1  2  0  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 67950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  0  1  0  0  0  0  0 -1  1  0 -1  1] (Indices: [0, 3, 4, 7, 10, 11, 12, 13, 14, 15, 17, 18]), Candidate: [ 1  1  2  0  0  1  2 -1  1  2  0  1  1  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1  0  0  0  0  0  0 -1  0  1 -1  1  0] (Indices: [0, 3, 4, 8, 9, 10, 11, 12, 13, 14, 17, 19]), Candidate: [ 1  1  2  0  0  1  1  1  1  1  0  1  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1  0  0 -1  1  0  0  0  0 -1  0  1  0] (Indices: [0, 3, 4, 8, 9, 10, 12, 13, 14, 15, 16, 19]), Candidate: [ 1  1  2  0  0  1  1  1  1  1 -1  2  1  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1  0 -1  1 -1  1  0  0 -1  1  0  0  0] (Indices: [0, 3, 4, 8, 9, 11, 13, 14, 15, 17, 18, 19]), Candidate: [1 1 2 0 0 1 1 1 1 0 1 0 2 1 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 68150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1 -1  0  1  0  0  0  0  0 -1  1  0  0] (Indices: [0, 3, 4, 8, 11, 12, 13, 14, 15, 16, 18, 19]), Candidate: [1 1 2 0 0 1 1 1 0 1 1 1 1 1 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 68200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  1 -1  1 -1  1  0  0  0  0  0  0  0] (Indices: [0, 3, 4, 9, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [1 1 2 0 0 1 1 0 2 0 1 0 2 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 68250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0  0  0  0 -1  0  1  0 -1  0  1 -1  1] (Indices: [0, 3, 5, 6, 7, 8, 9, 10, 11, 14, 15, 18]), Candidate: [ 1  1  2 -1  2  1  1  0  1  1  0  0  1  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0  0  0 -1  1 -1  0  0  1  0 -1  1  0] (Indices: [0, 3, 5, 6, 7, 8, 9, 10, 12, 16, 17, 19]), Candidate: [ 1  1  2 -1  2  1  1  0  1  1 -1  2  0  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0  0 -1  1  0  0 -1  0  0  1  0 -1  1] (Indices: [0, 3, 5, 6, 7, 8, 9, 11, 12, 13, 17, 18]), Candidate: [ 1  1  2 -1  2  1  1  0  1  0  1  1  1  0  0  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0  0 -1  1 -1  0  1 -1  1  0 -1  1  0] (Indices: [0, 3, 5, 6, 7, 8, 9, 11, 14, 16, 17, 19]), Candidate: [ 1  1  2 -1  2  1  1  0  1  0  1  0  1  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0  0 -1  0  0  1  0 -1  1  0 -1  1  0] (Indices: [0, 3, 5, 6, 7, 8, 9, 13, 14, 16, 17, 19]), Candidate: [ 1  1  2 -1  2  1  1  0  1  0  0  1  2  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0 -1  1  0 -1  1  0  0 -1  1 -1  0  1] (Indices: [0, 3, 5, 6, 7, 8, 10, 11, 13, 14, 15, 17]), Candidate: [ 1  1  2 -1  2  1  1  0  0  2  0  0  2  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0 -1  1 -1  1  0 -1  0  1  0  0 -1  1] (Indices: [0, 3, 5, 6, 7, 8, 10, 12, 13, 16, 17, 18]), Candidate: [ 1  1  2 -1  2  1  1  0  0  2 -1  2  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0 -1  0  1  0  0 -1  1  0  0 -1  0  1] (Indices: [0, 3, 5, 6, 7, 8, 11, 12, 13, 15, 16, 17]), Candidate: [ 1  1  2 -1  2  1  1  0  0  1  1  1  1  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0 -1  0  0  1  0  0  0 -1  1 -1  1  0] (Indices: [0, 3, 5, 6, 7, 8, 12, 13, 14, 15, 17, 19]), Candidate: [ 1  1  2 -1  2  1  1  0  0  1  0  2  1  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  1  0  0  0 -1  0  1  0 -1  1 -1  1] (Indices: [0, 3, 5, 6, 7, 9, 10, 11, 12, 15, 16, 18]), Candidate: [ 1  1  2 -1  2  1  1 -1  2  1  0  1  0  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  1  0 -1  1  0  0 -1  1 -1  0  1  0] (Indices: [0, 3, 5, 6, 7, 9, 10, 12, 13, 14, 16, 19]), Candidate: [ 1  1  2 -1  2  1  1 -1  2  1 -1  2  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 68800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  1 -1  1  0  0  0  0  0 -1  0  0  1] (Indices: [0, 3, 5, 6, 7, 9, 11, 12, 13, 14, 15, 16]), Candidate: [ 1  1  2 -1  2  1  1 -1  2  0  1  1  1  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  1 -1  1 -1  0  1  0  0  0  0 -1  1] (Indices: [0, 3, 5, 6, 7, 9, 11, 14, 15, 16, 17, 18]), Candidate: [ 1  1  2 -1  2  1  1 -1  2  0  1  0  1  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  0  1  0  0  0 -1  0  1  0  0 -1  1] (Indices: [0, 3, 5, 6, 7, 10, 11, 12, 13, 16, 17, 18]), Candidate: [ 1  1  2 -1  2  1  1 -1  1  2  0  1  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  0  1 -1  1  0 -1  1  0  0  0 -1  1] (Indices: [0, 3, 5, 6, 7, 10, 12, 13, 15, 16, 17, 18]), Candidate: [ 1  1  2 -1  2  1  1 -1  1  2 -1  2  1  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 69000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  0  0  0  1  0  0 -1  1  0  0  0  0] (Indices: [0, 3, 5, 6, 7, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  2  1  1 -1  1  1  0  2  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 69050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1  0  0  0 -1  1 -1  1  0 -1  1 -1  1] (Indices: [0, 3, 5, 6, 8, 9, 10, 11, 13, 15, 16, 18]), Candidate: [ 1  1  2 -1  2  1  0  1  1  1  0  0  2  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1  0  0 -1  1 -1  1 -1  1  0  0 -1  1] (Indices: [0, 3, 5, 6, 8, 9, 10, 12, 14, 16, 17, 18]), Candidate: [ 1  1  2 -1  2  1  0  1  1  1 -1  2  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 69150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1  0 -1  1  0 -1  1  0  0  0 -1  0  1] (Indices: [0, 3, 5, 6, 8, 9, 11, 12, 14, 15, 16, 17]), Candidate: [ 1  1  2 -1  2  1  0  1  1  0  1  1  0  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1  0 -1  0  1  0 -1  0  1  0  0  0  0] (Indices: [0, 3, 5, 6, 8, 9, 12, 13, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  2  1  0  1  1  0  0  2  1  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1 -1  1  0 -1  1  0  0  0 -1  1 -1  1] (Indices: [0, 3, 5, 6, 8, 10, 11, 13, 14, 15, 16, 18]), Candidate: [ 1  1  2 -1  2  1  0  1  0  2  0  0  2  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1 -1  0  1  0  0  0  0  0 -1  0  1  0] (Indices: [0, 3, 5, 6, 8, 11, 12, 13, 14, 15, 16, 19]), Candidate: [ 1  1  2 -1  2  1  0  1  0  1  1  1  1  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  1  0  0  0  0 -1  0  1  0  0 -1  1] (Indices: [0, 3, 5, 6, 9, 10, 11, 12, 13, 16, 17, 18]), Candidate: [ 1  1  2 -1  2  1  0  0  2  1  0  1  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  1  0 -1  1  0 -1  1  0  0  0 -1  1] (Indices: [0, 3, 5, 6, 9, 10, 12, 13, 15, 16, 17, 18]), Candidate: [ 1  1  2 -1  2  1  0  0  2  1 -1  2  1  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 69450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  1 -1  0  1  0  0 -1  1  0  0  0  0] (Indices: [0, 3, 5, 6, 9, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  2  1  0  0  2  0  0  2  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 69500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0  0  0  0  0  0  0 -1  1 -1  0  0  1] (Indices: [0, 3, 5, 7, 8, 9, 10, 11, 12, 13, 14, 16]), Candidate: [ 1  1  2 -1  2  0  2  0  1  1  0  1  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 69550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0  0  0  0 -1  1 -1  0  1  0  0 -1  1] (Indices: [0, 3, 5, 7, 8, 9, 10, 11, 13, 16, 17, 18]), Candidate: [ 1  1  2 -1  2  0  2  0  1  1  0  0  2  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0  0  0 -1  1 -1  0  1  0  0 -1  1  0] (Indices: [0, 3, 5, 7, 8, 9, 10, 12, 15, 16, 17, 19]), Candidate: [ 1  1  2 -1  2  0  2  0  1  1 -1  2  0  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 69650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0  0 -1  1  0 -1  1  0 -1  0  1  0  0] (Indices: [0, 3, 5, 7, 8, 9, 11, 12, 14, 15, 18, 19]), Candidate: [ 1  1  2 -1  2  0  2  0  1  0  1  1  0  2  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0  0 -1  0  1 -1  1 -1  1  0  0  0  0] (Indices: [0, 3, 5, 7, 8, 9, 12, 14, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  2  0  2  0  1  0  0  2  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 69750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0 -1  1  0 -1  1  0 -1  1  0  0 -1  1] (Indices: [0, 3, 5, 7, 8, 10, 11, 13, 14, 16, 17, 18]), Candidate: [ 1  1  2 -1  2  0  2  0  0  2  0  0  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 69800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0 -1  0  1  0  0  0 -1  1  0 -1  1  0] (Indices: [0, 3, 5, 7, 8, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 1  1  2 -1  2  0  2  0  0  1  1  1  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 69850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  1  0  0  0 -1  1  0  0 -1  1 -1  1] (Indices: [0, 3, 5, 7, 9, 10, 11, 12, 14, 15, 16, 18]), Candidate: [ 1  1  2 -1  2  0  2 -1  2  1  0  1  0  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 69900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  1  0 -1  1 -1  1  0  0  0  0 -1  1] (Indices: [0, 3, 5, 7, 9, 10, 12, 14, 15, 16, 17, 18]), Candidate: [ 1  1  2 -1  2  0  2 -1  2  1 -1  2  0  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 69950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  0  1  0  0  0  0  0  0 -1  1 -1  1] (Indices: [0, 3, 5, 7, 10, 11, 12, 13, 14, 15, 16, 18]), Candidate: [ 1  1  2 -1  2  0  2 -1  1  2  0  1  1  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 70000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1  0  0  0  0  0  0 -1  1 -1  0  1  0] (Indices: [0, 3, 5, 8, 9, 10, 11, 12, 13, 14, 16, 19]), Candidate: [ 1  1  2 -1  2  0  1  1  1  1  0  1  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 70050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1  0  0 -1  1  0  0  0  0  0 -1  0  1] (Indices: [0, 3, 5, 8, 9, 10, 12, 13, 14, 15, 16, 17]), Candidate: [ 1  1  2 -1  2  0  1  1  1  1 -1  2  1  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 70100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1  0 -1  1 -1  1  0  0  0  0 -1  1  0] (Indices: [0, 3, 5, 8, 9, 11, 13, 14, 15, 16, 17, 19]), Candidate: [ 1  1  2 -1  2  0  1  1  1  0  1  0  2  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1 -1  0  1  0  0  0  0  0  0  0 -1  1] (Indices: [0, 3, 5, 8, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 1  1  2 -1  2  0  1  1  0  1  1  1  1  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  1 -1  1  0  0 -1  1  0  0  0  0  0] (Indices: [0, 3, 5, 9, 11, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  2  0  1  0  2  0  1  1  1  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0  0  0  0 -1  1  0  0 -1  1 -1  0  1] (Indices: [0, 3, 6, 7, 8, 9, 10, 11, 13, 14, 15, 17]), Candidate: [ 1  1  2 -1  1  2  1  0  1  1  0  0  2  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0  0  0 -1  1  0 -1  0  1  0  0 -1  1] (Indices: [0, 3, 6, 7, 8, 9, 10, 12, 13, 16, 17, 18]), Candidate: [ 1  1  2 -1  1  2  1  0  1  1 -1  2  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 70350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0  0 -1  1  0  0 -1  1  0  0 -1  0  1] (Indices: [0, 3, 6, 7, 8, 9, 11, 12, 13, 15, 16, 17]), Candidate: [ 1  1  2 -1  1  2  1  0  1  0  1  1  1  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0  0 -1  0  1  0  0  0 -1  1 -1  1  0] (Indices: [0, 3, 6, 7, 8, 9, 12, 13, 14, 15, 17, 19]), Candidate: [ 1  1  2 -1  1  2  1  0  1  0  0  2  1  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0 -1  1  0  0 -1  1 -1  1  0  0 -1  1] (Indices: [0, 3, 6, 7, 8, 10, 11, 12, 14, 16, 17, 18]), Candidate: [ 1  1  2 -1  1  2  1  0  0  2  0  1  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 70500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0 -1  1 -1  1 -1  0  1  0  0  0  0  0] (Indices: [0, 3, 6, 7, 8, 10, 12, 15, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  2  1  0  0  2 -1  2  0  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 70550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  1  0  0  0  0  0 -1  1 -1  0  1  0] (Indices: [0, 3, 6, 7, 9, 10, 11, 12, 13, 14, 16, 19]), Candidate: [ 1  1  2 -1  1  2  1 -1  2  1  0  1  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 70600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  1  0 -1  1  0  0  0  0  0 -1  0  1] (Indices: [0, 3, 6, 7, 9, 10, 12, 13, 14, 15, 16, 17]), Candidate: [ 1  1  2 -1  1  2  1 -1  2  1 -1  2  1  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 70650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  1 -1  1 -1  1  0  0  0  0 -1  1  0] (Indices: [0, 3, 6, 7, 9, 11, 13, 14, 15, 16, 17, 19]), Candidate: [ 1  1  2 -1  1  2  1 -1  2  0  1  0  2  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 70700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  0  0  1  0  0  0  0  0  0  0 -1  1] (Indices: [0, 3, 6, 7, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 1  1  2 -1  1  2  1 -1  1  1  1  1  1  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 70750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1  0  0  0 -1  1  0 -1  1  0  0 -1  1] (Indices: [0, 3, 6, 8, 9, 10, 11, 13, 14, 16, 17, 18]), Candidate: [ 1  1  2 -1  1  2  0  1  1  1  0  0  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 70800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1  0 -1  1  0  0  0 -1  1  0 -1  1  0] (Indices: [0, 3, 6, 8, 9, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 1  1  2 -1  1  2  0  1  1  0  1  1  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 70850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1 -1  1  0 -1  1  0  0  0  0  0 -1  1] (Indices: [0, 3, 6, 8, 10, 11, 13, 14, 15, 16, 17, 18]), Candidate: [ 1  1  2 -1  1  2  0  1  0  2  0  0  2  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  0  1  0  0 -1  1 -1  1  0  0  0  0  0] (Indices: [0, 3, 6, 9, 10, 11, 13, 15, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  2  0  0  2  1  0  0  2  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0  0  0  0  0 -1  1  0  0 -1  1 -1  1] (Indices: [0, 3, 7, 8, 9, 10, 11, 12, 14, 15, 16, 18]), Candidate: [ 1  1  2 -1  1  1  2  0  1  1  0  1  0  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0  0  0 -1  1 -1  1  0  0  0  0 -1  1] (Indices: [0, 3, 7, 8, 9, 10, 12, 14, 15, 16, 17, 18]), Candidate: [ 1  1  2 -1  1  1  2  0  1  1 -1  2  0  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 71050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0 -1  1  0  0  0  0  0  0 -1  1 -1  1] (Indices: [0, 3, 7, 8, 10, 11, 12, 13, 14, 15, 16, 18]), Candidate: [ 1  1  2 -1  1  1  2  0  0  2  0  1  1  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  1  0  0  0  0  0 -1  1  0  0 -1  1] (Indices: [0, 3, 7, 9, 10, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 1  1  2 -1  1  1  2 -1  2  1  0  1  1  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 71150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1  0  0  0  0  0  0  0  0 -1  1 -1  1] (Indices: [0, 3, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18]), Candidate: [ 1  1  2 -1  1  1  1  1  1  1  0  1  1  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  0  1 -1  1  0  0 -1  1  0  0  0  0  0  0] (Indices: [0, 3, 8, 10, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  1  1  1  0  2  0  1  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0  0  0  0 -1  1 -1  0  0  0  1  0  0] (Indices: [0, 4, 5, 6, 7, 8, 9, 10, 11, 13, 18, 19]), Candidate: [1 1 1 1 1 1 1 0 1 1 0 0 2 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 71300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0  0  0 -1  1 -1  0  1 -1  1 -1  1  0] (Indices: [0, 4, 5, 6, 7, 8, 9, 10, 12, 15, 17, 19]), Candidate: [ 1  1  1  1  1  1  1  0  1  1 -1  2  0  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0  0 -1  1  0  0 -1  0  1  0 -1  0  1] (Indices: [0, 4, 5, 6, 7, 8, 9, 11, 12, 13, 16, 17]), Candidate: [1 1 1 1 1 1 1 0 1 0 1 1 1 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 71400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0  0 -1  1 -1  0  1  0 -1  1 -1  1  0] (Indices: [0, 4, 5, 6, 7, 8, 9, 11, 14, 15, 17, 19]), Candidate: [1 1 1 1 1 1 1 0 1 0 1 0 1 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 71450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0  0 -1  0  0  1  0  0 -1  1 -1  1  0] (Indices: [0, 4, 5, 6, 7, 8, 9, 13, 14, 15, 17, 19]), Candidate: [1 1 1 1 1 1 1 0 1 0 0 1 2 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 71500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0 -1  1  0  0 -1  0  0  1 -1  1  0  0] (Indices: [0, 4, 5, 6, 7, 8, 10, 11, 12, 16, 18, 19]), Candidate: [1 1 1 1 1 1 1 0 0 2 0 1 0 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 71550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0 -1  1 -1  1  0 -1  1 -1  1  0 -1  1] (Indices: [0, 4, 5, 6, 7, 8, 10, 12, 13, 15, 17, 18]), Candidate: [ 1  1  1  1  1  1  1  0  0  2 -1  2  1  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0 -1  0  1  0  0  0 -1  0  1  0 -1  1] (Indices: [0, 4, 5, 6, 7, 8, 11, 12, 13, 14, 17, 18]), Candidate: [ 1  1  1  1  1  1  1  0  0  1  1  1  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0 -1  0  0  1  0  0  0  0 -1  1 -1  1] (Indices: [0, 4, 5, 6, 7, 8, 12, 13, 14, 15, 16, 18]), Candidate: [1 1 1 1 1 1 1 0 0 1 0 2 1 1 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 71700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  1  0  0  0 -1  1 -1  0  1 -1  1  0] (Indices: [0, 4, 5, 6, 7, 9, 10, 11, 12, 14, 17, 19]), Candidate: [ 1  1  1  1  1  1  1 -1  2  1  0  1  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 71750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  1  0 -1  1  0  0  0 -1  0  0  1  0] (Indices: [0, 4, 5, 6, 7, 9, 10, 12, 13, 14, 15, 19]), Candidate: [ 1  1  1  1  1  1  1 -1  2  1 -1  2  1  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 71800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  1  0 -1  0  0  1  0 -1  1  0  0  0] (Indices: [0, 4, 5, 6, 7, 9, 10, 14, 15, 17, 18, 19]), Candidate: [ 1  1  1  1  1  1  1 -1  2  1 -1  1  1  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 71850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  1 -1  1 -1  1 -1  1  0 -1  1  0  0] (Indices: [0, 4, 5, 6, 7, 9, 11, 13, 15, 16, 18, 19]), Candidate: [ 1  1  1  1  1  1  1 -1  2  0  1  0  2  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  0  1  0  0  0 -1  1 -1  1  0 -1  1] (Indices: [0, 4, 5, 6, 7, 10, 11, 12, 13, 15, 17, 18]), Candidate: [ 1  1  1  1  1  1  1 -1  1  2  0  1  1  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  0  1 -1  1  0  0 -1  1  0 -1  1  0] (Indices: [0, 4, 5, 6, 7, 10, 12, 13, 14, 16, 17, 19]), Candidate: [ 1  1  1  1  1  1  1 -1  1  2 -1  2  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 72000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  0  0  0  1  0  0  0  0  0 -1  1  0] (Indices: [0, 4, 5, 6, 7, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 1  1  1  1  1  1  1 -1  1  1  0  2  1  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1  0  0  0 -1  1  0 -1  0  1 -1  1  0] (Indices: [0, 4, 5, 6, 8, 9, 10, 11, 13, 14, 17, 19]), Candidate: [ 1  1  1  1  1  1  0  1  1  1  0  0  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1  0  0 -1  1 -1  1  0 -1  1  0 -1  1] (Indices: [0, 4, 5, 6, 8, 9, 10, 12, 14, 15, 17, 18]), Candidate: [ 1  1  1  1  1  1  0  1  1  1 -1  2  0  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1  0 -1  1  0  0 -1  0  1  0 -1  1  0] (Indices: [0, 4, 5, 6, 8, 9, 11, 12, 13, 16, 17, 19]), Candidate: [1 1 1 1 1 1 0 1 1 0 1 1 1 0 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 72200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1  0 -1  0  1  0 -1  1  0  0 -1  1  0] (Indices: [0, 4, 5, 6, 8, 9, 12, 13, 15, 16, 17, 19]), Candidate: [1 1 1 1 1 1 0 1 1 0 0 2 1 0 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 72250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1 -1  1  0  0 -1  0  1 -1  1  0  0  0] (Indices: [0, 4, 5, 6, 8, 10, 11, 12, 15, 17, 18, 19]), Candidate: [1 1 1 1 1 1 0 1 0 2 0 1 0 1 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 72300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1 -1  1 -1  0  0  1  0  0  0  0  0  0] (Indices: [0, 4, 5, 6, 8, 10, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  1  1  1  1  1  0  1  0  2 -1  1  1  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  1  0  0  0  0 -1  1 -1  1  0 -1  1] (Indices: [0, 4, 5, 6, 9, 10, 11, 12, 13, 15, 17, 18]), Candidate: [1 1 1 1 1 1 0 0 2 1 0 1 1 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 72400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  1  0 -1  1  0  0 -1  1  0 -1  1  0] (Indices: [0, 4, 5, 6, 9, 10, 12, 13, 14, 16, 17, 19]), Candidate: [ 1  1  1  1  1  1  0  0  2  1 -1  2  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 72450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  1 -1  0  1  0  0  0  0  0 -1  1  0] (Indices: [0, 4, 5, 6, 9, 12, 13, 14, 15, 16, 17, 19]), Candidate: [1 1 1 1 1 1 0 0 2 0 0 2 1 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 72500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  0  0  1 -1  1  0  0  0  0  0  0  0] (Indices: [0, 4, 5, 6, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [1 1 1 1 1 1 0 0 1 1 1 0 2 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 72550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0  0  0  0 -1  1 -1  1 -1  1  0 -1  1] (Indices: [0, 4, 5, 7, 8, 9, 10, 11, 13, 15, 17, 18]), Candidate: [1 1 1 1 1 0 2 0 1 1 0 0 2 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 72600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0  0  0 -1  1 -1  1 -1  1 -1  1  0  0] (Indices: [0, 4, 5, 7, 8, 9, 10, 12, 14, 16, 18, 19]), Candidate: [ 1  1  1  1  1  0  2  0  1  1 -1  2  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 72650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0  0 -1  1  0 -1  1  0  0 -1  0  1  0] (Indices: [0, 4, 5, 7, 8, 9, 11, 12, 14, 15, 16, 19]), Candidate: [1 1 1 1 1 0 2 0 1 0 1 1 0 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 72700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0  0 -1  0  1 -1  1  0  0  0 -1  1  0] (Indices: [0, 4, 5, 7, 8, 9, 12, 14, 15, 16, 17, 19]), Candidate: [1 1 1 1 1 0 2 0 1 0 0 2 0 2 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 72750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0 -1  1  0 -1  1  0  0 -1  1  0 -1  1] (Indices: [0, 4, 5, 7, 8, 10, 11, 13, 14, 15, 17, 18]), Candidate: [1 1 1 1 1 0 2 0 0 2 0 0 2 1 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 72800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0 -1  0  1  0  0  0  0 -1  1 -1  1  0] (Indices: [0, 4, 5, 7, 8, 11, 12, 13, 14, 15, 17, 19]), Candidate: [1 1 1 1 1 0 2 0 0 1 1 1 1 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 72850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  1  0  0  0  0 -1  0  1 -1  1  0  0] (Indices: [0, 4, 5, 7, 9, 10, 11, 12, 13, 16, 18, 19]), Candidate: [ 1  1  1  1  1  0  2 -1  2  1  0  1  1  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  1  0 -1  1  0 -1  1  0 -1  1  0  0] (Indices: [0, 4, 5, 7, 9, 10, 12, 13, 15, 16, 18, 19]), Candidate: [ 1  1  1  1  1  0  2 -1  2  1 -1  2  1  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 72950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  1 -1  0  1 -1  1  0  0  0  0  0  0] (Indices: [0, 4, 5, 7, 9, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  1  1  1  1  0  2 -1  2  0  0  2  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1  0  0  0  0  0  0  0 -1  0  0  1  0] (Indices: [0, 4, 5, 8, 9, 10, 11, 12, 13, 14, 15, 19]), Candidate: [1 1 1 1 1 0 1 1 1 1 0 1 1 1 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 73050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1  0  0  0 -1  0  1  0 -1  1  0  0  0] (Indices: [0, 4, 5, 8, 9, 10, 11, 14, 15, 17, 18, 19]), Candidate: [1 1 1 1 1 0 1 1 1 1 0 0 1 2 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 73100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1  0 -1  1  0 -1  1 -1  1  0  0  0  0] (Indices: [0, 4, 5, 8, 9, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 1  1  1  1  1  0  1  1  1  0  1  1  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1 -1  1 -1  1  0 -1  1  0  0  0  0  0] (Indices: [0, 4, 5, 8, 10, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 1  1  1  1  1  0  1  1  0  2 -1  2  1  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  0  1 -1  1  0  0  0  0  0 -1  1  0  0] (Indices: [0, 4, 5, 9, 11, 12, 13, 14, 15, 16, 18, 19]), Candidate: [1 1 1 1 1 0 1 0 2 0 1 1 1 1 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 73250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0  0  0  0  0 -1  0  0  1 -1  1  0  0] (Indices: [0, 4, 6, 7, 8, 9, 10, 11, 12, 16, 18, 19]), Candidate: [1 1 1 1 0 2 1 0 1 1 0 1 0 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 73300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0  0  0 -1  1  0 -1  1 -1  1  0 -1  1] (Indices: [0, 4, 6, 7, 8, 9, 10, 12, 13, 15, 17, 18]), Candidate: [ 1  1  1  1  0  2  1  0  1  1 -1  2  1  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0  0 -1  1  0  0  0 -1  0  1  0 -1  1] (Indices: [0, 4, 6, 7, 8, 9, 11, 12, 13, 14, 17, 18]), Candidate: [ 1  1  1  1  0  2  1  0  1  0  1  1  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0  0 -1  0  1  0  0  0  0 -1  1 -1  1] (Indices: [0, 4, 6, 7, 8, 9, 12, 13, 14, 15, 16, 18]), Candidate: [1 1 1 1 0 2 1 0 1 0 0 2 1 1 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 73450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0 -1  1  0  0 -1  1  0 -1  1  0 -1  1] (Indices: [0, 4, 6, 7, 8, 10, 11, 12, 14, 15, 17, 18]), Candidate: [1 1 1 1 0 2 1 0 0 2 0 1 0 2 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 73500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0 -1  1 -1  1 -1  1  0  0 -1  1  0  0] (Indices: [0, 4, 6, 7, 8, 10, 12, 14, 15, 16, 18, 19]), Candidate: [ 1  1  1  1  0  2  1  0  0  2 -1  2  0  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  1  0  0  0  0  0  0 -1  0  0  1  0] (Indices: [0, 4, 6, 7, 9, 10, 11, 12, 13, 14, 15, 19]), Candidate: [ 1  1  1  1  0  2  1 -1  2  1  0  1  1  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  1  0  0 -1  0  1  0 -1  1  0  0  0] (Indices: [0, 4, 6, 7, 9, 10, 11, 14, 15, 17, 18, 19]), Candidate: [ 1  1  1  1  0  2  1 -1  2  1  0  0  1  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  1 -1  1  0 -1  1 -1  1  0  0  0  0] (Indices: [0, 4, 6, 7, 9, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 1  1  1  1  0  2  1 -1  2  0  1  1  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 73700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  0  1 -1  1  0 -1  1  0  0  0  0  0] (Indices: [0, 4, 6, 7, 10, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 1  1  1  1  0  2  1 -1  1  2 -1  2  1  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 73750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1  0  0  0 -1  1  0  0 -1  1  0 -1  1] (Indices: [0, 4, 6, 8, 9, 10, 11, 13, 14, 15, 17, 18]), Candidate: [1 1 1 1 0 2 0 1 1 1 0 0 2 1 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 73800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1  0 -1  1  0  0  0  0 -1  1 -1  1  0] (Indices: [0, 4, 6, 8, 9, 11, 12, 13, 14, 15, 17, 19]), Candidate: [1 1 1 1 0 2 0 1 1 0 1 1 1 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 73850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1 -1  1  0  0 -1  1  0 -1  1  0  0  0] (Indices: [0, 4, 6, 8, 10, 11, 12, 14, 15, 17, 18, 19]), Candidate: [1 1 1 1 0 2 0 1 0 2 0 1 0 2 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 73900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  1  0  0 -1  1  0  0  0 -1  1  0  0] (Indices: [0, 4, 6, 9, 10, 11, 13, 14, 15, 16, 18, 19]), Candidate: [1 1 1 1 0 2 0 0 2 1 0 0 2 1 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 73950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0  0  0  0  0  0 -1  0  1 -1  1  0  0] (Indices: [0, 4, 7, 8, 9, 10, 11, 12, 13, 16, 18, 19]), Candidate: [1 1 1 1 0 1 2 0 1 1 0 1 1 0 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 74000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0  0  0 -1  1  0 -1  1  0 -1  1  0  0] (Indices: [0, 4, 7, 8, 9, 10, 12, 13, 15, 16, 18, 19]), Candidate: [ 1  1  1  1  0  1  2  0  1  1 -1  2  1  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0  0 -1  0  1 -1  1  0  0  0  0  0  0] (Indices: [0, 4, 7, 8, 9, 12, 14, 15, 16, 17, 18, 19]), Candidate: [1 1 1 1 0 1 2 0 1 0 0 2 0 2 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 74100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  1  0  0  0  0  0  0 -1  1  0 -1  1] (Indices: [0, 4, 7, 9, 10, 11, 12, 13, 14, 15, 17, 18]), Candidate: [ 1  1  1  1  0  1  2 -1  2  1  0  1  1  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1 -1  0  1 -1  1  0  0  0  0  0  0  0  0] (Indices: [0, 4, 7, 10, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  1  1  1  0  1  2 -1  1  2 -1  2  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 74200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  0  1 -1  1  0  0  0  0  0 -1  1  0  0  0] (Indices: [0, 4, 8, 10, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [1 1 1 1 0 1 1 1 0 2 0 1 1 1 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 74250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0  0  0  0  0 -1  0  0  1  0 -1  1  0] (Indices: [0, 5, 6, 7, 8, 9, 10, 11, 12, 16, 17, 19]), Candidate: [1 1 1 0 2 1 1 0 1 1 0 1 0 1 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 74300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0  0  0 -1  1  0 -1  1  0 -1  0  1  0] (Indices: [0, 5, 6, 7, 8, 9, 10, 12, 13, 15, 16, 19]), Candidate: [ 1  1  1  0  2  1  1  0  1  1 -1  2  1  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0  0 -1  1  0  0  0 -1  1 -1  0  1  0] (Indices: [0, 5, 6, 7, 8, 9, 11, 12, 13, 14, 16, 19]), Candidate: [ 1  1  1  0  2  1  1  0  1  0  1  1  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0  0 -1  0  1  0  0  0  0  0 -1  0  1] (Indices: [0, 5, 6, 7, 8, 9, 12, 13, 14, 15, 16, 17]), Candidate: [1 1 1 0 2 1 1 0 1 0 0 2 1 1 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 74450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0 -1  1  0  0 -1  1  0  0 -1  0  1  0] (Indices: [0, 5, 6, 7, 8, 10, 11, 12, 14, 15, 16, 19]), Candidate: [1 1 1 0 2 1 1 0 0 2 0 1 0 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 74500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0 -1  1 -1  1 -1  1  0  0  0 -1  1  0] (Indices: [0, 5, 6, 7, 8, 10, 12, 14, 15, 16, 17, 19]), Candidate: [ 1  1  1  0  2  1  1  0  0  2 -1  2  0  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  1  0  0  0  0  0  0 -1  0  1 -1  1] (Indices: [0, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 18]), Candidate: [ 1  1  1  0  2  1  1 -1  2  1  0  1  1  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  1  0  0 -1  0  1  0  0 -1  1  0  0] (Indices: [0, 5, 6, 7, 9, 10, 11, 14, 15, 16, 18, 19]), Candidate: [ 1  1  1  0  2  1  1 -1  2  1  0  0  1  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  1 -1  1  0 -1  1  0 -1  1  0  0  0] (Indices: [0, 5, 6, 7, 9, 11, 12, 14, 15, 17, 18, 19]), Candidate: [ 1  1  1  0  2  1  1 -1  2  0  1  1  0  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  0  1 -1  1  0  0 -1  1  0  0  0  0] (Indices: [0, 5, 6, 7, 10, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  1  1  0  2  1  1 -1  1  2 -1  2  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 74750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1  0  0  0 -1  1  0  0  0 -1  0  1  0] (Indices: [0, 5, 6, 8, 9, 10, 11, 13, 14, 15, 16, 19]), Candidate: [1 1 1 0 2 1 0 1 1 1 0 0 2 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 74800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1  0 -1  1  0  0  0  0 -1  1  0 -1  1] (Indices: [0, 5, 6, 8, 9, 11, 12, 13, 14, 15, 17, 18]), Candidate: [1 1 1 0 2 1 0 1 1 0 1 1 1 1 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 74850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1 -1  1  0  0 -1  1  0  0 -1  1  0  0] (Indices: [0, 5, 6, 8, 10, 11, 12, 14, 15, 16, 18, 19]), Candidate: [1 1 1 0 2 1 0 1 0 2 0 1 0 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 74900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  0  1  0  0 -1  1  0  0  0  0 -1  1  0] (Indices: [0, 5, 6, 9, 10, 11, 13, 14, 15, 16, 17, 19]), Candidate: [1 1 1 0 2 1 0 0 2 1 0 0 2 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 74950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0  0  0  0  0  0 -1  0  1  0 -1  1  0] (Indices: [0, 5, 7, 8, 9, 10, 11, 12, 13, 16, 17, 19]), Candidate: [1 1 1 0 2 0 2 0 1 1 0 1 1 0 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 75000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0  0  0 -1  1  0 -1  1  0  0 -1  1  0] (Indices: [0, 5, 7, 8, 9, 10, 12, 13, 15, 16, 17, 19]), Candidate: [ 1  1  1  0  2  0  2  0  1  1 -1  2  1  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0  0 -1  0  1  0 -1  1  0  0  0  0  0] (Indices: [0, 5, 7, 8, 9, 12, 13, 15, 16, 17, 18, 19]), Candidate: [1 1 1 0 2 0 2 0 1 0 0 2 1 0 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 75100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  1  0  0  0  0  0  0  0 -1  0  1  0] (Indices: [0, 5, 7, 9, 10, 11, 12, 13, 14, 15, 16, 19]), Candidate: [ 1  1  1  0  2  0  2 -1  2  1  0  1  1  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1 -1  0  1  0 -1  1  0  0  0  0  0  0  0] (Indices: [0, 5, 7, 10, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  1  1  0  2  0  2 -1  1  2  0  0  2  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  0  1 -1  1  0  0  0  0  0  0 -1  1  0  0] (Indices: [0, 5, 8, 10, 11, 12, 13, 14, 15, 16, 18, 19]), Candidate: [1 1 1 0 2 0 1 1 0 2 0 1 1 1 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 75250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0  0  0  0  0 -1  0  1  0  0 -1  1  0] (Indices: [0, 6, 7, 8, 9, 10, 11, 12, 15, 16, 17, 19]), Candidate: [1 1 1 0 1 2 1 0 1 1 0 1 0 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 75300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0  0  0 -1  0  1  0 -1  1  0  0  0  0] (Indices: [0, 6, 7, 8, 9, 10, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  1  1  0  1  2  1  0  1  1 -1  1  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 75350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0 -1  1  0  0  0 -1  1  0  0 -1  1  0] (Indices: [0, 6, 7, 8, 10, 11, 12, 13, 15, 16, 17, 19]), Candidate: [1 1 1 0 1 2 1 0 0 2 0 1 1 0 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 75400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0 -1  1  0  0  0 -1  1  0  0  0 -1  1  0] (Indices: [0, 6, 7, 9, 10, 11, 12, 14, 15, 16, 17, 19]), Candidate: [ 1  1  1  0  1  2  1 -1  2  1  0  1  0  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  1  0  0  0  0  0 -1  1  0  0 -1  1  0] (Indices: [0, 6, 8, 9, 10, 11, 12, 13, 15, 16, 17, 19]), Candidate: [1 1 1 0 1 2 0 1 1 1 0 1 1 0 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 75500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1 -1  0  1  0  0  0 -1  1  0  0  0  0  0  0] (Indices: [0, 6, 9, 10, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [1 1 1 0 1 2 0 0 2 1 0 1 0 2 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 75550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  0  1  0 -1  1  0  0  0  0  0  0  0  0 -1  1] (Indices: [0, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [1 1 1 0 1 1 2 0 0 2 0 1 1 1 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 75600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0  0  0 -1  0  1 -1  0  1 -1  0  0  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 13, 16]), Candidate: [ 3  1  1  0  1  1  1  0  1  1 -1  1  2  0  0  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0  0 -1  0  1  0 -1  0  0  1 -1  0  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 9, 12, 13, 17]), Candidate: [3 1 1 0 1 1 1 0 1 0 0 2 1 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 75700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0  0 -1  0  0  0  0  0  1  0 -1  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 9, 16, 17, 19]), Candidate: [3 1 1 0 1 1 1 0 1 0 0 1 1 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 75750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0 -1  1 -1  1 -1  0  0  0  1 -1  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 17, 19]), Candidate: [ 3  1  1  0  1  1  1  0  0  2 -1  2  0  1  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0 -1  0  1  0 -1  0  1 -1  0  1 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 15, 18]), Candidate: [3 1 1 0 1 1 1 0 0 1 1 1 0 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 75850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0 -1  0  0  1  0 -1  1 -1  0  1 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 12, 13, 15, 18]), Candidate: [3 1 1 0 1 1 1 0 0 1 0 2 1 0 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 75900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0 -1  0  0  0  0  1  0  0 -1  0  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 14, 15, 16, 19]), Candidate: [3 1 1 0 1 1 1 0 0 1 0 1 1 2 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 75950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  1  0 -1  1 -1  1 -1  0  0  1 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 9, 10, 12, 14, 18]), Candidate: [ 3  1  1  0  1  1  1 -1  2  1 -1  2  0  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 76000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  1 -1  1  0  0 -1  0  0  1 -1  0  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 9, 11, 12, 13, 17]), Candidate: [ 3  1  1  0  1  1  1 -1  2  0  1  1  1  0  0  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  1 -1  1 -1  0  0  0  1  0 -1  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 7, 9, 11, 16, 17, 19]), Candidate: [ 3  1  1  0  1  1  1 -1  2  0  1  0  1  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  1 -1  0  0  1 -1  1  0 -1  0  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 7, 9, 13, 15, 16, 19]), Candidate: [ 3  1  1  0  1  1  1 -1  2  0  0  1  2  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  0  1  0 -1  1 -1  1 -1  1 -1  0  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 10, 11, 13, 15, 17]), Candidate: [ 3  1  1  0  1  1  1 -1  1  2  0  0  2  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  0  1 -1  1 -1  1 -1  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 7, 10, 12, 14, 16, 19]), Candidate: [ 3  1  1  0  1  1  1 -1  1  2 -1  2  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 76250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  0  0  1  0  0  0 -1  1 -1  0  0  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 11, 12, 13, 14, 16]), Candidate: [ 3  1  1  0  1  1  1 -1  1  1  1  1  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 76300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  0  0  1 -1  1 -1  0  1  0  0 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 11, 13, 16, 17, 18]), Candidate: [ 3  1  1  0  1  1  1 -1  1  1  1  0  2  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  0  0  0  1 -1  0  1  0  0 -1  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 7, 12, 15, 16, 17, 19]), Candidate: [ 3  1  1  0  1  1  1 -1  1  1  0  2  0  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1  0  0  0 -1  0  0  0  0  1  0 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 8, 9, 10, 11, 17, 18]), Candidate: [3 1 1 0 1 1 0 1 1 1 0 0 1 1 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 76450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1  0  0 -1  0  0  0  1  0 -1  1 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 8, 9, 10, 15, 16, 18]), Candidate: [ 3  1  1  0  1  1  0  1  1  1 -1  1  1  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1  0 -1  1 -1  0  1 -1  1 -1  1 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 8, 9, 11, 14, 16, 18]), Candidate: [ 3  1  1  0  1  1  0  1  1  0  1  0  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1  0 -1  0  0  1  0  0  0 -1  0  0  0] (Indices: [1, 2, 3, 4, 5, 6, 8, 9, 13, 14, 15, 16]), Candidate: [3 1 1 0 1 1 0 1 1 0 0 1 2 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 76600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1 -1  1  0  0 -1  0  0  1  0 -1  0  0] (Indices: [1, 2, 3, 4, 5, 6, 8, 10, 11, 12, 16, 17]), Candidate: [3 1 1 0 1 1 0 1 0 2 0 1 0 1 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 76650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1 -1  1 -1  1  0 -1  0  1  0 -1  0  0] (Indices: [1, 2, 3, 4, 5, 6, 8, 10, 12, 13, 16, 17]), Candidate: [ 3  1  1  0  1  1  0  1  0  2 -1  2  1  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1 -1  1 -1  0  0  1  0 -1  1 -1  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 8, 10, 14, 15, 17, 19]), Candidate: [ 3  1  1  0  1  1  0  1  0  2 -1  1  1  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1 -1  0  1 -1  1  0 -1  1  0 -1  0  0] (Indices: [1, 2, 3, 4, 5, 6, 8, 11, 13, 14, 16, 17]), Candidate: [ 3  1  1  0  1  1  0  1  0  1  1  0  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1 -1  0  0  1  0 -1  0  0  1  0  0 -1] (Indices: [1, 2, 3, 4, 5, 6, 8, 12, 13, 17, 18, 19]), Candidate: [3 1 1 0 1 1 0 1 0 1 0 2 1 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 76850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  1  0  0  0 -1  0  1 -1  0  1 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 9, 10, 11, 12, 15, 18]), Candidate: [3 1 1 0 1 1 0 0 2 1 0 1 0 1 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 76900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  1  0 -1  1  0 -1  1 -1  0  1 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 9, 10, 12, 13, 15, 18]), Candidate: [ 3  1  1  0  1  1  0  0  2  1 -1  2  1  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  1  0 -1  0  0  1  0  0 -1  0  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 9, 10, 14, 15, 16, 19]), Candidate: [ 3  1  1  0  1  1  0  0  2  1 -1  1  1  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  1 -1  1 -1  1  0  0 -1  0  1 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 9, 11, 13, 14, 15, 18]), Candidate: [3 1 1 0 1 1 0 0 2 0 1 0 2 1 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 77050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  1 -1  0  1  0 -1  0  1  0 -1  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 9, 12, 13, 16, 17, 19]), Candidate: [3 1 1 0 1 1 0 0 2 0 0 2 1 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 77100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  0  1  0  0  0 -1  0  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 10, 11, 12, 13, 16, 19]), Candidate: [3 1 1 0 1 1 0 0 1 2 0 1 1 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 77150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  0  1  0 -1  0  1 -1  1  0  0 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 10, 11, 14, 16, 17, 18]), Candidate: [ 3  1  1  0  1  1  0  0  1  2  0  0  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  0  1 -1  0  1  0 -1  1  0  0 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 10, 13, 14, 16, 17, 18]), Candidate: [ 3  1  1  0  1  1  0  0  1  2 -1  1  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 77250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  0  0  1 -1  1  0  0  0  0 -1  0  0] (Indices: [1, 2, 3, 4, 5, 6, 11, 13, 14, 15, 16, 17]), Candidate: [3 1 1 0 1 1 0 0 1 1 1 0 2 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 77300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0  0  0  0  0 -1  1 -1  0  0  0  0  0] (Indices: [1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 12, 14]), Candidate: [ 3  1  1  0  1  0  2  0  1  1  0  1  0  2 -1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0  0  0 -1  0  1  0 -1  0  1 -1  0  0] (Indices: [1, 2, 3, 4, 5, 7, 8, 9, 10, 13, 14, 17]), Candidate: [ 3  1  1  0  1  0  2  0  1  1 -1  1  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 77400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0  0 -1  1  0 -1  0  0  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 5, 7, 8, 9, 11, 12, 16, 19]), Candidate: [3 1 1 0 1 0 2 0 1 0 1 1 0 1 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 77450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0  0 -1  0  1  0 -1  0  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 5, 7, 8, 9, 12, 13, 16, 19]), Candidate: [3 1 1 0 1 0 2 0 1 0 0 2 1 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 77500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0  0 -1  0  0  0  1 -1  1  0  0 -1  0] (Indices: [1, 2, 3, 4, 5, 7, 8, 9, 14, 16, 17, 18]), Candidate: [ 3  1  1  0  1  0  2  0  1  0  0  1  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0 -1  1  0 -1  0  1 -1  1 -1  1 -1  0] (Indices: [1, 2, 3, 4, 5, 7, 8, 10, 11, 14, 16, 18]), Candidate: [ 3  1  1  0  1  0  2  0  0  2  0  0  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0 -1  1 -1  0  1  0  0  0 -1  0  0  0] (Indices: [1, 2, 3, 4, 5, 7, 8, 10, 13, 14, 15, 16]), Candidate: [ 3  1  1  0  1  0  2  0  0  2 -1  1  2  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0 -1  0  1  0 -1  1  0  0 -1  0  0  0] (Indices: [1, 2, 3, 4, 5, 7, 8, 11, 12, 14, 15, 16]), Candidate: [3 1 1 0 1 0 2 0 0 1 1 1 0 2 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 77700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0 -1  0  1 -1  0  0  1  0  0  0 -1  0] (Indices: [1, 2, 3, 4, 5, 7, 8, 11, 15, 16, 17, 18]), Candidate: [3 1 1 0 1 0 2 0 0 1 1 0 1 1 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 77750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0 -1  0  0  0  1 -1  1  0  0  0 -1  0] (Indices: [1, 2, 3, 4, 5, 7, 8, 13, 15, 16, 17, 18]), Candidate: [3 1 1 0 1 0 2 0 0 1 0 1 2 0 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 77800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  1  0  0 -1  0  1  0 -1  0  0  1 -1] (Indices: [1, 2, 3, 4, 5, 7, 9, 10, 11, 14, 15, 19]), Candidate: [ 3  1  1  0  1  0  2 -1  2  1  0  0  1  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  1  0 -1  1 -1  0  0  1 -1  1  0 -1] (Indices: [1, 2, 3, 4, 5, 7, 9, 10, 12, 16, 18, 19]), Candidate: [ 3  1  1  0  1  0  2 -1  2  1 -1  2  0  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 77900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  1 -1  1  0  0 -1  0  0  1 -1  1 -1] (Indices: [1, 2, 3, 4, 5, 7, 9, 11, 12, 13, 17, 19]), Candidate: [ 3  1  1  0  1  0  2 -1  2  0  1  1  1  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  1 -1  1 -1  0  1 -1  1 -1  1  0 -1] (Indices: [1, 2, 3, 4, 5, 7, 9, 11, 14, 16, 18, 19]), Candidate: [ 3  1  1  0  1  0  2 -1  2  0  1  0  1  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 78000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  1 -1  0  0  1  0 -1  1 -1  1  0 -1] (Indices: [1, 2, 3, 4, 5, 7, 9, 13, 14, 16, 18, 19]), Candidate: [ 3  1  1  0  1  0  2 -1  2  0  0  1  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 78050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  0  1  0 -1  1  0  0 -1  0  1 -1  0] (Indices: [1, 2, 3, 4, 5, 7, 10, 11, 13, 14, 15, 18]), Candidate: [ 3  1  1  0  1  0  2 -1  1  2  0  0  2  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  0  1 -1  1  0 -1  0  1  0 -1  1 -1] (Indices: [1, 2, 3, 4, 5, 7, 10, 12, 13, 16, 17, 19]), Candidate: [ 3  1  1  0  1  0  2 -1  1  2 -1  2  1  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 78150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  0  0  1  0  0 -1  1  0 -1  1 -1  0] (Indices: [1, 2, 3, 4, 5, 7, 11, 12, 13, 15, 16, 18]), Candidate: [ 3  1  1  0  1  0  2 -1  1  1  1  1  1  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  0  0  0  1  0  0  0 -1  0  1  0 -1] (Indices: [1, 2, 3, 4, 5, 7, 12, 13, 14, 15, 18, 19]), Candidate: [ 3  1  1  0  1  0  2 -1  1  1  0  2  1  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1  0  0  0 -1  1 -1  1 -1  1 -1  0  0] (Indices: [1, 2, 3, 4, 5, 8, 9, 10, 11, 13, 15, 17]), Candidate: [3 1 1 0 1 0 1 1 1 1 0 0 2 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 78300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1  0  0 -1  1 -1  1 -1  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 5, 8, 9, 10, 12, 14, 16, 19]), Candidate: [ 3  1  1  0  1  0  1  1  1  1 -1  2  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 78350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1  0 -1  1  0  0  0 -1  1 -1  0  0  0] (Indices: [1, 2, 3, 4, 5, 8, 9, 11, 12, 13, 14, 16]), Candidate: [ 3  1  1  0  1  0  1  1  1  0  1  1  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1  0 -1  1 -1  1 -1  0  1  0  0 -1  0] (Indices: [1, 2, 3, 4, 5, 8, 9, 11, 13, 16, 17, 18]), Candidate: [3 1 1 0 1 0 1 1 1 0 1 0 2 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 78450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1  0 -1  0  1 -1  0  1  0  0 -1  1 -1] (Indices: [1, 2, 3, 4, 5, 8, 9, 12, 15, 16, 17, 19]), Candidate: [3 1 1 0 1 0 1 1 1 0 0 2 0 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 78500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1 -1  1  0  0 -1  0  1  0  0 -1  0  0] (Indices: [1, 2, 3, 4, 5, 8, 10, 11, 12, 15, 16, 17]), Candidate: [3 1 1 0 1 0 1 1 0 2 0 1 0 1 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 78550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1 -1  1 -1  1  0  0 -1  1 -1  1 -1  0] (Indices: [1, 2, 3, 4, 5, 8, 10, 12, 13, 14, 16, 18]), Candidate: [ 3  1  1  0  1  0  1  1  0  2 -1  2  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 78600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1 -1  1 -1  0  0  0  1  0  0  0  0 -1] (Indices: [1, 2, 3, 4, 5, 8, 10, 15, 16, 17, 18, 19]), Candidate: [ 3  1  1  0  1  0  1  1  0  2 -1  1  1  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1 -1  0  1 -1  1 -1  0  1  0  0  0 -1] (Indices: [1, 2, 3, 4, 5, 8, 11, 13, 16, 17, 18, 19]), Candidate: [3 1 1 0 1 0 1 1 0 1 1 0 2 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 78700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  1  0  0  0 -1  1  0  0 -1  0  0  0] (Indices: [1, 2, 3, 4, 5, 9, 10, 11, 12, 14, 15, 16]), Candidate: [3 1 1 0 1 0 1 0 2 1 0 1 0 2 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 78750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  1  0  0 -1  0  0  1  0  0  0 -1  0] (Indices: [1, 2, 3, 4, 5, 9, 10, 11, 15, 16, 17, 18]), Candidate: [3 1 1 0 1 0 1 0 2 1 0 0 1 1 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 78800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  1  0 -1  0  1 -1  1  0  0  0 -1  0] (Indices: [1, 2, 3, 4, 5, 9, 10, 13, 15, 16, 17, 18]), Candidate: [ 3  1  1  0  1  0  1  0  2  1 -1  1  2  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  1 -1  1 -1  1  0  0 -1  1 -1  1 -1] (Indices: [1, 2, 3, 4, 5, 9, 11, 13, 14, 15, 17, 19]), Candidate: [3 1 1 0 1 0 1 0 2 0 1 0 2 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 78900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  0  1  0  0  0  0 -1  1 -1  1 -1  0] (Indices: [1, 2, 3, 4, 5, 10, 11, 12, 13, 14, 16, 18]), Candidate: [ 3  1  1  0  1  0  1  0  1  2  0  1  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 78950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  0  1  0 -1  0  0  1  0  0  0  0 -1] (Indices: [1, 2, 3, 4, 5, 10, 11, 15, 16, 17, 18, 19]), Candidate: [3 1 1 0 1 0 1 0 1 2 0 0 1 1 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 79000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  0  0  1 -1  1  0  0  0  0  0 -1  0] (Indices: [1, 2, 3, 4, 5, 11, 13, 14, 15, 16, 17, 18]), Candidate: [3 1 1 0 1 0 1 0 1 1 1 0 2 1 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 79050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0  0  0 -1  1 -1  1 -1  1 -1  0  0  0] (Indices: [1, 2, 3, 4, 6, 7, 8, 9, 10, 12, 14, 16]), Candidate: [ 3  1  1  0  0  2  1  0  1  1 -1  2  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 79100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0  0 -1  1  0  0 -1  1 -1  0  0  0  0] (Indices: [1, 2, 3, 4, 6, 7, 8, 9, 11, 12, 13, 15]), Candidate: [3 1 1 0 0 2 1 0 1 0 1 1 1 0 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 79150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0  0 -1  1 -1  0  0  1 -1  0  1  0 -1] (Indices: [1, 2, 3, 4, 6, 7, 8, 9, 11, 15, 18, 19]), Candidate: [3 1 1 0 0 2 1 0 1 0 1 0 1 1 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 79200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0  0 -1  0  0  1 -1  1  0  0 -1  0  0] (Indices: [1, 2, 3, 4, 6, 7, 8, 9, 13, 15, 16, 17]), Candidate: [3 1 1 0 0 2 1 0 1 0 0 1 2 0 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 79250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0 -1  1  0 -1  1  0 -1  0  0  0  1 -1] (Indices: [1, 2, 3, 4, 6, 7, 8, 10, 11, 13, 14, 19]), Candidate: [ 3  1  1  0  0  2  1  0  0  2  0  0  2  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0 -1  1 -1  1 -1  1 -1  1  0 -1  0  0] (Indices: [1, 2, 3, 4, 6, 7, 8, 10, 12, 14, 16, 17]), Candidate: [ 3  1  1  0  0  2  1  0  0  2 -1  2  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 79350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0 -1  1 -1  0  0  0  0  1  0  0  0 -1] (Indices: [1, 2, 3, 4, 6, 7, 8, 10, 16, 17, 18, 19]), Candidate: [ 3  1  1  0  0  2  1  0  0  2 -1  1  1  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0 -1  0  1 -1  1 -1  1 -1  1 -1  1 -1] (Indices: [1, 2, 3, 4, 6, 7, 8, 11, 13, 15, 17, 19]), Candidate: [3 1 1 0 0 2 1 0 0 1 1 0 2 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 79450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0 -1  0  0  1 -1  1 -1  0  1  0  0 -1] (Indices: [1, 2, 3, 4, 6, 7, 8, 12, 14, 17, 18, 19]), Candidate: [ 3  1  1  0  0  2  1  0  0  1  0  2  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  1  0  0 -1  1  0 -1  0  1 -1  0  0] (Indices: [1, 2, 3, 4, 6, 7, 9, 10, 11, 13, 14, 17]), Candidate: [ 3  1  1  0  0  2  1 -1  2  1  0  0  2  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 79550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  1  0 -1  1 -1  1  0 -1  0  1 -1  0] (Indices: [1, 2, 3, 4, 6, 7, 9, 10, 12, 14, 15, 18]), Candidate: [ 3  1  1  0  0  2  1 -1  2  1 -1  2  0  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 79600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  1  0 -1  0  0  0  1  0 -1  1  0 -1] (Indices: [1, 2, 3, 4, 6, 7, 9, 10, 15, 16, 18, 19]), Candidate: [ 3  1  1  0  0  2  1 -1  2  1 -1  1  1  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 79650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  1 -1  1 -1  1 -1  1  0 -1  0  1 -1] (Indices: [1, 2, 3, 4, 6, 7, 9, 11, 13, 15, 16, 19]), Candidate: [ 3  1  1  0  0  2  1 -1  2  0  1  0  2  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  1 -1  0  1 -1  1 -1  1  0 -1  1 -1] (Indices: [1, 2, 3, 4, 6, 7, 9, 12, 14, 16, 17, 19]), Candidate: [ 3  1  1  0  0  2  1 -1  2  0  0  2  0  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 79750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  0  1  0  0 -1  1 -1  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 6, 7, 10, 11, 12, 14, 16, 19]), Candidate: [ 3  1  1  0  0  2  1 -1  1  2  0  1  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 79800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  0  1 -1  1  0  0  0 -1  1 -1  0  0] (Indices: [1, 2, 3, 4, 6, 7, 10, 12, 13, 14, 15, 17]), Candidate: [ 3  1  1  0  0  2  1 -1  1  2 -1  2  1  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 79850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  0  1 -1  0  0  1  0  0  0 -1  1 -1] (Indices: [1, 2, 3, 4, 6, 7, 10, 14, 15, 16, 17, 19]), Candidate: [ 3  1  1  0  0  2  1 -1  1  2 -1  1  1  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 79900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  0  0  1 -1  1 -1  1  0  0  0 -1  0] (Indices: [1, 2, 3, 4, 6, 7, 11, 13, 15, 16, 17, 18]), Candidate: [ 3  1  1  0  0  2  1 -1  1  1  1  0  2  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 79950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1  0  0  0  0 -1  0  1  0 -1  0  0  0] (Indices: [1, 2, 3, 4, 6, 8, 9, 10, 11, 12, 15, 16]), Candidate: [3 1 1 0 0 2 0 1 1 1 0 1 0 1 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 80000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1  0  0 -1  1  0 -1  1  0 -1  0  0  0] (Indices: [1, 2, 3, 4, 6, 8, 9, 10, 12, 13, 15, 16]), Candidate: [ 3  1  1  0  0  2  0  1  1  1 -1  2  1  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1  0  0 -1  0  0  1  0  0  0 -1  0  0] (Indices: [1, 2, 3, 4, 6, 8, 9, 10, 14, 15, 16, 17]), Candidate: [ 3  1  1  0  0  2  0  1  1  1 -1  1  1  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1  0 -1  1 -1  1  0  0  0 -1  0  0  0] (Indices: [1, 2, 3, 4, 6, 8, 9, 11, 13, 14, 15, 16]), Candidate: [3 1 1 0 0 2 0 1 1 0 1 0 2 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 80150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1  0 -1  0  1  0 -1  1 -1  0  1  0 -1] (Indices: [1, 2, 3, 4, 6, 8, 9, 12, 13, 15, 18, 19]), Candidate: [3 1 1 0 0 2 0 1 1 0 0 2 1 0 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 80200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1 -1  1  0  0  0 -1  0  1  0 -1  0  0] (Indices: [1, 2, 3, 4, 6, 8, 10, 11, 12, 13, 16, 17]), Candidate: [3 1 1 0 0 2 0 1 0 2 0 1 1 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 80250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1 -1  1  0 -1  0  1  0 -1  1 -1  1 -1] (Indices: [1, 2, 3, 4, 6, 8, 10, 11, 14, 15, 17, 19]), Candidate: [3 1 1 0 0 2 0 1 0 2 0 0 1 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 80300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1 -1  1 -1  0  1  0  0 -1  1 -1  1 -1] (Indices: [1, 2, 3, 4, 6, 8, 10, 13, 14, 15, 17, 19]), Candidate: [ 3  1  1  0  0  2  0  1  0  2 -1  1  2  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1 -1  0  1  0 -1  0  1 -1  1  0  0 -1] (Indices: [1, 2, 3, 4, 6, 8, 11, 12, 15, 17, 18, 19]), Candidate: [3 1 1 0 0 2 0 1 0 1 1 1 0 1 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 80400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1 -1  0  0  0  0  1  0  0  0  0  0 -1] (Indices: [1, 2, 3, 4, 6, 8, 14, 15, 16, 17, 18, 19]), Candidate: [3 1 1 0 0 2 0 1 0 1 0 1 1 2 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 80450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  1  0  0 -1  1 -1  1 -1  1 -1  1 -1] (Indices: [1, 2, 3, 4, 6, 9, 10, 11, 13, 15, 17, 19]), Candidate: [3 1 1 0 0 2 0 0 2 1 0 0 2 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 80500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  1  0 -1  1 -1  1 -1  0  1  0  0 -1] (Indices: [1, 2, 3, 4, 6, 9, 10, 12, 14, 17, 18, 19]), Candidate: [ 3  1  1  0  0  2  0  0  2  1 -1  2  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 80550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  1 -1  1  0 -1  1  0 -1  1  0 -1  0] (Indices: [1, 2, 3, 4, 6, 9, 11, 12, 14, 15, 17, 18]), Candidate: [3 1 1 0 0 2 0 0 2 0 1 1 0 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 80600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  1 -1  0  1 -1  1  0  0 -1  1  0 -1] (Indices: [1, 2, 3, 4, 6, 9, 12, 14, 15, 16, 18, 19]), Candidate: [3 1 1 0 0 2 0 0 2 0 0 2 0 2 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 80650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  0  1  0 -1  1  0  0 -1  1 -1  1 -1] (Indices: [1, 2, 3, 4, 6, 10, 11, 13, 14, 15, 17, 19]), Candidate: [3 1 1 0 0 2 0 0 1 2 0 0 2 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 80700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  0  0  1  0  0  0  0 -1  0  1  0 -1] (Indices: [1, 2, 3, 4, 6, 11, 12, 13, 14, 15, 18, 19]), Candidate: [3 1 1 0 0 2 0 0 1 1 1 1 1 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 80750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0  0  0  0  0 -1  0  0  0  1 -1  1 -1] (Indices: [1, 2, 3, 4, 7, 8, 9, 10, 11, 12, 17, 19]), Candidate: [3 1 1 0 0 1 2 0 1 1 0 1 0 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 80800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0  0  0 -1  1  0 -1  0  0  1 -1  1 -1] (Indices: [1, 2, 3, 4, 7, 8, 9, 10, 12, 13, 17, 19]), Candidate: [ 3  1  1  0  0  1  2  0  1  1 -1  2  1  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0  0  0 -1  0  0  1 -1  1 -1  1  0 -1] (Indices: [1, 2, 3, 4, 7, 8, 9, 10, 14, 16, 18, 19]), Candidate: [ 3  1  1  0  0  1  2  0  1  1 -1  1  1  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 80900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0  0 -1  1 -1  1  0 -1  0  1 -1  1 -1] (Indices: [1, 2, 3, 4, 7, 8, 9, 11, 13, 14, 17, 19]), Candidate: [ 3  1  1  0  0  1  2  0  1  0  1  0  2  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 80950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0  0 -1  0  1 -1  1  0 -1  1  0 -1  0] (Indices: [1, 2, 3, 4, 7, 8, 9, 12, 14, 15, 17, 18]), Candidate: [3 1 1 0 0 1 2 0 1 0 0 2 0 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 81000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0 -1  1  0  0 -1  1  0 -1  0  1 -1  0] (Indices: [1, 2, 3, 4, 7, 8, 10, 11, 12, 14, 15, 18]), Candidate: [3 1 1 0 0 1 2 0 0 2 0 1 0 2 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 81050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0 -1  1  0 -1  0  0  1  0 -1  1  0 -1] (Indices: [1, 2, 3, 4, 7, 8, 10, 11, 15, 16, 18, 19]), Candidate: [3 1 1 0 0 1 2 0 0 2 0 0 1 1 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 81100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0 -1  1 -1  0  1 -1  1  0 -1  1  0 -1] (Indices: [1, 2, 3, 4, 7, 8, 10, 13, 15, 16, 18, 19]), Candidate: [ 3  1  1  0  0  1  2  0  0  2 -1  1  2  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0 -1  0  1 -1  1  0 -1  1  0  0 -1  0] (Indices: [1, 2, 3, 4, 7, 8, 11, 13, 14, 16, 17, 18]), Candidate: [ 3  1  1  0  0  1  2  0  0  1  1  0  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  1  0  0  0  0 -1  1 -1  0  1 -1  0] (Indices: [1, 2, 3, 4, 7, 9, 10, 11, 12, 13, 15, 18]), Candidate: [ 3  1  1  0  0  1  2 -1  2  1  0  1  1  0  1  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  1  0  0 -1  0  1  0  0 -1  0  1 -1] (Indices: [1, 2, 3, 4, 7, 9, 10, 11, 14, 15, 16, 19]), Candidate: [ 3  1  1  0  0  1  2 -1  2  1  0  0  1  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  1  0 -1  0  1  0  0  0 -1  0  1 -1] (Indices: [1, 2, 3, 4, 7, 9, 10, 13, 14, 15, 16, 19]), Candidate: [ 3  1  1  0  0  1  2 -1  2  1 -1  1  2  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 81350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  1 -1  1  0 -1  0  1  0  0 -1  1 -1] (Indices: [1, 2, 3, 4, 7, 9, 11, 12, 15, 16, 17, 19]), Candidate: [ 3  1  1  0  0  1  2 -1  2  0  1  1  0  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  1 -1  0  0  1  0 -1  1  0  0  0 -1] (Indices: [1, 2, 3, 4, 7, 9, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  1  1  0  0  1  2 -1  2  0  0  1  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 81450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  0  1  0 -1  1 -1  1  0 -1  1  0 -1] (Indices: [1, 2, 3, 4, 7, 10, 11, 13, 15, 16, 18, 19]), Candidate: [ 3  1  1  0  0  1  2 -1  1  2  0  0  2  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  0  0  1  0  0 -1  1 -1  1  0  0 -1] (Indices: [1, 2, 3, 4, 7, 11, 12, 13, 15, 17, 18, 19]), Candidate: [ 3  1  1  0  0  1  2 -1  1  1  1  1  1  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1  0  0  0  0 -1  0  1  0 -1  0  1 -1] (Indices: [1, 2, 3, 4, 8, 9, 10, 11, 12, 15, 16, 19]), Candidate: [3 1 1 0 0 1 1 1 1 1 0 1 0 1 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 81600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1  0  0 -1  1  0  0 -1  0  1  0 -1  0] (Indices: [1, 2, 3, 4, 8, 9, 10, 12, 13, 14, 17, 18]), Candidate: [ 3  1  1  0  0  1  1  1  1  1 -1  2  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 81650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1  0 -1  1  0  0  0  0 -1  1 -1  0  0] (Indices: [1, 2, 3, 4, 8, 9, 11, 12, 13, 14, 15, 17]), Candidate: [3 1 1 0 0 1 1 1 1 0 1 1 1 1 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 81700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1  0 -1  1 -1  0  1  0  0  0 -1  1 -1] (Indices: [1, 2, 3, 4, 8, 9, 11, 14, 15, 16, 17, 19]), Candidate: [3 1 1 0 0 1 1 1 1 0 1 0 1 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 81750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1 -1  1  0  0  0 -1  0  1  0 -1  1 -1] (Indices: [1, 2, 3, 4, 8, 10, 11, 12, 13, 16, 17, 19]), Candidate: [3 1 1 0 0 1 1 1 0 2 0 1 1 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 81800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1 -1  1 -1  1  0 -1  1  0  0 -1  1 -1] (Indices: [1, 2, 3, 4, 8, 10, 12, 13, 15, 16, 17, 19]), Candidate: [ 3  1  1  0  0  1  1  1  0  2 -1  2  1  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 81850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1 -1  0  0  1  0 -1  1  0  0  0  0 -1] (Indices: [1, 2, 3, 4, 8, 12, 13, 15, 16, 17, 18, 19]), Candidate: [3 1 1 0 0 1 1 1 0 1 0 2 1 0 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 81900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  1  0  0 -1  1 -1  1  0 -1  1  0 -1] (Indices: [1, 2, 3, 4, 9, 10, 11, 13, 15, 16, 18, 19]), Candidate: [3 1 1 0 0 1 1 0 2 1 0 0 2 0 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 81950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  1 -1  1  0  0 -1  1 -1  1  0  0 -1] (Indices: [1, 2, 3, 4, 9, 11, 12, 13, 15, 17, 18, 19]), Candidate: [3 1 1 0 0 1 1 0 2 0 1 1 1 0 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 82000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  0  1  0 -1  0  1  0  0  0  0  0 -1] (Indices: [1, 2, 3, 4, 10, 11, 14, 15, 16, 17, 18, 19]), Candidate: [3 1 1 0 0 1 1 0 1 2 0 0 1 2 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 82050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0  0  0 -1  1  0 -1  0  0  0  1 -1  0] (Indices: [1, 2, 3, 5, 6, 7, 8, 9, 10, 12, 13, 18]), Candidate: [ 3  1  1 -1  2  1  1  0  1  1 -1  2  1  0  0  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 82100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0  0  0 -1  0  0  0  0  1 -1  1  0 -1] (Indices: [1, 2, 3, 5, 6, 7, 8, 9, 10, 16, 18, 19]), Candidate: [ 3  1  1 -1  2  1  1  0  1  1 -1  1  1  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 82150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0  0 -1  1 -1  0  0  1  0 -1  0  1 -1] (Indices: [1, 2, 3, 5, 6, 7, 8, 9, 11, 15, 16, 19]), Candidate: [ 3  1  1 -1  2  1  1  0  1  0  1  0  1  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0  0 -1  0  0  1  0 -1  0  1  0 -1  0] (Indices: [1, 2, 3, 5, 6, 7, 8, 9, 13, 14, 17, 18]), Candidate: [ 3  1  1 -1  2  1  1  0  1  0  0  1  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 82250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0 -1  1  0 -1  1  0 -1  1 -1  0  0  0] (Indices: [1, 2, 3, 5, 6, 7, 8, 10, 11, 13, 14, 16]), Candidate: [ 3  1  1 -1  2  1  1  0  0  2  0  0  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 82300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0 -1  1 -1  1 -1  1  0 -1  1 -1  0  0] (Indices: [1, 2, 3, 5, 6, 7, 8, 10, 12, 14, 15, 17]), Candidate: [ 3  1  1 -1  2  1  1  0  0  2 -1  2  0  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 82350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0 -1  1 -1  0  0  0  1  0  0 -1  1 -1] (Indices: [1, 2, 3, 5, 6, 7, 8, 10, 15, 16, 17, 19]), Candidate: [ 3  1  1 -1  2  1  1  0  0  2 -1  1  1  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 82400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0 -1  0  1 -1  1 -1  1  0 -1  1 -1  0] (Indices: [1, 2, 3, 5, 6, 7, 8, 11, 13, 15, 16, 18]), Candidate: [ 3  1  1 -1  2  1  1  0  0  1  1  0  2  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 82450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0 -1  0  0  1 -1  1 -1  1  0  0 -1  0] (Indices: [1, 2, 3, 5, 6, 7, 8, 12, 14, 16, 17, 18]), Candidate: [ 3  1  1 -1  2  1  1  0  0  1  0  2  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 82500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  1  0  0  0 -1  0  0  0  0  1  0 -1] (Indices: [1, 2, 3, 5, 6, 7, 9, 10, 11, 12, 18, 19]), Candidate: [ 3  1  1 -1  2  1  1 -1  2  1  0  1  0  1  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 82550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  1  0 -1  1  0 -1  0  0  0  1  0 -1] (Indices: [1, 2, 3, 5, 6, 7, 9, 10, 12, 13, 18, 19]), Candidate: [ 3  1  1 -1  2  1  1 -1  2  1 -1  2  1  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 82600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  1  0 -1  0  0  1 -1  0  1  0  0 -1] (Indices: [1, 2, 3, 5, 6, 7, 9, 10, 14, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  1  1 -1  2  1 -1  1  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 82650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  1 -1  1 -1  1  0 -1  0  0  1  0 -1] (Indices: [1, 2, 3, 5, 6, 7, 9, 11, 13, 14, 18, 19]), Candidate: [ 3  1  1 -1  2  1  1 -1  2  0  1  0  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 82700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  1 -1  0  1 -1  1  0 -1  1 -1  1 -1] (Indices: [1, 2, 3, 5, 6, 7, 9, 12, 14, 15, 17, 19]), Candidate: [ 3  1  1 -1  2  1  1 -1  2  0  0  2  0  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 82750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  0  1  0  0 -1  1  0 -1  0  0  1 -1] (Indices: [1, 2, 3, 5, 6, 7, 10, 11, 12, 14, 15, 19]), Candidate: [ 3  1  1 -1  2  1  1 -1  1  2  0  1  0  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 82800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  0  1  0 -1  0  0  1 -1  1  0  0 -1] (Indices: [1, 2, 3, 5, 6, 7, 10, 11, 15, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  1  1 -1  1  2  0  0  1  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 82850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  0  1 -1  0  1 -1  1 -1  1  0  0 -1] (Indices: [1, 2, 3, 5, 6, 7, 10, 13, 15, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  1  1 -1  1  2 -1  1  2  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 82900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  0  0  1 -1  1  0 -1  1  0 -1  1 -1] (Indices: [1, 2, 3, 5, 6, 7, 11, 13, 14, 16, 17, 19]), Candidate: [ 3  1  1 -1  2  1  1 -1  1  1  1  0  2  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 82950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1  0  0  0  0 -1  1 -1  0  1 -1  0  0] (Indices: [1, 2, 3, 5, 6, 8, 9, 10, 11, 12, 14, 17]), Candidate: [ 3  1  1 -1  2  1  0  1  1  1  0  1  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 83000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1  0  0 -1  1  0  0 -1  0  1 -1  0  0] (Indices: [1, 2, 3, 5, 6, 8, 9, 10, 12, 13, 14, 17]), Candidate: [ 3  1  1 -1  2  1  0  1  1  1 -1  2  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 83050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1  0  0 -1  0  1 -1  0  1  0 -1  1 -1] (Indices: [1, 2, 3, 5, 6, 8, 9, 10, 13, 16, 17, 19]), Candidate: [ 3  1  1 -1  2  1  0  1  1  1 -1  1  2  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 83100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1  0 -1  1  0 -1  0  0  1  0 -1  1 -1] (Indices: [1, 2, 3, 5, 6, 8, 9, 11, 12, 16, 17, 19]), Candidate: [ 3  1  1 -1  2  1  0  1  1  0  1  1  0  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1  0 -1  0  1  0 -1  1  0 -1  0  1 -1] (Indices: [1, 2, 3, 5, 6, 8, 9, 12, 13, 15, 16, 19]), Candidate: [ 3  1  1 -1  2  1  0  1  1  0  0  2  1  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1 -1  1  0  0  0 -1  1 -1  1 -1  0  0] (Indices: [1, 2, 3, 5, 6, 8, 10, 11, 12, 13, 15, 17]), Candidate: [ 3  1  1 -1  2  1  0  1  0  2  0  1  1  0  1  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1 -1  1  0 -1  0  1  0  0 -1  1 -1  0] (Indices: [1, 2, 3, 5, 6, 8, 10, 11, 14, 15, 16, 18]), Candidate: [ 3  1  1 -1  2  1  0  1  0  2  0  0  1  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1 -1  1 -1  0  1  0  0  0 -1  1 -1  0] (Indices: [1, 2, 3, 5, 6, 8, 10, 13, 14, 15, 16, 18]), Candidate: [ 3  1  1 -1  2  1  0  1  0  2 -1  1  2  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 83350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1 -1  0  1  0 -1  0  1  0  0  0 -1  0] (Indices: [1, 2, 3, 5, 6, 8, 11, 12, 15, 16, 17, 18]), Candidate: [ 3  1  1 -1  2  1  0  1  0  1  1  1  0  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1 -1  0  0  0  1  0  0 -1  1  0  0 -1] (Indices: [1, 2, 3, 5, 6, 8, 13, 14, 15, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  1  0  1  0  1  0  1  2  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  1  0  0 -1  1 -1  1  0 -1  1 -1  0] (Indices: [1, 2, 3, 5, 6, 9, 10, 11, 13, 15, 16, 18]), Candidate: [ 3  1  1 -1  2  1  0  0  2  1  0  0  2  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  1  0 -1  1 -1  1 -1  1  0  0 -1  0] (Indices: [1, 2, 3, 5, 6, 9, 10, 12, 14, 16, 17, 18]), Candidate: [ 3  1  1 -1  2  1  0  0  2  1 -1  2  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 83550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  1 -1  1  0 -1  1  0  0  0 -1  0  0] (Indices: [1, 2, 3, 5, 6, 9, 11, 12, 14, 15, 16, 17]), Candidate: [ 3  1  1 -1  2  1  0  0  2  0  1  1  0  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  1 -1  0  1  0 -1  0  1  0  0  0 -1] (Indices: [1, 2, 3, 5, 6, 9, 12, 13, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  1  0  0  2  0  0  2  1  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  0  1  0 -1  1  0  0  0 -1  1 -1  0] (Indices: [1, 2, 3, 5, 6, 10, 11, 13, 14, 15, 16, 18]), Candidate: [ 3  1  1 -1  2  1  0  0  1  2  0  0  2  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  0  0  1  0  0  0  0  0 -1  0  1 -1] (Indices: [1, 2, 3, 5, 6, 11, 12, 13, 14, 15, 16, 19]), Candidate: [ 3  1  1 -1  2  1  0  0  1  1  1  1  1  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0  0  0  0  0 -1  0  0  1 -1  1 -1  0] (Indices: [1, 2, 3, 5, 7, 8, 9, 10, 11, 12, 16, 18]), Candidate: [ 3  1  1 -1  2  0  2  0  1  1  0  1  0  1  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 83800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0  0  0 -1  1  0 -1  0  1 -1  1 -1  0] (Indices: [1, 2, 3, 5, 7, 8, 9, 10, 12, 13, 16, 18]), Candidate: [ 3  1  1 -1  2  0  2  0  1  1 -1  2  1  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 83850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0  0  0 -1  0  0  1  0 -1  0  1  0 -1] (Indices: [1, 2, 3, 5, 7, 8, 9, 10, 14, 15, 18, 19]), Candidate: [ 3  1  1 -1  2  0  2  0  1  1 -1  1  1  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 83900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0  0 -1  1 -1  1  0 -1  1 -1  1 -1  0] (Indices: [1, 2, 3, 5, 7, 8, 9, 11, 13, 14, 16, 18]), Candidate: [ 3  1  1 -1  2  0  2  0  1  0  1  0  2  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 83950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0  0 -1  0  1 -1  1  0  0  0 -1  0  0] (Indices: [1, 2, 3, 5, 7, 8, 9, 12, 14, 15, 16, 17]), Candidate: [ 3  1  1 -1  2  0  2  0  1  0  0  2  0  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0 -1  1  0  0  0 -1  0  0  0  1  0 -1] (Indices: [1, 2, 3, 5, 7, 8, 10, 11, 12, 13, 18, 19]), Candidate: [ 3  1  1 -1  2  0  2  0  0  2  0  1  1  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0 -1  1  0 -1  0  1 -1  0  1  0  0 -1] (Indices: [1, 2, 3, 5, 7, 8, 10, 11, 14, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  0  2  0  0  2  0  0  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 84100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0 -1  1 -1  0  1  0 -1  0  1  0  0 -1] (Indices: [1, 2, 3, 5, 7, 8, 10, 13, 14, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  0  2  0  0  2 -1  1  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 84150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0 -1  0  1 -1  1  0  0 -1  1  0 -1  0] (Indices: [1, 2, 3, 5, 7, 8, 11, 13, 14, 15, 17, 18]), Candidate: [ 3  1  1 -1  2  0  2  0  0  1  1  0  2  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  1  0  0  0  0  0 -1  0  0  0  1 -1] (Indices: [1, 2, 3, 5, 7, 9, 10, 11, 12, 13, 14, 19]), Candidate: [ 3  1  1 -1  2  0  2 -1  2  1  0  1  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 84250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  1  0  0 -1  1 -1  0  0  1  0  0 -1] (Indices: [1, 2, 3, 5, 7, 9, 10, 11, 13, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  0  2 -1  2  1  0  0  2  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 84300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  1  0 -1  1 -1  0  0  1  0  0  0 -1] (Indices: [1, 2, 3, 5, 7, 9, 10, 12, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  0  2 -1  2  1 -1  2  0  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 84350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  1 -1  1  0 -1  1 -1  1 -1  1  0 -1] (Indices: [1, 2, 3, 5, 7, 9, 11, 12, 14, 16, 18, 19]), Candidate: [ 3  1  1 -1  2  0  2 -1  2  0  1  1  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 84400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  1 -1  0  0  1  0  0  0  0 -1  1 -1] (Indices: [1, 2, 3, 5, 7, 9, 13, 14, 15, 16, 17, 19]), Candidate: [ 3  1  1 -1  2  0  2 -1  2  0  0  1  2  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 84450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  0  1  0 -1  1  0 -1  0  1  0  0 -1] (Indices: [1, 2, 3, 5, 7, 10, 11, 13, 14, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  0  2 -1  1  2  0  0  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 84500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  0  0  1  0  0 -1  1  0  0  0 -1  0] (Indices: [1, 2, 3, 5, 7, 11, 12, 13, 15, 16, 17, 18]), Candidate: [ 3  1  1 -1  2  0  2 -1  1  1  1  1  1  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 84550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1  0  0  0  0 -1  1 -1  0  0  1  0 -1] (Indices: [1, 2, 3, 5, 8, 9, 10, 11, 12, 14, 18, 19]), Candidate: [ 3  1  1 -1  2  0  1  1  1  1  0  1  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 84600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1  0  0 -1  1  0  0 -1  1  0 -1  0  0] (Indices: [1, 2, 3, 5, 8, 9, 10, 12, 13, 14, 16, 17]), Candidate: [ 3  1  1 -1  2  0  1  1  1  1 -1  2  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 84650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1  0  0 -1  0  0  1 -1  1  0  0  0 -1] (Indices: [1, 2, 3, 5, 8, 9, 10, 14, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  0  1  1  1  1 -1  1  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 84700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1  0 -1  1 -1  1 -1  1 -1  1  0  0 -1] (Indices: [1, 2, 3, 5, 8, 9, 11, 13, 15, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  0  1  1  1  0  1  0  2  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1 -1  1  0  0  0 -1  1 -1  1 -1  1 -1] (Indices: [1, 2, 3, 5, 8, 10, 11, 12, 13, 15, 17, 19]), Candidate: [ 3  1  1 -1  2  0  1  1  0  2  0  1  1  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1 -1  1 -1  1  0  0 -1  1 -1  1  0 -1] (Indices: [1, 2, 3, 5, 8, 10, 12, 13, 14, 16, 18, 19]), Candidate: [ 3  1  1 -1  2  0  1  1  0  2 -1  2  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 84850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1 -1  0  0  1  0  0  0  0 -1  1  0 -1] (Indices: [1, 2, 3, 5, 8, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 3  1  1 -1  2  0  1  1  0  1  0  2  1  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 84900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  1  0  0 -1  1  0 -1  0  1  0  0 -1] (Indices: [1, 2, 3, 5, 9, 10, 11, 13, 14, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  0  1  0  2  1  0  0  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 84950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  1 -1  1  0  0 -1  1  0  0  0 -1  0] (Indices: [1, 2, 3, 5, 9, 11, 12, 13, 15, 16, 17, 18]), Candidate: [ 3  1  1 -1  2  0  1  0  2  0  1  1  1  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  0  1  0 -1  1  0  0 -1  1  0  0 -1] (Indices: [1, 2, 3, 5, 10, 11, 13, 14, 15, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  0  1  0  1  2  0  0  2  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0  0  0  0 -1  1 -1  1 -1  0  0  1 -1] (Indices: [1, 2, 3, 6, 7, 8, 9, 10, 11, 13, 15, 19]), Candidate: [ 3  1  1 -1  1  2  1  0  1  1  0  0  2  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0  0  0 -1  1 -1  1 -1  0  1 -1  1 -1] (Indices: [1, 2, 3, 6, 7, 8, 9, 10, 12, 14, 17, 19]), Candidate: [ 3  1  1 -1  1  2  1  0  1  1 -1  2  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 85150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0  0 -1  1  0  0  0 -1  0  0  1 -1  0] (Indices: [1, 2, 3, 6, 7, 8, 9, 11, 12, 13, 14, 18]), Candidate: [ 3  1  1 -1  1  2  1  0  1  0  1  1  1  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 85200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0  0 -1  1 -1  1 -1  0  1 -1  1  0 -1] (Indices: [1, 2, 3, 6, 7, 8, 9, 11, 13, 16, 18, 19]), Candidate: [ 3  1  1 -1  1  2  1  0  1  0  1  0  2  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0  0 -1  0  1 -1  0  1 -1  1  0  0 -1] (Indices: [1, 2, 3, 6, 7, 8, 9, 12, 15, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  2  1  0  1  0  0  2  0  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0 -1  1  0  0 -1  0  1  0 -1  0  1 -1] (Indices: [1, 2, 3, 6, 7, 8, 10, 11, 12, 15, 16, 19]), Candidate: [ 3  1  1 -1  1  2  1  0  0  2  0  1  0  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0 -1  1 -1  1  0  0 -1  0  1  0 -1  0] (Indices: [1, 2, 3, 6, 7, 8, 10, 12, 13, 14, 17, 18]), Candidate: [ 3  1  1 -1  1  2  1  0  0  2 -1  2  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 85400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0 -1  0  1  0  0  0  0 -1  1 -1  0  0] (Indices: [1, 2, 3, 6, 7, 8, 11, 12, 13, 14, 15, 17]), Candidate: [ 3  1  1 -1  1  2  1  0  0  1  1  1  1  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0 -1  0  1 -1  0  1  0  0  0 -1  1 -1] (Indices: [1, 2, 3, 6, 7, 8, 11, 14, 15, 16, 17, 19]), Candidate: [ 3  1  1 -1  1  2  1  0  0  1  1  0  1  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  1  0  0  0 -1  1  0 -1  0  1 -1  0] (Indices: [1, 2, 3, 6, 7, 9, 10, 11, 12, 14, 15, 18]), Candidate: [ 3  1  1 -1  1  2  1 -1  2  1  0  1  0  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 85550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  1  0  0 -1  0  0  1  0 -1  1  0 -1] (Indices: [1, 2, 3, 6, 7, 9, 10, 11, 15, 16, 18, 19]), Candidate: [ 3  1  1 -1  1  2  1 -1  2  1  0  0  1  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 85600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  1  0 -1  0  1 -1  1  0 -1  1  0 -1] (Indices: [1, 2, 3, 6, 7, 9, 10, 13, 15, 16, 18, 19]), Candidate: [ 3  1  1 -1  1  2  1 -1  2  1 -1  1  2  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 85650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  1 -1  1 -1  1  0 -1  1  0  0 -1  0] (Indices: [1, 2, 3, 6, 7, 9, 11, 13, 14, 16, 17, 18]), Candidate: [ 3  1  1 -1  1  2  1 -1  2  0  1  0  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 85700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  0  1  0  0  0  0 -1  0  1  0 -1  0] (Indices: [1, 2, 3, 6, 7, 10, 11, 12, 13, 14, 17, 18]), Candidate: [ 3  1  1 -1  1  2  1 -1  1  2  0  1  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 85750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  0  1 -1  1  0  0  0  0 -1  1 -1  0] (Indices: [1, 2, 3, 6, 7, 10, 12, 13, 14, 15, 16, 18]), Candidate: [ 3  1  1 -1  1  2  1 -1  1  2 -1  2  1  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 85800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  0  0  1 -1  1  0  0  0 -1  1  0 -1] (Indices: [1, 2, 3, 6, 7, 11, 13, 14, 15, 16, 18, 19]), Candidate: [ 3  1  1 -1  1  2  1 -1  1  1  1  0  2  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 85850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1  0  0  0 -1  1  0  0 -1  0  1 -1  0] (Indices: [1, 2, 3, 6, 8, 9, 10, 11, 13, 14, 15, 18]), Candidate: [ 3  1  1 -1  1  2  0  1  1  1  0  0  2  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 85900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1  0  0 -1  1  0 -1  0  1  0 -1  1 -1] (Indices: [1, 2, 3, 6, 8, 9, 10, 12, 13, 16, 17, 19]), Candidate: [ 3  1  1 -1  1  2  0  1  1  1 -1  2  1  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 85950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1  0 -1  1  0  0 -1  1  0 -1  1 -1  0] (Indices: [1, 2, 3, 6, 8, 9, 11, 12, 13, 15, 16, 18]), Candidate: [ 3  1  1 -1  1  2  0  1  1  0  1  1  1  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1  0 -1  0  1  0  0  0 -1  0  1  0 -1] (Indices: [1, 2, 3, 6, 8, 9, 12, 13, 14, 15, 18, 19]), Candidate: [ 3  1  1 -1  1  2  0  1  1  0  0  2  1  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1 -1  1  0  0 -1  1 -1  1  0 -1  1 -1] (Indices: [1, 2, 3, 6, 8, 10, 11, 12, 14, 16, 17, 19]), Candidate: [ 3  1  1 -1  1  2  0  1  0  2  0  1  0  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 86100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1 -1  1 -1  0  1  0  0  0  0  0 -1  0] (Indices: [1, 2, 3, 6, 8, 10, 13, 14, 15, 16, 17, 18]), Candidate: [ 3  1  1 -1  1  2  0  1  0  2 -1  1  2  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 86150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  1  0  0  0  0  0 -1  0  1  0 -1  0] (Indices: [1, 2, 3, 6, 9, 10, 11, 12, 13, 14, 17, 18]), Candidate: [ 3  1  1 -1  1  2  0  0  2  1  0  1  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 86200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  1  0 -1  1  0  0  0  0 -1  1 -1  0] (Indices: [1, 2, 3, 6, 9, 10, 12, 13, 14, 15, 16, 18]), Candidate: [ 3  1  1 -1  1  2  0  0  2  1 -1  2  1  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 86250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  1 -1  1 -1  1  0  0  0 -1  1  0 -1] (Indices: [1, 2, 3, 6, 9, 11, 13, 14, 15, 16, 18, 19]), Candidate: [ 3  1  1 -1  1  2  0  0  2  0  1  0  2  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  0  0  1  0  0  0  0  0  0 -1  1 -1] (Indices: [1, 2, 3, 6, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 3  1  1 -1  1  2  0  0  1  1  1  1  1  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0  0  0  0 -1  1  0 -1  0  1  0 -1  0] (Indices: [1, 2, 3, 7, 8, 9, 10, 11, 13, 14, 17, 18]), Candidate: [ 3  1  1 -1  1  1  2  0  1  1  0  0  2  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 86400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0  0  0 -1  1 -1  1  0  0 -1  0  1 -1] (Indices: [1, 2, 3, 7, 8, 9, 10, 12, 14, 15, 16, 19]), Candidate: [ 3  1  1 -1  1  1  2  0  1  1 -1  2  0  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 86450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0  0 -1  1  0  0 -1  0  1  0  0 -1  0] (Indices: [1, 2, 3, 7, 8, 9, 11, 12, 13, 16, 17, 18]), Candidate: [ 3  1  1 -1  1  1  2  0  1  0  1  1  1  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0  0 -1  0  1  0 -1  1  0  0  0 -1  0] (Indices: [1, 2, 3, 7, 8, 9, 12, 13, 15, 16, 17, 18]), Candidate: [ 3  1  1 -1  1  1  2  0  1  0  0  2  1  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0 -1  1  0  0 -1  0  1  0 -1  1  0 -1] (Indices: [1, 2, 3, 7, 8, 10, 11, 12, 15, 16, 18, 19]), Candidate: [ 3  1  1 -1  1  1  2  0  0  2  0  1  0  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0 -1  1 -1  0  1 -1  1  0  0  0  0 -1] (Indices: [1, 2, 3, 7, 8, 10, 13, 15, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  1  2  0  0  2 -1  1  2  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 86650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  1  0  0  0  0 -1  1  0 -1  0  1 -1] (Indices: [1, 2, 3, 7, 9, 10, 11, 12, 13, 15, 16, 19]), Candidate: [ 3  1  1 -1  1  1  2 -1  2  1  0  1  1  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 86700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  1  0 -1  1  0  0 -1  1  0  0 -1  0] (Indices: [1, 2, 3, 7, 9, 10, 12, 13, 14, 16, 17, 18]), Candidate: [ 3  1  1 -1  1  1  2 -1  2  1 -1  2  1  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 86750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  1 -1  0  1  0  0  0  0  0  0 -1  0] (Indices: [1, 2, 3, 7, 9, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 3  1  1 -1  1  1  2 -1  2  0  0  2  1  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 86800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  0  0  1  0 -1  1  0  0  0  0  0 -1] (Indices: [1, 2, 3, 7, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  1  2 -1  1  1  1  1  0  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 86850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1  0  0  0 -1  1 -1  1  0 -1  1  0 -1] (Indices: [1, 2, 3, 8, 9, 10, 11, 13, 15, 16, 18, 19]), Candidate: [ 3  1  1 -1  1  1  1  1  1  1  0  0  2  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1  0 -1  1  0  0 -1  1 -1  1  0  0 -1] (Indices: [1, 2, 3, 8, 9, 11, 12, 13, 15, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  1  1  1  1  0  1  1  1  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 86950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1 -1  1  0 -1  0  1  0  0  0  0  0 -1] (Indices: [1, 2, 3, 8, 10, 11, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  1  1  1  0  2  0  0  1  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  1  0 -1  1  0  0 -1  1  0  0  0 -1] (Indices: [1, 2, 3, 9, 10, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  1  1  0  2  1 -1  2  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 87050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0  0  0  0 -1  0  0  0  0  0  1  0 -1] (Indices: [1, 2, 4, 5, 6, 7, 8, 9, 10, 11, 18, 19]), Candidate: [3 1 0 1 1 1 1 0 1 1 0 0 1 1 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 87100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0  0  0 -1  0  0  0  1 -1  1  0 -1  0] (Indices: [1, 2, 4, 5, 6, 7, 8, 9, 10, 15, 17, 18]), Candidate: [ 3  1  0  1  1  1  1  0  1  1 -1  1  1  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0  0 -1  1 -1  0  1 -1  0  1  0 -1  0] (Indices: [1, 2, 4, 5, 6, 7, 8, 9, 11, 14, 17, 18]), Candidate: [ 3  1  0  1  1  1  1  0  1  0  1  0  1  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0  0 -1  0  0  1  0  0 -1  0  1 -1  0] (Indices: [1, 2, 4, 5, 6, 7, 8, 9, 13, 14, 15, 18]), Candidate: [3 1 0 1 1 1 1 0 1 0 0 1 2 1 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 87250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0 -1  1  0  0 -1  0  0  1 -1  0  1 -1] (Indices: [1, 2, 4, 5, 6, 7, 8, 10, 11, 12, 16, 19]), Candidate: [3 1 0 1 1 1 1 0 0 2 0 1 0 1 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 87300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0 -1  1 -1  1  0 -1  0  1 -1  0  1 -1] (Indices: [1, 2, 4, 5, 6, 7, 8, 10, 12, 13, 16, 19]), Candidate: [ 3  1  0  1  1  1  1  0  0  2 -1  2  1  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0 -1  1 -1  0  0  1 -1  1  0  0 -1  0] (Indices: [1, 2, 4, 5, 6, 7, 8, 10, 14, 16, 17, 18]), Candidate: [ 3  1  0  1  1  1  1  0  0  2 -1  1  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 87400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0 -1  0  1 -1  1  0 -1  1 -1  0  1 -1] (Indices: [1, 2, 4, 5, 6, 7, 8, 11, 13, 14, 16, 19]), Candidate: [ 3  1  0  1  1  1  1  0  0  1  1  0  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0 -1  0  0  1 -1  1  0  0 -1  1 -1  0] (Indices: [1, 2, 4, 5, 6, 7, 8, 12, 14, 15, 16, 18]), Candidate: [3 1 0 1 1 1 1 0 0 1 0 2 0 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 87500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  1  0  0  0 -1  0  0  1  0 -1  0  0] (Indices: [1, 2, 4, 5, 6, 7, 9, 10, 11, 12, 16, 17]), Candidate: [ 3  1  0  1  1  1  1 -1  2  1  0  1  0  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  1  0 -1  1  0 -1  0  1  0 -1  0  0] (Indices: [1, 2, 4, 5, 6, 7, 9, 10, 12, 13, 16, 17]), Candidate: [ 3  1  0  1  1  1  1 -1  2  1 -1  2  1  0  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 87600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  1  0 -1  0  0  1  0 -1  1 -1  1 -1] (Indices: [1, 2, 4, 5, 6, 7, 9, 10, 14, 15, 17, 19]), Candidate: [ 3  1  0  1  1  1  1 -1  2  1 -1  1  1  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 87650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  1 -1  1 -1  1  0 -1  1  0 -1  0  0] (Indices: [1, 2, 4, 5, 6, 7, 9, 11, 13, 14, 16, 17]), Candidate: [ 3  1  0  1  1  1  1 -1  2  0  1  0  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 87700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  1 -1  0  1  0 -1  0  0  1  0  0 -1] (Indices: [1, 2, 4, 5, 6, 7, 9, 12, 13, 17, 18, 19]), Candidate: [ 3  1  0  1  1  1  1 -1  2  0  0  2  1  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  0  1  0  0  0 -1  0  0  1 -1  1 -1] (Indices: [1, 2, 4, 5, 6, 7, 10, 11, 12, 13, 17, 19]), Candidate: [ 3  1  0  1  1  1  1 -1  1  2  0  1  1  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  0  1  0 -1  0  1 -1  1 -1  1  0 -1] (Indices: [1, 2, 4, 5, 6, 7, 10, 11, 14, 16, 18, 19]), Candidate: [ 3  1  0  1  1  1  1 -1  1  2  0  0  1  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 87850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  0  1 -1  0  1  0 -1  1 -1  1  0 -1] (Indices: [1, 2, 4, 5, 6, 7, 10, 13, 14, 16, 18, 19]), Candidate: [ 3  1  0  1  1  1  1 -1  1  2 -1  1  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 87900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  0  0  1 -1  1  0  0  0 -1  0  1 -1] (Indices: [1, 2, 4, 5, 6, 7, 11, 13, 14, 15, 16, 19]), Candidate: [ 3  1  0  1  1  1  1 -1  1  1  1  0  2  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 87950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1  0  0  0  0  0 -1  0  0  1 -1  0  0] (Indices: [1, 2, 4, 5, 6, 8, 9, 10, 11, 12, 13, 17]), Candidate: [3 1 0 1 1 1 0 1 1 1 0 1 1 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 88000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1  0  0  0 -1  0  0  0  1  0 -1  1 -1] (Indices: [1, 2, 4, 5, 6, 8, 9, 10, 11, 16, 17, 19]), Candidate: [3 1 0 1 1 1 0 1 1 1 0 0 1 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 88050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1  0  0 -1  0  1 -1  1  0 -1  0  1 -1] (Indices: [1, 2, 4, 5, 6, 8, 9, 10, 13, 15, 16, 19]), Candidate: [ 3  1  0  1  1  1  0  1  1  1 -1  1  2  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1  0 -1  1  0 -1  0  1  0 -1  0  1 -1] (Indices: [1, 2, 4, 5, 6, 8, 9, 11, 12, 15, 16, 19]), Candidate: [3 1 0 1 1 1 0 1 1 0 1 1 0 1 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 88150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1  0 -1  0  1  0  0 -1  0  1  0 -1  0] (Indices: [1, 2, 4, 5, 6, 8, 9, 12, 13, 14, 17, 18]), Candidate: [ 3  1  0  1  1  1  0  1  1  0  0  2  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1 -1  1  0  0  0  0 -1  1 -1  0  0  0] (Indices: [1, 2, 4, 5, 6, 8, 10, 11, 12, 13, 14, 16]), Candidate: [ 3  1  0  1  1  1  0  1  0  2  0  1  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1 -1  1  0 -1  1 -1  0  1  0  0 -1  0] (Indices: [1, 2, 4, 5, 6, 8, 10, 11, 13, 16, 17, 18]), Candidate: [3 1 0 1 1 1 0 1 0 2 0 0 2 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 88300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1 -1  1 -1  1 -1  0  1  0  0 -1  1 -1] (Indices: [1, 2, 4, 5, 6, 8, 10, 12, 15, 16, 17, 19]), Candidate: [ 3  1  0  1  1  1  0  1  0  2 -1  2  0  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1 -1  0  1  0 -1  1  0 -1  0  1  0 -1] (Indices: [1, 2, 4, 5, 6, 8, 11, 12, 14, 15, 18, 19]), Candidate: [3 1 0 1 1 1 0 1 0 1 1 1 0 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 88400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1 -1  0  0  1 -1  1 -1  1  0  0  0 -1] (Indices: [1, 2, 4, 5, 6, 8, 12, 14, 16, 17, 18, 19]), Candidate: [ 3  1  0  1  1  1  0  1  0  1  0  2  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  1  0  0 -1  1  0 -1  1 -1  0  1 -1] (Indices: [1, 2, 4, 5, 6, 9, 10, 11, 13, 14, 16, 19]), Candidate: [ 3  1  0  1  1  1  0  0  2  1  0  0  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  1  0 -1  1 -1  1  0  0 -1  1 -1  0] (Indices: [1, 2, 4, 5, 6, 9, 10, 12, 14, 15, 16, 18]), Candidate: [ 3  1  0  1  1  1  0  0  2  1 -1  2  0  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  1 -1  1  0  0 -1  1 -1  0  1  0 -1] (Indices: [1, 2, 4, 5, 6, 9, 11, 12, 13, 15, 18, 19]), Candidate: [3 1 0 1 1 1 0 0 2 0 1 1 1 0 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 88600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  1 -1  0  1  0  0 -1  0  1  0  0 -1] (Indices: [1, 2, 4, 5, 6, 9, 12, 13, 14, 17, 18, 19]), Candidate: [ 3  1  0  1  1  1  0  0  2  0  0  2  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  0  1  0  0 -1  0  1  0  0 -1  1 -1] (Indices: [1, 2, 4, 5, 6, 10, 11, 12, 15, 16, 17, 19]), Candidate: [3 1 0 1 1 1 0 0 1 2 0 1 0 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 88700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  0  1 -1  0  1  0 -1  1  0  0  0 -1] (Indices: [1, 2, 4, 5, 6, 10, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  1  0  1  1  1  0  0  1  2 -1  1  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 88750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0  0  0  0  0 -1  0  1  0 -1  0  0  0] (Indices: [1, 2, 4, 5, 7, 8, 9, 10, 11, 12, 15, 16]), Candidate: [3 1 0 1 1 0 2 0 1 1 0 1 0 1 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 88800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0  0  0 -1  1  0 -1  1  0 -1  0  0  0] (Indices: [1, 2, 4, 5, 7, 8, 9, 10, 12, 13, 15, 16]), Candidate: [ 3  1  0  1  1  0  2  0  1  1 -1  2  1  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0  0  0 -1  0  0  1  0  0  0 -1  0  0] (Indices: [1, 2, 4, 5, 7, 8, 9, 10, 14, 15, 16, 17]), Candidate: [ 3  1  0  1  1  0  2  0  1  1 -1  1  1  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 88900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0  0 -1  1 -1  1  0  0  0 -1  0  0  0] (Indices: [1, 2, 4, 5, 7, 8, 9, 11, 13, 14, 15, 16]), Candidate: [3 1 0 1 1 0 2 0 1 0 1 0 2 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 88950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0  0 -1  0  1  0 -1  1 -1  0  1  0 -1] (Indices: [1, 2, 4, 5, 7, 8, 9, 12, 13, 15, 18, 19]), Candidate: [3 1 0 1 1 0 2 0 1 0 0 2 1 0 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 89000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0 -1  1  0  0  0 -1  0  1  0 -1  0  0] (Indices: [1, 2, 4, 5, 7, 8, 10, 11, 12, 13, 16, 17]), Candidate: [3 1 0 1 1 0 2 0 0 2 0 1 1 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 89050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0 -1  1  0 -1  0  1  0 -1  1 -1  1 -1] (Indices: [1, 2, 4, 5, 7, 8, 10, 11, 14, 15, 17, 19]), Candidate: [3 1 0 1 1 0 2 0 0 2 0 0 1 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 89100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0 -1  1 -1  0  1  0  0 -1  1 -1  1 -1] (Indices: [1, 2, 4, 5, 7, 8, 10, 13, 14, 15, 17, 19]), Candidate: [ 3  1  0  1  1  0  2  0  0  2 -1  1  2  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0 -1  0  1  0 -1  0  1 -1  1  0  0 -1] (Indices: [1, 2, 4, 5, 7, 8, 11, 12, 15, 17, 18, 19]), Candidate: [3 1 0 1 1 0 2 0 0 1 1 1 0 1 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 89200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0 -1  0  0  0  0  1  0  0  0  0  0 -1] (Indices: [1, 2, 4, 5, 7, 8, 14, 15, 16, 17, 18, 19]), Candidate: [3 1 0 1 1 0 2 0 0 1 0 1 1 2 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 89250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  1  0  0 -1  1 -1  1 -1  1 -1  1 -1] (Indices: [1, 2, 4, 5, 7, 9, 10, 11, 13, 15, 17, 19]), Candidate: [ 3  1  0  1  1  0  2 -1  2  1  0  0  2  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  1  0 -1  1 -1  1 -1  0  1  0  0 -1] (Indices: [1, 2, 4, 5, 7, 9, 10, 12, 14, 17, 18, 19]), Candidate: [ 3  1  0  1  1  0  2 -1  2  1 -1  2  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 89350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  1 -1  1  0 -1  1  0 -1  1  0 -1  0] (Indices: [1, 2, 4, 5, 7, 9, 11, 12, 14, 15, 17, 18]), Candidate: [ 3  1  0  1  1  0  2 -1  2  0  1  1  0  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  1 -1  0  1 -1  1  0  0 -1  1  0 -1] (Indices: [1, 2, 4, 5, 7, 9, 12, 14, 15, 16, 18, 19]), Candidate: [ 3  1  0  1  1  0  2 -1  2  0  0  2  0  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  0  1  0 -1  1  0  0 -1  1 -1  1 -1] (Indices: [1, 2, 4, 5, 7, 10, 11, 13, 14, 15, 17, 19]), Candidate: [ 3  1  0  1  1  0  2 -1  1  2  0  0  2  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  0  0  1  0  0  0  0 -1  0  1  0 -1] (Indices: [1, 2, 4, 5, 7, 11, 12, 13, 14, 15, 18, 19]), Candidate: [ 3  1  0  1  1  0  2 -1  1  1  1  1  1  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1  0  0  0  0 -1  1 -1  1  0 -1  0  0] (Indices: [1, 2, 4, 5, 8, 9, 10, 11, 12, 14, 16, 17]), Candidate: [ 3  1  0  1  1  0  1  1  1  1  0  1  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1  0  0  0 -1  0  0  0  1  0  0  0 -1] (Indices: [1, 2, 4, 5, 8, 9, 10, 11, 16, 17, 18, 19]), Candidate: [3 1 0 1 1 0 1 1 1 1 0 0 1 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 89650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1  0  0 -1  0  1 -1  0  1  0  0  0 -1] (Indices: [1, 2, 4, 5, 8, 9, 10, 13, 16, 17, 18, 19]), Candidate: [ 3  1  0  1  1  0  1  1  1  1 -1  1  2  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1  0 -1  1 -1  1  0 -1  1 -1  1  0 -1] (Indices: [1, 2, 4, 5, 8, 9, 11, 13, 14, 16, 18, 19]), Candidate: [ 3  1  0  1  1  0  1  1  1  0  1  0  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1 -1  1  0  0  0  0 -1  0  0  1  0 -1] (Indices: [1, 2, 4, 5, 8, 10, 11, 12, 13, 14, 18, 19]), Candidate: [ 3  1  0  1  1  0  1  1  0  2  0  1  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1 -1  1 -1  1  0  0  0 -1  1  0 -1  0] (Indices: [1, 2, 4, 5, 8, 10, 12, 13, 14, 15, 17, 18]), Candidate: [ 3  1  0  1  1  0  1  1  0  2 -1  2  1  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1 -1  0  1 -1  1  0 -1  1  0  0  0 -1] (Indices: [1, 2, 4, 5, 8, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  1  0  1  1  0  1  1  0  1  1  0  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 89900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  1  0  0 -1  1  0  0 -1  1 -1  1 -1] (Indices: [1, 2, 4, 5, 9, 10, 11, 13, 14, 15, 17, 19]), Candidate: [3 1 0 1 1 0 1 0 2 1 0 0 2 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 89950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  1 -1  1  0  0  0  0 -1  0  1  0 -1] (Indices: [1, 2, 4, 5, 9, 11, 12, 13, 14, 15, 18, 19]), Candidate: [3 1 0 1 1 0 1 0 2 0 1 1 1 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 90000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  0  1  0  0 -1  1 -1  1  0  0  0 -1] (Indices: [1, 2, 4, 5, 10, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 3  1  0  1  1  0  1  0  1  2  0  1  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0  0  0  0 -1  1  0 -1  0  0  1 -1  0] (Indices: [1, 2, 4, 6, 7, 8, 9, 10, 11, 13, 14, 18]), Candidate: [ 3  1  0  1  0  2  1  0  1  1  0  0  2  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0  0  0 -1  1 -1  1  0 -1  0  0  1 -1] (Indices: [1, 2, 4, 6, 7, 8, 9, 10, 12, 14, 15, 19]), Candidate: [ 3  1  0  1  0  2  1  0  1  1 -1  2  0  2  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0  0  0 -1  0  0  0  1 -1  1  0  0 -1] (Indices: [1, 2, 4, 6, 7, 8, 9, 10, 15, 17, 18, 19]), Candidate: [ 3  1  0  1  0  2  1  0  1  1 -1  1  1  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0  0 -1  1 -1  1 -1  1 -1  1  0 -1  0] (Indices: [1, 2, 4, 6, 7, 8, 9, 11, 13, 15, 17, 18]), Candidate: [3 1 0 1 0 2 1 0 1 0 1 0 2 0 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 90250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0  0 -1  0  1 -1  1 -1  1 -1  1  0 -1] (Indices: [1, 2, 4, 6, 7, 8, 9, 12, 14, 16, 18, 19]), Candidate: [ 3  1  0  1  0  2  1  0  1  0  0  2  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0 -1  1  0  0 -1  1 -1  0  1  0 -1  0] (Indices: [1, 2, 4, 6, 7, 8, 10, 11, 12, 14, 17, 18]), Candidate: [ 3  1  0  1  0  2  1  0  0  2  0  1  0  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0 -1  1 -1  1  0  0  0 -1  0  1 -1  0] (Indices: [1, 2, 4, 6, 7, 8, 10, 12, 13, 14, 15, 18]), Candidate: [ 3  1  0  1  0  2  1  0  0  2 -1  2  1  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0 -1  1 -1  0  0  1  0  0 -1  1  0 -1] (Indices: [1, 2, 4, 6, 7, 8, 10, 14, 15, 16, 18, 19]), Candidate: [ 3  1  0  1  0  2  1  0  0  2 -1  1  1  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0 -1  0  1 -1  1 -1  1  0  0 -1  1 -1] (Indices: [1, 2, 4, 6, 7, 8, 11, 13, 15, 16, 17, 19]), Candidate: [3 1 0 1 0 2 1 0 0 1 1 0 2 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 90500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  1  0  0  0  0 -1  0  0  1  0 -1  0] (Indices: [1, 2, 4, 6, 7, 9, 10, 11, 12, 13, 17, 18]), Candidate: [ 3  1  0  1  0  2  1 -1  2  1  0  1  1  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  1  0  0 -1  0  1 -1  1  0 -1  1 -1] (Indices: [1, 2, 4, 6, 7, 9, 10, 11, 14, 16, 17, 19]), Candidate: [ 3  1  0  1  0  2  1 -1  2  1  0  0  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 90600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  1  0 -1  0  1  0 -1  1  0 -1  1 -1] (Indices: [1, 2, 4, 6, 7, 9, 10, 13, 14, 16, 17, 19]), Candidate: [ 3  1  0  1  0  2  1 -1  2  1 -1  1  2  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 90650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  1 -1  1 -1  1  0  0  0 -1  1 -1  0] (Indices: [1, 2, 4, 6, 7, 9, 11, 13, 14, 15, 16, 18]), Candidate: [ 3  1  0  1  0  2  1 -1  2  0  1  0  2  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  0  1  0  0  0  0  0 -1  0  1 -1  0] (Indices: [1, 2, 4, 6, 7, 10, 11, 12, 13, 14, 15, 18]), Candidate: [ 3  1  0  1  0  2  1 -1  1  2  0  1  1  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  0  1  0 -1  0  1  0  0 -1  1  0 -1] (Indices: [1, 2, 4, 6, 7, 10, 11, 14, 15, 16, 18, 19]), Candidate: [ 3  1  0  1  0  2  1 -1  1  2  0  0  1  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  0  0  1  0 -1  1  0 -1  1  0  0 -1] (Indices: [1, 2, 4, 6, 7, 11, 12, 14, 15, 17, 18, 19]), Candidate: [ 3  1  0  1  0  2  1 -1  1  1  1  1  0  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1  0  0  0  0 -1  0  0  1  0 -1  1 -1] (Indices: [1, 2, 4, 6, 8, 9, 10, 11, 12, 16, 17, 19]), Candidate: [3 1 0 1 0 2 0 1 1 1 0 1 0 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 90900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1  0  0 -1  1  0 -1  1  0 -1  0  1 -1] (Indices: [1, 2, 4, 6, 8, 9, 10, 12, 13, 15, 16, 19]), Candidate: [ 3  1  0  1  0  2  0  1  1  1 -1  2  1  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 90950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1  0 -1  1  0  0  0 -1  1 -1  0  1 -1] (Indices: [1, 2, 4, 6, 8, 9, 11, 12, 13, 14, 16, 19]), Candidate: [ 3  1  0  1  0  2  0  1  1  0  1  1  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1  0 -1  0  1  0  0  0  0  0 -1  0  0] (Indices: [1, 2, 4, 6, 8, 9, 12, 13, 14, 15, 16, 17]), Candidate: [3 1 0 1 0 2 0 1 1 0 0 2 1 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 91050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1 -1  1  0  0 -1  1  0  0 -1  0  1 -1] (Indices: [1, 2, 4, 6, 8, 10, 11, 12, 14, 15, 16, 19]), Candidate: [3 1 0 1 0 2 0 1 0 2 0 1 0 2 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 91100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1 -1  1 -1  1 -1  1  0  0  0 -1  1 -1] (Indices: [1, 2, 4, 6, 8, 10, 12, 14, 15, 16, 17, 19]), Candidate: [ 3  1  0  1  0  2  0  1  0  2 -1  2  0  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  1  0  0  0  0  0  0 -1  0  1 -1  0] (Indices: [1, 2, 4, 6, 9, 10, 11, 12, 13, 14, 15, 18]), Candidate: [3 1 0 1 0 2 0 0 2 1 0 1 1 1 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 91200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  1  0  0 -1  0  1  0  0 -1  1  0 -1] (Indices: [1, 2, 4, 6, 9, 10, 11, 14, 15, 16, 18, 19]), Candidate: [3 1 0 1 0 2 0 0 2 1 0 0 1 2 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 91250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  1 -1  1  0 -1  1  0 -1  1  0  0 -1] (Indices: [1, 2, 4, 6, 9, 11, 12, 14, 15, 17, 18, 19]), Candidate: [3 1 0 1 0 2 0 0 2 0 1 1 0 2 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 91300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  0  1 -1  1  0  0 -1  1  0  0  0 -1] (Indices: [1, 2, 4, 6, 10, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  1  0  1  0  2  0  0  1  2 -1  2  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 91350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0  0  0  0 -1  1  0  0 -1  0  1 -1  0] (Indices: [1, 2, 4, 7, 8, 9, 10, 11, 13, 14, 15, 18]), Candidate: [3 1 0 1 0 1 2 0 1 1 0 0 2 1 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 91400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0  0  0 -1  1  0 -1  0  1  0 -1  1 -1] (Indices: [1, 2, 4, 7, 8, 9, 10, 12, 13, 16, 17, 19]), Candidate: [ 3  1  0  1  0  1  2  0  1  1 -1  2  1  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0  0 -1  1  0  0 -1  1  0 -1  1 -1  0] (Indices: [1, 2, 4, 7, 8, 9, 11, 12, 13, 15, 16, 18]), Candidate: [3 1 0 1 0 1 2 0 1 0 1 1 1 0 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 91500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0  0 -1  0  1  0  0  0 -1  0  1  0 -1] (Indices: [1, 2, 4, 7, 8, 9, 12, 13, 14, 15, 18, 19]), Candidate: [3 1 0 1 0 1 2 0 1 0 0 2 1 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 91550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0 -1  1  0  0 -1  1 -1  1  0 -1  1 -1] (Indices: [1, 2, 4, 7, 8, 10, 11, 12, 14, 16, 17, 19]), Candidate: [ 3  1  0  1  0  1  2  0  0  2  0  1  0  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0 -1  1 -1  0  1  0  0  0  0  0 -1  0] (Indices: [1, 2, 4, 7, 8, 10, 13, 14, 15, 16, 17, 18]), Candidate: [ 3  1  0  1  0  1  2  0  0  2 -1  1  2  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  1  0  0  0  0  0 -1  0  1  0 -1  0] (Indices: [1, 2, 4, 7, 9, 10, 11, 12, 13, 14, 17, 18]), Candidate: [ 3  1  0  1  0  1  2 -1  2  1  0  1  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 91700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  1  0 -1  1  0  0  0  0 -1  1 -1  0] (Indices: [1, 2, 4, 7, 9, 10, 12, 13, 14, 15, 16, 18]), Candidate: [ 3  1  0  1  0  1  2 -1  2  1 -1  2  1  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 91750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  1 -1  1 -1  1  0  0  0 -1  1  0 -1] (Indices: [1, 2, 4, 7, 9, 11, 13, 14, 15, 16, 18, 19]), Candidate: [ 3  1  0  1  0  1  2 -1  2  0  1  0  2  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  0  0  1  0  0  0  0  0  0 -1  1 -1] (Indices: [1, 2, 4, 7, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 3  1  0  1  0  1  2 -1  1  1  1  1  1  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1  0  0  0 -1  1  0 -1  1  0 -1  1 -1] (Indices: [1, 2, 4, 8, 9, 10, 11, 13, 14, 16, 17, 19]), Candidate: [ 3  1  0  1  0  1  1  1  1  1  0  0  2  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1  0 -1  1  0  0  0 -1  1 -1  1  0 -1] (Indices: [1, 2, 4, 8, 9, 11, 12, 13, 14, 16, 18, 19]), Candidate: [ 3  1  0  1  0  1  1  1  1  0  1  1  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 91950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1 -1  1  0 -1  1  0  0  0  0 -1  1 -1] (Indices: [1, 2, 4, 8, 10, 11, 13, 14, 15, 16, 17, 19]), Candidate: [3 1 0 1 0 1 1 1 0 2 0 0 2 1 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 92000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  0  1  0  0 -1  0  1  0  0  0  0  0 -1] (Indices: [1, 2, 4, 9, 10, 11, 14, 15, 16, 17, 18, 19]), Candidate: [3 1 0 1 0 1 1 0 2 1 0 0 1 2 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 92050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0  0  0  0 -1  1  0 -1  1 -1  0  0  0] (Indices: [1, 2, 5, 6, 7, 8, 9, 10, 11, 13, 14, 16]), Candidate: [ 3  1  0  0  2  1  1  0  1  1  0  0  2  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0  0  0 -1  1 -1  1  0 -1  1 -1  0  0] (Indices: [1, 2, 5, 6, 7, 8, 9, 10, 12, 14, 15, 17]), Candidate: [ 3  1  0  0  2  1  1  0  1  1 -1  2  0  2  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0  0  0 -1  0  0  0  1  0  0 -1  1 -1] (Indices: [1, 2, 5, 6, 7, 8, 9, 10, 15, 16, 17, 19]), Candidate: [ 3  1  0  0  2  1  1  0  1  1 -1  1  1  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0  0 -1  1 -1  1 -1  1  0 -1  1 -1  0] (Indices: [1, 2, 5, 6, 7, 8, 9, 11, 13, 15, 16, 18]), Candidate: [3 1 0 0 2 1 1 0 1 0 1 0 2 0 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 92250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0  0 -1  0  1 -1  1 -1  1  0  0 -1  0] (Indices: [1, 2, 5, 6, 7, 8, 9, 12, 14, 16, 17, 18]), Candidate: [ 3  1  0  0  2  1  1  0  1  0  0  2  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0 -1  1  0  0 -1  1 -1  1 -1  1 -1  0] (Indices: [1, 2, 5, 6, 7, 8, 10, 11, 12, 14, 16, 18]), Candidate: [ 3  1  0  0  2  1  1  0  0  2  0  1  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0 -1  1 -1  1  0  0  0  0 -1  0  0  0] (Indices: [1, 2, 5, 6, 7, 8, 10, 12, 13, 14, 15, 16]), Candidate: [ 3  1  0  0  2  1  1  0  0  2 -1  2  1  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0 -1  1 -1  0  0  1  0  0  0  0 -1  0] (Indices: [1, 2, 5, 6, 7, 8, 10, 14, 15, 16, 17, 18]), Candidate: [ 3  1  0  0  2  1  1  0  0  2 -1  1  1  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0 -1  0  1 -1  1  0 -1  0  1  0  0 -1] (Indices: [1, 2, 5, 6, 7, 8, 11, 13, 14, 17, 18, 19]), Candidate: [ 3  1  0  0  2  1  1  0  0  1  1  0  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  1  0  0  0  0 -1  0  1 -1  1 -1  0] (Indices: [1, 2, 5, 6, 7, 9, 10, 11, 12, 13, 16, 18]), Candidate: [ 3  1  0  0  2  1  1 -1  2  1  0  1  1  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  1  0  0 -1  0  1  0 -1  0  1  0 -1] (Indices: [1, 2, 5, 6, 7, 9, 10, 11, 14, 15, 18, 19]), Candidate: [ 3  1  0  0  2  1  1 -1  2  1  0  0  1  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  1  0 -1  0  1  0  0 -1  0  1  0 -1] (Indices: [1, 2, 5, 6, 7, 9, 10, 13, 14, 15, 18, 19]), Candidate: [ 3  1  0  0  2  1  1 -1  2  1 -1  1  2  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 92650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  1 -1  1  0 -1  0  0  1  0  0  0 -1] (Indices: [1, 2, 5, 6, 7, 9, 11, 12, 16, 17, 18, 19]), Candidate: [ 3  1  0  0  2  1  1 -1  2  0  1  1  0  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  0  1  0  0  0  0  0  0 -1  0  0  0] (Indices: [1, 2, 5, 6, 7, 10, 11, 12, 13, 14, 15, 16]), Candidate: [ 3  1  0  0  2  1  1 -1  1  2  0  1  1  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  0  1  0 -1  0  1  0  0  0  0 -1  0] (Indices: [1, 2, 5, 6, 7, 10, 11, 14, 15, 16, 17, 18]), Candidate: [ 3  1  0  0  2  1  1 -1  1  2  0  0  1  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  0  0  1  0 -1  1  0  0  0 -1  1 -1] (Indices: [1, 2, 5, 6, 7, 11, 12, 14, 15, 16, 17, 19]), Candidate: [ 3  1  0  0  2  1  1 -1  1  1  1  1  0  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1  0  0  0  0 -1  0  1 -1  0  1  0 -1] (Indices: [1, 2, 5, 6, 8, 9, 10, 11, 12, 15, 18, 19]), Candidate: [3 1 0 0 2 1 0 1 1 1 0 1 0 1 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 92900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1  0  0 -1  1  0 -1  1  0  0 -1  0  0] (Indices: [1, 2, 5, 6, 8, 9, 10, 12, 13, 15, 16, 17]), Candidate: [ 3  1  0  0  2  1  0  1  1  1 -1  2  1  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 92950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1  0 -1  1  0  0  0 -1  1  0 -1  0  0] (Indices: [1, 2, 5, 6, 8, 9, 11, 12, 13, 14, 16, 17]), Candidate: [ 3  1  0  0  2  1  0  1  1  0  1  1  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1  0 -1  1 -1  0  1 -1  1  0  0  0 -1] (Indices: [1, 2, 5, 6, 8, 9, 11, 14, 16, 17, 18, 19]), Candidate: [ 3  1  0  0  2  1  0  1  1  0  1  0  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1 -1  1  0  0 -1  1  0  0  0 -1  0  0] (Indices: [1, 2, 5, 6, 8, 10, 11, 12, 14, 15, 16, 17]), Candidate: [3 1 0 0 2 1 0 1 0 2 0 1 0 2 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 93100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1 -1  1 -1  1  0 -1  0  1  0  0  0 -1] (Indices: [1, 2, 5, 6, 8, 10, 12, 13, 16, 17, 18, 19]), Candidate: [ 3  1  0  0  2  1  0  1  0  2 -1  2  1  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  1  0  0  0  0  0  0  0 -1  0  0  0] (Indices: [1, 2, 5, 6, 9, 10, 11, 12, 13, 14, 15, 16]), Candidate: [3 1 0 0 2 1 0 0 2 1 0 1 1 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 93200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  1  0  0 -1  0  1  0  0  0  0 -1  0] (Indices: [1, 2, 5, 6, 9, 10, 11, 14, 15, 16, 17, 18]), Candidate: [3 1 0 0 2 1 0 0 2 1 0 0 1 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 93250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  1 -1  1  0 -1  1  0  0  0 -1  1 -1] (Indices: [1, 2, 5, 6, 9, 11, 12, 14, 15, 16, 17, 19]), Candidate: [3 1 0 0 2 1 0 0 2 0 1 1 0 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 93300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  0  1 -1  1  0  0  0  0 -1  1  0 -1] (Indices: [1, 2, 5, 6, 10, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 3  1  0  0  2  1  0  0  1  2 -1  2  1  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0  0  0  0 -1  1  0  0  0 -1  0  0  0] (Indices: [1, 2, 5, 7, 8, 9, 10, 11, 13, 14, 15, 16]), Candidate: [3 1 0 0 2 0 2 0 1 1 0 0 2 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 93400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0  0  0 -1  1  0 -1  1 -1  0  1  0 -1] (Indices: [1, 2, 5, 7, 8, 9, 10, 12, 13, 15, 18, 19]), Candidate: [ 3  1  0  0  2  0  2  0  1  1 -1  2  1  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0  0 -1  1  0  0  0 -1  0  0  1  0 -1] (Indices: [1, 2, 5, 7, 8, 9, 11, 12, 13, 14, 18, 19]), Candidate: [ 3  1  0  0  2  0  2  0  1  0  1  1  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0  0 -1  0  1  0  0  0 -1  1  0 -1  0] (Indices: [1, 2, 5, 7, 8, 9, 12, 13, 14, 15, 17, 18]), Candidate: [3 1 0 0 2 0 2 0 1 0 0 2 1 1 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 93550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0 -1  1  0  0 -1  1  0 -1  0  1  0 -1] (Indices: [1, 2, 5, 7, 8, 10, 11, 12, 14, 15, 18, 19]), Candidate: [3 1 0 0 2 0 2 0 0 2 0 1 0 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 93600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0 -1  1 -1  1 -1  1 -1  1  0  0  0 -1] (Indices: [1, 2, 5, 7, 8, 10, 12, 14, 16, 17, 18, 19]), Candidate: [ 3  1  0  0  2  0  2  0  0  2 -1  2  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 93650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  1  0  0  0  0  0 -1  1 -1  1 -1  0] (Indices: [1, 2, 5, 7, 9, 10, 11, 12, 13, 14, 16, 18]), Candidate: [ 3  1  0  0  2  0  2 -1  2  1  0  1  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 93700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  1  0  0 -1  0  0  1  0  0  0  0 -1] (Indices: [1, 2, 5, 7, 9, 10, 11, 15, 16, 17, 18, 19]), Candidate: [ 3  1  0  0  2  0  2 -1  2  1  0  0  1  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  1 -1  1 -1  1  0  0  0  0  0 -1  0] (Indices: [1, 2, 5, 7, 9, 11, 13, 14, 15, 16, 17, 18]), Candidate: [ 3  1  0  0  2  0  2 -1  2  0  1  0  2  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  0  1 -1  0  1  0  0  0  0  0  0 -1] (Indices: [1, 2, 5, 7, 10, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  1  0  0  2  0  2 -1  1  2 -1  1  2  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 93850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1  0  0  0 -1  1  0  0 -1  0  1  0 -1] (Indices: [1, 2, 5, 8, 9, 10, 11, 13, 14, 15, 18, 19]), Candidate: [3 1 0 0 2 0 1 1 1 1 0 0 2 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 93900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1  0 -1  1  0  0  0 -1  1  0  0 -1  0] (Indices: [1, 2, 5, 8, 9, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 3  1  0  0  2  0  1  1  1  0  1  1  1  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 93950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1 -1  1  0  0 -1  0  1  0  0  0  0 -1] (Indices: [1, 2, 5, 8, 10, 11, 12, 15, 16, 17, 18, 19]), Candidate: [3 1 0 0 2 0 1 1 0 2 0 1 0 1 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 94000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  1  0  0 -1  1  0 -1  1  0  0  0 -1] (Indices: [1, 2, 5, 9, 10, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  1  0  0  2  0  1  0  2  1  0  0  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0  0  0  0  0 -1  1 -1  1 -1  1 -1  0] (Indices: [1, 2, 6, 7, 8, 9, 10, 11, 12, 14, 16, 18]), Candidate: [ 3  1  0  0  1  2  1  0  1  1  0  1  0  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0  0  0 -1  1  0  0  0  0 -1  0  0  0] (Indices: [1, 2, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16]), Candidate: [ 3  1  0  0  1  2  1  0  1  1 -1  2  1  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0  0  0 -1  0  0  1  0  0  0  0 -1  0] (Indices: [1, 2, 6, 7, 8, 9, 10, 14, 15, 16, 17, 18]), Candidate: [ 3  1  0  0  1  2  1  0  1  1 -1  1  1  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0  0 -1  1 -1  1  0 -1  0  1  0  0 -1] (Indices: [1, 2, 6, 7, 8, 9, 11, 13, 14, 17, 18, 19]), Candidate: [ 3  1  0  0  1  2  1  0  1  0  1  0  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0 -1  1  0  0  0 -1  1  0  0 -1  0  0] (Indices: [1, 2, 6, 7, 8, 10, 11, 12, 13, 15, 16, 17]), Candidate: [3 1 0 0 1 2 1 0 0 2 0 1 1 0 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 94300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0 -1  1 -1  1  0  0  0 -1  1 -1  1 -1] (Indices: [1, 2, 6, 7, 8, 10, 12, 13, 14, 15, 17, 19]), Candidate: [ 3  1  0  0  1  2  1  0  0  2 -1  2  1  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0 -1  0  1 -1  1 -1  1  0  0  0  0 -1] (Indices: [1, 2, 6, 7, 8, 11, 13, 15, 16, 17, 18, 19]), Candidate: [3 1 0 0 1 2 1 0 0 1 1 0 2 0 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 94400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  1  0  0 -1  1  0  0 -1  0  1  0 -1] (Indices: [1, 2, 6, 7, 9, 10, 11, 13, 14, 15, 18, 19]), Candidate: [ 3  1  0  0  1  2  1 -1  2  1  0  0  2  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  1 -1  1  0  0  0 -1  1  0  0 -1  0] (Indices: [1, 2, 6, 7, 9, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 3  1  0  0  1  2  1 -1  2  0  1  1  1  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 94500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  0  1  0  0 -1  0  1  0  0  0  0 -1] (Indices: [1, 2, 6, 7, 10, 11, 12, 15, 16, 17, 18, 19]), Candidate: [ 3  1  0  0  1  2  1 -1  1  2  0  1  0  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1  0  0  0  0 -1  1  0 -1  0  1  0 -1] (Indices: [1, 2, 6, 8, 9, 10, 11, 12, 14, 15, 18, 19]), Candidate: [3 1 0 0 1 2 0 1 1 1 0 1 0 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 94600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1  0  0 -1  1 -1  1 -1  1  0  0  0 -1] (Indices: [1, 2, 6, 8, 9, 10, 12, 14, 16, 17, 18, 19]), Candidate: [ 3  1  0  0  1  2  0  1  1  1 -1  2  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 94650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1 -1  1  0  0  0  0  0 -1  0  1  0 -1] (Indices: [1, 2, 6, 8, 10, 11, 12, 13, 14, 15, 18, 19]), Candidate: [3 1 0 0 1 2 0 1 0 2 0 1 1 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 94700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  0  1  0  0  0  0 -1  1  0  0  0 -1  0] (Indices: [1, 2, 6, 9, 10, 11, 12, 13, 15, 16, 17, 18]), Candidate: [3 1 0 0 1 2 0 0 2 1 0 1 1 0 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 94750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0  0  0  0  0  0  0 -1  1 -1  1 -1  0] (Indices: [1, 2, 7, 8, 9, 10, 11, 12, 13, 14, 16, 18]), Candidate: [ 3  1  0  0  1  1  2  0  1  1  0  1  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0  0  0  0 -1  0  0  1  0  0  0  0 -1] (Indices: [1, 2, 7, 8, 9, 10, 11, 15, 16, 17, 18, 19]), Candidate: [3 1 0 0 1 1 2 0 1 1 0 0 1 1 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 94850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0  0 -1  1 -1  1  0  0  0  0  0 -1  0] (Indices: [1, 2, 7, 8, 9, 11, 13, 14, 15, 16, 17, 18]), Candidate: [3 1 0 0 1 1 2 0 1 0 1 0 2 1 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 94900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0 -1  1 -1  0  1  0  0  0  0  0  0 -1] (Indices: [1, 2, 7, 8, 10, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  1  0  0  1  1  2  0  0  2 -1  1  2  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 94950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  1 -1  1  0  0  0 -1  1  0  0  0 -1] (Indices: [1, 2, 7, 9, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  1  0  0  1  1  2 -1  2  0  1  1  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 95000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  0  1  0  0 -1  0  1  0  0  0  0  0  0 -1] (Indices: [1, 2, 8, 9, 10, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  1  0  0  1  1  1  1  1  1 -1  1  2  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0  0  0  0 -1  0  0  1 -1  1 -1  0  0] (Indices: [1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 15, 17]), Candidate: [3 0 2 0 1 1 1 0 1 1 0 0 1 1 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 95100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0  0  0 -1  0  0  1 -1  1 -1  1 -1  0] (Indices: [1, 3, 4, 5, 6, 7, 8, 9, 10, 14, 16, 18]), Candidate: [ 3  0  2  0  1  1  1  0  1  1 -1  1  1  2 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 95150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0  0 -1  1 -1  1 -1  0  0  0  1  0 -1] (Indices: [1, 3, 4, 5, 6, 7, 8, 9, 11, 13, 18, 19]), Candidate: [3 0 2 0 1 1 1 0 1 0 1 0 2 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 95200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0  0 -1  0  1 -1  0  1 -1  1 -1  1 -1] (Indices: [1, 3, 4, 5, 6, 7, 8, 9, 12, 15, 17, 19]), Candidate: [3 0 2 0 1 1 1 0 1 0 0 2 0 1 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 95250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0 -1  1  0  0 -1  1 -1  0  0  1 -1  0] (Indices: [1, 3, 4, 5, 6, 7, 8, 10, 11, 12, 14, 18]), Candidate: [ 3  0  2  0  1  1  1  0  0  2  0  1  0  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0 -1  1 -1  1  0  0 -1  0  0  1 -1  0] (Indices: [1, 3, 4, 5, 6, 7, 8, 10, 12, 13, 14, 18]), Candidate: [ 3  0  2  0  1  1  1  0  0  2 -1  2  1  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 95350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0 -1  1 -1  0  1 -1  0  1 -1  1  0 -1] (Indices: [1, 3, 4, 5, 6, 7, 8, 10, 13, 16, 18, 19]), Candidate: [ 3  0  2  0  1  1  1  0  0  2 -1  1  2  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0 -1  0  1  0 -1  0  0  1 -1  1  0 -1] (Indices: [1, 3, 4, 5, 6, 7, 8, 11, 12, 16, 18, 19]), Candidate: [3 0 2 0 1 1 1 0 0 1 1 1 0 1 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 95450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0 -1  0  0  1  0 -1  1 -1  1  0 -1  0] (Indices: [1, 3, 4, 5, 6, 7, 8, 12, 13, 15, 17, 18]), Candidate: [3 0 2 0 1 1 1 0 0 1 0 2 1 0 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 95500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  1  0  0  0 -1  1 -1  1 -1  0  0  0] (Indices: [1, 3, 4, 5, 6, 7, 9, 10, 11, 12, 14, 16]), Candidate: [ 3  0  2  0  1  1  1 -1  2  1  0  1  0  2 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 95550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  1  0 -1  1  0  0 -1  1 -1  0  0  0] (Indices: [1, 3, 4, 5, 6, 7, 9, 10, 12, 13, 14, 16]), Candidate: [ 3  0  2  0  1  1  1 -1  2  1 -1  2  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 95600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  1  0 -1  0  1 -1  0  1  0  0 -1  0] (Indices: [1, 3, 4, 5, 6, 7, 9, 10, 13, 16, 17, 18]), Candidate: [ 3  0  2  0  1  1  1 -1  2  1 -1  1  2  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 95650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  1 -1  1  0 -1  0  0  1  0  0 -1  0] (Indices: [1, 3, 4, 5, 6, 7, 9, 11, 12, 16, 17, 18]), Candidate: [ 3  0  2  0  1  1  1 -1  2  0  1  1  0  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  1 -1  0  1  0 -1  1  0 -1  1 -1  0] (Indices: [1, 3, 4, 5, 6, 7, 9, 12, 13, 15, 16, 18]), Candidate: [ 3  0  2  0  1  1  1 -1  2  0  0  2  1  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  0  1  0  0  0 -1  1  0 -1  0  0  0] (Indices: [1, 3, 4, 5, 6, 7, 10, 11, 12, 13, 15, 16]), Candidate: [ 3  0  2  0  1  1  1 -1  1  2  0  1  1  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  0  1  0 -1  0  1  0  0  0 -1  0  0] (Indices: [1, 3, 4, 5, 6, 7, 10, 11, 14, 15, 16, 17]), Candidate: [ 3  0  2  0  1  1  1 -1  1  2  0  0  1  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 95850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  0  1 -1  0  1  0  0  0  0 -1  0  0] (Indices: [1, 3, 4, 5, 6, 7, 10, 13, 14, 15, 16, 17]), Candidate: [ 3  0  2  0  1  1  1 -1  1  2 -1  1  2  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 95900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  0  0  1  0 -1  1 -1  0  1  0  0 -1] (Indices: [1, 3, 4, 5, 6, 7, 11, 12, 14, 17, 18, 19]), Candidate: [ 3  0  2  0  1  1  1 -1  1  1  1  1  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 95950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  0  0  0  0  1  0  0  0 -1  1  0 -1] (Indices: [1, 3, 4, 5, 6, 7, 13, 14, 15, 16, 18, 19]), Candidate: [ 3  0  2  0  1  1  1 -1  1  1  0  1  2  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1  0  0  0 -1  0  1 -1  0  0  1  0 -1] (Indices: [1, 3, 4, 5, 6, 8, 9, 10, 11, 14, 18, 19]), Candidate: [ 3  0  2  0  1  1  0  1  1  1  0  0  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1  0  0 -1  0  1  0 -1  1  0 -1  0  0] (Indices: [1, 3, 4, 5, 6, 8, 9, 10, 13, 14, 16, 17]), Candidate: [ 3  0  2  0  1  1  0  1  1  1 -1  1  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 96100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1  0 -1  1  0 -1  1 -1  1  0 -1  0  0] (Indices: [1, 3, 4, 5, 6, 8, 9, 11, 12, 14, 16, 17]), Candidate: [ 3  0  2  0  1  1  0  1  1  0  1  1  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1  0 -1  1 -1  0  0  0  1  0  0  0 -1] (Indices: [1, 3, 4, 5, 6, 8, 9, 11, 16, 17, 18, 19]), Candidate: [3 0 2 0 1 1 0 1 1 0 1 0 1 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 96200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1  0 -1  0  0  1 -1  0  1  0  0  0 -1] (Indices: [1, 3, 4, 5, 6, 8, 9, 13, 16, 17, 18, 19]), Candidate: [3 0 2 0 1 1 0 1 1 0 0 1 2 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 96250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1 -1  1  0 -1  1  0 -1  0  1 -1  1 -1] (Indices: [1, 3, 4, 5, 6, 8, 10, 11, 13, 14, 17, 19]), Candidate: [ 3  0  2  0  1  1  0  1  0  2  0  0  2  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1 -1  1 -1  1 -1  1  0 -1  1  0 -1  0] (Indices: [1, 3, 4, 5, 6, 8, 10, 12, 14, 15, 17, 18]), Candidate: [ 3  0  2  0  1  1  0  1  0  2 -1  2  0  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1 -1  0  1  0  0 -1  0  1  0 -1  1 -1] (Indices: [1, 3, 4, 5, 6, 8, 11, 12, 13, 16, 17, 19]), Candidate: [3 0 2 0 1 1 0 1 0 1 1 1 1 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 96400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1 -1  0  0  1  0 -1  1  0  0 -1  1 -1] (Indices: [1, 3, 4, 5, 6, 8, 12, 13, 15, 16, 17, 19]), Candidate: [3 0 2 0 1 1 0 1 0 1 0 2 1 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 96450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  1  0  0  0 -1  0  0  1 -1  1  0 -1] (Indices: [1, 3, 4, 5, 6, 9, 10, 11, 12, 16, 18, 19]), Candidate: [3 0 2 0 1 1 0 0 2 1 0 1 0 1 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 96500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  1  0 -1  1  0 -1  1 -1  1  0 -1  0] (Indices: [1, 3, 4, 5, 6, 9, 10, 12, 13, 15, 17, 18]), Candidate: [ 3  0  2  0  1  1  0  0  2  1 -1  2  1  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  1 -1  1  0  0  0 -1  0  1  0 -1  0] (Indices: [1, 3, 4, 5, 6, 9, 11, 12, 13, 14, 17, 18]), Candidate: [ 3  0  2  0  1  1  0  0  2  0  1  1  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  1 -1  0  1  0  0  0  0 -1  1 -1  0] (Indices: [1, 3, 4, 5, 6, 9, 12, 13, 14, 15, 16, 18]), Candidate: [3 0 2 0 1 1 0 0 2 0 0 2 1 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 96650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  0  1  0  0 -1  1  0 -1  1  0 -1  0] (Indices: [1, 3, 4, 5, 6, 10, 11, 12, 14, 15, 17, 18]), Candidate: [3 0 2 0 1 1 0 0 1 2 0 1 0 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 96700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  0  1 -1  1 -1  1  0  0 -1  1  0 -1] (Indices: [1, 3, 4, 5, 6, 10, 12, 14, 15, 16, 18, 19]), Candidate: [ 3  0  2  0  1  1  0  0  1  2 -1  2  0  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0  0  0  0  0  0 -1  0  0  1 -1  0  0] (Indices: [1, 3, 4, 5, 7, 8, 9, 10, 11, 12, 13, 17]), Candidate: [3 0 2 0 1 0 2 0 1 1 0 1 1 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 96800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0  0  0  0 -1  0  0  0  1  0 -1  1 -1] (Indices: [1, 3, 4, 5, 7, 8, 9, 10, 11, 16, 17, 19]), Candidate: [3 0 2 0 1 0 2 0 1 1 0 0 1 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 96850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0  0  0 -1  0  1 -1  1  0 -1  0  1 -1] (Indices: [1, 3, 4, 5, 7, 8, 9, 10, 13, 15, 16, 19]), Candidate: [ 3  0  2  0  1  0  2  0  1  1 -1  1  2  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 96900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0  0 -1  1  0 -1  0  1  0 -1  0  1 -1] (Indices: [1, 3, 4, 5, 7, 8, 9, 11, 12, 15, 16, 19]), Candidate: [3 0 2 0 1 0 2 0 1 0 1 1 0 1 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 96950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0  0 -1  0  1  0  0 -1  0  1  0 -1  0] (Indices: [1, 3, 4, 5, 7, 8, 9, 12, 13, 14, 17, 18]), Candidate: [ 3  0  2  0  1  0  2  0  1  0  0  2  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 97000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0 -1  1  0  0  0  0 -1  1 -1  0  0  0] (Indices: [1, 3, 4, 5, 7, 8, 10, 11, 12, 13, 14, 16]), Candidate: [ 3  0  2  0  1  0  2  0  0  2  0  1  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 97050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0 -1  1  0 -1  1 -1  0  1  0  0 -1  0] (Indices: [1, 3, 4, 5, 7, 8, 10, 11, 13, 16, 17, 18]), Candidate: [3 0 2 0 1 0 2 0 0 2 0 0 2 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 97100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0 -1  1 -1  1 -1  0  1  0  0 -1  1 -1] (Indices: [1, 3, 4, 5, 7, 8, 10, 12, 15, 16, 17, 19]), Candidate: [ 3  0  2  0  1  0  2  0  0  2 -1  2  0  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 97150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0 -1  0  1  0 -1  1  0 -1  0  1  0 -1] (Indices: [1, 3, 4, 5, 7, 8, 11, 12, 14, 15, 18, 19]), Candidate: [3 0 2 0 1 0 2 0 0 1 1 1 0 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 97200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0 -1  0  0  1 -1  1 -1  1  0  0  0 -1] (Indices: [1, 3, 4, 5, 7, 8, 12, 14, 16, 17, 18, 19]), Candidate: [ 3  0  2  0  1  0  2  0  0  1  0  2  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 97250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  1  0  0 -1  1  0 -1  1 -1  0  1 -1] (Indices: [1, 3, 4, 5, 7, 9, 10, 11, 13, 14, 16, 19]), Candidate: [ 3  0  2  0  1  0  2 -1  2  1  0  0  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 97300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  1  0 -1  1 -1  1  0  0 -1  1 -1  0] (Indices: [1, 3, 4, 5, 7, 9, 10, 12, 14, 15, 16, 18]), Candidate: [ 3  0  2  0  1  0  2 -1  2  1 -1  2  0  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 97350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  1 -1  1  0  0 -1  1 -1  0  1  0 -1] (Indices: [1, 3, 4, 5, 7, 9, 11, 12, 13, 15, 18, 19]), Candidate: [ 3  0  2  0  1  0  2 -1  2  0  1  1  1  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 97400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  1 -1  0  1  0  0 -1  0  1  0  0 -1] (Indices: [1, 3, 4, 5, 7, 9, 12, 13, 14, 17, 18, 19]), Candidate: [ 3  0  2  0  1  0  2 -1  2  0  0  2  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 97450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  0  1  0  0 -1  0  1  0  0 -1  1 -1] (Indices: [1, 3, 4, 5, 7, 10, 11, 12, 15, 16, 17, 19]), Candidate: [ 3  0  2  0  1  0  2 -1  1  2  0  1  0  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 97500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  0  1 -1  0  1  0 -1  1  0  0  0 -1] (Indices: [1, 3, 4, 5, 7, 10, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  0  2  0  1  0  2 -1  1  2 -1  1  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 97550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1  0  0  0  0  0 -1  0  1 -1  0  1 -1] (Indices: [1, 3, 4, 5, 8, 9, 10, 11, 12, 13, 16, 19]), Candidate: [3 0 2 0 1 0 1 1 1 1 0 1 1 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 97600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1  0  0  0 -1  0  1 -1  1  0  0 -1  0] (Indices: [1, 3, 4, 5, 8, 9, 10, 11, 14, 16, 17, 18]), Candidate: [ 3  0  2  0  1  0  1  1  1  1  0  0  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 97650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1  0  0 -1  0  1  0 -1  1  0  0 -1  0] (Indices: [1, 3, 4, 5, 8, 9, 10, 13, 14, 16, 17, 18]), Candidate: [ 3  0  2  0  1  0  1  1  1  1 -1  1  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 97700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1  0 -1  1 -1  1  0  0  0  0 -1  0  0] (Indices: [1, 3, 4, 5, 8, 9, 11, 13, 14, 15, 16, 17]), Candidate: [3 0 2 0 1 0 1 1 1 0 1 0 2 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 97750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1 -1  1  0  0  0  0  0 -1  1 -1  0  0] (Indices: [1, 3, 4, 5, 8, 10, 11, 12, 13, 14, 15, 17]), Candidate: [3 0 2 0 1 0 1 1 0 2 0 1 1 1 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 97800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1 -1  1  0 -1  0  1  0  0  0 -1  1 -1] (Indices: [1, 3, 4, 5, 8, 10, 11, 14, 15, 16, 17, 19]), Candidate: [3 0 2 0 1 0 1 1 0 2 0 0 1 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 97850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1 -1  0  1  0 -1  1  0  0 -1  1  0 -1] (Indices: [1, 3, 4, 5, 8, 11, 12, 14, 15, 16, 18, 19]), Candidate: [3 0 2 0 1 0 1 1 0 1 1 1 0 2 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 97900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  1  0  0  0 -1  0  1  0  0 -1  1 -1] (Indices: [1, 3, 4, 5, 9, 10, 11, 12, 15, 16, 17, 19]), Candidate: [3 0 2 0 1 0 1 0 2 1 0 1 0 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 97950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  1  0 -1  0  1  0 -1  1  0  0  0 -1] (Indices: [1, 3, 4, 5, 9, 10, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  0  2  0  1  0  1  0  2  1 -1  1  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 98000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  0  1  0  0  0 -1  1  0  0 -1  1 -1] (Indices: [1, 3, 4, 5, 10, 11, 12, 13, 15, 16, 17, 19]), Candidate: [3 0 2 0 1 0 1 0 1 2 0 1 1 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 98050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0  0  0  0  0 -1  0  0  1 -1  1 -1  0] (Indices: [1, 3, 4, 6, 7, 8, 9, 10, 11, 12, 16, 18]), Candidate: [3 0 2 0 0 2 1 0 1 1 0 1 0 1 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 98100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0  0  0 -1  1  0 -1  0  1 -1  1 -1  0] (Indices: [1, 3, 4, 6, 7, 8, 9, 10, 12, 13, 16, 18]), Candidate: [ 3  0  2  0  0  2  1  0  1  1 -1  2  1  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0  0  0 -1  0  0  1  0 -1  0  1  0 -1] (Indices: [1, 3, 4, 6, 7, 8, 9, 10, 14, 15, 18, 19]), Candidate: [ 3  0  2  0  0  2  1  0  1  1 -1  1  1  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0  0 -1  1 -1  1  0 -1  1 -1  1 -1  0] (Indices: [1, 3, 4, 6, 7, 8, 9, 11, 13, 14, 16, 18]), Candidate: [ 3  0  2  0  0  2  1  0  1  0  1  0  2  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0  0 -1  0  1 -1  1  0  0  0 -1  0  0] (Indices: [1, 3, 4, 6, 7, 8, 9, 12, 14, 15, 16, 17]), Candidate: [3 0 2 0 0 2 1 0 1 0 0 2 0 2 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 98300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0 -1  1  0  0  0 -1  0  0  0  1  0 -1] (Indices: [1, 3, 4, 6, 7, 8, 10, 11, 12, 13, 18, 19]), Candidate: [3 0 2 0 0 2 1 0 0 2 0 1 1 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 98350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0 -1  1  0 -1  0  1 -1  0  1  0  0 -1] (Indices: [1, 3, 4, 6, 7, 8, 10, 11, 14, 17, 18, 19]), Candidate: [ 3  0  2  0  0  2  1  0  0  2  0  0  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0 -1  1 -1  0  1  0 -1  0  1  0  0 -1] (Indices: [1, 3, 4, 6, 7, 8, 10, 13, 14, 17, 18, 19]), Candidate: [ 3  0  2  0  0  2  1  0  0  2 -1  1  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 98450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0 -1  0  1 -1  1  0  0 -1  1  0 -1  0] (Indices: [1, 3, 4, 6, 7, 8, 11, 13, 14, 15, 17, 18]), Candidate: [3 0 2 0 0 2 1 0 0 1 1 0 2 1 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 98500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  1  0  0  0  0  0 -1  0  0  0  1 -1] (Indices: [1, 3, 4, 6, 7, 9, 10, 11, 12, 13, 14, 19]), Candidate: [ 3  0  2  0  0  2  1 -1  2  1  0  1  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 98550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  1  0  0 -1  1 -1  0  0  1  0  0 -1] (Indices: [1, 3, 4, 6, 7, 9, 10, 11, 13, 17, 18, 19]), Candidate: [ 3  0  2  0  0  2  1 -1  2  1  0  0  2  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  1  0 -1  1 -1  0  0  1  0  0  0 -1] (Indices: [1, 3, 4, 6, 7, 9, 10, 12, 16, 17, 18, 19]), Candidate: [ 3  0  2  0  0  2  1 -1  2  1 -1  2  0  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 98650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  1 -1  1  0 -1  1 -1  1 -1  1  0 -1] (Indices: [1, 3, 4, 6, 7, 9, 11, 12, 14, 16, 18, 19]), Candidate: [ 3  0  2  0  0  2  1 -1  2  0  1  1  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 98700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  1 -1  0  0  1  0  0  0  0 -1  1 -1] (Indices: [1, 3, 4, 6, 7, 9, 13, 14, 15, 16, 17, 19]), Candidate: [ 3  0  2  0  0  2  1 -1  2  0  0  1  2  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  0  1  0 -1  1  0 -1  0  1  0  0 -1] (Indices: [1, 3, 4, 6, 7, 10, 11, 13, 14, 17, 18, 19]), Candidate: [ 3  0  2  0  0  2  1 -1  1  2  0  0  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 98800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  0  0  1  0  0 -1  1  0  0  0 -1  0] (Indices: [1, 3, 4, 6, 7, 11, 12, 13, 15, 16, 17, 18]), Candidate: [ 3  0  2  0  0  2  1 -1  1  1  1  1  1  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1  0  0  0  0 -1  1 -1  0  0  1  0 -1] (Indices: [1, 3, 4, 6, 8, 9, 10, 11, 12, 14, 18, 19]), Candidate: [ 3  0  2  0  0  2  0  1  1  1  0  1  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 98900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1  0  0 -1  1  0  0 -1  1  0 -1  0  0] (Indices: [1, 3, 4, 6, 8, 9, 10, 12, 13, 14, 16, 17]), Candidate: [ 3  0  2  0  0  2  0  1  1  1 -1  2  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 98950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1  0  0 -1  0  0  1 -1  1  0  0  0 -1] (Indices: [1, 3, 4, 6, 8, 9, 10, 14, 16, 17, 18, 19]), Candidate: [ 3  0  2  0  0  2  0  1  1  1 -1  1  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 99000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1  0 -1  1 -1  1 -1  1 -1  1  0  0 -1] (Indices: [1, 3, 4, 6, 8, 9, 11, 13, 15, 17, 18, 19]), Candidate: [3 0 2 0 0 2 0 1 1 0 1 0 2 0 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 99050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1 -1  1  0  0  0 -1  1 -1  1 -1  1 -1] (Indices: [1, 3, 4, 6, 8, 10, 11, 12, 13, 15, 17, 19]), Candidate: [3 0 2 0 0 2 0 1 0 2 0 1 1 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 99100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1 -1  1 -1  1  0  0 -1  1 -1  1  0 -1] (Indices: [1, 3, 4, 6, 8, 10, 12, 13, 14, 16, 18, 19]), Candidate: [ 3  0  2  0  0  2  0  1  0  2 -1  2  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 99150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1 -1  0  0  1  0  0  0  0 -1  1  0 -1] (Indices: [1, 3, 4, 6, 8, 12, 13, 14, 15, 16, 18, 19]), Candidate: [3 0 2 0 0 2 0 1 0 1 0 2 1 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 99200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  1  0  0 -1  1  0 -1  0  1  0  0 -1] (Indices: [1, 3, 4, 6, 9, 10, 11, 13, 14, 17, 18, 19]), Candidate: [ 3  0  2  0  0  2  0  0  2  1  0  0  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 99250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  1 -1  1  0  0 -1  1  0  0  0 -1  0] (Indices: [1, 3, 4, 6, 9, 11, 12, 13, 15, 16, 17, 18]), Candidate: [3 0 2 0 0 2 0 0 2 0 1 1 1 0 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 99300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  0  1  0 -1  1  0  0 -1  1  0  0 -1] (Indices: [1, 3, 4, 6, 10, 11, 13, 14, 15, 17, 18, 19]), Candidate: [3 0 2 0 0 2 0 0 1 2 0 0 2 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 99350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0  0  0  0  0 -1  0  1 -1  1 -1  1 -1] (Indices: [1, 3, 4, 7, 8, 9, 10, 11, 12, 15, 17, 19]), Candidate: [3 0 2 0 0 1 2 0 1 1 0 1 0 1 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 99400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0  0  0 -1  1  0  0 -1  0  0  1  0 -1] (Indices: [1, 3, 4, 7, 8, 9, 10, 12, 13, 14, 18, 19]), Candidate: [ 3  0  2  0  0  1  2  0  1  1 -1  2  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 99450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0  0 -1  1  0  0  0  0 -1  0  0  1 -1] (Indices: [1, 3, 4, 7, 8, 9, 11, 12, 13, 14, 15, 19]), Candidate: [3 0 2 0 0 1 2 0 1 0 1 1 1 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 99500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0  0 -1  1 -1  0  1  0 -1  1  0  0 -1] (Indices: [1, 3, 4, 7, 8, 9, 11, 14, 15, 17, 18, 19]), Candidate: [3 0 2 0 0 1 2 0 1 0 1 0 1 2 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 99550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0 -1  1  0  0  0 -1  0  0  1  0  0 -1] (Indices: [1, 3, 4, 7, 8, 10, 11, 12, 13, 17, 18, 19]), Candidate: [3 0 2 0 0 1 2 0 0 2 0 1 1 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 99600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0 -1  1 -1  1  0 -1  1 -1  1  0  0 -1] (Indices: [1, 3, 4, 7, 8, 10, 12, 13, 15, 17, 18, 19]), Candidate: [ 3  0  2  0  0  1  2  0  0  2 -1  2  1  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 99650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0 -1  0  0  0  1  0  0  0  0  0  0 -1] (Indices: [1, 3, 4, 7, 8, 13, 14, 15, 16, 17, 18, 19]), Candidate: [3 0 2 0 0 1 2 0 0 1 0 1 2 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 99700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  1  0  0 -1  1 -1  0  1  0  0  0 -1] (Indices: [1, 3, 4, 7, 9, 10, 11, 13, 16, 17, 18, 19]), Candidate: [ 3  0  2  0  0  1  2 -1  2  1  0  0  2  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 99750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  1 -1  1  0 -1  1  0  0  0  0 -1  0] (Indices: [1, 3, 4, 7, 9, 11, 12, 14, 15, 16, 17, 18]), Candidate: [ 3  0  2  0  0  1  2 -1  2  0  1  1  0  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 99800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  0  1 -1  1  0  0  0  0  0 -1  1 -1] (Indices: [1, 3, 4, 7, 10, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 3  0  2  0  0  1  2 -1  1  2 -1  2  1  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 99850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1  0  0  0  0 -1  0  0  1  0  0  0 -1] (Indices: [1, 3, 4, 8, 9, 10, 11, 12, 16, 17, 18, 19]), Candidate: [3 0 2 0 0 1 1 1 1 1 0 1 0 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 99900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1  0 -1  1  0  0  0  0  0  0 -1  0  0] (Indices: [1, 3, 4, 8, 9, 11, 12, 13, 14, 15, 16, 17]), Candidate: [3 0 2 0 0 1 1 1 1 0 1 1 1 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 99950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1 -1  1  0  0  0 -1  0  1  0  0  0 -1] (Indices: [1, 3, 4, 8, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [3 0 2 0 0 1 1 1 0 2 0 1 1 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 100000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  0  1  0  0  0 -1  1 -1  1  0  0  0 -1] (Indices: [1, 3, 4, 9, 10, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 3  0  2  0  0  1  1  0  2  1  0  1  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0  0  0  0  0 -1  0  1 -1  0  0  1 -1] (Indices: [1, 3, 5, 6, 7, 8, 9, 10, 11, 12, 15, 19]), Candidate: [ 3  0  2 -1  2  1  1  0  1  1  0  1  0  1  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0  0  0 -1  1  0 -1  1 -1  0  0  1 -1] (Indices: [1, 3, 5, 6, 7, 8, 9, 10, 12, 13, 15, 19]), Candidate: [ 3  0  2 -1  2  1  1  0  1  1 -1  2  1  0  1  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0  0  0 -1  0  0  1  0 -1  1  0 -1  0] (Indices: [1, 3, 5, 6, 7, 8, 9, 10, 14, 15, 17, 18]), Candidate: [ 3  0  2 -1  2  1  1  0  1  1 -1  1  1  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0  0 -1  1 -1  1  0  0 -1  0  0  1 -1] (Indices: [1, 3, 5, 6, 7, 8, 9, 11, 13, 14, 15, 19]), Candidate: [ 3  0  2 -1  2  1  1  0  1  0  1  0  2  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0  0 -1  0  1  0 -1  0  1 -1  1  0 -1] (Indices: [1, 3, 5, 6, 7, 8, 9, 12, 13, 16, 18, 19]), Candidate: [ 3  0  2 -1  2  1  1  0  1  0  0  2  1  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0 -1  1  0  0  0 -1  0  0  1  0 -1  0] (Indices: [1, 3, 5, 6, 7, 8, 10, 11, 12, 13, 17, 18]), Candidate: [ 3  0  2 -1  2  1  1  0  0  2  0  1  1  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0 -1  1  0 -1  0  1 -1  1  0 -1  1 -1] (Indices: [1, 3, 5, 6, 7, 8, 10, 11, 14, 16, 17, 19]), Candidate: [ 3  0  2 -1  2  1  1  0  0  2  0  0  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0 -1  1 -1  0  1  0 -1  1  0 -1  1 -1] (Indices: [1, 3, 5, 6, 7, 8, 10, 13, 14, 16, 17, 19]), Candidate: [ 3  0  2 -1  2  1  1  0  0  2 -1  1  2  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 100450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0 -1  0  1 -1  1  0  0  0 -1  1 -1  0] (Indices: [1, 3, 5, 6, 7, 8, 11, 13, 14, 15, 16, 18]), Candidate: [ 3  0  2 -1  2  1  1  0  0  1  1  0  2  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  1  0  0  0  0  0 -1  0  1 -1  0  0] (Indices: [1, 3, 5, 6, 7, 9, 10, 11, 12, 13, 14, 17]), Candidate: [ 3  0  2 -1  2  1  1 -1  2  1  0  1  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 100550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  1  0  0 -1  1 -1  0  1  0 -1  1 -1] (Indices: [1, 3, 5, 6, 7, 9, 10, 11, 13, 16, 17, 19]), Candidate: [ 3  0  2 -1  2  1  1 -1  2  1  0  0  2  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  1  0 -1  1 -1  0  1  0 -1  1  0 -1] (Indices: [1, 3, 5, 6, 7, 9, 10, 12, 15, 16, 18, 19]), Candidate: [ 3  0  2 -1  2  1  1 -1  2  1 -1  2  0  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 100650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  1 -1  1  0 -1  1 -1  1  0  0 -1  0] (Indices: [1, 3, 5, 6, 7, 9, 11, 12, 14, 16, 17, 18]), Candidate: [ 3  0  2 -1  2  1  1 -1  2  0  1  1  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 100700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  1 -1  0  1 -1  0  1  0  0  0  0 -1] (Indices: [1, 3, 5, 6, 7, 9, 12, 15, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  2  1  1 -1  2  0  0  2  0  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  0  1  0 -1  1  0 -1  1  0 -1  1 -1] (Indices: [1, 3, 5, 6, 7, 10, 11, 13, 14, 16, 17, 19]), Candidate: [ 3  0  2 -1  2  1  1 -1  1  2  0  0  2  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 100800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  0  0  1  0  0  0 -1  1 -1  1  0 -1] (Indices: [1, 3, 5, 6, 7, 11, 12, 13, 14, 16, 18, 19]), Candidate: [ 3  0  2 -1  2  1  1 -1  1  1  1  1  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 100850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1  0  0  0  0 -1  1 -1  0  1  0 -1  0] (Indices: [1, 3, 5, 6, 8, 9, 10, 11, 12, 14, 17, 18]), Candidate: [ 3  0  2 -1  2  1  0  1  1  1  0  1  0  2 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1  0  0 -1  1  0  0  0 -1  0  1 -1  0] (Indices: [1, 3, 5, 6, 8, 9, 10, 12, 13, 14, 15, 18]), Candidate: [ 3  0  2 -1  2  1  0  1  1  1 -1  2  1  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 100950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1  0  0 -1  0  0  1  0  0 -1  1  0 -1] (Indices: [1, 3, 5, 6, 8, 9, 10, 14, 15, 16, 18, 19]), Candidate: [ 3  0  2 -1  2  1  0  1  1  1 -1  1  1  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 101000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1  0 -1  1 -1  1 -1  1  0  0 -1  1 -1] (Indices: [1, 3, 5, 6, 8, 9, 11, 13, 15, 16, 17, 19]), Candidate: [ 3  0  2 -1  2  1  0  1  1  0  1  0  2  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1 -1  1  0  0  0 -1  1  0 -1  0  1 -1] (Indices: [1, 3, 5, 6, 8, 10, 11, 12, 13, 15, 16, 19]), Candidate: [ 3  0  2 -1  2  1  0  1  0  2  0  1  1  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1 -1  1 -1  1  0  0 -1  1  0  0 -1  0] (Indices: [1, 3, 5, 6, 8, 10, 12, 13, 14, 16, 17, 18]), Candidate: [ 3  0  2 -1  2  1  0  1  0  2 -1  2  1  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 101150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1 -1  0  0  1  0  0  0  0  0  0 -1  0] (Indices: [1, 3, 5, 6, 8, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 3  0  2 -1  2  1  0  1  0  1  0  2  1  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  1  0  0 -1  1  0 -1  1  0 -1  1 -1] (Indices: [1, 3, 5, 6, 9, 10, 11, 13, 14, 16, 17, 19]), Candidate: [ 3  0  2 -1  2  1  0  0  2  1  0  0  2  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 101250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  1 -1  1  0  0  0 -1  1 -1  1  0 -1] (Indices: [1, 3, 5, 6, 9, 11, 12, 13, 14, 16, 18, 19]), Candidate: [ 3  0  2 -1  2  1  0  0  2  0  1  1  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 101300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  0  1  0 -1  1  0  0  0  0 -1  1 -1] (Indices: [1, 3, 5, 6, 10, 11, 13, 14, 15, 16, 17, 19]), Candidate: [ 3  0  2 -1  2  1  0  0  1  2  0  0  2  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0  0  0  0  0 -1  0  1  0 -1  0  1 -1] (Indices: [1, 3, 5, 7, 8, 9, 10, 11, 12, 15, 16, 19]), Candidate: [ 3  0  2 -1  2  0  2  0  1  1  0  1  0  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0  0  0 -1  1  0  0 -1  0  1  0 -1  0] (Indices: [1, 3, 5, 7, 8, 9, 10, 12, 13, 14, 17, 18]), Candidate: [ 3  0  2 -1  2  0  2  0  1  1 -1  2  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 101450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0  0 -1  1  0  0  0  0 -1  1 -1  0  0] (Indices: [1, 3, 5, 7, 8, 9, 11, 12, 13, 14, 15, 17]), Candidate: [ 3  0  2 -1  2  0  2  0  1  0  1  1  1  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0  0 -1  1 -1  0  1  0  0  0 -1  1 -1] (Indices: [1, 3, 5, 7, 8, 9, 11, 14, 15, 16, 17, 19]), Candidate: [ 3  0  2 -1  2  0  2  0  1  0  1  0  1  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0 -1  1  0  0  0 -1  0  1  0 -1  1 -1] (Indices: [1, 3, 5, 7, 8, 10, 11, 12, 13, 16, 17, 19]), Candidate: [ 3  0  2 -1  2  0  2  0  0  2  0  1  1  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0 -1  1 -1  1  0 -1  1  0  0 -1  1 -1] (Indices: [1, 3, 5, 7, 8, 10, 12, 13, 15, 16, 17, 19]), Candidate: [ 3  0  2 -1  2  0  2  0  0  2 -1  2  1  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 101650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0 -1  0  0  1  0 -1  1  0  0  0  0 -1] (Indices: [1, 3, 5, 7, 8, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  2  0  2  0  0  1  0  2  1  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  1  0  0 -1  1 -1  1  0 -1  1  0 -1] (Indices: [1, 3, 5, 7, 9, 10, 11, 13, 15, 16, 18, 19]), Candidate: [ 3  0  2 -1  2  0  2 -1  2  1  0  0  2  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 101750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  1 -1  1  0  0 -1  1 -1  1  0  0 -1] (Indices: [1, 3, 5, 7, 9, 11, 12, 13, 15, 17, 18, 19]), Candidate: [ 3  0  2 -1  2  0  2 -1  2  0  1  1  1  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 101800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  0  1  0 -1  0  1  0  0  0  0  0 -1] (Indices: [1, 3, 5, 7, 10, 11, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  2  0  2 -1  1  2  0  0  1  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 101850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1  0  0  0  0 -1  0  1  0 -1  1  0 -1] (Indices: [1, 3, 5, 8, 9, 10, 11, 12, 15, 16, 18, 19]), Candidate: [ 3  0  2 -1  2  0  1  1  1  1  0  1  0  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 101900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1  0  0 -1  0  1 -1  1  0  0  0  0 -1] (Indices: [1, 3, 5, 8, 9, 10, 13, 15, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  2  0  1  1  1  1 -1  1  2  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 101950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1 -1  1  0  0  0 -1  1  0 -1  1  0 -1] (Indices: [1, 3, 5, 8, 10, 11, 12, 13, 15, 16, 18, 19]), Candidate: [ 3  0  2 -1  2  0  1  1  0  2  0  1  1  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  0  1  0  0  0 -1  1  0  0 -1  1  0 -1] (Indices: [1, 3, 5, 9, 10, 11, 12, 14, 15, 16, 18, 19]), Candidate: [ 3  0  2 -1  2  0  1  0  2  1  0  1  0  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0  0  0  0  0  0 -1  0  0  1  0 -1  0] (Indices: [1, 3, 6, 7, 8, 9, 10, 11, 12, 13, 17, 18]), Candidate: [ 3  0  2 -1  1  2  1  0  1  1  0  1  1  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0  0  0  0 -1  0  1 -1  1  0 -1  1 -1] (Indices: [1, 3, 6, 7, 8, 9, 10, 11, 14, 16, 17, 19]), Candidate: [ 3  0  2 -1  1  2  1  0  1  1  0  0  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0  0  0 -1  0  1  0 -1  1  0 -1  1 -1] (Indices: [1, 3, 6, 7, 8, 9, 10, 13, 14, 16, 17, 19]), Candidate: [ 3  0  2 -1  1  2  1  0  1  1 -1  1  2  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 102200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0  0 -1  1 -1  1  0  0  0 -1  1 -1  0] (Indices: [1, 3, 6, 7, 8, 9, 11, 13, 14, 15, 16, 18]), Candidate: [ 3  0  2 -1  1  2  1  0  1  0  1  0  2  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0 -1  1  0  0  0  0  0 -1  0  1 -1  0] (Indices: [1, 3, 6, 7, 8, 10, 11, 12, 13, 14, 15, 18]), Candidate: [ 3  0  2 -1  1  2  1  0  0  2  0  1  1  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0 -1  1  0 -1  0  1  0  0 -1  1  0 -1] (Indices: [1, 3, 6, 7, 8, 10, 11, 14, 15, 16, 18, 19]), Candidate: [ 3  0  2 -1  1  2  1  0  0  2  0  0  1  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0 -1  0  1  0 -1  1  0 -1  1  0  0 -1] (Indices: [1, 3, 6, 7, 8, 11, 12, 14, 15, 17, 18, 19]), Candidate: [ 3  0  2 -1  1  2  1  0  0  1  1  1  0  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  1  0  0  0 -1  0  1  0 -1  1  0 -1] (Indices: [1, 3, 6, 7, 9, 10, 11, 12, 15, 16, 18, 19]), Candidate: [ 3  0  2 -1  1  2  1 -1  2  1  0  1  0  1  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  1  0 -1  0  1 -1  1  0  0  0  0 -1] (Indices: [1, 3, 6, 7, 9, 10, 13, 15, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  1  2  1 -1  2  1 -1  1  2  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 102500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  0  1  0  0  0 -1  1  0 -1  1  0 -1] (Indices: [1, 3, 6, 7, 10, 11, 12, 13, 15, 16, 18, 19]), Candidate: [ 3  0  2 -1  1  2  1 -1  1  2  0  1  1  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1  0  0  0  0  0 -1  0  1  0 -1  1 -1] (Indices: [1, 3, 6, 8, 9, 10, 11, 12, 13, 16, 17, 19]), Candidate: [ 3  0  2 -1  1  2  0  1  1  1  0  1  1  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1  0  0 -1  1  0 -1  1  0  0 -1  1 -1] (Indices: [1, 3, 6, 8, 9, 10, 12, 13, 15, 16, 17, 19]), Candidate: [ 3  0  2 -1  1  2  0  1  1  1 -1  2  1  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 102650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1  0 -1  0  1  0 -1  1  0  0  0  0 -1] (Indices: [1, 3, 6, 8, 9, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  1  2  0  1  1  0  0  2  1  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  1  0  0  0  0  0  0  0 -1  0  1 -1] (Indices: [1, 3, 6, 9, 10, 11, 12, 13, 14, 15, 16, 19]), Candidate: [ 3  0  2 -1  1  2  0  0  2  1  0  1  1  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  0  1  0 -1  1  0  0  0  0  0  0 -1] (Indices: [1, 3, 6, 10, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  1  2  0  0  1  2  0  0  2  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0  0  0  0 -1  1 -1  1  0 -1  1  0 -1] (Indices: [1, 3, 7, 8, 9, 10, 11, 13, 15, 16, 18, 19]), Candidate: [ 3  0  2 -1  1  1  2  0  1  1  0  0  2  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0  0 -1  1  0  0 -1  1 -1  1  0  0 -1] (Indices: [1, 3, 7, 8, 9, 11, 12, 13, 15, 17, 18, 19]), Candidate: [ 3  0  2 -1  1  1  2  0  1  0  1  1  1  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0 -1  1  0 -1  0  1  0  0  0  0  0 -1] (Indices: [1, 3, 7, 8, 10, 11, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  1  1  2  0  0  2  0  0  1  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 102950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1 -1  1  0 -1  1  0  0 -1  1  0  0  0 -1] (Indices: [1, 3, 7, 9, 10, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  1  1  2 -1  2  1 -1  2  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 103000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  0  1  0  0  0 -1  0  1  0  0  0  0  0 -1] (Indices: [1, 3, 8, 9, 10, 11, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  1  1  1  1  1  1  0  0  1  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0  0  0  0  0 -1  0  1  0 -1  0  0  0] (Indices: [1, 4, 5, 6, 7, 8, 9, 10, 11, 12, 15, 16]), Candidate: [3 0 1 1 1 1 1 0 1 1 0 1 0 1 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 103100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0  0  0 -1  1  0 -1  1  0 -1  0  0  0] (Indices: [1, 4, 5, 6, 7, 8, 9, 10, 12, 13, 15, 16]), Candidate: [ 3  0  1  1  1  1  1  0  1  1 -1  2  1  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0  0  0 -1  0  0  1  0  0  0 -1  0  0] (Indices: [1, 4, 5, 6, 7, 8, 9, 10, 14, 15, 16, 17]), Candidate: [ 3  0  1  1  1  1  1  0  1  1 -1  1  1  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0  0 -1  1 -1  1  0  0  0 -1  0  0  0] (Indices: [1, 4, 5, 6, 7, 8, 9, 11, 13, 14, 15, 16]), Candidate: [3 0 1 1 1 1 1 0 1 0 1 0 2 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 103250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0  0 -1  0  1  0 -1  1 -1  0  1  0 -1] (Indices: [1, 4, 5, 6, 7, 8, 9, 12, 13, 15, 18, 19]), Candidate: [3 0 1 1 1 1 1 0 1 0 0 2 1 0 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 103300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0 -1  1  0  0  0 -1  0  1  0 -1  0  0] (Indices: [1, 4, 5, 6, 7, 8, 10, 11, 12, 13, 16, 17]), Candidate: [3 0 1 1 1 1 1 0 0 2 0 1 1 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 103350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0 -1  1  0 -1  0  1  0 -1  1 -1  1 -1] (Indices: [1, 4, 5, 6, 7, 8, 10, 11, 14, 15, 17, 19]), Candidate: [3 0 1 1 1 1 1 0 0 2 0 0 1 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 103400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0 -1  1 -1  0  1  0  0 -1  1 -1  1 -1] (Indices: [1, 4, 5, 6, 7, 8, 10, 13, 14, 15, 17, 19]), Candidate: [ 3  0  1  1  1  1  1  0  0  2 -1  1  2  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0 -1  0  1  0 -1  0  1 -1  1  0  0 -1] (Indices: [1, 4, 5, 6, 7, 8, 11, 12, 15, 17, 18, 19]), Candidate: [3 0 1 1 1 1 1 0 0 1 1 1 0 1 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 103500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0 -1  0  0  0  0  1  0  0  0  0  0 -1] (Indices: [1, 4, 5, 6, 7, 8, 14, 15, 16, 17, 18, 19]), Candidate: [3 0 1 1 1 1 1 0 0 1 0 1 1 2 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 103550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  1  0  0 -1  1 -1  1 -1  1 -1  1 -1] (Indices: [1, 4, 5, 6, 7, 9, 10, 11, 13, 15, 17, 19]), Candidate: [ 3  0  1  1  1  1  1 -1  2  1  0  0  2  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  1  0 -1  1 -1  1 -1  0  1  0  0 -1] (Indices: [1, 4, 5, 6, 7, 9, 10, 12, 14, 17, 18, 19]), Candidate: [ 3  0  1  1  1  1  1 -1  2  1 -1  2  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 103650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  1 -1  1  0 -1  1  0 -1  1  0 -1  0] (Indices: [1, 4, 5, 6, 7, 9, 11, 12, 14, 15, 17, 18]), Candidate: [ 3  0  1  1  1  1  1 -1  2  0  1  1  0  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  1 -1  0  1 -1  1  0  0 -1  1  0 -1] (Indices: [1, 4, 5, 6, 7, 9, 12, 14, 15, 16, 18, 19]), Candidate: [ 3  0  1  1  1  1  1 -1  2  0  0  2  0  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  0  1  0 -1  1  0  0 -1  1 -1  1 -1] (Indices: [1, 4, 5, 6, 7, 10, 11, 13, 14, 15, 17, 19]), Candidate: [ 3  0  1  1  1  1  1 -1  1  2  0  0  2  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  0  0  1  0  0  0  0 -1  0  1  0 -1] (Indices: [1, 4, 5, 6, 7, 11, 12, 13, 14, 15, 18, 19]), Candidate: [ 3  0  1  1  1  1  1 -1  1  1  1  1  1  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1  0  0  0  0 -1  1 -1  1  0 -1  0  0] (Indices: [1, 4, 5, 6, 8, 9, 10, 11, 12, 14, 16, 17]), Candidate: [ 3  0  1  1  1  1  0  1  1  1  0  1  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 103900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1  0  0  0 -1  0  0  0  1  0  0  0 -1] (Indices: [1, 4, 5, 6, 8, 9, 10, 11, 16, 17, 18, 19]), Candidate: [3 0 1 1 1 1 0 1 1 1 0 0 1 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 103950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1  0  0 -1  0  1 -1  0  1  0  0  0 -1] (Indices: [1, 4, 5, 6, 8, 9, 10, 13, 16, 17, 18, 19]), Candidate: [ 3  0  1  1  1  1  0  1  1  1 -1  1  2  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1  0 -1  1 -1  1  0 -1  1 -1  1  0 -1] (Indices: [1, 4, 5, 6, 8, 9, 11, 13, 14, 16, 18, 19]), Candidate: [ 3  0  1  1  1  1  0  1  1  0  1  0  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1 -1  1  0  0  0  0 -1  0  0  1  0 -1] (Indices: [1, 4, 5, 6, 8, 10, 11, 12, 13, 14, 18, 19]), Candidate: [ 3  0  1  1  1  1  0  1  0  2  0  1  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1 -1  1 -1  1  0  0  0 -1  1  0 -1  0] (Indices: [1, 4, 5, 6, 8, 10, 12, 13, 14, 15, 17, 18]), Candidate: [ 3  0  1  1  1  1  0  1  0  2 -1  2  1  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1 -1  0  1 -1  1  0 -1  1  0  0  0 -1] (Indices: [1, 4, 5, 6, 8, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  0  1  1  1  1  0  1  0  1  1  0  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  1  0  0 -1  1  0  0 -1  1 -1  1 -1] (Indices: [1, 4, 5, 6, 9, 10, 11, 13, 14, 15, 17, 19]), Candidate: [3 0 1 1 1 1 0 0 2 1 0 0 2 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 104250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  1 -1  1  0  0  0  0 -1  0  1  0 -1] (Indices: [1, 4, 5, 6, 9, 11, 12, 13, 14, 15, 18, 19]), Candidate: [3 0 1 1 1 1 0 0 2 0 1 1 1 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 104300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  0  1  0  0 -1  1 -1  1  0  0  0 -1] (Indices: [1, 4, 5, 6, 10, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 3  0  1  1  1  1  0  0  1  2  0  1  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0  0  0  0  0 -1  1 -1  0  0  1  0 -1] (Indices: [1, 4, 5, 7, 8, 9, 10, 11, 12, 14, 18, 19]), Candidate: [ 3  0  1  1  1  0  2  0  1  1  0  1  0  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0  0  0 -1  1  0  0 -1  1  0 -1  0  0] (Indices: [1, 4, 5, 7, 8, 9, 10, 12, 13, 14, 16, 17]), Candidate: [ 3  0  1  1  1  0  2  0  1  1 -1  2  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 104450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0  0  0 -1  0  0  1 -1  1  0  0  0 -1] (Indices: [1, 4, 5, 7, 8, 9, 10, 14, 16, 17, 18, 19]), Candidate: [ 3  0  1  1  1  0  2  0  1  1 -1  1  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 104500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0  0 -1  1 -1  1 -1  1 -1  1  0  0 -1] (Indices: [1, 4, 5, 7, 8, 9, 11, 13, 15, 17, 18, 19]), Candidate: [3 0 1 1 1 0 2 0 1 0 1 0 2 0 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 104550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0 -1  1  0  0  0 -1  1 -1  1 -1  1 -1] (Indices: [1, 4, 5, 7, 8, 10, 11, 12, 13, 15, 17, 19]), Candidate: [3 0 1 1 1 0 2 0 0 2 0 1 1 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 104600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0 -1  1 -1  1  0  0 -1  1 -1  1  0 -1] (Indices: [1, 4, 5, 7, 8, 10, 12, 13, 14, 16, 18, 19]), Candidate: [ 3  0  1  1  1  0  2  0  0  2 -1  2  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 104650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0 -1  0  0  1  0  0  0  0 -1  1  0 -1] (Indices: [1, 4, 5, 7, 8, 12, 13, 14, 15, 16, 18, 19]), Candidate: [3 0 1 1 1 0 2 0 0 1 0 2 1 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 104700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  1  0  0 -1  1  0 -1  0  1  0  0 -1] (Indices: [1, 4, 5, 7, 9, 10, 11, 13, 14, 17, 18, 19]), Candidate: [ 3  0  1  1  1  0  2 -1  2  1  0  0  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 104750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  1 -1  1  0  0 -1  1  0  0  0 -1  0] (Indices: [1, 4, 5, 7, 9, 11, 12, 13, 15, 16, 17, 18]), Candidate: [ 3  0  1  1  1  0  2 -1  2  0  1  1  1  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  0  1  0 -1  1  0  0 -1  1  0  0 -1] (Indices: [1, 4, 5, 7, 10, 11, 13, 14, 15, 17, 18, 19]), Candidate: [ 3  0  1  1  1  0  2 -1  1  2  0  0  2  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1  0  0  0  0 -1  1 -1  0  1  0  0 -1] (Indices: [1, 4, 5, 8, 9, 10, 11, 12, 14, 17, 18, 19]), Candidate: [ 3  0  1  1  1  0  1  1  1  1  0  1  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1  0  0 -1  0  1  0  0  0 -1  1  0 -1] (Indices: [1, 4, 5, 8, 9, 10, 13, 14, 15, 16, 18, 19]), Candidate: [ 3  0  1  1  1  0  1  1  1  1 -1  1  2  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 104950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1 -1  1  0  0  0  0 -1  0  1  0  0 -1] (Indices: [1, 4, 5, 8, 10, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 3  0  1  1  1  0  1  1  0  2  0  1  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  0  1  0  0  0  0 -1  0  1  0  0  0 -1] (Indices: [1, 4, 5, 9, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [3 0 1 1 1 0 1 0 2 1 0 1 1 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 105050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0  0  0  0  0  0 -1  0  1  0 -1  0  0] (Indices: [1, 4, 6, 7, 8, 9, 10, 11, 12, 13, 16, 17]), Candidate: [3 0 1 1 0 2 1 0 1 1 0 1 1 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 105100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0  0  0  0 -1  0  1  0 -1  1 -1  1 -1] (Indices: [1, 4, 6, 7, 8, 9, 10, 11, 14, 15, 17, 19]), Candidate: [3 0 1 1 0 2 1 0 1 1 0 0 1 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 105150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0  0  0 -1  0  1  0  0 -1  1 -1  1 -1] (Indices: [1, 4, 6, 7, 8, 9, 10, 13, 14, 15, 17, 19]), Candidate: [ 3  0  1  1  0  2  1  0  1  1 -1  1  2  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0  0 -1  1  0 -1  0  1 -1  1  0  0 -1] (Indices: [1, 4, 6, 7, 8, 9, 11, 12, 15, 17, 18, 19]), Candidate: [3 0 1 1 0 2 1 0 1 0 1 1 0 1 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 105250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0  0 -1  0  0  0  1  0  0  0  0  0 -1] (Indices: [1, 4, 6, 7, 8, 9, 14, 15, 16, 17, 18, 19]), Candidate: [3 0 1 1 0 2 1 0 1 0 0 1 1 2 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 105300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0 -1  1  0 -1  1 -1  0  1  0  0  0 -1] (Indices: [1, 4, 6, 7, 8, 10, 11, 13, 16, 17, 18, 19]), Candidate: [3 0 1 1 0 2 1 0 0 2 0 0 2 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 105350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0 -1  0  1  0 -1  1  0  0  0  0 -1  0] (Indices: [1, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18]), Candidate: [3 0 1 1 0 2 1 0 0 1 1 1 0 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 105400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  1  0  0  0 -1  1 -1  0  1  0  0 -1] (Indices: [1, 4, 6, 7, 9, 10, 11, 12, 14, 17, 18, 19]), Candidate: [ 3  0  1  1  0  2  1 -1  2  1  0  1  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 105450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  1  0 -1  0  1  0  0  0 -1  1  0 -1] (Indices: [1, 4, 6, 7, 9, 10, 13, 14, 15, 16, 18, 19]), Candidate: [ 3  0  1  1  0  2  1 -1  2  1 -1  1  2  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 105500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  0  1  0  0  0  0 -1  0  1  0  0 -1] (Indices: [1, 4, 6, 7, 10, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 3  0  1  1  0  2  1 -1  1  2  0  1  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 105550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1  0  0  0  0  0 -1  1 -1  1 -1  1 -1] (Indices: [1, 4, 6, 8, 9, 10, 11, 12, 13, 15, 17, 19]), Candidate: [3 0 1 1 0 2 0 1 1 1 0 1 1 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 105600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1  0  0 -1  1  0  0 -1  1 -1  1  0 -1] (Indices: [1, 4, 6, 8, 9, 10, 12, 13, 14, 16, 18, 19]), Candidate: [ 3  0  1  1  0  2  0  1  1  1 -1  2  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 105650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1  0 -1  0  1  0  0  0  0 -1  1  0 -1] (Indices: [1, 4, 6, 8, 9, 12, 13, 14, 15, 16, 18, 19]), Candidate: [3 0 1 1 0 2 0 1 1 0 0 2 1 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 105700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1 -1  0  0  1  0  0  0  0  0  0  0 -1] (Indices: [1, 4, 6, 8, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [3 0 1 1 0 2 0 1 0 1 0 2 1 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 105750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  0  0  1  0  0  0  0 -1  1  0  0  0 -1] (Indices: [1, 4, 6, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  0  1  1  0  2  0  0  1  2  0  1  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0  0  0  0 -1  1  0 -1  0  1  0  0 -1] (Indices: [1, 4, 7, 8, 9, 10, 11, 13, 14, 17, 18, 19]), Candidate: [ 3  0  1  1  0  1  2  0  1  1  0  0  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 105850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0  0 -1  1  0  0 -1  1  0  0  0 -1  0] (Indices: [1, 4, 7, 8, 9, 11, 12, 13, 15, 16, 17, 18]), Candidate: [3 0 1 1 0 1 2 0 1 0 1 1 1 0 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 105900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0 -1  1  0 -1  1  0  0 -1  1  0  0 -1] (Indices: [1, 4, 7, 8, 10, 11, 13, 14, 15, 17, 18, 19]), Candidate: [3 0 1 1 0 1 2 0 0 2 0 0 2 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 105950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1 -1  1  0 -1  1  0  0  0  0  0 -1  1 -1] (Indices: [1, 4, 7, 9, 10, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 3  0  1  1  0  1  2 -1  2  1 -1  2  1  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 106000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  0  1  0  0  0 -1  1  0  0 -1  1  0  0 -1] (Indices: [1, 4, 8, 9, 10, 11, 13, 14, 15, 17, 18, 19]), Candidate: [3 0 1 1 0 1 1 1 1 1 0 0 2 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 106050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0  0  0  0  0  0 -1  1 -1  0  0  1 -1] (Indices: [1, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 19]), Candidate: [3 0 1 0 2 1 1 0 1 1 0 1 1 0 1 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 106100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0  0  0  0 -1  0  1  0 -1  1  0 -1  0] (Indices: [1, 5, 6, 7, 8, 9, 10, 11, 14, 15, 17, 18]), Candidate: [3 0 1 0 2 1 1 0 1 1 0 0 1 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 106150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0  0  0 -1  0  1  0  0 -1  1  0 -1  0] (Indices: [1, 5, 6, 7, 8, 9, 10, 13, 14, 15, 17, 18]), Candidate: [ 3  0  1  0  2  1  1  0  1  1 -1  1  2  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 106200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0  0 -1  1  0 -1  0  1  0 -1  1  0 -1] (Indices: [1, 5, 6, 7, 8, 9, 11, 12, 15, 16, 18, 19]), Candidate: [3 0 1 0 2 1 1 0 1 0 1 1 0 1 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 106250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0  0 -1  0  0  1 -1  1  0  0  0  0 -1] (Indices: [1, 5, 6, 7, 8, 9, 13, 15, 16, 17, 18, 19]), Candidate: [3 0 1 0 2 1 1 0 1 0 0 1 2 0 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 106300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0 -1  1  0 -1  1 -1  1 -1  1  0  0 -1] (Indices: [1, 5, 6, 7, 8, 10, 11, 13, 15, 17, 18, 19]), Candidate: [3 0 1 0 2 1 1 0 0 2 0 0 2 0 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 106350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0 -1  0  1  0  0 -1  0  1  0  0  0 -1] (Indices: [1, 5, 6, 7, 8, 11, 12, 13, 16, 17, 18, 19]), Candidate: [3 0 1 0 2 1 1 0 0 1 1 1 1 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 106400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  1  0  0  0 -1  1 -1  1 -1  1  0 -1] (Indices: [1, 5, 6, 7, 9, 10, 11, 12, 14, 16, 18, 19]), Candidate: [ 3  0  1  0  2  1  1 -1  2  1  0  1  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 106450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  1  0 -1  0  1  0  0  0  0 -1  1 -1] (Indices: [1, 5, 6, 7, 9, 10, 13, 14, 15, 16, 17, 19]), Candidate: [ 3  0  1  0  2  1  1 -1  2  1 -1  1  2  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 106500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  0  1  0  0  0  0 -1  1 -1  1  0 -1] (Indices: [1, 5, 6, 7, 10, 11, 12, 13, 14, 16, 18, 19]), Candidate: [ 3  0  1  0  2  1  1 -1  1  2  0  1  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 106550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1  0  0  0  0  0 -1  1 -1  1  0 -1  0] (Indices: [1, 5, 6, 8, 9, 10, 11, 12, 13, 15, 17, 18]), Candidate: [3 0 1 0 2 1 0 1 1 1 0 1 1 0 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 106600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1  0  0 -1  1  0  0 -1  1  0 -1  1 -1] (Indices: [1, 5, 6, 8, 9, 10, 12, 13, 14, 16, 17, 19]), Candidate: [ 3  0  1  0  2  1  0  1  1  1 -1  2  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 106650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1  0 -1  0  1  0  0  0  0  0 -1  1 -1] (Indices: [1, 5, 6, 8, 9, 12, 13, 14, 15, 16, 17, 19]), Candidate: [3 0 1 0 2 1 0 1 1 0 0 2 1 1 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 106700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1 -1  0  1 -1  1  0  0  0  0  0  0 -1] (Indices: [1, 5, 6, 8, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [3 0 1 0 2 1 0 1 0 1 1 0 2 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 106750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  0  0  1  0  0  0  0  0 -1  1  0  0 -1] (Indices: [1, 5, 6, 10, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [3 0 1 0 2 1 0 0 1 2 0 1 1 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 106800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0  0  0  0 -1  1  0 -1  1 -1  1  0 -1] (Indices: [1, 5, 7, 8, 9, 10, 11, 13, 14, 16, 18, 19]), Candidate: [ 3  0  1  0  2  0  2  0  1  1  0  0  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 106850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0  0 -1  1  0  0  0 -1  0  1  0  0 -1] (Indices: [1, 5, 7, 8, 9, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 3  0  1  0  2  0  2  0  1  0  1  1  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 106900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0 -1  1  0 -1  1  0  0  0 -1  1  0 -1] (Indices: [1, 5, 7, 8, 10, 11, 13, 14, 15, 16, 18, 19]), Candidate: [3 0 1 0 2 0 2 0 0 2 0 0 2 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 106950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1 -1  1  0 -1  1  0  0  0  0  0  0 -1  0] (Indices: [1, 5, 7, 9, 10, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 3  0  1  0  2  0  2 -1  2  1 -1  2  1  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 107000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1  0  0  0 -1  1  0  0  0 -1  1  0 -1] (Indices: [1, 5, 8, 9, 10, 11, 13, 14, 15, 16, 18, 19]), Candidate: [3 0 1 0 2 0 1 1 1 1 0 0 2 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 107050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0  0  0  0  0  0  0 -1  0  1  0 -1  0] (Indices: [1, 6, 7, 8, 9, 10, 11, 12, 13, 14, 17, 18]), Candidate: [ 3  0  1  0  1  2  1  0  1  1  0  1  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0  0  0 -1  1  0  0  0  0 -1  1 -1  0] (Indices: [1, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16, 18]), Candidate: [ 3  0  1  0  1  2  1  0  1  1 -1  2  1  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0  0 -1  1 -1  1  0  0  0 -1  1  0 -1] (Indices: [1, 6, 7, 8, 9, 11, 13, 14, 15, 16, 18, 19]), Candidate: [3 0 1 0 1 2 1 0 1 0 1 0 2 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 107200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0 -1  0  1  0  0  0  0  0  0 -1  1 -1] (Indices: [1, 6, 7, 8, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [3 0 1 0 1 2 1 0 0 1 1 1 1 1 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 107250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0 -1  1 -1  1  0 -1  1  0  0  0  0  0 -1] (Indices: [1, 6, 7, 9, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  0  1  0  1  2  1 -1  2  0  1  1  0  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1 -1  1  0 -1  1  0  0  0  0  0  0 -1  1 -1] (Indices: [1, 6, 8, 9, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [3 0 1 0 1 2 0 1 1 0 1 1 1 1 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 107350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0  0  0  0 -1  1  0  0  0  0  0 -1  0] (Indices: [1, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 18]), Candidate: [3 0 1 0 1 1 2 0 1 1 0 0 2 1 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 107400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  0  1  0  0  0  0  0 -1  1  0  0  0  0 -1] (Indices: [1, 8, 9, 10, 11, 12, 13, 15, 16, 17, 18, 19]), Candidate: [3 0 1 0 1 1 1 1 1 1 0 1 1 0 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 107450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0  0  0 -1  1 -1  0  0  1  0 -1  0  0] (Indices: [2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 16, 17]), Candidate: [ 2  2  1  0  1  1  1  0  1  1 -1  2  0  1  0  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0  0 -1  1  0 -1  1 -1  0  0  1 -1  0] (Indices: [2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 14, 18]), Candidate: [ 2  2  1  0  1  1  1  0  1  0  1  1  0  2 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0  0 -1  0  1  0  0 -1  0  0  1 -1  0] (Indices: [2, 3, 4, 5, 6, 7, 8, 9, 12, 13, 14, 18]), Candidate: [ 2  2  1  0  1  1  1  0  1  0  0  2  1  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0  0 -1  0  0  1 -1  0  1 -1  1  0 -1] (Indices: [2, 3, 4, 5, 6, 7, 8, 9, 13, 16, 18, 19]), Candidate: [2 2 1 0 1 1 1 0 1 0 0 1 2 0 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 107650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0 -1  1  0 -1  1 -1  0  0  1  0 -1  0] (Indices: [2, 3, 4, 5, 6, 7, 8, 10, 11, 13, 17, 18]), Candidate: [2 2 1 0 1 1 1 0 0 2 0 0 2 0 0 1 2 1 0 6]
 -> Valid neighbor added.
Attempt 107700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0 -1  1 -1  1 -1  0  1  0 -1  0  1 -1] (Indices: [2, 3, 4, 5, 6, 7, 8, 10, 12, 15, 16, 19]), Candidate: [ 2  2  1  0  1  1  1  0  0  2 -1  2  0  1  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0 -1  0  1  0  0 -1  1 -1  0  1 -1  0] (Indices: [2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 15, 18]), Candidate: [2 2 1 0 1 1 1 0 0 1 1 1 1 0 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 107800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0 -1  0  1 -1  0  1  0  0 -1  0  1 -1] (Indices: [2, 3, 4, 5, 6, 7, 8, 11, 14, 15, 16, 19]), Candidate: [2 2 1 0 1 1 1 0 0 1 1 0 1 2 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 107850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0 -1  0  0  0  1  0  0  0 -1  0  1 -1] (Indices: [2, 3, 4, 5, 6, 7, 8, 13, 14, 15, 16, 19]), Candidate: [2 2 1 0 1 1 1 0 0 1 0 1 2 1 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 107900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  1  0  0 -1  1 -1  0  1 -1  1 -1  0] (Indices: [2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 16, 18]), Candidate: [ 2  2  1  0  1  1  1 -1  2  1  0  0  2  0  0  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 107950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  1  0 -1  1 -1  0  1  0  0 -1  0  0] (Indices: [2, 3, 4, 5, 6, 7, 9, 10, 12, 15, 16, 17]), Candidate: [ 2  2  1  0  1  1  1 -1  2  1 -1  2  0  1  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 108000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  1 -1  1  0  0 -1  1  0 -1  0  0  0] (Indices: [2, 3, 4, 5, 6, 7, 9, 11, 12, 13, 15, 16]), Candidate: [ 2  2  1  0  1  1  1 -1  2  0  1  1  1  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  1 -1  1 -1  0  1  0  0  0 -1  0  0] (Indices: [2, 3, 4, 5, 6, 7, 9, 11, 14, 15, 16, 17]), Candidate: [ 2  2  1  0  1  1  1 -1  2  0  1  0  1  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  1 -1  0  0  1  0  0  0  0 -1  0  0] (Indices: [2, 3, 4, 5, 6, 7, 9, 13, 14, 15, 16, 17]), Candidate: [ 2  2  1  0  1  1  1 -1  2  0  0  1  2  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  0  1  0  0 -1  0  1 -1  1 -1  1 -1] (Indices: [2, 3, 4, 5, 6, 7, 10, 11, 12, 15, 17, 19]), Candidate: [ 2  2  1  0  1  1  1 -1  1  2  0  1  0  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  0  1 -1  1  0  0 -1  0  0  1  0 -1] (Indices: [2, 3, 4, 5, 6, 7, 10, 12, 13, 14, 18, 19]), Candidate: [ 2  2  1  0  1  1  1 -1  1  2 -1  2  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 108250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  0  0  1  0  0  0  0 -1  0  0  1 -1] (Indices: [2, 3, 4, 5, 6, 7, 11, 12, 13, 14, 15, 19]), Candidate: [ 2  2  1  0  1  1  1 -1  1  1  1  1  1  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  0  0  1 -1  0  1  0 -1  1  0  0 -1] (Indices: [2, 3, 4, 5, 6, 7, 11, 14, 15, 17, 18, 19]), Candidate: [ 2  2  1  0  1  1  1 -1  1  1  1  0  1  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1  0  0  0  0 -1  0  0  0  1 -1  1 -1] (Indices: [2, 3, 4, 5, 6, 8, 9, 10, 11, 12, 17, 19]), Candidate: [2 2 1 0 1 1 0 1 1 1 0 1 0 1 0 1 2 0 2 5]
 -> Valid neighbor added.
Attempt 108400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1  0  0 -1  1  0 -1  0  0  1 -1  1 -1] (Indices: [2, 3, 4, 5, 6, 8, 9, 10, 12, 13, 17, 19]), Candidate: [ 2  2  1  0  1  1  0  1  1  1 -1  2  1  0  0  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1  0  0 -1  0  0  1 -1  1 -1  1  0 -1] (Indices: [2, 3, 4, 5, 6, 8, 9, 10, 14, 16, 18, 19]), Candidate: [ 2  2  1  0  1  1  0  1  1  1 -1  1  1  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 108500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1  0 -1  1 -1  1  0 -1  0  1 -1  1 -1] (Indices: [2, 3, 4, 5, 6, 8, 9, 11, 13, 14, 17, 19]), Candidate: [ 2  2  1  0  1  1  0  1  1  0  1  0  2  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1  0 -1  0  1 -1  1  0 -1  1  0 -1  0] (Indices: [2, 3, 4, 5, 6, 8, 9, 12, 14, 15, 17, 18]), Candidate: [2 2 1 0 1 1 0 1 1 0 0 2 0 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 108600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1 -1  1  0  0 -1  1  0 -1  0  1 -1  0] (Indices: [2, 3, 4, 5, 6, 8, 10, 11, 12, 14, 15, 18]), Candidate: [2 2 1 0 1 1 0 1 0 2 0 1 0 2 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 108650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1 -1  1  0 -1  0  0  1  0 -1  1  0 -1] (Indices: [2, 3, 4, 5, 6, 8, 10, 11, 15, 16, 18, 19]), Candidate: [2 2 1 0 1 1 0 1 0 2 0 0 1 1 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 108700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1 -1  1 -1  0  1 -1  1  0 -1  1  0 -1] (Indices: [2, 3, 4, 5, 6, 8, 10, 13, 15, 16, 18, 19]), Candidate: [ 2  2  1  0  1  1  0  1  0  2 -1  1  2  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1 -1  0  1 -1  1  0 -1  1  0  0 -1  0] (Indices: [2, 3, 4, 5, 6, 8, 11, 13, 14, 16, 17, 18]), Candidate: [ 2  2  1  0  1  1  0  1  0  1  1  0  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  1  0  0  0  0 -1  1 -1  0  1 -1  0] (Indices: [2, 3, 4, 5, 6, 9, 10, 11, 12, 13, 15, 18]), Candidate: [2 2 1 0 1 1 0 0 2 1 0 1 1 0 1 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 108850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  1  0  0 -1  0  1  0  0 -1  0  1 -1] (Indices: [2, 3, 4, 5, 6, 9, 10, 11, 14, 15, 16, 19]), Candidate: [2 2 1 0 1 1 0 0 2 1 0 0 1 2 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 108900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  1  0 -1  0  1  0  0  0 -1  0  1 -1] (Indices: [2, 3, 4, 5, 6, 9, 10, 13, 14, 15, 16, 19]), Candidate: [ 2  2  1  0  1  1  0  0  2  1 -1  1  2  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 108950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  1 -1  1  0 -1  0  1  0  0 -1  1 -1] (Indices: [2, 3, 4, 5, 6, 9, 11, 12, 15, 16, 17, 19]), Candidate: [2 2 1 0 1 1 0 0 2 0 1 1 0 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 109000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  1 -1  0  0  1  0 -1  1  0  0  0 -1] (Indices: [2, 3, 4, 5, 6, 9, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  2  1  0  1  1  0  0  2  0  0  1  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  0  1  0 -1  1 -1  1  0 -1  1  0 -1] (Indices: [2, 3, 4, 5, 6, 10, 11, 13, 15, 16, 18, 19]), Candidate: [2 2 1 0 1 1 0 0 1 2 0 0 2 0 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 109100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  0  0  1  0  0 -1  1 -1  1  0  0 -1] (Indices: [2, 3, 4, 5, 6, 11, 12, 13, 15, 17, 18, 19]), Candidate: [2 2 1 0 1 1 0 0 1 1 1 1 1 0 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 109150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0  0  0  0 -1  1 -1  1 -1  1 -1  0  0] (Indices: [2, 3, 4, 5, 7, 8, 9, 10, 11, 13, 15, 17]), Candidate: [2 2 1 0 1 0 2 0 1 1 0 0 2 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 109200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0  0  0 -1  1 -1  1 -1  1 -1  0  1 -1] (Indices: [2, 3, 4, 5, 7, 8, 9, 10, 12, 14, 16, 19]), Candidate: [ 2  2  1  0  1  0  2  0  1  1 -1  2  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 109250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0  0 -1  1  0  0  0 -1  1 -1  0  0  0] (Indices: [2, 3, 4, 5, 7, 8, 9, 11, 12, 13, 14, 16]), Candidate: [ 2  2  1  0  1  0  2  0  1  0  1  1  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0  0 -1  1 -1  1 -1  0  1  0  0 -1  0] (Indices: [2, 3, 4, 5, 7, 8, 9, 11, 13, 16, 17, 18]), Candidate: [2 2 1 0 1 0 2 0 1 0 1 0 2 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 109350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0  0 -1  0  1 -1  0  1  0  0 -1  1 -1] (Indices: [2, 3, 4, 5, 7, 8, 9, 12, 15, 16, 17, 19]), Candidate: [2 2 1 0 1 0 2 0 1 0 0 2 0 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 109400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0 -1  1  0  0 -1  0  1  0  0 -1  0  0] (Indices: [2, 3, 4, 5, 7, 8, 10, 11, 12, 15, 16, 17]), Candidate: [2 2 1 0 1 0 2 0 0 2 0 1 0 1 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 109450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0 -1  1 -1  1  0  0 -1  1 -1  1 -1  0] (Indices: [2, 3, 4, 5, 7, 8, 10, 12, 13, 14, 16, 18]), Candidate: [ 2  2  1  0  1  0  2  0  0  2 -1  2  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 109500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0 -1  1 -1  0  0  0  1  0  0  0  0 -1] (Indices: [2, 3, 4, 5, 7, 8, 10, 15, 16, 17, 18, 19]), Candidate: [ 2  2  1  0  1  0  2  0  0  2 -1  1  1  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0 -1  0  1 -1  1 -1  0  1  0  0  0 -1] (Indices: [2, 3, 4, 5, 7, 8, 11, 13, 16, 17, 18, 19]), Candidate: [2 2 1 0 1 0 2 0 0 1 1 0 2 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 109600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  1  0  0  0 -1  1  0  0 -1  0  0  0] (Indices: [2, 3, 4, 5, 7, 9, 10, 11, 12, 14, 15, 16]), Candidate: [ 2  2  1  0  1  0  2 -1  2  1  0  1  0  2  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  1  0  0 -1  0  0  1  0  0  0 -1  0] (Indices: [2, 3, 4, 5, 7, 9, 10, 11, 15, 16, 17, 18]), Candidate: [ 2  2  1  0  1  0  2 -1  2  1  0  0  1  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  1  0 -1  0  1 -1  1  0  0  0 -1  0] (Indices: [2, 3, 4, 5, 7, 9, 10, 13, 15, 16, 17, 18]), Candidate: [ 2  2  1  0  1  0  2 -1  2  1 -1  1  2  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 109750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  1 -1  1 -1  1  0  0 -1  1 -1  1 -1] (Indices: [2, 3, 4, 5, 7, 9, 11, 13, 14, 15, 17, 19]), Candidate: [ 2  2  1  0  1  0  2 -1  2  0  1  0  2  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  0  1  0  0  0  0 -1  1 -1  1 -1  0] (Indices: [2, 3, 4, 5, 7, 10, 11, 12, 13, 14, 16, 18]), Candidate: [ 2  2  1  0  1  0  2 -1  1  2  0  1  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 109850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  0  1  0 -1  0  0  1  0  0  0  0 -1] (Indices: [2, 3, 4, 5, 7, 10, 11, 15, 16, 17, 18, 19]), Candidate: [ 2  2  1  0  1  0  2 -1  1  2  0  0  1  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  0  0  1 -1  1  0  0  0  0  0 -1  0] (Indices: [2, 3, 4, 5, 7, 11, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  2  1  0  1  0  2 -1  1  1  1  0  2  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 109950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1  0  0  0 -1  1  0  0  0 -1  0  0  0] (Indices: [2, 3, 4, 5, 8, 9, 10, 11, 13, 14, 15, 16]), Candidate: [2 2 1 0 1 0 1 1 1 1 0 0 2 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 110000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1  0  0 -1  1  0 -1  1 -1  0  1  0 -1] (Indices: [2, 3, 4, 5, 8, 9, 10, 12, 13, 15, 18, 19]), Candidate: [ 2  2  1  0  1  0  1  1  1  1 -1  2  1  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1  0 -1  1  0  0  0 -1  0  0  1  0 -1] (Indices: [2, 3, 4, 5, 8, 9, 11, 12, 13, 14, 18, 19]), Candidate: [ 2  2  1  0  1  0  1  1  1  0  1  1  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1  0 -1  0  1  0  0  0 -1  1  0 -1  0] (Indices: [2, 3, 4, 5, 8, 9, 12, 13, 14, 15, 17, 18]), Candidate: [2 2 1 0 1 0 1 1 1 0 0 2 1 1 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 110150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1 -1  1  0  0 -1  1  0 -1  0  1  0 -1] (Indices: [2, 3, 4, 5, 8, 10, 11, 12, 14, 15, 18, 19]), Candidate: [2 2 1 0 1 0 1 1 0 2 0 1 0 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 110200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1 -1  1 -1  1 -1  1 -1  1  0  0  0 -1] (Indices: [2, 3, 4, 5, 8, 10, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  2  1  0  1  0  1  1  0  2 -1  2  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 110250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  1  0  0  0  0  0 -1  1 -1  1 -1  0] (Indices: [2, 3, 4, 5, 9, 10, 11, 12, 13, 14, 16, 18]), Candidate: [ 2  2  1  0  1  0  1  0  2  1  0  1  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  1  0  0 -1  0  0  1  0  0  0  0 -1] (Indices: [2, 3, 4, 5, 9, 10, 11, 15, 16, 17, 18, 19]), Candidate: [2 2 1 0 1 0 1 0 2 1 0 0 1 1 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 110350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  1 -1  1 -1  1  0  0  0  0  0 -1  0] (Indices: [2, 3, 4, 5, 9, 11, 13, 14, 15, 16, 17, 18]), Candidate: [2 2 1 0 1 0 1 0 2 0 1 0 2 1 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 110400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  0  1 -1  0  1  0  0  0  0  0  0 -1] (Indices: [2, 3, 4, 5, 10, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  2  1  0  1  0  1  0  1  2 -1  1  2  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0  0  0  0 -1  0  1 -1  1  0 -1  0  0] (Indices: [2, 3, 4, 6, 7, 8, 9, 10, 11, 14, 16, 17]), Candidate: [ 2  2  1  0  0  2  1  0  1  1  0  0  1  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0  0  0 -1  1 -1  0  0  0  1  0  0 -1] (Indices: [2, 3, 4, 6, 7, 8, 9, 10, 12, 17, 18, 19]), Candidate: [ 2  2  1  0  0  2  1  0  1  1 -1  2  0  1  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0  0 -1  1  0  0 -1  0  0  0  1  0 -1] (Indices: [2, 3, 4, 6, 7, 8, 9, 11, 12, 13, 18, 19]), Candidate: [2 2 1 0 0 2 1 0 1 0 1 1 1 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 110600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0  0 -1  1 -1  0  1 -1  0  1  0  0 -1] (Indices: [2, 3, 4, 6, 7, 8, 9, 11, 14, 17, 18, 19]), Candidate: [ 2  2  1  0  0  2  1  0  1  0  1  0  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0  0 -1  0  0  1  0 -1  0  1  0  0 -1] (Indices: [2, 3, 4, 6, 7, 8, 9, 13, 14, 17, 18, 19]), Candidate: [ 2  2  1  0  0  2  1  0  1  0  0  1  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0 -1  1  0 -1  1  0  0 -1  0  0  1 -1] (Indices: [2, 3, 4, 6, 7, 8, 10, 11, 13, 14, 15, 19]), Candidate: [2 2 1 0 0 2 1 0 0 2 0 0 2 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 110750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0 -1  1 -1  1  0 -1  0  1 -1  1  0 -1] (Indices: [2, 3, 4, 6, 7, 8, 10, 12, 13, 16, 18, 19]), Candidate: [ 2  2  1  0  0  2  1  0  0  2 -1  2  1  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0 -1  0  1  0  0 -1  1  0 -1  0  1 -1] (Indices: [2, 3, 4, 6, 7, 8, 11, 12, 13, 15, 16, 19]), Candidate: [2 2 1 0 0 2 1 0 0 1 1 1 1 0 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 110850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0 -1  0  0  1  0  0 -1  1  0  0 -1  0] (Indices: [2, 3, 4, 6, 7, 8, 12, 13, 14, 16, 17, 18]), Candidate: [ 2  2  1  0  0  2  1  0  0  1  0  2  1  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  1  0  0  0 -1  0  1 -1  1  0 -1  0] (Indices: [2, 3, 4, 6, 7, 9, 10, 11, 12, 15, 17, 18]), Candidate: [ 2  2  1  0  0  2  1 -1  2  1  0  1  0  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 110950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  1  0 -1  1  0  0 -1  0  1 -1  1 -1] (Indices: [2, 3, 4, 6, 7, 9, 10, 12, 13, 14, 17, 19]), Candidate: [ 2  2  1  0  0  2  1 -1  2  1 -1  2  1  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 111000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  1 -1  1  0  0  0  0 -1  0  1 -1  0] (Indices: [2, 3, 4, 6, 7, 9, 11, 12, 13, 14, 15, 18]), Candidate: [ 2  2  1  0  0  2  1 -1  2  0  1  1  1  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  1 -1  1 -1  0  1  0  0 -1  1  0 -1] (Indices: [2, 3, 4, 6, 7, 9, 11, 14, 15, 16, 18, 19]), Candidate: [ 2  2  1  0  0  2  1 -1  2  0  1  0  1  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  0  1  0  0  0 -1  0  1 -1  1  0 -1] (Indices: [2, 3, 4, 6, 7, 10, 11, 12, 13, 16, 18, 19]), Candidate: [ 2  2  1  0  0  2  1 -1  1  2  0  1  1  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  0  1 -1  1  0 -1  1  0 -1  1  0 -1] (Indices: [2, 3, 4, 6, 7, 10, 12, 13, 15, 16, 18, 19]), Candidate: [ 2  2  1  0  0  2  1 -1  1  2 -1  2  1  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 111200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  0  0  0  1 -1  1  0  0  0  0  0 -1] (Indices: [2, 3, 4, 6, 7, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  2  1  0  0  2  1 -1  1  1  0  2  0  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1  0  0  0 -1  1 -1  1 -1  1  0 -1  0] (Indices: [2, 3, 4, 6, 8, 9, 10, 11, 13, 15, 17, 18]), Candidate: [2 2 1 0 0 2 0 1 1 1 0 0 2 0 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 111300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1  0  0 -1  1 -1  1 -1  1 -1  1  0 -1] (Indices: [2, 3, 4, 6, 8, 9, 10, 12, 14, 16, 18, 19]), Candidate: [ 2  2  1  0  0  2  0  1  1  1 -1  2  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 111350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1  0 -1  1  0 -1  1  0  0 -1  0  1 -1] (Indices: [2, 3, 4, 6, 8, 9, 11, 12, 14, 15, 16, 19]), Candidate: [2 2 1 0 0 2 0 1 1 0 1 1 0 2 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 111400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1  0 -1  0  1 -1  1  0  0  0 -1  1 -1] (Indices: [2, 3, 4, 6, 8, 9, 12, 14, 15, 16, 17, 19]), Candidate: [2 2 1 0 0 2 0 1 1 0 0 2 0 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 111450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1 -1  1  0 -1  1  0  0 -1  1  0 -1  0] (Indices: [2, 3, 4, 6, 8, 10, 11, 13, 14, 15, 17, 18]), Candidate: [2 2 1 0 0 2 0 1 0 2 0 0 2 1 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 111500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1 -1  0  1  0  0  0  0 -1  1 -1  1 -1] (Indices: [2, 3, 4, 6, 8, 11, 12, 13, 14, 15, 17, 19]), Candidate: [2 2 1 0 0 2 0 1 0 1 1 1 1 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 111550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  1  0  0  0  0 -1  0  1 -1  1  0 -1] (Indices: [2, 3, 4, 6, 9, 10, 11, 12, 13, 16, 18, 19]), Candidate: [2 2 1 0 0 2 0 0 2 1 0 1 1 0 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 111600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  1  0 -1  1  0 -1  1  0 -1  1  0 -1] (Indices: [2, 3, 4, 6, 9, 10, 12, 13, 15, 16, 18, 19]), Candidate: [ 2  2  1  0  0  2  0  0  2  1 -1  2  1  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  1 -1  0  1 -1  1  0  0  0  0  0 -1] (Indices: [2, 3, 4, 6, 9, 12, 14, 15, 16, 17, 18, 19]), Candidate: [2 2 1 0 0 2 0 0 2 0 0 2 0 2 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 111700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0  0  0  0  0  0  0 -1  0  0  1 -1  0] (Indices: [2, 3, 4, 7, 8, 9, 10, 11, 12, 13, 14, 18]), Candidate: [ 2  2  1  0  0  1  2  0  1  1  0  1  1  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0  0  0  0 -1  1 -1  0  1 -1  1  0 -1] (Indices: [2, 3, 4, 7, 8, 9, 10, 11, 13, 16, 18, 19]), Candidate: [2 2 1 0 0 1 2 0 1 1 0 0 2 0 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 111800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0  0  0 -1  1 -1  0  1 -1  1  0  0 -1] (Indices: [2, 3, 4, 7, 8, 9, 10, 12, 15, 17, 18, 19]), Candidate: [ 2  2  1  0  0  1  2  0  1  1 -1  2  0  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0  0 -1  1  0 -1  1 -1  1  0 -1  1 -1] (Indices: [2, 3, 4, 7, 8, 9, 11, 12, 14, 16, 17, 19]), Candidate: [ 2  2  1  0  0  1  2  0  1  0  1  1  0  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 111900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0  0 -1  0  0  1  0  0  0  0  0 -1  0] (Indices: [2, 3, 4, 7, 8, 9, 13, 14, 15, 16, 17, 18]), Candidate: [2 2 1 0 0 1 2 0 1 0 0 1 2 1 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 111950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0 -1  1  0 -1  1  0 -1  1 -1  1  0 -1] (Indices: [2, 3, 4, 7, 8, 10, 11, 13, 14, 16, 18, 19]), Candidate: [ 2  2  1  0  0  1  2  0  0  2  0  0  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0 -1  0  1  0  0  0 -1  0  1  0  0 -1] (Indices: [2, 3, 4, 7, 8, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  2  1  0  0  1  2  0  0  1  1  1  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  1  0  0  0 -1  1  0 -1  1  0 -1  0] (Indices: [2, 3, 4, 7, 9, 10, 11, 12, 14, 15, 17, 18]), Candidate: [ 2  2  1  0  0  1  2 -1  2  1  0  1  0  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  1  0 -1  1 -1  1  0  0 -1  1  0 -1] (Indices: [2, 3, 4, 7, 9, 10, 12, 14, 15, 16, 18, 19]), Candidate: [ 2  2  1  0  0  1  2 -1  2  1 -1  2  0  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 112150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  0  1  0  0  0  0  0 -1  1  0 -1  0] (Indices: [2, 3, 4, 7, 10, 11, 12, 13, 14, 15, 17, 18]), Candidate: [ 2  2  1  0  0  1  2 -1  1  2  0  1  1  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1  0  0  0  0  0  0 -1  0  1 -1  1 -1] (Indices: [2, 3, 4, 8, 9, 10, 11, 12, 13, 14, 17, 19]), Candidate: [ 2  2  1  0  0  1  1  1  1  1  0  1  1  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1  0  0 -1  1  0  0  0  0 -1  0  1 -1] (Indices: [2, 3, 4, 8, 9, 10, 12, 13, 14, 15, 16, 19]), Candidate: [ 2  2  1  0  0  1  1  1  1  1 -1  2  1  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1  0 -1  1 -1  1  0  0 -1  1  0  0 -1] (Indices: [2, 3, 4, 8, 9, 11, 13, 14, 15, 17, 18, 19]), Candidate: [2 2 1 0 0 1 1 1 1 0 1 0 2 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 112350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1 -1  0  1  0  0  0  0  0 -1  1  0 -1] (Indices: [2, 3, 4, 8, 11, 12, 13, 14, 15, 16, 18, 19]), Candidate: [2 2 1 0 0 1 1 1 0 1 1 1 1 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 112400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  1 -1  1 -1  1  0  0  0  0  0  0 -1] (Indices: [2, 3, 4, 9, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 2 1 0 0 1 1 0 2 0 1 0 2 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 112450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0  0  0  0 -1  0  1  0 -1  0  1 -1  0] (Indices: [2, 3, 5, 6, 7, 8, 9, 10, 11, 14, 15, 18]), Candidate: [ 2  2  1 -1  2  1  1  0  1  1  0  0  1  2  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0  0  0 -1  1 -1  0  0  1  0 -1  1 -1] (Indices: [2, 3, 5, 6, 7, 8, 9, 10, 12, 16, 17, 19]), Candidate: [ 2  2  1 -1  2  1  1  0  1  1 -1  2  0  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 112550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0  0 -1  1  0  0 -1  0  0  1  0 -1  0] (Indices: [2, 3, 5, 6, 7, 8, 9, 11, 12, 13, 17, 18]), Candidate: [ 2  2  1 -1  2  1  1  0  1  0  1  1  1  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0  0 -1  1 -1  0  1 -1  1  0 -1  1 -1] (Indices: [2, 3, 5, 6, 7, 8, 9, 11, 14, 16, 17, 19]), Candidate: [ 2  2  1 -1  2  1  1  0  1  0  1  0  1  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 112650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0  0 -1  0  0  1  0 -1  1  0 -1  1 -1] (Indices: [2, 3, 5, 6, 7, 8, 9, 13, 14, 16, 17, 19]), Candidate: [ 2  2  1 -1  2  1  1  0  1  0  0  1  2  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 112700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0 -1  1  0 -1  1  0  0 -1  1 -1  0  0] (Indices: [2, 3, 5, 6, 7, 8, 10, 11, 13, 14, 15, 17]), Candidate: [ 2  2  1 -1  2  1  1  0  0  2  0  0  2  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0 -1  1 -1  1  0 -1  0  1  0  0 -1  0] (Indices: [2, 3, 5, 6, 7, 8, 10, 12, 13, 16, 17, 18]), Candidate: [ 2  2  1 -1  2  1  1  0  0  2 -1  2  1  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 112800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0 -1  0  1  0  0 -1  1  0  0 -1  0  0] (Indices: [2, 3, 5, 6, 7, 8, 11, 12, 13, 15, 16, 17]), Candidate: [ 2  2  1 -1  2  1  1  0  0  1  1  1  1  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0 -1  0  0  1  0  0  0 -1  1 -1  1 -1] (Indices: [2, 3, 5, 6, 7, 8, 12, 13, 14, 15, 17, 19]), Candidate: [ 2  2  1 -1  2  1  1  0  0  1  0  2  1  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 112900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  1  0  0  0 -1  0  1  0 -1  1 -1  0] (Indices: [2, 3, 5, 6, 7, 9, 10, 11, 12, 15, 16, 18]), Candidate: [ 2  2  1 -1  2  1  1 -1  2  1  0  1  0  1  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 112950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  1  0 -1  1  0  0 -1  1 -1  0  1 -1] (Indices: [2, 3, 5, 6, 7, 9, 10, 12, 13, 14, 16, 19]), Candidate: [ 2  2  1 -1  2  1  1 -1  2  1 -1  2  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 113000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  1 -1  1  0  0  0  0  0 -1  0  0  0] (Indices: [2, 3, 5, 6, 7, 9, 11, 12, 13, 14, 15, 16]), Candidate: [ 2  2  1 -1  2  1  1 -1  2  0  1  1  1  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 113050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  1 -1  1 -1  0  1  0  0  0  0 -1  0] (Indices: [2, 3, 5, 6, 7, 9, 11, 14, 15, 16, 17, 18]), Candidate: [ 2  2  1 -1  2  1  1 -1  2  0  1  0  1  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 113100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  0  1  0  0  0 -1  0  1  0  0 -1  0] (Indices: [2, 3, 5, 6, 7, 10, 11, 12, 13, 16, 17, 18]), Candidate: [ 2  2  1 -1  2  1  1 -1  1  2  0  1  1  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 113150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  0  1 -1  1  0 -1  1  0  0  0 -1  0] (Indices: [2, 3, 5, 6, 7, 10, 12, 13, 15, 16, 17, 18]), Candidate: [ 2  2  1 -1  2  1  1 -1  1  2 -1  2  1  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 113200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  0  0  0  1  0  0 -1  1  0  0  0 -1] (Indices: [2, 3, 5, 6, 7, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  1  1 -1  1  1  0  2  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 113250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1  0  0  0 -1  1 -1  1  0 -1  1 -1  0] (Indices: [2, 3, 5, 6, 8, 9, 10, 11, 13, 15, 16, 18]), Candidate: [ 2  2  1 -1  2  1  0  1  1  1  0  0  2  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1  0  0 -1  1 -1  1 -1  1  0  0 -1  0] (Indices: [2, 3, 5, 6, 8, 9, 10, 12, 14, 16, 17, 18]), Candidate: [ 2  2  1 -1  2  1  0  1  1  1 -1  2  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 113350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1  0 -1  1  0 -1  1  0  0  0 -1  0  0] (Indices: [2, 3, 5, 6, 8, 9, 11, 12, 14, 15, 16, 17]), Candidate: [ 2  2  1 -1  2  1  0  1  1  0  1  1  0  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1  0 -1  0  1  0 -1  0  1  0  0  0 -1] (Indices: [2, 3, 5, 6, 8, 9, 12, 13, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  1  0  1  1  0  0  2  1  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1 -1  1  0 -1  1  0  0  0 -1  1 -1  0] (Indices: [2, 3, 5, 6, 8, 10, 11, 13, 14, 15, 16, 18]), Candidate: [ 2  2  1 -1  2  1  0  1  0  2  0  0  2  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1 -1  0  1  0  0  0  0  0 -1  0  1 -1] (Indices: [2, 3, 5, 6, 8, 11, 12, 13, 14, 15, 16, 19]), Candidate: [ 2  2  1 -1  2  1  0  1  0  1  1  1  1  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  1  0  0  0  0 -1  0  1  0  0 -1  0] (Indices: [2, 3, 5, 6, 9, 10, 11, 12, 13, 16, 17, 18]), Candidate: [ 2  2  1 -1  2  1  0  0  2  1  0  1  1  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  1  0 -1  1  0 -1  1  0  0  0 -1  0] (Indices: [2, 3, 5, 6, 9, 10, 12, 13, 15, 16, 17, 18]), Candidate: [ 2  2  1 -1  2  1  0  0  2  1 -1  2  1  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 113650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  1 -1  0  1  0  0 -1  1  0  0  0 -1] (Indices: [2, 3, 5, 6, 9, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  1  0  0  2  0  0  2  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 113700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0  0  0  0  0  0  0 -1  1 -1  0  0  0] (Indices: [2, 3, 5, 7, 8, 9, 10, 11, 12, 13, 14, 16]), Candidate: [ 2  2  1 -1  2  0  2  0  1  1  0  1  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 113750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0  0  0  0 -1  1 -1  0  1  0  0 -1  0] (Indices: [2, 3, 5, 7, 8, 9, 10, 11, 13, 16, 17, 18]), Candidate: [ 2  2  1 -1  2  0  2  0  1  1  0  0  2  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0  0  0 -1  1 -1  0  1  0  0 -1  1 -1] (Indices: [2, 3, 5, 7, 8, 9, 10, 12, 15, 16, 17, 19]), Candidate: [ 2  2  1 -1  2  0  2  0  1  1 -1  2  0  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 113850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0  0 -1  1  0 -1  1  0 -1  0  1  0 -1] (Indices: [2, 3, 5, 7, 8, 9, 11, 12, 14, 15, 18, 19]), Candidate: [ 2  2  1 -1  2  0  2  0  1  0  1  1  0  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 113900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0  0 -1  0  1 -1  1 -1  1  0  0  0 -1] (Indices: [2, 3, 5, 7, 8, 9, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  0  2  0  1  0  0  2  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 113950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0 -1  1  0 -1  1  0 -1  1  0  0 -1  0] (Indices: [2, 3, 5, 7, 8, 10, 11, 13, 14, 16, 17, 18]), Candidate: [ 2  2  1 -1  2  0  2  0  0  2  0  0  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 114000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0 -1  0  1  0  0  0 -1  1  0 -1  1 -1] (Indices: [2, 3, 5, 7, 8, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  2  1 -1  2  0  2  0  0  1  1  1  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 114050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  1  0  0  0 -1  1  0  0 -1  1 -1  0] (Indices: [2, 3, 5, 7, 9, 10, 11, 12, 14, 15, 16, 18]), Candidate: [ 2  2  1 -1  2  0  2 -1  2  1  0  1  0  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 114100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  1  0 -1  1 -1  1  0  0  0  0 -1  0] (Indices: [2, 3, 5, 7, 9, 10, 12, 14, 15, 16, 17, 18]), Candidate: [ 2  2  1 -1  2  0  2 -1  2  1 -1  2  0  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 114150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  0  1  0  0  0  0  0  0 -1  1 -1  0] (Indices: [2, 3, 5, 7, 10, 11, 12, 13, 14, 15, 16, 18]), Candidate: [ 2  2  1 -1  2  0  2 -1  1  2  0  1  1  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 114200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1  0  0  0  0  0  0 -1  1 -1  0  1 -1] (Indices: [2, 3, 5, 8, 9, 10, 11, 12, 13, 14, 16, 19]), Candidate: [ 2  2  1 -1  2  0  1  1  1  1  0  1  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 114250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1  0  0 -1  1  0  0  0  0  0 -1  0  0] (Indices: [2, 3, 5, 8, 9, 10, 12, 13, 14, 15, 16, 17]), Candidate: [ 2  2  1 -1  2  0  1  1  1  1 -1  2  1  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 114300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1  0 -1  1 -1  1  0  0  0  0 -1  1 -1] (Indices: [2, 3, 5, 8, 9, 11, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  2  1 -1  2  0  1  1  1  0  1  0  2  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1 -1  0  1  0  0  0  0  0  0  0 -1  0] (Indices: [2, 3, 5, 8, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  2  1 -1  2  0  1  1  0  1  1  1  1  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  1 -1  1  0  0 -1  1  0  0  0  0 -1] (Indices: [2, 3, 5, 9, 11, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  0  1  0  2  0  1  1  1  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0  0  0  0 -1  1  0  0 -1  1 -1  0  0] (Indices: [2, 3, 6, 7, 8, 9, 10, 11, 13, 14, 15, 17]), Candidate: [ 2  2  1 -1  1  2  1  0  1  1  0  0  2  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0  0  0 -1  1  0 -1  0  1  0  0 -1  0] (Indices: [2, 3, 6, 7, 8, 9, 10, 12, 13, 16, 17, 18]), Candidate: [ 2  2  1 -1  1  2  1  0  1  1 -1  2  1  0  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 114550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0  0 -1  1  0  0 -1  1  0  0 -1  0  0] (Indices: [2, 3, 6, 7, 8, 9, 11, 12, 13, 15, 16, 17]), Candidate: [ 2  2  1 -1  1  2  1  0  1  0  1  1  1  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0  0 -1  0  1  0  0  0 -1  1 -1  1 -1] (Indices: [2, 3, 6, 7, 8, 9, 12, 13, 14, 15, 17, 19]), Candidate: [ 2  2  1 -1  1  2  1  0  1  0  0  2  1  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 114650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0 -1  1  0  0 -1  1 -1  1  0  0 -1  0] (Indices: [2, 3, 6, 7, 8, 10, 11, 12, 14, 16, 17, 18]), Candidate: [ 2  2  1 -1  1  2  1  0  0  2  0  1  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 114700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0 -1  1 -1  1 -1  0  1  0  0  0  0 -1] (Indices: [2, 3, 6, 7, 8, 10, 12, 15, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  1  2  1  0  0  2 -1  2  0  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 114750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  1  0  0  0  0  0 -1  1 -1  0  1 -1] (Indices: [2, 3, 6, 7, 9, 10, 11, 12, 13, 14, 16, 19]), Candidate: [ 2  2  1 -1  1  2  1 -1  2  1  0  1  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 114800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  1  0 -1  1  0  0  0  0  0 -1  0  0] (Indices: [2, 3, 6, 7, 9, 10, 12, 13, 14, 15, 16, 17]), Candidate: [ 2  2  1 -1  1  2  1 -1  2  1 -1  2  1  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 114850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  1 -1  1 -1  1  0  0  0  0 -1  1 -1] (Indices: [2, 3, 6, 7, 9, 11, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  2  1 -1  1  2  1 -1  2  0  1  0  2  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 114900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  0  0  1  0  0  0  0  0  0  0 -1  0] (Indices: [2, 3, 6, 7, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  2  1 -1  1  2  1 -1  1  1  1  1  1  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 114950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1  0  0  0 -1  1  0 -1  1  0  0 -1  0] (Indices: [2, 3, 6, 8, 9, 10, 11, 13, 14, 16, 17, 18]), Candidate: [ 2  2  1 -1  1  2  0  1  1  1  0  0  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 115000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1  0 -1  1  0  0  0 -1  1  0 -1  1 -1] (Indices: [2, 3, 6, 8, 9, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  2  1 -1  1  2  0  1  1  0  1  1  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 115050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1 -1  1  0 -1  1  0  0  0  0  0 -1  0] (Indices: [2, 3, 6, 8, 10, 11, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  2  1 -1  1  2  0  1  0  2  0  0  2  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  0  1  0  0 -1  1 -1  1  0  0  0  0 -1] (Indices: [2, 3, 6, 9, 10, 11, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  1  2  0  0  2  1  0  0  2  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0  0  0  0  0 -1  1  0  0 -1  1 -1  0] (Indices: [2, 3, 7, 8, 9, 10, 11, 12, 14, 15, 16, 18]), Candidate: [ 2  2  1 -1  1  1  2  0  1  1  0  1  0  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0  0  0 -1  1 -1  1  0  0  0  0 -1  0] (Indices: [2, 3, 7, 8, 9, 10, 12, 14, 15, 16, 17, 18]), Candidate: [ 2  2  1 -1  1  1  2  0  1  1 -1  2  0  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 115250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0 -1  1  0  0  0  0  0  0 -1  1 -1  0] (Indices: [2, 3, 7, 8, 10, 11, 12, 13, 14, 15, 16, 18]), Candidate: [ 2  2  1 -1  1  1  2  0  0  2  0  1  1  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  1  0  0  0  0  0 -1  1  0  0 -1  0] (Indices: [2, 3, 7, 9, 10, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 2  2  1 -1  1  1  2 -1  2  1  0  1  1  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 115350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1  0  0  0  0  0  0  0  0 -1  1 -1  0] (Indices: [2, 3, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18]), Candidate: [ 2  2  1 -1  1  1  1  1  1  1  0  1  1  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  0  1 -1  1  0  0 -1  1  0  0  0  0  0 -1] (Indices: [2, 3, 8, 10, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  1  1  1  1  0  2  0  1  0  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0  0  0  0 -1  1 -1  0  0  0  1  0 -1] (Indices: [2, 4, 5, 6, 7, 8, 9, 10, 11, 13, 18, 19]), Candidate: [2 2 0 1 1 1 1 0 1 1 0 0 2 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 115500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0  0  0 -1  1 -1  0  1 -1  1 -1  1 -1] (Indices: [2, 4, 5, 6, 7, 8, 9, 10, 12, 15, 17, 19]), Candidate: [ 2  2  0  1  1  1  1  0  1  1 -1  2  0  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0  0 -1  1  0  0 -1  0  1  0 -1  0  0] (Indices: [2, 4, 5, 6, 7, 8, 9, 11, 12, 13, 16, 17]), Candidate: [2 2 0 1 1 1 1 0 1 0 1 1 1 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 115600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0  0 -1  1 -1  0  1  0 -1  1 -1  1 -1] (Indices: [2, 4, 5, 6, 7, 8, 9, 11, 14, 15, 17, 19]), Candidate: [2 2 0 1 1 1 1 0 1 0 1 0 1 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 115650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0  0 -1  0  0  1  0  0 -1  1 -1  1 -1] (Indices: [2, 4, 5, 6, 7, 8, 9, 13, 14, 15, 17, 19]), Candidate: [2 2 0 1 1 1 1 0 1 0 0 1 2 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 115700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0 -1  1  0  0 -1  0  0  1 -1  1  0 -1] (Indices: [2, 4, 5, 6, 7, 8, 10, 11, 12, 16, 18, 19]), Candidate: [2 2 0 1 1 1 1 0 0 2 0 1 0 1 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 115750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0 -1  1 -1  1  0 -1  1 -1  1  0 -1  0] (Indices: [2, 4, 5, 6, 7, 8, 10, 12, 13, 15, 17, 18]), Candidate: [ 2  2  0  1  1  1  1  0  0  2 -1  2  1  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0 -1  0  1  0  0  0 -1  0  1  0 -1  0] (Indices: [2, 4, 5, 6, 7, 8, 11, 12, 13, 14, 17, 18]), Candidate: [ 2  2  0  1  1  1  1  0  0  1  1  1  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 115850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0 -1  0  0  1  0  0  0  0 -1  1 -1  0] (Indices: [2, 4, 5, 6, 7, 8, 12, 13, 14, 15, 16, 18]), Candidate: [2 2 0 1 1 1 1 0 0 1 0 2 1 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 115900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  1  0  0  0 -1  1 -1  0  1 -1  1 -1] (Indices: [2, 4, 5, 6, 7, 9, 10, 11, 12, 14, 17, 19]), Candidate: [ 2  2  0  1  1  1  1 -1  2  1  0  1  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 115950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  1  0 -1  1  0  0  0 -1  0  0  1 -1] (Indices: [2, 4, 5, 6, 7, 9, 10, 12, 13, 14, 15, 19]), Candidate: [ 2  2  0  1  1  1  1 -1  2  1 -1  2  1  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 116000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  1  0 -1  0  0  1  0 -1  1  0  0 -1] (Indices: [2, 4, 5, 6, 7, 9, 10, 14, 15, 17, 18, 19]), Candidate: [ 2  2  0  1  1  1  1 -1  2  1 -1  1  1  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 116050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  1 -1  1 -1  1 -1  1  0 -1  1  0 -1] (Indices: [2, 4, 5, 6, 7, 9, 11, 13, 15, 16, 18, 19]), Candidate: [ 2  2  0  1  1  1  1 -1  2  0  1  0  2  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  0  1  0  0  0 -1  1 -1  1  0 -1  0] (Indices: [2, 4, 5, 6, 7, 10, 11, 12, 13, 15, 17, 18]), Candidate: [ 2  2  0  1  1  1  1 -1  1  2  0  1  1  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  0  1 -1  1  0  0 -1  1  0 -1  1 -1] (Indices: [2, 4, 5, 6, 7, 10, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  2  0  1  1  1  1 -1  1  2 -1  2  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 116200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  0  0  0  1  0  0  0  0  0 -1  1 -1] (Indices: [2, 4, 5, 6, 7, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  2  0  1  1  1  1 -1  1  1  0  2  1  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1  0  0  0 -1  1  0 -1  0  1 -1  1 -1] (Indices: [2, 4, 5, 6, 8, 9, 10, 11, 13, 14, 17, 19]), Candidate: [ 2  2  0  1  1  1  0  1  1  1  0  0  2  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1  0  0 -1  1 -1  1  0 -1  1  0 -1  0] (Indices: [2, 4, 5, 6, 8, 9, 10, 12, 14, 15, 17, 18]), Candidate: [ 2  2  0  1  1  1  0  1  1  1 -1  2  0  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1  0 -1  1  0  0 -1  0  1  0 -1  1 -1] (Indices: [2, 4, 5, 6, 8, 9, 11, 12, 13, 16, 17, 19]), Candidate: [2 2 0 1 1 1 0 1 1 0 1 1 1 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 116400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1  0 -1  0  1  0 -1  1  0  0 -1  1 -1] (Indices: [2, 4, 5, 6, 8, 9, 12, 13, 15, 16, 17, 19]), Candidate: [2 2 0 1 1 1 0 1 1 0 0 2 1 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 116450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1 -1  1  0  0 -1  0  1 -1  1  0  0 -1] (Indices: [2, 4, 5, 6, 8, 10, 11, 12, 15, 17, 18, 19]), Candidate: [2 2 0 1 1 1 0 1 0 2 0 1 0 1 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 116500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1 -1  1 -1  0  0  1  0  0  0  0  0 -1] (Indices: [2, 4, 5, 6, 8, 10, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  2  0  1  1  1  0  1  0  2 -1  1  1  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 116550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  1  0  0  0  0 -1  1 -1  1  0 -1  0] (Indices: [2, 4, 5, 6, 9, 10, 11, 12, 13, 15, 17, 18]), Candidate: [2 2 0 1 1 1 0 0 2 1 0 1 1 0 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 116600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  1  0 -1  1  0  0 -1  1  0 -1  1 -1] (Indices: [2, 4, 5, 6, 9, 10, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  2  0  1  1  1  0  0  2  1 -1  2  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 116650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  1 -1  0  1  0  0  0  0  0 -1  1 -1] (Indices: [2, 4, 5, 6, 9, 12, 13, 14, 15, 16, 17, 19]), Candidate: [2 2 0 1 1 1 0 0 2 0 0 2 1 1 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 116700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  0  0  1 -1  1  0  0  0  0  0  0 -1] (Indices: [2, 4, 5, 6, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 2 0 1 1 1 0 0 1 1 1 0 2 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 116750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0  0  0  0 -1  1 -1  1 -1  1  0 -1  0] (Indices: [2, 4, 5, 7, 8, 9, 10, 11, 13, 15, 17, 18]), Candidate: [2 2 0 1 1 0 2 0 1 1 0 0 2 0 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 116800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0  0  0 -1  1 -1  1 -1  1 -1  1  0 -1] (Indices: [2, 4, 5, 7, 8, 9, 10, 12, 14, 16, 18, 19]), Candidate: [ 2  2  0  1  1  0  2  0  1  1 -1  2  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 116850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0  0 -1  1  0 -1  1  0  0 -1  0  1 -1] (Indices: [2, 4, 5, 7, 8, 9, 11, 12, 14, 15, 16, 19]), Candidate: [2 2 0 1 1 0 2 0 1 0 1 1 0 2 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 116900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0  0 -1  0  1 -1  1  0  0  0 -1  1 -1] (Indices: [2, 4, 5, 7, 8, 9, 12, 14, 15, 16, 17, 19]), Candidate: [2 2 0 1 1 0 2 0 1 0 0 2 0 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 116950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0 -1  1  0 -1  1  0  0 -1  1  0 -1  0] (Indices: [2, 4, 5, 7, 8, 10, 11, 13, 14, 15, 17, 18]), Candidate: [2 2 0 1 1 0 2 0 0 2 0 0 2 1 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 117000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0 -1  0  1  0  0  0  0 -1  1 -1  1 -1] (Indices: [2, 4, 5, 7, 8, 11, 12, 13, 14, 15, 17, 19]), Candidate: [2 2 0 1 1 0 2 0 0 1 1 1 1 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 117050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  1  0  0  0  0 -1  0  1 -1  1  0 -1] (Indices: [2, 4, 5, 7, 9, 10, 11, 12, 13, 16, 18, 19]), Candidate: [ 2  2  0  1  1  0  2 -1  2  1  0  1  1  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  1  0 -1  1  0 -1  1  0 -1  1  0 -1] (Indices: [2, 4, 5, 7, 9, 10, 12, 13, 15, 16, 18, 19]), Candidate: [ 2  2  0  1  1  0  2 -1  2  1 -1  2  1  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 117150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  1 -1  0  1 -1  1  0  0  0  0  0 -1] (Indices: [2, 4, 5, 7, 9, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  2  0  1  1  0  2 -1  2  0  0  2  0  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1  0  0  0  0  0  0  0 -1  0  0  1 -1] (Indices: [2, 4, 5, 8, 9, 10, 11, 12, 13, 14, 15, 19]), Candidate: [2 2 0 1 1 0 1 1 1 1 0 1 1 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 117250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1  0  0  0 -1  0  1  0 -1  1  0  0 -1] (Indices: [2, 4, 5, 8, 9, 10, 11, 14, 15, 17, 18, 19]), Candidate: [2 2 0 1 1 0 1 1 1 1 0 0 1 2 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 117300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1  0 -1  1  0 -1  1 -1  1  0  0  0 -1] (Indices: [2, 4, 5, 8, 9, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  2  0  1  1  0  1  1  1  0  1  1  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1 -1  1 -1  1  0 -1  1  0  0  0  0 -1] (Indices: [2, 4, 5, 8, 10, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  2  0  1  1  0  1  1  0  2 -1  2  1  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  0  1 -1  1  0  0  0  0  0 -1  1  0 -1] (Indices: [2, 4, 5, 9, 11, 12, 13, 14, 15, 16, 18, 19]), Candidate: [2 2 0 1 1 0 1 0 2 0 1 1 1 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 117450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0  0  0  0  0 -1  0  0  1 -1  1  0 -1] (Indices: [2, 4, 6, 7, 8, 9, 10, 11, 12, 16, 18, 19]), Candidate: [2 2 0 1 0 2 1 0 1 1 0 1 0 1 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 117500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0  0  0 -1  1  0 -1  1 -1  1  0 -1  0] (Indices: [2, 4, 6, 7, 8, 9, 10, 12, 13, 15, 17, 18]), Candidate: [ 2  2  0  1  0  2  1  0  1  1 -1  2  1  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0  0 -1  1  0  0  0 -1  0  1  0 -1  0] (Indices: [2, 4, 6, 7, 8, 9, 11, 12, 13, 14, 17, 18]), Candidate: [ 2  2  0  1  0  2  1  0  1  0  1  1  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0  0 -1  0  1  0  0  0  0 -1  1 -1  0] (Indices: [2, 4, 6, 7, 8, 9, 12, 13, 14, 15, 16, 18]), Candidate: [2 2 0 1 0 2 1 0 1 0 0 2 1 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 117650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0 -1  1  0  0 -1  1  0 -1  1  0 -1  0] (Indices: [2, 4, 6, 7, 8, 10, 11, 12, 14, 15, 17, 18]), Candidate: [2 2 0 1 0 2 1 0 0 2 0 1 0 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 117700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0 -1  1 -1  1 -1  1  0  0 -1  1  0 -1] (Indices: [2, 4, 6, 7, 8, 10, 12, 14, 15, 16, 18, 19]), Candidate: [ 2  2  0  1  0  2  1  0  0  2 -1  2  0  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  1  0  0  0  0  0  0 -1  0  0  1 -1] (Indices: [2, 4, 6, 7, 9, 10, 11, 12, 13, 14, 15, 19]), Candidate: [ 2  2  0  1  0  2  1 -1  2  1  0  1  1  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  1  0  0 -1  0  1  0 -1  1  0  0 -1] (Indices: [2, 4, 6, 7, 9, 10, 11, 14, 15, 17, 18, 19]), Candidate: [ 2  2  0  1  0  2  1 -1  2  1  0  0  1  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 117850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  1 -1  1  0 -1  1 -1  1  0  0  0 -1] (Indices: [2, 4, 6, 7, 9, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  2  0  1  0  2  1 -1  2  0  1  1  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 117900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  0  1 -1  1  0 -1  1  0  0  0  0 -1] (Indices: [2, 4, 6, 7, 10, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  2  0  1  0  2  1 -1  1  2 -1  2  1  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 117950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1  0  0  0 -1  1  0  0 -1  1  0 -1  0] (Indices: [2, 4, 6, 8, 9, 10, 11, 13, 14, 15, 17, 18]), Candidate: [2 2 0 1 0 2 0 1 1 1 0 0 2 1 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 118000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1  0 -1  1  0  0  0  0 -1  1 -1  1 -1] (Indices: [2, 4, 6, 8, 9, 11, 12, 13, 14, 15, 17, 19]), Candidate: [2 2 0 1 0 2 0 1 1 0 1 1 1 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 118050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1 -1  1  0  0 -1  1  0 -1  1  0  0 -1] (Indices: [2, 4, 6, 8, 10, 11, 12, 14, 15, 17, 18, 19]), Candidate: [2 2 0 1 0 2 0 1 0 2 0 1 0 2 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 118100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  1  0  0 -1  1  0  0  0 -1  1  0 -1] (Indices: [2, 4, 6, 9, 10, 11, 13, 14, 15, 16, 18, 19]), Candidate: [2 2 0 1 0 2 0 0 2 1 0 0 2 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 118150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0  0  0  0  0  0 -1  0  1 -1  1  0 -1] (Indices: [2, 4, 7, 8, 9, 10, 11, 12, 13, 16, 18, 19]), Candidate: [2 2 0 1 0 1 2 0 1 1 0 1 1 0 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 118200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0  0  0 -1  1  0 -1  1  0 -1  1  0 -1] (Indices: [2, 4, 7, 8, 9, 10, 12, 13, 15, 16, 18, 19]), Candidate: [ 2  2  0  1  0  1  2  0  1  1 -1  2  1  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0  0 -1  0  1 -1  1  0  0  0  0  0 -1] (Indices: [2, 4, 7, 8, 9, 12, 14, 15, 16, 17, 18, 19]), Candidate: [2 2 0 1 0 1 2 0 1 0 0 2 0 2 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 118300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  1  0  0  0  0  0  0 -1  1  0 -1  0] (Indices: [2, 4, 7, 9, 10, 11, 12, 13, 14, 15, 17, 18]), Candidate: [ 2  2  0  1  0  1  2 -1  2  1  0  1  1  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1 -1  0  1 -1  1  0  0  0  0  0  0  0 -1] (Indices: [2, 4, 7, 10, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  2  0  1  0  1  2 -1  1  2 -1  2  1  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 118400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  0  1 -1  1  0  0  0  0  0 -1  1  0  0 -1] (Indices: [2, 4, 8, 10, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [2 2 0 1 0 1 1 1 0 2 0 1 1 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 118450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0  0  0  0  0 -1  0  0  1  0 -1  1 -1] (Indices: [2, 5, 6, 7, 8, 9, 10, 11, 12, 16, 17, 19]), Candidate: [2 2 0 0 2 1 1 0 1 1 0 1 0 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 118500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0  0  0 -1  1  0 -1  1  0 -1  0  1 -1] (Indices: [2, 5, 6, 7, 8, 9, 10, 12, 13, 15, 16, 19]), Candidate: [ 2  2  0  0  2  1  1  0  1  1 -1  2  1  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0  0 -1  1  0  0  0 -1  1 -1  0  1 -1] (Indices: [2, 5, 6, 7, 8, 9, 11, 12, 13, 14, 16, 19]), Candidate: [ 2  2  0  0  2  1  1  0  1  0  1  1  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0  0 -1  0  1  0  0  0  0  0 -1  0  0] (Indices: [2, 5, 6, 7, 8, 9, 12, 13, 14, 15, 16, 17]), Candidate: [2 2 0 0 2 1 1 0 1 0 0 2 1 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 118650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0 -1  1  0  0 -1  1  0  0 -1  0  1 -1] (Indices: [2, 5, 6, 7, 8, 10, 11, 12, 14, 15, 16, 19]), Candidate: [2 2 0 0 2 1 1 0 0 2 0 1 0 2 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 118700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0 -1  1 -1  1 -1  1  0  0  0 -1  1 -1] (Indices: [2, 5, 6, 7, 8, 10, 12, 14, 15, 16, 17, 19]), Candidate: [ 2  2  0  0  2  1  1  0  0  2 -1  2  0  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  1  0  0  0  0  0  0 -1  0  1 -1  0] (Indices: [2, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 18]), Candidate: [ 2  2  0  0  2  1  1 -1  2  1  0  1  1  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  1  0  0 -1  0  1  0  0 -1  1  0 -1] (Indices: [2, 5, 6, 7, 9, 10, 11, 14, 15, 16, 18, 19]), Candidate: [ 2  2  0  0  2  1  1 -1  2  1  0  0  1  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  1 -1  1  0 -1  1  0 -1  1  0  0 -1] (Indices: [2, 5, 6, 7, 9, 11, 12, 14, 15, 17, 18, 19]), Candidate: [ 2  2  0  0  2  1  1 -1  2  0  1  1  0  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 118900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  0  1 -1  1  0  0 -1  1  0  0  0 -1] (Indices: [2, 5, 6, 7, 10, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  2  0  0  2  1  1 -1  1  2 -1  2  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 118950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1  0  0  0 -1  1  0  0  0 -1  0  1 -1] (Indices: [2, 5, 6, 8, 9, 10, 11, 13, 14, 15, 16, 19]), Candidate: [2 2 0 0 2 1 0 1 1 1 0 0 2 1 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 119000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1  0 -1  1  0  0  0  0 -1  1  0 -1  0] (Indices: [2, 5, 6, 8, 9, 11, 12, 13, 14, 15, 17, 18]), Candidate: [2 2 0 0 2 1 0 1 1 0 1 1 1 1 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 119050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1 -1  1  0  0 -1  1  0  0 -1  1  0 -1] (Indices: [2, 5, 6, 8, 10, 11, 12, 14, 15, 16, 18, 19]), Candidate: [2 2 0 0 2 1 0 1 0 2 0 1 0 2 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 119100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  0  1  0  0 -1  1  0  0  0  0 -1  1 -1] (Indices: [2, 5, 6, 9, 10, 11, 13, 14, 15, 16, 17, 19]), Candidate: [2 2 0 0 2 1 0 0 2 1 0 0 2 1 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 119150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0  0  0  0  0  0 -1  0  1  0 -1  1 -1] (Indices: [2, 5, 7, 8, 9, 10, 11, 12, 13, 16, 17, 19]), Candidate: [2 2 0 0 2 0 2 0 1 1 0 1 1 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 119200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0  0  0 -1  1  0 -1  1  0  0 -1  1 -1] (Indices: [2, 5, 7, 8, 9, 10, 12, 13, 15, 16, 17, 19]), Candidate: [ 2  2  0  0  2  0  2  0  1  1 -1  2  1  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0  0 -1  0  1  0 -1  1  0  0  0  0 -1] (Indices: [2, 5, 7, 8, 9, 12, 13, 15, 16, 17, 18, 19]), Candidate: [2 2 0 0 2 0 2 0 1 0 0 2 1 0 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 119300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  1  0  0  0  0  0  0  0 -1  0  1 -1] (Indices: [2, 5, 7, 9, 10, 11, 12, 13, 14, 15, 16, 19]), Candidate: [ 2  2  0  0  2  0  2 -1  2  1  0  1  1  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1 -1  0  1  0 -1  1  0  0  0  0  0  0 -1] (Indices: [2, 5, 7, 10, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  2  0  0  2  0  2 -1  1  2  0  0  2  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  0  1 -1  1  0  0  0  0  0  0 -1  1  0 -1] (Indices: [2, 5, 8, 10, 11, 12, 13, 14, 15, 16, 18, 19]), Candidate: [2 2 0 0 2 0 1 1 0 2 0 1 1 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 119450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0  0  0  0  0 -1  0  1  0  0 -1  1 -1] (Indices: [2, 6, 7, 8, 9, 10, 11, 12, 15, 16, 17, 19]), Candidate: [2 2 0 0 1 2 1 0 1 1 0 1 0 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 119500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0  0  0 -1  0  1  0 -1  1  0  0  0 -1] (Indices: [2, 6, 7, 8, 9, 10, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  2  0  0  1  2  1  0  1  1 -1  1  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 119550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0 -1  1  0  0  0 -1  1  0  0 -1  1 -1] (Indices: [2, 6, 7, 8, 10, 11, 12, 13, 15, 16, 17, 19]), Candidate: [2 2 0 0 1 2 1 0 0 2 0 1 1 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 119600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0 -1  1  0  0  0 -1  1  0  0  0 -1  1 -1] (Indices: [2, 6, 7, 9, 10, 11, 12, 14, 15, 16, 17, 19]), Candidate: [ 2  2  0  0  1  2  1 -1  2  1  0  1  0  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  1  0  0  0  0  0 -1  1  0  0 -1  1 -1] (Indices: [2, 6, 8, 9, 10, 11, 12, 13, 15, 16, 17, 19]), Candidate: [2 2 0 0 1 2 0 1 1 1 0 1 1 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 119700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1 -1  0  1  0  0  0 -1  1  0  0  0  0  0 -1] (Indices: [2, 6, 9, 10, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [2 2 0 0 1 2 0 0 2 1 0 1 0 2 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 119750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  0  1  0 -1  1  0  0  0  0  0  0  0  0 -1  0] (Indices: [2, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [2 2 0 0 1 1 2 0 0 2 0 1 1 1 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 119800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0  0  0  0  0 -1  0  0  1 -1  0  1 -1] (Indices: [3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 16, 19]), Candidate: [2 1 2 0 1 1 1 0 1 1 0 1 0 1 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 119850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0  0  0 -1  1  0 -1  0  1 -1  0  1 -1] (Indices: [3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 16, 19]), Candidate: [ 2  1  2  0  1  1  1  0  1  1 -1  2  1  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 119900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0  0  0 -1  0  0  1 -1  1  0  0 -1  0] (Indices: [3, 4, 5, 6, 7, 8, 9, 10, 14, 16, 17, 18]), Candidate: [ 2  1  2  0  1  1  1  0  1  1 -1  1  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 119950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0  0 -1  1 -1  1  0 -1  1 -1  0  1 -1] (Indices: [3, 4, 5, 6, 7, 8, 9, 11, 13, 14, 16, 19]), Candidate: [ 2  1  2  0  1  1  1  0  1  0  1  0  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0  0 -1  0  1 -1  1  0  0 -1  1 -1  0] (Indices: [3, 4, 5, 6, 7, 8, 9, 12, 14, 15, 16, 18]), Candidate: [2 1 2 0 1 1 1 0 1 0 0 2 0 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 120050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0 -1  1  0  0 -1  1  0  0 -1  0  0  0] (Indices: [3, 4, 5, 6, 7, 8, 10, 11, 12, 14, 15, 16]), Candidate: [2 1 2 0 1 1 1 0 0 2 0 1 0 2 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 120100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0 -1  1  0 -1  0  0  1  0  0  0 -1  0] (Indices: [3, 4, 5, 6, 7, 8, 10, 11, 15, 16, 17, 18]), Candidate: [2 1 2 0 1 1 1 0 0 2 0 0 1 1 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 120150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0 -1  1 -1  0  1 -1  1  0  0  0 -1  0] (Indices: [3, 4, 5, 6, 7, 8, 10, 13, 15, 16, 17, 18]), Candidate: [ 2  1  2  0  1  1  1  0  0  2 -1  1  2  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0 -1  0  1 -1  1  0  0 -1  1 -1  1 -1] (Indices: [3, 4, 5, 6, 7, 8, 11, 13, 14, 15, 17, 19]), Candidate: [2 1 2 0 1 1 1 0 0 1 1 0 2 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 120250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  1  0  0  0  0 -1  1  0 -1  0  0  0] (Indices: [3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 15, 16]), Candidate: [ 2  1  2  0  1  1  1 -1  2  1  0  1  1  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  1  0  0 -1  0  1  0  0  0 -1  0  0] (Indices: [3, 4, 5, 6, 7, 9, 10, 11, 14, 15, 16, 17]), Candidate: [ 2  1  2  0  1  1  1 -1  2  1  0  0  1  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  1  0 -1  0  1  0  0  0  0 -1  0  0] (Indices: [3, 4, 5, 6, 7, 9, 10, 13, 14, 15, 16, 17]), Candidate: [ 2  1  2  0  1  1  1 -1  2  1 -1  1  2  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 120400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  1 -1  1  0 -1  1 -1  0  1  0  0 -1] (Indices: [3, 4, 5, 6, 7, 9, 11, 12, 14, 17, 18, 19]), Candidate: [ 2  1  2  0  1  1  1 -1  2  0  1  1  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 120450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  1 -1  0  0  1  0  0  0 -1  1  0 -1] (Indices: [3, 4, 5, 6, 7, 9, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  1  2  0  1  1  1 -1  2  0  0  1  2  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  0  1  0 -1  1 -1  1  0  0  0 -1  0] (Indices: [3, 4, 5, 6, 7, 10, 11, 13, 15, 16, 17, 18]), Candidate: [ 2  1  2  0  1  1  1 -1  1  2  0  0  2  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  0  0  1  0  0 -1  1  0  0 -1  1 -1] (Indices: [3, 4, 5, 6, 7, 11, 12, 13, 15, 16, 17, 19]), Candidate: [ 2  1  2  0  1  1  1 -1  1  1  1  1  1  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1  0  0  0  0 -1  0  1  0  0 -1  0  0] (Indices: [3, 4, 5, 6, 8, 9, 10, 11, 12, 15, 16, 17]), Candidate: [2 1 2 0 1 1 0 1 1 1 0 1 0 1 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 120650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1  0  0 -1  1  0  0 -1  1 -1  1 -1  0] (Indices: [3, 4, 5, 6, 8, 9, 10, 12, 13, 14, 16, 18]), Candidate: [ 2  1  2  0  1  1  0  1  1  1 -1  2  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 120700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1  0  0 -1  0  0  0  1  0  0  0  0 -1] (Indices: [3, 4, 5, 6, 8, 9, 10, 15, 16, 17, 18, 19]), Candidate: [ 2  1  2  0  1  1  0  1  1  1 -1  1  1  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 120750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1  0 -1  1 -1  1 -1  0  1  0  0  0 -1] (Indices: [3, 4, 5, 6, 8, 9, 11, 13, 16, 17, 18, 19]), Candidate: [2 1 2 0 1 1 0 1 1 0 1 0 2 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 120800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1 -1  1  0  0  0 -1  1 -1  0  1  0 -1] (Indices: [3, 4, 5, 6, 8, 10, 11, 12, 13, 15, 18, 19]), Candidate: [2 1 2 0 1 1 0 1 0 2 0 1 1 0 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 120850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1 -1  1 -1  1  0  0 -1  0  1  0  0 -1] (Indices: [3, 4, 5, 6, 8, 10, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  1  2  0  1  1  0  1  0  2 -1  2  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 120900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1 -1  0  0  1  0  0  0 -1  1  0  0 -1] (Indices: [3, 4, 5, 6, 8, 12, 13, 14, 15, 17, 18, 19]), Candidate: [2 1 2 0 1 1 0 1 0 1 0 2 1 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 120950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  1  0  0 -1  1 -1  1  0  0  0 -1  0] (Indices: [3, 4, 5, 6, 9, 10, 11, 13, 15, 16, 17, 18]), Candidate: [2 1 2 0 1 1 0 0 2 1 0 0 2 0 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 121000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  1 -1  1  0  0 -1  1  0  0 -1  1 -1] (Indices: [3, 4, 5, 6, 9, 11, 12, 13, 15, 16, 17, 19]), Candidate: [2 1 2 0 1 1 0 0 2 0 1 1 1 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 121050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  0  1  0 -1  1  0 -1  1  0  0  0 -1] (Indices: [3, 4, 5, 6, 10, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  2  0  1  1  0  0  1  2  0  0  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0  0  0  0  0 -1  0  1 -1  0  1  0 -1] (Indices: [3, 4, 5, 7, 8, 9, 10, 11, 12, 15, 18, 19]), Candidate: [2 1 2 0 1 0 2 0 1 1 0 1 0 1 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 121150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0  0  0 -1  1  0 -1  1  0  0 -1  0  0] (Indices: [3, 4, 5, 7, 8, 9, 10, 12, 13, 15, 16, 17]), Candidate: [ 2  1  2  0  1  0  2  0  1  1 -1  2  1  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0  0 -1  1  0  0  0 -1  1  0 -1  0  0] (Indices: [3, 4, 5, 7, 8, 9, 11, 12, 13, 14, 16, 17]), Candidate: [ 2  1  2  0  1  0  2  0  1  0  1  1  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0  0 -1  1 -1  0  1 -1  1  0  0  0 -1] (Indices: [3, 4, 5, 7, 8, 9, 11, 14, 16, 17, 18, 19]), Candidate: [ 2  1  2  0  1  0  2  0  1  0  1  0  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0 -1  1  0  0 -1  1  0  0  0 -1  0  0] (Indices: [3, 4, 5, 7, 8, 10, 11, 12, 14, 15, 16, 17]), Candidate: [2 1 2 0 1 0 2 0 0 2 0 1 0 2 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 121350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0 -1  1 -1  1  0 -1  0  1  0  0  0 -1] (Indices: [3, 4, 5, 7, 8, 10, 12, 13, 16, 17, 18, 19]), Candidate: [ 2  1  2  0  1  0  2  0  0  2 -1  2  1  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  1  0  0  0  0  0  0  0 -1  0  0  0] (Indices: [3, 4, 5, 7, 9, 10, 11, 12, 13, 14, 15, 16]), Candidate: [ 2  1  2  0  1  0  2 -1  2  1  0  1  1  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  1  0  0 -1  0  1  0  0  0  0 -1  0] (Indices: [3, 4, 5, 7, 9, 10, 11, 14, 15, 16, 17, 18]), Candidate: [ 2  1  2  0  1  0  2 -1  2  1  0  0  1  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  1 -1  1  0 -1  1  0  0  0 -1  1 -1] (Indices: [3, 4, 5, 7, 9, 11, 12, 14, 15, 16, 17, 19]), Candidate: [ 2  1  2  0  1  0  2 -1  2  0  1  1  0  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  0  1 -1  1  0  0  0  0 -1  1  0 -1] (Indices: [3, 4, 5, 7, 10, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  1  2  0  1  0  2 -1  1  2 -1  2  1  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 121600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1  0  0  0 -1  1  0  0  0  0 -1  0  0] (Indices: [3, 4, 5, 8, 9, 10, 11, 13, 14, 15, 16, 17]), Candidate: [2 1 2 0 1 0 1 1 1 1 0 0 2 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 121650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1  0 -1  1  0  0  0  0  0 -1  1 -1  0] (Indices: [3, 4, 5, 8, 9, 11, 12, 13, 14, 15, 16, 18]), Candidate: [2 1 2 0 1 0 1 1 1 0 1 1 1 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 121700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1 -1  1  0  0 -1  1  0  0  0  0 -1  0] (Indices: [3, 4, 5, 8, 10, 11, 12, 14, 15, 16, 17, 18]), Candidate: [2 1 2 0 1 0 1 1 0 2 0 1 0 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 121750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  0  1  0  0  0 -1  0  1  0  0  0  0 -1] (Indices: [3, 4, 5, 9, 10, 11, 12, 15, 16, 17, 18, 19]), Candidate: [2 1 2 0 1 0 1 0 2 1 0 1 0 1 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 121800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0  0  0  0  0 -1  1  0  0 -1  0  0  0] (Indices: [3, 4, 6, 7, 8, 9, 10, 11, 12, 14, 15, 16]), Candidate: [2 1 2 0 0 2 1 0 1 1 0 1 0 2 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 121850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0  0  0  0 -1  0  0  1  0  0  0 -1  0] (Indices: [3, 4, 6, 7, 8, 9, 10, 11, 15, 16, 17, 18]), Candidate: [2 1 2 0 0 2 1 0 1 1 0 0 1 1 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 121900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0  0  0 -1  0  1 -1  1  0  0  0 -1  0] (Indices: [3, 4, 6, 7, 8, 9, 10, 13, 15, 16, 17, 18]), Candidate: [ 2  1  2  0  0  2  1  0  1  1 -1  1  2  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 121950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0  0 -1  1 -1  1  0  0 -1  1 -1  1 -1] (Indices: [3, 4, 6, 7, 8, 9, 11, 13, 14, 15, 17, 19]), Candidate: [2 1 2 0 0 2 1 0 1 0 1 0 2 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 122000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0 -1  1  0  0  0  0 -1  1 -1  1 -1  0] (Indices: [3, 4, 6, 7, 8, 10, 11, 12, 13, 14, 16, 18]), Candidate: [ 2  1  2  0  0  2  1  0  0  2  0  1  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0 -1  1  0 -1  0  0  1  0  0  0  0 -1] (Indices: [3, 4, 6, 7, 8, 10, 11, 15, 16, 17, 18, 19]), Candidate: [2 1 2 0 0 2 1 0 0 2 0 0 1 1 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 122100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0 -1  0  1 -1  1  0  0  0  0  0 -1  0] (Indices: [3, 4, 6, 7, 8, 11, 13, 14, 15, 16, 17, 18]), Candidate: [2 1 2 0 0 2 1 0 0 1 1 0 2 1 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 122150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  1  0  0 -1  1  0  0  0  0 -1  0  0] (Indices: [3, 4, 6, 7, 9, 10, 11, 13, 14, 15, 16, 17]), Candidate: [ 2  1  2  0  0  2  1 -1  2  1  0  0  2  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  1 -1  1  0  0  0  0  0 -1  1 -1  0] (Indices: [3, 4, 6, 7, 9, 11, 12, 13, 14, 15, 16, 18]), Candidate: [ 2  1  2  0  0  2  1 -1  2  0  1  1  1  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  0  1  0  0 -1  1  0  0  0  0 -1  0] (Indices: [3, 4, 6, 7, 10, 11, 12, 14, 15, 16, 17, 18]), Candidate: [ 2  1  2  0  0  2  1 -1  1  2  0  1  0  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1  0  0  0  0 -1  1  0  0  0 -1  0  0] (Indices: [3, 4, 6, 8, 9, 10, 11, 12, 14, 15, 16, 17]), Candidate: [2 1 2 0 0 2 0 1 1 1 0 1 0 2 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 122350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1  0  0 -1  1  0 -1  0  1  0  0  0 -1] (Indices: [3, 4, 6, 8, 9, 10, 12, 13, 16, 17, 18, 19]), Candidate: [ 2  1  2  0  0  2  0  1  1  1 -1  2  1  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1 -1  1  0  0  0  0  0  0  0 -1  0  0] (Indices: [3, 4, 6, 8, 10, 11, 12, 13, 14, 15, 16, 17]), Candidate: [2 1 2 0 0 2 0 1 0 2 0 1 1 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 122450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  0  1  0  0  0  0  0  0 -1  0  1  0 -1] (Indices: [3, 4, 6, 9, 10, 11, 12, 13, 14, 15, 18, 19]), Candidate: [2 1 2 0 0 2 0 0 2 1 0 1 1 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 122500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0  0  0  0  0  0  0  0  0 -1  0  0  0] (Indices: [3, 4, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16]), Candidate: [2 1 2 0 0 1 2 0 1 1 0 1 1 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 122550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0  0  0  0 -1  0  1  0  0  0  0 -1  0] (Indices: [3, 4, 7, 8, 9, 10, 11, 14, 15, 16, 17, 18]), Candidate: [2 1 2 0 0 1 2 0 1 1 0 0 1 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 122600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0  0 -1  1  0 -1  1  0  0  0 -1  1 -1] (Indices: [3, 4, 7, 8, 9, 11, 12, 14, 15, 16, 17, 19]), Candidate: [2 1 2 0 0 1 2 0 1 0 1 1 0 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 122650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0 -1  1 -1  1  0  0  0  0 -1  1  0 -1] (Indices: [3, 4, 7, 8, 10, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  1  2  0  0  1  2  0  0  2 -1  2  1  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1 -1  1  0 -1  0  1  0  0  0  0  0  0 -1] (Indices: [3, 4, 7, 9, 10, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  2  0  0  1  2 -1  2  1 -1  1  2  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 122750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1  0  0 -1  1  0  0  0  0 -1  1  0 -1] (Indices: [3, 4, 8, 9, 10, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  1  2  0  0  1  1  1  1  1 -1  2  1  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0  0  0  0  0  0 -1  0  0  0  1  0 -1] (Indices: [3, 5, 6, 7, 8, 9, 10, 11, 12, 13, 18, 19]), Candidate: [ 2  1  2 -1  2  1  1  0  1  1  0  1  1  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 122850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0  0  0  0 -1  0  1 -1  0  1  0  0 -1] (Indices: [3, 5, 6, 7, 8, 9, 10, 11, 14, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  1  1  0  1  1  0  0  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 122900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0  0  0 -1  0  1  0 -1  0  1  0  0 -1] (Indices: [3, 5, 6, 7, 8, 9, 10, 13, 14, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  1  1  0  1  1 -1  1  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 122950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0  0 -1  1 -1  1  0  0 -1  1  0 -1  0] (Indices: [3, 5, 6, 7, 8, 9, 11, 13, 14, 15, 17, 18]), Candidate: [ 2  1  2 -1  2  1  1  0  1  0  1  0  2  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0 -1  1  0  0  0  0 -1  1  0 -1  0  0] (Indices: [3, 5, 6, 7, 8, 10, 11, 12, 13, 14, 16, 17]), Candidate: [ 2  1  2 -1  2  1  1  0  0  2  0  1  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 123050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0 -1  1  0 -1  0  1 -1  1  0  0  0 -1] (Indices: [3, 5, 6, 7, 8, 10, 11, 14, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  1  1  0  0  2  0  0  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 123100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0 -1  0  1  0 -1  0  1  0  0  0  0 -1] (Indices: [3, 5, 6, 7, 8, 11, 12, 15, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  1  1  0  0  1  1  1  0  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  1  0  0  0 -1  0  0  1  0  0  0 -1] (Indices: [3, 5, 6, 7, 9, 10, 11, 12, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  1  1 -1  2  1  0  1  0  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 123200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  1 -1  1  0  0  0  0  0  0 -1  0  0] (Indices: [3, 5, 6, 7, 9, 11, 12, 13, 14, 15, 16, 17]), Candidate: [ 2  1  2 -1  2  1  1 -1  2  0  1  1  1  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 123250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  0  1  0  0  0 -1  0  1  0  0  0 -1] (Indices: [3, 5, 6, 7, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  1  1 -1  1  2  0  1  1  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 123300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1  0  0  0  0  0 -1  0  0  1  0  0 -1] (Indices: [3, 5, 6, 8, 9, 10, 11, 12, 13, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  1  0  1  1  1  0  1  1  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1  0  0 -1  1  0 -1  1 -1  1  0  0 -1] (Indices: [3, 5, 6, 8, 9, 10, 12, 13, 15, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  1  0  1  1  1 -1  2  1  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 123400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1  0 -1  0  0  1  0  0  0  0  0  0 -1] (Indices: [3, 5, 6, 8, 9, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  1  0  1  1  0  0  1  2  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  1  0  0  0  0  0  0 -1  1 -1  1 -1] (Indices: [3, 5, 6, 9, 10, 11, 12, 13, 14, 15, 17, 19]), Candidate: [ 2  1  2 -1  2  1  0  0  2  1  0  1  1  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  0  0  0  1  0  0  0  0  0  0  0  0 -1] (Indices: [3, 5, 6, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  1  0  0  1  1  1  1  1  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0  0  0  0 -1  1 -1  0  1  0  0  0 -1] (Indices: [3, 5, 7, 8, 9, 10, 11, 13, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  0  2  0  1  1  0  0  2  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0  0 -1  1  0 -1  1  0  0  0  0 -1  0] (Indices: [3, 5, 7, 8, 9, 11, 12, 14, 15, 16, 17, 18]), Candidate: [ 2  1  2 -1  2  0  2  0  1  0  1  1  0  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0 -1  1 -1  1  0  0  0  0  0 -1  1 -1] (Indices: [3, 5, 7, 8, 10, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  1  2 -1  2  0  2  0  0  2 -1  2  1  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 123700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  1  0 -1  1 -1  1  0  0  0  0  0 -1] (Indices: [3, 5, 7, 9, 10, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  0  2 -1  2  1 -1  2  0  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 123750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  0  1  0  0 -1  1  0  0  0  0  0 -1  1 -1] (Indices: [3, 5, 8, 9, 10, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  1  2 -1  2  0  1  1  1  1 -1  2  1  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 123800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0  0  0  0  0  0 -1  1 -1  1  0 -1  0] (Indices: [3, 6, 7, 8, 9, 10, 11, 12, 13, 15, 17, 18]), Candidate: [ 2  1  2 -1  1  2  1  0  1  1  0  1  1  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0  0  0 -1  1  0  0 -1  1  0 -1  1 -1] (Indices: [3, 6, 7, 8, 9, 10, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  1  2 -1  1  2  1  0  1  1 -1  2  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 123900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0  0 -1  0  1  0  0  0  0  0 -1  1 -1] (Indices: [3, 6, 7, 8, 9, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  1  2 -1  1  2  1  0  1  0  0  2  1  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 123950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0 -1  0  1 -1  1  0  0  0  0  0  0 -1] (Indices: [3, 6, 7, 8, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  2  1  0  0  1  1  0  2  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 124000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0 -1  0  1  0  0  0  0  0 -1  1  0  0 -1] (Indices: [3, 6, 7, 10, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  2  1 -1  1  2  0  1  1  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1 -1  1  0 -1  1 -1  1  0  0  0  0  0  0 -1] (Indices: [3, 6, 8, 9, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  2  0  1  1  0  1  0  2  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 124100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0  0  0  0 -1  0  1  0  0  0  0  0 -1] (Indices: [3, 7, 8, 9, 10, 11, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  1  2  0  1  1  0  0  1  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 124150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 -1] (Indices: [3, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  1  1  1  0  2  1  0  1  1  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 124200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0  0  0  0 -1  1 -1  1 -1  1 -1  1 -1] (Indices: [4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19]), Candidate: [2 1 1 1 1 1 1 0 1 1 0 0 2 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 124250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0  0  0 -1  1 -1  1 -1  0  1  0  0 -1] (Indices: [4, 5, 6, 7, 8, 9, 10, 12, 14, 17, 18, 19]), Candidate: [ 2  1  1  1  1  1  1  0  1  1 -1  2  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0  0 -1  1  0 -1  1  0 -1  1  0 -1  0] (Indices: [4, 5, 6, 7, 8, 9, 11, 12, 14, 15, 17, 18]), Candidate: [2 1 1 1 1 1 1 0 1 0 1 1 0 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 124350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0  0 -1  0  1 -1  1  0  0 -1  1  0 -1] (Indices: [4, 5, 6, 7, 8, 9, 12, 14, 15, 16, 18, 19]), Candidate: [2 1 1 1 1 1 1 0 1 0 0 2 0 2 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 124400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0 -1  1  0 -1  1  0  0 -1  1 -1  1 -1] (Indices: [4, 5, 6, 7, 8, 10, 11, 13, 14, 15, 17, 19]), Candidate: [2 1 1 1 1 1 1 0 0 2 0 0 2 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 124450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0 -1  0  1  0  0  0  0 -1  0  1  0 -1] (Indices: [4, 5, 6, 7, 8, 11, 12, 13, 14, 15, 18, 19]), Candidate: [2 1 1 1 1 1 1 0 0 1 1 1 1 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 124500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  1  0  0  0  0 -1  0  0  1  0  0 -1] (Indices: [4, 5, 6, 7, 9, 10, 11, 12, 13, 17, 18, 19]), Candidate: [ 2  1  1  1  1  1  1 -1  2  1  0  1  1  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 124550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  1  0 -1  1  0 -1  1 -1  1  0  0 -1] (Indices: [4, 5, 6, 7, 9, 10, 12, 13, 15, 17, 18, 19]), Candidate: [ 2  1  1  1  1  1  1 -1  2  1 -1  2  1  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 124600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  1 -1  0  0  1  0  0  0  0  0  0 -1] (Indices: [4, 5, 6, 7, 9, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1  1  1  1  1 -1  2  0  0  1  2  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 124650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1  0  0  0  0  0  0 -1  1  0 -1  0  0] (Indices: [4, 5, 6, 8, 9, 10, 11, 12, 13, 14, 16, 17]), Candidate: [ 2  1  1  1  1  1  0  1  1  1  0  1  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 124700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1  0  0  0 -1  0  1 -1  1  0  0  0 -1] (Indices: [4, 5, 6, 8, 9, 10, 11, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  1  1  1  0  1  1  1  0  0  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 124750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1  0 -1  1  0 -1  0  1  0  0  0  0 -1] (Indices: [4, 5, 6, 8, 9, 11, 12, 15, 16, 17, 18, 19]), Candidate: [2 1 1 1 1 1 0 1 1 0 1 1 0 1 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 124800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1 -1  1 -1  1 -1  1  0  0  0  0  0 -1] (Indices: [4, 5, 6, 8, 10, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1  1  1  1  0  1  0  2 -1  2  0  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 124850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  0  1 -1  1  0  0  0  0 -1  1  0  0 -1] (Indices: [4, 5, 6, 9, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [2 1 1 1 1 1 0 0 2 0 1 1 1 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 124900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0  0  0  0  0 -1  0  0  1  0  0  0 -1] (Indices: [4, 5, 7, 8, 9, 10, 11, 12, 16, 17, 18, 19]), Candidate: [2 1 1 1 1 0 2 0 1 1 0 1 0 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 124950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0  0 -1  1  0  0  0  0  0  0 -1  0  0] (Indices: [4, 5, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17]), Candidate: [2 1 1 1 1 0 2 0 1 0 1 1 1 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 125000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0 -1  1  0  0  0 -1  0  1  0  0  0 -1] (Indices: [4, 5, 7, 8, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [2 1 1 1 1 0 2 0 0 2 0 1 1 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 125050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1 -1  1  0  0  0 -1  1 -1  1  0  0  0 -1] (Indices: [4, 5, 7, 9, 10, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  1  1  0  2 -1  2  1  0  1  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  1  0  0  0  0  0 -1  0  1  0  0  0 -1] (Indices: [4, 5, 8, 9, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [2 1 1 1 1 0 1 1 1 1 0 1 1 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 125150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  0  0  1 -1  1  0  0  0  0  0  0  0  0 -1] (Indices: [4, 5, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 1 1 1 1 0 1 0 2 0 1 1 1 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 125200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0  0  0  0 -1  1 -1  1 -1  1  0  0 -1] (Indices: [4, 6, 7, 8, 9, 10, 11, 13, 15, 17, 18, 19]), Candidate: [2 1 1 1 0 2 1 0 1 1 0 0 2 0 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 125250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0  0 -1  1  0  0 -1  0  1  0  0  0 -1] (Indices: [4, 6, 7, 8, 9, 11, 12, 13, 16, 17, 18, 19]), Candidate: [2 1 1 1 0 2 1 0 1 0 1 1 1 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 125300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0 -1  1 -1  1  0  0  0  0  0  0 -1  0] (Indices: [4, 6, 7, 8, 10, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  1  1  1  0  2  1  0  0  2 -1  2  1  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 125350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0 -1  1  0 -1  1  0 -1  1  0  0  0  0 -1] (Indices: [4, 6, 7, 9, 10, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1  1  0  2  1 -1  2  1 -1  2  1  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1  0  0 -1  1  0  0  0  0  0  0 -1  0] (Indices: [4, 6, 8, 9, 10, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  1  1  1  0  2  0  1  1  1 -1  2  1  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 125450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1  0  0  0  0  0  0 -1  1  0 -1  1  0 -1] (Indices: [4, 7, 8, 9, 10, 11, 12, 13, 15, 16, 18, 19]), Candidate: [2 1 1 1 0 1 2 0 1 1 0 1 1 0 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 125500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  0  1 -1  1  0  0 -1  1  0  0  0  0  0  0 -1] (Indices: [4, 7, 9, 10, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1  1  0  1  2 -1  2  1  0  0  2  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 125550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0  0  0  0  0 -1  0  0  1  0  0  0 -1] (Indices: [5, 6, 7, 8, 9, 10, 11, 12, 16, 17, 18, 19]), Candidate: [2 1 1 0 2 1 1 0 1 1 0 1 0 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 125600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0  0 -1  1  0  0  0  0  0  0 -1  0  0] (Indices: [5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17]), Candidate: [2 1 1 0 2 1 1 0 1 0 1 1 1 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 125650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0 -1  1  0  0  0 -1  0  1  0  0  0 -1] (Indices: [5, 6, 7, 8, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [2 1 1 0 2 1 1 0 0 2 0 1 1 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 125700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0 -1  1  0  0  0 -1  1 -1  1  0  0  0 -1] (Indices: [5, 6, 7, 9, 10, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  2  1  1 -1  2  1  0  1  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 125750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  1  0  0  0  0  0 -1  0  1  0  0  0 -1] (Indices: [5, 6, 8, 9, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [2 1 1 0 2 1 0 1 1 1 0 1 1 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 125800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0 -1  0  1 -1  1  0  0  0  0  0  0  0  0 -1] (Indices: [5, 6, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 1 1 0 2 1 0 0 2 0 1 1 1 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 125850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0 -1  1  0  0  0  0  0 -1  1  0  0 -1] (Indices: [5, 7, 8, 10, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [2 1 1 0 2 0 2 0 0 2 0 1 1 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 125900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1  0  0  0  0  0  0 -1  0  1  0  0  0  0 -1] (Indices: [6, 7, 8, 9, 10, 11, 12, 15, 16, 17, 18, 19]), Candidate: [2 1 1 0 1 2 1 0 1 1 0 1 0 1 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 125950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  1 -1  1  0  0  0  0  0  0 -1  1  0  0  0 -1] (Indices: [6, 8, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  1  2  0  1  1  1  0  1  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Finished generating neighbors. Total valid neighbors found: 39209
  Size of neighborhood t=12: 39209
  Using 'fork' start method for multiprocessing.
  No improvement found for t=12 after processing 39209 neighbors.
No improving solution found or error occurred for t=12.

Attempting neighborhood t=13 (current best cost: 98.4663)
  Exploring neighborhood t=13 in parallel (current cost: 98.4663)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Attempt 50: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0 -1  1 -1  0  1  0 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 14, 15]), Candidate: [2 1 1 0 1 1 1 0 1 0 1 0 1 2 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0 -1  0  0  1 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 13, 18, 19]), Candidate: [2 1 1 0 1 1 1 0 1 0 0 1 2 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0 -1  1 -1  1  0 -1  1 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 13, 15]), Candidate: [ 2  1  1  0  1  1  1  0  0  2 -1  2  1  0  1  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0 -1  1 -1  0  0  0  1 -1  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 15, 18, 19]), Candidate: [ 2  1  1  0  1  1  1  0  0  2 -1  1  1  1  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0 -1  0  1 -1  0  1 -1  0  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 11, 14, 18, 19]), Candidate: [ 2  1  1  0  1  1  1  0  0  1  1  0  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0 -1  0  0  0  1  0 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 13, 14, 16, 17]), Candidate: [ 2  1  1  0  1  1  1  0  0  1  0  1  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  1  0  0 -1  0  0  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 15, 17]), Candidate: [ 2  1  1  0  1  1  1 -1  2  1  0  0  1  1  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  1  0 -1  0  0  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 14, 16, 18]), Candidate: [ 2  1  1  0  1  1  1 -1  2  1 -1  1  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  1 -1  1 -1  1 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 9, 11, 13, 18, 19]), Candidate: [ 2  1  1  0  1  1  1 -1  2  0  1  0  2  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  1 -1  0  1 -1  0  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 9, 12, 15, 17, 19]), Candidate: [ 2  1  1  0  1  1  1 -1  2  0  0  2  0  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  0  1  0  0 -1  1 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 14, 18]), Candidate: [ 2  1  1  0  1  1  1 -1  1  2  0  1  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  0  1 -1  1  0  0 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 10, 12, 13, 14, 18]), Candidate: [ 2  1  1  0  1  1  1 -1  1  2 -1  2  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  0  1 -1  0  1 -1  0  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 10, 13, 16, 18, 19]), Candidate: [ 2  1  1  0  1  1  1 -1  1  2 -1  1  2  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  0  0  1  0 -1  0  0  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 11, 12, 16, 18, 19]), Candidate: [ 2  1  1  0  1  1  1 -1  1  1  1  1  0  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  0  0  0  1  0 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 12, 13, 15, 17, 18]), Candidate: [ 2  1  1  0  1  1  1 -1  1  1  0  2  1  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1  0  0  0 -1  1  0 -1  0  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 9, 10, 11, 13, 14]), Candidate: [ 2  1  1  0  1  1  0  1  1  1  0  0  2  1 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1  0  0 -1  0  1 -1  1 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 9, 10, 13, 15, 19]), Candidate: [ 2  1  1  0  1  1  0  1  1  1 -1  1  2  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1  0 -1  1 -1  1  0 -1  0  1 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 9, 11, 13, 14, 17]), Candidate: [ 2  1  1  0  1  1  0  1  1  0  1  0  2  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1  0 -1  0  1 -1  1  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 9, 12, 14, 15, 18]), Candidate: [2 1 1 0 1 1 0 1 1 0 0 2 0 2 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 1000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1  0 -1  0  0  0  0  1  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 9, 15, 16, 18, 19]), Candidate: [2 1 1 0 1 1 0 1 1 0 0 1 1 1 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 1050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1 -1  1  0 -1  0  0  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 10, 11, 15, 16, 18]), Candidate: [2 1 1 0 1 1 0 1 0 2 0 0 1 1 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 1100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1 -1  1 -1  0  1  0 -1  1 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 10, 13, 14, 16, 19]), Candidate: [ 2  1  1  0  1  1  0  1  0  2 -1  1  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1 -1  0  1  0 -1  1 -1  1 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 11, 12, 14, 16, 19]), Candidate: [ 2  1  1  0  1  1  0  1  0  1  1  1  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1 -1  0  0  1  0  0  0 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 12, 13, 14, 15, 17]), Candidate: [2 1 1 0 1 1 0 1 0 1 0 2 1 1 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 1250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1 -1  0  0  0  0  1  0  0  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 14, 15, 16, 17, 19]), Candidate: [2 1 1 0 1 1 0 1 0 1 0 1 1 2 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 1300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  1  0  0 -1  0  1 -1  0  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 9, 10, 11, 14, 18, 19]), Candidate: [ 2  1  1  0  1  1  0  0  2  1  0  0  1  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  1  0 -1  0  1  0 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 9, 10, 13, 14, 16, 17]), Candidate: [ 2  1  1  0  1  1  0  0  2  1 -1  1  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  1 -1  1  0 -1  1 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 9, 11, 12, 14, 16, 17]), Candidate: [ 2  1  1  0  1  1  0  0  2  0  1  1  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  1 -1  1 -1  0  0  0  1  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 9, 11, 16, 17, 18, 19]), Candidate: [2 1 1 0 1 1 0 0 2 0 1 0 1 1 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 1500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  1 -1  0  0  1 -1  0  1  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 9, 13, 16, 17, 18, 19]), Candidate: [2 1 1 0 1 1 0 0 2 0 0 1 2 0 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 1550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  0  1  0 -1  1  0 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 10, 11, 13, 14, 17, 19]), Candidate: [ 2  1  1  0  1  1  0  0  1  2  0  0  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  0  1 -1  1 -1  1  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 10, 12, 14, 15, 17, 18]), Candidate: [ 2  1  1  0  1  1  0  0  1  2 -1  2  0  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  0  0  1  0  0 -1  0  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 11, 12, 13, 16, 17, 19]), Candidate: [2 1 1 0 1 1 0 0 1 1 1 1 1 0 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 1700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  0  0  0  1  0 -1  1  0  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 12, 13, 15, 16, 17, 19]), Candidate: [2 1 1 0 1 1 0 0 1 1 0 2 1 0 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 1750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0  0  0 -1  1  0 -1  0  0  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 9, 10, 12, 13, 19]), Candidate: [ 2  1  1  0  1  0  2  0  1  1 -1  2  1  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0  0  0 -1  0  0  0  0  0  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 9, 10, 17, 18, 19]), Candidate: [ 2  1  1  0  1  0  2  0  1  1 -1  1  1  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0  0 -1  1 -1  0  0  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 9, 11, 15, 17, 18]), Candidate: [2 1 1 0 1 0 2 0 1 0 1 0 1 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 1900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0  0 -1  0  0  1  0 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 9, 13, 14, 17, 19]), Candidate: [ 2  1  1  0  1  0  2  0  1  0  0  1  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0 -1  1  0 -1  1  0 -1  0  1 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 10, 11, 13, 14, 17]), Candidate: [ 2  1  1  0  1  0  2  0  0  2  0  0  2  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0 -1  1 -1  1 -1  1  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 10, 12, 14, 15, 18]), Candidate: [ 2  1  1  0  1  0  2  0  0  2 -1  2  0  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0 -1  1 -1  0  0  0  1  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 10, 15, 16, 18, 19]), Candidate: [ 2  1  1  0  1  0  2  0  0  2 -1  1  1  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0 -1  0  1 -1  1 -1  1  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 11, 13, 15, 16, 19]), Candidate: [2 1 1 0 1 0 2 0 0 1 1 0 2 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 2150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0 -1  0  0  1 -1  1 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 12, 14, 16, 17, 19]), Candidate: [ 2  1  1  0  1  0  2  0  0  1  0  2  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  1  0  0 -1  1  0  0 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 9, 10, 11, 13, 14, 15]), Candidate: [ 2  1  1  0  1  0  2 -1  2  1  0  0  2  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  1  0 -1  1 -1  1  0  0 -1  0  0  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 9, 10, 12, 14, 15, 16]), Candidate: [ 2  1  1  0  1  0  2 -1  2  1 -1  2  0  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  1  0 -1  0  0  0  1  0  0  0 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 9, 10, 15, 16, 17, 18]), Candidate: [ 2  1  1  0  1  0  2 -1  2  1 -1  1  1  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  1 -1  1 -1  1 -1  1  0  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 9, 11, 13, 15, 16, 17]), Candidate: [ 2  1  1  0  1  0  2 -1  2  0  1  0  2  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  1 -1  0  1 -1  1  0 -1  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 9, 12, 14, 15, 18, 19]), Candidate: [ 2  1  1  0  1  0  2 -1  2  0  0  2  0  2  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  0  1  0  0 -1  1 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 10, 11, 12, 14, 16, 17]), Candidate: [ 2  1  1  0  1  0  2 -1  1  2  0  1  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  0  1  0 -1  0  0  0  1  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 10, 11, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  1  0  2 -1  1  2  0  0  1  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  0  1 -1  0  1 -1  0  1  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 10, 13, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  1  0  2 -1  1  2 -1  1  2  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  0  0  1 -1  1  0 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 11, 13, 14, 16, 18, 19]), Candidate: [ 2  1  1  0  1  0  2 -1  1  1  1  0  2  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1  0  0  0  0 -1  1 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 8, 9, 10, 11, 12, 14, 18]), Candidate: [ 2  1  1  0  1  0  1  1  1  1  0  1  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1  0  0 -1  1  0  0 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 8, 9, 10, 12, 13, 14, 18]), Candidate: [ 2  1  1  0  1  0  1  1  1  1 -1  2  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1  0  0 -1  0  1 -1  0  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 8, 9, 10, 13, 16, 18, 19]), Candidate: [ 2  1  1  0  1  0  1  1  1  1 -1  1  2  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1  0 -1  1  0 -1  0  0  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 8, 9, 11, 12, 16, 18, 19]), Candidate: [2 1 1 0 1 0 1 1 1 0 1 1 0 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 2850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1  0 -1  0  1  0 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 8, 9, 12, 13, 15, 17, 18]), Candidate: [2 1 1 0 1 0 1 1 1 0 0 2 1 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 2900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1 -1  1  0  0  0 -1  1 -1  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 8, 10, 11, 12, 13, 15, 18]), Candidate: [2 1 1 0 1 0 1 1 0 2 0 1 1 0 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 2950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1 -1  1  0 -1  0  1  0  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 8, 10, 11, 14, 15, 16, 19]), Candidate: [2 1 1 0 1 0 1 1 0 2 0 0 1 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 3000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1 -1  1 -1  0  1  0  0  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 8, 10, 13, 14, 15, 16, 19]), Candidate: [ 2  1  1  0  1  0  1  1  0  2 -1  1  2  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1 -1  0  1  0 -1  0  1  0  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 8, 11, 12, 15, 16, 17, 19]), Candidate: [2 1 1 0 1 0 1 1 0 1 1 1 0 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 3100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1 -1  0  0  0  1  0 -1  1  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 8, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  1  0  1  1  0  1  0  1  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  1  0  0 -1  1 -1  1  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 9, 10, 11, 13, 15, 16, 19]), Candidate: [2 1 1 0 1 0 1 0 2 1 0 0 2 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 3200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  1  0 -1  1 -1  1 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 9, 10, 12, 14, 16, 17, 19]), Candidate: [ 2  1  1  0  1  0  1  0  2  1 -1  2  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  1 -1  1  0 -1  1  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 9, 11, 12, 14, 15, 16, 18]), Candidate: [2 1 1 0 1 0 1 0 2 0 1 1 0 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 3300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  1 -1  0  1 -1  1  0  0  0  0 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 9, 12, 14, 15, 16, 17, 18]), Candidate: [2 1 1 0 1 0 1 0 2 0 0 2 0 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 3350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  0  1  0 -1  1  0  0  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 10, 11, 13, 14, 15, 16, 19]), Candidate: [2 1 1 0 1 0 1 0 1 2 0 0 2 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 3400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  0  0  1  0  0  0  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 11, 12, 13, 14, 15, 17, 18]), Candidate: [2 1 1 0 1 0 1 0 1 1 1 1 1 1 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 3450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0  0  0  0 -1  0  1 -1  0  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 14, 19]), Candidate: [ 2  1  1  0  0  2  1  0  1  1  0  0  1  2 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0  0  0 -1  0  0  1  0 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 9, 10, 14, 15, 19]), Candidate: [ 2  1  1  0  0  2  1  0  1  1 -1  1  1  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0  0 -1  1 -1  1 -1  0  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 9, 11, 13, 17, 18]), Candidate: [2 1 1 0 0 2 1 0 1 0 1 0 2 0 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 3600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0  0 -1  0  1 -1  0  1  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 9, 12, 15, 16, 19]), Candidate: [2 1 1 0 0 2 1 0 1 0 0 2 0 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 3650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0 -1  1  0  0 -1  1 -1  1 -1  0  0  1] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 10, 11, 12, 14, 16]), Candidate: [ 2  1  1  0  0  2  1  0  0  2  0  1  0  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0 -1  1 -1  1  0  0 -1  1 -1  0  0  1] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 10, 12, 13, 14, 16]), Candidate: [ 2  1  1  0  0  2  1  0  0  2 -1  2  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0 -1  1 -1  0  1 -1  0  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 10, 13, 16, 17, 18]), Candidate: [ 2  1  1  0  0  2  1  0  0  2 -1  1  2  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0 -1  0  1  0 -1  0  0  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 11, 12, 16, 17, 18]), Candidate: [2 1 1 0 0 2 1 0 0 1 1 1 0 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 3850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0 -1  0  0  1  0 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 12, 13, 15, 16, 18]), Candidate: [2 1 1 0 0 2 1 0 0 1 0 2 1 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 3900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  1  0  0  0  0 -1  0  0  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 9, 10, 11, 12, 13, 19]), Candidate: [ 2  1  1  0  0  2  1 -1  2  1  0  1  1  0  0  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  1  0  0 -1  0  0  0  0  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 9, 10, 11, 17, 18, 19]), Candidate: [ 2  1  1  0  0  2  1 -1  2  1  0  0  1  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  1  0 -1  0  1 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 9, 10, 13, 15, 17, 19]), Candidate: [ 2  1  1  0  0  2  1 -1  2  1 -1  1  2  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  1 -1  1  0 -1  0  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 9, 11, 12, 15, 17, 19]), Candidate: [ 2  1  1  0  0  2  1 -1  2  0  1  1  0  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  1 -1  0  1  0  0 -1  0  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 9, 12, 13, 14, 18, 19]), Candidate: [ 2  1  1  0  0  2  1 -1  2  0  0  2  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  0  1  0  0  0  0 -1  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 7, 10, 11, 12, 13, 14, 18]), Candidate: [ 2  1  1  0  0  2  1 -1  1  2  0  1  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  0  1  0 -1  1 -1  0  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 10, 11, 13, 16, 18, 19]), Candidate: [ 2  1  1  0  0  2  1 -1  1  2  0  0  2  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  0  1 -1  1 -1  0  1 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 10, 12, 15, 17, 18, 19]), Candidate: [ 2  1  1  0  0  2  1 -1  1  2 -1  2  0  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  0  0  1  0 -1  1 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 11, 12, 14, 16, 17, 19]), Candidate: [ 2  1  1  0  0  2  1 -1  1  1  1  1  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  0  0  0  0  1  0  0  0  0  0 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 7, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  1  1  0  0  2  1 -1  1  1  0  1  2  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1  0  0  0 -1  0  1 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 8, 9, 10, 11, 14, 17, 18]), Candidate: [ 2  1  1  0  0  2  0  1  1  1  0  0  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1  0  0 -1  0  1  0  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 8, 9, 10, 13, 14, 15, 18]), Candidate: [ 2  1  1  0  0  2  0  1  1  1 -1  1  2  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1  0 -1  1  0 -1  1  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 8, 9, 11, 12, 14, 15, 18]), Candidate: [2 1 1 0 0 2 0 1 1 0 1 1 0 2 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 4550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1  0 -1  1 -1  0  0  1  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 6, 8, 9, 11, 15, 16, 18, 19]), Candidate: [2 1 1 0 0 2 0 1 1 0 1 0 1 1 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 4600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1  0 -1  0  0  1 -1  1  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 6, 8, 9, 13, 15, 16, 18, 19]), Candidate: [2 1 1 0 0 2 0 1 1 0 0 1 2 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 4650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1 -1  1  0 -1  1  0 -1  1 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 6, 8, 10, 11, 13, 14, 16, 19]), Candidate: [ 2  1  1  0  0  2  0  1  0  2  0  0  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1 -1  1 -1  1 -1  1  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 8, 10, 12, 14, 15, 16, 18]), Candidate: [ 2  1  1  0  0  2  0  1  0  2 -1  2  0  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1 -1  0  1  0  0 -1  1 -1  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 6, 8, 11, 12, 13, 15, 18, 19]), Candidate: [2 1 1 0 0 2 0 1 0 1 1 1 1 0 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 4800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1 -1  0  0  1  0  0 -1  0  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 6, 8, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  1  1  0  0  2  0  1  0  1  0  2  1  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  1  0  0  0 -1  0  0  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 9, 10, 11, 12, 16, 17, 18]), Candidate: [2 1 1 0 0 2 0 0 2 1 0 1 0 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 4900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  1  0 -1  1  0 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 9, 10, 12, 13, 15, 16, 18]), Candidate: [ 2  1  1  0  0  2  0  0  2  1 -1  2  1  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  1 -1  1  0  0  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 9, 11, 12, 13, 14, 16, 18]), Candidate: [ 2  1  1  0  0  2  0  0  2  0  1  1  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  1 -1  1 -1  0  0  1  0  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 6, 9, 11, 15, 16, 17, 18, 19]), Candidate: [2 1 1 0 0 2 0 0 2 0 1 0 1 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 5050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  0  1  0  0 -1  1  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 10, 11, 12, 14, 15, 16, 18]), Candidate: [2 1 1 0 0 2 0 0 1 2 0 1 0 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 5100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  0  1 -1  1 -1  1  0  0  0  0 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 10, 12, 14, 15, 16, 17, 18]), Candidate: [ 2  1  1  0  0  2  0  0  1  2 -1  2  0  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0  0  0  0  0  0 -1  1 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 7, 8, 9, 10, 11, 12, 13, 15]), Candidate: [2 1 1 0 0 1 2 0 1 1 0 1 1 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 5200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0  0  0  0 -1  0  0  1 -1  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 7, 8, 9, 10, 11, 15, 18, 19]), Candidate: [2 1 1 0 0 1 2 0 1 1 0 0 1 1 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 5250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0  0  0 -1  0  1 -1  1  0  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 7, 8, 9, 10, 13, 15, 16, 17]), Candidate: [ 2  1  1  0  0  1  2  0  1  1 -1  1  2  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0  0 -1  1  0 -1  0  1  0  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 7, 8, 9, 11, 12, 15, 16, 17]), Candidate: [2 1 1 0 0 1 2 0 1 0 1 1 0 1 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 5350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0  0 -1  0  1  0  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 3, 4, 7, 8, 9, 12, 13, 14, 16, 18]), Candidate: [ 2  1  1  0  0  1  2  0  1  0  0  2  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0  0 -1  0  0  0  0  1  0  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 7, 8, 9, 15, 16, 17, 18, 19]), Candidate: [2 1 1 0 0 1 2 0 1 0 0 1 1 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 5450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0 -1  1  0 -1  1 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 7, 8, 10, 11, 13, 15, 17, 19]), Candidate: [2 1 1 0 0 1 2 0 0 2 0 0 2 0 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 5500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0 -1  1 -1  1 -1  1 -1  0  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 7, 8, 10, 12, 14, 17, 18, 19]), Candidate: [ 2  1  1  0  0  1  2  0  0  2 -1  2  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0 -1  0  1  0 -1  1  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 4, 7, 8, 11, 12, 14, 15, 17, 18]), Candidate: [2 1 1 0 0 1 2 0 0 1 1 1 0 2 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 5600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0 -1  0  0  1 -1  1  0  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 7, 8, 12, 14, 15, 16, 18, 19]), Candidate: [2 1 1 0 0 1 2 0 0 1 0 2 0 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 5650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  1  0  0 -1  1  0 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 7, 9, 10, 11, 13, 14, 16, 17]), Candidate: [ 2  1  1  0  0  1  2 -1  2  1  0  0  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  1  0 -1  1  0 -1  0  0  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 7, 9, 10, 12, 13, 17, 18, 19]), Candidate: [ 2  1  1  0  0  1  2 -1  2  1 -1  2  1  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  1 -1  1  0  0 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 4, 7, 9, 11, 12, 13, 15, 17, 18]), Candidate: [ 2  1  1  0  0  1  2 -1  2  0  1  1  1  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  1 -1  0  1  0  0 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 7, 9, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  1  1  0  0  1  2 -1  2  0  0  2  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  0  1  0  0 -1  1 -1  0  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 7, 10, 11, 12, 14, 17, 18, 19]), Candidate: [ 2  1  1  0  0  1  2 -1  1  2  0  1  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  0  1 -1  0  1  0  0  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 7, 10, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  1  1  0  0  1  2 -1  1  2 -1  1  2  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1  0  0  0  0  0 -1  0  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 8, 9, 10, 11, 12, 13, 16, 17]), Candidate: [2 1 1 0 0 1 1 1 1 1 0 1 1 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 6000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1  0  0  0 -1  0  1  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 8, 9, 10, 11, 14, 15, 17, 19]), Candidate: [2 1 1 0 0 1 1 1 1 1 0 0 1 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 6050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1  0  0 -1  0  1  0  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 8, 9, 10, 13, 14, 15, 17, 19]), Candidate: [ 2  1  1  0  0  1  1  1  1  1 -1  1  2  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1  0 -1  1  0 -1  0  1 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 8, 9, 11, 12, 15, 17, 18, 19]), Candidate: [2 1 1 0 0 1 1 1 1 0 1 1 0 1 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 6150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1  0 -1  0  0  0  1  0  0  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 8, 9, 14, 15, 16, 17, 18, 19]), Candidate: [2 1 1 0 0 1 1 1 1 0 0 1 1 2 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 6200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1 -1  1  0 -1  1 -1  0  1  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 8, 10, 11, 13, 16, 17, 18, 19]), Candidate: [2 1 1 0 0 1 1 1 0 2 0 0 2 0 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 6250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1 -1  0  1  0 -1  1  0  0  0  0 -1  1] (Indices: [0, 1, 2, 3, 4, 8, 11, 12, 14, 15, 16, 17, 18]), Candidate: [2 1 1 0 0 1 1 1 0 1 1 1 0 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 6300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  1  0  0  0 -1  1 -1  0  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 9, 10, 11, 12, 14, 17, 18, 19]), Candidate: [ 2  1  1  0  0  1  1  0  2  1  0  1  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  1  0 -1  0  1  0  0  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 9, 10, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  1  1  0  0  1  1  0  2  1 -1  1  2  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  0  1  0  0  0  0 -1  0  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 10, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  1  1  0  0  1  1  0  1  2  0  1  1  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0  0  0  0 -1  0  1 -1  1 -1  0  0  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 9, 10, 11, 14, 16]), Candidate: [ 2  1  1 -1  2  1  1  0  1  1  0  0  1  2 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0  0  0 -1  0  0  1  0  0 -1  0  0  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 9, 10, 14, 15, 16]), Candidate: [ 2  1  1 -1  2  1  1  0  1  1 -1  1  1  2  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0  0 -1  1 -1  1 -1  0  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 9, 11, 13, 16, 17]), Candidate: [ 2  1  1 -1  2  1  1  0  1  0  1  0  2  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0  0 -1  0  1 -1  1 -1  0  0  1  0  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 9, 12, 14, 18, 19]), Candidate: [ 2  1  1 -1  2  1  1  0  1  0  0  2  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0 -1  1  0  0  0 -1  0  0  0  1 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 10, 11, 12, 13, 18]), Candidate: [ 2  1  1 -1  2  1  1  0  0  2  0  1  1  0  0  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0 -1  1  0 -1  0  0  0  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 10, 11, 16, 18, 19]), Candidate: [ 2  1  1 -1  2  1  1  0  0  2  0  0  1  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0 -1  1 -1  0  1 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 10, 13, 15, 17, 18]), Candidate: [ 2  1  1 -1  2  1  1  0  0  2 -1  1  2  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0 -1  0  1  0 -1  0  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 11, 12, 15, 17, 18]), Candidate: [ 2  1  1 -1  2  1  1  0  0  1  1  1  0  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0 -1  0  0  1  0  0 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 12, 13, 14, 17, 19]), Candidate: [ 2  1  1 -1  2  1  1  0  0  1  0  2  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  1  0  0  0  0 -1  0  1 -1  0  0  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 9, 10, 11, 12, 13, 16]), Candidate: [ 2  1  1 -1  2  1  1 -1  2  1  0  1  1  0  0  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  1  0  0 -1  0  0  0  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 9, 10, 11, 16, 17, 18]), Candidate: [ 2  1  1 -1  2  1  1 -1  2  1  0  0  1  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  1  0 -1  0  1 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 9, 10, 13, 15, 16, 18]), Candidate: [ 2  1  1 -1  2  1  1 -1  2  1 -1  1  2  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 7050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  1 -1  1  0 -1  0  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 9, 11, 12, 15, 16, 18]), Candidate: [ 2  1  1 -1  2  1  1 -1  2  0  1  1  0  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  1 -1  0  1  0  0 -1  1 -1  0  1  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 9, 12, 13, 14, 16, 19]), Candidate: [ 2  1  1 -1  2  1  1 -1  2  0  0  2  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 7150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  0  1  0  0  0  0  0 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 10, 11, 12, 13, 14, 15]), Candidate: [ 2  1  1 -1  2  1  1 -1  1  2  0  1  1  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  0  1  0 -1  1 -1  1 -1  0  1  0  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 10, 11, 13, 15, 18, 19]), Candidate: [ 2  1  1 -1  2  1  1 -1  1  2  0  0  2  0  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  0  1 -1  1 -1  0  1  0  0  0 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 10, 12, 15, 16, 17, 18]), Candidate: [ 2  1  1 -1  2  1  1 -1  1  2 -1  2  0  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 7300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  0  0  1  0 -1  1  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 11, 12, 14, 15, 17, 19]), Candidate: [ 2  1  1 -1  2  1  1 -1  1  1  1  1  0  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  0  0  0  1 -1  1  0 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 12, 14, 15, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  1  1 -1  1  1  0  2  0  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1  0  0  0 -1  0  1 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 5, 6, 8, 9, 10, 11, 14, 16, 17]), Candidate: [ 2  1  1 -1  2  1  0  1  1  1  0  0  1  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1  0  0 -1  1 -1  0  0  0  1  0  0  0] (Indices: [0, 1, 2, 3, 5, 6, 8, 9, 10, 12, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  1  0  1  1  1 -1  2  0  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1  0 -1  1  0  0 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 3, 5, 6, 8, 9, 11, 12, 13, 18, 19]), Candidate: [ 2  1  1 -1  2  1  0  1  1  0  1  1  1  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1  0 -1  1 -1  0  1 -1  0  1  0  0  0] (Indices: [0, 1, 2, 3, 5, 6, 8, 9, 11, 14, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  1  0  1  1  0  1  0  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1  0 -1  0  0  1  0 -1  0  1  0  0  0] (Indices: [0, 1, 2, 3, 5, 6, 8, 9, 13, 14, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  1  0  1  1  0  0  1  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1 -1  1  0 -1  1  0  0 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 5, 6, 8, 10, 11, 13, 14, 15, 19]), Candidate: [ 2  1  1 -1  2  1  0  1  0  2  0  0  2  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1 -1  1 -1  1  0 -1  0  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 5, 6, 8, 10, 12, 13, 16, 18, 19]), Candidate: [ 2  1  1 -1  2  1  0  1  0  2 -1  2  1  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1 -1  0  1  0  0 -1  1  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 5, 6, 8, 11, 12, 13, 15, 16, 19]), Candidate: [ 2  1  1 -1  2  1  0  1  0  1  1  1  1  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1 -1  0  0  1  0  0 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 8, 12, 13, 14, 16, 17, 18]), Candidate: [ 2  1  1 -1  2  1  0  1  0  1  0  2  1  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  1  0  0  0 -1  0  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 9, 10, 11, 12, 15, 17, 18]), Candidate: [ 2  1  1 -1  2  1  0  0  2  1  0  1  0  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  1  0 -1  1  0  0 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 5, 6, 9, 10, 12, 13, 14, 17, 19]), Candidate: [ 2  1  1 -1  2  1  0  0  2  1 -1  2  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 7950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  1 -1  1  0  0  0  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 9, 11, 12, 13, 14, 15, 18]), Candidate: [ 2  1  1 -1  2  1  0  0  2  0  1  1  1  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  1 -1  1 -1  0  1  0  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 5, 6, 9, 11, 14, 15, 16, 18, 19]), Candidate: [ 2  1  1 -1  2  1  0  0  2  0  1  0  1  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  0  1  0  0  0 -1  0  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 5, 6, 10, 11, 12, 13, 16, 18, 19]), Candidate: [ 2  1  1 -1  2  1  0  0  1  2  0  1  1  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  0  1 -1  1  0 -1  1  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 5, 6, 10, 12, 13, 15, 16, 18, 19]), Candidate: [ 2  1  1 -1  2  1  0  0  1  2 -1  2  1  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  0  0  0  1 -1  1  0  0  0  0  0  0] (Indices: [0, 1, 2, 3, 5, 6, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  1  0  0  1  1  0  2  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0  0  0  0 -1  0  0  1  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 5, 7, 8, 9, 10, 11, 15, 16, 19]), Candidate: [ 2  1  1 -1  2  0  2  0  1  1  0  0  1  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0  0  0 -1  0  1  0 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 5, 7, 8, 9, 10, 13, 14, 17, 18]), Candidate: [ 2  1  1 -1  2  0  2  0  1  1 -1  1  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 8300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0  0 -1  1  0 -1  1 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 5, 7, 8, 9, 11, 12, 14, 17, 18]), Candidate: [ 2  1  1 -1  2  0  2  0  1  0  1  1  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0  0 -1  0  1  0  0  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 3, 5, 7, 8, 9, 12, 13, 14, 15, 18]), Candidate: [ 2  1  1 -1  2  0  2  0  1  0  0  2  1  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0  0 -1  0  0  0  1  0  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 5, 7, 8, 9, 14, 15, 16, 18, 19]), Candidate: [ 2  1  1 -1  2  0  2  0  1  0  0  1  1  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0 -1  1  0 -1  1 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 5, 7, 8, 10, 11, 13, 15, 16, 18]), Candidate: [ 2  1  1 -1  2  0  2  0  0  2  0  0  2  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0 -1  1 -1  1 -1  1 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 5, 7, 8, 10, 12, 14, 16, 17, 18]), Candidate: [ 2  1  1 -1  2  0  2  0  0  2 -1  2  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 8550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0 -1  0  1  0 -1  1  0  0  0 -1  0  1] (Indices: [0, 1, 2, 3, 5, 7, 8, 11, 12, 14, 15, 16, 17]), Candidate: [ 2  1  1 -1  2  0  2  0  0  1  1  1  0  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0 -1  0  0  1  0 -1  0  1  0  0  0  0] (Indices: [0, 1, 2, 3, 5, 7, 8, 12, 13, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  0  2  0  0  1  0  2  1  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  1  0  0 -1  1  0  0 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 5, 7, 9, 10, 11, 13, 14, 15, 17]), Candidate: [ 2  1  1 -1  2  0  2 -1  2  1  0  0  2  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  1  0 -1  1  0 -1  0  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 5, 7, 9, 10, 12, 13, 16, 17, 18]), Candidate: [ 2  1  1 -1  2  0  2 -1  2  1 -1  2  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 8750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  1 -1  1  0  0 -1  1  0  0 -1  0  1] (Indices: [0, 1, 2, 3, 5, 7, 9, 11, 12, 13, 15, 16, 17]), Candidate: [ 2  1  1 -1  2  0  2 -1  2  0  1  1  1  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  1 -1  0  1  0  0  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 5, 7, 9, 12, 13, 14, 15, 17, 19]), Candidate: [ 2  1  1 -1  2  0  2 -1  2  0  0  2  1  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  0  1  0  0 -1  1 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 5, 7, 10, 11, 12, 14, 16, 17, 18]), Candidate: [ 2  1  1 -1  2  0  2 -1  1  2  0  1  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 8900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  0  1 -1  1 -1  0  1  0  0  0  0  0] (Indices: [0, 1, 2, 3, 5, 7, 10, 12, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  0  2 -1  1  2 -1  2  0  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 8950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1  0  0  0  0  0 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 5, 8, 9, 10, 11, 12, 13, 15, 17]), Candidate: [ 2  1  1 -1  2  0  1  1  1  1  0  1  1  0  1  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1  0  0  0 -1  0  1  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 5, 8, 9, 10, 11, 14, 15, 16, 18]), Candidate: [ 2  1  1 -1  2  0  1  1  1  1  0  0  1  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1  0  0 -1  0  1  0  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 5, 8, 9, 10, 13, 14, 15, 16, 18]), Candidate: [ 2  1  1 -1  2  0  1  1  1  1 -1  1  2  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1  0 -1  1  0 -1  0  1  0  0  0 -1  1] (Indices: [0, 1, 2, 3, 5, 8, 9, 11, 12, 15, 16, 17, 18]), Candidate: [ 2  1  1 -1  2  0  1  1  1  0  1  1  0  1  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1  0 -1  0  0  1  0  0 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 5, 8, 9, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  0  1  1  1  0  0  1  2  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1 -1  1  0 -1  1 -1  1  0  0 -1  1  0] (Indices: [0, 1, 2, 3, 5, 8, 10, 11, 13, 15, 16, 17, 19]), Candidate: [ 2  1  1 -1  2  0  1  1  0  2  0  0  2  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1 -1  0  1  0  0 -1  1  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 5, 8, 11, 12, 13, 15, 16, 18, 19]), Candidate: [ 2  1  1 -1  2  0  1  1  0  1  1  1  1  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  1  0  0  0 -1  1 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 5, 9, 10, 11, 12, 14, 16, 17, 18]), Candidate: [ 2  1  1 -1  2  0  1  0  2  1  0  1  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  1  0 -1  1 -1  0  1  0  0  0  0  0] (Indices: [0, 1, 2, 3, 5, 9, 10, 12, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  0  1  0  2  1 -1  2  0  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  0  1  0  0  0  0 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 5, 10, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 2  1  1 -1  2  0  1  0  1  2  0  1  1  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0  0  0  0  0 -1  0  1  0 -1  0  0  1] (Indices: [0, 1, 2, 3, 6, 7, 8, 9, 10, 11, 12, 15, 16]), Candidate: [ 2  1  1 -1  1  2  1  0  1  1  0  1  0  1  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0  0  0 -1  1  0 -1  1  0 -1  0  0  1] (Indices: [0, 1, 2, 3, 6, 7, 8, 9, 10, 12, 13, 15, 16]), Candidate: [ 2  1  1 -1  1  2  1  0  1  1 -1  2  1  0  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0  0  0 -1  0  0  1  0  0  0 -1  0  1] (Indices: [0, 1, 2, 3, 6, 7, 8, 9, 10, 14, 15, 16, 17]), Candidate: [ 2  1  1 -1  1  2  1  0  1  1 -1  1  1  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0  0 -1  1 -1  1  0  0  0 -1  0  0  1] (Indices: [0, 1, 2, 3, 6, 7, 8, 9, 11, 13, 14, 15, 16]), Candidate: [ 2  1  1 -1  1  2  1  0  1  0  1  0  2  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0  0 -1  0  1  0 -1  1 -1  0  1  0  0] (Indices: [0, 1, 2, 3, 6, 7, 8, 9, 12, 13, 15, 18, 19]), Candidate: [ 2  1  1 -1  1  2  1  0  1  0  0  2  1  0  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0 -1  1  0  0  0 -1  0  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 6, 7, 8, 10, 11, 12, 13, 16, 17]), Candidate: [ 2  1  1 -1  1  2  1  0  0  2  0  1  1  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0 -1  1  0 -1  0  1  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 6, 7, 8, 10, 11, 14, 15, 17, 19]), Candidate: [ 2  1  1 -1  1  2  1  0  0  2  0  0  1  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0 -1  1 -1  0  1  0  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 6, 7, 8, 10, 13, 14, 15, 17, 19]), Candidate: [ 2  1  1 -1  1  2  1  0  0  2 -1  1  2  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0 -1  0  1  0 -1  0  1 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 6, 7, 8, 11, 12, 15, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  2  1  0  0  1  1  1  0  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0 -1  0  0  0  0  1  0  0  0  0  0  0] (Indices: [0, 1, 2, 3, 6, 7, 8, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  2  1  0  0  1  0  1  1  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  1  0  0 -1  1 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 6, 7, 9, 10, 11, 13, 15, 17, 19]), Candidate: [ 2  1  1 -1  1  2  1 -1  2  1  0  0  2  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  1  0 -1  1 -1  1 -1  0  1  0  0  0] (Indices: [0, 1, 2, 3, 6, 7, 9, 10, 12, 14, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  2  1 -1  2  1 -1  2  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 10050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  1 -1  1  0 -1  1  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 6, 7, 9, 11, 12, 14, 15, 17, 18]), Candidate: [ 2  1  1 -1  1  2  1 -1  2  0  1  1  0  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  1 -1  0  1 -1  1  0  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 6, 7, 9, 12, 14, 15, 16, 18, 19]), Candidate: [ 2  1  1 -1  1  2  1 -1  2  0  0  2  0  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  0  1  0 -1  1  0  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 6, 7, 10, 11, 13, 14, 15, 17, 19]), Candidate: [ 2  1  1 -1  1  2  1 -1  1  2  0  0  2  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  0  0  1  0  0  0  0 -1  0  1  0  0] (Indices: [0, 1, 2, 3, 6, 7, 11, 12, 13, 14, 15, 18, 19]), Candidate: [ 2  1  1 -1  1  2  1 -1  1  1  1  1  1  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1  0  0  0  0 -1  1 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 6, 8, 9, 10, 11, 12, 14, 16, 17]), Candidate: [ 2  1  1 -1  1  2  0  1  1  1  0  1  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1  0  0  0 -1  0  0  0  1  0  0  0  0] (Indices: [0, 1, 2, 3, 6, 8, 9, 10, 11, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  2  0  1  1  1  0  0  1  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1  0  0 -1  0  1 -1  0  1  0  0  0  0] (Indices: [0, 1, 2, 3, 6, 8, 9, 10, 13, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  2  0  1  1  1 -1  1  2  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1  0 -1  1 -1  1  0 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 6, 8, 9, 11, 13, 14, 16, 18, 19]), Candidate: [ 2  1  1 -1  1  2  0  1  1  0  1  0  2  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1 -1  1  0  0  0  0 -1  0  0  1  0  0] (Indices: [0, 1, 2, 3, 6, 8, 10, 11, 12, 13, 14, 18, 19]), Candidate: [ 2  1  1 -1  1  2  0  1  0  2  0  1  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1 -1  1 -1  1  0  0  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 6, 8, 10, 12, 13, 14, 15, 17, 18]), Candidate: [ 2  1  1 -1  1  2  0  1  0  2 -1  2  1  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1 -1  0  1 -1  1  0 -1  1  0  0  0  0] (Indices: [0, 1, 2, 3, 6, 8, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  2  0  1  0  1  1  0  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  1  0  0 -1  1  0  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 6, 9, 10, 11, 13, 14, 15, 17, 19]), Candidate: [ 2  1  1 -1  1  2  0  0  2  1  0  0  2  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  1 -1  1  0  0  0  0 -1  0  1  0  0] (Indices: [0, 1, 2, 3, 6, 9, 11, 12, 13, 14, 15, 18, 19]), Candidate: [ 2  1  1 -1  1  2  0  0  2  0  1  1  1  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  0  1  0  0 -1  1 -1  1  0  0  0  0] (Indices: [0, 1, 2, 3, 6, 10, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  2  0  0  1  2  0  1  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0  0  0  0  0 -1  1 -1  0  0  1  0  0] (Indices: [0, 1, 2, 3, 7, 8, 9, 10, 11, 12, 14, 18, 19]), Candidate: [ 2  1  1 -1  1  1  2  0  1  1  0  1  0  2 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0  0  0 -1  1  0  0 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 7, 8, 9, 10, 12, 13, 14, 16, 17]), Candidate: [ 2  1  1 -1  1  1  2  0  1  1 -1  2  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 10850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0  0  0 -1  0  0  1 -1  1  0  0  0  0] (Indices: [0, 1, 2, 3, 7, 8, 9, 10, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  1  2  0  1  1 -1  1  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 10900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0  0 -1  1 -1  1 -1  1 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 7, 8, 9, 11, 13, 15, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  1  2  0  1  0  1  0  2  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0 -1  1  0  0  0 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 7, 8, 10, 11, 12, 13, 15, 17, 19]), Candidate: [ 2  1  1 -1  1  1  2  0  0  2  0  1  1  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0 -1  1 -1  1  0  0 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 7, 8, 10, 12, 13, 14, 16, 18, 19]), Candidate: [ 2  1  1 -1  1  1  2  0  0  2 -1  2  1  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 11050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0 -1  0  0  1  0  0  0  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 7, 8, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  1  1 -1  1  1  2  0  0  1  0  2  1  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  1  0  0 -1  1  0 -1  0  1  0  0  0] (Indices: [0, 1, 2, 3, 7, 9, 10, 11, 13, 14, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  1  2 -1  2  1  0  0  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 11150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  1 -1  1  0  0 -1  1  0  0  0 -1  1] (Indices: [0, 1, 2, 3, 7, 9, 11, 12, 13, 15, 16, 17, 18]), Candidate: [ 2  1  1 -1  1  1  2 -1  2  0  1  1  1  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 11200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  0  1  0 -1  1  0  0 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 7, 10, 11, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  1  2 -1  1  2  0  0  2  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 11250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1  0  0  0  0 -1  1 -1  0  1  0  0  0] (Indices: [0, 1, 2, 3, 8, 9, 10, 11, 12, 14, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  1  1  1  1  1  0  1  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 11300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1  0  0 -1  0  1  0  0  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 8, 9, 10, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  1  1 -1  1  1  1  1  1  1 -1  1  2  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 11350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1 -1  1  0  0  0  0 -1  0  1  0  0  0] (Indices: [0, 1, 2, 3, 8, 10, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  1  1  1  0  2  0  1  1  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 11400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  1  0  0  0  0 -1  0  1  0  0  0  0] (Indices: [0, 1, 2, 3, 9, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  1  1  0  2  1  0  1  1  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0  0  0  0 -1  1 -1  0  1 -1  0  0  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 9, 10, 11, 13, 16]), Candidate: [2 1 0 1 1 1 1 0 1 1 0 0 2 0 0 2 0 1 1 7]
 -> Valid neighbor added.
Attempt 11500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0  0  0 -1  0  1 -1  0  1 -1  1 -1  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 9, 10, 13, 16, 18]), Candidate: [ 2  1  0  1  1  1  1  0  1  1 -1  1  2  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0  0 -1  1 -1  1  0 -1  0  0  0  1  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 9, 11, 13, 14, 19]), Candidate: [ 2  1  0  1  1  1  1  0  1  0  1  0  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0  0 -1  0  1 -1  1 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 9, 12, 14, 16, 17]), Candidate: [ 2  1  0  1  1  1  1  0  1  0  0  2  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0  0 -1  0  0  0  0  0  1  0  0  0  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 9, 16, 17, 18, 19]), Candidate: [2 1 0 1 1 1 1 0 1 0 0 1 1 1 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 11700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0 -1  1  0 -1  0  0  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 10, 11, 15, 17, 18]), Candidate: [2 1 0 1 1 1 1 0 0 2 0 0 1 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 11750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0 -1  1 -1  0  1  0 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 10, 13, 14, 17, 19]), Candidate: [ 2  1  0  1  1  1  1  0  0  2 -1  1  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 11800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0 -1  0  1  0 -1  1 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 11, 12, 14, 17, 19]), Candidate: [ 2  1  0  1  1  1  1  0  0  1  1  1  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0 -1  0  0  1  0  0  0 -1  0  0  1  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 12, 13, 14, 15, 19]), Candidate: [2 1 0 1 1 1 1 0 0 1 0 2 1 1 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 11900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0 -1  0  0  0  0  1  0 -1  1  0  0  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 14, 15, 17, 18, 19]), Candidate: [2 1 0 1 1 1 1 0 0 1 0 1 1 2 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 11950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  1  0  0 -1  0  0  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 9, 10, 11, 15, 16, 18]), Candidate: [ 2  1  0  1  1  1  1 -1  2  1  0  0  1  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  1  0 -1  0  1  0 -1  1 -1  0  1  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 9, 10, 13, 14, 16, 19]), Candidate: [ 2  1  0  1  1  1  1 -1  2  1 -1  1  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 12050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  1 -1  1  0 -1  1 -1  1 -1  0  1  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 9, 11, 12, 14, 16, 19]), Candidate: [ 2  1  0  1  1  1  1 -1  2  0  1  1  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 12100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  1 -1  0  1  0  0  0 -1  1 -1  0  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 9, 12, 13, 14, 15, 17]), Candidate: [ 2  1  0  1  1  1  1 -1  2  0  0  2  1  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  1 -1  0  0  0  1  0  0  0 -1  1  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 9, 14, 15, 16, 17, 19]), Candidate: [ 2  1  0  1  1  1  1 -1  2  0  0  1  1  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  0  1  0 -1  1 -1  1  0  0 -1  0  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 10, 11, 13, 15, 16, 17]), Candidate: [ 2  1  0  1  1  1  1 -1  1  2  0  0  2  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  0  1 -1  1 -1  1  0 -1  0  1  0  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 10, 12, 14, 15, 18, 19]), Candidate: [ 2  1  0  1  1  1  1 -1  1  2 -1  2  0  2  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 12300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  0  0  1  0  0 -1  0  0  1  0  0  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 11, 12, 13, 17, 18, 19]), Candidate: [ 2  1  0  1  1  1  1 -1  1  1  1  1  1  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  0  0  0  1  0 -1  1 -1  1  0  0  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 12, 13, 15, 17, 18, 19]), Candidate: [ 2  1  0  1  1  1  1 -1  1  1  0  2  1  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1  0  0  0 -1  1 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 4, 5, 6, 8, 9, 10, 11, 13, 18, 19]), Candidate: [2 1 0 1 1 1 0 1 1 1 0 0 2 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 12450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1  0  0 -1  1 -1  0  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 4, 5, 6, 8, 9, 10, 12, 15, 17, 19]), Candidate: [ 2  1  0  1  1  1  0  1  1  1 -1  2  0  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1  0 -1  1  0  0 -1  0  1  0 -1  0  1] (Indices: [0, 1, 2, 4, 5, 6, 8, 9, 11, 12, 13, 16, 17]), Candidate: [2 1 0 1 1 1 0 1 1 0 1 1 1 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 12550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1  0 -1  1 -1  0  1  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 4, 5, 6, 8, 9, 11, 14, 15, 17, 19]), Candidate: [2 1 0 1 1 1 0 1 1 0 1 0 1 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 12600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1  0 -1  0  0  1  0  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 4, 5, 6, 8, 9, 13, 14, 15, 17, 19]), Candidate: [2 1 0 1 1 1 0 1 1 0 0 1 2 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 12650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1 -1  1  0  0 -1  0  0  1 -1  1  0  0] (Indices: [0, 1, 2, 4, 5, 6, 8, 10, 11, 12, 16, 18, 19]), Candidate: [2 1 0 1 1 1 0 1 0 2 0 1 0 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 12700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1 -1  1 -1  1  0 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 4, 5, 6, 8, 10, 12, 13, 15, 17, 18]), Candidate: [ 2  1  0  1  1  1  0  1  0  2 -1  2  1  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1 -1  0  1  0  0  0 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 4, 5, 6, 8, 11, 12, 13, 14, 17, 18]), Candidate: [ 2  1  0  1  1  1  0  1  0  1  1  1  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1 -1  0  0  1  0  0  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 4, 5, 6, 8, 12, 13, 14, 15, 16, 18]), Candidate: [2 1 0 1 1 1 0 1 0 1 0 2 1 1 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 12850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  1  0  0  0 -1  1 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 4, 5, 6, 9, 10, 11, 12, 14, 17, 19]), Candidate: [ 2  1  0  1  1  1  0  0  2  1  0  1  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  1  0 -1  1  0  0  0 -1  0  0  1  0] (Indices: [0, 1, 2, 4, 5, 6, 9, 10, 12, 13, 14, 15, 19]), Candidate: [ 2  1  0  1  1  1  0  0  2  1 -1  2  1  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  1  0 -1  0  0  1  0 -1  1  0  0  0] (Indices: [0, 1, 2, 4, 5, 6, 9, 10, 14, 15, 17, 18, 19]), Candidate: [ 2  1  0  1  1  1  0  0  2  1 -1  1  1  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  1 -1  1 -1  1 -1  1  0 -1  1  0  0] (Indices: [0, 1, 2, 4, 5, 6, 9, 11, 13, 15, 16, 18, 19]), Candidate: [2 1 0 1 1 1 0 0 2 0 1 0 2 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 13050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  0  1  0  0  0 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 4, 5, 6, 10, 11, 12, 13, 15, 17, 18]), Candidate: [2 1 0 1 1 1 0 0 1 2 0 1 1 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 13100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  0  1 -1  1  0  0 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 4, 5, 6, 10, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  1  0  1  1  1  0  0  1  2 -1  2  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 13150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  0  0  0  1  0  0  0  0  0 -1  1  0] (Indices: [0, 1, 2, 4, 5, 6, 12, 13, 14, 15, 16, 17, 19]), Candidate: [2 1 0 1 1 1 0 0 1 1 0 2 1 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 13200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0  0  0  0 -1  0  1 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 4, 5, 7, 8, 9, 10, 11, 14, 17, 18]), Candidate: [ 2  1  0  1  1  0  2  0  1  1  0  0  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0  0  0 -1  0  1  0  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 4, 5, 7, 8, 9, 10, 13, 14, 15, 18]), Candidate: [ 2  1  0  1  1  0  2  0  1  1 -1  1  2  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0  0 -1  1  0 -1  1  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 4, 5, 7, 8, 9, 11, 12, 14, 15, 18]), Candidate: [2 1 0 1 1 0 2 0 1 0 1 1 0 2 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 13350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0  0 -1  1 -1  0  0  1  0 -1  1  0  0] (Indices: [0, 1, 2, 4, 5, 7, 8, 9, 11, 15, 16, 18, 19]), Candidate: [2 1 0 1 1 0 2 0 1 0 1 0 1 1 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 13400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0  0 -1  0  0  1 -1  1  0 -1  1  0  0] (Indices: [0, 1, 2, 4, 5, 7, 8, 9, 13, 15, 16, 18, 19]), Candidate: [2 1 0 1 1 0 2 0 1 0 0 1 2 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 13450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0 -1  1  0 -1  1  0 -1  1 -1  0  1  0] (Indices: [0, 1, 2, 4, 5, 7, 8, 10, 11, 13, 14, 16, 19]), Candidate: [ 2  1  0  1  1  0  2  0  0  2  0  0  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0 -1  1 -1  1 -1  1  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 4, 5, 7, 8, 10, 12, 14, 15, 16, 18]), Candidate: [ 2  1  0  1  1  0  2  0  0  2 -1  2  0  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0 -1  0  1  0  0 -1  1 -1  0  1  0  0] (Indices: [0, 1, 2, 4, 5, 7, 8, 11, 12, 13, 15, 18, 19]), Candidate: [2 1 0 1 1 0 2 0 0 1 1 1 1 0 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 13600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0 -1  0  0  1  0  0 -1  0  1  0  0  0] (Indices: [0, 1, 2, 4, 5, 7, 8, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  1  0  1  1  0  2  0  0  1  0  2  1  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  1  0  0  0 -1  0  0  1  0  0 -1  1] (Indices: [0, 1, 2, 4, 5, 7, 9, 10, 11, 12, 16, 17, 18]), Candidate: [ 2  1  0  1  1  0  2 -1  2  1  0  1  0  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  1  0 -1  1  0 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 4, 5, 7, 9, 10, 12, 13, 15, 16, 18]), Candidate: [ 2  1  0  1  1  0  2 -1  2  1 -1  2  1  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 13750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  1 -1  1  0  0  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 4, 5, 7, 9, 11, 12, 13, 14, 16, 18]), Candidate: [ 2  1  0  1  1  0  2 -1  2  0  1  1  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 13800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  1 -1  1 -1  0  0  1  0  0  0  0  0] (Indices: [0, 1, 2, 4, 5, 7, 9, 11, 15, 16, 17, 18, 19]), Candidate: [ 2  1  0  1  1  0  2 -1  2  0  1  0  1  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  0  1  0  0 -1  1  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 4, 5, 7, 10, 11, 12, 14, 15, 16, 18]), Candidate: [ 2  1  0  1  1  0  2 -1  1  2  0  1  0  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  0  1 -1  1 -1  1  0  0  0  0 -1  1] (Indices: [0, 1, 2, 4, 5, 7, 10, 12, 14, 15, 16, 17, 18]), Candidate: [ 2  1  0  1  1  0  2 -1  1  2 -1  2  0  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 13950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1  0  0  0  0  0  0 -1  1 -1  0  0  1] (Indices: [0, 1, 2, 4, 5, 8, 9, 10, 11, 12, 13, 14, 16]), Candidate: [ 2  1  0  1  1  0  1  1  1  1  0  1  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1  0  0  0 -1  1 -1  0  1  0  0 -1  1] (Indices: [0, 1, 2, 4, 5, 8, 9, 10, 11, 13, 16, 17, 18]), Candidate: [2 1 0 1 1 0 1 1 1 1 0 0 2 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 14050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1  0  0 -1  1 -1  0  1  0  0 -1  1  0] (Indices: [0, 1, 2, 4, 5, 8, 9, 10, 12, 15, 16, 17, 19]), Candidate: [ 2  1  0  1  1  0  1  1  1  1 -1  2  0  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1  0 -1  1  0 -1  1  0 -1  0  1  0  0] (Indices: [0, 1, 2, 4, 5, 8, 9, 11, 12, 14, 15, 18, 19]), Candidate: [2 1 0 1 1 0 1 1 1 0 1 1 0 2 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 14150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1  0 -1  0  1 -1  1 -1  1  0  0  0  0] (Indices: [0, 1, 2, 4, 5, 8, 9, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  1  0  1  1  0  1  1  1  0  0  2  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1 -1  1  0 -1  1  0 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 4, 5, 8, 10, 11, 13, 14, 16, 17, 18]), Candidate: [ 2  1  0  1  1  0  1  1  0  2  0  0  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1 -1  0  1  0  0  0 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 4, 5, 8, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  1  0  1  1  0  1  1  0  1  1  1  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  1  0  0  0 -1  1  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 4, 5, 9, 10, 11, 12, 14, 15, 16, 18]), Candidate: [2 1 0 1 1 0 1 0 2 1 0 1 0 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 14350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  1  0 -1  1 -1  1  0  0  0  0 -1  1] (Indices: [0, 1, 2, 4, 5, 9, 10, 12, 14, 15, 16, 17, 18]), Candidate: [ 2  1  0  1  1  0  1  0  2  1 -1  2  0  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  0  1  0  0  0  0  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 4, 5, 10, 11, 12, 13, 14, 15, 16, 18]), Candidate: [2 1 0 1 1 0 1 0 1 2 0 1 1 1 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 14450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0  0  0  0  0 -1  1  0 -1  0  0  0  1] (Indices: [0, 1, 2, 4, 6, 7, 8, 9, 10, 11, 12, 14, 15]), Candidate: [2 1 0 1 0 2 1 0 1 1 0 1 0 2 0 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 14500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0  0  0 -1  1  0  0  0 -1  0  0  0  1] (Indices: [0, 1, 2, 4, 6, 7, 8, 9, 10, 12, 13, 14, 15]), Candidate: [ 2  1  0  1  0  2  1  0  1  1 -1  2  1  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0  0  0 -1  0  1 -1  1 -1  0  1  0  0] (Indices: [0, 1, 2, 4, 6, 7, 8, 9, 10, 13, 15, 18, 19]), Candidate: [ 2  1  0  1  0  2  1  0  1  1 -1  1  2  0  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0  0 -1  1  0 -1  0  1 -1  0  1  0  0] (Indices: [0, 1, 2, 4, 6, 7, 8, 9, 11, 12, 15, 18, 19]), Candidate: [2 1 0 1 0 2 1 0 1 0 1 1 0 1 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 14650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0  0 -1  0  1  0 -1  1  0  0 -1  0  1] (Indices: [0, 1, 2, 4, 6, 7, 8, 9, 12, 13, 15, 16, 17]), Candidate: [2 1 0 1 0 2 1 0 1 0 0 2 1 0 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 14700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0 -1  1  0  0  0  0 -1  0  0  0  1  0] (Indices: [0, 1, 2, 4, 6, 7, 8, 10, 11, 12, 13, 14, 19]), Candidate: [ 2  1  0  1  0  2  1  0  0  2  0  1  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0 -1  1  0 -1  1 -1  0  0  1  0  0  0] (Indices: [0, 1, 2, 4, 6, 7, 8, 10, 11, 13, 17, 18, 19]), Candidate: [2 1 0 1 0 2 1 0 0 2 0 0 2 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 14800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0 -1  1 -1  1 -1  0  0  1  0  0  0  0] (Indices: [0, 1, 2, 4, 6, 7, 8, 10, 12, 16, 17, 18, 19]), Candidate: [ 2  1  0  1  0  2  1  0  0  2 -1  2  0  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0 -1  0  1  0 -1  1 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 16, 18, 19]), Candidate: [ 2  1  0  1  0  2  1  0  0  1  1  1  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0 -1  0  0  0  1  0  0  0  0 -1  1  0] (Indices: [0, 1, 2, 4, 6, 7, 8, 13, 14, 15, 16, 17, 19]), Candidate: [2 1 0 1 0 2 1 0 0 1 0 1 2 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 14950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  1  0  0 -1  1  0 -1  0  0  1  0  0] (Indices: [0, 1, 2, 4, 6, 7, 9, 10, 11, 13, 14, 18, 19]), Candidate: [ 2  1  0  1  0  2  1 -1  2  1  0  0  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  1  0 -1  1 -1  1  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 4, 6, 7, 9, 10, 12, 14, 15, 17, 19]), Candidate: [ 2  1  0  1  0  2  1 -1  2  1 -1  2  0  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  1 -1  1  0  0 -1  0  1 -1  1  0  0] (Indices: [0, 1, 2, 4, 6, 7, 9, 11, 12, 13, 16, 18, 19]), Candidate: [ 2  1  0  1  0  2  1 -1  2  0  1  1  1  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  1 -1  0  1  0 -1  1  0 -1  1  0  0] (Indices: [0, 1, 2, 4, 6, 7, 9, 12, 13, 15, 16, 18, 19]), Candidate: [ 2  1  0  1  0  2  1 -1  2  0  0  2  1  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  0  1  0  0 -1  0  0  1  0  0  0  0] (Indices: [0, 1, 2, 4, 6, 7, 10, 11, 12, 16, 17, 18, 19]), Candidate: [ 2  1  0  1  0  2  1 -1  1  2  0  1  0  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  0  0  1  0  0  0  0  0  0 -1  0  1] (Indices: [0, 1, 2, 4, 6, 7, 11, 12, 13, 14, 15, 16, 17]), Candidate: [ 2  1  0  1  0  2  1 -1  1  1  1  1  1  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1  0  0  0  0  0 -1  0  0  0  1  0  0] (Indices: [0, 1, 2, 4, 6, 8, 9, 10, 11, 12, 13, 18, 19]), Candidate: [2 1 0 1 0 2 0 1 1 1 0 1 1 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 15300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1  0  0  0 -1  0  1 -1  0  1  0  0  0] (Indices: [0, 1, 2, 4, 6, 8, 9, 10, 11, 14, 17, 18, 19]), Candidate: [ 2  1  0  1  0  2  0  1  1  1  0  0  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1  0  0 -1  0  1  0 -1  0  1  0  0  0] (Indices: [0, 1, 2, 4, 6, 8, 9, 10, 13, 14, 17, 18, 19]), Candidate: [ 2  1  0  1  0  2  0  1  1  1 -1  1  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1  0 -1  1 -1  1  0  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 4, 6, 8, 9, 11, 13, 14, 15, 17, 18]), Candidate: [2 1 0 1 0 2 0 1 1 0 1 0 2 1 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 15450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1 -1  1  0  0  0  0 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 4, 6, 8, 10, 11, 12, 13, 14, 16, 17]), Candidate: [ 2  1  0  1  0  2  0  1  0  2  0  1  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1 -1  1  0 -1  0  1 -1  1  0  0  0  0] (Indices: [0, 1, 2, 4, 6, 8, 10, 11, 14, 16, 17, 18, 19]), Candidate: [ 2  1  0  1  0  2  0  1  0  2  0  0  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1 -1  0  1  0 -1  0  1  0  0  0  0  0] (Indices: [0, 1, 2, 4, 6, 8, 11, 12, 15, 16, 17, 18, 19]), Candidate: [2 1 0 1 0 2 0 1 0 1 1 1 0 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 15600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  1  0  0  0 -1  0  0  1  0  0  0  0] (Indices: [0, 1, 2, 4, 6, 9, 10, 11, 12, 16, 17, 18, 19]), Candidate: [2 1 0 1 0 2 0 0 2 1 0 1 0 1 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 15650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  1 -1  1  0  0  0  0  0  0 -1  0  1] (Indices: [0, 1, 2, 4, 6, 9, 11, 12, 13, 14, 15, 16, 17]), Candidate: [2 1 0 1 0 2 0 0 2 0 1 1 1 1 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 15700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  0  1  0  0  0 -1  0  1  0  0  0  0] (Indices: [0, 1, 2, 4, 6, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [2 1 0 1 0 2 0 0 1 2 0 1 1 0 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 15750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0  0  0  0  0 -1  1 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 4, 7, 8, 9, 10, 11, 12, 14, 16, 17]), Candidate: [ 2  1  0  1  0  1  2  0  1  1  0  1  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0  0  0  0 -1  0  0  0  1  0  0  0  0] (Indices: [0, 1, 2, 4, 7, 8, 9, 10, 11, 16, 17, 18, 19]), Candidate: [2 1 0 1 0 1 2 0 1 1 0 0 1 1 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 15850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0  0  0 -1  0  1 -1  0  1  0  0  0  0] (Indices: [0, 1, 2, 4, 7, 8, 9, 10, 13, 16, 17, 18, 19]), Candidate: [ 2  1  0  1  0  1  2  0  1  1 -1  1  2  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0  0 -1  1 -1  1  0 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 4, 7, 8, 9, 11, 13, 14, 16, 18, 19]), Candidate: [ 2  1  0  1  0  1  2  0  1  0  1  0  2  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0 -1  1  0  0  0  0 -1  0  0  1  0  0] (Indices: [0, 1, 2, 4, 7, 8, 10, 11, 12, 13, 14, 18, 19]), Candidate: [ 2  1  0  1  0  1  2  0  0  2  0  1  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0 -1  1 -1  1  0  0  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 4, 7, 8, 10, 12, 13, 14, 15, 17, 18]), Candidate: [ 2  1  0  1  0  1  2  0  0  2 -1  2  1  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0 -1  0  1 -1  1  0 -1  1  0  0  0  0] (Indices: [0, 1, 2, 4, 7, 8, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  0  1  0  1  2  0  0  1  1  0  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  1  0  0 -1  1  0  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 4, 7, 9, 10, 11, 13, 14, 15, 17, 19]), Candidate: [ 2  1  0  1  0  1  2 -1  2  1  0  0  2  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  1 -1  1  0  0  0  0 -1  0  1  0  0] (Indices: [0, 1, 2, 4, 7, 9, 11, 12, 13, 14, 15, 18, 19]), Candidate: [ 2  1  0  1  0  1  2 -1  2  0  1  1  1  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  0  1  0  0 -1  1 -1  1  0  0  0  0] (Indices: [0, 1, 2, 4, 7, 10, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  1  0  1  0  1  2 -1  1  2  0  1  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1  0  0  0  0 -1  1  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 4, 8, 9, 10, 11, 12, 14, 15, 17, 19]), Candidate: [2 1 0 1 0 1 1 1 1 1 0 1 0 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 16300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1  0  0 -1  1 -1  1  0 -1  1  0  0  0] (Indices: [0, 1, 2, 4, 8, 9, 10, 12, 14, 15, 17, 18, 19]), Candidate: [ 2  1  0  1  0  1  1  1  1  1 -1  2  0  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1 -1  1  0  0  0  0  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 4, 8, 10, 11, 12, 13, 14, 15, 17, 19]), Candidate: [2 1 0 1 0 1 1 1 0 2 0 1 1 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 16400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  0  1  0  0  0  0  0 -1  0  1  0  0  0] (Indices: [0, 1, 2, 4, 9, 10, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  1  0  1  0  1  1  0  2  1  0  1  1  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0  0  0  0  0  0 -1  0  0  0  1 -1  1] (Indices: [0, 1, 2, 5, 6, 7, 8, 9, 10, 11, 12, 13, 18]), Candidate: [2 1 0 0 2 1 1 0 1 1 0 1 1 0 0 1 1 2 0 7]
 -> Valid neighbor added.
Attempt 16500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0  0  0  0 -1  0  0  0  1 -1  1  0  0] (Indices: [0, 1, 2, 5, 6, 7, 8, 9, 10, 11, 16, 18, 19]), Candidate: [2 1 0 0 2 1 1 0 1 1 0 0 1 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 16550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0  0  0 -1  0  1 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 5, 6, 7, 8, 9, 10, 13, 15, 17, 18]), Candidate: [ 2  1  0  0  2  1  1  0  1  1 -1  1  2  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0  0 -1  1  0 -1  0  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 5, 6, 7, 8, 9, 11, 12, 15, 17, 18]), Candidate: [2 1 0 0 2 1 1 0 1 0 1 1 0 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 16650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0  0 -1  0  1  0  0 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 5, 6, 7, 8, 9, 12, 13, 14, 17, 19]), Candidate: [ 2  1  0  0  2  1  1  0  1  0  0  2  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0 -1  1  0  0  0  0 -1  0  1 -1  0  1] (Indices: [0, 1, 2, 5, 6, 7, 8, 10, 11, 12, 13, 14, 17]), Candidate: [ 2  1  0  0  2  1  1  0  0  2  0  1  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0 -1  1  0 -1  1 -1  0  1  0 -1  1  0] (Indices: [0, 1, 2, 5, 6, 7, 8, 10, 11, 13, 16, 17, 19]), Candidate: [2 1 0 0 2 1 1 0 0 2 0 0 2 0 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 16800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0 -1  1 -1  1 -1  0  1  0 -1  1  0  0] (Indices: [0, 1, 2, 5, 6, 7, 8, 10, 12, 15, 16, 18, 19]), Candidate: [ 2  1  0  0  2  1  1  0  0  2 -1  2  0  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0 -1  0  1  0 -1  1 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 5, 6, 7, 8, 11, 12, 14, 16, 17, 18]), Candidate: [ 2  1  0  0  2  1  1  0  0  1  1  1  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0 -1  0  0  1 -1  0  1  0  0  0  0  0] (Indices: [0, 1, 2, 5, 6, 7, 8, 12, 15, 16, 17, 18, 19]), Candidate: [2 1 0 0 2 1 1 0 0 1 0 2 0 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 16950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  1  0  0 -1  1  0 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 5, 6, 7, 9, 10, 11, 13, 14, 17, 18]), Candidate: [ 2  1  0  0  2  1  1 -1  2  1  0  0  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 17000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  1  0 -1  1 -1  1  0  0 -1  0  1  0] (Indices: [0, 1, 2, 5, 6, 7, 9, 10, 12, 14, 15, 16, 19]), Candidate: [ 2  1  0  0  2  1  1 -1  2  1 -1  2  0  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 17050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  1 -1  1  0  0 -1  0  1  0  0 -1  1] (Indices: [0, 1, 2, 5, 6, 7, 9, 11, 12, 13, 16, 17, 18]), Candidate: [ 2  1  0  0  2  1  1 -1  2  0  1  1  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  1 -1  0  1  0 -1  1  0  0  0 -1  1] (Indices: [0, 1, 2, 5, 6, 7, 9, 12, 13, 15, 16, 17, 18]), Candidate: [ 2  1  0  0  2  1  1 -1  2  0  0  2  1  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  0  1  0  0 -1  0  1  0 -1  1  0  0] (Indices: [0, 1, 2, 5, 6, 7, 10, 11, 12, 15, 16, 18, 19]), Candidate: [ 2  1  0  0  2  1  1 -1  1  2  0  1  0  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  0  1 -1  0  1 -1  1  0  0  0  0  0] (Indices: [0, 1, 2, 5, 6, 7, 10, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  1  0  0  2  1  1 -1  1  2 -1  1  2  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 17250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1  0  0  0  0  0 -1  0  0  1  0 -1  1] (Indices: [0, 1, 2, 5, 6, 8, 9, 10, 11, 12, 13, 17, 18]), Candidate: [2 1 0 0 2 1 0 1 1 1 0 1 1 0 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 17300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1  0  0  0 -1  0  1 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 5, 6, 8, 9, 10, 11, 14, 16, 17, 19]), Candidate: [ 2  1  0  0  2  1  0  1  1  1  0  0  1  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1  0  0 -1  0  1  0 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 5, 6, 8, 9, 10, 13, 14, 16, 17, 19]), Candidate: [ 2  1  0  0  2  1  0  1  1  1 -1  1  2  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 17400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1  0 -1  1 -1  1  0  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 5, 6, 8, 9, 11, 13, 14, 15, 16, 18]), Candidate: [2 1 0 0 2 1 0 1 1 0 1 0 2 1 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 17450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1 -1  1  0  0  0  0  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 5, 6, 8, 10, 11, 12, 13, 14, 15, 18]), Candidate: [2 1 0 0 2 1 0 1 0 2 0 1 1 1 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 17500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1 -1  1  0 -1  0  1  0  0 -1  1  0  0] (Indices: [0, 1, 2, 5, 6, 8, 10, 11, 14, 15, 16, 18, 19]), Candidate: [2 1 0 0 2 1 0 1 0 2 0 0 1 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 17550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1 -1  0  1  0 -1  1  0 -1  1  0  0  0] (Indices: [0, 1, 2, 5, 6, 8, 11, 12, 14, 15, 17, 18, 19]), Candidate: [2 1 0 0 2 1 0 1 0 1 1 1 0 2 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 17600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  1  0  0  0 -1  0  1  0 -1  1  0  0] (Indices: [0, 1, 2, 5, 6, 9, 10, 11, 12, 15, 16, 18, 19]), Candidate: [2 1 0 0 2 1 0 0 2 1 0 1 0 1 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 17650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  1  0 -1  0  1 -1  1  0  0  0  0  0] (Indices: [0, 1, 2, 5, 6, 9, 10, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  1  0  0  2  1  0  0  2  1 -1  1  2  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  0  1  0  0  0 -1  1  0 -1  1  0  0] (Indices: [0, 1, 2, 5, 6, 10, 11, 12, 13, 15, 16, 18, 19]), Candidate: [2 1 0 0 2 1 0 0 1 2 0 1 1 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 17750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0  0  0  0  0 -1  1  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 5, 7, 8, 9, 10, 11, 12, 14, 15, 18]), Candidate: [2 1 0 0 2 0 2 0 1 1 0 1 0 2 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 17800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0  0  0  0 -1  0  0  1  0 -1  1  0  0] (Indices: [0, 1, 2, 5, 7, 8, 9, 10, 11, 15, 16, 18, 19]), Candidate: [2 1 0 0 2 0 2 0 1 1 0 0 1 1 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 17850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0  0  0 -1  0  1 -1  1  0 -1  1  0  0] (Indices: [0, 1, 2, 5, 7, 8, 9, 10, 13, 15, 16, 18, 19]), Candidate: [ 2  1  0  0  2  0  2  0  1  1 -1  1  2  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0  0 -1  1 -1  1  0 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 5, 7, 8, 9, 11, 13, 14, 16, 17, 18]), Candidate: [ 2  1  0  0  2  0  2  0  1  0  1  0  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0 -1  1  0  0  0  0 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 5, 7, 8, 10, 11, 12, 13, 14, 17, 18]), Candidate: [ 2  1  0  0  2  0  2  0  0  2  0  1  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0 -1  1 -1  1  0  0  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 5, 7, 8, 10, 12, 13, 14, 15, 16, 18]), Candidate: [ 2  1  0  0  2  0  2  0  0  2 -1  2  1  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0 -1  0  1 -1  1  0  0  0 -1  1  0  0] (Indices: [0, 1, 2, 5, 7, 8, 11, 13, 14, 15, 16, 18, 19]), Candidate: [2 1 0 0 2 0 2 0 0 1 1 0 2 1 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 18100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  1  0  0 -1  1  0  0  0 -1  0  1  0] (Indices: [0, 1, 2, 5, 7, 9, 10, 11, 13, 14, 15, 16, 19]), Candidate: [ 2  1  0  0  2  0  2 -1  2  1  0  0  2  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  1 -1  1  0  0  0  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 5, 7, 9, 11, 12, 13, 14, 15, 17, 18]), Candidate: [ 2  1  0  0  2  0  2 -1  2  0  1  1  1  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  0  1  0  0 -1  1  0  0 -1  1  0  0] (Indices: [0, 1, 2, 5, 7, 10, 11, 12, 14, 15, 16, 18, 19]), Candidate: [ 2  1  0  0  2  0  2 -1  1  2  0  1  0  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1  0  0  0  0 -1  1  0  0 -1  0  1  0] (Indices: [0, 1, 2, 5, 8, 9, 10, 11, 12, 14, 15, 16, 19]), Candidate: [2 1 0 0 2 0 1 1 1 1 0 1 0 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 18300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1  0  0 -1  1 -1  1  0  0  0 -1  1  0] (Indices: [0, 1, 2, 5, 8, 9, 10, 12, 14, 15, 16, 17, 19]), Candidate: [ 2  1  0  0  2  0  1  1  1  1 -1  2  0  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1 -1  1  0  0  0  0  0  0 -1  0  1  0] (Indices: [0, 1, 2, 5, 8, 10, 11, 12, 13, 14, 15, 16, 19]), Candidate: [2 1 0 0 2 0 1 1 0 2 0 1 1 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 18400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  0  1  0  0  0  0  0 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 5, 9, 10, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  1  0  0  2  0  1  0  2  1  0  1  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0  0  0  0  0  0  0 -1  0  1 -1  0  1] (Indices: [0, 1, 2, 6, 7, 8, 9, 10, 11, 12, 13, 14, 17]), Candidate: [ 2  1  0  0  1  2  1  0  1  1  0  1  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0  0  0  0 -1  1 -1  0  1  0 -1  1  0] (Indices: [0, 1, 2, 6, 7, 8, 9, 10, 11, 13, 16, 17, 19]), Candidate: [2 1 0 0 1 2 1 0 1 1 0 0 2 0 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 18550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0  0  0 -1  1 -1  0  1  0 -1  1  0  0] (Indices: [0, 1, 2, 6, 7, 8, 9, 10, 12, 15, 16, 18, 19]), Candidate: [ 2  1  0  0  1  2  1  0  1  1 -1  2  0  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0  0 -1  1  0 -1  1 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 6, 7, 8, 9, 11, 12, 14, 16, 17, 18]), Candidate: [ 2  1  0  0  1  2  1  0  1  0  1  1  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0  0 -1  0  1 -1  0  1  0  0  0  0  0] (Indices: [0, 1, 2, 6, 7, 8, 9, 12, 15, 16, 17, 18, 19]), Candidate: [2 1 0 0 1 2 1 0 1 0 0 2 0 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 18700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0 -1  1  0 -1  1  0 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 6, 7, 8, 10, 11, 13, 14, 16, 17, 19]), Candidate: [ 2  1  0  0  1  2  1  0  0  2  0  0  2  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0 -1  0  1  0  0  0 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 6, 7, 8, 11, 12, 13, 14, 16, 18, 19]), Candidate: [ 2  1  0  0  1  2  1  0  0  1  1  1  1  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  1  0  0  0 -1  1  0  0 -1  0  1  0] (Indices: [0, 1, 2, 6, 7, 9, 10, 11, 12, 14, 15, 16, 19]), Candidate: [ 2  1  0  0  1  2  1 -1  2  1  0  1  0  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  1  0 -1  1 -1  1  0  0  0 -1  1  0] (Indices: [0, 1, 2, 6, 7, 9, 10, 12, 14, 15, 16, 17, 19]), Candidate: [ 2  1  0  0  1  2  1 -1  2  1 -1  2  0  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  0  1  0  0  0  0  0  0 -1  0  1  0] (Indices: [0, 1, 2, 6, 7, 10, 11, 12, 13, 14, 15, 16, 19]), Candidate: [ 2  1  0  0  1  2  1 -1  1  2  0  1  1  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1  0  0  0  0  0  0 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 6, 8, 9, 10, 11, 12, 13, 14, 17, 18]), Candidate: [ 2  1  0  0  1  2  0  1  1  1  0  1  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1  0  0 -1  1  0  0  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 6, 8, 9, 10, 12, 13, 14, 15, 16, 18]), Candidate: [ 2  1  0  0  1  2  0  1  1  1 -1  2  1  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1  0 -1  1 -1  1  0  0  0 -1  1  0  0] (Indices: [0, 1, 2, 6, 8, 9, 11, 13, 14, 15, 16, 18, 19]), Candidate: [2 1 0 0 1 2 0 1 1 0 1 0 2 1 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 19100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1 -1  0  1  0  0  0  0  0  0 -1  1  0] (Indices: [0, 1, 2, 6, 8, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [2 1 0 0 1 2 0 1 0 1 1 1 1 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 19150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  0  1 -1  1  0 -1  1  0  0  0  0  0  0] (Indices: [0, 1, 2, 6, 9, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [2 1 0 0 1 2 0 0 2 0 1 1 0 2 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 19200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0  0  0  0 -1  1  0  0  0 -1  0  1  0] (Indices: [0, 1, 2, 7, 8, 9, 10, 11, 13, 14, 15, 16, 19]), Candidate: [2 1 0 0 1 1 2 0 1 1 0 0 2 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 19250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0  0 -1  1  0  0  0  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 7, 8, 9, 11, 12, 13, 14, 15, 17, 18]), Candidate: [2 1 0 0 1 1 2 0 1 0 1 1 1 1 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 19300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0 -1  1  0  0 -1  1  0  0 -1  1  0  0] (Indices: [0, 1, 2, 7, 8, 10, 11, 12, 14, 15, 16, 18, 19]), Candidate: [2 1 0 0 1 1 2 0 0 2 0 1 0 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 19350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1 -1  1  0  0 -1  1  0  0  0  0 -1  1  0] (Indices: [0, 1, 2, 7, 9, 10, 11, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  1  0  0  1  1  2 -1  2  1  0  0  2  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  0  1  0  0  0  0 -1  1  0  0 -1  1  0  0] (Indices: [0, 1, 2, 8, 9, 10, 11, 12, 14, 15, 16, 18, 19]), Candidate: [2 1 0 0 1 1 1 1 1 1 0 1 0 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 19450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0  0  0  0  0 -1  1 -1  0  0  0  0  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14]), Candidate: [ 2  0  2  0  1  1  1  0  1  1  0  1  0  2 -1  1  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0  0  0 -1  0  1  0 -1  0  1 -1  0  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 9, 10, 13, 14, 17]), Candidate: [ 2  0  2  0  1  1  1  0  1  1 -1  1  2  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 19550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0  0 -1  1  0 -1  0  0  1 -1  0  1  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 9, 11, 12, 16, 19]), Candidate: [2 0 2 0 1 1 1 0 1 0 1 1 0 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 19600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0  0 -1  0  1  0 -1  0  1 -1  0  1  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 9, 12, 13, 16, 19]), Candidate: [2 0 2 0 1 1 1 0 1 0 0 2 1 0 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 19650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0  0 -1  0  0  0  1 -1  1  0  0 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 9, 14, 16, 17, 18]), Candidate: [ 2  0  2  0  1  1  1  0  1  0  0  1  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0 -1  1  0 -1  0  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 10, 11, 14, 16, 18]), Candidate: [ 2  0  2  0  1  1  1  0  0  2  0  0  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0 -1  1 -1  0  1  0  0  0 -1  0  0  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 10, 13, 14, 15, 16]), Candidate: [ 2  0  2  0  1  1  1  0  0  2 -1  1  2  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0 -1  0  1  0 -1  1  0  0 -1  0  0  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 11, 12, 14, 15, 16]), Candidate: [2 0 2 0 1 1 1 0 0 1 1 1 0 2 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 19850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0 -1  0  1 -1  0  0  1  0  0  0 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 11, 15, 16, 17, 18]), Candidate: [2 0 2 0 1 1 1 0 0 1 1 0 1 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 19900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0 -1  0  0  0  1 -1  1  0  0  0 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 13, 15, 16, 17, 18]), Candidate: [2 0 2 0 1 1 1 0 0 1 0 1 2 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 19950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  1  0  0 -1  0  1  0 -1  0  0  1  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 9, 10, 11, 14, 15, 19]), Candidate: [ 2  0  2  0  1  1  1 -1  2  1  0  0  1  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  1  0 -1  1 -1  0  0  1 -1  1  0  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 9, 10, 12, 16, 18, 19]), Candidate: [ 2  0  2  0  1  1  1 -1  2  1 -1  2  0  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  1 -1  1  0  0 -1  0  0  1 -1  1  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 9, 11, 12, 13, 17, 19]), Candidate: [ 2  0  2  0  1  1  1 -1  2  0  1  1  1  0  0  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  1 -1  1 -1  0  1 -1  1 -1  1  0  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 9, 11, 14, 16, 18, 19]), Candidate: [ 2  0  2  0  1  1  1 -1  2  0  1  0  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  1 -1  0  0  1  0 -1  1 -1  1  0  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 9, 13, 14, 16, 18, 19]), Candidate: [ 2  0  2  0  1  1  1 -1  2  0  0  1  2  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  0  1  0 -1  1  0  0 -1  0  1 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 10, 11, 13, 14, 15, 18]), Candidate: [ 2  0  2  0  1  1  1 -1  1  2  0  0  2  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  0  1 -1  1  0 -1  0  1  0 -1  1  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 10, 12, 13, 16, 17, 19]), Candidate: [ 2  0  2  0  1  1  1 -1  1  2 -1  2  1  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  0  0  1  0  0 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 11, 12, 13, 15, 16, 18]), Candidate: [ 2  0  2  0  1  1  1 -1  1  1  1  1  1  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  0  0  0  1  0  0  0 -1  0  1  0  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 12, 13, 14, 15, 18, 19]), Candidate: [ 2  0  2  0  1  1  1 -1  1  1  0  2  1  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1  0  0  0 -1  1 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 3, 4, 5, 6, 8, 9, 10, 11, 13, 15, 17]), Candidate: [2 0 2 0 1 1 0 1 1 1 0 0 2 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 20450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1  0  0 -1  1 -1  1 -1  1 -1  0  1  0] (Indices: [0, 1, 3, 4, 5, 6, 8, 9, 10, 12, 14, 16, 19]), Candidate: [ 2  0  2  0  1  1  0  1  1  1 -1  2  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1  0 -1  1  0  0  0 -1  1 -1  0  0  1] (Indices: [0, 1, 3, 4, 5, 6, 8, 9, 11, 12, 13, 14, 16]), Candidate: [ 2  0  2  0  1  1  0  1  1  0  1  1  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1  0 -1  1 -1  1 -1  0  1  0  0 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 8, 9, 11, 13, 16, 17, 18]), Candidate: [2 0 2 0 1 1 0 1 1 0 1 0 2 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 20600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1  0 -1  0  1 -1  0  1  0  0 -1  1  0] (Indices: [0, 1, 3, 4, 5, 6, 8, 9, 12, 15, 16, 17, 19]), Candidate: [2 0 2 0 1 1 0 1 1 0 0 2 0 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 20650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1 -1  1  0  0 -1  0  1  0  0 -1  0  1] (Indices: [0, 1, 3, 4, 5, 6, 8, 10, 11, 12, 15, 16, 17]), Candidate: [2 0 2 0 1 1 0 1 0 2 0 1 0 1 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 20700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1 -1  1 -1  1  0  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 8, 10, 12, 13, 14, 16, 18]), Candidate: [ 2  0  2  0  1  1  0  1  0  2 -1  2  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1 -1  1 -1  0  0  0  1  0  0  0  0  0] (Indices: [0, 1, 3, 4, 5, 6, 8, 10, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2  0  1  1  0  1  0  2 -1  1  1  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1 -1  0  1 -1  1 -1  0  1  0  0  0  0] (Indices: [0, 1, 3, 4, 5, 6, 8, 11, 13, 16, 17, 18, 19]), Candidate: [2 0 2 0 1 1 0 1 0 1 1 0 2 0 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 20850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  1  0  0  0 -1  1  0  0 -1  0  0  1] (Indices: [0, 1, 3, 4, 5, 6, 9, 10, 11, 12, 14, 15, 16]), Candidate: [2 0 2 0 1 1 0 0 2 1 0 1 0 2 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 20900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  1  0  0 -1  0  0  1  0  0  0 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 9, 10, 11, 15, 16, 17, 18]), Candidate: [2 0 2 0 1 1 0 0 2 1 0 0 1 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 20950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  1  0 -1  0  1 -1  1  0  0  0 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 9, 10, 13, 15, 16, 17, 18]), Candidate: [ 2  0  2  0  1  1  0  0  2  1 -1  1  2  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  1 -1  1 -1  1  0  0 -1  1 -1  1  0] (Indices: [0, 1, 3, 4, 5, 6, 9, 11, 13, 14, 15, 17, 19]), Candidate: [2 0 2 0 1 1 0 0 2 0 1 0 2 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 21050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  0  1  0  0  0  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 10, 11, 12, 13, 14, 16, 18]), Candidate: [ 2  0  2  0  1  1  0  0  1  2  0  1  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  0  1  0 -1  0  0  1  0  0  0  0  0] (Indices: [0, 1, 3, 4, 5, 6, 10, 11, 15, 16, 17, 18, 19]), Candidate: [2 0 2 0 1 1 0 0 1 2 0 0 1 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 21150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  0  0  1 -1  1  0  0  0  0  0 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 11, 13, 14, 15, 16, 17, 18]), Candidate: [2 0 2 0 1 1 0 0 1 1 1 0 2 1 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 21200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0  0  0  0 -1  1 -1  0  0  0  1  0  0] (Indices: [0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 13, 18, 19]), Candidate: [2 0 2 0 1 0 2 0 1 1 0 0 2 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 21250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0  0  0 -1  1 -1  0  1 -1  1 -1  1  0] (Indices: [0, 1, 3, 4, 5, 7, 8, 9, 10, 12, 15, 17, 19]), Candidate: [ 2  0  2  0  1  0  2  0  1  1 -1  2  0  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0  0 -1  1  0  0 -1  0  1  0 -1  0  1] (Indices: [0, 1, 3, 4, 5, 7, 8, 9, 11, 12, 13, 16, 17]), Candidate: [2 0 2 0 1 0 2 0 1 0 1 1 1 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 21350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0  0 -1  1 -1  0  1  0 -1  1 -1  1  0] (Indices: [0, 1, 3, 4, 5, 7, 8, 9, 11, 14, 15, 17, 19]), Candidate: [2 0 2 0 1 0 2 0 1 0 1 0 1 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 21400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0  0 -1  0  0  1  0  0 -1  1 -1  1  0] (Indices: [0, 1, 3, 4, 5, 7, 8, 9, 13, 14, 15, 17, 19]), Candidate: [2 0 2 0 1 0 2 0 1 0 0 1 2 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 21450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0 -1  1  0  0 -1  0  0  1 -1  1  0  0] (Indices: [0, 1, 3, 4, 5, 7, 8, 10, 11, 12, 16, 18, 19]), Candidate: [2 0 2 0 1 0 2 0 0 2 0 1 0 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 21500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0 -1  1 -1  1  0 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 3, 4, 5, 7, 8, 10, 12, 13, 15, 17, 18]), Candidate: [ 2  0  2  0  1  0  2  0  0  2 -1  2  1  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0 -1  0  1  0  0  0 -1  0  1  0 -1  1] (Indices: [0, 1, 3, 4, 5, 7, 8, 11, 12, 13, 14, 17, 18]), Candidate: [ 2  0  2  0  1  0  2  0  0  1  1  1  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0 -1  0  0  1  0  0  0  0 -1  1 -1  1] (Indices: [0, 1, 3, 4, 5, 7, 8, 12, 13, 14, 15, 16, 18]), Candidate: [2 0 2 0 1 0 2 0 0 1 0 2 1 1 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 21650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  1  0  0  0 -1  1 -1  0  1 -1  1  0] (Indices: [0, 1, 3, 4, 5, 7, 9, 10, 11, 12, 14, 17, 19]), Candidate: [ 2  0  2  0  1  0  2 -1  2  1  0  1  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  1  0 -1  1  0  0  0 -1  0  0  1  0] (Indices: [0, 1, 3, 4, 5, 7, 9, 10, 12, 13, 14, 15, 19]), Candidate: [ 2  0  2  0  1  0  2 -1  2  1 -1  2  1  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  1  0 -1  0  0  1  0 -1  1  0  0  0] (Indices: [0, 1, 3, 4, 5, 7, 9, 10, 14, 15, 17, 18, 19]), Candidate: [ 2  0  2  0  1  0  2 -1  2  1 -1  1  1  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  1 -1  1 -1  1 -1  1  0 -1  1  0  0] (Indices: [0, 1, 3, 4, 5, 7, 9, 11, 13, 15, 16, 18, 19]), Candidate: [ 2  0  2  0  1  0  2 -1  2  0  1  0  2  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  0  1  0  0  0 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 3, 4, 5, 7, 10, 11, 12, 13, 15, 17, 18]), Candidate: [ 2  0  2  0  1  0  2 -1  1  2  0  1  1  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  0  1 -1  1  0  0 -1  1  0 -1  1  0] (Indices: [0, 1, 3, 4, 5, 7, 10, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  0  2  0  1  0  2 -1  1  2 -1  2  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 21950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  0  0  0  1  0  0  0  0  0 -1  1  0] (Indices: [0, 1, 3, 4, 5, 7, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  0  2  0  1  0  2 -1  1  1  0  2  1  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1  0  0  0 -1  1  0 -1  0  1 -1  1  0] (Indices: [0, 1, 3, 4, 5, 8, 9, 10, 11, 13, 14, 17, 19]), Candidate: [ 2  0  2  0  1  0  1  1  1  1  0  0  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1  0  0 -1  1 -1  1  0 -1  1  0 -1  1] (Indices: [0, 1, 3, 4, 5, 8, 9, 10, 12, 14, 15, 17, 18]), Candidate: [ 2  0  2  0  1  0  1  1  1  1 -1  2  0  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1  0 -1  1  0  0 -1  0  1  0 -1  1  0] (Indices: [0, 1, 3, 4, 5, 8, 9, 11, 12, 13, 16, 17, 19]), Candidate: [2 0 2 0 1 0 1 1 1 0 1 1 1 0 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 22150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1  0 -1  0  1  0 -1  1  0  0 -1  1  0] (Indices: [0, 1, 3, 4, 5, 8, 9, 12, 13, 15, 16, 17, 19]), Candidate: [2 0 2 0 1 0 1 1 1 0 0 2 1 0 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 22200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1 -1  1  0  0 -1  0  1 -1  1  0  0  0] (Indices: [0, 1, 3, 4, 5, 8, 10, 11, 12, 15, 17, 18, 19]), Candidate: [2 0 2 0 1 0 1 1 0 2 0 1 0 1 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 22250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1 -1  1 -1  0  0  1  0  0  0  0  0  0] (Indices: [0, 1, 3, 4, 5, 8, 10, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2  0  1  0  1  1  0  2 -1  1  1  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  1  0  0  0  0 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 3, 4, 5, 9, 10, 11, 12, 13, 15, 17, 18]), Candidate: [2 0 2 0 1 0 1 0 2 1 0 1 1 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 22350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  1  0 -1  1  0  0 -1  1  0 -1  1  0] (Indices: [0, 1, 3, 4, 5, 9, 10, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  0  2  0  1  0  1  0  2  1 -1  2  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 22400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  1 -1  0  1  0  0  0  0  0 -1  1  0] (Indices: [0, 1, 3, 4, 5, 9, 12, 13, 14, 15, 16, 17, 19]), Candidate: [2 0 2 0 1 0 1 0 2 0 0 2 1 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 22450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  0  0  1 -1  1  0  0  0  0  0  0  0] (Indices: [0, 1, 3, 4, 5, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 0 2 0 1 0 1 0 1 1 1 0 2 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 22500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0  0  0  0 -1  0  0  1  0 -1  0  1  0] (Indices: [0, 1, 3, 4, 6, 7, 8, 9, 10, 11, 15, 16, 19]), Candidate: [2 0 2 0 0 2 1 0 1 1 0 0 1 1 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 22550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0  0  0 -1  0  1  0 -1  0  1  0 -1  1] (Indices: [0, 1, 3, 4, 6, 7, 8, 9, 10, 13, 14, 17, 18]), Candidate: [ 2  0  2  0  0  2  1  0  1  1 -1  1  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 22600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0  0 -1  1  0 -1  1 -1  0  1  0 -1  1] (Indices: [0, 1, 3, 4, 6, 7, 8, 9, 11, 12, 14, 17, 18]), Candidate: [ 2  0  2  0  0  2  1  0  1  0  1  1  0  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0  0 -1  0  1  0  0  0 -1  0  1 -1  1] (Indices: [0, 1, 3, 4, 6, 7, 8, 9, 12, 13, 14, 15, 18]), Candidate: [2 0 2 0 0 2 1 0 1 0 0 2 1 1 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 22700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0  0 -1  0  0  0  1  0  0 -1  1  0  0] (Indices: [0, 1, 3, 4, 6, 7, 8, 9, 14, 15, 16, 18, 19]), Candidate: [2 0 2 0 0 2 1 0 1 0 0 1 1 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 22750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0 -1  1  0 -1  1 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 3, 4, 6, 7, 8, 10, 11, 13, 15, 16, 18]), Candidate: [2 0 2 0 0 2 1 0 0 2 0 0 2 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 22800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0 -1  1 -1  1 -1  1 -1  1  0  0 -1  1] (Indices: [0, 1, 3, 4, 6, 7, 8, 10, 12, 14, 16, 17, 18]), Candidate: [ 2  0  2  0  0  2  1  0  0  2 -1  2  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 22850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0 -1  0  1  0 -1  1  0  0  0 -1  0  1] (Indices: [0, 1, 3, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17]), Candidate: [2 0 2 0 0 2 1 0 0 1 1 1 0 2 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 22900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0 -1  0  0  1  0 -1  0  1  0  0  0  0] (Indices: [0, 1, 3, 4, 6, 7, 8, 12, 13, 16, 17, 18, 19]), Candidate: [2 0 2 0 0 2 1 0 0 1 0 2 1 0 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 22950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  1  0  0 -1  1  0  0 -1  1 -1  0  1] (Indices: [0, 1, 3, 4, 6, 7, 9, 10, 11, 13, 14, 15, 17]), Candidate: [ 2  0  2  0  0  2  1 -1  2  1  0  0  2  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  1  0 -1  1  0 -1  0  1  0  0 -1  1] (Indices: [0, 1, 3, 4, 6, 7, 9, 10, 12, 13, 16, 17, 18]), Candidate: [ 2  0  2  0  0  2  1 -1  2  1 -1  2  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 23050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  1 -1  1  0  0 -1  1  0  0 -1  0  1] (Indices: [0, 1, 3, 4, 6, 7, 9, 11, 12, 13, 15, 16, 17]), Candidate: [ 2  0  2  0  0  2  1 -1  2  0  1  1  1  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  1 -1  0  1  0  0  0 -1  1 -1  1  0] (Indices: [0, 1, 3, 4, 6, 7, 9, 12, 13, 14, 15, 17, 19]), Candidate: [ 2  0  2  0  0  2  1 -1  2  0  0  2  1  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  0  1  0  0 -1  1 -1  1  0  0 -1  1] (Indices: [0, 1, 3, 4, 6, 7, 10, 11, 12, 14, 16, 17, 18]), Candidate: [ 2  0  2  0  0  2  1 -1  1  2  0  1  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 23200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  0  1 -1  1 -1  0  1  0  0  0  0  0] (Indices: [0, 1, 3, 4, 6, 7, 10, 12, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2  0  0  2  1 -1  1  2 -1  2  0  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 23250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1  0  0  0  0  0 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 3, 4, 6, 8, 9, 10, 11, 12, 13, 15, 17]), Candidate: [2 0 2 0 0 2 0 1 1 1 0 1 1 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 23300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1  0  0  0 -1  0  1  0  0 -1  1 -1  1] (Indices: [0, 1, 3, 4, 6, 8, 9, 10, 11, 14, 15, 16, 18]), Candidate: [2 0 2 0 0 2 0 1 1 1 0 0 1 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 23350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1  0  0 -1  0  1  0  0  0 -1  1 -1  1] (Indices: [0, 1, 3, 4, 6, 8, 9, 10, 13, 14, 15, 16, 18]), Candidate: [ 2  0  2  0  0  2  0  1  1  1 -1  1  2  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1  0 -1  1  0 -1  0  1  0  0  0 -1  1] (Indices: [0, 1, 3, 4, 6, 8, 9, 11, 12, 15, 16, 17, 18]), Candidate: [2 0 2 0 0 2 0 1 1 0 1 1 0 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 23450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1  0 -1  0  0  1  0  0 -1  1  0  0  0] (Indices: [0, 1, 3, 4, 6, 8, 9, 13, 14, 15, 17, 18, 19]), Candidate: [2 0 2 0 0 2 0 1 1 0 0 1 2 1 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 23500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1 -1  1  0 -1  1 -1  1  0  0 -1  1  0] (Indices: [0, 1, 3, 4, 6, 8, 10, 11, 13, 15, 16, 17, 19]), Candidate: [2 0 2 0 0 2 0 1 0 2 0 0 2 0 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 23550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1 -1  0  1  0  0 -1  1  0 -1  1  0  0] (Indices: [0, 1, 3, 4, 6, 8, 11, 12, 13, 15, 16, 18, 19]), Candidate: [2 0 2 0 0 2 0 1 0 1 1 1 1 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 23600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  1  0  0  0 -1  1 -1  1  0  0 -1  1] (Indices: [0, 1, 3, 4, 6, 9, 10, 11, 12, 14, 16, 17, 18]), Candidate: [ 2  0  2  0  0  2  0  0  2  1  0  1  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  1  0 -1  1 -1  0  1  0  0  0  0  0] (Indices: [0, 1, 3, 4, 6, 9, 10, 12, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2  0  0  2  0  0  2  1 -1  2  0  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  0  1  0  0  0  0 -1  1  0  0 -1  1] (Indices: [0, 1, 3, 4, 6, 10, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 2  0  2  0  0  2  0  0  1  2  0  1  1  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0  0  0  0  0  0 -1  0  1 -1  0  1  0] (Indices: [0, 1, 3, 4, 7, 8, 9, 10, 11, 12, 13, 16, 19]), Candidate: [2 0 2 0 0 1 2 0 1 1 0 1 1 0 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 23800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0  0  0  0 -1  0  1 -1  1  0  0 -1  1] (Indices: [0, 1, 3, 4, 7, 8, 9, 10, 11, 14, 16, 17, 18]), Candidate: [ 2  0  2  0  0  1  2  0  1  1  0  0  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0  0  0 -1  0  1  0 -1  1  0  0 -1  1] (Indices: [0, 1, 3, 4, 7, 8, 9, 10, 13, 14, 16, 17, 18]), Candidate: [ 2  0  2  0  0  1  2  0  1  1 -1  1  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 23900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0  0 -1  1 -1  1  0  0  0  0 -1  0  1] (Indices: [0, 1, 3, 4, 7, 8, 9, 11, 13, 14, 15, 16, 17]), Candidate: [2 0 2 0 0 1 2 0 1 0 1 0 2 1 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 23950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0 -1  1  0  0  0  0  0 -1  1 -1  0  1] (Indices: [0, 1, 3, 4, 7, 8, 10, 11, 12, 13, 14, 15, 17]), Candidate: [2 0 2 0 0 1 2 0 0 2 0 1 1 1 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 24000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0 -1  1  0 -1  0  1  0  0  0 -1  1  0] (Indices: [0, 1, 3, 4, 7, 8, 10, 11, 14, 15, 16, 17, 19]), Candidate: [2 0 2 0 0 1 2 0 0 2 0 0 1 2 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 24050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0 -1  0  1  0 -1  1  0  0 -1  1  0  0] (Indices: [0, 1, 3, 4, 7, 8, 11, 12, 14, 15, 16, 18, 19]), Candidate: [2 0 2 0 0 1 2 0 0 1 1 1 0 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 24100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  1  0  0  0 -1  0  1  0  0 -1  1  0] (Indices: [0, 1, 3, 4, 7, 9, 10, 11, 12, 15, 16, 17, 19]), Candidate: [ 2  0  2  0  0  1  2 -1  2  1  0  1  0  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  1  0 -1  0  1  0 -1  1  0  0  0  0] (Indices: [0, 1, 3, 4, 7, 9, 10, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  0  2  0  0  1  2 -1  2  1 -1  1  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 24200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  0  1  0  0  0 -1  1  0  0 -1  1  0] (Indices: [0, 1, 3, 4, 7, 10, 11, 12, 13, 15, 16, 17, 19]), Candidate: [ 2  0  2  0  0  1  2 -1  1  2  0  1  1  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1  0  0  0  0  0 -1  0  1  0  0 -1  1] (Indices: [0, 1, 3, 4, 8, 9, 10, 11, 12, 13, 16, 17, 18]), Candidate: [2 0 2 0 0 1 1 1 1 1 0 1 1 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 24300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1  0  0 -1  1  0 -1  1  0  0  0 -1  1] (Indices: [0, 1, 3, 4, 8, 9, 10, 12, 13, 15, 16, 17, 18]), Candidate: [ 2  0  2  0  0  1  1  1  1  1 -1  2  1  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1  0 -1  0  1  0  0 -1  1  0  0  0  0] (Indices: [0, 1, 3, 4, 8, 9, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  0  2  0  0  1  1  1  1  0  0  2  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  1  0  0  0  0  0  0  0 -1  1 -1  1] (Indices: [0, 1, 3, 4, 9, 10, 11, 12, 13, 14, 15, 16, 18]), Candidate: [2 0 2 0 0 1 1 0 2 1 0 1 1 1 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 24450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  0  0  1  0  0 -1  1  0  0  0  0  0  0] (Indices: [0, 1, 3, 4, 10, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [2 0 2 0 0 1 1 0 1 2 0 1 0 2 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 24500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0  0  0  0 -1  0  0  1  0  0 -1  0  1] (Indices: [0, 1, 3, 5, 6, 7, 8, 9, 10, 11, 15, 16, 17]), Candidate: [ 2  0  2 -1  2  1  1  0  1  1  0  0  1  1  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0  0  0 -1  0  1  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 3, 5, 6, 7, 8, 9, 10, 13, 14, 16, 18]), Candidate: [ 2  0  2 -1  2  1  1  0  1  1 -1  1  2  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 24600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0  0 -1  1  0 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 3, 5, 6, 7, 8, 9, 11, 12, 14, 16, 18]), Candidate: [ 2  0  2 -1  2  1  1  0  1  0  1  1  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 24650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0  0 -1  0  1  0  0  0  0 -1  0  0  1] (Indices: [0, 1, 3, 5, 6, 7, 8, 9, 12, 13, 14, 15, 16]), Candidate: [ 2  0  2 -1  2  1  1  0  1  0  0  2  1  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0  0 -1  0  0  0  1  0  0  0  0 -1  1] (Indices: [0, 1, 3, 5, 6, 7, 8, 9, 14, 15, 16, 17, 18]), Candidate: [ 2  0  2 -1  2  1  1  0  1  0  0  1  1  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0 -1  1  0 -1  1  0 -1  0  0  1  0  0] (Indices: [0, 1, 3, 5, 6, 7, 8, 10, 11, 13, 14, 18, 19]), Candidate: [ 2  0  2 -1  2  1  1  0  0  2  0  0  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 24800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0 -1  1 -1  1 -1  1  0 -1  1 -1  1  0] (Indices: [0, 1, 3, 5, 6, 7, 8, 10, 12, 14, 15, 17, 19]), Candidate: [ 2  0  2 -1  2  1  1  0  0  2 -1  2  0  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 24850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0 -1  0  1  0  0 -1  0  1 -1  1  0  0] (Indices: [0, 1, 3, 5, 6, 7, 8, 11, 12, 13, 16, 18, 19]), Candidate: [ 2  0  2 -1  2  1  1  0  0  1  1  1  1  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0 -1  0  0  1  0 -1  1  0 -1  1  0  0] (Indices: [0, 1, 3, 5, 6, 7, 8, 12, 13, 15, 16, 18, 19]), Candidate: [ 2  0  2 -1  2  1  1  0  0  1  0  2  1  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  1  0  0  0 -1  0  0  0  1  0  0  0] (Indices: [0, 1, 3, 5, 6, 7, 9, 10, 11, 12, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  1  1 -1  2  1  0  1  0  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 25000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  1  0 -1  1  0 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 3, 5, 6, 7, 9, 10, 12, 13, 15, 17, 19]), Candidate: [ 2  0  2 -1  2  1  1 -1  2  1 -1  2  1  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 25050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  1 -1  1  0  0  0 -1  0  1 -1  1  0] (Indices: [0, 1, 3, 5, 6, 7, 9, 11, 12, 13, 14, 17, 19]), Candidate: [ 2  0  2 -1  2  1  1 -1  2  0  1  1  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 25100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  1 -1  0  1  0  0  0  0 -1  0  1  0] (Indices: [0, 1, 3, 5, 6, 7, 9, 12, 13, 14, 15, 16, 19]), Candidate: [ 2  0  2 -1  2  1  1 -1  2  0  0  2  1  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 25150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  0  1  0  0 -1  1  0 -1  1 -1  1  0] (Indices: [0, 1, 3, 5, 6, 7, 10, 11, 12, 14, 15, 17, 19]), Candidate: [ 2  0  2 -1  2  1  1 -1  1  2  0  1  0  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 25200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  0  1 -1  1 -1  1  0 -1  1  0  0  0] (Indices: [0, 1, 3, 5, 6, 7, 10, 12, 14, 15, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  1  1 -1  1  2 -1  2  0  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 25250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1  0  0  0  0  0  0 -1  0  0  0  1  0] (Indices: [0, 1, 3, 5, 6, 8, 9, 10, 11, 12, 13, 14, 19]), Candidate: [ 2  0  2 -1  2  1  0  1  1  1  0  1  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 25300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1  0  0  0 -1  1 -1  0  0  1  0  0  0] (Indices: [0, 1, 3, 5, 6, 8, 9, 10, 11, 13, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  1  0  1  1  1  0  0  2  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1  0  0 -1  1 -1  0  0  1  0  0  0  0] (Indices: [0, 1, 3, 5, 6, 8, 9, 10, 12, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  1  0  1  1  1 -1  2  0  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 25400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1  0 -1  1  0 -1  1 -1  1 -1  1  0  0] (Indices: [0, 1, 3, 5, 6, 8, 9, 11, 12, 14, 16, 18, 19]), Candidate: [ 2  0  2 -1  2  1  0  1  1  0  1  1  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 25450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1  0 -1  0  0  1  0  0  0  0 -1  1  0] (Indices: [0, 1, 3, 5, 6, 8, 9, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  0  2 -1  2  1  0  1  1  0  0  1  2  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1 -1  1  0 -1  1  0 -1  0  1  0  0  0] (Indices: [0, 1, 3, 5, 6, 8, 10, 11, 13, 14, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  1  0  1  0  2  0  0  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 25550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1 -1  0  1  0  0 -1  1  0  0  0 -1  1] (Indices: [0, 1, 3, 5, 6, 8, 11, 12, 13, 15, 16, 17, 18]), Candidate: [ 2  0  2 -1  2  1  0  1  0  1  1  1  1  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  1  0  0  0 -1  1  0 -1  1 -1  1  0] (Indices: [0, 1, 3, 5, 6, 9, 10, 11, 12, 14, 15, 17, 19]), Candidate: [ 2  0  2 -1  2  1  0  0  2  1  0  1  0  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  1  0 -1  1 -1  1  0 -1  1  0  0  0] (Indices: [0, 1, 3, 5, 6, 9, 10, 12, 14, 15, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  1  0  0  2  1 -1  2  0  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 25700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  0  1  0  0  0  0  0 -1  1 -1  1  0] (Indices: [0, 1, 3, 5, 6, 10, 11, 12, 13, 14, 15, 17, 19]), Candidate: [ 2  0  2 -1  2  1  0  0  1  2  0  1  1  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0  0  0  0  0  0 -1  0  1  0 -1  0  1] (Indices: [0, 1, 3, 5, 7, 8, 9, 10, 11, 12, 13, 16, 17]), Candidate: [ 2  0  2 -1  2  0  2  0  1  1  0  1  1  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0  0  0  0 -1  0  1  0 -1  1 -1  1  0] (Indices: [0, 1, 3, 5, 7, 8, 9, 10, 11, 14, 15, 17, 19]), Candidate: [ 2  0  2 -1  2  0  2  0  1  1  0  0  1  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0  0  0 -1  0  1  0  0 -1  1 -1  1  0] (Indices: [0, 1, 3, 5, 7, 8, 9, 10, 13, 14, 15, 17, 19]), Candidate: [ 2  0  2 -1  2  0  2  0  1  1 -1  1  2  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 25900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0  0 -1  1  0 -1  0  1 -1  1  0  0  0] (Indices: [0, 1, 3, 5, 7, 8, 9, 11, 12, 15, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  0  2  0  1  0  1  1  0  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0  0 -1  0  0  0  1  0  0  0  0  0  0] (Indices: [0, 1, 3, 5, 7, 8, 9, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  0  2  0  1  0  0  1  1  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0 -1  1  0 -1  1 -1  0  1  0  0  0  0] (Indices: [0, 1, 3, 5, 7, 8, 10, 11, 13, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  0  2  0  0  2  0  0  2  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0 -1  0  1  0 -1  1  0  0  0  0 -1  1] (Indices: [0, 1, 3, 5, 7, 8, 11, 12, 14, 15, 16, 17, 18]), Candidate: [ 2  0  2 -1  2  0  2  0  0  1  1  1  0  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  1  0  0  0 -1  1 -1  0  1  0  0  0] (Indices: [0, 1, 3, 5, 7, 9, 10, 11, 12, 14, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  0  2 -1  2  1  0  1  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 26150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  1  0 -1  0  1  0  0  0 -1  1  0  0] (Indices: [0, 1, 3, 5, 7, 9, 10, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  0  2 -1  2  0  2 -1  2  1 -1  1  2  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 26200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  0  1  0  0  0  0 -1  0  1  0  0  0] (Indices: [0, 1, 3, 5, 7, 10, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  0  2 -1  1  2  0  1  1  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 26250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1  0  0  0  0  0 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 3, 5, 8, 9, 10, 11, 12, 13, 15, 17, 19]), Candidate: [ 2  0  2 -1  2  0  1  1  1  1  0  1  1  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1  0  0 -1  1  0  0 -1  1 -1  1  0  0] (Indices: [0, 1, 3, 5, 8, 9, 10, 12, 13, 14, 16, 18, 19]), Candidate: [ 2  0  2 -1  2  0  1  1  1  1 -1  2  1  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 26350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1  0 -1  0  1  0  0  0  0 -1  1  0  0] (Indices: [0, 1, 3, 5, 8, 9, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  0  2 -1  2  0  1  1  1  0  0  2  1  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1 -1  0  0  1  0  0  0  0  0  0  0  0] (Indices: [0, 1, 3, 5, 8, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  0  1  1  0  1  0  2  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  0  0  1  0  0  0  0 -1  1  0  0  0  0] (Indices: [0, 1, 3, 5, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  0  1  0  1  2  0  1  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 26500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0  0  0  0 -1  1  0 -1  0  0  1  0  0] (Indices: [0, 1, 3, 6, 7, 8, 9, 10, 11, 13, 14, 18, 19]), Candidate: [ 2  0  2 -1  1  2  1  0  1  1  0  0  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 26550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0  0  0 -1  1 -1  1  0 -1  1 -1  1  0] (Indices: [0, 1, 3, 6, 7, 8, 9, 10, 12, 14, 15, 17, 19]), Candidate: [ 2  0  2 -1  1  2  1  0  1  1 -1  2  0  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 26600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0  0 -1  1  0  0 -1  0  1 -1  1  0  0] (Indices: [0, 1, 3, 6, 7, 8, 9, 11, 12, 13, 16, 18, 19]), Candidate: [ 2  0  2 -1  1  2  1  0  1  0  1  1  1  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0  0 -1  0  1  0 -1  1  0 -1  1  0  0] (Indices: [0, 1, 3, 6, 7, 8, 9, 12, 13, 15, 16, 18, 19]), Candidate: [ 2  0  2 -1  1  2  1  0  1  0  0  2  1  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0 -1  1  0  0 -1  0  0  1  0  0  0  0] (Indices: [0, 1, 3, 6, 7, 8, 10, 11, 12, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  2  1  0  0  2  0  1  0  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0 -1  0  1  0  0  0  0  0  0 -1  0  1] (Indices: [0, 1, 3, 6, 7, 8, 11, 12, 13, 14, 15, 16, 17]), Candidate: [ 2  0  2 -1  1  2  1  0  0  1  1  1  1  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  1  0  0  0  0 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 3, 6, 7, 9, 10, 11, 12, 13, 15, 17, 19]), Candidate: [ 2  0  2 -1  1  2  1 -1  2  1  0  1  1  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 26850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  1  0 -1  1  0  0 -1  1 -1  1  0  0] (Indices: [0, 1, 3, 6, 7, 9, 10, 12, 13, 14, 16, 18, 19]), Candidate: [ 2  0  2 -1  1  2  1 -1  2  1 -1  2  1  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 26900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  1 -1  0  1  0  0  0  0 -1  1  0  0] (Indices: [0, 1, 3, 6, 7, 9, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  0  2 -1  1  2  1 -1  2  0  0  2  1  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 26950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  0  0  0  1  0  0  0  0  0  0  0  0] (Indices: [0, 1, 3, 6, 7, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  2  1 -1  1  1  0  2  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1  0  0  0 -1  1 -1  0  1  0  0  0  0] (Indices: [0, 1, 3, 6, 8, 9, 10, 11, 13, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  2  0  1  1  1  0  0  2  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1  0 -1  1  0 -1  1  0  0  0  0 -1  1] (Indices: [0, 1, 3, 6, 8, 9, 11, 12, 14, 15, 16, 17, 18]), Candidate: [ 2  0  2 -1  1  2  0  1  1  0  1  1  0  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1 -1  1 -1  1  0  0  0  0  0 -1  1  0] (Indices: [0, 1, 3, 6, 8, 10, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  0  2 -1  1  2  0  1  0  2 -1  2  1  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  0  1  0 -1  1 -1  1  0  0  0  0  0  0] (Indices: [0, 1, 3, 6, 9, 10, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  2  0  0  2  1 -1  2  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0  0  0  0  0 -1  1 -1  0  1  0  0  0] (Indices: [0, 1, 3, 7, 8, 9, 10, 11, 12, 14, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  2  0  1  1  0  1  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0  0  0 -1  0  1  0  0  0 -1  1  0  0] (Indices: [0, 1, 3, 7, 8, 9, 10, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  0  2 -1  1  1  2  0  1  1 -1  1  2  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0 -1  1  0  0  0  0 -1  0  1  0  0  0] (Indices: [0, 1, 3, 7, 8, 10, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  2  0  0  2  0  1  1  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1 -1  1  0  0  0  0 -1  0  1  0  0  0  0] (Indices: [0, 1, 3, 7, 9, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  2 -1  2  1  0  1  1  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  1  0  0  0  0  0  0 -1  0  1  0  0  0] (Indices: [0, 1, 3, 8, 9, 10, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  1  1  1  1  0  1  1  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  0  0  1  0  0  0  0  0 -1  1  0  0  0  0] (Indices: [0, 1, 3, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  1  0  2  1  0  1  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0  0  0  0 -1  0  1 -1  0  1  0 -1  1] (Indices: [0, 1, 4, 5, 6, 7, 8, 9, 10, 11, 14, 17, 18]), Candidate: [ 2  0  1  1  1  1  1  0  1  1  0  0  1  2 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0  0  0 -1  0  1  0  0 -1  0  1 -1  1] (Indices: [0, 1, 4, 5, 6, 7, 8, 9, 10, 13, 14, 15, 18]), Candidate: [ 2  0  1  1  1  1  1  0  1  1 -1  1  2  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0  0 -1  1  0 -1  1  0 -1  0  1 -1  1] (Indices: [0, 1, 4, 5, 6, 7, 8, 9, 11, 12, 14, 15, 18]), Candidate: [2 0 1 1 1 1 1 0 1 0 1 1 0 2 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 27650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0  0 -1  1 -1  0  0  1  0 -1  1  0  0] (Indices: [0, 1, 4, 5, 6, 7, 8, 9, 11, 15, 16, 18, 19]), Candidate: [2 0 1 1 1 1 1 0 1 0 1 0 1 1 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 27700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0  0 -1  0  0  1 -1  1  0 -1  1  0  0] (Indices: [0, 1, 4, 5, 6, 7, 8, 9, 13, 15, 16, 18, 19]), Candidate: [2 0 1 1 1 1 1 0 1 0 0 1 2 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 27750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0 -1  1  0 -1  1  0 -1  1 -1  0  1  0] (Indices: [0, 1, 4, 5, 6, 7, 8, 10, 11, 13, 14, 16, 19]), Candidate: [ 2  0  1  1  1  1  1  0  0  2  0  0  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0 -1  1 -1  1 -1  1  0  0 -1  1 -1  1] (Indices: [0, 1, 4, 5, 6, 7, 8, 10, 12, 14, 15, 16, 18]), Candidate: [ 2  0  1  1  1  1  1  0  0  2 -1  2  0  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0 -1  0  1  0  0 -1  1 -1  0  1  0  0] (Indices: [0, 1, 4, 5, 6, 7, 8, 11, 12, 13, 15, 18, 19]), Candidate: [2 0 1 1 1 1 1 0 0 1 1 1 1 0 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 27900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0 -1  0  0  1  0  0 -1  0  1  0  0  0] (Indices: [0, 1, 4, 5, 6, 7, 8, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  0  1  1  1  1  1  0  0  1  0  2  1  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  1  0  0  0 -1  0  0  1  0  0 -1  1] (Indices: [0, 1, 4, 5, 6, 7, 9, 10, 11, 12, 16, 17, 18]), Candidate: [ 2  0  1  1  1  1  1 -1  2  1  0  1  0  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  1  0 -1  1  0 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 4, 5, 6, 7, 9, 10, 12, 13, 15, 16, 18]), Candidate: [ 2  0  1  1  1  1  1 -1  2  1 -1  2  1  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  1 -1  1  0  0  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 4, 5, 6, 7, 9, 11, 12, 13, 14, 16, 18]), Candidate: [ 2  0  1  1  1  1  1 -1  2  0  1  1  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  1 -1  1 -1  0  0  1  0  0  0  0  0] (Indices: [0, 1, 4, 5, 6, 7, 9, 11, 15, 16, 17, 18, 19]), Candidate: [ 2  0  1  1  1  1  1 -1  2  0  1  0  1  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  0  1  0  0 -1  1  0  0 -1  1 -1  1] (Indices: [0, 1, 4, 5, 6, 7, 10, 11, 12, 14, 15, 16, 18]), Candidate: [ 2  0  1  1  1  1  1 -1  1  2  0  1  0  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  0  1 -1  1 -1  1  0  0  0  0 -1  1] (Indices: [0, 1, 4, 5, 6, 7, 10, 12, 14, 15, 16, 17, 18]), Candidate: [ 2  0  1  1  1  1  1 -1  1  2 -1  2  0  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1  0  0  0  0  0  0 -1  1 -1  0  0  1] (Indices: [0, 1, 4, 5, 6, 8, 9, 10, 11, 12, 13, 14, 16]), Candidate: [ 2  0  1  1  1  1  0  1  1  1  0  1  1  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1  0  0  0 -1  1 -1  0  1  0  0 -1  1] (Indices: [0, 1, 4, 5, 6, 8, 9, 10, 11, 13, 16, 17, 18]), Candidate: [2 0 1 1 1 1 0 1 1 1 0 0 2 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 28350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1  0  0 -1  1 -1  0  1  0  0 -1  1  0] (Indices: [0, 1, 4, 5, 6, 8, 9, 10, 12, 15, 16, 17, 19]), Candidate: [ 2  0  1  1  1  1  0  1  1  1 -1  2  0  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1  0 -1  1  0 -1  1  0 -1  0  1  0  0] (Indices: [0, 1, 4, 5, 6, 8, 9, 11, 12, 14, 15, 18, 19]), Candidate: [2 0 1 1 1 1 0 1 1 0 1 1 0 2 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 28450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1  0 -1  0  1 -1  1 -1  1  0  0  0  0] (Indices: [0, 1, 4, 5, 6, 8, 9, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  0  1  1  1  1  0  1  1  0  0  2  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1 -1  1  0 -1  1  0 -1  1  0  0 -1  1] (Indices: [0, 1, 4, 5, 6, 8, 10, 11, 13, 14, 16, 17, 18]), Candidate: [ 2  0  1  1  1  1  0  1  0  2  0  0  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1 -1  0  1  0  0  0 -1  1  0 -1  1  0] (Indices: [0, 1, 4, 5, 6, 8, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  0  1  1  1  1  0  1  0  1  1  1  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  1  0  0  0 -1  1  0  0 -1  1 -1  1] (Indices: [0, 1, 4, 5, 6, 9, 10, 11, 12, 14, 15, 16, 18]), Candidate: [2 0 1 1 1 1 0 0 2 1 0 1 0 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 28650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  1  0 -1  1 -1  1  0  0  0  0 -1  1] (Indices: [0, 1, 4, 5, 6, 9, 10, 12, 14, 15, 16, 17, 18]), Candidate: [ 2  0  1  1  1  1  0  0  2  1 -1  2  0  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  0  1  0  0  0  0  0  0 -1  1 -1  1] (Indices: [0, 1, 4, 5, 6, 10, 11, 12, 13, 14, 15, 16, 18]), Candidate: [2 0 1 1 1 1 0 0 1 2 0 1 1 1 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 28750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0  0  0  0  0  0 -1  1 -1  1 -1  0  1] (Indices: [0, 1, 4, 5, 7, 8, 9, 10, 11, 12, 13, 15, 17]), Candidate: [2 0 1 1 1 0 2 0 1 1 0 1 1 0 1 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 28800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0  0  0  0 -1  0  1  0  0 -1  1 -1  1] (Indices: [0, 1, 4, 5, 7, 8, 9, 10, 11, 14, 15, 16, 18]), Candidate: [2 0 1 1 1 0 2 0 1 1 0 0 1 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 28850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0  0  0 -1  0  1  0  0  0 -1  1 -1  1] (Indices: [0, 1, 4, 5, 7, 8, 9, 10, 13, 14, 15, 16, 18]), Candidate: [ 2  0  1  1  1  0  2  0  1  1 -1  1  2  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0  0 -1  1  0 -1  0  1  0  0  0 -1  1] (Indices: [0, 1, 4, 5, 7, 8, 9, 11, 12, 15, 16, 17, 18]), Candidate: [2 0 1 1 1 0 2 0 1 0 1 1 0 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 28950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0  0 -1  0  0  1  0  0 -1  1  0  0  0] (Indices: [0, 1, 4, 5, 7, 8, 9, 13, 14, 15, 17, 18, 19]), Candidate: [2 0 1 1 1 0 2 0 1 0 0 1 2 1 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 29000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0 -1  1  0 -1  1 -1  1  0  0 -1  1  0] (Indices: [0, 1, 4, 5, 7, 8, 10, 11, 13, 15, 16, 17, 19]), Candidate: [2 0 1 1 1 0 2 0 0 2 0 0 2 0 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 29050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0 -1  0  1  0  0 -1  1  0 -1  1  0  0] (Indices: [0, 1, 4, 5, 7, 8, 11, 12, 13, 15, 16, 18, 19]), Candidate: [2 0 1 1 1 0 2 0 0 1 1 1 1 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 29100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  1  0  0  0 -1  1 -1  1  0  0 -1  1] (Indices: [0, 1, 4, 5, 7, 9, 10, 11, 12, 14, 16, 17, 18]), Candidate: [ 2  0  1  1  1  0  2 -1  2  1  0  1  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  1  0 -1  1 -1  0  1  0  0  0  0  0] (Indices: [0, 1, 4, 5, 7, 9, 10, 12, 15, 16, 17, 18, 19]), Candidate: [ 2  0  1  1  1  0  2 -1  2  1 -1  2  0  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  0  1  0  0  0  0 -1  1  0  0 -1  1] (Indices: [0, 1, 4, 5, 7, 10, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 2  0  1  1  1  0  2 -1  1  2  0  1  1  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1  0  0  0  0  0 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 4, 5, 8, 9, 10, 11, 12, 13, 15, 16, 18]), Candidate: [2 0 1 1 1 0 1 1 1 1 0 1 1 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 29300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1  0  0 -1  1  0  0  0 -1  0  1  0  0] (Indices: [0, 1, 4, 5, 8, 9, 10, 12, 13, 14, 15, 18, 19]), Candidate: [ 2  0  1  1  1  0  1  1  1  1 -1  2  1  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1  0 -1  1 -1  0  1  0  0  0  0  0  0] (Indices: [0, 1, 4, 5, 8, 9, 11, 14, 15, 16, 17, 18, 19]), Candidate: [2 0 1 1 1 0 1 1 1 0 1 0 1 2 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 29400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1 -1  0  1  0  0 -1  1  0  0  0  0  0] (Indices: [0, 1, 4, 5, 8, 11, 12, 13, 15, 16, 17, 18, 19]), Candidate: [2 0 1 1 1 0 1 1 0 1 1 1 1 0 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 29450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  0  0  1  0  0  0  0  0  0  0 -1  1  0] (Indices: [0, 1, 4, 5, 10, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [2 0 1 1 1 0 1 0 1 2 0 1 1 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 29500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0  0  0  0 -1  1  0 -1  1 -1  0  1  0] (Indices: [0, 1, 4, 6, 7, 8, 9, 10, 11, 13, 14, 16, 19]), Candidate: [ 2  0  1  1  0  2  1  0  1  1  0  0  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0  0  0 -1  1 -1  1  0  0 -1  1 -1  1] (Indices: [0, 1, 4, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18]), Candidate: [ 2  0  1  1  0  2  1  0  1  1 -1  2  0  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0  0 -1  1  0  0 -1  1 -1  0  1  0  0] (Indices: [0, 1, 4, 6, 7, 8, 9, 11, 12, 13, 15, 18, 19]), Candidate: [2 0 1 1 0 2 1 0 1 0 1 1 1 0 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 29650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0  0 -1  0  1  0  0 -1  0  1  0  0  0] (Indices: [0, 1, 4, 6, 7, 8, 9, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  0  1  1  0  2  1  0  1  0  0  2  1  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0 -1  1  0  0 -1  0  1  0  0 -1  1  0] (Indices: [0, 1, 4, 6, 7, 8, 10, 11, 12, 15, 16, 17, 19]), Candidate: [2 0 1 1 0 2 1 0 0 2 0 1 0 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 29750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0 -1  1 -1  0  1  0 -1  1  0  0  0  0] (Indices: [0, 1, 4, 6, 7, 8, 10, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  0  1  1  0  2  1  0  0  2 -1  1  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  1  0  0  0  0 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 4, 6, 7, 9, 10, 11, 12, 13, 15, 16, 18]), Candidate: [ 2  0  1  1  0  2  1 -1  2  1  0  1  1  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  1  0 -1  1  0  0  0 -1  0  1  0  0] (Indices: [0, 1, 4, 6, 7, 9, 10, 12, 13, 14, 15, 18, 19]), Candidate: [ 2  0  1  1  0  2  1 -1  2  1 -1  2  1  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 29900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  1 -1  1 -1  0  1  0  0  0  0  0  0] (Indices: [0, 1, 4, 6, 7, 9, 11, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  0  1  1  0  2  1 -1  2  0  1  0  1  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  0  0  1  0  0 -1  1  0  0  0  0  0] (Indices: [0, 1, 4, 6, 7, 11, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  0  1  1  0  2  1 -1  1  1  1  1  1  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1  0  0  0 -1  1 -1  1  0  0 -1  1  0] (Indices: [0, 1, 4, 6, 8, 9, 10, 11, 13, 15, 16, 17, 19]), Candidate: [2 0 1 1 0 2 0 1 1 1 0 0 2 0 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 30050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1  0 -1  1  0  0 -1  1  0 -1  1  0  0] (Indices: [0, 1, 4, 6, 8, 9, 11, 12, 13, 15, 16, 18, 19]), Candidate: [2 0 1 1 0 2 0 1 1 0 1 1 1 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 30100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1 -1  1  0 -1  1 -1  1  0  0  0  0  0] (Indices: [0, 1, 4, 6, 8, 10, 11, 13, 15, 16, 17, 18, 19]), Candidate: [2 0 1 1 0 2 0 1 0 2 0 0 2 0 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 30150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  1  0 -1  1  0  0  0 -1  1  0  0  0] (Indices: [0, 1, 4, 6, 9, 10, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  0  1  1  0  2  0  0  2  1 -1  2  1  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0  0  0  0  0 -1  1 -1  1  0  0 -1  1] (Indices: [0, 1, 4, 7, 8, 9, 10, 11, 12, 14, 16, 17, 18]), Candidate: [ 2  0  1  1  0  1  2  0  1  1  0  1  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0  0  0 -1  1 -1  0  1  0  0  0  0  0] (Indices: [0, 1, 4, 7, 8, 9, 10, 12, 15, 16, 17, 18, 19]), Candidate: [ 2  0  1  1  0  1  2  0  1  1 -1  2  0  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0 -1  1  0  0  0  0 -1  1  0  0 -1  1] (Indices: [0, 1, 4, 7, 8, 10, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 2  0  1  1  0  1  2  0  0  2  0  1  1  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1 -1  1  0  0  0  0 -1  1  0  0 -1  1  0] (Indices: [0, 1, 4, 7, 9, 10, 11, 12, 13, 15, 16, 17, 19]), Candidate: [ 2  0  1  1  0  1  2 -1  2  1  0  1  1  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1  0  0  0  0  0  0 -1  1  0  0 -1  1] (Indices: [0, 1, 4, 8, 9, 10, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 2  0  1  1  0  1  1  1  1  1  0  1  1  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  0  1  0  0  0  0  0  0  0  0 -1  1  0] (Indices: [0, 1, 4, 9, 10, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [2 0 1 1 0 1 1 0 2 1 0 1 1 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 30500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0  0  0  0 -1  1  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 5, 6, 7, 8, 9, 10, 11, 13, 14, 16, 18]), Candidate: [ 2  0  1  0  2  1  1  0  1  1  0  0  2  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0  0  0 -1  1 -1  1  0  0  0 -1  0  1] (Indices: [0, 1, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 17]), Candidate: [ 2  0  1  0  2  1  1  0  1  1 -1  2  0  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0  0 -1  1  0  0 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 5, 6, 7, 8, 9, 11, 12, 13, 15, 17, 19]), Candidate: [2 0 1 0 2 1 1 0 1 0 1 1 1 0 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 30650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0  0 -1  0  1  0  0 -1  1 -1  1  0  0] (Indices: [0, 1, 5, 6, 7, 8, 9, 12, 13, 14, 16, 18, 19]), Candidate: [ 2  0  1  0  2  1  1  0  1  0  0  2  1  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0 -1  1  0  0 -1  0  1  0  0  0 -1  1] (Indices: [0, 1, 5, 6, 7, 8, 10, 11, 12, 15, 16, 17, 18]), Candidate: [2 0 1 0 2 1 1 0 0 2 0 1 0 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 30750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0 -1  1 -1  0  1  0  0 -1  1  0  0  0] (Indices: [0, 1, 5, 6, 7, 8, 10, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  0  1  0  2  1  1  0  0  2 -1  1  2  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  1  0  0  0  0 -1  1  0  0 -1  0  1] (Indices: [0, 1, 5, 6, 7, 9, 10, 11, 12, 13, 15, 16, 17]), Candidate: [ 2  0  1  0  2  1  1 -1  2  1  0  1  1  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  1  0 -1  1  0  0  0 -1  1 -1  1  0] (Indices: [0, 1, 5, 6, 7, 9, 10, 12, 13, 14, 15, 17, 19]), Candidate: [ 2  0  1  0  2  1  1 -1  2  1 -1  2  1  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 30900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  1 -1  1 -1  1 -1  1  0  0  0  0  0] (Indices: [0, 1, 5, 6, 7, 9, 11, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  0  1  0  2  1  1 -1  2  0  1  0  2  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  0  0  1  0  0  0 -1  1  0  0  0  0] (Indices: [0, 1, 5, 6, 7, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  0  1  0  2  1  1 -1  1  1  1  1  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1  0  0  0 -1  1 -1  1  0  0  0 -1  1] (Indices: [0, 1, 5, 6, 8, 9, 10, 11, 13, 15, 16, 17, 18]), Candidate: [2 0 1 0 2 1 0 1 1 1 0 0 2 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 31050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1  0 -1  1  0  0 -1  1  0  0 -1  1  0] (Indices: [0, 1, 5, 6, 8, 9, 11, 12, 13, 15, 16, 17, 19]), Candidate: [2 0 1 0 2 1 0 1 1 0 1 1 1 0 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 31100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1 -1  1  0 -1  1  0 -1  1  0  0  0  0] (Indices: [0, 1, 5, 6, 8, 10, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  0  1  0  2  1  0  1  0  2  0  0  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  0  1  0 -1  1  0  0  0  0 -1  1  0  0] (Indices: [0, 1, 5, 6, 9, 10, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  0  1  0  2  1  0  0  2  1 -1  2  1  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0  0  0  0  0 -1  1  0 -1  0  1  0  0] (Indices: [0, 1, 5, 7, 8, 9, 10, 11, 12, 14, 15, 18, 19]), Candidate: [2 0 1 0 2 0 2 0 1 1 0 1 0 2 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 31250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0  0  0 -1  1 -1  1 -1  1  0  0  0  0] (Indices: [0, 1, 5, 7, 8, 9, 10, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  0  1  0  2  0  2  0  1  1 -1  2  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0 -1  1  0  0  0  0  0 -1  0  1  0  0] (Indices: [0, 1, 5, 7, 8, 10, 11, 12, 13, 14, 15, 18, 19]), Candidate: [2 0 1 0 2 0 2 0 0 2 0 1 1 1 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 31350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1 -1  1  0  0  0  0 -1  1  0  0  0 -1  1] (Indices: [0, 1, 5, 7, 9, 10, 11, 12, 13, 15, 16, 17, 18]), Candidate: [ 2  0  1  0  2  0  2 -1  2  1  0  1  1  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  1  0  0  0  0  0  0  0 -1  0  1  0  0] (Indices: [0, 1, 5, 8, 9, 10, 11, 12, 13, 14, 15, 18, 19]), Candidate: [2 0 1 0 2 0 1 1 1 1 0 1 1 1 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 31450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  0  0  1  0  0  0  0  0  0  0  0  0 -1  1] (Indices: [0, 1, 5, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [2 0 1 0 2 0 1 0 2 1 0 1 1 1 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 31500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0  0  0  0 -1  1  0  0 -1  1 -1  1  0] (Indices: [0, 1, 6, 7, 8, 9, 10, 11, 13, 14, 15, 17, 19]), Candidate: [2 0 1 0 1 2 1 0 1 1 0 0 2 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 31550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0  0 -1  1  0  0  0  0 -1  0  1  0  0] (Indices: [0, 1, 6, 7, 8, 9, 11, 12, 13, 14, 15, 18, 19]), Candidate: [2 0 1 0 1 2 1 0 1 0 1 1 1 1 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 31600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0 -1  1  0  0 -1  1 -1  1  0  0  0  0] (Indices: [0, 1, 6, 7, 8, 10, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  0  1  0  1  2  1  0  0  2  0  1  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0 -1  1  0  0 -1  1  0  0 -1  1  0  0  0] (Indices: [0, 1, 6, 7, 9, 10, 11, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  0  1  0  1  2  1 -1  2  1  0  0  2  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1  0  0  0  0 -1  1 -1  1  0  0  0  0] (Indices: [0, 1, 6, 8, 9, 10, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  0  1  0  1  2  0  1  1  1  0  1  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0  0  0  0  0  0  0  0 -1  1  0 -1  1] (Indices: [0, 1, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 18]), Candidate: [2 0 1 0 1 1 2 0 1 1 0 1 1 1 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 31800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  0  1  0 -1  1 -1  1  0  0  0  0  0  0  0  0] (Indices: [0, 1, 7, 8, 10, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  0  1  0  1  1  2  0  0  2 -1  2  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0  0  0  0 -1  0  0  0  0  1  0 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 17, 18]), Candidate: [1 2 1 0 1 1 1 0 1 1 0 0 1 1 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 31900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0  0  0 -1  0  0  0  1  0 -1  1 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 15, 16, 18]), Candidate: [ 1  2  1  0  1  1  1  0  1  1 -1  1  1  1  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0  0 -1  1 -1  0  1 -1  1 -1  1 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 9, 11, 14, 16, 18]), Candidate: [ 1  2  1  0  1  1  1  0  1  0  1  0  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0  0 -1  0  0  1  0  0  0 -1  0  0  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 9, 13, 14, 15, 16]), Candidate: [1 2 1 0 1 1 1 0 1 0 0 1 2 1 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 32050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0 -1  1  0  0 -1  0  0  1  0 -1  0  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 10, 11, 12, 16, 17]), Candidate: [1 2 1 0 1 1 1 0 0 2 0 1 0 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 32100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0 -1  1 -1  1  0 -1  0  1  0 -1  0  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 10, 12, 13, 16, 17]), Candidate: [ 1  2  1  0  1  1  1  0  0  2 -1  2  1  0  0  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0 -1  1 -1  0  0  1  0 -1  1 -1  1  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 10, 14, 15, 17, 19]), Candidate: [ 1  2  1  0  1  1  1  0  0  2 -1  1  1  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0 -1  0  1 -1  1  0 -1  1  0 -1  0  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 11, 13, 14, 16, 17]), Candidate: [ 1  2  1  0  1  1  1  0  0  1  1  0  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0 -1  0  0  1  0 -1  0  0  1  0  0  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 12, 13, 17, 18, 19]), Candidate: [1 2 1 0 1 1 1 0 0 1 0 2 1 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 32300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  1  0  0  0 -1  0  1 -1  0  1 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 15, 18]), Candidate: [ 1  2  1  0  1  1  1 -1  2  1  0  1  0  1  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  1  0 -1  1  0 -1  1 -1  0  1 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 9, 10, 12, 13, 15, 18]), Candidate: [ 1  2  1  0  1  1  1 -1  2  1 -1  2  1  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  1  0 -1  0  0  1  0  0 -1  0  1  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 9, 10, 14, 15, 16, 19]), Candidate: [ 1  2  1  0  1  1  1 -1  2  1 -1  1  1  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  1 -1  1 -1  1  0  0 -1  0  1 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 9, 11, 13, 14, 15, 18]), Candidate: [ 1  2  1  0  1  1  1 -1  2  0  1  0  2  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  1 -1  0  1  0 -1  0  1  0 -1  1  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 9, 12, 13, 16, 17, 19]), Candidate: [ 1  2  1  0  1  1  1 -1  2  0  0  2  1  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  0  1  0  0  0 -1  0  1 -1  0  1  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 10, 11, 12, 13, 16, 19]), Candidate: [ 1  2  1  0  1  1  1 -1  1  2  0  1  1  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  0  1  0 -1  0  1 -1  1  0  0 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 10, 11, 14, 16, 17, 18]), Candidate: [ 1  2  1  0  1  1  1 -1  1  2  0  0  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  0  1 -1  0  1  0 -1  1  0  0 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 10, 13, 14, 16, 17, 18]), Candidate: [ 1  2  1  0  1  1  1 -1  1  2 -1  1  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 32700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  0  0  1 -1  1  0  0  0  0 -1  0  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 11, 13, 14, 15, 16, 17]), Candidate: [ 1  2  1  0  1  1  1 -1  1  1  1  0  2  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1  0  0  0  0  0 -1  1 -1  0  0  0  1] (Indices: [0, 2, 3, 4, 5, 6, 8, 9, 10, 11, 12, 13, 15]), Candidate: [1 2 1 0 1 1 0 1 1 1 0 1 1 0 1 0 1 1 1 7]
 -> Valid neighbor added.
Attempt 32800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1  0  0  0 -1  0  0  1 -1  0  1  0  0] (Indices: [0, 2, 3, 4, 5, 6, 8, 9, 10, 11, 15, 18, 19]), Candidate: [1 2 1 0 1 1 0 1 1 1 0 0 1 1 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 32850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1  0  0 -1  0  1 -1  1  0  0 -1  0  1] (Indices: [0, 2, 3, 4, 5, 6, 8, 9, 10, 13, 15, 16, 17]), Candidate: [ 1  2  1  0  1  1  0  1  1  1 -1  1  2  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1  0 -1  1  0 -1  0  1  0  0 -1  0  1] (Indices: [0, 2, 3, 4, 5, 6, 8, 9, 11, 12, 15, 16, 17]), Candidate: [1 2 1 0 1 1 0 1 1 0 1 1 0 1 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 32950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1  0 -1  0  1  0  0 -1  1 -1  1 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 8, 9, 12, 13, 14, 16, 18]), Candidate: [ 1  2  1  0  1  1  0  1  1  0  0  2  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1  0 -1  0  0  0  0  1  0  0  0  0  0] (Indices: [0, 2, 3, 4, 5, 6, 8, 9, 15, 16, 17, 18, 19]), Candidate: [1 2 1 0 1 1 0 1 1 0 0 1 1 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 33050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1 -1  1  0 -1  1 -1  1 -1  1 -1  1  0] (Indices: [0, 2, 3, 4, 5, 6, 8, 10, 11, 13, 15, 17, 19]), Candidate: [1 2 1 0 1 1 0 1 0 2 0 0 2 0 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 33100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1 -1  1 -1  1 -1  1 -1  0  1  0  0  0] (Indices: [0, 2, 3, 4, 5, 6, 8, 10, 12, 14, 17, 18, 19]), Candidate: [ 1  2  1  0  1  1  0  1  0  2 -1  2  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 33150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1 -1  0  1  0 -1  1  0 -1  1  0 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 8, 11, 12, 14, 15, 17, 18]), Candidate: [1 2 1 0 1 1 0 1 0 1 1 1 0 2 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 33200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1 -1  0  0  1 -1  1  0  0 -1  1  0  0] (Indices: [0, 2, 3, 4, 5, 6, 8, 12, 14, 15, 16, 18, 19]), Candidate: [1 2 1 0 1 1 0 1 0 1 0 2 0 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 33250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  1  0  0 -1  1  0 -1  1  0 -1  0  1] (Indices: [0, 2, 3, 4, 5, 6, 9, 10, 11, 13, 14, 16, 17]), Candidate: [ 1  2  1  0  1  1  0  0  2  1  0  0  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  1  0 -1  1  0 -1  0  0  1  0  0  0] (Indices: [0, 2, 3, 4, 5, 6, 9, 10, 12, 13, 17, 18, 19]), Candidate: [ 1  2  1  0  1  1  0  0  2  1 -1  2  1  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  1 -1  1  0  0 -1  1 -1  1  0 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 9, 11, 12, 13, 15, 17, 18]), Candidate: [1 2 1 0 1 1 0 0 2 0 1 1 1 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 33400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  1 -1  0  1  0  0 -1  1  0 -1  1  0] (Indices: [0, 2, 3, 4, 5, 6, 9, 12, 13, 14, 16, 17, 19]), Candidate: [ 1  2  1  0  1  1  0  0  2  0  0  2  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  0  1  0  0 -1  1 -1  0  1  0  0  0] (Indices: [0, 2, 3, 4, 5, 6, 10, 11, 12, 14, 17, 18, 19]), Candidate: [ 1  2  1  0  1  1  0  0  1  2  0  1  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  0  1 -1  0  1  0  0  0 -1  1  0  0] (Indices: [0, 2, 3, 4, 5, 6, 10, 13, 14, 15, 16, 18, 19]), Candidate: [ 1  2  1  0  1  1  0  0  1  2 -1  1  2  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0  0  0  0  0 -1  1 -1  0  0  1 -1  1] (Indices: [0, 2, 3, 4, 5, 7, 8, 9, 10, 11, 12, 14, 18]), Candidate: [ 1  2  1  0  1  0  2  0  1  1  0  1  0  2 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0  0  0 -1  1  0  0 -1  0  0  1 -1  1] (Indices: [0, 2, 3, 4, 5, 7, 8, 9, 10, 12, 13, 14, 18]), Candidate: [ 1  2  1  0  1  0  2  0  1  1 -1  2  1  1 -1  1  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 33650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0  0  0 -1  0  1 -1  0  1 -1  1  0  0] (Indices: [0, 2, 3, 4, 5, 7, 8, 9, 10, 13, 16, 18, 19]), Candidate: [ 1  2  1  0  1  0  2  0  1  1 -1  1  2  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0  0 -1  1  0 -1  0  0  1 -1  1  0  0] (Indices: [0, 2, 3, 4, 5, 7, 8, 9, 11, 12, 16, 18, 19]), Candidate: [1 2 1 0 1 0 2 0 1 0 1 1 0 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 33750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0  0 -1  0  1  0 -1  1 -1  1  0 -1  1] (Indices: [0, 2, 3, 4, 5, 7, 8, 9, 12, 13, 15, 17, 18]), Candidate: [1 2 1 0 1 0 2 0 1 0 0 2 1 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 33800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0 -1  1  0  0  0 -1  1 -1  0  1 -1  1] (Indices: [0, 2, 3, 4, 5, 7, 8, 10, 11, 12, 13, 15, 18]), Candidate: [1 2 1 0 1 0 2 0 0 2 0 1 1 0 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 33850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0 -1  1  0 -1  0  1  0  0 -1  0  1  0] (Indices: [0, 2, 3, 4, 5, 7, 8, 10, 11, 14, 15, 16, 19]), Candidate: [1 2 1 0 1 0 2 0 0 2 0 0 1 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 33900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0 -1  1 -1  0  1  0  0  0 -1  0  1  0] (Indices: [0, 2, 3, 4, 5, 7, 8, 10, 13, 14, 15, 16, 19]), Candidate: [ 1  2  1  0  1  0  2  0  0  2 -1  1  2  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0 -1  0  1  0 -1  0  1  0  0 -1  1  0] (Indices: [0, 2, 3, 4, 5, 7, 8, 11, 12, 15, 16, 17, 19]), Candidate: [1 2 1 0 1 0 2 0 0 1 1 1 0 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 34000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0 -1  0  0  0  1  0 -1  1  0  0  0  0] (Indices: [0, 2, 3, 4, 5, 7, 8, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  2  1  0  1  0  2  0  0  1  0  1  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  1  0  0 -1  1 -1  1  0 -1  0  1  0] (Indices: [0, 2, 3, 4, 5, 7, 9, 10, 11, 13, 15, 16, 19]), Candidate: [ 1  2  1  0  1  0  2 -1  2  1  0  0  2  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  1  0 -1  1 -1  1 -1  1  0 -1  1  0] (Indices: [0, 2, 3, 4, 5, 7, 9, 10, 12, 14, 16, 17, 19]), Candidate: [ 1  2  1  0  1  0  2 -1  2  1 -1  2  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 34150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  1 -1  1  0 -1  1  0  0 -1  1 -1  1] (Indices: [0, 2, 3, 4, 5, 7, 9, 11, 12, 14, 15, 16, 18]), Candidate: [ 1  2  1  0  1  0  2 -1  2  0  1  1  0  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  1 -1  0  1 -1  1  0  0  0  0 -1  1] (Indices: [0, 2, 3, 4, 5, 7, 9, 12, 14, 15, 16, 17, 18]), Candidate: [ 1  2  1  0  1  0  2 -1  2  0  0  2  0  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  0  1  0 -1  1  0  0  0 -1  0  1  0] (Indices: [0, 2, 3, 4, 5, 7, 10, 11, 13, 14, 15, 16, 19]), Candidate: [ 1  2  1  0  1  0  2 -1  1  2  0  0  2  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  0  0  1  0  0  0  0 -1  1  0 -1  1] (Indices: [0, 2, 3, 4, 5, 7, 11, 12, 13, 14, 15, 17, 18]), Candidate: [ 1  2  1  0  1  0  2 -1  1  1  1  1  1  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1  0  0  0  0 -1  1  0 -1  0  1 -1  1] (Indices: [0, 2, 3, 4, 5, 8, 9, 10, 11, 12, 14, 15, 18]), Candidate: [1 2 1 0 1 0 1 1 1 1 0 1 0 2 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 34400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1  0  0  0 -1  0  0  1  0 -1  1  0  0] (Indices: [0, 2, 3, 4, 5, 8, 9, 10, 11, 15, 16, 18, 19]), Candidate: [1 2 1 0 1 0 1 1 1 1 0 0 1 1 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 34450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1  0  0 -1  0  1 -1  1  0 -1  1  0  0] (Indices: [0, 2, 3, 4, 5, 8, 9, 10, 13, 15, 16, 18, 19]), Candidate: [ 1  2  1  0  1  0  1  1  1  1 -1  1  2  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1  0 -1  1 -1  1  0 -1  1  0  0 -1  1] (Indices: [0, 2, 3, 4, 5, 8, 9, 11, 13, 14, 16, 17, 18]), Candidate: [ 1  2  1  0  1  0  1  1  1  0  1  0  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1 -1  1  0  0  0  0 -1  0  1  0 -1  1] (Indices: [0, 2, 3, 4, 5, 8, 10, 11, 12, 13, 14, 17, 18]), Candidate: [ 1  2  1  0  1  0  1  1  0  2  0  1  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1 -1  1 -1  1  0  0  0  0 -1  1 -1  1] (Indices: [0, 2, 3, 4, 5, 8, 10, 12, 13, 14, 15, 16, 18]), Candidate: [ 1  2  1  0  1  0  1  1  0  2 -1  2  1  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1 -1  0  1 -1  1  0  0  0 -1  1  0  0] (Indices: [0, 2, 3, 4, 5, 8, 11, 13, 14, 15, 16, 18, 19]), Candidate: [1 2 1 0 1 0 1 1 0 1 1 0 2 1 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 34700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  1  0  0 -1  1  0  0  0 -1  0  1  0] (Indices: [0, 2, 3, 4, 5, 9, 10, 11, 13, 14, 15, 16, 19]), Candidate: [1 2 1 0 1 0 1 0 2 1 0 0 2 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 34750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  1 -1  1  0  0  0  0 -1  1  0 -1  1] (Indices: [0, 2, 3, 4, 5, 9, 11, 12, 13, 14, 15, 17, 18]), Candidate: [1 2 1 0 1 0 1 0 2 0 1 1 1 1 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 34800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  0  1  0  0 -1  1  0  0 -1  1  0  0] (Indices: [0, 2, 3, 4, 5, 10, 11, 12, 14, 15, 16, 18, 19]), Candidate: [1 2 1 0 1 0 1 0 1 2 0 1 0 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 34850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0  0  0  0 -1  1  0 -1  1 -1  0  0  1] (Indices: [0, 2, 3, 4, 6, 7, 8, 9, 10, 11, 13, 14, 16]), Candidate: [ 1  2  1  0  0  2  1  0  1  1  0  0  2  1 -1  2  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0  0  0 -1  1 -1  1  0 -1  1 -1  0  1] (Indices: [0, 2, 3, 4, 6, 7, 8, 9, 10, 12, 14, 15, 17]), Candidate: [ 1  2  1  0  0  2  1  0  1  1 -1  2  0  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0  0  0 -1  0  0  0  1  0  0 -1  1  0] (Indices: [0, 2, 3, 4, 6, 7, 8, 9, 10, 15, 16, 17, 19]), Candidate: [ 1  2  1  0  0  2  1  0  1  1 -1  1  1  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0  0 -1  1 -1  1 -1  1  0 -1  1 -1  1] (Indices: [0, 2, 3, 4, 6, 7, 8, 9, 11, 13, 15, 16, 18]), Candidate: [1 2 1 0 0 2 1 0 1 0 1 0 2 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 35050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0  0 -1  0  1 -1  1 -1  1  0  0 -1  1] (Indices: [0, 2, 3, 4, 6, 7, 8, 9, 12, 14, 16, 17, 18]), Candidate: [ 1  2  1  0  0  2  1  0  1  0  0  2  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0 -1  1  0  0 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 2, 3, 4, 6, 7, 8, 10, 11, 12, 14, 16, 18]), Candidate: [ 1  2  1  0  0  2  1  0  0  2  0  1  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0 -1  1 -1  1  0  0  0  0 -1  0  0  1] (Indices: [0, 2, 3, 4, 6, 7, 8, 10, 12, 13, 14, 15, 16]), Candidate: [ 1  2  1  0  0  2  1  0  0  2 -1  2  1  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0 -1  1 -1  0  0  1  0  0  0  0 -1  1] (Indices: [0, 2, 3, 4, 6, 7, 8, 10, 14, 15, 16, 17, 18]), Candidate: [ 1  2  1  0  0  2  1  0  0  2 -1  1  1  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0 -1  0  1 -1  1  0 -1  0  1  0  0  0] (Indices: [0, 2, 3, 4, 6, 7, 8, 11, 13, 14, 17, 18, 19]), Candidate: [ 1  2  1  0  0  2  1  0  0  1  1  0  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  1  0  0  0  0 -1  0  1 -1  1 -1  1] (Indices: [0, 2, 3, 4, 6, 7, 9, 10, 11, 12, 13, 16, 18]), Candidate: [ 1  2  1  0  0  2  1 -1  2  1  0  1  1  0  0  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  1  0  0 -1  0  1  0 -1  0  1  0  0] (Indices: [0, 2, 3, 4, 6, 7, 9, 10, 11, 14, 15, 18, 19]), Candidate: [ 1  2  1  0  0  2  1 -1  2  1  0  0  1  2  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  1  0 -1  0  1  0  0 -1  0  1  0  0] (Indices: [0, 2, 3, 4, 6, 7, 9, 10, 13, 14, 15, 18, 19]), Candidate: [ 1  2  1  0  0  2  1 -1  2  1 -1  1  2  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  1 -1  1  0 -1  0  0  1  0  0  0  0] (Indices: [0, 2, 3, 4, 6, 7, 9, 11, 12, 16, 17, 18, 19]), Candidate: [ 1  2  1  0  0  2  1 -1  2  0  1  1  0  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  0  1  0  0  0  0  0  0 -1  0  0  1] (Indices: [0, 2, 3, 4, 6, 7, 10, 11, 12, 13, 14, 15, 16]), Candidate: [ 1  2  1  0  0  2  1 -1  1  2  0  1  1  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  0  1  0 -1  0  1  0  0  0  0 -1  1] (Indices: [0, 2, 3, 4, 6, 7, 10, 11, 14, 15, 16, 17, 18]), Candidate: [ 1  2  1  0  0  2  1 -1  1  2  0  0  1  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  0  0  1  0 -1  1  0  0  0 -1  1  0] (Indices: [0, 2, 3, 4, 6, 7, 11, 12, 14, 15, 16, 17, 19]), Candidate: [ 1  2  1  0  0  2  1 -1  1  1  1  1  0  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1  0  0  0  0 -1  0  1 -1  0  1  0  0] (Indices: [0, 2, 3, 4, 6, 8, 9, 10, 11, 12, 15, 18, 19]), Candidate: [1 2 1 0 0 2 0 1 1 1 0 1 0 1 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 35700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1  0  0 -1  1  0 -1  1  0  0 -1  0  1] (Indices: [0, 2, 3, 4, 6, 8, 9, 10, 12, 13, 15, 16, 17]), Candidate: [ 1  2  1  0  0  2  0  1  1  1 -1  2  1  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1  0 -1  1  0  0  0 -1  1  0 -1  0  1] (Indices: [0, 2, 3, 4, 6, 8, 9, 11, 12, 13, 14, 16, 17]), Candidate: [ 1  2  1  0  0  2  0  1  1  0  1  1  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1  0 -1  1 -1  0  1 -1  1  0  0  0  0] (Indices: [0, 2, 3, 4, 6, 8, 9, 11, 14, 16, 17, 18, 19]), Candidate: [ 1  2  1  0  0  2  0  1  1  0  1  0  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1 -1  1  0  0 -1  1  0  0  0 -1  0  1] (Indices: [0, 2, 3, 4, 6, 8, 10, 11, 12, 14, 15, 16, 17]), Candidate: [1 2 1 0 0 2 0 1 0 2 0 1 0 2 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 35900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1 -1  1 -1  1  0 -1  0  1  0  0  0  0] (Indices: [0, 2, 3, 4, 6, 8, 10, 12, 13, 16, 17, 18, 19]), Candidate: [ 1  2  1  0  0  2  0  1  0  2 -1  2  1  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  1  0  0  0  0  0  0  0 -1  0  0  1] (Indices: [0, 2, 3, 4, 6, 9, 10, 11, 12, 13, 14, 15, 16]), Candidate: [1 2 1 0 0 2 0 0 2 1 0 1 1 1 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 36000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  1  0  0 -1  0  1  0  0  0  0 -1  1] (Indices: [0, 2, 3, 4, 6, 9, 10, 11, 14, 15, 16, 17, 18]), Candidate: [1 2 1 0 0 2 0 0 2 1 0 0 1 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 36050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  1 -1  1  0 -1  1  0  0  0 -1  1  0] (Indices: [0, 2, 3, 4, 6, 9, 11, 12, 14, 15, 16, 17, 19]), Candidate: [1 2 1 0 0 2 0 0 2 0 1 1 0 2 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 36100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  0  1 -1  1  0  0  0  0 -1  1  0  0] (Indices: [0, 2, 3, 4, 6, 10, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 1  2  1  0  0  2  0  0  1  2 -1  2  1  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0  0  0  0 -1  1  0  0  0 -1  0  0  1] (Indices: [0, 2, 3, 4, 7, 8, 9, 10, 11, 13, 14, 15, 16]), Candidate: [1 2 1 0 0 1 2 0 1 1 0 0 2 1 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 36200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0  0  0 -1  1  0 -1  1 -1  0  1  0  0] (Indices: [0, 2, 3, 4, 7, 8, 9, 10, 12, 13, 15, 18, 19]), Candidate: [ 1  2  1  0  0  1  2  0  1  1 -1  2  1  0  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0  0 -1  1  0  0  0 -1  0  0  1  0  0] (Indices: [0, 2, 3, 4, 7, 8, 9, 11, 12, 13, 14, 18, 19]), Candidate: [ 1  2  1  0  0  1  2  0  1  0  1  1  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0  0 -1  0  1  0  0  0 -1  1  0 -1  1] (Indices: [0, 2, 3, 4, 7, 8, 9, 12, 13, 14, 15, 17, 18]), Candidate: [1 2 1 0 0 1 2 0 1 0 0 2 1 1 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 36350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0 -1  1  0  0 -1  1  0 -1  0  1  0  0] (Indices: [0, 2, 3, 4, 7, 8, 10, 11, 12, 14, 15, 18, 19]), Candidate: [1 2 1 0 0 1 2 0 0 2 0 1 0 2 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 36400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0 -1  1 -1  1 -1  1 -1  1  0  0  0  0] (Indices: [0, 2, 3, 4, 7, 8, 10, 12, 14, 16, 17, 18, 19]), Candidate: [ 1  2  1  0  0  1  2  0  0  2 -1  2  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  1  0  0  0  0  0 -1  1 -1  1 -1  1] (Indices: [0, 2, 3, 4, 7, 9, 10, 11, 12, 13, 14, 16, 18]), Candidate: [ 1  2  1  0  0  1  2 -1  2  1  0  1  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  1  0  0 -1  0  0  1  0  0  0  0  0] (Indices: [0, 2, 3, 4, 7, 9, 10, 11, 15, 16, 17, 18, 19]), Candidate: [ 1  2  1  0  0  1  2 -1  2  1  0  0  1  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  1 -1  1 -1  1  0  0  0  0  0 -1  1] (Indices: [0, 2, 3, 4, 7, 9, 11, 13, 14, 15, 16, 17, 18]), Candidate: [ 1  2  1  0  0  1  2 -1  2  0  1  0  2  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  0  1 -1  0  1  0  0  0  0  0  0  0] (Indices: [0, 2, 3, 4, 7, 10, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  2  1  0  0  1  2 -1  1  2 -1  1  2  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1  0  0  0 -1  1  0  0 -1  0  1  0  0] (Indices: [0, 2, 3, 4, 8, 9, 10, 11, 13, 14, 15, 18, 19]), Candidate: [1 2 1 0 0 1 1 1 1 1 0 0 2 1 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 36700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1  0 -1  1  0  0  0 -1  1  0  0 -1  1] (Indices: [0, 2, 3, 4, 8, 9, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 1  2  1  0  0  1  1  1  1  0  1  1  1  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1 -1  1  0  0 -1  0  1  0  0  0  0  0] (Indices: [0, 2, 3, 4, 8, 10, 11, 12, 15, 16, 17, 18, 19]), Candidate: [1 2 1 0 0 1 1 1 0 2 0 1 0 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 36800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  0  1  0  0 -1  1  0 -1  1  0  0  0  0] (Indices: [0, 2, 3, 4, 9, 10, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  2  1  0  0  1  1  0  2  1  0  0  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0  0  0  0  0 -1  0  0  0  0  1  0  0] (Indices: [0, 2, 3, 5, 6, 7, 8, 9, 10, 11, 12, 18, 19]), Candidate: [ 1  2  1 -1  2  1  1  0  1  1  0  1  0  1  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0  0  0 -1  1  0 -1  0  0  0  1  0  0] (Indices: [0, 2, 3, 5, 6, 7, 8, 9, 10, 12, 13, 18, 19]), Candidate: [ 1  2  1 -1  2  1  1  0  1  1 -1  2  1  0  0  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0  0  0 -1  0  0  1 -1  0  1  0  0  0] (Indices: [0, 2, 3, 5, 6, 7, 8, 9, 10, 14, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  1  1  0  1  1 -1  1  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 37000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0  0 -1  1 -1  1  0 -1  0  0  1  0  0] (Indices: [0, 2, 3, 5, 6, 7, 8, 9, 11, 13, 14, 18, 19]), Candidate: [ 1  2  1 -1  2  1  1  0  1  0  1  0  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0  0 -1  0  1 -1  1  0 -1  1 -1  1  0] (Indices: [0, 2, 3, 5, 6, 7, 8, 9, 12, 14, 15, 17, 19]), Candidate: [ 1  2  1 -1  2  1  1  0  1  0  0  2  0  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0 -1  1  0  0 -1  1  0 -1  0  0  1  0] (Indices: [0, 2, 3, 5, 6, 7, 8, 10, 11, 12, 14, 15, 19]), Candidate: [ 1  2  1 -1  2  1  1  0  0  2  0  1  0  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0 -1  1  0 -1  0  0  1 -1  1  0  0  0] (Indices: [0, 2, 3, 5, 6, 7, 8, 10, 11, 15, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  1  1  0  0  2  0  0  1  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0 -1  1 -1  0  1 -1  1 -1  1  0  0  0] (Indices: [0, 2, 3, 5, 6, 7, 8, 10, 13, 15, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  1  1  0  0  2 -1  1  2  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0 -1  0  1 -1  1  0 -1  1  0 -1  1  0] (Indices: [0, 2, 3, 5, 6, 7, 8, 11, 13, 14, 16, 17, 19]), Candidate: [ 1  2  1 -1  2  1  1  0  0  1  1  0  2  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  1  0  0  0  0 -1  1 -1  0  0  1  0] (Indices: [0, 2, 3, 5, 6, 7, 9, 10, 11, 12, 13, 15, 19]), Candidate: [ 1  2  1 -1  2  1  1 -1  2  1  0  1  1  0  1  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  1  0  0 -1  0  1  0 -1  1  0 -1  1] (Indices: [0, 2, 3, 5, 6, 7, 9, 10, 11, 14, 15, 17, 18]), Candidate: [ 1  2  1 -1  2  1  1 -1  2  1  0  0  1  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  1  0 -1  0  1  0  0 -1  1  0 -1  1] (Indices: [0, 2, 3, 5, 6, 7, 9, 10, 13, 14, 15, 17, 18]), Candidate: [ 1  2  1 -1  2  1  1 -1  2  1 -1  1  2  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 37450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  1 -1  1  0 -1  0  1  0 -1  1  0  0] (Indices: [0, 2, 3, 5, 6, 7, 9, 11, 12, 15, 16, 18, 19]), Candidate: [ 1  2  1 -1  2  1  1 -1  2  0  1  1  0  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  1 -1  0  0  1 -1  1  0  0  0  0  0] (Indices: [0, 2, 3, 5, 6, 7, 9, 13, 15, 16, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  1  1 -1  2  0  0  1  2  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  0  1  0 -1  1 -1  1 -1  1  0  0  0] (Indices: [0, 2, 3, 5, 6, 7, 10, 11, 13, 15, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  1  1 -1  1  2  0  0  2  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  0  0  1  0  0 -1  0  1  0  0  0  0] (Indices: [0, 2, 3, 5, 6, 7, 11, 12, 13, 16, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  1  1 -1  1  1  1  1  1  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1  0  0  0  0 -1  0  1 -1  1  0 -1  1] (Indices: [0, 2, 3, 5, 6, 8, 9, 10, 11, 12, 15, 17, 18]), Candidate: [ 1  2  1 -1  2  1  0  1  1  1  0  1  0  1  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1  0  0 -1  1  0  0 -1  0  1 -1  1  0] (Indices: [0, 2, 3, 5, 6, 8, 9, 10, 12, 13, 14, 17, 19]), Candidate: [ 1  2  1 -1  2  1  0  1  1  1 -1  2  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 37750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1  0 -1  1  0  0  0  0 -1  0  1 -1  1] (Indices: [0, 2, 3, 5, 6, 8, 9, 11, 12, 13, 14, 15, 18]), Candidate: [ 1  2  1 -1  2  1  0  1  1  0  1  1  1  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1  0 -1  1 -1  0  1  0  0 -1  1  0  0] (Indices: [0, 2, 3, 5, 6, 8, 9, 11, 14, 15, 16, 18, 19]), Candidate: [ 1  2  1 -1  2  1  0  1  1  0  1  0  1  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1 -1  1  0  0  0 -1  0  1 -1  1  0  0] (Indices: [0, 2, 3, 5, 6, 8, 10, 11, 12, 13, 16, 18, 19]), Candidate: [ 1  2  1 -1  2  1  0  1  0  2  0  1  1  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1 -1  1 -1  1  0 -1  1  0 -1  1  0  0] (Indices: [0, 2, 3, 5, 6, 8, 10, 12, 13, 15, 16, 18, 19]), Candidate: [ 1  2  1 -1  2  1  0  1  0  2 -1  2  1  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1 -1  0  0  1 -1  1  0  0  0  0  0  0] (Indices: [0, 2, 3, 5, 6, 8, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  1  0  1  0  1  0  2  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  1  0  0 -1  1 -1  1 -1  1  0  0  0] (Indices: [0, 2, 3, 5, 6, 9, 10, 11, 13, 15, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  1  0  0  2  1  0  0  2  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  1 -1  1  0  0 -1  0  1  0  0  0  0] (Indices: [0, 2, 3, 5, 6, 9, 11, 12, 13, 16, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  1  0  0  2  0  1  1  1  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  0  1 -1  1  0  0  0  0  0  0 -1  1] (Indices: [0, 2, 3, 5, 6, 10, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 1  2  1 -1  2  1  0  0  1  2 -1  2  1  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0  0  0  0  0 -1  0  0  1 -1  1  0  0] (Indices: [0, 2, 3, 5, 7, 8, 9, 10, 11, 12, 16, 18, 19]), Candidate: [ 1  2  1 -1  2  0  2  0  1  1  0  1  0  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0  0  0 -1  1  0 -1  1 -1  1  0 -1  1] (Indices: [0, 2, 3, 5, 7, 8, 9, 10, 12, 13, 15, 17, 18]), Candidate: [ 1  2  1 -1  2  0  2  0  1  1 -1  2  1  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0  0 -1  1  0  0  0 -1  0  1  0 -1  1] (Indices: [0, 2, 3, 5, 7, 8, 9, 11, 12, 13, 14, 17, 18]), Candidate: [ 1  2  1 -1  2  0  2  0  1  0  1  1  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0  0 -1  0  1  0  0  0  0 -1  1 -1  1] (Indices: [0, 2, 3, 5, 7, 8, 9, 12, 13, 14, 15, 16, 18]), Candidate: [ 1  2  1 -1  2  0  2  0  1  0  0  2  1  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0 -1  1  0  0 -1  1  0 -1  1  0 -1  1] (Indices: [0, 2, 3, 5, 7, 8, 10, 11, 12, 14, 15, 17, 18]), Candidate: [ 1  2  1 -1  2  0  2  0  0  2  0  1  0  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0 -1  1 -1  1 -1  1  0  0 -1  1  0  0] (Indices: [0, 2, 3, 5, 7, 8, 10, 12, 14, 15, 16, 18, 19]), Candidate: [ 1  2  1 -1  2  0  2  0  0  2 -1  2  0  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  1  0  0  0  0  0  0 -1  0  0  1  0] (Indices: [0, 2, 3, 5, 7, 9, 10, 11, 12, 13, 14, 15, 19]), Candidate: [ 1  2  1 -1  2  0  2 -1  2  1  0  1  1  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  1  0  0 -1  0  1  0 -1  1  0  0  0] (Indices: [0, 2, 3, 5, 7, 9, 10, 11, 14, 15, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  0  2 -1  2  1  0  0  1  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  1 -1  1  0 -1  1 -1  1  0  0  0  0] (Indices: [0, 2, 3, 5, 7, 9, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  0  2 -1  2  0  1  1  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 38600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  0  1 -1  1  0 -1  1  0  0  0  0  0] (Indices: [0, 2, 3, 5, 7, 10, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  0  2 -1  1  2 -1  2  1  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 38650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1  0  0  0 -1  1  0  0 -1  1  0 -1  1] (Indices: [0, 2, 3, 5, 8, 9, 10, 11, 13, 14, 15, 17, 18]), Candidate: [ 1  2  1 -1  2  0  1  1  1  1  0  0  2  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1  0 -1  1  0  0  0  0 -1  1 -1  1  0] (Indices: [0, 2, 3, 5, 8, 9, 11, 12, 13, 14, 15, 17, 19]), Candidate: [ 1  2  1 -1  2  0  1  1  1  0  1  1  1  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1 -1  1  0  0 -1  1  0 -1  1  0  0  0] (Indices: [0, 2, 3, 5, 8, 10, 11, 12, 14, 15, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  0  1  1  0  2  0  1  0  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  0  1  0  0 -1  1  0  0  0 -1  1  0  0] (Indices: [0, 2, 3, 5, 9, 10, 11, 13, 14, 15, 16, 18, 19]), Candidate: [ 1  2  1 -1  2  0  1  0  2  1  0  0  2  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0  0  0  0  0 -1  1  0 -1  0  0  1  0] (Indices: [0, 2, 3, 6, 7, 8, 9, 10, 11, 12, 14, 15, 19]), Candidate: [ 1  2  1 -1  1  2  1  0  1  1  0  1  0  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0  0  0  0 -1  0  0  1 -1  1  0  0  0] (Indices: [0, 2, 3, 6, 7, 8, 9, 10, 11, 15, 17, 18, 19]), Candidate: [ 1  2  1 -1  1  2  1  0  1  1  0  0  1  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0  0  0 -1  0  1 -1  1 -1  1  0  0  0] (Indices: [0, 2, 3, 6, 7, 8, 9, 10, 13, 15, 17, 18, 19]), Candidate: [ 1  2  1 -1  1  2  1  0  1  1 -1  1  2  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0  0 -1  1 -1  1  0 -1  1  0 -1  1  0] (Indices: [0, 2, 3, 6, 7, 8, 9, 11, 13, 14, 16, 17, 19]), Candidate: [ 1  2  1 -1  1  2  1  0  1  0  1  0  2  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0 -1  1  0  0  0  0 -1  0  1 -1  1  0] (Indices: [0, 2, 3, 6, 7, 8, 10, 11, 12, 13, 14, 17, 19]), Candidate: [ 1  2  1 -1  1  2  1  0  0  2  0  1  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0 -1  1 -1  1  0  0  0  0 -1  0  1  0] (Indices: [0, 2, 3, 6, 7, 8, 10, 12, 13, 14, 15, 16, 19]), Candidate: [ 1  2  1 -1  1  2  1  0  0  2 -1  2  1  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0 -1  0  1 -1  1  0  0 -1  1  0  0  0] (Indices: [0, 2, 3, 6, 7, 8, 11, 13, 14, 15, 17, 18, 19]), Candidate: [ 1  2  1 -1  1  2  1  0  0  1  1  0  2  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  1  0  0 -1  1  0  0 -1  1  0 -1  1] (Indices: [0, 2, 3, 6, 7, 9, 10, 11, 13, 14, 15, 17, 18]), Candidate: [ 1  2  1 -1  1  2  1 -1  2  1  0  0  2  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  1 -1  1  0  0  0  0 -1  1 -1  1  0] (Indices: [0, 2, 3, 6, 7, 9, 11, 12, 13, 14, 15, 17, 19]), Candidate: [ 1  2  1 -1  1  2  1 -1  2  0  1  1  1  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  0  1  0  0 -1  1  0 -1  1  0  0  0] (Indices: [0, 2, 3, 6, 7, 10, 11, 12, 14, 15, 17, 18, 19]), Candidate: [ 1  2  1 -1  1  2  1 -1  1  2  0  1  0  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1  0  0  0  0 -1  1  0 -1  1  0 -1  1] (Indices: [0, 2, 3, 6, 8, 9, 10, 11, 12, 14, 15, 17, 18]), Candidate: [ 1  2  1 -1  1  2  0  1  1  1  0  1  0  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1  0  0 -1  1 -1  1  0  0 -1  1  0  0] (Indices: [0, 2, 3, 6, 8, 9, 10, 12, 14, 15, 16, 18, 19]), Candidate: [ 1  2  1 -1  1  2  0  1  1  1 -1  2  0  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1 -1  1  0  0  0  0  0 -1  1  0 -1  1] (Indices: [0, 2, 3, 6, 8, 10, 11, 12, 13, 14, 15, 17, 18]), Candidate: [ 1  2  1 -1  1  2  0  1  0  2  0  1  1  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  1  0  0  0  0  0 -1  1 -1  1  0  0] (Indices: [0, 2, 3, 6, 9, 10, 11, 12, 13, 14, 16, 18, 19]), Candidate: [ 1  2  1 -1  1  2  0  0  2  1  0  1  1  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0  0  0  0  0  0  0  0 -1  0  0  1  0] (Indices: [0, 2, 3, 7, 8, 9, 10, 11, 12, 13, 14, 15, 19]), Candidate: [ 1  2  1 -1  1  1  2  0  1  1  0  1  1  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0  0  0  0 -1  0  1  0 -1  1  0  0  0] (Indices: [0, 2, 3, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19]), Candidate: [ 1  2  1 -1  1  1  2  0  1  1  0  0  1  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0  0 -1  1  0 -1  1 -1  1  0  0  0  0] (Indices: [0, 2, 3, 7, 8, 9, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 1  2  1 -1  1  1  2  0  1  0  1  1  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0 -1  1 -1  1  0 -1  1  0  0  0  0  0] (Indices: [0, 2, 3, 7, 8, 10, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 1  2  1 -1  1  1  2  0  0  2 -1  2  1  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1 -1  1 -1  1  0  0  0  0  0 -1  1  0  0] (Indices: [0, 2, 3, 7, 9, 11, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 1  2  1 -1  1  1  2 -1  2  0  1  1  1  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  0  1  0  0 -1  1  0 -1  1  0  0  0  0  0] (Indices: [0, 2, 3, 8, 9, 10, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 1  2  1 -1  1  1  1  1  1  1 -1  2  1  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 39850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0  0  0  0  0 -1  0  0  1 -1  0  1  0] (Indices: [0, 2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 16, 19]), Candidate: [1 2 0 1 1 1 1 0 1 1 0 1 0 1 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 39900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0  0  0 -1  1  0 -1  0  1 -1  0  1  0] (Indices: [0, 2, 4, 5, 6, 7, 8, 9, 10, 12, 13, 16, 19]), Candidate: [ 1  2  0  1  1  1  1  0  1  1 -1  2  1  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 39950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0  0  0 -1  0  0  1 -1  1  0  0 -1  1] (Indices: [0, 2, 4, 5, 6, 7, 8, 9, 10, 14, 16, 17, 18]), Candidate: [ 1  2  0  1  1  1  1  0  1  1 -1  1  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 40000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0  0 -1  1 -1  1  0 -1  1 -1  0  1  0] (Indices: [0, 2, 4, 5, 6, 7, 8, 9, 11, 13, 14, 16, 19]), Candidate: [ 1  2  0  1  1  1  1  0  1  0  1  0  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0  0 -1  0  1 -1  1  0  0 -1  1 -1  1] (Indices: [0, 2, 4, 5, 6, 7, 8, 9, 12, 14, 15, 16, 18]), Candidate: [1 2 0 1 1 1 1 0 1 0 0 2 0 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 40100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0 -1  1  0  0 -1  1  0  0 -1  0  0  1] (Indices: [0, 2, 4, 5, 6, 7, 8, 10, 11, 12, 14, 15, 16]), Candidate: [1 2 0 1 1 1 1 0 0 2 0 1 0 2 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 40150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0 -1  1  0 -1  0  0  1  0  0  0 -1  1] (Indices: [0, 2, 4, 5, 6, 7, 8, 10, 11, 15, 16, 17, 18]), Candidate: [1 2 0 1 1 1 1 0 0 2 0 0 1 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 40200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0 -1  1 -1  0  1 -1  1  0  0  0 -1  1] (Indices: [0, 2, 4, 5, 6, 7, 8, 10, 13, 15, 16, 17, 18]), Candidate: [ 1  2  0  1  1  1  1  0  0  2 -1  1  2  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0 -1  0  1 -1  1  0  0 -1  1 -1  1  0] (Indices: [0, 2, 4, 5, 6, 7, 8, 11, 13, 14, 15, 17, 19]), Candidate: [1 2 0 1 1 1 1 0 0 1 1 0 2 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 40300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  1  0  0  0  0 -1  1  0 -1  0  0  1] (Indices: [0, 2, 4, 5, 6, 7, 9, 10, 11, 12, 13, 15, 16]), Candidate: [ 1  2  0  1  1  1  1 -1  2  1  0  1  1  0  1  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  1  0  0 -1  0  1  0  0  0 -1  0  1] (Indices: [0, 2, 4, 5, 6, 7, 9, 10, 11, 14, 15, 16, 17]), Candidate: [ 1  2  0  1  1  1  1 -1  2  1  0  0  1  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  1  0 -1  0  1  0  0  0  0 -1  0  1] (Indices: [0, 2, 4, 5, 6, 7, 9, 10, 13, 14, 15, 16, 17]), Candidate: [ 1  2  0  1  1  1  1 -1  2  1 -1  1  2  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 40450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  1 -1  1  0 -1  1 -1  0  1  0  0  0] (Indices: [0, 2, 4, 5, 6, 7, 9, 11, 12, 14, 17, 18, 19]), Candidate: [ 1  2  0  1  1  1  1 -1  2  0  1  1  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 40500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  1 -1  0  0  1  0  0  0 -1  1  0  0] (Indices: [0, 2, 4, 5, 6, 7, 9, 13, 14, 15, 16, 18, 19]), Candidate: [ 1  2  0  1  1  1  1 -1  2  0  0  1  2  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  0  1  0 -1  1 -1  1  0  0  0 -1  1] (Indices: [0, 2, 4, 5, 6, 7, 10, 11, 13, 15, 16, 17, 18]), Candidate: [ 1  2  0  1  1  1  1 -1  1  2  0  0  2  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  0  0  1  0  0 -1  1  0  0 -1  1  0] (Indices: [0, 2, 4, 5, 6, 7, 11, 12, 13, 15, 16, 17, 19]), Candidate: [ 1  2  0  1  1  1  1 -1  1  1  1  1  1  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1  0  0  0  0 -1  0  1  0  0 -1  0  1] (Indices: [0, 2, 4, 5, 6, 8, 9, 10, 11, 12, 15, 16, 17]), Candidate: [1 2 0 1 1 1 0 1 1 1 0 1 0 1 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 40700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1  0  0 -1  1  0  0 -1  1 -1  1 -1  1] (Indices: [0, 2, 4, 5, 6, 8, 9, 10, 12, 13, 14, 16, 18]), Candidate: [ 1  2  0  1  1  1  0  1  1  1 -1  2  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 40750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1  0  0 -1  0  0  0  1  0  0  0  0  0] (Indices: [0, 2, 4, 5, 6, 8, 9, 10, 15, 16, 17, 18, 19]), Candidate: [ 1  2  0  1  1  1  0  1  1  1 -1  1  1  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 40800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1  0 -1  1 -1  1 -1  0  1  0  0  0  0] (Indices: [0, 2, 4, 5, 6, 8, 9, 11, 13, 16, 17, 18, 19]), Candidate: [1 2 0 1 1 1 0 1 1 0 1 0 2 0 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 40850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1 -1  1  0  0  0 -1  1 -1  0  1  0  0] (Indices: [0, 2, 4, 5, 6, 8, 10, 11, 12, 13, 15, 18, 19]), Candidate: [1 2 0 1 1 1 0 1 0 2 0 1 1 0 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 40900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1 -1  1 -1  1  0  0 -1  0  1  0  0  0] (Indices: [0, 2, 4, 5, 6, 8, 10, 12, 13, 14, 17, 18, 19]), Candidate: [ 1  2  0  1  1  1  0  1  0  2 -1  2  1  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 40950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1 -1  0  0  1  0  0  0 -1  1  0  0  0] (Indices: [0, 2, 4, 5, 6, 8, 12, 13, 14, 15, 17, 18, 19]), Candidate: [1 2 0 1 1 1 0 1 0 1 0 2 1 1 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 41000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  1  0  0 -1  1 -1  1  0  0  0 -1  1] (Indices: [0, 2, 4, 5, 6, 9, 10, 11, 13, 15, 16, 17, 18]), Candidate: [1 2 0 1 1 1 0 0 2 1 0 0 2 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 41050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  1 -1  1  0  0 -1  1  0  0 -1  1  0] (Indices: [0, 2, 4, 5, 6, 9, 11, 12, 13, 15, 16, 17, 19]), Candidate: [1 2 0 1 1 1 0 0 2 0 1 1 1 0 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 41100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  0  1  0 -1  1  0 -1  1  0  0  0  0] (Indices: [0, 2, 4, 5, 6, 10, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  2  0  1  1  1  0  0  1  2  0  0  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0  0  0  0  0 -1  0  1 -1  0  1  0  0] (Indices: [0, 2, 4, 5, 7, 8, 9, 10, 11, 12, 15, 18, 19]), Candidate: [1 2 0 1 1 0 2 0 1 1 0 1 0 1 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 41200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0  0  0 -1  1  0 -1  1  0  0 -1  0  1] (Indices: [0, 2, 4, 5, 7, 8, 9, 10, 12, 13, 15, 16, 17]), Candidate: [ 1  2  0  1  1  0  2  0  1  1 -1  2  1  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0  0 -1  1  0  0  0 -1  1  0 -1  0  1] (Indices: [0, 2, 4, 5, 7, 8, 9, 11, 12, 13, 14, 16, 17]), Candidate: [ 1  2  0  1  1  0  2  0  1  0  1  1  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0  0 -1  1 -1  0  1 -1  1  0  0  0  0] (Indices: [0, 2, 4, 5, 7, 8, 9, 11, 14, 16, 17, 18, 19]), Candidate: [ 1  2  0  1  1  0  2  0  1  0  1  0  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0 -1  1  0  0 -1  1  0  0  0 -1  0  1] (Indices: [0, 2, 4, 5, 7, 8, 10, 11, 12, 14, 15, 16, 17]), Candidate: [1 2 0 1 1 0 2 0 0 2 0 1 0 2 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 41400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0 -1  1 -1  1  0 -1  0  1  0  0  0  0] (Indices: [0, 2, 4, 5, 7, 8, 10, 12, 13, 16, 17, 18, 19]), Candidate: [ 1  2  0  1  1  0  2  0  0  2 -1  2  1  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  1  0  0  0  0  0  0  0 -1  0  0  1] (Indices: [0, 2, 4, 5, 7, 9, 10, 11, 12, 13, 14, 15, 16]), Candidate: [ 1  2  0  1  1  0  2 -1  2  1  0  1  1  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  1  0  0 -1  0  1  0  0  0  0 -1  1] (Indices: [0, 2, 4, 5, 7, 9, 10, 11, 14, 15, 16, 17, 18]), Candidate: [ 1  2  0  1  1  0  2 -1  2  1  0  0  1  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  1 -1  1  0 -1  1  0  0  0 -1  1  0] (Indices: [0, 2, 4, 5, 7, 9, 11, 12, 14, 15, 16, 17, 19]), Candidate: [ 1  2  0  1  1  0  2 -1  2  0  1  1  0  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 41600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  0  1 -1  1  0  0  0  0 -1  1  0  0] (Indices: [0, 2, 4, 5, 7, 10, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 1  2  0  1  1  0  2 -1  1  2 -1  2  1  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 41650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1  0  0  0 -1  1  0  0  0  0 -1  0  1] (Indices: [0, 2, 4, 5, 8, 9, 10, 11, 13, 14, 15, 16, 17]), Candidate: [1 2 0 1 1 0 1 1 1 1 0 0 2 1 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 41700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1  0 -1  1  0  0  0  0  0 -1  1 -1  1] (Indices: [0, 2, 4, 5, 8, 9, 11, 12, 13, 14, 15, 16, 18]), Candidate: [1 2 0 1 1 0 1 1 1 0 1 1 1 1 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 41750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1 -1  1  0  0 -1  1  0  0  0  0 -1  1] (Indices: [0, 2, 4, 5, 8, 10, 11, 12, 14, 15, 16, 17, 18]), Candidate: [1 2 0 1 1 0 1 1 0 2 0 1 0 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 41800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  0  1  0  0  0 -1  0  1  0  0  0  0  0] (Indices: [0, 2, 4, 5, 9, 10, 11, 12, 15, 16, 17, 18, 19]), Candidate: [1 2 0 1 1 0 1 0 2 1 0 1 0 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 41850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0  0  0  0  0 -1  1  0  0 -1  0  0  1] (Indices: [0, 2, 4, 6, 7, 8, 9, 10, 11, 12, 14, 15, 16]), Candidate: [1 2 0 1 0 2 1 0 1 1 0 1 0 2 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 41900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0  0  0  0 -1  0  0  1  0  0  0 -1  1] (Indices: [0, 2, 4, 6, 7, 8, 9, 10, 11, 15, 16, 17, 18]), Candidate: [1 2 0 1 0 2 1 0 1 1 0 0 1 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 41950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0  0  0 -1  0  1 -1  1  0  0  0 -1  1] (Indices: [0, 2, 4, 6, 7, 8, 9, 10, 13, 15, 16, 17, 18]), Candidate: [ 1  2  0  1  0  2  1  0  1  1 -1  1  2  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0  0 -1  1 -1  1  0  0 -1  1 -1  1  0] (Indices: [0, 2, 4, 6, 7, 8, 9, 11, 13, 14, 15, 17, 19]), Candidate: [1 2 0 1 0 2 1 0 1 0 1 0 2 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 42050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0 -1  1  0  0  0  0 -1  1 -1  1 -1  1] (Indices: [0, 2, 4, 6, 7, 8, 10, 11, 12, 13, 14, 16, 18]), Candidate: [ 1  2  0  1  0  2  1  0  0  2  0  1  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0 -1  1  0 -1  0  0  1  0  0  0  0  0] (Indices: [0, 2, 4, 6, 7, 8, 10, 11, 15, 16, 17, 18, 19]), Candidate: [1 2 0 1 0 2 1 0 0 2 0 0 1 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 42150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0 -1  0  1 -1  1  0  0  0  0  0 -1  1] (Indices: [0, 2, 4, 6, 7, 8, 11, 13, 14, 15, 16, 17, 18]), Candidate: [1 2 0 1 0 2 1 0 0 1 1 0 2 1 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 42200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  1  0  0 -1  1  0  0  0  0 -1  0  1] (Indices: [0, 2, 4, 6, 7, 9, 10, 11, 13, 14, 15, 16, 17]), Candidate: [ 1  2  0  1  0  2  1 -1  2  1  0  0  2  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  1 -1  1  0  0  0  0  0 -1  1 -1  1] (Indices: [0, 2, 4, 6, 7, 9, 11, 12, 13, 14, 15, 16, 18]), Candidate: [ 1  2  0  1  0  2  1 -1  2  0  1  1  1  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  0  1  0  0 -1  1  0  0  0  0 -1  1] (Indices: [0, 2, 4, 6, 7, 10, 11, 12, 14, 15, 16, 17, 18]), Candidate: [ 1  2  0  1  0  2  1 -1  1  2  0  1  0  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1  0  0  0  0 -1  1  0  0  0 -1  0  1] (Indices: [0, 2, 4, 6, 8, 9, 10, 11, 12, 14, 15, 16, 17]), Candidate: [1 2 0 1 0 2 0 1 1 1 0 1 0 2 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 42400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1  0  0 -1  1  0 -1  0  1  0  0  0  0] (Indices: [0, 2, 4, 6, 8, 9, 10, 12, 13, 16, 17, 18, 19]), Candidate: [ 1  2  0  1  0  2  0  1  1  1 -1  2  1  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1 -1  1  0  0  0  0  0  0  0 -1  0  1] (Indices: [0, 2, 4, 6, 8, 10, 11, 12, 13, 14, 15, 16, 17]), Candidate: [1 2 0 1 0 2 0 1 0 2 0 1 1 1 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 42500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  0  1  0  0  0  0  0  0 -1  0  1  0  0] (Indices: [0, 2, 4, 6, 9, 10, 11, 12, 13, 14, 15, 18, 19]), Candidate: [1 2 0 1 0 2 0 0 2 1 0 1 1 1 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 42550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0  0  0  0  0  0  0  0  0 -1  0  0  1] (Indices: [0, 2, 4, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16]), Candidate: [1 2 0 1 0 1 2 0 1 1 0 1 1 1 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 42600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0  0  0  0 -1  0  1  0  0  0  0 -1  1] (Indices: [0, 2, 4, 7, 8, 9, 10, 11, 14, 15, 16, 17, 18]), Candidate: [1 2 0 1 0 1 2 0 1 1 0 0 1 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 42650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0  0 -1  1  0 -1  1  0  0  0 -1  1  0] (Indices: [0, 2, 4, 7, 8, 9, 11, 12, 14, 15, 16, 17, 19]), Candidate: [1 2 0 1 0 1 2 0 1 0 1 1 0 2 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 42700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0 -1  1 -1  1  0  0  0  0 -1  1  0  0] (Indices: [0, 2, 4, 7, 8, 10, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 1  2  0  1  0  1  2  0  0  2 -1  2  1  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1 -1  1  0 -1  0  1  0  0  0  0  0  0  0] (Indices: [0, 2, 4, 7, 9, 10, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  2  0  1  0  1  2 -1  2  1 -1  1  2  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 42800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  0  1  0  0 -1  1  0  0  0  0 -1  1  0  0] (Indices: [0, 2, 4, 8, 9, 10, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 1  2  0  1  0  1  1  1  1  1 -1  2  1  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0  0  0  0  0  0 -1  0  0  0  1  0  0] (Indices: [0, 2, 5, 6, 7, 8, 9, 10, 11, 12, 13, 18, 19]), Candidate: [1 2 0 0 2 1 1 0 1 1 0 1 1 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 42900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0  0  0  0 -1  0  1 -1  0  1  0  0  0] (Indices: [0, 2, 5, 6, 7, 8, 9, 10, 11, 14, 17, 18, 19]), Candidate: [ 1  2  0  0  2  1  1  0  1  1  0  0  1  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 42950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0  0  0 -1  0  1  0 -1  0  1  0  0  0] (Indices: [0, 2, 5, 6, 7, 8, 9, 10, 13, 14, 17, 18, 19]), Candidate: [ 1  2  0  0  2  1  1  0  1  1 -1  1  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 43000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0  0 -1  1 -1  1  0  0 -1  1  0 -1  1] (Indices: [0, 2, 5, 6, 7, 8, 9, 11, 13, 14, 15, 17, 18]), Candidate: [1 2 0 0 2 1 1 0 1 0 1 0 2 1 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 43050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0 -1  1  0  0  0  0 -1  1  0 -1  0  1] (Indices: [0, 2, 5, 6, 7, 8, 10, 11, 12, 13, 14, 16, 17]), Candidate: [ 1  2  0  0  2  1  1  0  0  2  0  1  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0 -1  1  0 -1  0  1 -1  1  0  0  0  0] (Indices: [0, 2, 5, 6, 7, 8, 10, 11, 14, 16, 17, 18, 19]), Candidate: [ 1  2  0  0  2  1  1  0  0  2  0  0  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0 -1  0  1  0 -1  0  1  0  0  0  0  0] (Indices: [0, 2, 5, 6, 7, 8, 11, 12, 15, 16, 17, 18, 19]), Candidate: [1 2 0 0 2 1 1 0 0 1 1 1 0 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 43200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  1  0  0  0 -1  0  0  1  0  0  0  0] (Indices: [0, 2, 5, 6, 7, 9, 10, 11, 12, 16, 17, 18, 19]), Candidate: [ 1  2  0  0  2  1  1 -1  2  1  0  1  0  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  1 -1  1  0  0  0  0  0  0 -1  0  1] (Indices: [0, 2, 5, 6, 7, 9, 11, 12, 13, 14, 15, 16, 17]), Candidate: [ 1  2  0  0  2  1  1 -1  2  0  1  1  1  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  0  1  0  0  0 -1  0  1  0  0  0  0] (Indices: [0, 2, 5, 6, 7, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [ 1  2  0  0  2  1  1 -1  1  2  0  1  1  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1  0  0  0  0  0 -1  0  0  1  0  0  0] (Indices: [0, 2, 5, 6, 8, 9, 10, 11, 12, 13, 17, 18, 19]), Candidate: [1 2 0 0 2 1 0 1 1 1 0 1 1 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 43400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1  0  0 -1  1  0 -1  1 -1  1  0  0  0] (Indices: [0, 2, 5, 6, 8, 9, 10, 12, 13, 15, 17, 18, 19]), Candidate: [ 1  2  0  0  2  1  0  1  1  1 -1  2  1  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1  0 -1  0  0  1  0  0  0  0  0  0  0] (Indices: [0, 2, 5, 6, 8, 9, 13, 14, 15, 16, 17, 18, 19]), Candidate: [1 2 0 0 2 1 0 1 1 0 0 1 2 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 43500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  1  0  0  0  0  0  0 -1  1 -1  1  0] (Indices: [0, 2, 5, 6, 9, 10, 11, 12, 13, 14, 15, 17, 19]), Candidate: [1 2 0 0 2 1 0 0 2 1 0 1 1 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 43550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  0  0  0  1  0  0  0  0  0  0  0  0  0] (Indices: [0, 2, 5, 6, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [1 2 0 0 2 1 0 0 1 1 1 1 1 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 43600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0  0  0  0 -1  1 -1  0  1  0  0  0  0] (Indices: [0, 2, 5, 7, 8, 9, 10, 11, 13, 16, 17, 18, 19]), Candidate: [1 2 0 0 2 0 2 0 1 1 0 0 2 0 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 43650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0  0 -1  1  0 -1  1  0  0  0  0 -1  1] (Indices: [0, 2, 5, 7, 8, 9, 11, 12, 14, 15, 16, 17, 18]), Candidate: [1 2 0 0 2 0 2 0 1 0 1 1 0 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 43700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0 -1  1 -1  1  0  0  0  0  0 -1  1  0] (Indices: [0, 2, 5, 7, 8, 10, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 1  2  0  0  2  0  2  0  0  2 -1  2  1  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1 -1  1  0 -1  1 -1  1  0  0  0  0  0  0] (Indices: [0, 2, 5, 7, 9, 10, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  2  0  0  2  0  2 -1  2  1 -1  2  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 43800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1  0  0 -1  1  0  0  0  0  0 -1  1  0] (Indices: [0, 2, 5, 8, 9, 10, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 1  2  0  0  2  0  1  1  1  1 -1  2  1  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 43850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0  0  0  0  0  0 -1  1 -1  1  0 -1  1] (Indices: [0, 2, 6, 7, 8, 9, 10, 11, 12, 13, 15, 17, 18]), Candidate: [1 2 0 0 1 2 1 0 1 1 0 1 1 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 43900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0  0  0 -1  1  0  0 -1  1  0 -1  1  0] (Indices: [0, 2, 6, 7, 8, 9, 10, 12, 13, 14, 16, 17, 19]), Candidate: [ 1  2  0  0  1  2  1  0  1  1 -1  2  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 43950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0  0 -1  0  1  0  0  0  0  0 -1  1  0] (Indices: [0, 2, 6, 7, 8, 9, 12, 13, 14, 15, 16, 17, 19]), Candidate: [1 2 0 0 1 2 1 0 1 0 0 2 1 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 44000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0 -1  0  1 -1  1  0  0  0  0  0  0  0] (Indices: [0, 2, 6, 7, 8, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [1 2 0 0 1 2 1 0 0 1 1 0 2 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 44050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0 -1  0  1  0  0  0  0  0 -1  1  0  0  0] (Indices: [0, 2, 6, 7, 10, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 1  2  0  0  1  2  1 -1  1  2  0  1  1  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1 -1  1  0 -1  1 -1  1  0  0  0  0  0  0  0] (Indices: [0, 2, 6, 8, 9, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [1 2 0 0 1 2 0 1 1 0 1 0 2 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 44150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0  0  0  0 -1  0  1  0  0  0  0  0  0] (Indices: [0, 2, 7, 8, 9, 10, 11, 14, 15, 16, 17, 18, 19]), Candidate: [1 2 0 0 1 1 2 0 1 1 0 0 1 2 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 44200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0] (Indices: [0, 2, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [1 2 0 0 1 1 1 0 2 1 0 1 1 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 44250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0  0  0  0 -1  0  0  1 -1  1  0 -1  1] (Indices: [0, 3, 4, 5, 6, 7, 8, 9, 10, 11, 15, 17, 18]), Candidate: [1 1 2 0 1 1 1 0 1 1 0 0 1 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 44300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0  0  0 -1  0  1  0 -1  0  1 -1  1  0] (Indices: [0, 3, 4, 5, 6, 7, 8, 9, 10, 13, 14, 17, 19]), Candidate: [ 1  1  2  0  1  1  1  0  1  1 -1  1  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 44350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0  0 -1  1  0 -1  1 -1  0  1 -1  1  0] (Indices: [0, 3, 4, 5, 6, 7, 8, 9, 11, 12, 14, 17, 19]), Candidate: [ 1  1  2  0  1  1  1  0  1  0  1  1  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0  0 -1  0  1  0  0  0 -1  0  0  1  0] (Indices: [0, 3, 4, 5, 6, 7, 8, 9, 12, 13, 14, 15, 19]), Candidate: [1 1 2 0 1 1 1 0 1 0 0 2 1 1 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 44450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0  0 -1  0  0  0  1  0 -1  1  0  0  0] (Indices: [0, 3, 4, 5, 6, 7, 8, 9, 14, 15, 17, 18, 19]), Candidate: [1 1 2 0 1 1 1 0 1 0 0 1 1 2 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 44500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0 -1  1  0 -1  1 -1  1  0 -1  0  1  0] (Indices: [0, 3, 4, 5, 6, 7, 8, 10, 11, 13, 15, 16, 19]), Candidate: [1 1 2 0 1 1 1 0 0 2 0 0 2 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 44550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0 -1  1 -1  1 -1  1 -1  1  0 -1  1  0] (Indices: [0, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 17, 19]), Candidate: [ 1  1  2  0  1  1  1  0  0  2 -1  2  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 44600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0 -1  0  1  0 -1  1  0  0 -1  1 -1  1] (Indices: [0, 3, 4, 5, 6, 7, 8, 11, 12, 14, 15, 16, 18]), Candidate: [1 1 2 0 1 1 1 0 0 1 1 1 0 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 44650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0 -1  0  0  1 -1  1  0  0  0  0 -1  1] (Indices: [0, 3, 4, 5, 6, 7, 8, 12, 14, 15, 16, 17, 18]), Candidate: [1 1 2 0 1 1 1 0 0 1 0 2 0 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 44700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  1  0  0 -1  1  0  0 -1  0  1 -1  1] (Indices: [0, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 18]), Candidate: [ 1  1  2  0  1  1  1 -1  2  1  0  0  2  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  1  0 -1  1  0 -1  0  1  0 -1  1  0] (Indices: [0, 3, 4, 5, 6, 7, 9, 10, 12, 13, 16, 17, 19]), Candidate: [ 1  1  2  0  1  1  1 -1  2  1 -1  2  1  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 44800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  1 -1  1  0  0 -1  1  0 -1  1 -1  1] (Indices: [0, 3, 4, 5, 6, 7, 9, 11, 12, 13, 15, 16, 18]), Candidate: [ 1  1  2  0  1  1  1 -1  2  0  1  1  1  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  1 -1  0  1  0  0  0 -1  0  1  0  0] (Indices: [0, 3, 4, 5, 6, 7, 9, 12, 13, 14, 15, 18, 19]), Candidate: [ 1  1  2  0  1  1  1 -1  2  0  0  2  1  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 44900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  0  1  0  0 -1  1 -1  1  0 -1  1  0] (Indices: [0, 3, 4, 5, 6, 7, 10, 11, 12, 14, 16, 17, 19]), Candidate: [ 1  1  2  0  1  1  1 -1  1  2  0  1  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 44950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  0  1 -1  0  1  0  0  0  0  0 -1  1] (Indices: [0, 3, 4, 5, 6, 7, 10, 13, 14, 15, 16, 17, 18]), Candidate: [ 1  1  2  0  1  1  1 -1  1  2 -1  1  2  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 45000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1  0  0  0  0  0 -1  1 -1  0  1 -1  1] (Indices: [0, 3, 4, 5, 6, 8, 9, 10, 11, 12, 13, 15, 18]), Candidate: [1 1 2 0 1 1 0 1 1 1 0 1 1 0 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 45050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1  0  0  0 -1  0  1  0  0 -1  0  1  0] (Indices: [0, 3, 4, 5, 6, 8, 9, 10, 11, 14, 15, 16, 19]), Candidate: [1 1 2 0 1 1 0 1 1 1 0 0 1 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 45100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1  0  0 -1  0  1  0  0  0 -1  0  1  0] (Indices: [0, 3, 4, 5, 6, 8, 9, 10, 13, 14, 15, 16, 19]), Candidate: [ 1  1  2  0  1  1  0  1  1  1 -1  1  2  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1  0 -1  1  0 -1  0  1  0  0 -1  1  0] (Indices: [0, 3, 4, 5, 6, 8, 9, 11, 12, 15, 16, 17, 19]), Candidate: [1 1 2 0 1 1 0 1 1 0 1 1 0 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 45200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1  0 -1  0  0  1  0 -1  1  0  0  0  0] (Indices: [0, 3, 4, 5, 6, 8, 9, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  1  2  0  1  1  0  1  1  0  0  1  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1 -1  1  0 -1  1 -1  1  0 -1  1  0  0] (Indices: [0, 3, 4, 5, 6, 8, 10, 11, 13, 15, 16, 18, 19]), Candidate: [1 1 2 0 1 1 0 1 0 2 0 0 2 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 45300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1 -1  0  1  0  0 -1  1 -1  1  0  0  0] (Indices: [0, 3, 4, 5, 6, 8, 11, 12, 13, 15, 17, 18, 19]), Candidate: [1 1 2 0 1 1 0 1 0 1 1 1 1 0 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 45350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  1  0  0  0 -1  1 -1  1  0 -1  1  0] (Indices: [0, 3, 4, 5, 6, 9, 10, 11, 12, 14, 16, 17, 19]), Candidate: [ 1  1  2  0  1  1  0  0  2  1  0  1  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  1  0 -1  0  1  0  0  0  0  0 -1  1] (Indices: [0, 3, 4, 5, 6, 9, 10, 13, 14, 15, 16, 17, 18]), Candidate: [ 1  1  2  0  1  1  0  0  2  1 -1  1  2  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  0  1  0  0  0  0 -1  1  0 -1  1  0] (Indices: [0, 3, 4, 5, 6, 10, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 1  1  2  0  1  1  0  0  1  2  0  1  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0  0  0  0  0  0 -1  0  0  1  0 -1  1] (Indices: [0, 3, 4, 5, 7, 8, 9, 10, 11, 12, 13, 17, 18]), Candidate: [1 1 2 0 1 0 2 0 1 1 0 1 1 0 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 45550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0  0  0  0 -1  0  1 -1  1  0 -1  1  0] (Indices: [0, 3, 4, 5, 7, 8, 9, 10, 11, 14, 16, 17, 19]), Candidate: [ 1  1  2  0  1  0  2  0  1  1  0  0  1  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0  0  0 -1  0  1  0 -1  1  0 -1  1  0] (Indices: [0, 3, 4, 5, 7, 8, 9, 10, 13, 14, 16, 17, 19]), Candidate: [ 1  1  2  0  1  0  2  0  1  1 -1  1  2  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 45650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0  0 -1  1 -1  1  0  0  0 -1  1 -1  1] (Indices: [0, 3, 4, 5, 7, 8, 9, 11, 13, 14, 15, 16, 18]), Candidate: [1 1 2 0 1 0 2 0 1 0 1 0 2 1 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 45700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0 -1  1  0  0  0  0  0 -1  0  1 -1  1] (Indices: [0, 3, 4, 5, 7, 8, 10, 11, 12, 13, 14, 15, 18]), Candidate: [1 1 2 0 1 0 2 0 0 2 0 1 1 1 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 45750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0 -1  1  0 -1  0  1  0  0 -1  1  0  0] (Indices: [0, 3, 4, 5, 7, 8, 10, 11, 14, 15, 16, 18, 19]), Candidate: [1 1 2 0 1 0 2 0 0 2 0 0 1 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 45800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0 -1  0  1  0 -1  1  0 -1  1  0  0  0] (Indices: [0, 3, 4, 5, 7, 8, 11, 12, 14, 15, 17, 18, 19]), Candidate: [1 1 2 0 1 0 2 0 0 1 1 1 0 2 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 45850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  1  0  0  0 -1  0  1  0 -1  1  0  0] (Indices: [0, 3, 4, 5, 7, 9, 10, 11, 12, 15, 16, 18, 19]), Candidate: [ 1  1  2  0  1  0  2 -1  2  1  0  1  0  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 45900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  1  0 -1  0  1 -1  1  0  0  0  0  0] (Indices: [0, 3, 4, 5, 7, 9, 10, 13, 15, 16, 17, 18, 19]), Candidate: [ 1  1  2  0  1  0  2 -1  2  1 -1  1  2  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 45950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  0  1  0  0  0 -1  1  0 -1  1  0  0] (Indices: [0, 3, 4, 5, 7, 10, 11, 12, 13, 15, 16, 18, 19]), Candidate: [ 1  1  2  0  1  0  2 -1  1  2  0  1  1  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1  0  0  0  0  0 -1  0  1  0 -1  1  0] (Indices: [0, 3, 4, 5, 8, 9, 10, 11, 12, 13, 16, 17, 19]), Candidate: [1 1 2 0 1 0 1 1 1 1 0 1 1 0 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 46050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1  0  0 -1  1  0 -1  1  0  0 -1  1  0] (Indices: [0, 3, 4, 5, 8, 9, 10, 12, 13, 15, 16, 17, 19]), Candidate: [ 1  1  2  0  1  0  1  1  1  1 -1  2  1  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1  0 -1  0  1  0 -1  1  0  0  0  0  0] (Indices: [0, 3, 4, 5, 8, 9, 12, 13, 15, 16, 17, 18, 19]), Candidate: [1 1 2 0 1 0 1 1 1 0 0 2 1 0 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 46150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  1  0  0  0  0  0  0  0 -1  0  1  0] (Indices: [0, 3, 4, 5, 9, 10, 11, 12, 13, 14, 15, 16, 19]), Candidate: [1 1 2 0 1 0 1 0 2 1 0 1 1 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 46200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  0  1  0 -1  1  0  0  0  0  0  0  0] (Indices: [0, 3, 4, 5, 10, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [1 1 2 0 1 0 1 0 1 2 0 0 2 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 46250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0  0  0  0 -1  1 -1  1  0 -1  0  1  0] (Indices: [0, 3, 4, 6, 7, 8, 9, 10, 11, 13, 15, 16, 19]), Candidate: [1 1 2 0 0 2 1 0 1 1 0 0 2 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 46300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0  0  0 -1  1 -1  1 -1  1  0 -1  1  0] (Indices: [0, 3, 4, 6, 7, 8, 9, 10, 12, 14, 16, 17, 19]), Candidate: [ 1  1  2  0  0  2  1  0  1  1 -1  2  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 46350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0  0 -1  1  0 -1  1  0  0 -1  1 -1  1] (Indices: [0, 3, 4, 6, 7, 8, 9, 11, 12, 14, 15, 16, 18]), Candidate: [1 1 2 0 0 2 1 0 1 0 1 1 0 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 46400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0  0 -1  0  1 -1  1  0  0  0  0 -1  1] (Indices: [0, 3, 4, 6, 7, 8, 9, 12, 14, 15, 16, 17, 18]), Candidate: [1 1 2 0 0 2 1 0 1 0 0 2 0 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 46450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0 -1  1  0 -1  1  0  0  0 -1  0  1  0] (Indices: [0, 3, 4, 6, 7, 8, 10, 11, 13, 14, 15, 16, 19]), Candidate: [1 1 2 0 0 2 1 0 0 2 0 0 2 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 46500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0 -1  0  1  0  0  0  0 -1  1  0 -1  1] (Indices: [0, 3, 4, 6, 7, 8, 11, 12, 13, 14, 15, 17, 18]), Candidate: [1 1 2 0 0 2 1 0 0 1 1 1 1 1 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 46550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  1  0  0  0  0 -1  0  1  0 -1  1  0] (Indices: [0, 3, 4, 6, 7, 9, 10, 11, 12, 13, 16, 17, 19]), Candidate: [ 1  1  2  0  0  2  1 -1  2  1  0  1  1  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  1  0 -1  1  0 -1  1  0  0 -1  1  0] (Indices: [0, 3, 4, 6, 7, 9, 10, 12, 13, 15, 16, 17, 19]), Candidate: [ 1  1  2  0  0  2  1 -1  2  1 -1  2  1  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 46650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  1 -1  0  1  0 -1  1  0  0  0  0  0] (Indices: [0, 3, 4, 6, 7, 9, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 1  1  2  0  0  2  1 -1  2  0  0  2  1  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 46700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1  0  0  0  0  0  0  0 -1  0  1 -1  1] (Indices: [0, 3, 4, 6, 8, 9, 10, 11, 12, 13, 14, 15, 18]), Candidate: [1 1 2 0 0 2 0 1 1 1 0 1 1 1 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 46750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1  0  0  0 -1  0  1  0  0 -1  1  0  0] (Indices: [0, 3, 4, 6, 8, 9, 10, 11, 14, 15, 16, 18, 19]), Candidate: [1 1 2 0 0 2 0 1 1 1 0 0 1 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 46800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1  0 -1  1  0 -1  1  0 -1  1  0  0  0] (Indices: [0, 3, 4, 6, 8, 9, 11, 12, 14, 15, 17, 18, 19]), Candidate: [1 1 2 0 0 2 0 1 1 0 1 1 0 2 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 46850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1 -1  1 -1  1  0  0 -1  1  0  0  0  0] (Indices: [0, 3, 4, 6, 8, 10, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  1  2  0  0  2  0  1  0  2 -1  2  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 46900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  0  1 -1  1  0  0  0  0  0  0 -1  1  0] (Indices: [0, 3, 4, 6, 9, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [1 1 2 0 0 2 0 0 2 0 1 1 1 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 46950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0  0  0  0  0 -1  0  1  0 -1  1  0  0] (Indices: [0, 3, 4, 7, 8, 9, 10, 11, 12, 15, 16, 18, 19]), Candidate: [1 1 2 0 0 1 2 0 1 1 0 1 0 1 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 47000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0  0  0 -1  0  1 -1  1  0  0  0  0  0] (Indices: [0, 3, 4, 7, 8, 9, 10, 13, 15, 16, 17, 18, 19]), Candidate: [ 1  1  2  0  0  1  2  0  1  1 -1  1  2  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0 -1  1  0  0  0 -1  1  0 -1  1  0  0] (Indices: [0, 3, 4, 7, 8, 10, 11, 12, 13, 15, 16, 18, 19]), Candidate: [1 1 2 0 0 1 2 0 0 2 0 1 1 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 47100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  1  0  0  0 -1  1  0  0 -1  1  0  0] (Indices: [0, 3, 4, 7, 9, 10, 11, 12, 14, 15, 16, 18, 19]), Candidate: [ 1  1  2  0  0  1  2 -1  2  1  0  1  0  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  1  0  0  0  0  0 -1  1  0 -1  1  0  0] (Indices: [0, 3, 4, 8, 9, 10, 11, 12, 13, 15, 16, 18, 19]), Candidate: [1 1 2 0 0 1 1 1 1 1 0 1 1 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 47200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  0  0  1  0  0 -1  1  0  0  0  0  0  0  0] (Indices: [0, 3, 4, 9, 10, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [1 1 2 0 0 1 1 0 2 1 0 0 2 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 47250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0  0  0  0 -1  1 -1  1  0 -1  1 -1  1] (Indices: [0, 3, 5, 6, 7, 8, 9, 10, 11, 13, 15, 16, 18]), Candidate: [ 1  1  2 -1  2  1  1  0  1  1  0  0  2  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0  0  0 -1  1 -1  1 -1  1  0  0 -1  1] (Indices: [0, 3, 5, 6, 7, 8, 9, 10, 12, 14, 16, 17, 18]), Candidate: [ 1  1  2 -1  2  1  1  0  1  1 -1  2  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 47350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0  0 -1  1  0 -1  1  0  0  0 -1  0  1] (Indices: [0, 3, 5, 6, 7, 8, 9, 11, 12, 14, 15, 16, 17]), Candidate: [ 1  1  2 -1  2  1  1  0  1  0  1  1  0  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0  0 -1  0  1  0 -1  0  1  0  0  0  0] (Indices: [0, 3, 5, 6, 7, 8, 9, 12, 13, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  2  1  1  0  1  0  0  2  1  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0 -1  1  0 -1  1  0  0  0 -1  1 -1  1] (Indices: [0, 3, 5, 6, 7, 8, 10, 11, 13, 14, 15, 16, 18]), Candidate: [ 1  1  2 -1  2  1  1  0  0  2  0  0  2  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0 -1  0  1  0  0  0  0  0 -1  0  1  0] (Indices: [0, 3, 5, 6, 7, 8, 11, 12, 13, 14, 15, 16, 19]), Candidate: [ 1  1  2 -1  2  1  1  0  0  1  1  1  1  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  1  0  0  0  0 -1  0  1  0  0 -1  1] (Indices: [0, 3, 5, 6, 7, 9, 10, 11, 12, 13, 16, 17, 18]), Candidate: [ 1  1  2 -1  2  1  1 -1  2  1  0  1  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 47600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  1  0 -1  1  0 -1  1  0  0  0 -1  1] (Indices: [0, 3, 5, 6, 7, 9, 10, 12, 13, 15, 16, 17, 18]), Candidate: [ 1  1  2 -1  2  1  1 -1  2  1 -1  2  1  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 47650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  1 -1  0  1  0  0 -1  1  0  0  0  0] (Indices: [0, 3, 5, 6, 7, 9, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  2  1  1 -1  2  0  0  2  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 47700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1  0  0  0  0  0  0  0 -1  1 -1  0  1] (Indices: [0, 3, 5, 6, 8, 9, 10, 11, 12, 13, 14, 15, 17]), Candidate: [ 1  1  2 -1  2  1  0  1  1  1  0  1  1  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1  0  0  0 -1  0  1  0  0  0 -1  1  0] (Indices: [0, 3, 5, 6, 8, 9, 10, 11, 14, 15, 16, 17, 19]), Candidate: [ 1  1  2 -1  2  1  0  1  1  1  0  0  1  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1  0 -1  1  0 -1  1  0  0 -1  1  0  0] (Indices: [0, 3, 5, 6, 8, 9, 11, 12, 14, 15, 16, 18, 19]), Candidate: [ 1  1  2 -1  2  1  0  1  1  0  1  1  0  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1 -1  1 -1  1  0  0  0 -1  1  0  0  0] (Indices: [0, 3, 5, 6, 8, 10, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 1  1  2 -1  2  1  0  1  0  2 -1  2  1  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 47900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  1 -1  1  0  0  0  0  0  0  0 -1  1] (Indices: [0, 3, 5, 6, 9, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 1  1  2 -1  2  1  0  0  2  0  1  1  1  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 47950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0  0  0  0  0 -1  0  1  0  0 -1  1  0] (Indices: [0, 3, 5, 7, 8, 9, 10, 11, 12, 15, 16, 17, 19]), Candidate: [ 1  1  2 -1  2  0  2  0  1  1  0  1  0  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0  0  0 -1  0  1  0 -1  1  0  0  0  0] (Indices: [0, 3, 5, 7, 8, 9, 10, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  2  0  2  0  1  1 -1  1  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 48050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0 -1  1  0  0  0 -1  1  0  0 -1  1  0] (Indices: [0, 3, 5, 7, 8, 10, 11, 12, 13, 15, 16, 17, 19]), Candidate: [ 1  1  2 -1  2  0  2  0  0  2  0  1  1  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1 -1  1  0  0  0 -1  1  0  0  0 -1  1  0] (Indices: [0, 3, 5, 7, 9, 10, 11, 12, 14, 15, 16, 17, 19]), Candidate: [ 1  1  2 -1  2  0  2 -1  2  1  0  1  0  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 48150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  1  0  0  0  0  0 -1  1  0  0 -1  1  0] (Indices: [0, 3, 5, 8, 9, 10, 11, 12, 13, 15, 16, 17, 19]), Candidate: [ 1  1  2 -1  2  0  1  1  1  1  0  1  1  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  0  0  1  0  0  0 -1  1  0  0  0  0  0  0] (Indices: [0, 3, 5, 9, 10, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  2  0  1  0  2  1  0  1  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0  0  0  0 -1  1 -1  1  0  0  0 -1  1] (Indices: [0, 3, 6, 7, 8, 9, 10, 11, 13, 15, 16, 17, 18]), Candidate: [ 1  1  2 -1  1  2  1  0  1  1  0  0  2  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0  0 -1  1  0  0 -1  1  0  0 -1  1  0] (Indices: [0, 3, 6, 7, 8, 9, 11, 12, 13, 15, 16, 17, 19]), Candidate: [ 1  1  2 -1  1  2  1  0  1  0  1  1  1  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0 -1  1  0 -1  1  0 -1  1  0  0  0  0] (Indices: [0, 3, 6, 7, 8, 10, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  2  1  0  0  2  0  0  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 48400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0 -1  1  0 -1  1  0  0  0  0 -1  1  0  0] (Indices: [0, 3, 6, 7, 9, 10, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 1  1  2 -1  1  2  1 -1  2  1 -1  2  1  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 48450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1  0  0  0 -1  1  0 -1  1  0  0  0  0] (Indices: [0, 3, 6, 8, 9, 10, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  2  0  1  1  1  0  0  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 48500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1  0  0  0  0  0  0  0 -1  0  1  0  0  0] (Indices: [0, 3, 7, 8, 9, 10, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  1  2  0  1  1  0  1  1  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 48550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  0  1 -1  1  0  0  0  0  0 -1  1  0  0  0  0] (Indices: [0, 3, 7, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  1  2 -1  2  1  0  1  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 48600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0  0  0  0  0 -1  0  0  1  0  0 -1  1] (Indices: [0, 4, 5, 6, 7, 8, 9, 10, 11, 12, 16, 17, 18]), Candidate: [1 1 1 1 1 1 1 0 1 1 0 1 0 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 48650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0  0  0 -1  1  0 -1  1  0 -1  1 -1  1] (Indices: [0, 4, 5, 6, 7, 8, 9, 10, 12, 13, 15, 16, 18]), Candidate: [ 1  1  1  1  1  1  1  0  1  1 -1  2  1  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0  0 -1  1  0  0  0 -1  1 -1  1 -1  1] (Indices: [0, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 16, 18]), Candidate: [ 1  1  1  1  1  1  1  0  1  0  1  1  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0  0 -1  1 -1  0  0  1  0  0  0  0  0] (Indices: [0, 4, 5, 6, 7, 8, 9, 11, 15, 16, 17, 18, 19]), Candidate: [1 1 1 1 1 1 1 0 1 0 1 0 1 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 48800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0 -1  1  0  0 -1  1  0  0 -1  1 -1  1] (Indices: [0, 4, 5, 6, 7, 8, 10, 11, 12, 14, 15, 16, 18]), Candidate: [1 1 1 1 1 1 1 0 0 2 0 1 0 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 48850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0 -1  1 -1  1 -1  1  0  0  0  0 -1  1] (Indices: [0, 4, 5, 6, 7, 8, 10, 12, 14, 15, 16, 17, 18]), Candidate: [ 1  1  1  1  1  1  1  0  0  2 -1  2  0  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  1  0  0  0  0  0  0 -1  1 -1  0  1] (Indices: [0, 4, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 17]), Candidate: [ 1  1  1  1  1  1  1 -1  2  1  0  1  1  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 48950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  1  0  0 -1  0  1  0  0  0 -1  1  0] (Indices: [0, 4, 5, 6, 7, 9, 10, 11, 14, 15, 16, 17, 19]), Candidate: [ 1  1  1  1  1  1  1 -1  2  1  0  0  1  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  1 -1  1  0 -1  1  0  0 -1  1  0  0] (Indices: [0, 4, 5, 6, 7, 9, 11, 12, 14, 15, 16, 18, 19]), Candidate: [ 1  1  1  1  1  1  1 -1  2  0  1  1  0  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  0  1 -1  1  0  0  0 -1  1  0  0  0] (Indices: [0, 4, 5, 6, 7, 10, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 1  1  1  1  1  1  1 -1  1  2 -1  2  1  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 49100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1  0  0  0 -1  1  0  0  0 -1  1 -1  1] (Indices: [0, 4, 5, 6, 8, 9, 10, 11, 13, 14, 15, 16, 18]), Candidate: [1 1 1 1 1 1 0 1 1 1 0 0 2 1 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 49150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1  0 -1  1  0  0  0  0  0 -1  0  1  0] (Indices: [0, 4, 5, 6, 8, 9, 11, 12, 13, 14, 15, 16, 19]), Candidate: [1 1 1 1 1 1 0 1 1 0 1 1 1 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 49200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1 -1  1  0  0 -1  1  0  0  0 -1  1  0] (Indices: [0, 4, 5, 6, 8, 10, 11, 12, 14, 15, 16, 17, 19]), Candidate: [1 1 1 1 1 1 0 1 0 2 0 1 0 2 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 49250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  1  0  0 -1  1  0  0  0  0  0 -1  1] (Indices: [0, 4, 5, 6, 9, 10, 11, 13, 14, 15, 16, 17, 18]), Candidate: [1 1 1 1 1 1 0 0 2 1 0 0 2 1 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 49300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0  0  0  0  0  0 -1  0  1  0  0 -1  1] (Indices: [0, 4, 5, 7, 8, 9, 10, 11, 12, 13, 16, 17, 18]), Candidate: [1 1 1 1 1 0 2 0 1 1 0 1 1 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 49350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0  0  0 -1  1  0 -1  1  0  0  0 -1  1] (Indices: [0, 4, 5, 7, 8, 9, 10, 12, 13, 15, 16, 17, 18]), Candidate: [ 1  1  1  1  1  0  2  0  1  1 -1  2  1  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0  0 -1  0  1  0  0 -1  1  0  0  0  0] (Indices: [0, 4, 5, 7, 8, 9, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  1  1  1  1  0  2  0  1  0  0  2  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  1  0  0  0  0  0  0  0 -1  1 -1  1] (Indices: [0, 4, 5, 7, 9, 10, 11, 12, 13, 14, 15, 16, 18]), Candidate: [ 1  1  1  1  1  0  2 -1  2  1  0  1  1  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1 -1  0  1  0  0 -1  1  0  0  0  0  0  0] (Indices: [0, 4, 5, 7, 10, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  1  1  1  1  0  2 -1  1  2  0  1  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  0  1 -1  1  0  0  0  0  0  0  0 -1  1  0] (Indices: [0, 4, 5, 8, 10, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [1 1 1 1 1 0 1 1 0 2 0 1 1 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 49600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0  0  0  0  0 -1  0  1  0  0  0 -1  1] (Indices: [0, 4, 6, 7, 8, 9, 10, 11, 12, 15, 16, 17, 18]), Candidate: [1 1 1 1 0 2 1 0 1 1 0 1 0 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 49650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0  0  0 -1  0  1  0  0 -1  1  0  0  0] (Indices: [0, 4, 6, 7, 8, 9, 10, 13, 14, 15, 17, 18, 19]), Candidate: [ 1  1  1  1  0  2  1  0  1  1 -1  1  2  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0 -1  1  0  0  0 -1  1  0  0  0 -1  1] (Indices: [0, 4, 6, 7, 8, 10, 11, 12, 13, 15, 16, 17, 18]), Candidate: [1 1 1 1 0 2 1 0 0 2 0 1 1 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 49750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  1  0  0  0 -1  1  0  0  0  0 -1  1] (Indices: [0, 4, 6, 7, 9, 10, 11, 12, 14, 15, 16, 17, 18]), Candidate: [ 1  1  1  1  0  2  1 -1  2  1  0  1  0  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 49800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  1  0  0  0  0  0 -1  1  0  0  0 -1  1] (Indices: [0, 4, 6, 8, 9, 10, 11, 12, 13, 15, 16, 17, 18]), Candidate: [1 1 1 1 0 2 0 1 1 1 0 1 1 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 49850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1 -1  0  1  0  0  0  0 -1  1  0  0  0  0  0] (Indices: [0, 4, 6, 9, 10, 11, 12, 13, 15, 16, 17, 18, 19]), Candidate: [1 1 1 1 0 2 0 0 2 1 0 1 1 0 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 49900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  0  1  0  0 -1  0  1  0  0  0  0  0  0  0  0] (Indices: [0, 4, 7, 8, 9, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [1 1 1 1 0 1 2 0 1 0 0 2 1 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 49950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0  0  0  0  0  0 -1  0  1  0  0 -1  1] (Indices: [0, 5, 6, 7, 8, 9, 10, 11, 12, 13, 16, 17, 18]), Candidate: [1 1 1 0 2 1 1 0 1 1 0 1 1 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 50000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0  0  0 -1  1  0 -1  1  0  0  0 -1  1] (Indices: [0, 5, 6, 7, 8, 9, 10, 12, 13, 15, 16, 17, 18]), Candidate: [ 1  1  1  0  2  1  1  0  1  1 -1  2  1  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0  0 -1  0  1  0  0 -1  1  0  0  0  0] (Indices: [0, 5, 6, 7, 8, 9, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  1  1  0  2  1  1  0  1  0  0  2  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  1  0  0  0  0  0  0  0 -1  1 -1  1] (Indices: [0, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 16, 18]), Candidate: [ 1  1  1  0  2  1  1 -1  2  1  0  1  1  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0 -1  0  1  0  0 -1  1  0  0  0  0  0  0] (Indices: [0, 5, 6, 7, 10, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  1  1  0  2  1  1 -1  1  2  0  1  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1 -1  1  0  0  0  0  0  0  0 -1  1  0] (Indices: [0, 5, 6, 8, 10, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [1 1 1 0 2 1 0 1 0 2 0 1 1 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 50250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1 -1  1  0  0  0 -1  1  0  0  0  0 -1  1  0  0] (Indices: [0, 5, 7, 8, 9, 10, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 1  1  1  0  2  0  2  0  1  1 -1  2  1  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 -1  0  1  0] (Indices: [0, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 19]), Candidate: [1 1 1 0 1 2 1 0 1 1 0 1 1 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 50350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  0  1  0  0 -1  1  0 -1  1  0  0  0  0  0  0  0] (Indices: [0, 6, 7, 8, 10, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [1 1 1 0 1 2 1 0 0 2 0 0 2 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 50400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0  0  0  0 -1  1 -1  0  0  0  1 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 18]), Candidate: [3 1 1 0 1 1 1 0 1 1 0 0 2 0 0 1 1 2 0 6]
 -> Valid neighbor added.
Attempt 50450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0  0  0 -1  0  1 -1  0  0  1  0 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 13, 17, 18]), Candidate: [ 3  1  1  0  1  1  1  0  1  1 -1  1  2  0  0  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0  0 -1  1 -1  1 -1  1 -1  1 -1  0  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 13, 15, 17]), Candidate: [3 1 1 0 1 1 1 0 1 0 1 0 2 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 50550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0  0 -1  0  1 -1  1 -1  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 9, 12, 14, 16, 19]), Candidate: [ 3  1  1  0  1  1  1  0  1  0  0  2  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0 -1  1  0  0  0 -1  1 -1  0  0  0  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 12, 13, 15]), Candidate: [3 1 1 0 1 1 1 0 0 2 0 1 1 0 1 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 50650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0 -1  1  0 -1  0  0  1 -1  0  1  0 -1] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 15, 18, 19]), Candidate: [3 1 1 0 1 1 1 0 0 2 0 0 1 1 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 50700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0 -1  1 -1  0  1 -1  1  0  0 -1  0  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 10, 13, 15, 16, 17]), Candidate: [ 3  1  1  0  1  1  1  0  0  2 -1  1  2  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0 -1  0  1  0 -1  0  1  0  0 -1  0  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 15, 16, 17]), Candidate: [3 1 1 0 1 1 1 0 0 1 1 1 0 1 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 50800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0 -1  0  0  1  0  0 -1  1 -1  1 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 12, 13, 14, 16, 18]), Candidate: [ 3  1  1  0  1  1  1  0  0  1  0  2  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0 -1  0  0  0  0  0  1  0  0  0  0 -1] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 15, 16, 17, 18, 19]), Candidate: [3 1 1 0 1 1 1 0 0 1 0 1 1 1 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 50900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  1  0  0 -1  0  0  1 -1  1  0 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 15, 17, 18]), Candidate: [ 3  1  1  0  1  1  1 -1  2  1  0  0  1  1  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 50950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  1  0 -1  0  1  0 -1  0  1 -1  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 7, 9, 10, 13, 14, 17, 19]), Candidate: [ 3  1  1  0  1  1  1 -1  2  1 -1  1  2  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 51000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  1 -1  1  0 -1  1 -1  0  1 -1  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 7, 9, 11, 12, 14, 17, 19]), Candidate: [ 3  1  1  0  1  1  1 -1  2  0  1  1  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 51050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  1 -1  0  1  0  0  0 -1  0  0  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 7, 9, 12, 13, 14, 15, 19]), Candidate: [ 3  1  1  0  1  1  1 -1  2  0  0  2  1  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  1 -1  0  0  0  1  0 -1  1  0  0 -1] (Indices: [1, 2, 3, 4, 5, 6, 7, 9, 14, 15, 17, 18, 19]), Candidate: [ 3  1  1  0  1  1  1 -1  2  0  0  1  1  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  0  1  0 -1  1 -1  1  0 -1  0  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 7, 10, 11, 13, 15, 16, 19]), Candidate: [ 3  1  1  0  1  1  1 -1  1  2  0  0  2  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  0  1 -1  1 -1  1 -1  1  0 -1  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 7, 10, 12, 14, 16, 17, 19]), Candidate: [ 3  1  1  0  1  1  1 -1  1  2 -1  2  0  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 51250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  0  0  1  0 -1  1  0  0 -1  1 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 11, 12, 14, 15, 16, 18]), Candidate: [ 3  1  1  0  1  1  1 -1  1  1  1  1  0  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  0  0  0  1 -1  1  0  0  0  0 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 12, 14, 15, 16, 17, 18]), Candidate: [ 3  1  1  0  1  1  1 -1  1  1  0  2  0  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1  0  0  0 -1  0  1  0 -1  1 -1  0  0] (Indices: [1, 2, 3, 4, 5, 6, 8, 9, 10, 11, 14, 15, 17]), Candidate: [3 1 1 0 1 1 0 1 1 1 0 0 1 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 51400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1  0  0 -1  1 -1  0  0  1  0  0 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 16, 17, 18]), Candidate: [ 3  1  1  0  1  1  0  1  1  1 -1  2  0  1  0  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1  0 -1  1  0  0 -1  0  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 8, 9, 11, 12, 13, 16, 19]), Candidate: [3 1 1 0 1 1 0 1 1 0 1 1 1 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 51500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1  0 -1  1 -1  0  1 -1  1  0  0 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 8, 9, 11, 14, 16, 17, 18]), Candidate: [ 3  1  1  0  1  1  0  1  1  0  1  0  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1  0 -1  0  0  1  0 -1  1  0  0 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 8, 9, 13, 14, 16, 17, 18]), Candidate: [ 3  1  1  0  1  1  0  1  1  0  0  1  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1 -1  1  0 -1  1  0  0  0 -1  0  0  0] (Indices: [1, 2, 3, 4, 5, 6, 8, 10, 11, 13, 14, 15, 16]), Candidate: [3 1 1 0 1 1 0 1 0 2 0 0 2 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 51650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1 -1  1 -1  1  0 -1  1 -1  0  1  0 -1] (Indices: [1, 2, 3, 4, 5, 6, 8, 10, 12, 13, 15, 18, 19]), Candidate: [ 3  1  1  0  1  1  0  1  0  2 -1  2  1  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1 -1  0  1  0  0  0 -1  0  0  1  0 -1] (Indices: [1, 2, 3, 4, 5, 6, 8, 11, 12, 13, 14, 18, 19]), Candidate: [ 3  1  1  0  1  1  0  1  0  1  1  1  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1 -1  0  0  1  0  0  0 -1  1  0 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 8, 12, 13, 14, 15, 17, 18]), Candidate: [3 1 1 0 1 1 0 1 0 1 0 2 1 1 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 51800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  1  0  0  0 -1  0  1  0  0 -1  0  0] (Indices: [1, 2, 3, 4, 5, 6, 9, 10, 11, 12, 15, 16, 17]), Candidate: [3 1 1 0 1 1 0 0 2 1 0 1 0 1 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 51850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  1  0 -1  1  0  0 -1  1 -1  1 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 9, 10, 12, 13, 14, 16, 18]), Candidate: [ 3  1  1  0  1  1  0  0  2  1 -1  2  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 51900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  1  0 -1  0  0  0  1  0  0  0  0 -1] (Indices: [1, 2, 3, 4, 5, 6, 9, 10, 15, 16, 17, 18, 19]), Candidate: [ 3  1  1  0  1  1  0  0  2  1 -1  1  1  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 51950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  1 -1  1 -1  1 -1  0  1  0  0  0 -1] (Indices: [1, 2, 3, 4, 5, 6, 9, 11, 13, 16, 17, 18, 19]), Candidate: [3 1 1 0 1 1 0 0 2 0 1 0 2 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 52000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  0  1  0  0  0 -1  1 -1  0  1  0 -1] (Indices: [1, 2, 3, 4, 5, 6, 10, 11, 12, 13, 15, 18, 19]), Candidate: [3 1 1 0 1 1 0 0 1 2 0 1 1 0 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 52050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  0  1 -1  1  0  0 -1  0  1  0  0 -1] (Indices: [1, 2, 3, 4, 5, 6, 10, 12, 13, 14, 17, 18, 19]), Candidate: [ 3  1  1  0  1  1  0  0  1  2 -1  2  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  0  0  0  1  0  0  0 -1  1  0  0 -1] (Indices: [1, 2, 3, 4, 5, 6, 12, 13, 14, 15, 17, 18, 19]), Candidate: [3 1 1 0 1 1 0 0 1 1 0 2 1 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 52150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0  0  0  0 -1  0  1 -1  0  0  1  0 -1] (Indices: [1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 14, 18, 19]), Candidate: [ 3  1  1  0  1  0  2  0  1  1  0  0  1  2 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0  0  0 -1  0  1  0 -1  1  0 -1  0  0] (Indices: [1, 2, 3, 4, 5, 7, 8, 9, 10, 13, 14, 16, 17]), Candidate: [ 3  1  1  0  1  0  2  0  1  1 -1  1  2  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0  0 -1  1  0 -1  1 -1  1  0 -1  0  0] (Indices: [1, 2, 3, 4, 5, 7, 8, 9, 11, 12, 14, 16, 17]), Candidate: [ 3  1  1  0  1  0  2  0  1  0  1  1  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0  0 -1  1 -1  0  0  0  1  0  0  0 -1] (Indices: [1, 2, 3, 4, 5, 7, 8, 9, 11, 16, 17, 18, 19]), Candidate: [3 1 1 0 1 0 2 0 1 0 1 0 1 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 52350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0  0 -1  0  0  1 -1  0  1  0  0  0 -1] (Indices: [1, 2, 3, 4, 5, 7, 8, 9, 13, 16, 17, 18, 19]), Candidate: [3 1 1 0 1 0 2 0 1 0 0 1 2 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 52400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0 -1  1  0 -1  1  0 -1  0  1 -1  1 -1] (Indices: [1, 2, 3, 4, 5, 7, 8, 10, 11, 13, 14, 17, 19]), Candidate: [ 3  1  1  0  1  0  2  0  0  2  0  0  2  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0 -1  1 -1  1 -1  1  0 -1  1  0 -1  0] (Indices: [1, 2, 3, 4, 5, 7, 8, 10, 12, 14, 15, 17, 18]), Candidate: [ 3  1  1  0  1  0  2  0  0  2 -1  2  0  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0 -1  0  1  0  0 -1  0  1  0 -1  1 -1] (Indices: [1, 2, 3, 4, 5, 7, 8, 11, 12, 13, 16, 17, 19]), Candidate: [3 1 1 0 1 0 2 0 0 1 1 1 1 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 52550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0 -1  0  0  1  0 -1  1  0  0 -1  1 -1] (Indices: [1, 2, 3, 4, 5, 7, 8, 12, 13, 15, 16, 17, 19]), Candidate: [3 1 1 0 1 0 2 0 0 1 0 2 1 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 52600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  1  0  0  0 -1  0  0  1 -1  1  0 -1] (Indices: [1, 2, 3, 4, 5, 7, 9, 10, 11, 12, 16, 18, 19]), Candidate: [ 3  1  1  0  1  0  2 -1  2  1  0  1  0  1  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  1  0 -1  1  0 -1  1 -1  1  0 -1  0] (Indices: [1, 2, 3, 4, 5, 7, 9, 10, 12, 13, 15, 17, 18]), Candidate: [ 3  1  1  0  1  0  2 -1  2  1 -1  2  1  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  1 -1  1  0  0  0 -1  0  1  0 -1  0] (Indices: [1, 2, 3, 4, 5, 7, 9, 11, 12, 13, 14, 17, 18]), Candidate: [ 3  1  1  0  1  0  2 -1  2  0  1  1  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  1 -1  0  1  0  0  0  0 -1  1 -1  0] (Indices: [1, 2, 3, 4, 5, 7, 9, 12, 13, 14, 15, 16, 18]), Candidate: [ 3  1  1  0  1  0  2 -1  2  0  0  2  1  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  0  1  0  0 -1  1  0 -1  1  0 -1  0] (Indices: [1, 2, 3, 4, 5, 7, 10, 11, 12, 14, 15, 17, 18]), Candidate: [ 3  1  1  0  1  0  2 -1  1  2  0  1  0  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  0  1 -1  1 -1  1  0  0 -1  1  0 -1] (Indices: [1, 2, 3, 4, 5, 7, 10, 12, 14, 15, 16, 18, 19]), Candidate: [ 3  1  1  0  1  0  2 -1  1  2 -1  2  0  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 52900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1  0  0  0  0  0  0 -1  0  0  1 -1  0] (Indices: [1, 2, 3, 4, 5, 8, 9, 10, 11, 12, 13, 14, 18]), Candidate: [ 3  1  1  0  1  0  1  1  1  1  0  1  1  1 -1  1  1  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 52950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1  0  0  0 -1  1 -1  0  1 -1  1  0 -1] (Indices: [1, 2, 3, 4, 5, 8, 9, 10, 11, 13, 16, 18, 19]), Candidate: [3 1 1 0 1 0 1 1 1 1 0 0 2 0 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 53000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1  0  0 -1  1 -1  0  1 -1  1  0  0 -1] (Indices: [1, 2, 3, 4, 5, 8, 9, 10, 12, 15, 17, 18, 19]), Candidate: [ 3  1  1  0  1  0  1  1  1  1 -1  2  0  1  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1  0 -1  1  0 -1  1 -1  1  0 -1  1 -1] (Indices: [1, 2, 3, 4, 5, 8, 9, 11, 12, 14, 16, 17, 19]), Candidate: [ 3  1  1  0  1  0  1  1  1  0  1  1  0  2 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1  0 -1  0  0  1  0  0  0  0  0 -1  0] (Indices: [1, 2, 3, 4, 5, 8, 9, 13, 14, 15, 16, 17, 18]), Candidate: [3 1 1 0 1 0 1 1 1 0 0 1 2 1 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 53150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1 -1  1  0 -1  1  0 -1  1 -1  1  0 -1] (Indices: [1, 2, 3, 4, 5, 8, 10, 11, 13, 14, 16, 18, 19]), Candidate: [ 3  1  1  0  1  0  1  1  0  2  0  0  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1 -1  0  1  0  0  0 -1  0  1  0  0 -1] (Indices: [1, 2, 3, 4, 5, 8, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 3  1  1  0  1  0  1  1  0  1  1  1  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  1  0  0  0 -1  1  0 -1  1  0 -1  0] (Indices: [1, 2, 3, 4, 5, 9, 10, 11, 12, 14, 15, 17, 18]), Candidate: [3 1 1 0 1 0 1 0 2 1 0 1 0 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 53300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  1  0 -1  1 -1  1  0  0 -1  1  0 -1] (Indices: [1, 2, 3, 4, 5, 9, 10, 12, 14, 15, 16, 18, 19]), Candidate: [ 3  1  1  0  1  0  1  0  2  1 -1  2  0  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  0  1  0  0  0  0  0 -1  1  0 -1  0] (Indices: [1, 2, 3, 4, 5, 10, 11, 12, 13, 14, 15, 17, 18]), Candidate: [3 1 1 0 1 0 1 0 1 2 0 1 1 1 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 53400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0  0  0  0  0 -1  1 -1  0  1 -1  0  0] (Indices: [1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 14, 17]), Candidate: [ 3  1  1  0  0  2  1  0  1  1  0  1  0  2 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0  0  0 -1  1  0  0 -1  0  1 -1  0  0] (Indices: [1, 2, 3, 4, 6, 7, 8, 9, 10, 12, 13, 14, 17]), Candidate: [ 3  1  1  0  0  2  1  0  1  1 -1  2  1  1 -1  1  2  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 53500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0  0  0 -1  0  1 -1  0  1  0 -1  1 -1] (Indices: [1, 2, 3, 4, 6, 7, 8, 9, 10, 13, 16, 17, 19]), Candidate: [ 3  1  1  0  0  2  1  0  1  1 -1  1  2  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0  0 -1  1  0 -1  0  0  1  0 -1  1 -1] (Indices: [1, 2, 3, 4, 6, 7, 8, 9, 11, 12, 16, 17, 19]), Candidate: [3 1 1 0 0 2 1 0 1 0 1 1 0 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 53600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0  0 -1  0  1  0 -1  1  0 -1  0  1 -1] (Indices: [1, 2, 3, 4, 6, 7, 8, 9, 12, 13, 15, 16, 19]), Candidate: [3 1 1 0 0 2 1 0 1 0 0 2 1 0 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 53650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0 -1  1  0  0  0 -1  1 -1  1 -1  0  0] (Indices: [1, 2, 3, 4, 6, 7, 8, 10, 11, 12, 13, 15, 17]), Candidate: [3 1 1 0 0 2 1 0 0 2 0 1 1 0 1 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 53700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0 -1  1  0 -1  0  1  0  0 -1  1 -1  0] (Indices: [1, 2, 3, 4, 6, 7, 8, 10, 11, 14, 15, 16, 18]), Candidate: [3 1 1 0 0 2 1 0 0 2 0 0 1 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 53750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0 -1  1 -1  0  1  0  0  0 -1  1 -1  0] (Indices: [1, 2, 3, 4, 6, 7, 8, 10, 13, 14, 15, 16, 18]), Candidate: [ 3  1  1  0  0  2  1  0  0  2 -1  1  2  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0 -1  0  1  0 -1  0  1  0  0  0 -1  0] (Indices: [1, 2, 3, 4, 6, 7, 8, 11, 12, 15, 16, 17, 18]), Candidate: [3 1 1 0 0 2 1 0 0 1 1 1 0 1 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 53850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0 -1  0  0  0  1  0  0 -1  1  0  0 -1] (Indices: [1, 2, 3, 4, 6, 7, 8, 13, 14, 15, 17, 18, 19]), Candidate: [3 1 1 0 0 2 1 0 0 1 0 1 2 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 53900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  1  0  0 -1  1 -1  1  0 -1  1 -1  0] (Indices: [1, 2, 3, 4, 6, 7, 9, 10, 11, 13, 15, 16, 18]), Candidate: [ 3  1  1  0  0  2  1 -1  2  1  0  0  2  0  1  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 53950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  1  0 -1  1 -1  1 -1  1  0  0 -1  0] (Indices: [1, 2, 3, 4, 6, 7, 9, 10, 12, 14, 16, 17, 18]), Candidate: [ 3  1  1  0  0  2  1 -1  2  1 -1  2  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 54000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  1 -1  1  0 -1  1  0  0  0 -1  0  0] (Indices: [1, 2, 3, 4, 6, 7, 9, 11, 12, 14, 15, 16, 17]), Candidate: [ 3  1  1  0  0  2  1 -1  2  0  1  1  0  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  1 -1  0  1  0 -1  0  1  0  0  0 -1] (Indices: [1, 2, 3, 4, 6, 7, 9, 12, 13, 16, 17, 18, 19]), Candidate: [ 3  1  1  0  0  2  1 -1  2  0  0  2  1  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  0  1  0 -1  1  0  0  0 -1  1 -1  0] (Indices: [1, 2, 3, 4, 6, 7, 10, 11, 13, 14, 15, 16, 18]), Candidate: [ 3  1  1  0  0  2  1 -1  1  2  0  0  2  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  0  0  1  0  0  0  0  0 -1  0  1 -1] (Indices: [1, 2, 3, 4, 6, 7, 11, 12, 13, 14, 15, 16, 19]), Candidate: [ 3  1  1  0  0  2  1 -1  1  1  1  1  1  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1  0  0  0  0 -1  1  0 -1  1 -1  0  0] (Indices: [1, 2, 3, 4, 6, 8, 9, 10, 11, 12, 14, 15, 17]), Candidate: [3 1 1 0 0 2 0 1 1 1 0 1 0 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 54250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1  0  0  0 -1  0  0  1  0  0 -1  1 -1] (Indices: [1, 2, 3, 4, 6, 8, 9, 10, 11, 15, 16, 17, 19]), Candidate: [3 1 1 0 0 2 0 1 1 1 0 0 1 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 54300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1  0  0 -1  0  1 -1  1  0  0 -1  1 -1] (Indices: [1, 2, 3, 4, 6, 8, 9, 10, 13, 15, 16, 17, 19]), Candidate: [ 3  1  1  0  0  2  0  1  1  1 -1  1  2  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1  0 -1  1 -1  1  0  0 -1  0  1  0 -1] (Indices: [1, 2, 3, 4, 6, 8, 9, 11, 13, 14, 15, 18, 19]), Candidate: [3 1 1 0 0 2 0 1 1 0 1 0 2 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 54400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1 -1  1  0  0  0  0 -1  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 6, 8, 10, 11, 12, 13, 14, 16, 19]), Candidate: [ 3  1  1  0  0  2  0  1  0  2  0  1  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1 -1  1 -1  1  0  0  0  0  0 -1  0  0] (Indices: [1, 2, 3, 4, 6, 8, 10, 12, 13, 14, 15, 16, 17]), Candidate: [ 3  1  1  0  0  2  0  1  0  2 -1  2  1  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1 -1  0  1 -1  1  0  0  0  0 -1  1 -1] (Indices: [1, 2, 3, 4, 6, 8, 11, 13, 14, 15, 16, 17, 19]), Candidate: [3 1 1 0 0 2 0 1 0 1 1 0 2 1 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 54550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  1  0  0 -1  1  0  0  0 -1  1 -1  0] (Indices: [1, 2, 3, 4, 6, 9, 10, 11, 13, 14, 15, 16, 18]), Candidate: [3 1 1 0 0 2 0 0 2 1 0 0 2 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 54600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  1 -1  1  0  0  0  0  0 -1  0  1 -1] (Indices: [1, 2, 3, 4, 6, 9, 11, 12, 13, 14, 15, 16, 19]), Candidate: [3 1 1 0 0 2 0 0 2 0 1 1 1 1 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 54650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  0  1  0  0 -1  1  0  0  0 -1  1 -1] (Indices: [1, 2, 3, 4, 6, 10, 11, 12, 14, 15, 16, 17, 19]), Candidate: [3 1 1 0 0 2 0 0 1 2 0 1 0 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 54700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0  0  0  0  0 -1  1 -1  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 7, 8, 9, 10, 11, 12, 14, 16, 19]), Candidate: [ 3  1  1  0  0  1  2  0  1  1  0  1  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0  0  0 -1  1  0  0  0 -1  1 -1  0  0] (Indices: [1, 2, 3, 4, 7, 8, 9, 10, 12, 13, 14, 15, 17]), Candidate: [ 3  1  1  0  0  1  2  0  1  1 -1  2  1  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0  0  0 -1  0  0  1  0  0  0 -1  1 -1] (Indices: [1, 2, 3, 4, 7, 8, 9, 10, 14, 15, 16, 17, 19]), Candidate: [ 3  1  1  0  0  1  2  0  1  1 -1  1  1  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 54850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0  0 -1  1 -1  1 -1  1  0  0  0 -1  0] (Indices: [1, 2, 3, 4, 7, 8, 9, 11, 13, 15, 16, 17, 18]), Candidate: [3 1 1 0 0 1 2 0 1 0 1 0 2 0 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 54900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0 -1  1  0  0  0 -1  1  0 -1  1 -1  0] (Indices: [1, 2, 3, 4, 7, 8, 10, 11, 12, 13, 15, 16, 18]), Candidate: [3 1 1 0 0 1 2 0 0 2 0 1 1 0 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 54950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0 -1  1 -1  1  0  0  0 -1  0  1  0 -1] (Indices: [1, 2, 3, 4, 7, 8, 10, 12, 13, 14, 15, 18, 19]), Candidate: [ 3  1  1  0  0  1  2  0  0  2 -1  2  1  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0 -1  0  1 -1  0  1  0  0  0  0  0 -1] (Indices: [1, 2, 3, 4, 7, 8, 11, 14, 15, 16, 17, 18, 19]), Candidate: [3 1 1 0 0 1 2 0 0 1 1 0 1 2 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 55050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  1  0  0 -1  1  0 -1  1  0  0 -1  0] (Indices: [1, 2, 3, 4, 7, 9, 10, 11, 13, 14, 16, 17, 18]), Candidate: [ 3  1  1  0  0  1  2 -1  2  1  0  0  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  1 -1  1  0  0  0 -1  1  0 -1  1 -1] (Indices: [1, 2, 3, 4, 7, 9, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 3  1  1  0  0  1  2 -1  2  0  1  1  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  0  1  0 -1  1  0  0  0  0  0 -1  0] (Indices: [1, 2, 3, 4, 7, 10, 11, 13, 14, 15, 16, 17, 18]), Candidate: [ 3  1  1  0  0  1  2 -1  1  2  0  0  2  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1  0  0  0  0 -1  1 -1  1  0  0 -1  0] (Indices: [1, 2, 3, 4, 8, 9, 10, 11, 12, 14, 16, 17, 18]), Candidate: [ 3  1  1  0  0  1  1  1  1  1  0  1  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1  0  0 -1  1 -1  0  1  0  0  0  0 -1] (Indices: [1, 2, 3, 4, 8, 9, 10, 12, 15, 16, 17, 18, 19]), Candidate: [ 3  1  1  0  0  1  1  1  1  1 -1  2  0  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1 -1  1  0  0  0  0 -1  1  0  0 -1  0] (Indices: [1, 2, 3, 4, 8, 10, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 3  1  1  0  0  1  1  1  0  2  0  1  1  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  0  1  0  0  0  0 -1  1  0  0 -1  1 -1] (Indices: [1, 2, 3, 4, 9, 10, 11, 12, 13, 15, 16, 17, 19]), Candidate: [3 1 1 0 0 1 1 0 2 1 0 1 1 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 55400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0  0  0  0  0 -1  1  0 -1  0  0  0  0] (Indices: [1, 2, 3, 5, 6, 7, 8, 9, 10, 11, 12, 14, 15]), Candidate: [ 3  1  1 -1  2  1  1  0  1  1  0  1  0  2  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0  0  0 -1  1  0  0  0 -1  0  0  0  0] (Indices: [1, 2, 3, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15]), Candidate: [ 3  1  1 -1  2  1  1  0  1  1 -1  2  1  1  0  0  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0  0  0 -1  0  1 -1  1 -1  0  1  0 -1] (Indices: [1, 2, 3, 5, 6, 7, 8, 9, 10, 13, 15, 18, 19]), Candidate: [ 3  1  1 -1  2  1  1  0  1  1 -1  1  2  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0  0 -1  1  0 -1  0  1 -1  0  1  0 -1] (Indices: [1, 2, 3, 5, 6, 7, 8, 9, 11, 12, 15, 18, 19]), Candidate: [ 3  1  1 -1  2  1  1  0  1  0  1  1  0  1  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0  0 -1  0  1  0 -1  1  0  0 -1  0  0] (Indices: [1, 2, 3, 5, 6, 7, 8, 9, 12, 13, 15, 16, 17]), Candidate: [ 3  1  1 -1  2  1  1  0  1  0  0  2  1  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0 -1  1  0  0  0  0 -1  0  0  0  1 -1] (Indices: [1, 2, 3, 5, 6, 7, 8, 10, 11, 12, 13, 14, 19]), Candidate: [ 3  1  1 -1  2  1  1  0  0  2  0  1  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0 -1  1  0 -1  1 -1  0  0  1  0  0 -1] (Indices: [1, 2, 3, 5, 6, 7, 8, 10, 11, 13, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  1  1  0  0  2  0  0  2  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0 -1  1 -1  1 -1  0  0  1  0  0  0 -1] (Indices: [1, 2, 3, 5, 6, 7, 8, 10, 12, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  1  1  0  0  2 -1  2  0  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0 -1  0  1  0 -1  1 -1  1 -1  1  0 -1] (Indices: [1, 2, 3, 5, 6, 7, 8, 11, 12, 14, 16, 18, 19]), Candidate: [ 3  1  1 -1  2  1  1  0  0  1  1  1  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 55850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0 -1  0  0  0  1  0  0  0  0 -1  1 -1] (Indices: [1, 2, 3, 5, 6, 7, 8, 13, 14, 15, 16, 17, 19]), Candidate: [ 3  1  1 -1  2  1  1  0  0  1  0  1  2  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 55900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  1  0  0 -1  1  0 -1  0  0  1  0 -1] (Indices: [1, 2, 3, 5, 6, 7, 9, 10, 11, 13, 14, 18, 19]), Candidate: [ 3  1  1 -1  2  1  1 -1  2  1  0  0  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 55950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  1  0 -1  1 -1  1  0 -1  1 -1  1 -1] (Indices: [1, 2, 3, 5, 6, 7, 9, 10, 12, 14, 15, 17, 19]), Candidate: [ 3  1  1 -1  2  1  1 -1  2  1 -1  2  0  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 56000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  1 -1  1  0  0 -1  0  1 -1  1  0 -1] (Indices: [1, 2, 3, 5, 6, 7, 9, 11, 12, 13, 16, 18, 19]), Candidate: [ 3  1  1 -1  2  1  1 -1  2  0  1  1  1  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  1 -1  0  1  0 -1  1  0 -1  1  0 -1] (Indices: [1, 2, 3, 5, 6, 7, 9, 12, 13, 15, 16, 18, 19]), Candidate: [ 3  1  1 -1  2  1  1 -1  2  0  0  2  1  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  0  1  0  0 -1  0  0  1  0  0  0 -1] (Indices: [1, 2, 3, 5, 6, 7, 10, 11, 12, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  1  1 -1  1  2  0  1  0  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  0  0  1  0  0  0  0  0  0 -1  0  0] (Indices: [1, 2, 3, 5, 6, 7, 11, 12, 13, 14, 15, 16, 17]), Candidate: [ 3  1  1 -1  2  1  1 -1  1  1  1  1  1  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1  0  0  0  0  0 -1  0  0  0  1  0 -1] (Indices: [1, 2, 3, 5, 6, 8, 9, 10, 11, 12, 13, 18, 19]), Candidate: [ 3  1  1 -1  2  1  0  1  1  1  0  1  1  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1  0  0  0 -1  0  1 -1  0  1  0  0 -1] (Indices: [1, 2, 3, 5, 6, 8, 9, 10, 11, 14, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  1  0  1  1  1  0  0  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1  0  0 -1  0  1  0 -1  0  1  0  0 -1] (Indices: [1, 2, 3, 5, 6, 8, 9, 10, 13, 14, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  1  0  1  1  1 -1  1  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 56350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1  0 -1  1 -1  1  0  0 -1  1  0 -1  0] (Indices: [1, 2, 3, 5, 6, 8, 9, 11, 13, 14, 15, 17, 18]), Candidate: [ 3  1  1 -1  2  1  0  1  1  0  1  0  2  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1 -1  1  0  0  0  0 -1  1  0 -1  0  0] (Indices: [1, 2, 3, 5, 6, 8, 10, 11, 12, 13, 14, 16, 17]), Candidate: [ 3  1  1 -1  2  1  0  1  0  2  0  1  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1 -1  1  0 -1  0  1 -1  1  0  0  0 -1] (Indices: [1, 2, 3, 5, 6, 8, 10, 11, 14, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  1  0  1  0  2  0  0  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1 -1  0  1  0 -1  0  1  0  0  0  0 -1] (Indices: [1, 2, 3, 5, 6, 8, 11, 12, 15, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  1  0  1  0  1  1  1  0  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  1  0  0  0 -1  0  0  1  0  0  0 -1] (Indices: [1, 2, 3, 5, 6, 9, 10, 11, 12, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  1  0  0  2  1  0  1  0  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  1 -1  1  0  0  0  0  0  0 -1  0  0] (Indices: [1, 2, 3, 5, 6, 9, 11, 12, 13, 14, 15, 16, 17]), Candidate: [ 3  1  1 -1  2  1  0  0  2  0  1  1  1  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  0  1  0  0  0 -1  0  1  0  0  0 -1] (Indices: [1, 2, 3, 5, 6, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  1  0  0  1  2  0  1  1  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0  0  0  0  0 -1  1 -1  1  0 -1  0  0] (Indices: [1, 2, 3, 5, 7, 8, 9, 10, 11, 12, 14, 16, 17]), Candidate: [ 3  1  1 -1  2  0  2  0  1  1  0  1  0  2 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0  0  0  0 -1  0  0  0  1  0  0  0 -1] (Indices: [1, 2, 3, 5, 7, 8, 9, 10, 11, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  0  2  0  1  1  0  0  1  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 56800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0  0  0 -1  0  1 -1  0  1  0  0  0 -1] (Indices: [1, 2, 3, 5, 7, 8, 9, 10, 13, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  0  2  0  1  1 -1  1  2  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0  0 -1  1 -1  1  0 -1  1 -1  1  0 -1] (Indices: [1, 2, 3, 5, 7, 8, 9, 11, 13, 14, 16, 18, 19]), Candidate: [ 3  1  1 -1  2  0  2  0  1  0  1  0  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0 -1  1  0  0  0  0 -1  0  0  1  0 -1] (Indices: [1, 2, 3, 5, 7, 8, 10, 11, 12, 13, 14, 18, 19]), Candidate: [ 3  1  1 -1  2  0  2  0  0  2  0  1  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 56950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0 -1  1 -1  1  0  0  0 -1  1  0 -1  0] (Indices: [1, 2, 3, 5, 7, 8, 10, 12, 13, 14, 15, 17, 18]), Candidate: [ 3  1  1 -1  2  0  2  0  0  2 -1  2  1  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0 -1  0  1 -1  1  0 -1  1  0  0  0 -1] (Indices: [1, 2, 3, 5, 7, 8, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  0  2  0  0  1  1  0  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  1  0  0 -1  1  0  0 -1  1 -1  1 -1] (Indices: [1, 2, 3, 5, 7, 9, 10, 11, 13, 14, 15, 17, 19]), Candidate: [ 3  1  1 -1  2  0  2 -1  2  1  0  0  2  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  1 -1  1  0  0  0  0 -1  0  1  0 -1] (Indices: [1, 2, 3, 5, 7, 9, 11, 12, 13, 14, 15, 18, 19]), Candidate: [ 3  1  1 -1  2  0  2 -1  2  0  1  1  1  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  0  1  0  0 -1  1 -1  1  0  0  0 -1] (Indices: [1, 2, 3, 5, 7, 10, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  0  2 -1  1  2  0  1  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 57200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1  0  0  0  0 -1  1  0 -1  1 -1  1 -1] (Indices: [1, 2, 3, 5, 8, 9, 10, 11, 12, 14, 15, 17, 19]), Candidate: [ 3  1  1 -1  2  0  1  1  1  1  0  1  0  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1  0  0 -1  1 -1  1  0 -1  1  0  0 -1] (Indices: [1, 2, 3, 5, 8, 9, 10, 12, 14, 15, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  0  1  1  1  1 -1  2  0  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1 -1  1  0  0  0  0  0 -1  1 -1  1 -1] (Indices: [1, 2, 3, 5, 8, 10, 11, 12, 13, 14, 15, 17, 19]), Candidate: [ 3  1  1 -1  2  0  1  1  0  2  0  1  1  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  0  1  0  0  0  0  0 -1  0  1  0  0 -1] (Indices: [1, 2, 3, 5, 9, 10, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  0  1  0  2  1  0  1  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0  0  0  0  0  0  0 -1  0  0  0  1 -1] (Indices: [1, 2, 3, 6, 7, 8, 9, 10, 11, 12, 13, 14, 19]), Candidate: [ 3  1  1 -1  1  2  1  0  1  1  0  1  1  1 -1  1  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0  0  0  0 -1  1 -1  0  0  1  0  0 -1] (Indices: [1, 2, 3, 6, 7, 8, 9, 10, 11, 13, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  2  1  0  1  1  0  0  2  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0  0  0 -1  1 -1  0  0  1  0  0  0 -1] (Indices: [1, 2, 3, 6, 7, 8, 9, 10, 12, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  2  1  0  1  1 -1  2  0  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0  0 -1  1  0 -1  1 -1  1 -1  1  0 -1] (Indices: [1, 2, 3, 6, 7, 8, 9, 11, 12, 14, 16, 18, 19]), Candidate: [ 3  1  1 -1  1  2  1  0  1  0  1  1  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0  0 -1  0  0  1  0  0  0  0 -1  1 -1] (Indices: [1, 2, 3, 6, 7, 8, 9, 13, 14, 15, 16, 17, 19]), Candidate: [ 3  1  1 -1  1  2  1  0  1  0  0  1  2  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0 -1  1  0 -1  1  0 -1  0  1  0  0 -1] (Indices: [1, 2, 3, 6, 7, 8, 10, 11, 13, 14, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  2  1  0  0  2  0  0  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0 -1  0  1  0  0 -1  1  0  0  0 -1  0] (Indices: [1, 2, 3, 6, 7, 8, 11, 12, 13, 15, 16, 17, 18]), Candidate: [ 3  1  1 -1  1  2  1  0  0  1  1  1  1  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 57750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  1  0  0  0 -1  1  0 -1  1 -1  1 -1] (Indices: [1, 2, 3, 6, 7, 9, 10, 11, 12, 14, 15, 17, 19]), Candidate: [ 3  1  1 -1  1  2  1 -1  2  1  0  1  0  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  1  0 -1  1 -1  1  0 -1  1  0  0 -1] (Indices: [1, 2, 3, 6, 7, 9, 10, 12, 14, 15, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  2  1 -1  2  1 -1  2  0  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 57850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  0  1  0  0  0  0  0 -1  1 -1  1 -1] (Indices: [1, 2, 3, 6, 7, 10, 11, 12, 13, 14, 15, 17, 19]), Candidate: [ 3  1  1 -1  1  2  1 -1  1  2  0  1  1  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1  0  0  0  0  0  0 -1  0  0  1  0 -1] (Indices: [1, 2, 3, 6, 8, 9, 10, 11, 12, 13, 14, 18, 19]), Candidate: [ 3  1  1 -1  1  2  0  1  1  1  0  1  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 57950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1  0  0 -1  1  0  0  0 -1  1  0 -1  0] (Indices: [1, 2, 3, 6, 8, 9, 10, 12, 13, 14, 15, 17, 18]), Candidate: [ 3  1  1 -1  1  2  0  1  1  1 -1  2  1  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1  0 -1  1 -1  1  0 -1  1  0  0  0 -1] (Indices: [1, 2, 3, 6, 8, 9, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  2  0  1  1  0  1  0  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1 -1  0  1  0  0  0  0 -1  1  0  0 -1] (Indices: [1, 2, 3, 6, 8, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  2  0  1  0  1  1  1  1  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  0  1 -1  0  1  0  0  0  0  0  0  0 -1] (Indices: [1, 2, 3, 6, 9, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  2  0  0  2  0  0  2  1  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0  0  0  0 -1  1  0  0 -1  1 -1  1 -1] (Indices: [1, 2, 3, 7, 8, 9, 10, 11, 13, 14, 15, 17, 19]), Candidate: [ 3  1  1 -1  1  1  2  0  1  1  0  0  2  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0  0 -1  1  0  0  0  0 -1  0  1  0 -1] (Indices: [1, 2, 3, 7, 8, 9, 11, 12, 13, 14, 15, 18, 19]), Candidate: [ 3  1  1 -1  1  1  2  0  1  0  1  1  1  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0 -1  1  0  0 -1  1 -1  1  0  0  0 -1] (Indices: [1, 2, 3, 7, 8, 10, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  1  2  0  0  2  0  1  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1 -1  1  0  0 -1  1  0  0 -1  1  0  0 -1] (Indices: [1, 2, 3, 7, 9, 10, 11, 13, 14, 15, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  1  2 -1  2  1  0  0  2  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  1  0  0  0  0 -1  1 -1  1  0  0  0 -1] (Indices: [1, 2, 3, 8, 9, 10, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  1  1  1  1  1  0  1  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0  0  0  0  0  0 -1  0  0  1 -1  0  0] (Indices: [1, 2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 17]), Candidate: [3 1 0 1 1 1 1 0 1 1 0 1 1 0 0 1 2 0 1 6]
 -> Valid neighbor added.
Attempt 58450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0  0  0  0 -1  0  0  0  1  0 -1  1 -1] (Indices: [1, 2, 4, 5, 6, 7, 8, 9, 10, 11, 16, 17, 19]), Candidate: [3 1 0 1 1 1 1 0 1 1 0 0 1 1 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 58500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0  0  0 -1  0  1 -1  1  0 -1  0  1 -1] (Indices: [1, 2, 4, 5, 6, 7, 8, 9, 10, 13, 15, 16, 19]), Candidate: [ 3  1  0  1  1  1  1  0  1  1 -1  1  2  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0  0 -1  1  0 -1  0  1  0 -1  0  1 -1] (Indices: [1, 2, 4, 5, 6, 7, 8, 9, 11, 12, 15, 16, 19]), Candidate: [3 1 0 1 1 1 1 0 1 0 1 1 0 1 1 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 58600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0  0 -1  0  1  0  0 -1  0  1  0 -1  0] (Indices: [1, 2, 4, 5, 6, 7, 8, 9, 12, 13, 14, 17, 18]), Candidate: [ 3  1  0  1  1  1  1  0  1  0  0  2  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0 -1  1  0  0  0  0 -1  1 -1  0  0  0] (Indices: [1, 2, 4, 5, 6, 7, 8, 10, 11, 12, 13, 14, 16]), Candidate: [ 3  1  0  1  1  1  1  0  0  2  0  1  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0 -1  1  0 -1  1 -1  0  1  0  0 -1  0] (Indices: [1, 2, 4, 5, 6, 7, 8, 10, 11, 13, 16, 17, 18]), Candidate: [3 1 0 1 1 1 1 0 0 2 0 0 2 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 58750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0 -1  1 -1  1 -1  0  1  0  0 -1  1 -1] (Indices: [1, 2, 4, 5, 6, 7, 8, 10, 12, 15, 16, 17, 19]), Candidate: [ 3  1  0  1  1  1  1  0  0  2 -1  2  0  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0 -1  0  1  0 -1  1  0 -1  0  1  0 -1] (Indices: [1, 2, 4, 5, 6, 7, 8, 11, 12, 14, 15, 18, 19]), Candidate: [3 1 0 1 1 1 1 0 0 1 1 1 0 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 58850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0 -1  0  0  1 -1  1 -1  1  0  0  0 -1] (Indices: [1, 2, 4, 5, 6, 7, 8, 12, 14, 16, 17, 18, 19]), Candidate: [ 3  1  0  1  1  1  1  0  0  1  0  2  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 58900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  1  0  0 -1  1  0 -1  1 -1  0  1 -1] (Indices: [1, 2, 4, 5, 6, 7, 9, 10, 11, 13, 14, 16, 19]), Candidate: [ 3  1  0  1  1  1  1 -1  2  1  0  0  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 58950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  1  0 -1  1 -1  1  0  0 -1  1 -1  0] (Indices: [1, 2, 4, 5, 6, 7, 9, 10, 12, 14, 15, 16, 18]), Candidate: [ 3  1  0  1  1  1  1 -1  2  1 -1  2  0  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 59000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  1 -1  1  0  0 -1  1 -1  0  1  0 -1] (Indices: [1, 2, 4, 5, 6, 7, 9, 11, 12, 13, 15, 18, 19]), Candidate: [ 3  1  0  1  1  1  1 -1  2  0  1  1  1  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  1 -1  0  1  0  0 -1  0  1  0  0 -1] (Indices: [1, 2, 4, 5, 6, 7, 9, 12, 13, 14, 17, 18, 19]), Candidate: [ 3  1  0  1  1  1  1 -1  2  0  0  2  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 59100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  0  1  0  0 -1  0  1  0  0 -1  1 -1] (Indices: [1, 2, 4, 5, 6, 7, 10, 11, 12, 15, 16, 17, 19]), Candidate: [ 3  1  0  1  1  1  1 -1  1  2  0  1  0  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  0  1 -1  0  1  0 -1  1  0  0  0 -1] (Indices: [1, 2, 4, 5, 6, 7, 10, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  1  0  1  1  1  1 -1  1  2 -1  1  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 59200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1  0  0  0  0  0 -1  0  1 -1  0  1 -1] (Indices: [1, 2, 4, 5, 6, 8, 9, 10, 11, 12, 13, 16, 19]), Candidate: [3 1 0 1 1 1 0 1 1 1 0 1 1 0 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 59250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1  0  0  0 -1  0  1 -1  1  0  0 -1  0] (Indices: [1, 2, 4, 5, 6, 8, 9, 10, 11, 14, 16, 17, 18]), Candidate: [ 3  1  0  1  1  1  0  1  1  1  0  0  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1  0  0 -1  0  1  0 -1  1  0  0 -1  0] (Indices: [1, 2, 4, 5, 6, 8, 9, 10, 13, 14, 16, 17, 18]), Candidate: [ 3  1  0  1  1  1  0  1  1  1 -1  1  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 59350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1  0 -1  1 -1  1  0  0  0  0 -1  0  0] (Indices: [1, 2, 4, 5, 6, 8, 9, 11, 13, 14, 15, 16, 17]), Candidate: [3 1 0 1 1 1 0 1 1 0 1 0 2 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 59400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1 -1  1  0  0  0  0  0 -1  1 -1  0  0] (Indices: [1, 2, 4, 5, 6, 8, 10, 11, 12, 13, 14, 15, 17]), Candidate: [3 1 0 1 1 1 0 1 0 2 0 1 1 1 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 59450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1 -1  1  0 -1  0  1  0  0  0 -1  1 -1] (Indices: [1, 2, 4, 5, 6, 8, 10, 11, 14, 15, 16, 17, 19]), Candidate: [3 1 0 1 1 1 0 1 0 2 0 0 1 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 59500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1 -1  0  1  0 -1  1  0  0 -1  1  0 -1] (Indices: [1, 2, 4, 5, 6, 8, 11, 12, 14, 15, 16, 18, 19]), Candidate: [3 1 0 1 1 1 0 1 0 1 1 1 0 2 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 59550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  1  0  0  0 -1  0  1  0  0 -1  1 -1] (Indices: [1, 2, 4, 5, 6, 9, 10, 11, 12, 15, 16, 17, 19]), Candidate: [3 1 0 1 1 1 0 0 2 1 0 1 0 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 59600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  1  0 -1  0  1  0 -1  1  0  0  0 -1] (Indices: [1, 2, 4, 5, 6, 9, 10, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  1  0  1  1  1  0  0  2  1 -1  1  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 59650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  0  1  0  0  0 -1  1  0  0 -1  1 -1] (Indices: [1, 2, 4, 5, 6, 10, 11, 12, 13, 15, 16, 17, 19]), Candidate: [3 1 0 1 1 1 0 0 1 2 0 1 1 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 59700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0  0  0  0  0 -1  1  0 -1  1 -1  0  0] (Indices: [1, 2, 4, 5, 7, 8, 9, 10, 11, 12, 14, 15, 17]), Candidate: [3 1 0 1 1 0 2 0 1 1 0 1 0 2 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 59750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0  0  0  0 -1  0  0  1  0  0 -1  1 -1] (Indices: [1, 2, 4, 5, 7, 8, 9, 10, 11, 15, 16, 17, 19]), Candidate: [3 1 0 1 1 0 2 0 1 1 0 0 1 1 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 59800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0  0  0 -1  0  1 -1  1  0  0 -1  1 -1] (Indices: [1, 2, 4, 5, 7, 8, 9, 10, 13, 15, 16, 17, 19]), Candidate: [ 3  1  0  1  1  0  2  0  1  1 -1  1  2  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0  0 -1  1 -1  1  0  0 -1  0  1  0 -1] (Indices: [1, 2, 4, 5, 7, 8, 9, 11, 13, 14, 15, 18, 19]), Candidate: [3 1 0 1 1 0 2 0 1 0 1 0 2 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 59900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0 -1  1  0  0  0  0 -1  1 -1  0  1 -1] (Indices: [1, 2, 4, 5, 7, 8, 10, 11, 12, 13, 14, 16, 19]), Candidate: [ 3  1  0  1  1  0  2  0  0  2  0  1  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 59950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0 -1  1 -1  1  0  0  0  0  0 -1  0  0] (Indices: [1, 2, 4, 5, 7, 8, 10, 12, 13, 14, 15, 16, 17]), Candidate: [ 3  1  0  1  1  0  2  0  0  2 -1  2  1  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0 -1  0  1 -1  1  0  0  0  0 -1  1 -1] (Indices: [1, 2, 4, 5, 7, 8, 11, 13, 14, 15, 16, 17, 19]), Candidate: [3 1 0 1 1 0 2 0 0 1 1 0 2 1 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 60050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  1  0  0 -1  1  0  0  0 -1  1 -1  0] (Indices: [1, 2, 4, 5, 7, 9, 10, 11, 13, 14, 15, 16, 18]), Candidate: [ 3  1  0  1  1  0  2 -1  2  1  0  0  2  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  1 -1  1  0  0  0  0  0 -1  0  1 -1] (Indices: [1, 2, 4, 5, 7, 9, 11, 12, 13, 14, 15, 16, 19]), Candidate: [ 3  1  0  1  1  0  2 -1  2  0  1  1  1  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  0  1  0  0 -1  1  0  0  0 -1  1 -1] (Indices: [1, 2, 4, 5, 7, 10, 11, 12, 14, 15, 16, 17, 19]), Candidate: [ 3  1  0  1  1  0  2 -1  1  2  0  1  0  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1  0  0  0  0 -1  1  0  0 -1  1 -1  0] (Indices: [1, 2, 4, 5, 8, 9, 10, 11, 12, 14, 15, 16, 18]), Candidate: [3 1 0 1 1 0 1 1 1 1 0 1 0 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 60250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1  0  0 -1  1 -1  1  0  0  0  0 -1  0] (Indices: [1, 2, 4, 5, 8, 9, 10, 12, 14, 15, 16, 17, 18]), Candidate: [ 3  1  0  1  1  0  1  1  1  1 -1  2  0  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1 -1  1  0  0  0  0  0  0 -1  1 -1  0] (Indices: [1, 2, 4, 5, 8, 10, 11, 12, 13, 14, 15, 16, 18]), Candidate: [3 1 0 1 1 0 1 1 0 2 0 1 1 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 60350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  1  0  0  0  0  0 -1  1  0  0 -1  0] (Indices: [1, 2, 4, 5, 9, 10, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 3  1  0  1  1  0  1  0  2  1  0  1  1  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0  0  0  0  0  0  0 -1  1 -1  0  0  0] (Indices: [1, 2, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 16]), Candidate: [ 3  1  0  1  0  2  1  0  1  1  0  1  1  1 -1  2  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0  0  0  0 -1  1 -1  0  1  0  0 -1  0] (Indices: [1, 2, 4, 6, 7, 8, 9, 10, 11, 13, 16, 17, 18]), Candidate: [3 1 0 1 0 2 1 0 1 1 0 0 2 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 60500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0  0  0 -1  1 -1  0  1  0  0 -1  1 -1] (Indices: [1, 2, 4, 6, 7, 8, 9, 10, 12, 15, 16, 17, 19]), Candidate: [ 3  1  0  1  0  2  1  0  1  1 -1  2  0  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0  0 -1  1  0 -1  1  0 -1  0  1  0 -1] (Indices: [1, 2, 4, 6, 7, 8, 9, 11, 12, 14, 15, 18, 19]), Candidate: [3 1 0 1 0 2 1 0 1 0 1 1 0 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 60600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0  0 -1  0  1 -1  1 -1  1  0  0  0 -1] (Indices: [1, 2, 4, 6, 7, 8, 9, 12, 14, 16, 17, 18, 19]), Candidate: [ 3  1  0  1  0  2  1  0  1  0  0  2  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0 -1  1  0 -1  1  0 -1  1  0  0 -1  0] (Indices: [1, 2, 4, 6, 7, 8, 10, 11, 13, 14, 16, 17, 18]), Candidate: [ 3  1  0  1  0  2  1  0  0  2  0  0  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0 -1  0  1  0  0  0 -1  1  0 -1  1 -1] (Indices: [1, 2, 4, 6, 7, 8, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 3  1  0  1  0  2  1  0  0  1  1  1  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  1  0  0  0 -1  1  0  0 -1  1 -1  0] (Indices: [1, 2, 4, 6, 7, 9, 10, 11, 12, 14, 15, 16, 18]), Candidate: [ 3  1  0  1  0  2  1 -1  2  1  0  1  0  2  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  1  0 -1  1 -1  1  0  0  0  0 -1  0] (Indices: [1, 2, 4, 6, 7, 9, 10, 12, 14, 15, 16, 17, 18]), Candidate: [ 3  1  0  1  0  2  1 -1  2  1 -1  2  0  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 60850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  0  1  0  0  0  0  0  0 -1  1 -1  0] (Indices: [1, 2, 4, 6, 7, 10, 11, 12, 13, 14, 15, 16, 18]), Candidate: [ 3  1  0  1  0  2  1 -1  1  2  0  1  1  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1  0  0  0  0  0  0 -1  1 -1  0  1 -1] (Indices: [1, 2, 4, 6, 8, 9, 10, 11, 12, 13, 14, 16, 19]), Candidate: [ 3  1  0  1  0  2  0  1  1  1  0  1  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 60950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1  0  0 -1  1  0  0  0  0  0 -1  0  0] (Indices: [1, 2, 4, 6, 8, 9, 10, 12, 13, 14, 15, 16, 17]), Candidate: [ 3  1  0  1  0  2  0  1  1  1 -1  2  1  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1  0 -1  1 -1  1  0  0  0  0 -1  1 -1] (Indices: [1, 2, 4, 6, 8, 9, 11, 13, 14, 15, 16, 17, 19]), Candidate: [3 1 0 1 0 2 0 1 1 0 1 0 2 1 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 61050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1 -1  0  1  0  0  0  0  0  0  0 -1  0] (Indices: [1, 2, 4, 6, 8, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [3 1 0 1 0 2 0 1 0 1 1 1 1 1 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 61100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  0  1 -1  1  0  0 -1  1  0  0  0  0 -1] (Indices: [1, 2, 4, 6, 9, 11, 12, 13, 15, 16, 17, 18, 19]), Candidate: [3 1 0 1 0 2 0 0 2 0 1 1 1 0 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 61150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0  0  0  0 -1  1  0  0  0 -1  1 -1  0] (Indices: [1, 2, 4, 7, 8, 9, 10, 11, 13, 14, 15, 16, 18]), Candidate: [3 1 0 1 0 1 2 0 1 1 0 0 2 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 61200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0  0 -1  1  0  0  0  0  0 -1  0  1 -1] (Indices: [1, 2, 4, 7, 8, 9, 11, 12, 13, 14, 15, 16, 19]), Candidate: [3 1 0 1 0 1 2 0 1 0 1 1 1 1 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 61250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0 -1  1  0  0 -1  1  0  0  0 -1  1 -1] (Indices: [1, 2, 4, 7, 8, 10, 11, 12, 14, 15, 16, 17, 19]), Candidate: [3 1 0 1 0 1 2 0 0 2 0 1 0 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 61300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  1  0  0 -1  1  0  0  0  0  0 -1  0] (Indices: [1, 2, 4, 7, 9, 10, 11, 13, 14, 15, 16, 17, 18]), Candidate: [ 3  1  0  1  0  1  2 -1  2  1  0  0  2  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  0  1  0  0  0  0 -1  1  0  0  0 -1  1 -1] (Indices: [1, 2, 4, 8, 9, 10, 11, 12, 14, 15, 16, 17, 19]), Candidate: [3 1 0 1 0 1 1 1 1 1 0 1 0 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 61400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0  0  0  0  0  0  0  0 -1  0  0  0  0] (Indices: [1, 2, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15]), Candidate: [3 1 0 0 2 1 1 0 1 1 0 1 1 1 0 0 1 1 1 6]
 -> Valid neighbor added.
Attempt 61450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0  0  0  0 -1  1 -1  1 -1  0  1  0 -1] (Indices: [1, 2, 5, 6, 7, 8, 9, 10, 11, 13, 15, 18, 19]), Candidate: [3 1 0 0 2 1 1 0 1 1 0 0 2 0 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 61500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0  0  0 -1  1 -1  0  1  0  0  0 -1  0] (Indices: [1, 2, 5, 6, 7, 8, 9, 10, 12, 15, 16, 17, 18]), Candidate: [ 3  1  0  0  2  1  1  0  1  1 -1  2  0  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0  0 -1  1  0 -1  1  0 -1  1 -1  1 -1] (Indices: [1, 2, 5, 6, 7, 8, 9, 11, 12, 14, 15, 17, 19]), Candidate: [3 1 0 0 2 1 1 0 1 0 1 1 0 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 61600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0  0 -1  0  1 -1  1  0 -1  1  0  0 -1] (Indices: [1, 2, 5, 6, 7, 8, 9, 12, 14, 15, 17, 18, 19]), Candidate: [3 1 0 0 2 1 1 0 1 0 0 2 0 2 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 61650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0 -1  1  0 -1  1  0  0 -1  0  1  0 -1] (Indices: [1, 2, 5, 6, 7, 8, 10, 11, 13, 14, 15, 18, 19]), Candidate: [3 1 0 0 2 1 1 0 0 2 0 0 2 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 61700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0 -1  0  1  0  0  0 -1  1  0  0 -1  0] (Indices: [1, 2, 5, 6, 7, 8, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 3  1  0  0  2  1  1  0  0  1  1  1  1  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  1  0  0  0 -1  1  0  0  0 -1  0  0] (Indices: [1, 2, 5, 6, 7, 9, 10, 11, 12, 14, 15, 16, 17]), Candidate: [ 3  1  0  0  2  1  1 -1  2  1  0  1  0  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  1  0 -1  1  0 -1  0  1  0  0  0 -1] (Indices: [1, 2, 5, 6, 7, 9, 10, 12, 13, 16, 17, 18, 19]), Candidate: [ 3  1  0  0  2  1  1 -1  2  1 -1  2  1  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 61850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  0  1  0  0  0  0  0  0  0 -1  0  0] (Indices: [1, 2, 5, 6, 7, 10, 11, 12, 13, 14, 15, 16, 17]), Candidate: [ 3  1  0  0  2  1  1 -1  1  2  0  1  1  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1  0  0  0  0  0  0 -1  1 -1  1 -1  0] (Indices: [1, 2, 5, 6, 8, 9, 10, 11, 12, 13, 14, 16, 18]), Candidate: [ 3  1  0  0  2  1  0  1  1  1  0  1  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 61950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1  0  0  0 -1  0  0  1  0  0  0  0 -1] (Indices: [1, 2, 5, 6, 8, 9, 10, 11, 15, 16, 17, 18, 19]), Candidate: [3 1 0 0 2 1 0 1 1 1 0 0 1 1 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 62000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1  0 -1  1 -1  1  0  0  0  0  0 -1  0] (Indices: [1, 2, 5, 6, 8, 9, 11, 13, 14, 15, 16, 17, 18]), Candidate: [3 1 0 0 2 1 0 1 1 0 1 0 2 1 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 62050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1 -1  1 -1  0  1  0  0  0  0  0  0 -1] (Indices: [1, 2, 5, 6, 8, 10, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  1  0  0  2  1  0  1  0  2 -1  1  2  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  1 -1  1  0  0  0 -1  1  0  0  0 -1] (Indices: [1, 2, 5, 6, 9, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  1  0  0  2  1  0  0  2  0  1  1  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0  0  0  0 -1  1  0  0  0  0 -1  0  0] (Indices: [1, 2, 5, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17]), Candidate: [3 1 0 0 2 0 2 0 1 1 0 0 2 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 62200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0  0 -1  1  0  0  0  0  0 -1  1 -1  0] (Indices: [1, 2, 5, 7, 8, 9, 11, 12, 13, 14, 15, 16, 18]), Candidate: [3 1 0 0 2 0 2 0 1 0 1 1 1 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 62250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0 -1  1  0  0 -1  1  0  0  0  0 -1  0] (Indices: [1, 2, 5, 7, 8, 10, 11, 12, 14, 15, 16, 17, 18]), Candidate: [3 1 0 0 2 0 2 0 0 2 0 1 0 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 62300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1 -1  1  0  0  0 -1  0  1  0  0  0  0 -1] (Indices: [1, 2, 5, 7, 9, 10, 11, 12, 15, 16, 17, 18, 19]), Candidate: [ 3  1  0  0  2  0  2 -1  2  1  0  1  0  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  1  0  0  0  0 -1  1  0  0  0  0 -1  0] (Indices: [1, 2, 5, 8, 9, 10, 11, 12, 14, 15, 16, 17, 18]), Candidate: [3 1 0 0 2 0 1 1 1 1 0 1 0 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 62400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  0  0  0  1  0  0  0  0  0  0  0  0  0 -1] (Indices: [1, 2, 5, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [3 1 0 0 2 0 1 0 1 2 0 1 1 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 62450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0  0  0  0 -1  1 -1  0  1  0  0  0 -1] (Indices: [1, 2, 6, 7, 8, 9, 10, 11, 13, 16, 17, 18, 19]), Candidate: [3 1 0 0 1 2 1 0 1 1 0 0 2 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 62500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0  0 -1  1  0 -1  1  0  0  0  0 -1  0] (Indices: [1, 2, 6, 7, 8, 9, 11, 12, 14, 15, 16, 17, 18]), Candidate: [3 1 0 0 1 2 1 0 1 0 1 1 0 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 62550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0 -1  1 -1  1  0  0  0  0  0 -1  1 -1] (Indices: [1, 2, 6, 7, 8, 10, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 3  1  0  0  1  2  1  0  0  2 -1  2  1  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0 -1  1  0 -1  1 -1  1  0  0  0  0  0 -1] (Indices: [1, 2, 6, 7, 9, 10, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  1  0  0  1  2  1 -1  2  1 -1  2  0  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 62650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1  0  0 -1  1  0  0  0  0  0 -1  1 -1] (Indices: [1, 2, 6, 8, 9, 10, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 3  1  0  0  1  2  0  1  1  1 -1  2  1  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1  0  0  0  0  0  0 -1  1 -1  1  0  0 -1] (Indices: [1, 2, 7, 8, 9, 10, 11, 12, 13, 15, 17, 18, 19]), Candidate: [3 1 0 0 1 1 2 0 1 1 0 1 1 0 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 62750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  0  1 -1  1  0 -1  1  0  0  0  0  0  0  0 -1] (Indices: [1, 2, 7, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  1  0  0  1  1  2 -1  2  1 -1  2  1  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 62800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0  0  0  0 -1  1 -1  0  0  0  1  0 -1] (Indices: [1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 18, 19]), Candidate: [3 0 2 0 1 1 1 0 1 1 0 0 2 0 0 1 1 2 1 5]
 -> Valid neighbor added.
Attempt 62850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0  0  0 -1  1 -1  0  1 -1  1 -1  1 -1] (Indices: [1, 3, 4, 5, 6, 7, 8, 9, 10, 12, 15, 17, 19]), Candidate: [ 3  0  2  0  1  1  1  0  1  1 -1  2  0  1  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 62900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0  0 -1  1  0  0 -1  0  1  0 -1  0  0] (Indices: [1, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 16, 17]), Candidate: [3 0 2 0 1 1 1 0 1 0 1 1 1 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 62950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0  0 -1  1 -1  0  1  0 -1  1 -1  1 -1] (Indices: [1, 3, 4, 5, 6, 7, 8, 9, 11, 14, 15, 17, 19]), Candidate: [3 0 2 0 1 1 1 0 1 0 1 0 1 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 63000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0  0 -1  0  0  1  0  0 -1  1 -1  1 -1] (Indices: [1, 3, 4, 5, 6, 7, 8, 9, 13, 14, 15, 17, 19]), Candidate: [3 0 2 0 1 1 1 0 1 0 0 1 2 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 63050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0 -1  1  0  0 -1  0  0  1 -1  1  0 -1] (Indices: [1, 3, 4, 5, 6, 7, 8, 10, 11, 12, 16, 18, 19]), Candidate: [3 0 2 0 1 1 1 0 0 2 0 1 0 1 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 63100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0 -1  1 -1  1  0 -1  1 -1  1  0 -1  0] (Indices: [1, 3, 4, 5, 6, 7, 8, 10, 12, 13, 15, 17, 18]), Candidate: [ 3  0  2  0  1  1  1  0  0  2 -1  2  1  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0 -1  0  1  0  0  0 -1  0  1  0 -1  0] (Indices: [1, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 17, 18]), Candidate: [ 3  0  2  0  1  1  1  0  0  1  1  1  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0 -1  0  0  1  0  0  0  0 -1  1 -1  0] (Indices: [1, 3, 4, 5, 6, 7, 8, 12, 13, 14, 15, 16, 18]), Candidate: [3 0 2 0 1 1 1 0 0 1 0 2 1 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 63250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  1  0  0  0 -1  1 -1  0  1 -1  1 -1] (Indices: [1, 3, 4, 5, 6, 7, 9, 10, 11, 12, 14, 17, 19]), Candidate: [ 3  0  2  0  1  1  1 -1  2  1  0  1  0  2 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 63300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  1  0 -1  1  0  0  0 -1  0  0  1 -1] (Indices: [1, 3, 4, 5, 6, 7, 9, 10, 12, 13, 14, 15, 19]), Candidate: [ 3  0  2  0  1  1  1 -1  2  1 -1  2  1  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 63350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  1  0 -1  0  0  1  0 -1  1  0  0 -1] (Indices: [1, 3, 4, 5, 6, 7, 9, 10, 14, 15, 17, 18, 19]), Candidate: [ 3  0  2  0  1  1  1 -1  2  1 -1  1  1  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 63400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  1 -1  1 -1  1 -1  1  0 -1  1  0 -1] (Indices: [1, 3, 4, 5, 6, 7, 9, 11, 13, 15, 16, 18, 19]), Candidate: [ 3  0  2  0  1  1  1 -1  2  0  1  0  2  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  0  1  0  0  0 -1  1 -1  1  0 -1  0] (Indices: [1, 3, 4, 5, 6, 7, 10, 11, 12, 13, 15, 17, 18]), Candidate: [ 3  0  2  0  1  1  1 -1  1  2  0  1  1  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  0  1 -1  1  0  0 -1  1  0 -1  1 -1] (Indices: [1, 3, 4, 5, 6, 7, 10, 12, 13, 14, 16, 17, 19]), Candidate: [ 3  0  2  0  1  1  1 -1  1  2 -1  2  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 63550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  0  0  0  1  0  0  0  0  0 -1  1 -1] (Indices: [1, 3, 4, 5, 6, 7, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 3  0  2  0  1  1  1 -1  1  1  0  2  1  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1  0  0  0 -1  1  0 -1  0  1 -1  1 -1] (Indices: [1, 3, 4, 5, 6, 8, 9, 10, 11, 13, 14, 17, 19]), Candidate: [ 3  0  2  0  1  1  0  1  1  1  0  0  2  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1  0  0 -1  1 -1  1  0 -1  1  0 -1  0] (Indices: [1, 3, 4, 5, 6, 8, 9, 10, 12, 14, 15, 17, 18]), Candidate: [ 3  0  2  0  1  1  0  1  1  1 -1  2  0  2  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1  0 -1  1  0  0 -1  0  1  0 -1  1 -1] (Indices: [1, 3, 4, 5, 6, 8, 9, 11, 12, 13, 16, 17, 19]), Candidate: [3 0 2 0 1 1 0 1 1 0 1 1 1 0 0 2 1 0 2 5]
 -> Valid neighbor added.
Attempt 63750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1  0 -1  0  1  0 -1  1  0  0 -1  1 -1] (Indices: [1, 3, 4, 5, 6, 8, 9, 12, 13, 15, 16, 17, 19]), Candidate: [3 0 2 0 1 1 0 1 1 0 0 2 1 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 63800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1 -1  1  0  0 -1  0  1 -1  1  0  0 -1] (Indices: [1, 3, 4, 5, 6, 8, 10, 11, 12, 15, 17, 18, 19]), Candidate: [3 0 2 0 1 1 0 1 0 2 0 1 0 1 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 63850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1 -1  1 -1  0  0  1  0  0  0  0  0 -1] (Indices: [1, 3, 4, 5, 6, 8, 10, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  0  2  0  1  1  0  1  0  2 -1  1  1  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 63900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  1  0  0  0  0 -1  1 -1  1  0 -1  0] (Indices: [1, 3, 4, 5, 6, 9, 10, 11, 12, 13, 15, 17, 18]), Candidate: [3 0 2 0 1 1 0 0 2 1 0 1 1 0 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 63950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  1  0 -1  1  0  0 -1  1  0 -1  1 -1] (Indices: [1, 3, 4, 5, 6, 9, 10, 12, 13, 14, 16, 17, 19]), Candidate: [ 3  0  2  0  1  1  0  0  2  1 -1  2  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 64000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  1 -1  0  1  0  0  0  0  0 -1  1 -1] (Indices: [1, 3, 4, 5, 6, 9, 12, 13, 14, 15, 16, 17, 19]), Candidate: [3 0 2 0 1 1 0 0 2 0 0 2 1 1 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 64050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  0  0  1 -1  1  0  0  0  0  0  0 -1] (Indices: [1, 3, 4, 5, 6, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [3 0 2 0 1 1 0 0 1 1 1 0 2 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 64100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0  0  0  0 -1  1 -1  1 -1  1  0 -1  0] (Indices: [1, 3, 4, 5, 7, 8, 9, 10, 11, 13, 15, 17, 18]), Candidate: [3 0 2 0 1 0 2 0 1 1 0 0 2 0 1 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 64150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0  0  0 -1  1 -1  1 -1  1 -1  1  0 -1] (Indices: [1, 3, 4, 5, 7, 8, 9, 10, 12, 14, 16, 18, 19]), Candidate: [ 3  0  2  0  1  0  2  0  1  1 -1  2  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 64200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0  0 -1  1  0 -1  1  0  0 -1  0  1 -1] (Indices: [1, 3, 4, 5, 7, 8, 9, 11, 12, 14, 15, 16, 19]), Candidate: [3 0 2 0 1 0 2 0 1 0 1 1 0 2 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 64250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0  0 -1  0  1 -1  1  0  0  0 -1  1 -1] (Indices: [1, 3, 4, 5, 7, 8, 9, 12, 14, 15, 16, 17, 19]), Candidate: [3 0 2 0 1 0 2 0 1 0 0 2 0 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 64300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0 -1  1  0 -1  1  0  0 -1  1  0 -1  0] (Indices: [1, 3, 4, 5, 7, 8, 10, 11, 13, 14, 15, 17, 18]), Candidate: [3 0 2 0 1 0 2 0 0 2 0 0 2 1 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 64350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0 -1  0  1  0  0  0  0 -1  1 -1  1 -1] (Indices: [1, 3, 4, 5, 7, 8, 11, 12, 13, 14, 15, 17, 19]), Candidate: [3 0 2 0 1 0 2 0 0 1 1 1 1 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 64400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  1  0  0  0  0 -1  0  1 -1  1  0 -1] (Indices: [1, 3, 4, 5, 7, 9, 10, 11, 12, 13, 16, 18, 19]), Candidate: [ 3  0  2  0  1  0  2 -1  2  1  0  1  1  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  1  0 -1  1  0 -1  1  0 -1  1  0 -1] (Indices: [1, 3, 4, 5, 7, 9, 10, 12, 13, 15, 16, 18, 19]), Candidate: [ 3  0  2  0  1  0  2 -1  2  1 -1  2  1  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 64500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  1 -1  0  1 -1  1  0  0  0  0  0 -1] (Indices: [1, 3, 4, 5, 7, 9, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  0  2  0  1  0  2 -1  2  0  0  2  0  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1  0  0  0  0  0  0  0 -1  0  0  1 -1] (Indices: [1, 3, 4, 5, 8, 9, 10, 11, 12, 13, 14, 15, 19]), Candidate: [3 0 2 0 1 0 1 1 1 1 0 1 1 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 64600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1  0  0  0 -1  0  1  0 -1  1  0  0 -1] (Indices: [1, 3, 4, 5, 8, 9, 10, 11, 14, 15, 17, 18, 19]), Candidate: [3 0 2 0 1 0 1 1 1 1 0 0 1 2 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 64650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1  0 -1  1  0 -1  1 -1  1  0  0  0 -1] (Indices: [1, 3, 4, 5, 8, 9, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 3  0  2  0  1  0  1  1  1  0  1  1  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1 -1  1 -1  1  0 -1  1  0  0  0  0 -1] (Indices: [1, 3, 4, 5, 8, 10, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 3  0  2  0  1  0  1  1  0  2 -1  2  1  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  0  1 -1  1  0  0  0  0  0 -1  1  0 -1] (Indices: [1, 3, 4, 5, 9, 11, 12, 13, 14, 15, 16, 18, 19]), Candidate: [3 0 2 0 1 0 1 0 2 0 1 1 1 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 64800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0  0  0  0  0 -1  0  0  1 -1  1  0 -1] (Indices: [1, 3, 4, 6, 7, 8, 9, 10, 11, 12, 16, 18, 19]), Candidate: [3 0 2 0 0 2 1 0 1 1 0 1 0 1 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 64850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0  0  0 -1  1  0 -1  1 -1  1  0 -1  0] (Indices: [1, 3, 4, 6, 7, 8, 9, 10, 12, 13, 15, 17, 18]), Candidate: [ 3  0  2  0  0  2  1  0  1  1 -1  2  1  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0  0 -1  1  0  0  0 -1  0  1  0 -1  0] (Indices: [1, 3, 4, 6, 7, 8, 9, 11, 12, 13, 14, 17, 18]), Candidate: [ 3  0  2  0  0  2  1  0  1  0  1  1  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 64950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0  0 -1  0  1  0  0  0  0 -1  1 -1  0] (Indices: [1, 3, 4, 6, 7, 8, 9, 12, 13, 14, 15, 16, 18]), Candidate: [3 0 2 0 0 2 1 0 1 0 0 2 1 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 65000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0 -1  1  0  0 -1  1  0 -1  1  0 -1  0] (Indices: [1, 3, 4, 6, 7, 8, 10, 11, 12, 14, 15, 17, 18]), Candidate: [3 0 2 0 0 2 1 0 0 2 0 1 0 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 65050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0 -1  1 -1  1 -1  1  0  0 -1  1  0 -1] (Indices: [1, 3, 4, 6, 7, 8, 10, 12, 14, 15, 16, 18, 19]), Candidate: [ 3  0  2  0  0  2  1  0  0  2 -1  2  0  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  1  0  0  0  0  0  0 -1  0  0  1 -1] (Indices: [1, 3, 4, 6, 7, 9, 10, 11, 12, 13, 14, 15, 19]), Candidate: [ 3  0  2  0  0  2  1 -1  2  1  0  1  1  1  0  0  1  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  1  0  0 -1  0  1  0 -1  1  0  0 -1] (Indices: [1, 3, 4, 6, 7, 9, 10, 11, 14, 15, 17, 18, 19]), Candidate: [ 3  0  2  0  0  2  1 -1  2  1  0  0  1  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  1 -1  1  0 -1  1 -1  1  0  0  0 -1] (Indices: [1, 3, 4, 6, 7, 9, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 3  0  2  0  0  2  1 -1  2  0  1  1  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 65250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  0  1 -1  1  0 -1  1  0  0  0  0 -1] (Indices: [1, 3, 4, 6, 7, 10, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 3  0  2  0  0  2  1 -1  1  2 -1  2  1  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 65300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1  0  0  0 -1  1  0  0 -1  1  0 -1  0] (Indices: [1, 3, 4, 6, 8, 9, 10, 11, 13, 14, 15, 17, 18]), Candidate: [3 0 2 0 0 2 0 1 1 1 0 0 2 1 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 65350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1  0 -1  1  0  0  0  0 -1  1 -1  1 -1] (Indices: [1, 3, 4, 6, 8, 9, 11, 12, 13, 14, 15, 17, 19]), Candidate: [3 0 2 0 0 2 0 1 1 0 1 1 1 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 65400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1 -1  1  0  0 -1  1  0 -1  1  0  0 -1] (Indices: [1, 3, 4, 6, 8, 10, 11, 12, 14, 15, 17, 18, 19]), Candidate: [3 0 2 0 0 2 0 1 0 2 0 1 0 2 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 65450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  1  0  0 -1  1  0  0  0 -1  1  0 -1] (Indices: [1, 3, 4, 6, 9, 10, 11, 13, 14, 15, 16, 18, 19]), Candidate: [3 0 2 0 0 2 0 0 2 1 0 0 2 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 65500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0  0  0  0  0  0 -1  0  1 -1  1  0 -1] (Indices: [1, 3, 4, 7, 8, 9, 10, 11, 12, 13, 16, 18, 19]), Candidate: [3 0 2 0 0 1 2 0 1 1 0 1 1 0 0 2 0 2 1 5]
 -> Valid neighbor added.
Attempt 65550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0  0  0 -1  1  0 -1  1  0 -1  1  0 -1] (Indices: [1, 3, 4, 7, 8, 9, 10, 12, 13, 15, 16, 18, 19]), Candidate: [ 3  0  2  0  0  1  2  0  1  1 -1  2  1  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0  0 -1  0  1 -1  1  0  0  0  0  0 -1] (Indices: [1, 3, 4, 7, 8, 9, 12, 14, 15, 16, 17, 18, 19]), Candidate: [3 0 2 0 0 1 2 0 1 0 0 2 0 2 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 65650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  1  0  0  0  0  0  0 -1  1  0 -1  0] (Indices: [1, 3, 4, 7, 9, 10, 11, 12, 13, 14, 15, 17, 18]), Candidate: [ 3  0  2  0  0  1  2 -1  2  1  0  1  1  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1 -1  0  1 -1  1  0  0  0  0  0  0  0 -1] (Indices: [1, 3, 4, 7, 10, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  0  2  0  0  1  2 -1  1  2 -1  2  1  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 65750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  0  1 -1  1  0  0  0  0  0 -1  1  0  0 -1] (Indices: [1, 3, 4, 8, 10, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [3 0 2 0 0 1 1 1 0 2 0 1 1 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 65800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0  0  0  0  0 -1  0  0  1  0 -1  1 -1] (Indices: [1, 3, 5, 6, 7, 8, 9, 10, 11, 12, 16, 17, 19]), Candidate: [ 3  0  2 -1  2  1  1  0  1  1  0  1  0  1  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 65850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0  0  0 -1  1  0 -1  1  0 -1  0  1 -1] (Indices: [1, 3, 5, 6, 7, 8, 9, 10, 12, 13, 15, 16, 19]), Candidate: [ 3  0  2 -1  2  1  1  0  1  1 -1  2  1  0  1  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 65900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0  0 -1  1  0  0  0 -1  1 -1  0  1 -1] (Indices: [1, 3, 5, 6, 7, 8, 9, 11, 12, 13, 14, 16, 19]), Candidate: [ 3  0  2 -1  2  1  1  0  1  0  1  1  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 65950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0  0 -1  0  1  0  0  0  0  0 -1  0  0] (Indices: [1, 3, 5, 6, 7, 8, 9, 12, 13, 14, 15, 16, 17]), Candidate: [ 3  0  2 -1  2  1  1  0  1  0  0  2  1  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0 -1  1  0  0 -1  1  0  0 -1  0  1 -1] (Indices: [1, 3, 5, 6, 7, 8, 10, 11, 12, 14, 15, 16, 19]), Candidate: [ 3  0  2 -1  2  1  1  0  0  2  0  1  0  2  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0 -1  1 -1  1 -1  1  0  0  0 -1  1 -1] (Indices: [1, 3, 5, 6, 7, 8, 10, 12, 14, 15, 16, 17, 19]), Candidate: [ 3  0  2 -1  2  1  1  0  0  2 -1  2  0  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 66100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  1  0  0  0  0  0  0 -1  0  1 -1  0] (Indices: [1, 3, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 18]), Candidate: [ 3  0  2 -1  2  1  1 -1  2  1  0  1  1  1  0  0  1  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 66150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  1  0  0 -1  0  1  0  0 -1  1  0 -1] (Indices: [1, 3, 5, 6, 7, 9, 10, 11, 14, 15, 16, 18, 19]), Candidate: [ 3  0  2 -1  2  1  1 -1  2  1  0  0  1  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 66200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  1 -1  1  0 -1  1  0 -1  1  0  0 -1] (Indices: [1, 3, 5, 6, 7, 9, 11, 12, 14, 15, 17, 18, 19]), Candidate: [ 3  0  2 -1  2  1  1 -1  2  0  1  1  0  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 66250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  0  1 -1  1  0  0 -1  1  0  0  0 -1] (Indices: [1, 3, 5, 6, 7, 10, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  2  1  1 -1  1  2 -1  2  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 66300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1  0  0  0 -1  1  0  0  0 -1  0  1 -1] (Indices: [1, 3, 5, 6, 8, 9, 10, 11, 13, 14, 15, 16, 19]), Candidate: [ 3  0  2 -1  2  1  0  1  1  1  0  0  2  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1  0 -1  1  0  0  0  0 -1  1  0 -1  0] (Indices: [1, 3, 5, 6, 8, 9, 11, 12, 13, 14, 15, 17, 18]), Candidate: [ 3  0  2 -1  2  1  0  1  1  0  1  1  1  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1 -1  1  0  0 -1  1  0  0 -1  1  0 -1] (Indices: [1, 3, 5, 6, 8, 10, 11, 12, 14, 15, 16, 18, 19]), Candidate: [ 3  0  2 -1  2  1  0  1  0  2  0  1  0  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  0  1  0  0 -1  1  0  0  0  0 -1  1 -1] (Indices: [1, 3, 5, 6, 9, 10, 11, 13, 14, 15, 16, 17, 19]), Candidate: [ 3  0  2 -1  2  1  0  0  2  1  0  0  2  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0  0  0  0  0  0 -1  0  1  0 -1  1 -1] (Indices: [1, 3, 5, 7, 8, 9, 10, 11, 12, 13, 16, 17, 19]), Candidate: [ 3  0  2 -1  2  0  2  0  1  1  0  1  1  0  0  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0  0  0 -1  1  0 -1  1  0  0 -1  1 -1] (Indices: [1, 3, 5, 7, 8, 9, 10, 12, 13, 15, 16, 17, 19]), Candidate: [ 3  0  2 -1  2  0  2  0  1  1 -1  2  1  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 66600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0  0 -1  0  1  0 -1  1  0  0  0  0 -1] (Indices: [1, 3, 5, 7, 8, 9, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  2  0  2  0  1  0  0  2  1  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  1  0  0  0  0  0  0  0 -1  0  1 -1] (Indices: [1, 3, 5, 7, 9, 10, 11, 12, 13, 14, 15, 16, 19]), Candidate: [ 3  0  2 -1  2  0  2 -1  2  1  0  1  1  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 66700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1 -1  0  1  0 -1  1  0  0  0  0  0  0 -1] (Indices: [1, 3, 5, 7, 10, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  2  0  2 -1  1  2  0  0  2  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 66750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  0  1 -1  1  0  0  0  0  0  0 -1  1  0 -1] (Indices: [1, 3, 5, 8, 10, 11, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 3  0  2 -1  2  0  1  1  0  2  0  1  1  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0  0  0  0  0 -1  0  1  0  0 -1  1 -1] (Indices: [1, 3, 6, 7, 8, 9, 10, 11, 12, 15, 16, 17, 19]), Candidate: [ 3  0  2 -1  1  2  1  0  1  1  0  1  0  1  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0  0  0 -1  0  1  0 -1  1  0  0  0 -1] (Indices: [1, 3, 6, 7, 8, 9, 10, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  1  2  1  0  1  1 -1  1  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 66900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0 -1  1  0  0  0 -1  1  0  0 -1  1 -1] (Indices: [1, 3, 6, 7, 8, 10, 11, 12, 13, 15, 16, 17, 19]), Candidate: [ 3  0  2 -1  1  2  1  0  0  2  0  1  1  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 66950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0 -1  1  0  0  0 -1  1  0  0  0 -1  1 -1] (Indices: [1, 3, 6, 7, 9, 10, 11, 12, 14, 15, 16, 17, 19]), Candidate: [ 3  0  2 -1  1  2  1 -1  2  1  0  1  0  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 67000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  1  0  0  0  0  0 -1  1  0  0 -1  1 -1] (Indices: [1, 3, 6, 8, 9, 10, 11, 12, 13, 15, 16, 17, 19]), Candidate: [ 3  0  2 -1  1  2  0  1  1  1  0  1  1  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1 -1  0  1  0  0  0 -1  1  0  0  0  0  0 -1] (Indices: [1, 3, 6, 9, 10, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  1  2  0  0  2  1  0  1  0  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  0  1  0 -1  1  0  0  0  0  0  0  0  0 -1  0] (Indices: [1, 3, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 3  0  2 -1  1  1  2  0  0  2  0  1  1  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0  0  0  0  0 -1  1  0 -1  0  1 -1  0] (Indices: [1, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 15, 18]), Candidate: [3 0 1 1 1 1 1 0 1 1 0 1 0 2 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 67200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0  0  0  0 -1  0  0  1  0 -1  1  0 -1] (Indices: [1, 4, 5, 6, 7, 8, 9, 10, 11, 15, 16, 18, 19]), Candidate: [3 0 1 1 1 1 1 0 1 1 0 0 1 1 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 67250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0  0  0 -1  0  1 -1  1  0 -1  1  0 -1] (Indices: [1, 4, 5, 6, 7, 8, 9, 10, 13, 15, 16, 18, 19]), Candidate: [ 3  0  1  1  1  1  1  0  1  1 -1  1  2  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0  0 -1  1 -1  1  0 -1  1  0  0 -1  0] (Indices: [1, 4, 5, 6, 7, 8, 9, 11, 13, 14, 16, 17, 18]), Candidate: [ 3  0  1  1  1  1  1  0  1  0  1  0  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0 -1  1  0  0  0  0 -1  0  1  0 -1  0] (Indices: [1, 4, 5, 6, 7, 8, 10, 11, 12, 13, 14, 17, 18]), Candidate: [ 3  0  1  1  1  1  1  0  0  2  0  1  1  1 -1  1  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0 -1  1 -1  1  0  0  0  0 -1  1 -1  0] (Indices: [1, 4, 5, 6, 7, 8, 10, 12, 13, 14, 15, 16, 18]), Candidate: [ 3  0  1  1  1  1  1  0  0  2 -1  2  1  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0 -1  0  1 -1  1  0  0  0 -1  1  0 -1] (Indices: [1, 4, 5, 6, 7, 8, 11, 13, 14, 15, 16, 18, 19]), Candidate: [3 0 1 1 1 1 1 0 0 1 1 0 2 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 67500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  1  0  0 -1  1  0  0  0 -1  0  1 -1] (Indices: [1, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 19]), Candidate: [ 3  0  1  1  1  1  1 -1  2  1  0  0  2  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  1 -1  1  0  0  0  0 -1  1  0 -1  0] (Indices: [1, 4, 5, 6, 7, 9, 11, 12, 13, 14, 15, 17, 18]), Candidate: [ 3  0  1  1  1  1  1 -1  2  0  1  1  1  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  0  1  0  0 -1  1  0  0 -1  1  0 -1] (Indices: [1, 4, 5, 6, 7, 10, 11, 12, 14, 15, 16, 18, 19]), Candidate: [ 3  0  1  1  1  1  1 -1  1  2  0  1  0  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1  0  0  0  0 -1  1  0  0 -1  0  1 -1] (Indices: [1, 4, 5, 6, 8, 9, 10, 11, 12, 14, 15, 16, 19]), Candidate: [3 0 1 1 1 1 0 1 1 1 0 1 0 2 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 67700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1  0  0 -1  1 -1  1  0  0  0 -1  1 -1] (Indices: [1, 4, 5, 6, 8, 9, 10, 12, 14, 15, 16, 17, 19]), Candidate: [ 3  0  1  1  1  1  0  1  1  1 -1  2  0  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1 -1  1  0  0  0  0  0  0 -1  0  1 -1] (Indices: [1, 4, 5, 6, 8, 10, 11, 12, 13, 14, 15, 16, 19]), Candidate: [3 0 1 1 1 1 0 1 0 2 0 1 1 1 0 1 0 1 2 5]
 -> Valid neighbor added.
Attempt 67800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  0  1  0  0  0  0  0 -1  1  0 -1  1 -1] (Indices: [1, 4, 5, 6, 9, 10, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 3  0  1  1  1  1  0  0  2  1  0  1  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 67850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0  0  0  0  0  0  0  0 -1  0  1 -1  0] (Indices: [1, 4, 5, 7, 8, 9, 10, 11, 12, 13, 14, 15, 18]), Candidate: [3 0 1 1 1 0 2 0 1 1 0 1 1 1 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 67900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0  0  0  0 -1  0  1  0  0 -1  1  0 -1] (Indices: [1, 4, 5, 7, 8, 9, 10, 11, 14, 15, 16, 18, 19]), Candidate: [3 0 1 1 1 0 2 0 1 1 0 0 1 2 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 67950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0  0 -1  1  0 -1  1  0 -1  1  0  0 -1] (Indices: [1, 4, 5, 7, 8, 9, 11, 12, 14, 15, 17, 18, 19]), Candidate: [3 0 1 1 1 0 2 0 1 0 1 1 0 2 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 68000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0 -1  1 -1  1  0  0 -1  1  0  0  0 -1] (Indices: [1, 4, 5, 7, 8, 10, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  0  1  1  1  0  2  0  0  2 -1  2  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1 -1  1 -1  1  0  0  0  0  0  0 -1  1 -1] (Indices: [1, 4, 5, 7, 9, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 3  0  1  1  1  0  2 -1  2  0  1  1  1  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1  0  0 -1  1  0  0 -1  1  0  0  0 -1] (Indices: [1, 4, 5, 8, 9, 10, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  0  1  1  1  0  1  1  1  1 -1  2  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0  0  0  0  0  0 -1  0  1  0  0 -1  0] (Indices: [1, 4, 6, 7, 8, 9, 10, 11, 12, 13, 16, 17, 18]), Candidate: [3 0 1 1 0 2 1 0 1 1 0 1 1 0 0 2 1 1 0 6]
 -> Valid neighbor added.
Attempt 68200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0  0  0 -1  1  0 -1  1  0  0  0 -1  0] (Indices: [1, 4, 6, 7, 8, 9, 10, 12, 13, 15, 16, 17, 18]), Candidate: [ 3  0  1  1  0  2  1  0  1  1 -1  2  1  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0  0 -1  0  1  0  0 -1  1  0  0  0 -1] (Indices: [1, 4, 6, 7, 8, 9, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  0  1  1  0  2  1  0  1  0  0  2  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  1  0  0  0  0  0  0  0 -1  1 -1  0] (Indices: [1, 4, 6, 7, 9, 10, 11, 12, 13, 14, 15, 16, 18]), Candidate: [ 3  0  1  1  0  2  1 -1  2  1  0  1  1  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0 -1  0  1  0  0 -1  1  0  0  0  0  0 -1] (Indices: [1, 4, 6, 7, 10, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  0  1  1  0  2  1 -1  1  2  0  1  0  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1 -1  1 -1  1  0  0  0  0  0  0  0 -1  1 -1] (Indices: [1, 4, 6, 8, 10, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [3 0 1 1 0 2 0 1 0 2 0 1 1 1 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 68450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  0  1  0  0  0 -1  1  0  0  0  0 -1  1  0 -1] (Indices: [1, 4, 7, 8, 9, 10, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 3  0  1  1  0  1  2  0  1  1 -1  2  1  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0  0  0  0  0  0  0  0 -1  0  1 -1  0] (Indices: [1, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 18]), Candidate: [3 0 1 0 2 1 1 0 1 1 0 1 1 1 0 0 1 2 0 6]
 -> Valid neighbor added.
Attempt 68550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0  0  0  0 -1  0  1  0  0 -1  1  0 -1] (Indices: [1, 5, 6, 7, 8, 9, 10, 11, 14, 15, 16, 18, 19]), Candidate: [3 0 1 0 2 1 1 0 1 1 0 0 1 2 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 68600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0  0 -1  1  0 -1  1  0 -1  1  0  0 -1] (Indices: [1, 5, 6, 7, 8, 9, 11, 12, 14, 15, 17, 18, 19]), Candidate: [3 0 1 0 2 1 1 0 1 0 1 1 0 2 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 68650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0 -1  1 -1  1  0  0 -1  1  0  0  0 -1] (Indices: [1, 5, 6, 7, 8, 10, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  0  1  0  2  1  1  0  0  2 -1  2  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0 -1  1 -1  1  0  0  0  0  0  0 -1  1 -1] (Indices: [1, 5, 6, 7, 9, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 3  0  1  0  2  1  1 -1  2  0  1  1  1  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 68750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0 -1  1  0  0 -1  1  0  0 -1  1  0  0  0 -1] (Indices: [1, 5, 6, 8, 9, 10, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  0  1  0  2  1  0  1  1  1 -1  2  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 68800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  1  0  0  0  0  0 -1  1  0  0  0 -1  1 -1] (Indices: [1, 5, 7, 8, 9, 10, 11, 12, 14, 15, 16, 17, 19]), Candidate: [3 0 1 0 2 0 2 0 1 1 0 1 0 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 68850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1 -1  0  1  0  0  0  0  0  0  0  0  0  0 -1  0] (Indices: [1, 5, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [3 0 1 0 2 0 1 1 1 1 0 1 1 1 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 68900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  1  0  0  0 -1  1  0  0  0  0  0 -1  1  0 -1] (Indices: [1, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 18, 19]), Candidate: [3 0 1 0 1 2 1 0 1 0 1 1 1 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 68950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0 -1  1  0  0  0  0  0  0  0  0  0 -1] (Indices: [1, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [3 0 1 0 1 1 2 0 0 2 0 1 1 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 69000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0  0  0  0 -1  0  0  1  0 -1  1 -1  0] (Indices: [2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 15, 16, 18]), Candidate: [2 2 1 0 1 1 1 0 1 1 0 0 1 1 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 69050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0  0  0 -1  0  1  0 -1  1 -1  0  1 -1] (Indices: [2, 3, 4, 5, 6, 7, 8, 9, 10, 13, 14, 16, 19]), Candidate: [ 2  2  1  0  1  1  1  0  1  1 -1  1  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 69100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0  0 -1  1  0 -1  1 -1  1 -1  0  1 -1] (Indices: [2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 14, 16, 19]), Candidate: [ 2  2  1  0  1  1  1  0  1  0  1  1  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0  0 -1  0  1  0  0  0 -1  1 -1  0  0] (Indices: [2, 3, 4, 5, 6, 7, 8, 9, 12, 13, 14, 15, 17]), Candidate: [2 2 1 0 1 1 1 0 1 0 0 2 1 1 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 69200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0  0 -1  0  0  0  1  0  0  0 -1  1 -1] (Indices: [2, 3, 4, 5, 6, 7, 8, 9, 14, 15, 16, 17, 19]), Candidate: [2 2 1 0 1 1 1 0 1 0 0 1 1 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 69250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0 -1  1  0 -1  1 -1  1  0  0 -1  0  0] (Indices: [2, 3, 4, 5, 6, 7, 8, 10, 11, 13, 15, 16, 17]), Candidate: [2 2 1 0 1 1 1 0 0 2 0 0 2 0 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 69300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0 -1  1 -1  1 -1  1  0 -1  0  1  0 -1] (Indices: [2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 15, 18, 19]), Candidate: [ 2  2  1  0  1  1  1  0  0  2 -1  2  0  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0 -1  0  1  0  0 -1  0  0  1  0  0 -1] (Indices: [2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 17, 18, 19]), Candidate: [2 2 1 0 1 1 1 0 0 1 1 1 1 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 69400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0 -1  0  0  1  0 -1  1 -1  1  0  0 -1] (Indices: [2, 3, 4, 5, 6, 7, 8, 12, 13, 15, 17, 18, 19]), Candidate: [2 2 1 0 1 1 1 0 0 1 0 2 1 0 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 69450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  1  0  0 -1  1  0  0  0 -1  0  0  0] (Indices: [2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16]), Candidate: [ 2  2  1  0  1  1  1 -1  2  1  0  0  2  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  1  0 -1  1  0 -1  1 -1  0  1  0 -1] (Indices: [2, 3, 4, 5, 6, 7, 9, 10, 12, 13, 15, 18, 19]), Candidate: [ 2  2  1  0  1  1  1 -1  2  1 -1  2  1  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 69550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  1 -1  1  0  0  0 -1  0  0  1  0 -1] (Indices: [2, 3, 4, 5, 6, 7, 9, 11, 12, 13, 14, 18, 19]), Candidate: [ 2  2  1  0  1  1  1 -1  2  0  1  1  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 69600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  1 -1  0  1  0  0  0 -1  1  0 -1  0] (Indices: [2, 3, 4, 5, 6, 7, 9, 12, 13, 14, 15, 17, 18]), Candidate: [ 2  2  1  0  1  1  1 -1  2  0  0  2  1  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  0  1  0  0 -1  1  0 -1  0  1  0 -1] (Indices: [2, 3, 4, 5, 6, 7, 10, 11, 12, 14, 15, 18, 19]), Candidate: [ 2  2  1  0  1  1  1 -1  1  2  0  1  0  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  0  1 -1  1 -1  1 -1  1  0  0  0 -1] (Indices: [2, 3, 4, 5, 6, 7, 10, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  2  1  0  1  1  1 -1  1  2 -1  2  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 69750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1  0  0  0  0  0 -1  1  0 -1  0  0  0] (Indices: [2, 3, 4, 5, 6, 8, 9, 10, 11, 12, 13, 15, 16]), Candidate: [2 2 1 0 1 1 0 1 1 1 0 1 1 0 1 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 69800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1  0  0  0 -1  0  1  0  0  0 -1  0  0] (Indices: [2, 3, 4, 5, 6, 8, 9, 10, 11, 14, 15, 16, 17]), Candidate: [2 2 1 0 1 1 0 1 1 1 0 0 1 2 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 69850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1  0  0 -1  0  1  0  0  0  0 -1  0  0] (Indices: [2, 3, 4, 5, 6, 8, 9, 10, 13, 14, 15, 16, 17]), Candidate: [ 2  2  1  0  1  1  0  1  1  1 -1  1  2  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1  0 -1  1  0 -1  1 -1  0  1  0  0 -1] (Indices: [2, 3, 4, 5, 6, 8, 9, 11, 12, 14, 17, 18, 19]), Candidate: [ 2  2  1  0  1  1  0  1  1  0  1  1  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 69950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1  0 -1  0  0  1  0  0  0 -1  1  0 -1] (Indices: [2, 3, 4, 5, 6, 8, 9, 13, 14, 15, 16, 18, 19]), Candidate: [2 2 1 0 1 1 0 1 1 0 0 1 2 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 70000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1 -1  1  0 -1  1 -1  1  0  0  0 -1  0] (Indices: [2, 3, 4, 5, 6, 8, 10, 11, 13, 15, 16, 17, 18]), Candidate: [2 2 1 0 1 1 0 1 0 2 0 0 2 0 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 70050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1 -1  0  1  0  0 -1  1  0  0 -1  1 -1] (Indices: [2, 3, 4, 5, 6, 8, 11, 12, 13, 15, 16, 17, 19]), Candidate: [2 2 1 0 1 1 0 1 0 1 1 1 1 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 70100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  1  0  0  0 -1  1  0 -1  0  1  0 -1] (Indices: [2, 3, 4, 5, 6, 9, 10, 11, 12, 14, 15, 18, 19]), Candidate: [2 2 1 0 1 1 0 0 2 1 0 1 0 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 70150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  1  0 -1  1 -1  1 -1  1  0  0  0 -1] (Indices: [2, 3, 4, 5, 6, 9, 10, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  2  1  0  1  1  0  0  2  1 -1  2  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 70200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  0  1  0  0  0  0  0 -1  0  1  0 -1] (Indices: [2, 3, 4, 5, 6, 10, 11, 12, 13, 14, 15, 18, 19]), Candidate: [2 2 1 0 1 1 0 0 1 2 0 1 1 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 70250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0  0  0  0  0  0 -1  0  1 -1  1 -1  0] (Indices: [2, 3, 4, 5, 7, 8, 9, 10, 11, 12, 13, 16, 18]), Candidate: [2 2 1 0 1 0 2 0 1 1 0 1 1 0 0 2 0 2 0 6]
 -> Valid neighbor added.
Attempt 70300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0  0  0  0 -1  0  1  0 -1  0  1  0 -1] (Indices: [2, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 18, 19]), Candidate: [2 2 1 0 1 0 2 0 1 1 0 0 1 2 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 70350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0  0  0 -1  0  1  0  0 -1  0  1  0 -1] (Indices: [2, 3, 4, 5, 7, 8, 9, 10, 13, 14, 15, 18, 19]), Candidate: [ 2  2  1  0  1  0  2  0  1  1 -1  1  2  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0  0 -1  1  0 -1  0  0  1  0  0  0 -1] (Indices: [2, 3, 4, 5, 7, 8, 9, 11, 12, 16, 17, 18, 19]), Candidate: [2 2 1 0 1 0 2 0 1 0 1 1 0 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 70450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0 -1  1  0  0  0  0  0  0 -1  0  0  0] (Indices: [2, 3, 4, 5, 7, 8, 10, 11, 12, 13, 14, 15, 16]), Candidate: [2 2 1 0 1 0 2 0 0 2 0 1 1 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 70500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0 -1  1  0 -1  0  1  0  0  0  0 -1  0] (Indices: [2, 3, 4, 5, 7, 8, 10, 11, 14, 15, 16, 17, 18]), Candidate: [2 2 1 0 1 0 2 0 0 2 0 0 1 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 70550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0 -1  0  1  0 -1  1  0  0  0 -1  1 -1] (Indices: [2, 3, 4, 5, 7, 8, 11, 12, 14, 15, 16, 17, 19]), Candidate: [2 2 1 0 1 0 2 0 0 1 1 1 0 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 70600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  1  0  0  0 -1  0  1  0  0  0 -1  0] (Indices: [2, 3, 4, 5, 7, 9, 10, 11, 12, 15, 16, 17, 18]), Candidate: [ 2  2  1  0  1  0  2 -1  2  1  0  1  0  1  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  1  0 -1  0  1  0  0 -1  1  0  0 -1] (Indices: [2, 3, 4, 5, 7, 9, 10, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  2  1  0  1  0  2 -1  2  1 -1  1  2  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 70700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  0  1  0  0  0 -1  1  0  0  0 -1  0] (Indices: [2, 3, 4, 5, 7, 10, 11, 12, 13, 15, 16, 17, 18]), Candidate: [ 2  2  1  0  1  0  2 -1  1  2  0  1  1  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 70750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1  0  0  0  0  0 -1  1 -1  0  1  0 -1] (Indices: [2, 3, 4, 5, 8, 9, 10, 11, 12, 13, 15, 18, 19]), Candidate: [2 2 1 0 1 0 1 1 1 1 0 1 1 0 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 70800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1  0  0 -1  1  0  0 -1  0  1  0  0 -1] (Indices: [2, 3, 4, 5, 8, 9, 10, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  2  1  0  1  0  1  1  1  1 -1  2  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 70850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1  0 -1  0  1  0  0  0 -1  1  0  0 -1] (Indices: [2, 3, 4, 5, 8, 9, 12, 13, 14, 15, 17, 18, 19]), Candidate: [2 2 1 0 1 0 1 1 1 0 0 2 1 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 70900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  1  0  0  0  0  0  0  0  0 -1  0  0] (Indices: [2, 3, 4, 5, 9, 10, 11, 12, 13, 14, 15, 16, 17]), Candidate: [2 2 1 0 1 0 1 0 2 1 0 1 1 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 70950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  0  1  0  0  0 -1  1  0  0  0  0 -1] (Indices: [2, 3, 4, 5, 10, 11, 12, 13, 15, 16, 17, 18, 19]), Candidate: [2 2 1 0 1 0 1 0 1 2 0 1 1 0 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 71000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0  0  0  0 -1  1 -1  1  0  0 -1  0  0] (Indices: [2, 3, 4, 6, 7, 8, 9, 10, 11, 13, 15, 16, 17]), Candidate: [2 2 1 0 0 2 1 0 1 1 0 0 2 0 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 71050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0  0  0 -1  1 -1  1  0 -1  0  1  0 -1] (Indices: [2, 3, 4, 6, 7, 8, 9, 10, 12, 14, 15, 18, 19]), Candidate: [ 2  2  1  0  0  2  1  0  1  1 -1  2  0  2  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0  0 -1  1  0  0 -1  0  0  1  0  0 -1] (Indices: [2, 3, 4, 6, 7, 8, 9, 11, 12, 13, 17, 18, 19]), Candidate: [2 2 1 0 0 2 1 0 1 0 1 1 1 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 71150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0  0 -1  0  1  0 -1  1 -1  1  0  0 -1] (Indices: [2, 3, 4, 6, 7, 8, 9, 12, 13, 15, 17, 18, 19]), Candidate: [2 2 1 0 0 2 1 0 1 0 0 2 1 0 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 71200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0 -1  1  0 -1  1  0  0  0  0 -1  0  0] (Indices: [2, 3, 4, 6, 7, 8, 10, 11, 13, 14, 15, 16, 17]), Candidate: [2 2 1 0 0 2 1 0 0 2 0 0 2 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 71250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0 -1  0  1  0  0  0  0  0 -1  1 -1  0] (Indices: [2, 3, 4, 6, 7, 8, 11, 12, 13, 14, 15, 16, 18]), Candidate: [2 2 1 0 0 2 1 0 0 1 1 1 1 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 71300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  1  0  0  0  0 -1  1 -1  0  1  0 -1] (Indices: [2, 3, 4, 6, 7, 9, 10, 11, 12, 13, 15, 18, 19]), Candidate: [ 2  2  1  0  0  2  1 -1  2  1  0  1  1  0  1  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  1  0 -1  1  0  0 -1  0  1  0  0 -1] (Indices: [2, 3, 4, 6, 7, 9, 10, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  2  1  0  0  2  1 -1  2  1 -1  2  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 71400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  1 -1  0  1  0  0  0 -1  1  0  0 -1] (Indices: [2, 3, 4, 6, 7, 9, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  2  1  0  0  2  1 -1  2  0  0  2  1  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1  0  0  0  0  0  0  0  0 -1  0  0  0] (Indices: [2, 3, 4, 6, 8, 9, 10, 11, 12, 13, 14, 15, 16]), Candidate: [2 2 1 0 0 2 0 1 1 1 0 1 1 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 71500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1  0  0  0 -1  0  1  0  0  0  0 -1  0] (Indices: [2, 3, 4, 6, 8, 9, 10, 11, 14, 15, 16, 17, 18]), Candidate: [2 2 1 0 0 2 0 1 1 1 0 0 1 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 71550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1  0 -1  1  0 -1  1  0  0  0 -1  1 -1] (Indices: [2, 3, 4, 6, 8, 9, 11, 12, 14, 15, 16, 17, 19]), Candidate: [2 2 1 0 0 2 0 1 1 0 1 1 0 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 71600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1 -1  1 -1  1  0  0  0  0 -1  1  0 -1] (Indices: [2, 3, 4, 6, 8, 10, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  2  1  0  0  2  0  1  0  2 -1  2  1  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  0  1  0 -1  0  1  0  0  0  0  0  0 -1] (Indices: [2, 3, 4, 6, 9, 10, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  2  1  0  0  2  0  0  2  1 -1  1  2  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0  0  0  0  0 -1  0  1  0  0  0 -1  0] (Indices: [2, 3, 4, 7, 8, 9, 10, 11, 12, 15, 16, 17, 18]), Candidate: [2 2 1 0 0 1 2 0 1 1 0 1 0 1 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 71750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0  0  0 -1  0  1  0  0 -1  1  0  0 -1] (Indices: [2, 3, 4, 7, 8, 9, 10, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  2  1  0  0  1  2  0  1  1 -1  1  2  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0 -1  1  0  0  0 -1  1  0  0  0 -1  0] (Indices: [2, 3, 4, 7, 8, 10, 11, 12, 13, 15, 16, 17, 18]), Candidate: [2 2 1 0 0 1 2 0 0 2 0 1 1 0 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 71850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  1  0  0  0 -1  1  0  0  0  0 -1  0] (Indices: [2, 3, 4, 7, 9, 10, 11, 12, 14, 15, 16, 17, 18]), Candidate: [ 2  2  1  0  0  1  2 -1  2  1  0  1  0  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 71900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  1  0  0  0  0  0 -1  1  0  0  0 -1  0] (Indices: [2, 3, 4, 8, 9, 10, 11, 12, 13, 15, 16, 17, 18]), Candidate: [2 2 1 0 0 1 1 1 1 1 0 1 1 0 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 71950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  0  0  1  0  0  0  0 -1  1  0  0  0  0 -1] (Indices: [2, 3, 4, 9, 10, 11, 12, 13, 15, 16, 17, 18, 19]), Candidate: [2 2 1 0 0 1 1 0 2 1 0 1 1 0 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 72000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0  0  0  0 -1  1  0 -1  0  0  1  0 -1] (Indices: [2, 3, 5, 6, 7, 8, 9, 10, 11, 13, 14, 18, 19]), Candidate: [ 2  2  1 -1  2  1  1  0  1  1  0  0  2  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 72050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0  0  0 -1  1 -1  1  0 -1  1 -1  1 -1] (Indices: [2, 3, 5, 6, 7, 8, 9, 10, 12, 14, 15, 17, 19]), Candidate: [ 2  2  1 -1  2  1  1  0  1  1 -1  2  0  2  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 72100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0  0 -1  1  0  0 -1  0  1 -1  1  0 -1] (Indices: [2, 3, 5, 6, 7, 8, 9, 11, 12, 13, 16, 18, 19]), Candidate: [ 2  2  1 -1  2  1  1  0  1  0  1  1  1  0  0  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0  0 -1  0  1  0 -1  1  0 -1  1  0 -1] (Indices: [2, 3, 5, 6, 7, 8, 9, 12, 13, 15, 16, 18, 19]), Candidate: [ 2  2  1 -1  2  1  1  0  1  0  0  2  1  0  1  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0 -1  1  0  0 -1  0  0  1  0  0  0 -1] (Indices: [2, 3, 5, 6, 7, 8, 10, 11, 12, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  1  1  0  0  2  0  1  0  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0 -1  0  1  0  0  0  0  0  0 -1  0  0] (Indices: [2, 3, 5, 6, 7, 8, 11, 12, 13, 14, 15, 16, 17]), Candidate: [ 2  2  1 -1  2  1  1  0  0  1  1  1  1  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  1  0  0  0  0 -1  1 -1  1 -1  1 -1] (Indices: [2, 3, 5, 6, 7, 9, 10, 11, 12, 13, 15, 17, 19]), Candidate: [ 2  2  1 -1  2  1  1 -1  2  1  0  1  1  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 72350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  1  0 -1  1  0  0 -1  1 -1  1  0 -1] (Indices: [2, 3, 5, 6, 7, 9, 10, 12, 13, 14, 16, 18, 19]), Candidate: [ 2  2  1 -1  2  1  1 -1  2  1 -1  2  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 72400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  1 -1  0  1  0  0  0  0 -1  1  0 -1] (Indices: [2, 3, 5, 6, 7, 9, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  2  1 -1  2  1  1 -1  2  0  0  2  1  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 72450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  0  0  0  1  0  0  0  0  0  0  0 -1] (Indices: [2, 3, 5, 6, 7, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  1  1 -1  1  1  0  2  1  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 72500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1  0  0  0 -1  1 -1  0  1  0  0  0 -1] (Indices: [2, 3, 5, 6, 8, 9, 10, 11, 13, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  1  0  1  1  1  0  0  2  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1  0 -1  1  0 -1  1  0  0  0  0 -1  0] (Indices: [2, 3, 5, 6, 8, 9, 11, 12, 14, 15, 16, 17, 18]), Candidate: [ 2  2  1 -1  2  1  0  1  1  0  1  1  0  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 72600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1 -1  1 -1  1  0  0  0  0  0 -1  1 -1] (Indices: [2, 3, 5, 6, 8, 10, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  2  1 -1  2  1  0  1  0  2 -1  2  1  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 72650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  1  0 -1  1 -1  1  0  0  0  0  0 -1] (Indices: [2, 3, 5, 6, 9, 10, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  1  0  0  2  1 -1  2  0  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 72700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0  0  0  0  0 -1  1 -1  0  1  0  0 -1] (Indices: [2, 3, 5, 7, 8, 9, 10, 11, 12, 14, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  0  2  0  1  1  0  1  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 72750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0  0  0 -1  0  1  0  0  0 -1  1  0 -1] (Indices: [2, 3, 5, 7, 8, 9, 10, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  2  1 -1  2  0  2  0  1  1 -1  1  2  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 72800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0 -1  1  0  0  0  0 -1  0  1  0  0 -1] (Indices: [2, 3, 5, 7, 8, 10, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  0  2  0  0  2  0  1  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 72850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1 -1  1  0  0  0  0 -1  0  1  0  0  0 -1] (Indices: [2, 3, 5, 7, 9, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  0  2 -1  2  1  0  1  1  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 72900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  1  0  0  0  0  0  0 -1  0  1  0  0 -1] (Indices: [2, 3, 5, 8, 9, 10, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  0  1  1  1  1  0  1  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 72950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  0  0  1  0  0  0  0  0 -1  1  0  0  0 -1] (Indices: [2, 3, 5, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  0  1  0  2  1  0  1  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 73000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0  0  0  0 -1  1  0 -1  1 -1  1  0 -1] (Indices: [2, 3, 6, 7, 8, 9, 10, 11, 13, 14, 16, 18, 19]), Candidate: [ 2  2  1 -1  1  2  1  0  1  1  0  0  2  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 73050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0  0 -1  1  0  0  0 -1  0  1  0  0 -1] (Indices: [2, 3, 6, 7, 8, 9, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  2  1 -1  1  2  1  0  1  0  1  1  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 73100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0 -1  1  0 -1  1  0  0  0 -1  1  0 -1] (Indices: [2, 3, 6, 7, 8, 10, 11, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  2  1 -1  1  2  1  0  0  2  0  0  2  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0 -1  1  0 -1  1  0  0  0  0  0  0 -1  0] (Indices: [2, 3, 6, 7, 9, 10, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  2  1 -1  1  2  1 -1  2  1 -1  2  1  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 73200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1  0  0  0 -1  1  0  0  0 -1  1  0 -1] (Indices: [2, 3, 6, 8, 9, 10, 11, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  2  1 -1  1  2  0  1  1  1  0  0  2  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1  0  0  0  0  0  0  0 -1  1  0 -1  1 -1] (Indices: [2, 3, 7, 8, 9, 10, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  2  1 -1  1  1  2  0  1  1  0  1  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 73300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  0  1 -1  1  0  0  0  0  0  0  0 -1  1  0 -1] (Indices: [2, 3, 7, 9, 10, 11, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  2  1 -1  1  1  2 -1  2  1  0  1  1  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 73350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0  0  0  0  0 -1  0  1 -1  1 -1  1 -1] (Indices: [2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 15, 17, 19]), Candidate: [2 2 0 1 1 1 1 0 1 1 0 1 0 1 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 73400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0  0  0 -1  1  0  0 -1  0  0  1  0 -1] (Indices: [2, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 18, 19]), Candidate: [ 2  2  0  1  1  1  1  0  1  1 -1  2  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 73450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0  0 -1  1  0  0  0  0 -1  0  0  1 -1] (Indices: [2, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 19]), Candidate: [2 2 0 1 1 1 1 0 1 0 1 1 1 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 73500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0  0 -1  1 -1  0  1  0 -1  1  0  0 -1] (Indices: [2, 4, 5, 6, 7, 8, 9, 11, 14, 15, 17, 18, 19]), Candidate: [2 2 0 1 1 1 1 0 1 0 1 0 1 2 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 73550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0 -1  1  0  0  0 -1  0  0  1  0  0 -1] (Indices: [2, 4, 5, 6, 7, 8, 10, 11, 12, 13, 17, 18, 19]), Candidate: [2 2 0 1 1 1 1 0 0 2 0 1 1 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 73600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0 -1  1 -1  1  0 -1  1 -1  1  0  0 -1] (Indices: [2, 4, 5, 6, 7, 8, 10, 12, 13, 15, 17, 18, 19]), Candidate: [ 2  2  0  1  1  1  1  0  0  2 -1  2  1  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0 -1  0  0  0  1  0  0  0  0  0  0 -1] (Indices: [2, 4, 5, 6, 7, 8, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 2 0 1 1 1 1 0 0 1 0 1 2 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 73700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  1  0  0 -1  1 -1  0  1  0  0  0 -1] (Indices: [2, 4, 5, 6, 7, 9, 10, 11, 13, 16, 17, 18, 19]), Candidate: [ 2  2  0  1  1  1  1 -1  2  1  0  0  2  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  1 -1  1  0 -1  1  0  0  0  0 -1  0] (Indices: [2, 4, 5, 6, 7, 9, 11, 12, 14, 15, 16, 17, 18]), Candidate: [ 2  2  0  1  1  1  1 -1  2  0  1  1  0  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 73800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  0  1 -1  1  0  0  0  0  0 -1  1 -1] (Indices: [2, 4, 5, 6, 7, 10, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  2  0  1  1  1  1 -1  1  2 -1  2  1  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 73850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1  0  0  0  0 -1  0  0  1  0  0  0 -1] (Indices: [2, 4, 5, 6, 8, 9, 10, 11, 12, 16, 17, 18, 19]), Candidate: [2 2 0 1 1 1 0 1 1 1 0 1 0 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 73900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1  0 -1  1  0  0  0  0  0  0 -1  0  0] (Indices: [2, 4, 5, 6, 8, 9, 11, 12, 13, 14, 15, 16, 17]), Candidate: [2 2 0 1 1 1 0 1 1 0 1 1 1 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 73950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1 -1  1  0  0  0 -1  0  1  0  0  0 -1] (Indices: [2, 4, 5, 6, 8, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [2 2 0 1 1 1 0 1 0 2 0 1 1 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 74000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  1  0  0  0 -1  1 -1  1  0  0  0 -1] (Indices: [2, 4, 5, 6, 9, 10, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  2  0  1  1  1  0  0  2  1  0  1  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0  0  0  0  0  0 -1  1 -1  1 -1  1 -1] (Indices: [2, 4, 5, 7, 8, 9, 10, 11, 12, 13, 15, 17, 19]), Candidate: [2 2 0 1 1 0 2 0 1 1 0 1 1 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 74100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0  0  0 -1  1  0  0 -1  1 -1  1  0 -1] (Indices: [2, 4, 5, 7, 8, 9, 10, 12, 13, 14, 16, 18, 19]), Candidate: [ 2  2  0  1  1  0  2  0  1  1 -1  2  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 74150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0  0 -1  0  1  0  0  0  0 -1  1  0 -1] (Indices: [2, 4, 5, 7, 8, 9, 12, 13, 14, 15, 16, 18, 19]), Candidate: [2 2 0 1 1 0 2 0 1 0 0 2 1 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 74200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0 -1  0  0  1  0  0  0  0  0  0  0 -1] (Indices: [2, 4, 5, 7, 8, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 2 0 1 1 0 2 0 0 1 0 2 1 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 74250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1 -1  0  1  0  0  0  0 -1  1  0  0  0 -1] (Indices: [2, 4, 5, 7, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  2  0  1  1  0  2 -1  1  2  0  1  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 74300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  0  1  0 -1  0  1  0  0  0  0  0  0  0 -1] (Indices: [2, 4, 5, 8, 9, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 2 0 1 1 0 1 1 1 0 0 2 1 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 74350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0  0  0  0  0 -1  1 -1  1 -1  1  0 -1] (Indices: [2, 4, 6, 7, 8, 9, 10, 11, 12, 14, 16, 18, 19]), Candidate: [ 2  2  0  1  0  2  1  0  1  1  0  1  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0  0  0 -1  0  1  0  0  0  0 -1  1 -1] (Indices: [2, 4, 6, 7, 8, 9, 10, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  2  0  1  0  2  1  0  1  1 -1  1  2  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0 -1  1  0  0  0  0 -1  1 -1  1  0 -1] (Indices: [2, 4, 6, 7, 8, 10, 11, 12, 13, 14, 16, 18, 19]), Candidate: [ 2  2  0  1  0  2  1  0  0  2  0  1  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  1  0  0  0  0 -1  1 -1  1  0  0 -1] (Indices: [2, 4, 6, 7, 9, 10, 11, 12, 13, 15, 17, 18, 19]), Candidate: [ 2  2  0  1  0  2  1 -1  2  1  0  1  1  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  1  0  0  0  0  0  0 -1  1 -1  1  0 -1] (Indices: [2, 4, 6, 8, 9, 10, 11, 12, 13, 14, 16, 18, 19]), Candidate: [ 2  2  0  1  0  2  0  1  1  1  0  1  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 74600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1 -1  0  1  0  0  0  0  0  0 -1  1  0  0 -1] (Indices: [2, 4, 6, 9, 10, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [2 2 0 1 0 2 0 0 2 1 0 1 1 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 74650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  0  1  0  0 -1  1  0 -1  1  0  0  0  0  0 -1] (Indices: [2, 4, 7, 8, 9, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [2 2 0 1 0 1 2 0 1 0 1 1 0 2 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 74700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0  0  0  0  0  0 -1  1 -1  1 -1  1 -1] (Indices: [2, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 17, 19]), Candidate: [2 2 0 0 2 1 1 0 1 1 0 1 1 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 74750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0  0  0 -1  1  0  0 -1  1 -1  1  0 -1] (Indices: [2, 5, 6, 7, 8, 9, 10, 12, 13, 14, 16, 18, 19]), Candidate: [ 2  2  0  0  2  1  1  0  1  1 -1  2  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 74800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0  0 -1  0  1  0  0  0  0 -1  1  0 -1] (Indices: [2, 5, 6, 7, 8, 9, 12, 13, 14, 15, 16, 18, 19]), Candidate: [2 2 0 0 2 1 1 0 1 0 0 2 1 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 74850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0 -1  0  0  1  0  0  0  0  0  0  0 -1] (Indices: [2, 5, 6, 7, 8, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 2 0 0 2 1 1 0 0 1 0 2 1 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 74900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0 -1  0  1  0  0  0  0 -1  1  0  0  0 -1] (Indices: [2, 5, 6, 7, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  2  0  0  2  1  1 -1  1  2  0  1  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 74950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1  0 -1  0  1  0  0  0  0  0  0  0 -1] (Indices: [2, 5, 6, 8, 9, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 2 0 0 2 1 0 1 1 0 0 2 1 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 75000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1 -1  1  0  0  0 -1  1  0  0  0  0  0  0 -1  0] (Indices: [2, 5, 7, 8, 9, 10, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  2  0  0  2  0  2  0  1  1 -1  2  1  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 -1  0  0] (Indices: [2, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17]), Candidate: [2 2 0 0 1 2 1 0 1 1 0 1 1 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 75100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  0  1  0  0 -1  1  0  0  0 -1  1  0  0  0  0 -1] (Indices: [2, 6, 7, 8, 10, 11, 12, 13, 15, 16, 17, 18, 19]), Candidate: [2 2 0 0 1 2 1 0 0 2 0 1 1 0 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 75150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0  0  0  0  0  0 -1  0  1  0 -1  0  0] (Indices: [3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 16, 17]), Candidate: [2 1 2 0 1 1 1 0 1 1 0 1 1 0 0 2 1 0 1 6]
 -> Valid neighbor added.
Attempt 75200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0  0  0  0 -1  0  1  0 -1  1 -1  1 -1] (Indices: [3, 4, 5, 6, 7, 8, 9, 10, 11, 14, 15, 17, 19]), Candidate: [2 1 2 0 1 1 1 0 1 1 0 0 1 2 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 75250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0  0  0 -1  0  1  0  0 -1  1 -1  1 -1] (Indices: [3, 4, 5, 6, 7, 8, 9, 10, 13, 14, 15, 17, 19]), Candidate: [ 2  1  2  0  1  1  1  0  1  1 -1  1  2  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0  0 -1  1  0 -1  0  1 -1  1  0  0 -1] (Indices: [3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 17, 18, 19]), Candidate: [2 1 2 0 1 1 1 0 1 0 1 1 0 1 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 75350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0  0 -1  0  0  0  1  0  0  0  0  0 -1] (Indices: [3, 4, 5, 6, 7, 8, 9, 14, 15, 16, 17, 18, 19]), Candidate: [2 1 2 0 1 1 1 0 1 0 0 1 1 2 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 75400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0 -1  1  0 -1  1 -1  0  1  0  0  0 -1] (Indices: [3, 4, 5, 6, 7, 8, 10, 11, 13, 16, 17, 18, 19]), Candidate: [2 1 2 0 1 1 1 0 0 2 0 0 2 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 75450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0 -1  0  1  0 -1  1  0  0  0  0 -1  0] (Indices: [3, 4, 5, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18]), Candidate: [2 1 2 0 1 1 1 0 0 1 1 1 0 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 75500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  1  0  0  0 -1  1 -1  0  1  0  0 -1] (Indices: [3, 4, 5, 6, 7, 9, 10, 11, 12, 14, 17, 18, 19]), Candidate: [ 2  1  2  0  1  1  1 -1  2  1  0  1  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 75550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  1  0 -1  0  1  0  0  0 -1  1  0 -1] (Indices: [3, 4, 5, 6, 7, 9, 10, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  1  2  0  1  1  1 -1  2  1 -1  1  2  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 75600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  0  1  0  0  0  0 -1  0  1  0  0 -1] (Indices: [3, 4, 5, 6, 7, 10, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  1  2  0  1  1  1 -1  1  2  0  1  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 75650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1  0  0  0  0  0 -1  1 -1  1 -1  1 -1] (Indices: [3, 4, 5, 6, 8, 9, 10, 11, 12, 13, 15, 17, 19]), Candidate: [2 1 2 0 1 1 0 1 1 1 0 1 1 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 75700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1  0  0 -1  1  0  0 -1  1 -1  1  0 -1] (Indices: [3, 4, 5, 6, 8, 9, 10, 12, 13, 14, 16, 18, 19]), Candidate: [ 2  1  2  0  1  1  0  1  1  1 -1  2  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 75750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1  0 -1  0  1  0  0  0  0 -1  1  0 -1] (Indices: [3, 4, 5, 6, 8, 9, 12, 13, 14, 15, 16, 18, 19]), Candidate: [2 1 2 0 1 1 0 1 1 0 0 2 1 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 75800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1 -1  0  0  1  0  0  0  0  0  0  0 -1] (Indices: [3, 4, 5, 6, 8, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 1 2 0 1 1 0 1 0 1 0 2 1 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 75850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  0  0  1  0  0  0  0 -1  1  0  0  0 -1] (Indices: [3, 4, 5, 6, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  2  0  1  1  0  0  1  2  0  1  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0  0  0  0 -1  1  0 -1  0  1  0  0 -1] (Indices: [3, 4, 5, 7, 8, 9, 10, 11, 13, 14, 17, 18, 19]), Candidate: [ 2  1  2  0  1  0  2  0  1  1  0  0  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 75950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0  0 -1  1  0  0 -1  1  0  0  0 -1  0] (Indices: [3, 4, 5, 7, 8, 9, 11, 12, 13, 15, 16, 17, 18]), Candidate: [2 1 2 0 1 0 2 0 1 0 1 1 1 0 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 76000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0 -1  1  0 -1  1  0  0 -1  1  0  0 -1] (Indices: [3, 4, 5, 7, 8, 10, 11, 13, 14, 15, 17, 18, 19]), Candidate: [2 1 2 0 1 0 2 0 0 2 0 0 2 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 76050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1 -1  1  0 -1  1  0  0  0  0  0 -1  1 -1] (Indices: [3, 4, 5, 7, 9, 10, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  1  2  0  1  0  2 -1  2  1 -1  2  1  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 76100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  0  1  0  0  0 -1  1  0  0 -1  1  0  0 -1] (Indices: [3, 4, 5, 8, 9, 10, 11, 13, 14, 15, 17, 18, 19]), Candidate: [2 1 2 0 1 0 1 1 1 1 0 0 2 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 76150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0  0  0  0  0  0  0 -1  0  1 -1  1 -1] (Indices: [3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 17, 19]), Candidate: [ 2  1  2  0  0  2  1  0  1  1  0  1  1  1 -1  1  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0  0  0 -1  1  0  0  0  0 -1  0  1 -1] (Indices: [3, 4, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16, 19]), Candidate: [ 2  1  2  0  0  2  1  0  1  1 -1  2  1  1  0  1  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0  0 -1  1 -1  1  0  0 -1  1  0  0 -1] (Indices: [3, 4, 6, 7, 8, 9, 11, 13, 14, 15, 17, 18, 19]), Candidate: [2 1 2 0 0 2 1 0 1 0 1 0 2 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 76300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0 -1  0  1  0  0  0  0  0 -1  1  0 -1] (Indices: [3, 4, 6, 7, 8, 11, 12, 13, 14, 15, 16, 18, 19]), Candidate: [2 1 2 0 0 2 1 0 0 1 1 1 1 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 76350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  1 -1  1 -1  1  0  0  0  0  0  0 -1] (Indices: [3, 4, 6, 7, 9, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  2  0  0  2  1 -1  2  0  1  0  2  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1 -1  1  0 -1  1  0  0  0  0  0 -1  1  0 -1] (Indices: [3, 4, 6, 8, 9, 11, 12, 13, 14, 15, 16, 18, 19]), Candidate: [2 1 2 0 0 2 0 1 1 0 1 1 1 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 76450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  1  0  0  0  0 -1  1  0  0  0  0 -1  1 -1] (Indices: [3, 4, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 19]), Candidate: [2 1 2 0 0 1 2 0 1 1 0 0 2 1 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 76500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  0  0  1  0  0  0  0 -1  1  0  0  0  0  0 -1] (Indices: [3, 4, 8, 9, 10, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [2 1 2 0 0 1 1 1 1 1 0 1 0 2 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 76550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0  0  0  0 -1  1  0 -1  0  1  0  0 -1] (Indices: [3, 5, 6, 7, 8, 9, 10, 11, 13, 14, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  1  1  0  1  1  0  0  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 76600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0  0 -1  1  0  0 -1  1  0  0  0 -1  0] (Indices: [3, 5, 6, 7, 8, 9, 11, 12, 13, 15, 16, 17, 18]), Candidate: [ 2  1  2 -1  2  1  1  0  1  0  1  1  1  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0 -1  1  0 -1  1  0  0 -1  1  0  0 -1] (Indices: [3, 5, 6, 7, 8, 10, 11, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  1  1  0  0  2  0  0  2  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  1  0 -1  1  0  0  0  0  0 -1  1 -1] (Indices: [3, 5, 6, 7, 9, 10, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  1  2 -1  2  1  1 -1  2  1 -1  2  1  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 76750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0 -1  1  0  0  0 -1  1  0  0 -1  1  0  0 -1] (Indices: [3, 5, 6, 8, 9, 10, 11, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  1  0  1  1  1  0  0  2  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 76800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1  0  0  0  0  0  0  0 -1  1 -1  1  0 -1] (Indices: [3, 5, 7, 8, 9, 10, 11, 12, 13, 14, 16, 18, 19]), Candidate: [ 2  1  2 -1  2  0  2  0  1  1  0  1  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 76850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1 -1  1 -1  1  0  0  0  0  0  0 -1  1  0  0 -1] (Indices: [3, 5, 7, 9, 10, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  0  2 -1  2  1  0  1  1  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 76900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  1  0  0  0  0 -1  1  0  0  0  0 -1  1  0 -1] (Indices: [3, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  1  2 -1  1  2  1  0  1  1 -1  2  1  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 76950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  0  0  1  0  0  0  0  0  0  0  0  0 -1  1  0 -1] (Indices: [3, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  1  2 -1  1  1  2  0  1  1  0  1  1  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0  0  0  0 -1  1  0  0 -1  1 -1  1 -1] (Indices: [4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15, 17, 19]), Candidate: [2 1 1 1 1 1 1 0 1 1 0 0 2 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 77050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0  0 -1  1  0  0  0  0 -1  0  1  0 -1] (Indices: [4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 18, 19]), Candidate: [2 1 1 1 1 1 1 0 1 0 1 1 1 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 77100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0 -1  1  0  0 -1  1 -1  1  0  0  0 -1] (Indices: [4, 5, 6, 7, 8, 10, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  1  1  1  1  0  0  2  0  1  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  1  0  0 -1  1  0  0 -1  1  0  0 -1] (Indices: [4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  1  1  1  1  1  1 -1  2  1  0  0  2  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0 -1  1  0  0  0  0 -1  1 -1  1  0  0  0 -1] (Indices: [4, 5, 6, 8, 9, 10, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  1  1  1  0  1  1  1  0  1  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0  0  0  0  0  0  0  0 -1  1  0 -1  0] (Indices: [4, 5, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 18]), Candidate: [2 1 1 1 1 0 2 0 1 1 0 1 1 1 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 77300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0 -1  1  0 -1  1 -1  1  0  0  0  0  0  0  0 -1] (Indices: [4, 5, 7, 8, 10, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1  1  1  0  2  0  0  2 -1  2  1  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1  0  0  0  0  0 -1  1  0 -1  1  0  0  0 -1] (Indices: [4, 6, 7, 8, 9, 10, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  1  0  2  1  0  1  1  0  0  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1 -1  1 -1  1  0 -1  1  0  0  0  0  0  0  0  0 -1] (Indices: [4, 6, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 1 1 1 0 2 0 1 1 0 1 1 1 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 77450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0  0  0 -1  1 -1  1  0  0  0  0  0 -1] (Indices: [5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  2  1  1  0  1  1 -1  2  0  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 77500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1 -1  1  0  0  0  0  0 -1  1  0  0  0  0  0 -1] (Indices: [5, 7, 8, 9, 10, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [2 1 1 0 2 0 2 0 1 1 0 1 0 2 0 1 1 1 1 5]
 -> Valid neighbor added.
Finished generating neighbors. Total valid neighbors found: 25688
  Size of neighborhood t=13: 25688
  Using 'fork' start method for multiprocessing.
  No improvement found for t=13 after processing 25688 neighbors.
No improving solution found or error occurred for t=13.

Attempting neighborhood t=14 (current best cost: 98.4663)
  Exploring neighborhood t=14 in parallel (current cost: 98.4663)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Attempt 50: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0  0 -1  0  1  0  0 -1  0  0  0  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 13, 14, 15]), Candidate: [ 2  1  1  0  1  1  1  0  1  1 -1  1  2  1  0  0  1  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0 -1  1  0 -1  0  0  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 16, 17]), Candidate: [2 1 1 0 1 1 1 0 1 0 1 1 0 1 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0 -1  0  1  0 -1  0  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 12, 13, 16, 17]), Candidate: [2 1 1 0 1 1 1 0 1 0 0 2 1 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0 -1  0  0  0  1  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 14, 15, 17, 19]), Candidate: [2 1 1 0 1 1 1 0 1 0 0 1 1 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0 -1  1  0 -1  0  1  0 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 14, 15, 19]), Candidate: [2 1 1 0 1 1 1 0 0 2 0 0 1 2 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0 -1  1 -1  1 -1  0  0  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 16, 18, 19]), Candidate: [ 2  1  1  0  1  1  1  0  0  2 -1  2  0  1  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0 -1  0  1  0  0 -1  0  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 17, 19]), Candidate: [2 1 1 0 1 1 1 0 0 1 1 1 1 0 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0 -1  0  1 -1  0  1 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 11, 14, 16, 18, 19]), Candidate: [ 2  1  1  0  1  1  1  0  0  1  1  0  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0 -1  0  0  0  1  0 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 13, 14, 16, 18, 19]), Candidate: [ 2  1  1  0  1  1  1  0  0  1  0  1  2  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  1  0  0 -1  0  1  0 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 14, 15, 17]), Candidate: [ 2  1  1  0  1  1  1 -1  2  1  0  0  1  2  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  1  0 -1  1 -1  0  0  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 12, 16, 17, 18]), Candidate: [ 2  1  1  0  1  1  1 -1  2  1 -1  2  0  1  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  1 -1  1  0  0 -1  0  1 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 9, 11, 12, 13, 16, 19]), Candidate: [ 2  1  1  0  1  1  1 -1  2  0  1  1  1  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  1 -1  1 -1  0  1 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 9, 11, 14, 16, 17, 18]), Candidate: [ 2  1  1  0  1  1  1 -1  2  0  1  0  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  1 -1  0  0  1  0 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 9, 13, 14, 16, 17, 18]), Candidate: [ 2  1  1  0  1  1  1 -1  2  0  0  1  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  0  1  0 -1  1  0  0  0 -1  0  0  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 10, 11, 13, 14, 15, 16]), Candidate: [ 2  1  1  0  1  1  1 -1  1  2  0  0  2  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  0  1 -1  1  0 -1  1 -1  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 10, 12, 13, 15, 18, 19]), Candidate: [ 2  1  1  0  1  1  1 -1  1  2 -1  2  1  0  1  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  0  0  1  0  0  0 -1  0  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 11, 12, 13, 14, 18, 19]), Candidate: [ 2  1  1  0  1  1  1 -1  1  1  1  1  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  0  0  0  1  0  0  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 12, 13, 14, 15, 17, 18]), Candidate: [ 2  1  1  0  1  1  1 -1  1  1  0  2  1  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1  0  0  0 -1  1  0 -1  0  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 9, 10, 11, 13, 14, 19]), Candidate: [ 2  1  1  0  1  1  0  1  1  1  0  0  2  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1  0  0 -1  1 -1  1 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 14, 16, 17]), Candidate: [ 2  1  1  0  1  1  0  1  1  1 -1  2  0  2 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1  0  0 -1  0  0  0  0  1  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 9, 10, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  1  1  0  1  1  1 -1  1  1  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1  0 -1  1 -1  1 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 9, 11, 13, 15, 17, 19]), Candidate: [2 1 1 0 1 1 0 1 1 0 1 0 2 0 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 1150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1  0 -1  0  1 -1  1 -1  0  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 9, 12, 14, 17, 18, 19]), Candidate: [ 2  1  1  0  1  1  0  1  1  0  0  2  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1 -1  1  0  0 -1  1 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 10, 11, 12, 14, 17, 19]), Candidate: [ 2  1  1  0  1  1  0  1  0  2  0  1  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1 -1  1 -1  1  0  0  0 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 10, 12, 13, 14, 15, 19]), Candidate: [ 2  1  1  0  1  1  0  1  0  2 -1  2  1  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1 -1  1 -1  0  0  1  0 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 10, 14, 15, 17, 18, 19]), Candidate: [ 2  1  1  0  1  1  0  1  0  2 -1  1  1  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1 -1  0  1 -1  1 -1  1  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 11, 13, 15, 16, 18, 19]), Candidate: [2 1 1 0 1 1 0 1 0 1 1 0 2 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 1400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  1  0  0  0  0 -1  0  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 9, 10, 11, 12, 13, 17, 19]), Candidate: [2 1 1 0 1 1 0 0 2 1 0 1 1 0 0 1 2 0 2 6]
 -> Valid neighbor added.
Attempt 1450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  1  0  0 -1  0  1 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 9, 10, 11, 14, 16, 18, 19]), Candidate: [ 2  1  1  0  1  1  0  0  2  1  0  0  1  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  1  0 -1  0  1  0 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 9, 10, 13, 14, 16, 18, 19]), Candidate: [ 2  1  1  0  1  1  0  0  2  1 -1  1  2  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  1 -1  1 -1  1  0  0  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 9, 11, 13, 14, 15, 16, 19]), Candidate: [2 1 1 0 1 1 0 0 2 0 1 0 2 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 1600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  0  1  0  0  0  0  0 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 10, 11, 12, 13, 14, 15, 19]), Candidate: [2 1 1 0 1 1 0 0 1 2 0 1 1 1 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 1650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  0  1  0 -1  0  1  0 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 10, 11, 14, 15, 17, 18, 19]), Candidate: [2 1 1 0 1 1 0 0 1 2 0 0 1 2 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 1700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  0  0  1  0 -1  1 -1  1  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  1  1  0  0  1  1  1  1  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0  0  0  0 -1  1 -1  0  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 13, 17, 18]), Candidate: [2 1 1 0 1 0 2 0 1 1 0 0 2 0 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 1800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0  0  0 -1  1 -1  0  1  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 9, 10, 12, 15, 16, 19]), Candidate: [ 2  1  1  0  1  0  2  0  1  1 -1  2  0  1  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0  0 -1  1  0  0 -1  1 -1  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 9, 11, 12, 13, 15, 18]), Candidate: [2 1 1 0 1 0 2 0 1 0 1 1 1 0 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 1900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0  0 -1  1 -1  0  1  0  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 9, 11, 14, 15, 16, 19]), Candidate: [2 1 1 0 1 0 2 0 1 0 1 0 1 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 1950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0  0 -1  0  0  1  0  0  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 9, 13, 14, 15, 16, 19]), Candidate: [2 1 1 0 1 0 2 0 1 0 0 1 2 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 2000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0 -1  1  0  0 -1  0  0  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 10, 11, 12, 16, 17, 18]), Candidate: [2 1 1 0 1 0 2 0 0 2 0 1 0 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 2050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0 -1  1 -1  1  0 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 10, 12, 13, 15, 16, 18]), Candidate: [ 2  1  1  0  1  0  2  0  0  2 -1  2  1  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0 -1  0  1  0  0  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 11, 12, 13, 14, 16, 18]), Candidate: [ 2  1  1  0  1  0  2  0  0  1  1  1  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0 -1  0  1 -1  0  0  1  0  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 11, 15, 16, 17, 18, 19]), Candidate: [2 1 1 0 1 0 2 0 0 1 1 0 1 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 2200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  1  0  0  0 -1  1 -1  1 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 9, 10, 11, 12, 14, 16, 19]), Candidate: [ 2  1  1  0  1  0  2 -1  2  1  0  1  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  1  0 -1  1  0  0  0 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 9, 10, 12, 13, 14, 15, 17]), Candidate: [ 2  1  1  0  1  0  2 -1  2  1 -1  2  1  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  1  0 -1  0  0  1  0  0  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 9, 10, 14, 15, 16, 17, 19]), Candidate: [ 2  1  1  0  1  0  2 -1  2  1 -1  1  1  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  1 -1  1 -1  1 -1  1  0  0  0 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 9, 11, 13, 15, 16, 17, 18]), Candidate: [ 2  1  1  0  1  0  2 -1  2  0  1  0  2  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  0  1  0  0  0 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 10, 11, 12, 13, 15, 16, 18]), Candidate: [ 2  1  1  0  1  0  2 -1  1  2  0  1  1  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  0  1 -1  1  0  0  0 -1  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 10, 12, 13, 14, 15, 18, 19]), Candidate: [ 2  1  1  0  1  0  2 -1  1  2 -1  2  1  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  0  0  1 -1  0  1  0  0  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 11, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  1  0  2 -1  1  1  1  0  1  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1  0  0  0 -1  1  0 -1  1 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 8, 9, 10, 11, 13, 14, 16, 19]), Candidate: [ 2  1  1  0  1  0  1  1  1  1  0  0  2  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1  0  0 -1  1 -1  1  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 8, 9, 10, 12, 14, 15, 16, 18]), Candidate: [ 2  1  1  0  1  0  1  1  1  1 -1  2  0  2  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1  0 -1  1  0  0 -1  1 -1  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 8, 9, 11, 12, 13, 15, 18, 19]), Candidate: [2 1 1 0 1 0 1 1 1 0 1 1 1 0 1 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 2700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1  0 -1  0  1  0  0 -1  0  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 8, 9, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  1  1  0  1  0  1  1  1  0  0  2  1  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1 -1  1  0  0 -1  0  1  0  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 8, 10, 11, 12, 15, 16, 17, 19]), Candidate: [2 1 1 0 1 0 1 1 0 2 0 1 0 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 2800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1 -1  1 -1  0  1  0 -1  1  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 8, 10, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  1  0  1  1  0  2 -1  1  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  1  0  0  0  0 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 9, 10, 11, 12, 13, 15, 16, 18]), Candidate: [2 1 1 0 1 0 1 0 2 1 0 1 1 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 2900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  1  0 -1  1  0  0  0 -1  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 9, 10, 12, 13, 14, 15, 18, 19]), Candidate: [ 2  1  1  0  1  0  1  0  2  1 -1  2  1  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  1 -1  1 -1  0  1  0  0  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 9, 11, 14, 15, 16, 17, 18, 19]), Candidate: [2 1 1 0 1 0 1 0 2 0 1 0 1 2 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 3000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  0  0  1  0  0 -1  1  0  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 11, 12, 13, 15, 16, 17, 18, 19]), Candidate: [2 1 1 0 1 0 1 0 1 1 1 1 1 0 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 3050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0  0  0  0 -1  0  0  1  0  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 15, 16, 17]), Candidate: [2 1 1 0 0 2 1 0 1 1 0 0 1 1 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 3100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0  0  0 -1  0  1  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 9, 10, 13, 14, 16, 18]), Candidate: [ 2  1  1  0  0  2  1  0  1  1 -1  1  2  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0  0 -1  1  0 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 9, 11, 12, 14, 16, 18]), Candidate: [ 2  1  1  0  0  2  1  0  1  0  1  1  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0  0 -1  0  1  0  0  0  0 -1  0  0  1] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 9, 12, 13, 14, 15, 16]), Candidate: [2 1 1 0 0 2 1 0 1 0 0 2 1 1 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 3250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0  0 -1  0  0  0  1  0  0  0  0 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 9, 14, 15, 16, 17, 18]), Candidate: [2 1 1 0 0 2 1 0 1 0 0 1 1 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 3300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0 -1  1  0 -1  1  0 -1  0  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 10, 11, 13, 14, 18, 19]), Candidate: [ 2  1  1  0  0  2  1  0  0  2  0  0  2  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0 -1  1 -1  1 -1  1  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 10, 12, 14, 15, 17, 19]), Candidate: [ 2  1  1  0  0  2  1  0  0  2 -1  2  0  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0 -1  0  1  0  0 -1  0  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 11, 12, 13, 16, 18, 19]), Candidate: [2 1 1 0 0 2 1 0 0 1 1 1 1 0 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 3450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0 -1  0  0  1  0 -1  1  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 12, 13, 15, 16, 18, 19]), Candidate: [2 1 1 0 0 2 1 0 0 1 0 2 1 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 3500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  1  0  0  0 -1  0  0  0  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 9, 10, 11, 12, 17, 18, 19]), Candidate: [ 2  1  1  0  0  2  1 -1  2  1  0  1  0  1  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  1  0 -1  1  0 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 9, 10, 12, 13, 15, 17, 19]), Candidate: [ 2  1  1  0  0  2  1 -1  2  1 -1  2  1  0  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  1 -1  1  0  0  0 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 9, 11, 12, 13, 14, 17, 19]), Candidate: [ 2  1  1  0  0  2  1 -1  2  0  1  1  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  1 -1  0  1  0  0  0  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 9, 12, 13, 14, 15, 16, 19]), Candidate: [ 2  1  1  0  0  2  1 -1  2  0  0  2  1  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  0  1  0  0 -1  1  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 10, 11, 12, 14, 15, 17, 19]), Candidate: [ 2  1  1  0  0  2  1 -1  1  2  0  1  0  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  0  1 -1  1 -1  1  0 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 10, 12, 14, 15, 17, 18, 19]), Candidate: [ 2  1  1  0  0  2  1 -1  1  2 -1  2  0  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1  0  0  0  0  0  0 -1  0  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 6, 8, 9, 10, 11, 12, 13, 14, 19]), Candidate: [ 2  1  1  0  0  2  0  1  1  1  0  1  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1  0  0  0 -1  1 -1  0  0  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 6, 8, 9, 10, 11, 13, 17, 18, 19]), Candidate: [2 1 1 0 0 2 0 1 1 1 0 0 2 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 3900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1  0  0 -1  1 -1  0  0  1  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 6, 8, 9, 10, 12, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  0  2  0  1  1  1 -1  2  0  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1  0 -1  1  0 -1  1 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 6, 8, 9, 11, 12, 14, 16, 18, 19]), Candidate: [ 2  1  1  0  0  2  0  1  1  0  1  1  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1  0 -1  0  0  1  0  0  0  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 6, 8, 9, 13, 14, 15, 16, 17, 19]), Candidate: [2 1 1 0 0 2 0 1 1 0 0 1 2 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 4050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1 -1  1  0 -1  1  0 -1  0  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 6, 8, 10, 11, 13, 14, 17, 18, 19]), Candidate: [ 2  1  1  0  0  2  0  1  0  2  0  0  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1 -1  0  1  0  0 -1  1  0  0  0 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 8, 11, 12, 13, 15, 16, 17, 18]), Candidate: [2 1 1 0 0 2 0 1 0 1 1 1 1 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 4150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  1  0  0  0 -1  1  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 6, 9, 10, 11, 12, 14, 15, 17, 19]), Candidate: [2 1 1 0 0 2 0 0 2 1 0 1 0 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 4200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  1  0 -1  1 -1  1  0 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 6, 9, 10, 12, 14, 15, 17, 18, 19]), Candidate: [ 2  1  1  0  0  2  0  0  2  1 -1  2  0  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  0  1  0  0  0  0  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 6, 10, 11, 12, 13, 14, 15, 17, 19]), Candidate: [2 1 1 0 0 2 0 0 1 2 0 1 1 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 4300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0  0  0  0  0  0 -1  0  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 7, 8, 9, 10, 11, 12, 13, 16, 17]), Candidate: [2 1 1 0 0 1 2 0 1 1 0 1 1 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 4350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0  0  0  0 -1  0  1  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 7, 8, 9, 10, 11, 14, 15, 17, 19]), Candidate: [2 1 1 0 0 1 2 0 1 1 0 0 1 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 4400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0  0  0 -1  0  1  0  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 7, 8, 9, 10, 13, 14, 15, 17, 19]), Candidate: [ 2  1  1  0  0  1  2  0  1  1 -1  1  2  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0  0 -1  1  0 -1  0  1 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 7, 8, 9, 11, 12, 15, 17, 18, 19]), Candidate: [2 1 1 0 0 1 2 0 1 0 1 1 0 1 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 4500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0  0 -1  0  0  0  1  0  0  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 7, 8, 9, 14, 15, 16, 17, 18, 19]), Candidate: [2 1 1 0 0 1 2 0 1 0 0 1 1 2 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 4550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0 -1  1  0 -1  1 -1  0  1  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 7, 8, 10, 11, 13, 16, 17, 18, 19]), Candidate: [2 1 1 0 0 1 2 0 0 2 0 0 2 0 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 4600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0 -1  0  1  0 -1  1  0  0  0  0 -1  1] (Indices: [0, 1, 2, 3, 4, 7, 8, 11, 12, 14, 15, 16, 17, 18]), Candidate: [2 1 1 0 0 1 2 0 0 1 1 1 0 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 4650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  1  0  0  0 -1  1 -1  0  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 7, 9, 10, 11, 12, 14, 17, 18, 19]), Candidate: [ 2  1  1  0  0  1  2 -1  2  1  0  1  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  1  0 -1  0  1  0  0  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 7, 9, 10, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  1  1  0  0  1  2 -1  2  1 -1  1  2  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  0  1  0  0  0  0 -1  0  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 7, 10, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  1  1  0  0  1  2 -1  1  2  0  1  1  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1  0  0  0  0  0 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 8, 9, 10, 11, 12, 13, 15, 17, 19]), Candidate: [2 1 1 0 0 1 1 1 1 1 0 1 1 0 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 4850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1  0  0 -1  1  0  0 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 8, 9, 10, 12, 13, 14, 16, 18, 19]), Candidate: [ 2  1  1  0  0  1  1  1  1  1 -1  2  1  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1  0 -1  0  1  0  0  0  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 8, 9, 12, 13, 14, 15, 16, 18, 19]), Candidate: [2 1 1 0 0 1 1 1 1 0 0 2 1 1 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 4950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1 -1  0  0  1  0  0  0  0  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 8, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 1 1 0 0 1 1 1 0 1 0 2 1 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 5000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  0  1  0  0  0  0 -1  1  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  0  1  1  0  1  2  0  1  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0  0  0  0 -1  0  1 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 9, 10, 11, 14, 17, 19]), Candidate: [ 2  1  1 -1  2  1  1  0  1  1  0  0  1  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0  0  0 -1  0  1  0  0 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 9, 10, 13, 14, 15, 19]), Candidate: [ 2  1  1 -1  2  1  1  0  1  1 -1  1  2  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0  0 -1  1  0 -1  1  0 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 9, 11, 12, 14, 15, 19]), Candidate: [ 2  1  1 -1  2  1  1  0  1  0  1  1  0  2  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0  0 -1  1 -1  0  0  1 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 9, 11, 15, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  1  1  0  1  0  1  0  1  1  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0  0 -1  0  0  1 -1  1 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 9, 13, 15, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  1  1  0  1  0  0  1  2  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0 -1  1  0 -1  1  0 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 10, 11, 13, 14, 17, 18]), Candidate: [ 2  1  1 -1  2  1  1  0  0  2  0  0  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0 -1  1 -1  1 -1  1  0  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 10, 12, 14, 15, 16, 19]), Candidate: [ 2  1  1 -1  2  1  1  0  0  2 -1  2  0  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0 -1  0  1  0  0 -1  0  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 11, 12, 13, 16, 17, 18]), Candidate: [ 2  1  1 -1  2  1  1  0  0  1  1  1  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0 -1  0  0  1  0 -1  1  0  0  0 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 12, 13, 15, 16, 17, 18]), Candidate: [ 2  1  1 -1  2  1  1  0  0  1  0  2  1  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  1  0  0  0 -1  0  0  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 9, 10, 11, 12, 16, 17, 19]), Candidate: [ 2  1  1 -1  2  1  1 -1  2  1  0  1  0  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  1  0 -1  1  0 -1  1  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 9, 10, 12, 13, 15, 16, 19]), Candidate: [ 2  1  1 -1  2  1  1 -1  2  1 -1  2  1  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 5600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  1 -1  1  0  0  0 -1  1 -1  0  1  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 9, 11, 12, 13, 14, 16, 19]), Candidate: [ 2  1  1 -1  2  1  1 -1  2  0  1  1  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 5650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  1 -1  0  1  0  0  0  0  0 -1  0  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 9, 12, 13, 14, 15, 16, 17]), Candidate: [ 2  1  1 -1  2  1  1 -1  2  0  0  2  1  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  0  1  0  0 -1  1  0  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 10, 11, 12, 14, 15, 16, 19]), Candidate: [ 2  1  1 -1  2  1  1 -1  1  2  0  1  0  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  0  1 -1  1 -1  1  0  0  0 -1  1  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 10, 12, 14, 15, 16, 17, 19]), Candidate: [ 2  1  1 -1  2  1  1 -1  1  2 -1  2  0  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 5800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1  0  0  0  0  0  0 -1  0  1 -1  0  1] (Indices: [0, 1, 2, 3, 5, 6, 8, 9, 10, 11, 12, 13, 14, 17]), Candidate: [ 2  1  1 -1  2  1  0  1  1  1  0  1  1  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1  0  0  0 -1  1 -1  0  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 5, 6, 8, 9, 10, 11, 13, 16, 17, 19]), Candidate: [ 2  1  1 -1  2  1  0  1  1  1  0  0  2  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1  0  0 -1  1 -1  0  1  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 5, 6, 8, 9, 10, 12, 15, 16, 18, 19]), Candidate: [ 2  1  1 -1  2  1  0  1  1  1 -1  2  0  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 5950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1  0 -1  1  0 -1  1 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 8, 9, 11, 12, 14, 16, 17, 18]), Candidate: [ 2  1  1 -1  2  1  0  1  1  0  1  1  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1  0 -1  0  1 -1  0  1  0  0  0  0  0] (Indices: [0, 1, 2, 3, 5, 6, 8, 9, 12, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  1  0  1  1  0  0  2  0  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1 -1  1  0 -1  1  0 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 5, 6, 8, 10, 11, 13, 14, 16, 17, 19]), Candidate: [ 2  1  1 -1  2  1  0  1  0  2  0  0  2  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1 -1  0  1  0  0  0 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 3, 5, 6, 8, 11, 12, 13, 14, 16, 18, 19]), Candidate: [ 2  1  1 -1  2  1  0  1  0  1  1  1  1  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  1  0  0  0 -1  1  0  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 5, 6, 9, 10, 11, 12, 14, 15, 16, 19]), Candidate: [ 2  1  1 -1  2  1  0  0  2  1  0  1  0  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  1  0 -1  1 -1  1  0  0  0 -1  1  0] (Indices: [0, 1, 2, 3, 5, 6, 9, 10, 12, 14, 15, 16, 17, 19]), Candidate: [ 2  1  1 -1  2  1  0  0  2  1 -1  2  0  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  0  1  0  0  0  0  0  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 5, 6, 10, 11, 12, 13, 14, 15, 16, 19]), Candidate: [ 2  1  1 -1  2  1  0  0  1  2  0  1  1  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0  0  0  0  0  0 -1  1 -1  0  1 -1  1] (Indices: [0, 1, 2, 3, 5, 7, 8, 9, 10, 11, 12, 13, 15, 18]), Candidate: [ 2  1  1 -1  2  0  2  0  1  1  0  1  1  0  1  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0  0  0  0 -1  0  1  0  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 5, 7, 8, 9, 10, 11, 14, 15, 16, 19]), Candidate: [ 2  1  1 -1  2  0  2  0  1  1  0  0  1  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0  0  0 -1  0  1  0  0  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 5, 7, 8, 9, 10, 13, 14, 15, 16, 19]), Candidate: [ 2  1  1 -1  2  0  2  0  1  1 -1  1  2  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0  0 -1  1  0 -1  0  1  0  0 -1  1  0] (Indices: [0, 1, 2, 3, 5, 7, 8, 9, 11, 12, 15, 16, 17, 19]), Candidate: [ 2  1  1 -1  2  0  2  0  1  0  1  1  0  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0  0 -1  0  0  1  0 -1  1  0  0  0  0] (Indices: [0, 1, 2, 3, 5, 7, 8, 9, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  0  2  0  1  0  0  1  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0 -1  1  0 -1  1 -1  1  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 5, 7, 8, 10, 11, 13, 15, 16, 18, 19]), Candidate: [ 2  1  1 -1  2  0  2  0  0  2  0  0  2  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0 -1  0  1  0  0 -1  1 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 5, 7, 8, 11, 12, 13, 15, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  0  2  0  0  1  1  1  1  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  1  0  0  0 -1  1 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 5, 7, 9, 10, 11, 12, 14, 16, 17, 19]), Candidate: [ 2  1  1 -1  2  0  2 -1  2  1  0  1  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 6700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  1  0 -1  0  1  0  0  0  0  0 -1  1] (Indices: [0, 1, 2, 3, 5, 7, 9, 10, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  1  1 -1  2  0  2 -1  2  1 -1  1  2  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 6750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  0  1  0  0  0  0 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 5, 7, 10, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  1  1 -1  2  0  2 -1  1  2  0  1  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 6800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1  0  0  0  0  0 -1  1  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 5, 8, 9, 10, 11, 12, 13, 15, 16, 19]), Candidate: [ 2  1  1 -1  2  0  1  1  1  1  0  1  1  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1  0  0 -1  1  0  0 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 5, 8, 9, 10, 12, 13, 14, 16, 17, 18]), Candidate: [ 2  1  1 -1  2  0  1  1  1  1 -1  2  1  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 6900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1  0 -1  0  1  0  0  0  0  0  0 -1  1] (Indices: [0, 1, 2, 3, 5, 8, 9, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  1  1 -1  2  0  1  1  1  0  0  2  1  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1 -1  0  1  0 -1  1  0  0  0  0  0  0] (Indices: [0, 1, 2, 3, 5, 8, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  0  1  1  0  1  1  1  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  0  1  0  0  0  0  0  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 5, 10, 11, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  1  1 -1  2  0  1  0  1  2  0  1  1  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0  0  0  0 -1  1  0 -1  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 6, 7, 8, 9, 10, 11, 13, 14, 17, 18]), Candidate: [ 2  1  1 -1  1  2  1  0  1  1  0  0  2  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0  0  0 -1  1 -1  1  0  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 6, 7, 8, 9, 10, 12, 14, 15, 16, 19]), Candidate: [ 2  1  1 -1  1  2  1  0  1  1 -1  2  0  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0  0 -1  1  0  0 -1  0  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 6, 7, 8, 9, 11, 12, 13, 16, 17, 18]), Candidate: [ 2  1  1 -1  1  2  1  0  1  0  1  1  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0  0 -1  0  1  0 -1  1  0  0  0 -1  1] (Indices: [0, 1, 2, 3, 6, 7, 8, 9, 12, 13, 15, 16, 17, 18]), Candidate: [ 2  1  1 -1  1  2  1  0  1  0  0  2  1  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0 -1  1  0  0 -1  0  1  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 6, 7, 8, 10, 11, 12, 15, 16, 18, 19]), Candidate: [ 2  1  1 -1  1  2  1  0  0  2  0  1  0  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0 -1  1 -1  0  1 -1  1  0  0  0  0  0] (Indices: [0, 1, 2, 3, 6, 7, 8, 10, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  2  1  0  0  2 -1  1  2  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  1  0  0  0  0 -1  1  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 6, 7, 9, 10, 11, 12, 13, 15, 16, 19]), Candidate: [ 2  1  1 -1  1  2  1 -1  2  1  0  1  1  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  1  0 -1  1  0  0 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 6, 7, 9, 10, 12, 13, 14, 16, 17, 18]), Candidate: [ 2  1  1 -1  1  2  1 -1  2  1 -1  2  1  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 7450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  1 -1  0  1  0  0  0  0  0  0 -1  1] (Indices: [0, 1, 2, 3, 6, 7, 9, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  1  1 -1  1  2  1 -1  2  0  0  2  1  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  0  0  1  0 -1  1  0  0  0  0  0  0] (Indices: [0, 1, 2, 3, 6, 7, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  2  1 -1  1  1  1  1  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1  0  0  0 -1  1 -1  1  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 6, 8, 9, 10, 11, 13, 15, 16, 18, 19]), Candidate: [ 2  1  1 -1  1  2  0  1  1  1  0  0  2  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1  0 -1  1  0  0 -1  1 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 6, 8, 9, 11, 12, 13, 15, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  2  0  1  1  0  1  1  1  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1 -1  1  0 -1  0  1  0  0  0  0  0  0] (Indices: [0, 1, 2, 3, 6, 8, 10, 11, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  2  0  1  0  2  0  0  1  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  0  1  0 -1  1  0  0 -1  1  0  0  0  0] (Indices: [0, 1, 2, 3, 6, 9, 10, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  2  0  0  2  1 -1  2  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 7750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0  0  0  0  0 -1  1 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 7, 8, 9, 10, 11, 12, 14, 16, 17, 19]), Candidate: [ 2  1  1 -1  1  1  2  0  1  1  0  1  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0  0  0 -1  0  1  0  0  0  0  0 -1  1] (Indices: [0, 1, 2, 3, 7, 8, 9, 10, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  1  1 -1  1  1  2  0  1  1 -1  1  2  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0 -1  1  0  0  0  0 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 7, 8, 10, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  1  1 -1  1  1  2  0  0  2  0  1  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  1  0  0  0  0 -1  1  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 7, 9, 10, 11, 12, 13, 15, 16, 18, 19]), Candidate: [ 2  1  1 -1  1  1  2 -1  2  1  0  1  1  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  1  0  0  0  0  0  0 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 8, 9, 10, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  1  1 -1  1  1  1  1  1  1  0  1  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  0  0  1  0  0  0  0  0  0  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 9, 10, 11, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  1  1 -1  1  1  1  0  2  1  0  1  1  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0  0  0  0 -1  0  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 9, 10, 11, 14, 16, 18]), Candidate: [ 2  1  0  1  1  1  1  0  1  1  0  0  1  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0  0  0 -1  0  1  0  0  0 -1  0  0  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 9, 10, 13, 14, 15, 16]), Candidate: [ 2  1  0  1  1  1  1  0  1  1 -1  1  2  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0  0 -1  1  0 -1  1  0  0 -1  0  0  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 9, 11, 12, 14, 15, 16]), Candidate: [2 1 0 1 1 1 1 0 1 0 1 1 0 2 0 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 8200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0  0 -1  1 -1  0  0  1  0  0  0 -1  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 9, 11, 15, 16, 17, 18]), Candidate: [2 1 0 1 1 1 1 0 1 0 1 0 1 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 8250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0  0 -1  0  0  1 -1  1  0  0  0 -1  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 9, 13, 15, 16, 17, 18]), Candidate: [2 1 0 1 1 1 1 0 1 0 0 1 2 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 8300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0 -1  1  0 -1  1  0 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 10, 11, 13, 14, 16, 17]), Candidate: [ 2  1  0  1  1  1  1  0  0  2  0  0  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0 -1  1 -1  1  0 -1  0  0  1  0  0  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 10, 12, 13, 17, 18, 19]), Candidate: [ 2  1  0  1  1  1  1  0  0  2 -1  2  1  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0 -1  0  1  0  0 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 11, 12, 13, 15, 17, 18]), Candidate: [2 1 0 1 1 1 1 0 0 1 1 1 1 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 8450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0 -1  0  0  1  0  0 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  1  0  1  1  1  1  0  0  1  0  2  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  1  0  0  0 -1  0  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 9, 10, 11, 12, 15, 17, 19]), Candidate: [ 2  1  0  1  1  1  1 -1  2  1  0  1  0  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  1  0 -1  1  0  0 -1  0  0  1  0  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 9, 10, 12, 13, 14, 18, 19]), Candidate: [ 2  1  0  1  1  1  1 -1  2  1 -1  2  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 8600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  1 -1  1  0  0  0  0 -1  0  0  1  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 9, 11, 12, 13, 14, 15, 19]), Candidate: [ 2  1  0  1  1  1  1 -1  2  0  1  1  1  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  1 -1  1 -1  0  1  0 -1  1  0  0  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 9, 11, 14, 15, 17, 18, 19]), Candidate: [ 2  1  0  1  1  1  1 -1  2  0  1  0  1  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  0  1  0  0  0 -1  0  0  1  0  0  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 10, 11, 12, 13, 17, 18, 19]), Candidate: [ 2  1  0  1  1  1  1 -1  1  2  0  1  1  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  0  1 -1  1  0 -1  1 -1  1  0  0  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 10, 12, 13, 15, 17, 18, 19]), Candidate: [ 2  1  0  1  1  1  1 -1  1  2 -1  2  1  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  0  0  0  0  1  0  0  0  0  0  0  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  0  1  1  1  1 -1  1  1  0  1  2  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1  0  0  0 -1  1 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 4, 5, 6, 8, 9, 10, 11, 13, 15, 17, 19]), Candidate: [2 1 0 1 1 1 0 1 1 1 0 0 2 0 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 8900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1  0  0 -1  1 -1  1 -1  0  1  0  0  0] (Indices: [0, 1, 2, 4, 5, 6, 8, 9, 10, 12, 14, 17, 18, 19]), Candidate: [ 2  1  0  1  1  1  0  1  1  1 -1  2  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1  0 -1  1  0 -1  1  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 4, 5, 6, 8, 9, 11, 12, 14, 15, 17, 18]), Candidate: [2 1 0 1 1 1 0 1 1 0 1 1 0 2 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 9000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1  0 -1  0  1 -1  1  0  0 -1  1  0  0] (Indices: [0, 1, 2, 4, 5, 6, 8, 9, 12, 14, 15, 16, 18, 19]), Candidate: [2 1 0 1 1 1 0 1 1 0 0 2 0 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 9050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1 -1  1  0 -1  1  0  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 4, 5, 6, 8, 10, 11, 13, 14, 15, 17, 19]), Candidate: [2 1 0 1 1 1 0 1 0 2 0 0 2 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 9100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1 -1  0  1  0  0  0  0 -1  0  1  0  0] (Indices: [0, 1, 2, 4, 5, 6, 8, 11, 12, 13, 14, 15, 18, 19]), Candidate: [2 1 0 1 1 1 0 1 0 1 1 1 1 1 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 9150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  1  0  0  0  0 -1  0  0  1  0  0  0] (Indices: [0, 1, 2, 4, 5, 6, 9, 10, 11, 12, 13, 17, 18, 19]), Candidate: [2 1 0 1 1 1 0 0 2 1 0 1 1 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 9200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  1  0 -1  1  0 -1  1 -1  1  0  0  0] (Indices: [0, 1, 2, 4, 5, 6, 9, 10, 12, 13, 15, 17, 18, 19]), Candidate: [ 2  1  0  1  1  1  0  0  2  1 -1  2  1  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  1 -1  0  0  1  0  0  0  0  0  0  0] (Indices: [0, 1, 2, 4, 5, 6, 9, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 1 0 1 1 1 0 0 2 0 0 1 2 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 9300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0  0  0  0  0  0  0 -1  0  0  0  1  0] (Indices: [0, 1, 2, 4, 5, 7, 8, 9, 10, 11, 12, 13, 14, 19]), Candidate: [ 2  1  0  1  1  0  2  0  1  1  0  1  1  1 -1  1  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0  0  0  0 -1  1 -1  0  0  1  0  0  0] (Indices: [0, 1, 2, 4, 5, 7, 8, 9, 10, 11, 13, 17, 18, 19]), Candidate: [2 1 0 1 1 0 2 0 1 1 0 0 2 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 9400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0  0  0 -1  1 -1  0  0  1  0  0  0  0] (Indices: [0, 1, 2, 4, 5, 7, 8, 9, 10, 12, 16, 17, 18, 19]), Candidate: [ 2  1  0  1  1  0  2  0  1  1 -1  2  0  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0  0 -1  1  0 -1  1 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 4, 5, 7, 8, 9, 11, 12, 14, 16, 18, 19]), Candidate: [ 2  1  0  1  1  0  2  0  1  0  1  1  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0  0 -1  0  0  1  0  0  0  0 -1  1  0] (Indices: [0, 1, 2, 4, 5, 7, 8, 9, 13, 14, 15, 16, 17, 19]), Candidate: [2 1 0 1 1 0 2 0 1 0 0 1 2 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 9550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0 -1  1  0 -1  1  0 -1  0  1  0  0  0] (Indices: [0, 1, 2, 4, 5, 7, 8, 10, 11, 13, 14, 17, 18, 19]), Candidate: [ 2  1  0  1  1  0  2  0  0  2  0  0  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0 -1  0  1  0  0 -1  1  0  0  0 -1  1] (Indices: [0, 1, 2, 4, 5, 7, 8, 11, 12, 13, 15, 16, 17, 18]), Candidate: [2 1 0 1 1 0 2 0 0 1 1 1 1 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 9650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  1  0  0  0 -1  1  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 4, 5, 7, 9, 10, 11, 12, 14, 15, 17, 19]), Candidate: [ 2  1  0  1  1  0  2 -1  2  1  0  1  0  2  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  1  0 -1  1 -1  1  0 -1  1  0  0  0] (Indices: [0, 1, 2, 4, 5, 7, 9, 10, 12, 14, 15, 17, 18, 19]), Candidate: [ 2  1  0  1  1  0  2 -1  2  1 -1  2  0  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  0  1  0  0  0  0  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 4, 5, 7, 10, 11, 12, 13, 14, 15, 17, 19]), Candidate: [ 2  1  0  1  1  0  2 -1  1  2  0  1  1  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1  0  0  0  0  0  0 -1  0  0  1  0  0] (Indices: [0, 1, 2, 4, 5, 8, 9, 10, 11, 12, 13, 14, 18, 19]), Candidate: [ 2  1  0  1  1  0  1  1  1  1  0  1  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1  0  0 -1  1  0  0  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 4, 5, 8, 9, 10, 12, 13, 14, 15, 17, 18]), Candidate: [ 2  1  0  1  1  0  1  1  1  1 -1  2  1  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1  0 -1  1 -1  1  0 -1  1  0  0  0  0] (Indices: [0, 1, 2, 4, 5, 8, 9, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  0  1  1  0  1  1  1  0  1  0  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1 -1  0  1  0  0  0  0 -1  1  0  0  0] (Indices: [0, 1, 2, 4, 5, 8, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [2 1 0 1 1 0 1 1 0 1 1 1 1 1 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 10000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  0  1 -1  0  1  0  0  0  0  0  0  0  0] (Indices: [0, 1, 2, 4, 5, 9, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 1 0 1 1 0 1 0 2 0 0 2 1 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 10050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0  0  0  0 -1  1  0 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 4, 6, 7, 8, 9, 10, 11, 13, 14, 16, 17]), Candidate: [ 2  1  0  1  0  2  1  0  1  1  0  0  2  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0  0  0 -1  1  0 -1  0  0  1  0  0  0] (Indices: [0, 1, 2, 4, 6, 7, 8, 9, 10, 12, 13, 17, 18, 19]), Candidate: [ 2  1  0  1  0  2  1  0  1  1 -1  2  1  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0  0 -1  1  0  0 -1  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 4, 6, 7, 8, 9, 11, 12, 13, 15, 17, 18]), Candidate: [2 1 0 1 0 2 1 0 1 0 1 1 1 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 10200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0  0 -1  0  1  0  0 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 4, 6, 7, 8, 9, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  1  0  1  0  2  1  0  1  0  0  2  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0 -1  1  0  0 -1  1 -1  0  1  0  0  0] (Indices: [0, 1, 2, 4, 6, 7, 8, 10, 11, 12, 14, 17, 18, 19]), Candidate: [ 2  1  0  1  0  2  1  0  0  2  0  1  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0 -1  1 -1  0  1  0  0  0 -1  1  0  0] (Indices: [0, 1, 2, 4, 6, 7, 8, 10, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  1  0  1  0  2  1  0  0  2 -1  1  2  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  1  0  0  0  0  0 -1  0  0  1  0  0] (Indices: [0, 1, 2, 4, 6, 7, 9, 10, 11, 12, 13, 14, 18, 19]), Candidate: [ 2  1  0  1  0  2  1 -1  2  1  0  1  1  1 -1  1  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  1  0 -1  1  0  0  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 4, 6, 7, 9, 10, 12, 13, 14, 15, 17, 18]), Candidate: [ 2  1  0  1  0  2  1 -1  2  1 -1  2  1  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  1 -1  1 -1  1  0 -1  1  0  0  0  0] (Indices: [0, 1, 2, 4, 6, 7, 9, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  0  1  0  2  1 -1  2  0  1  0  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  0  0  1  0  0  0  0 -1  1  0  0  0] (Indices: [0, 1, 2, 4, 6, 7, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  1  0  1  0  2  1 -1  1  1  1  1  1  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1  0  0  0 -1  1  0 -1  0  1  0  0  0] (Indices: [0, 1, 2, 4, 6, 8, 9, 10, 11, 13, 14, 17, 18, 19]), Candidate: [ 2  1  0  1  0  2  0  1  1  1  0  0  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1  0 -1  1  0  0 -1  1  0  0  0 -1  1] (Indices: [0, 1, 2, 4, 6, 8, 9, 11, 12, 13, 15, 16, 17, 18]), Candidate: [2 1 0 1 0 2 0 1 1 0 1 1 1 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 10650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1 -1  1  0 -1  1  0  0 -1  1  0  0  0] (Indices: [0, 1, 2, 4, 6, 8, 10, 11, 13, 14, 15, 17, 18, 19]), Candidate: [2 1 0 1 0 2 0 1 0 2 0 0 2 1 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 10700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  1  0 -1  1  0  0  0  0  0 -1  1  0] (Indices: [0, 1, 2, 4, 6, 9, 10, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  1  0  1  0  2  0  0  2  1 -1  2  1  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0  0  0  0  0 -1  1  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 4, 7, 8, 9, 10, 11, 12, 14, 15, 17, 19]), Candidate: [2 1 0 1 0 1 2 0 1 1 0 1 0 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 10800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0  0  0 -1  1 -1  1  0 -1  1  0  0  0] (Indices: [0, 1, 2, 4, 7, 8, 9, 10, 12, 14, 15, 17, 18, 19]), Candidate: [ 2  1  0  1  0  1  2  0  1  1 -1  2  0  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0 -1  1  0  0  0  0  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 4, 7, 8, 10, 11, 12, 13, 14, 15, 17, 19]), Candidate: [2 1 0 1 0 1 2 0 0 2 0 1 1 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 10900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1 -1  1  0  0  0  0  0 -1  0  1  0  0  0] (Indices: [0, 1, 2, 4, 7, 9, 10, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  1  0  1  0  1  2 -1  2  1  0  1  1  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1  0  0  0  0  0  0  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 4, 8, 9, 10, 11, 12, 13, 14, 15, 17, 19]), Candidate: [2 1 0 1 0 1 1 1 1 1 0 1 1 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 11000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  0  1 -1  0  1  0  0  0  0  0  0  0  0  0] (Indices: [0, 1, 2, 4, 8, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 1 0 1 0 1 1 1 0 1 1 1 1 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 11050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0  0  0  0 -1  1  0  0 -1  0  0  1  0] (Indices: [0, 1, 2, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15, 19]), Candidate: [2 1 0 0 2 1 1 0 1 1 0 0 2 1 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 11100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0  0  0 -1  1  0 -1  0  1 -1  1  0  0] (Indices: [0, 1, 2, 5, 6, 7, 8, 9, 10, 12, 13, 16, 18, 19]), Candidate: [ 2  1  0  0  2  1  1  0  1  1 -1  2  1  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0  0 -1  1  0  0 -1  1  0 -1  0  1  0] (Indices: [0, 1, 2, 5, 6, 7, 8, 9, 11, 12, 13, 15, 16, 19]), Candidate: [2 1 0 0 2 1 1 0 1 0 1 1 1 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 11200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0  0 -1  0  1  0  0 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 5, 6, 7, 8, 9, 12, 13, 14, 16, 17, 18]), Candidate: [ 2  1  0  0  2  1  1  0  1  0  0  2  1  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0 -1  1  0  0 -1  1 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 5, 6, 7, 8, 10, 11, 12, 14, 16, 18, 19]), Candidate: [ 2  1  0  0  2  1  1  0  0  2  0  1  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0 -1  1 -1  0  1  0  0  0  0 -1  1  0] (Indices: [0, 1, 2, 5, 6, 7, 8, 10, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  1  0  0  2  1  1  0  0  2 -1  1  2  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  1  0  0  0  0  0 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 5, 6, 7, 9, 10, 11, 12, 13, 14, 17, 19]), Candidate: [ 2  1  0  0  2  1  1 -1  2  1  0  1  1  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 11400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  1  0 -1  1  0  0  0  0 -1  0  1  0] (Indices: [0, 1, 2, 5, 6, 7, 9, 10, 12, 13, 14, 15, 16, 19]), Candidate: [ 2  1  0  0  2  1  1 -1  2  1 -1  2  1  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 11450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  1 -1  1 -1  1  0  0 -1  1  0  0  0] (Indices: [0, 1, 2, 5, 6, 7, 9, 11, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  1  0  0  2  1  1 -1  2  0  1  0  2  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  0  0  1  0  0  0  0  0 -1  1  0  0] (Indices: [0, 1, 2, 5, 6, 7, 11, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  1  0  0  2  1  1 -1  1  1  1  1  1  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1  0  0  0 -1  1  0 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 5, 6, 8, 9, 10, 11, 13, 14, 16, 18, 19]), Candidate: [ 2  1  0  0  2  1  0  1  1  1  0  0  2  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1  0 -1  1  0  0  0 -1  0  1  0  0  0] (Indices: [0, 1, 2, 5, 6, 8, 9, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  1  0  0  2  1  0  1  1  0  1  1  1  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1 -1  1  0 -1  1  0  0  0 -1  1  0  0] (Indices: [0, 1, 2, 5, 6, 8, 10, 11, 13, 14, 15, 16, 18, 19]), Candidate: [2 1 0 0 2 1 0 1 0 2 0 0 2 1 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 11700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  0  1  0 -1  1  0  0  0  0  0  0 -1  1] (Indices: [0, 1, 2, 5, 6, 9, 10, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  1  0  0  2  1  0  0  2  1 -1  2  1  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0  0  0  0  0 -1  1  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 5, 7, 8, 9, 10, 11, 12, 14, 15, 17, 18]), Candidate: [2 1 0 0 2 0 2 0 1 1 0 1 0 2 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 11800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0  0  0 -1  1 -1  1  0  0 -1  1  0  0] (Indices: [0, 1, 2, 5, 7, 8, 9, 10, 12, 14, 15, 16, 18, 19]), Candidate: [ 2  1  0  0  2  0  2  0  1  1 -1  2  0  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0 -1  1  0  0  0  0  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 5, 7, 8, 10, 11, 12, 13, 14, 15, 17, 18]), Candidate: [2 1 0 0 2 0 2 0 0 2 0 1 1 1 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 11900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1 -1  1  0  0  0  0  0 -1  1 -1  1  0  0] (Indices: [0, 1, 2, 5, 7, 9, 10, 11, 12, 13, 14, 16, 18, 19]), Candidate: [ 2  1  0  0  2  0  2 -1  2  1  0  1  1  1 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 11950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1  0  0  0  0  0  0  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 5, 8, 9, 10, 11, 12, 13, 14, 15, 17, 18]), Candidate: [2 1 0 0 2 0 1 1 1 1 0 1 1 1 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 12000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  0  1 -1  1 -1  1  0  0  0  0  0  0  0  0] (Indices: [0, 1, 2, 5, 8, 10, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  0  0  2  0  1  1  0  2 -1  2  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0  0  0  0 -1  1  0  0  0 -1  0  1  0] (Indices: [0, 1, 2, 6, 7, 8, 9, 10, 11, 13, 14, 15, 16, 19]), Candidate: [2 1 0 0 1 2 1 0 1 1 0 0 2 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 12100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0  0 -1  1  0  0  0  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 6, 7, 8, 9, 11, 12, 13, 14, 15, 17, 18]), Candidate: [2 1 0 0 1 2 1 0 1 0 1 1 1 1 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 12150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0 -1  1  0  0 -1  1  0  0 -1  1  0  0] (Indices: [0, 1, 2, 6, 7, 8, 10, 11, 12, 14, 15, 16, 18, 19]), Candidate: [2 1 0 0 1 2 1 0 0 2 0 1 0 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 12200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0 -1  1  0  0 -1  1  0  0  0  0 -1  1  0] (Indices: [0, 1, 2, 6, 7, 9, 10, 11, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  1  0  0  1  2  1 -1  2  1  0  0  2  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1 -1  1  0  0  0  0 -1  1  0  0 -1  1  0  0] (Indices: [0, 1, 2, 6, 8, 9, 10, 11, 12, 14, 15, 16, 18, 19]), Candidate: [2 1 0 0 1 2 0 1 1 1 0 1 0 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 12300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0  0  0  0  0  0  0  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18]), Candidate: [2 1 0 0 1 1 2 0 1 1 0 1 1 1 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 12350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  0  1  0 -1  1  0  0 -1  1  0  0  0  0  0  0] (Indices: [0, 1, 2, 7, 8, 10, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [2 1 0 0 1 1 2 0 0 2 0 1 0 2 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 12400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0  0  0  0 -1  1  0 -1  0  1 -1  0  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 17]), Candidate: [ 2  0  2  0  1  1  1  0  1  1  0  0  2  1 -1  1  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0  0  0 -1  1 -1  1  0 -1  0  1 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 18]), Candidate: [ 2  0  2  0  1  1  1  0  1  1 -1  2  0  2  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0  0  0 -1  0  0  0  1  0 -1  1  0  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 9, 10, 15, 16, 18, 19]), Candidate: [ 2  0  2  0  1  1  1  0  1  1 -1  1  1  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0  0 -1  1 -1  1 -1  1  0 -1  0  1  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 9, 11, 13, 15, 16, 19]), Candidate: [2 0 2 0 1 1 1 0 1 0 1 0 2 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 12600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0  0 -1  0  1 -1  1 -1  1  0 -1  1  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 9, 12, 14, 16, 17, 19]), Candidate: [ 2  0  2  0  1  1  1  0  1  0  0  2  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0 -1  1  0  0 -1  1 -1  1 -1  0  1  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 10, 11, 12, 14, 16, 19]), Candidate: [ 2  0  2  0  1  1  1  0  0  2  0  1  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0 -1  1 -1  1  0  0  0 -1  1 -1  0  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 10, 12, 13, 14, 15, 17]), Candidate: [ 2  0  2  0  1  1  1  0  0  2 -1  2  1  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0 -1  1 -1  0  0  1  0  0  0 -1  1  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 10, 14, 15, 16, 17, 19]), Candidate: [ 2  0  2  0  1  1  1  0  0  2 -1  1  1  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0 -1  0  1 -1  1 -1  1  0  0  0 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 11, 13, 15, 16, 17, 18]), Candidate: [2 0 2 0 1 1 1 0 0 1 1 0 2 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 12850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  1  0  0  0  0 -1  0  1 -1  0  1  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 16, 19]), Candidate: [ 2  0  2  0  1  1  1 -1  2  1  0  1  1  0  0  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  1  0  0 -1  0  1 -1  1  0  0 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 9, 10, 11, 14, 16, 17, 18]), Candidate: [ 2  0  2  0  1  1  1 -1  2  1  0  0  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 12950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  1  0 -1  0  1  0 -1  1  0  0 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 9, 10, 13, 14, 16, 17, 18]), Candidate: [ 2  0  2  0  1  1  1 -1  2  1 -1  1  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 13000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  1 -1  1 -1  1  0  0  0  0 -1  0  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 9, 11, 13, 14, 15, 16, 17]), Candidate: [ 2  0  2  0  1  1  1 -1  2  0  1  0  2  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  0  1  0  0  0  0  0 -1  1 -1  0  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 10, 11, 12, 13, 14, 15, 17]), Candidate: [ 2  0  2  0  1  1  1 -1  1  2  0  1  1  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  0  1  0 -1  0  1  0  0  0 -1  1  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 10, 11, 14, 15, 16, 17, 19]), Candidate: [ 2  0  2  0  1  1  1 -1  1  2  0  0  1  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  0  0  1  0 -1  1  0  0 -1  1  0  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 11, 12, 14, 15, 16, 18, 19]), Candidate: [ 2  0  2  0  1  1  1 -1  1  1  1  1  0  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1  0  0  0  0 -1  0  0  1  0  0 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 8, 9, 10, 11, 12, 16, 17, 18]), Candidate: [2 0 2 0 1 1 0 1 1 1 0 1 0 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 13250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1  0  0 -1  1  0 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 8, 9, 10, 12, 13, 15, 16, 18]), Candidate: [ 2  0  2  0  1  1  0  1  1  1 -1  2  1  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1  0 -1  1  0  0  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 8, 9, 11, 12, 13, 14, 16, 18]), Candidate: [ 2  0  2  0  1  1  0  1  1  0  1  1  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1  0 -1  1 -1  0  0  1  0  0  0  0  0] (Indices: [0, 1, 3, 4, 5, 6, 8, 9, 11, 15, 16, 17, 18, 19]), Candidate: [2 0 2 0 1 1 0 1 1 0 1 0 1 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 13400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1 -1  1  0  0 -1  1  0  0 -1  1 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 8, 10, 11, 12, 14, 15, 16, 18]), Candidate: [2 0 2 0 1 1 0 1 0 2 0 1 0 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 13450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1 -1  1 -1  1 -1  1  0  0  0  0 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 8, 10, 12, 14, 15, 16, 17, 18]), Candidate: [ 2  0  2  0  1  1  0  1  0  2 -1  2  0  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  1  0  0  0  0  0  0 -1  1 -1  0  1] (Indices: [0, 1, 3, 4, 5, 6, 9, 10, 11, 12, 13, 14, 15, 17]), Candidate: [2 0 2 0 1 1 0 0 2 1 0 1 1 1 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 13550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  1  0  0 -1  0  1  0  0  0 -1  1  0] (Indices: [0, 1, 3, 4, 5, 6, 9, 10, 11, 14, 15, 16, 17, 19]), Candidate: [2 0 2 0 1 1 0 0 2 1 0 0 1 2 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 13600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  1 -1  1  0 -1  1  0  0 -1  1  0  0] (Indices: [0, 1, 3, 4, 5, 6, 9, 11, 12, 14, 15, 16, 18, 19]), Candidate: [2 0 2 0 1 1 0 0 2 0 1 1 0 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 13650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  0  1 -1  1  0  0  0 -1  1  0  0  0] (Indices: [0, 1, 3, 4, 5, 6, 10, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  0  2  0  1  1  0  0  1  2 -1  2  1  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0  0  0  0 -1  1  0  0 -1  1 -1  0  1] (Indices: [0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 13, 14, 15, 17]), Candidate: [2 0 2 0 1 0 2 0 1 1 0 0 2 1 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 13750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0  0  0 -1  1  0 -1  0  1  0  0 -1  1] (Indices: [0, 1, 3, 4, 5, 7, 8, 9, 10, 12, 13, 16, 17, 18]), Candidate: [ 2  0  2  0  1  0  2  0  1  1 -1  2  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0  0 -1  1  0  0 -1  1  0  0 -1  0  1] (Indices: [0, 1, 3, 4, 5, 7, 8, 9, 11, 12, 13, 15, 16, 17]), Candidate: [2 0 2 0 1 0 2 0 1 0 1 1 1 0 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 13850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0  0 -1  0  1  0  0  0 -1  1 -1  1  0] (Indices: [0, 1, 3, 4, 5, 7, 8, 9, 12, 13, 14, 15, 17, 19]), Candidate: [2 0 2 0 1 0 2 0 1 0 0 2 1 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 13900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0 -1  1  0  0 -1  1 -1  1  0  0 -1  1] (Indices: [0, 1, 3, 4, 5, 7, 8, 10, 11, 12, 14, 16, 17, 18]), Candidate: [ 2  0  2  0  1  0  2  0  0  2  0  1  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0 -1  1 -1  1 -1  0  1  0  0  0  0  0] (Indices: [0, 1, 3, 4, 5, 7, 8, 10, 12, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2  0  1  0  2  0  0  2 -1  2  0  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  1  0  0  0  0  0 -1  1 -1  0  1  0] (Indices: [0, 1, 3, 4, 5, 7, 9, 10, 11, 12, 13, 14, 16, 19]), Candidate: [ 2  0  2  0  1  0  2 -1  2  1  0  1  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 14050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  1  0 -1  1  0  0  0  0  0 -1  0  1] (Indices: [0, 1, 3, 4, 5, 7, 9, 10, 12, 13, 14, 15, 16, 17]), Candidate: [ 2  0  2  0  1  0  2 -1  2  1 -1  2  1  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 14100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  1 -1  1 -1  1  0  0  0  0 -1  1  0] (Indices: [0, 1, 3, 4, 5, 7, 9, 11, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  0  2  0  1  0  2 -1  2  0  1  0  2  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  0  0  1  0  0  0  0  0  0  0 -1  1] (Indices: [0, 1, 3, 4, 5, 7, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  0  2  0  1  0  2 -1  1  1  1  1  1  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1  0  0  0 -1  1  0 -1  1  0  0 -1  1] (Indices: [0, 1, 3, 4, 5, 8, 9, 10, 11, 13, 14, 16, 17, 18]), Candidate: [ 2  0  2  0  1  0  1  1  1  1  0  0  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1  0 -1  1  0  0  0 -1  1  0 -1  1  0] (Indices: [0, 1, 3, 4, 5, 8, 9, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  0  2  0  1  0  1  1  1  0  1  1  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1 -1  1  0 -1  1  0  0  0  0  0 -1  1] (Indices: [0, 1, 3, 4, 5, 8, 10, 11, 13, 14, 15, 16, 17, 18]), Candidate: [2 0 2 0 1 0 1 1 0 2 0 0 2 1 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 14350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  0  1  0  0 -1  1 -1  1  0  0  0  0  0] (Indices: [0, 1, 3, 4, 5, 9, 10, 11, 13, 15, 16, 17, 18, 19]), Candidate: [2 0 2 0 1 0 1 0 2 1 0 0 2 0 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 14400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0  0  0  0  0 -1  1 -1  1 -1  0  1  0] (Indices: [0, 1, 3, 4, 6, 7, 8, 9, 10, 11, 12, 14, 16, 19]), Candidate: [ 2  0  2  0  0  2  1  0  1  1  0  1  0  2 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0  0  0 -1  1  0  0  0 -1  1 -1  0  1] (Indices: [0, 1, 3, 4, 6, 7, 8, 9, 10, 12, 13, 14, 15, 17]), Candidate: [ 2  0  2  0  0  2  1  0  1  1 -1  2  1  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0  0  0 -1  0  0  1  0  0  0 -1  1  0] (Indices: [0, 1, 3, 4, 6, 7, 8, 9, 10, 14, 15, 16, 17, 19]), Candidate: [ 2  0  2  0  0  2  1  0  1  1 -1  1  1  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0  0 -1  1 -1  1 -1  1  0  0  0 -1  1] (Indices: [0, 1, 3, 4, 6, 7, 8, 9, 11, 13, 15, 16, 17, 18]), Candidate: [2 0 2 0 0 2 1 0 1 0 1 0 2 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 14600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0 -1  1  0  0  0 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 3, 4, 6, 7, 8, 10, 11, 12, 13, 15, 16, 18]), Candidate: [2 0 2 0 0 2 1 0 0 2 0 1 1 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 14650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0 -1  1 -1  1  0  0  0 -1  0  1  0  0] (Indices: [0, 1, 3, 4, 6, 7, 8, 10, 12, 13, 14, 15, 18, 19]), Candidate: [ 2  0  2  0  0  2  1  0  0  2 -1  2  1  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0 -1  0  1 -1  0  1  0  0  0  0  0  0] (Indices: [0, 1, 3, 4, 6, 7, 8, 11, 14, 15, 16, 17, 18, 19]), Candidate: [2 0 2 0 0 2 1 0 0 1 1 0 1 2 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 14750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  1  0  0 -1  1  0 -1  1  0  0 -1  1] (Indices: [0, 1, 3, 4, 6, 7, 9, 10, 11, 13, 14, 16, 17, 18]), Candidate: [ 2  0  2  0  0  2  1 -1  2  1  0  0  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 14800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  1 -1  1  0  0  0 -1  1  0 -1  1  0] (Indices: [0, 1, 3, 4, 6, 7, 9, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  0  2  0  0  2  1 -1  2  0  1  1  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 14850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  0  1  0 -1  1  0  0  0  0  0 -1  1] (Indices: [0, 1, 3, 4, 6, 7, 10, 11, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  0  2  0  0  2  1 -1  1  2  0  0  2  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1  0  0  0  0 -1  1 -1  1  0  0 -1  1] (Indices: [0, 1, 3, 4, 6, 8, 9, 10, 11, 12, 14, 16, 17, 18]), Candidate: [ 2  0  2  0  0  2  0  1  1  1  0  1  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1  0  0 -1  1 -1  0  1  0  0  0  0  0] (Indices: [0, 1, 3, 4, 6, 8, 9, 10, 12, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2  0  0  2  0  1  1  1 -1  2  0  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1 -1  1  0  0  0  0 -1  1  0  0 -1  1] (Indices: [0, 1, 3, 4, 6, 8, 10, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 2  0  2  0  0  2  0  1  0  2  0  1  1  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  0  1  0  0  0  0 -1  1  0  0 -1  1  0] (Indices: [0, 1, 3, 4, 6, 9, 10, 11, 12, 13, 15, 16, 17, 19]), Candidate: [2 0 2 0 0 2 0 0 2 1 0 1 1 0 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 15100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0  0  0  0  0  0  0 -1  1 -1  0  1  0] (Indices: [0, 1, 3, 4, 7, 8, 9, 10, 11, 12, 13, 14, 16, 19]), Candidate: [ 2  0  2  0  0  1  2  0  1  1  0  1  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0  0  0 -1  1  0  0  0  0  0 -1  0  1] (Indices: [0, 1, 3, 4, 7, 8, 9, 10, 12, 13, 14, 15, 16, 17]), Candidate: [ 2  0  2  0  0  1  2  0  1  1 -1  2  1  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0  0 -1  1 -1  1  0  0  0  0 -1  1  0] (Indices: [0, 1, 3, 4, 7, 8, 9, 11, 13, 14, 15, 16, 17, 19]), Candidate: [2 0 2 0 0 1 2 0 1 0 1 0 2 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 15250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0 -1  0  1  0  0  0  0  0  0  0 -1  1] (Indices: [0, 1, 3, 4, 7, 8, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [2 0 2 0 0 1 2 0 0 1 1 1 1 1 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 15300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1 -1  1 -1  1  0  0 -1  1  0  0  0  0  0] (Indices: [0, 1, 3, 4, 7, 9, 11, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2  0  0  1  2 -1  2  0  1  1  1  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1  0 -1  1  0  0  0  0  0  0  0 -1  1] (Indices: [0, 1, 3, 4, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [2 0 2 0 0 1 1 1 1 0 1 1 1 1 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 15400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0  0  0  0  0 -1  1 -1  1 -1  1 -1  1] (Indices: [0, 1, 3, 5, 6, 7, 8, 9, 10, 11, 12, 14, 16, 18]), Candidate: [ 2  0  2 -1  2  1  1  0  1  1  0  1  0  2 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0  0  0 -1  1  0  0  0  0 -1  0  0  1] (Indices: [0, 1, 3, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16]), Candidate: [ 2  0  2 -1  2  1  1  0  1  1 -1  2  1  1  0  1  0  1  1  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0  0  0 -1  0  0  1  0  0  0  0 -1  1] (Indices: [0, 1, 3, 5, 6, 7, 8, 9, 10, 14, 15, 16, 17, 18]), Candidate: [ 2  0  2 -1  2  1  1  0  1  1 -1  1  1  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0  0 -1  1 -1  1  0 -1  0  1  0  0  0] (Indices: [0, 1, 3, 5, 6, 7, 8, 9, 11, 13, 14, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  1  1  0  1  0  1  0  2  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0 -1  1  0  0  0 -1  1  0  0 -1  0  1] (Indices: [0, 1, 3, 5, 6, 7, 8, 10, 11, 12, 13, 15, 16, 17]), Candidate: [ 2  0  2 -1  2  1  1  0  0  2  0  1  1  0  1  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0 -1  1 -1  1  0  0  0 -1  1 -1  1  0] (Indices: [0, 1, 3, 5, 6, 7, 8, 10, 12, 13, 14, 15, 17, 19]), Candidate: [ 2  0  2 -1  2  1  1  0  0  2 -1  2  1  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0 -1  0  1 -1  1 -1  1  0  0  0  0  0] (Indices: [0, 1, 3, 5, 6, 7, 8, 11, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  1  1  0  0  1  1  0  2  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  1  0  0 -1  1  0  0 -1  0  1  0  0] (Indices: [0, 1, 3, 5, 6, 7, 9, 10, 11, 13, 14, 15, 18, 19]), Candidate: [ 2  0  2 -1  2  1  1 -1  2  1  0  0  2  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  1 -1  1  0  0  0 -1  1  0  0 -1  1] (Indices: [0, 1, 3, 5, 6, 7, 9, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 2  0  2 -1  2  1  1 -1  2  0  1  1  1  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 15850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  0  1  0  0 -1  0  1  0  0  0  0  0] (Indices: [0, 1, 3, 5, 6, 7, 10, 11, 12, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  1  1 -1  1  2  0  1  0  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1  0  0  0  0 -1  1  0 -1  0  1  0  0] (Indices: [0, 1, 3, 5, 6, 8, 9, 10, 11, 12, 14, 15, 18, 19]), Candidate: [ 2  0  2 -1  2  1  0  1  1  1  0  1  0  2  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1  0  0 -1  1 -1  1 -1  1  0  0  0  0] (Indices: [0, 1, 3, 5, 6, 8, 9, 10, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  1  0  1  1  1 -1  2  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 16000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1 -1  1  0  0  0  0  0 -1  0  1  0  0] (Indices: [0, 1, 3, 5, 6, 8, 10, 11, 12, 13, 14, 15, 18, 19]), Candidate: [ 2  0  2 -1  2  1  0  1  0  2  0  1  1  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  0  1  0  0  0  0 -1  1  0  0  0 -1  1] (Indices: [0, 1, 3, 5, 6, 9, 10, 11, 12, 13, 15, 16, 17, 18]), Candidate: [ 2  0  2 -1  2  1  0  0  2  1  0  1  1  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0  0  0  0  0  0  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 3, 5, 7, 8, 9, 10, 11, 12, 13, 14, 16, 18]), Candidate: [ 2  0  2 -1  2  0  2  0  1  1  0  1  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0  0  0  0 -1  0  0  1  0  0  0  0  0] (Indices: [0, 1, 3, 5, 7, 8, 9, 10, 11, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  0  2  0  1  1  0  0  1  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0  0 -1  1 -1  1  0  0  0  0  0 -1  1] (Indices: [0, 1, 3, 5, 7, 8, 9, 11, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  0  2 -1  2  0  2  0  1  0  1  0  2  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0 -1  1 -1  0  1  0  0  0  0  0  0  0] (Indices: [0, 1, 3, 5, 7, 8, 10, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  0  2  0  0  2 -1  1  2  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  1 -1  1  0  0  0 -1  1  0  0  0  0] (Indices: [0, 1, 3, 5, 7, 9, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  0  2 -1  2  0  1  1  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 16350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  0  1  0  0 -1  0  1  0  0  0  0  0  0  0] (Indices: [0, 1, 3, 5, 8, 9, 10, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  0  1  1  1  1 -1  1  2  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0  0  0  0  0  0 -1  0  0  1  0  0  0] (Indices: [0, 1, 3, 6, 7, 8, 9, 10, 11, 12, 13, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  2  1  0  1  1  0  1  1  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0  0  0 -1  1  0 -1  1 -1  1  0  0  0] (Indices: [0, 1, 3, 6, 7, 8, 9, 10, 12, 13, 15, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  2  1  0  1  1 -1  2  1  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0  0 -1  0  0  1  0  0  0  0  0  0  0] (Indices: [0, 1, 3, 6, 7, 8, 9, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  2  1  0  1  0  0  1  2  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  1  0  0  0  0  0  0 -1  1 -1  1  0] (Indices: [0, 1, 3, 6, 7, 9, 10, 11, 12, 13, 14, 15, 17, 19]), Candidate: [ 2  0  2 -1  1  2  1 -1  2  1  0  1  1  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0 -1  0  0  1  0  0  0  0  0  0  0  0  0] (Indices: [0, 1, 3, 6, 7, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  2  1 -1  1  1  1  1  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1 -1  1 -1  1  0  0  0  0 -1  1  0  0  0  0] (Indices: [0, 1, 3, 6, 8, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  2  0  1  0  2  0  1  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0  0  0 -1  1  0 -1  1  0  0  0  0  0] (Indices: [0, 1, 3, 7, 8, 9, 10, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  2  0  1  1 -1  2  1  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 16750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0  0  0  0  0  0 -1  1  0 -1  0  0  1] (Indices: [0, 1, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 16]), Candidate: [2 0 1 1 1 1 1 0 1 1 0 1 1 0 1 1 0 1 1 7]
 -> Valid neighbor added.
Attempt 16800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0  0  0  0 -1  0  1  0  0  0 -1  0  1] (Indices: [0, 1, 4, 5, 6, 7, 8, 9, 10, 11, 14, 15, 16, 17]), Candidate: [2 0 1 1 1 1 1 0 1 1 0 0 1 2 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 16850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0  0  0 -1  0  1  0  0  0  0 -1  0  1] (Indices: [0, 1, 4, 5, 6, 7, 8, 9, 10, 13, 14, 15, 16, 17]), Candidate: [ 2  0  1  1  1  1  1  0  1  1 -1  1  2  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0  0 -1  1  0 -1  1 -1  0  1  0  0  0] (Indices: [0, 1, 4, 5, 6, 7, 8, 9, 11, 12, 14, 17, 18, 19]), Candidate: [ 2  0  1  1  1  1  1  0  1  0  1  1  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 16950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0  0 -1  0  0  1  0  0  0 -1  1  0  0] (Indices: [0, 1, 4, 5, 6, 7, 8, 9, 13, 14, 15, 16, 18, 19]), Candidate: [2 0 1 1 1 1 1 0 1 0 0 1 2 1 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 17000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0 -1  1  0 -1  1 -1  1  0  0  0 -1  1] (Indices: [0, 1, 4, 5, 6, 7, 8, 10, 11, 13, 15, 16, 17, 18]), Candidate: [2 0 1 1 1 1 1 0 0 2 0 0 2 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 17050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0 -1  0  1  0  0 -1  1  0  0 -1  1  0] (Indices: [0, 1, 4, 5, 6, 7, 8, 11, 12, 13, 15, 16, 17, 19]), Candidate: [2 0 1 1 1 1 1 0 0 1 1 1 1 0 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 17100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  1  0  0  0 -1  1  0 -1  0  1  0  0] (Indices: [0, 1, 4, 5, 6, 7, 9, 10, 11, 12, 14, 15, 18, 19]), Candidate: [ 2  0  1  1  1  1  1 -1  2  1  0  1  0  2  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  1  0 -1  1 -1  1 -1  1  0  0  0  0] (Indices: [0, 1, 4, 5, 6, 7, 9, 10, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  0  1  1  1  1  1 -1  2  1 -1  2  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 17200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  0  1  0  0  0  0  0 -1  0  1  0  0] (Indices: [0, 1, 4, 5, 6, 7, 10, 11, 12, 13, 14, 15, 18, 19]), Candidate: [ 2  0  1  1  1  1  1 -1  1  2  0  1  1  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1  0  0  0  0  0 -1  1  0  0 -1  0  1] (Indices: [0, 1, 4, 5, 6, 8, 9, 10, 11, 12, 13, 15, 16, 17]), Candidate: [2 0 1 1 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 17300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1  0  0 -1  1  0  0  0 -1  1 -1  1  0] (Indices: [0, 1, 4, 5, 6, 8, 9, 10, 12, 13, 14, 15, 17, 19]), Candidate: [ 2  0  1  1  1  1  0  1  1  1 -1  2  1  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1  0 -1  1 -1  1 -1  1  0  0  0  0  0] (Indices: [0, 1, 4, 5, 6, 8, 9, 11, 13, 15, 16, 17, 18, 19]), Candidate: [2 0 1 1 1 1 0 1 1 0 1 0 2 0 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 17400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1 -1  0  1  0  0  0 -1  1  0  0  0  0] (Indices: [0, 1, 4, 5, 6, 8, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  0  1  1  1  1  0  1  0  1  1  1  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  0  0  1  0  0  0  0  0  0  0  0 -1  1] (Indices: [0, 1, 4, 5, 6, 10, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [2 0 1 1 1 1 0 0 1 2 0 1 1 1 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 17500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0  0  0  0 -1  1  0  0 -1  0  1  0  0] (Indices: [0, 1, 4, 5, 7, 8, 9, 10, 11, 13, 14, 15, 18, 19]), Candidate: [2 0 1 1 1 0 2 0 1 1 0 0 2 1 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 17550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0  0 -1  1  0  0  0 -1  1  0  0 -1  1] (Indices: [0, 1, 4, 5, 7, 8, 9, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 2  0  1  1  1  0  2  0  1  0  1  1  1  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0 -1  1  0  0 -1  0  1  0  0  0  0  0] (Indices: [0, 1, 4, 5, 7, 8, 10, 11, 12, 15, 16, 17, 18, 19]), Candidate: [2 0 1 1 1 0 2 0 0 2 0 1 0 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 17650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  1  0  0 -1  1  0 -1  1  0  0  0  0] (Indices: [0, 1, 4, 5, 7, 9, 10, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  0  1  1  1  0  2 -1  2  1  0  0  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 17700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  0  1  0  0  0  0 -1  0  1  0  0  0  0  0] (Indices: [0, 1, 4, 5, 8, 9, 10, 11, 12, 15, 16, 17, 18, 19]), Candidate: [2 0 1 1 1 0 1 1 1 1 0 1 0 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 17750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0  0  0  0  0  0  0 -1  1  0 -1  0  1] (Indices: [0, 1, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 16, 17]), Candidate: [ 2  0  1  1  0  2  1  0  1  1  0  1  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0  0  0  0 -1  0  1 -1  1  0  0  0  0] (Indices: [0, 1, 4, 6, 7, 8, 9, 10, 11, 14, 16, 17, 18, 19]), Candidate: [ 2  0  1  1  0  2  1  0  1  1  0  0  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0  0 -1  1  0 -1  0  1  0  0  0  0  0] (Indices: [0, 1, 4, 6, 7, 8, 9, 11, 12, 15, 16, 17, 18, 19]), Candidate: [2 0 1 1 0 2 1 0 1 0 1 1 0 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 17900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0 -1  1 -1  1 -1  1  0  0  0  0  0  0] (Indices: [0, 1, 4, 6, 7, 8, 10, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  0  1  1  0  2  1  0  0  2 -1  2  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 17950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0 -1  1 -1  1  0  0  0  0 -1  1  0  0  0] (Indices: [0, 1, 4, 6, 7, 9, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  0  1  1  0  2  1 -1  2  0  1  1  1  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  1  0  0 -1  1 -1  1  0  0  0  0  0  0] (Indices: [0, 1, 4, 6, 8, 9, 10, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  0  1  1  0  2  0  1  1  1 -1  2  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  1  0  0  0  0  0 -1  1  0 -1  1  0  0  0] (Indices: [0, 1, 4, 7, 8, 9, 10, 11, 12, 14, 15, 17, 18, 19]), Candidate: [2 0 1 1 0 1 2 0 1 1 0 1 0 2 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 18100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  0  0  1  0  0  0  0  0  0  0  0 -1  1  0  0] (Indices: [0, 1, 4, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18, 19]), Candidate: [2 0 1 1 0 1 1 1 1 1 0 1 1 1 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 18150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0  0  0  0 -1  1  0  0 -1  0  1  0  0] (Indices: [0, 1, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15, 18, 19]), Candidate: [2 0 1 0 2 1 1 0 1 1 0 0 2 1 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 18200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0  0 -1  1  0  0  0 -1  1  0  0 -1  1] (Indices: [0, 1, 5, 6, 7, 8, 9, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 2  0  1  0  2  1  1  0  1  0  1  1  1  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0 -1  1  0  0 -1  0  1  0  0  0  0  0] (Indices: [0, 1, 5, 6, 7, 8, 10, 11, 12, 15, 16, 17, 18, 19]), Candidate: [2 0 1 0 2 1 1 0 0 2 0 1 0 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 18300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0 -1  1  0  0 -1  1  0 -1  1  0  0  0  0] (Indices: [0, 1, 5, 6, 7, 9, 10, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  0  1  0  2  1  1 -1  2  1  0  0  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 18350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0 -1  1  0  0  0  0 -1  0  1  0  0  0  0  0] (Indices: [0, 1, 5, 6, 8, 9, 10, 11, 12, 15, 16, 17, 18, 19]), Candidate: [2 0 1 0 2 1 0 1 1 1 0 1 0 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 18400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0  0  0  0  0  0  0  0 -1  1 -1  1  0] (Indices: [0, 1, 5, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 19]), Candidate: [2 0 1 0 2 0 2 0 1 1 0 1 1 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 18450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0 -1  0  1  0  0  0  0  0  0  0  0  0] (Indices: [0, 1, 5, 7, 8, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 0 1 0 2 0 2 0 0 1 1 1 1 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 18500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1  0  0  0  0  0 -1  1 -1  1  0  0  0  0  0] (Indices: [0, 1, 6, 7, 8, 9, 10, 11, 13, 15, 16, 17, 18, 19]), Candidate: [2 0 1 0 1 2 1 0 1 1 0 0 2 0 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 18550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  0  1 -1  1 -1  1  0  0  0  0  0  0  0  0  0  0] (Indices: [0, 1, 6, 8, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 0 1 0 1 2 0 1 0 2 0 1 1 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 18600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0  0  0  0 -1  1 -1  0  0  0  1  0  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 18, 19]), Candidate: [1 2 1 0 1 1 1 0 1 1 0 0 2 0 0 1 1 2 1 6]
 -> Valid neighbor added.
Attempt 18650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0  0  0 -1  1 -1  0  1 -1  1 -1  1  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 15, 17, 19]), Candidate: [ 1  2  1  0  1  1  1  0  1  1 -1  2  0  1  1  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0  0 -1  1  0  0 -1  0  1  0 -1  0  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 16, 17]), Candidate: [1 2 1 0 1 1 1 0 1 0 1 1 1 0 0 2 1 0 1 7]
 -> Valid neighbor added.
Attempt 18750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0  0 -1  1 -1  0  1  0 -1  1 -1  1  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 9, 11, 14, 15, 17, 19]), Candidate: [1 2 1 0 1 1 1 0 1 0 1 0 1 2 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 18800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0  0 -1  0  0  1  0  0 -1  1 -1  1  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 9, 13, 14, 15, 17, 19]), Candidate: [1 2 1 0 1 1 1 0 1 0 0 1 2 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 18850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0 -1  1  0  0 -1  0  0  1 -1  1  0  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 10, 11, 12, 16, 18, 19]), Candidate: [1 2 1 0 1 1 1 0 0 2 0 1 0 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 18900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0 -1  1 -1  1  0 -1  1 -1  1  0 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 10, 12, 13, 15, 17, 18]), Candidate: [ 1  2  1  0  1  1  1  0  0  2 -1  2  1  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 18950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0 -1  0  1  0  0  0 -1  0  1  0 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 17, 18]), Candidate: [ 1  2  1  0  1  1  1  0  0  1  1  1  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0 -1  0  0  1  0  0  0  0 -1  1 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 12, 13, 14, 15, 16, 18]), Candidate: [1 2 1 0 1 1 1 0 0 1 0 2 1 1 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 19050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  1  0  0  0 -1  1 -1  0  1 -1  1  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 14, 17, 19]), Candidate: [ 1  2  1  0  1  1  1 -1  2  1  0  1  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 19100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  1  0 -1  1  0  0  0 -1  0  0  1  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 9, 10, 12, 13, 14, 15, 19]), Candidate: [ 1  2  1  0  1  1  1 -1  2  1 -1  2  1  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 19150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  1  0 -1  0  0  1  0 -1  1  0  0  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 9, 10, 14, 15, 17, 18, 19]), Candidate: [ 1  2  1  0  1  1  1 -1  2  1 -1  1  1  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 19200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  1 -1  1 -1  1 -1  1  0 -1  1  0  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 9, 11, 13, 15, 16, 18, 19]), Candidate: [ 1  2  1  0  1  1  1 -1  2  0  1  0  2  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  0  1  0  0  0 -1  1 -1  1  0 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 10, 11, 12, 13, 15, 17, 18]), Candidate: [ 1  2  1  0  1  1  1 -1  1  2  0  1  1  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  0  1 -1  1  0  0 -1  1  0 -1  1  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 10, 12, 13, 14, 16, 17, 19]), Candidate: [ 1  2  1  0  1  1  1 -1  1  2 -1  2  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 19350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  0  0  0  1  0  0  0  0  0 -1  1  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 1  2  1  0  1  1  1 -1  1  1  0  2  1  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1  0  0  0 -1  1  0 -1  0  1 -1  1  0] (Indices: [0, 2, 3, 4, 5, 6, 8, 9, 10, 11, 13, 14, 17, 19]), Candidate: [ 1  2  1  0  1  1  0  1  1  1  0  0  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1  0  0 -1  1 -1  1  0 -1  1  0 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 8, 9, 10, 12, 14, 15, 17, 18]), Candidate: [ 1  2  1  0  1  1  0  1  1  1 -1  2  0  2  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1  0 -1  1  0  0 -1  0  1  0 -1  1  0] (Indices: [0, 2, 3, 4, 5, 6, 8, 9, 11, 12, 13, 16, 17, 19]), Candidate: [1 2 1 0 1 1 0 1 1 0 1 1 1 0 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 19550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1  0 -1  0  1  0 -1  1  0  0 -1  1  0] (Indices: [0, 2, 3, 4, 5, 6, 8, 9, 12, 13, 15, 16, 17, 19]), Candidate: [1 2 1 0 1 1 0 1 1 0 0 2 1 0 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 19600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1 -1  1  0  0 -1  0  1 -1  1  0  0  0] (Indices: [0, 2, 3, 4, 5, 6, 8, 10, 11, 12, 15, 17, 18, 19]), Candidate: [1 2 1 0 1 1 0 1 0 2 0 1 0 1 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 19650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1 -1  1 -1  0  0  1  0  0  0  0  0  0] (Indices: [0, 2, 3, 4, 5, 6, 8, 10, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  2  1  0  1  1  0  1  0  2 -1  1  1  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 19700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  1  0  0  0  0 -1  1 -1  1  0 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 9, 10, 11, 12, 13, 15, 17, 18]), Candidate: [1 2 1 0 1 1 0 0 2 1 0 1 1 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 19750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  1  0 -1  1  0  0 -1  1  0 -1  1  0] (Indices: [0, 2, 3, 4, 5, 6, 9, 10, 12, 13, 14, 16, 17, 19]), Candidate: [ 1  2  1  0  1  1  0  0  2  1 -1  2  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 19800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  1 -1  0  1  0  0  0  0  0 -1  1  0] (Indices: [0, 2, 3, 4, 5, 6, 9, 12, 13, 14, 15, 16, 17, 19]), Candidate: [1 2 1 0 1 1 0 0 2 0 0 2 1 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 19850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  0  0  1 -1  1  0  0  0  0  0  0  0] (Indices: [0, 2, 3, 4, 5, 6, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [1 2 1 0 1 1 0 0 1 1 1 0 2 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 19900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0  0  0  0 -1  1 -1  1 -1  1  0 -1  1] (Indices: [0, 2, 3, 4, 5, 7, 8, 9, 10, 11, 13, 15, 17, 18]), Candidate: [1 2 1 0 1 0 2 0 1 1 0 0 2 0 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 19950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0  0  0 -1  1 -1  1 -1  1 -1  1  0  0] (Indices: [0, 2, 3, 4, 5, 7, 8, 9, 10, 12, 14, 16, 18, 19]), Candidate: [ 1  2  1  0  1  0  2  0  1  1 -1  2  0  2 -1  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0  0 -1  1  0 -1  1  0  0 -1  0  1  0] (Indices: [0, 2, 3, 4, 5, 7, 8, 9, 11, 12, 14, 15, 16, 19]), Candidate: [1 2 1 0 1 0 2 0 1 0 1 1 0 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 20050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0  0 -1  0  1 -1  1  0  0  0 -1  1  0] (Indices: [0, 2, 3, 4, 5, 7, 8, 9, 12, 14, 15, 16, 17, 19]), Candidate: [1 2 1 0 1 0 2 0 1 0 0 2 0 2 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 20100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0 -1  1  0 -1  1  0  0 -1  1  0 -1  1] (Indices: [0, 2, 3, 4, 5, 7, 8, 10, 11, 13, 14, 15, 17, 18]), Candidate: [1 2 1 0 1 0 2 0 0 2 0 0 2 1 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 20150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0 -1  0  1  0  0  0  0 -1  1 -1  1  0] (Indices: [0, 2, 3, 4, 5, 7, 8, 11, 12, 13, 14, 15, 17, 19]), Candidate: [1 2 1 0 1 0 2 0 0 1 1 1 1 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 20200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  1  0  0  0  0 -1  0  1 -1  1  0  0] (Indices: [0, 2, 3, 4, 5, 7, 9, 10, 11, 12, 13, 16, 18, 19]), Candidate: [ 1  2  1  0  1  0  2 -1  2  1  0  1  1  0  0  2  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  1  0 -1  1  0 -1  1  0 -1  1  0  0] (Indices: [0, 2, 3, 4, 5, 7, 9, 10, 12, 13, 15, 16, 18, 19]), Candidate: [ 1  2  1  0  1  0  2 -1  2  1 -1  2  1  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 20300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  1 -1  0  1 -1  1  0  0  0  0  0  0] (Indices: [0, 2, 3, 4, 5, 7, 9, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  2  1  0  1  0  2 -1  2  0  0  2  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1  0  0  0  0  0  0  0 -1  0  0  1  0] (Indices: [0, 2, 3, 4, 5, 8, 9, 10, 11, 12, 13, 14, 15, 19]), Candidate: [1 2 1 0 1 0 1 1 1 1 0 1 1 1 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 20400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1  0  0  0 -1  0  1  0 -1  1  0  0  0] (Indices: [0, 2, 3, 4, 5, 8, 9, 10, 11, 14, 15, 17, 18, 19]), Candidate: [1 2 1 0 1 0 1 1 1 1 0 0 1 2 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 20450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1  0 -1  1  0 -1  1 -1  1  0  0  0  0] (Indices: [0, 2, 3, 4, 5, 8, 9, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 1  2  1  0  1  0  1  1  1  0  1  1  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1 -1  1 -1  1  0 -1  1  0  0  0  0  0] (Indices: [0, 2, 3, 4, 5, 8, 10, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 1  2  1  0  1  0  1  1  0  2 -1  2  1  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  0  1 -1  1  0  0  0  0  0 -1  1  0  0] (Indices: [0, 2, 3, 4, 5, 9, 11, 12, 13, 14, 15, 16, 18, 19]), Candidate: [1 2 1 0 1 0 1 0 2 0 1 1 1 1 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 20600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0  0  0  0  0 -1  0  0  1 -1  1  0  0] (Indices: [0, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 16, 18, 19]), Candidate: [1 2 1 0 0 2 1 0 1 1 0 1 0 1 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 20650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0  0  0 -1  1  0 -1  1 -1  1  0 -1  1] (Indices: [0, 2, 3, 4, 6, 7, 8, 9, 10, 12, 13, 15, 17, 18]), Candidate: [ 1  2  1  0  0  2  1  0  1  1 -1  2  1  0  1  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0  0 -1  1  0  0  0 -1  0  1  0 -1  1] (Indices: [0, 2, 3, 4, 6, 7, 8, 9, 11, 12, 13, 14, 17, 18]), Candidate: [ 1  2  1  0  0  2  1  0  1  0  1  1  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0  0 -1  0  1  0  0  0  0 -1  1 -1  1] (Indices: [0, 2, 3, 4, 6, 7, 8, 9, 12, 13, 14, 15, 16, 18]), Candidate: [1 2 1 0 0 2 1 0 1 0 0 2 1 1 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 20800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0 -1  1  0  0 -1  1  0 -1  1  0 -1  1] (Indices: [0, 2, 3, 4, 6, 7, 8, 10, 11, 12, 14, 15, 17, 18]), Candidate: [1 2 1 0 0 2 1 0 0 2 0 1 0 2 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 20850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0 -1  1 -1  1 -1  1  0  0 -1  1  0  0] (Indices: [0, 2, 3, 4, 6, 7, 8, 10, 12, 14, 15, 16, 18, 19]), Candidate: [ 1  2  1  0  0  2  1  0  0  2 -1  2  0  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  1  0  0  0  0  0  0 -1  0  0  1  0] (Indices: [0, 2, 3, 4, 6, 7, 9, 10, 11, 12, 13, 14, 15, 19]), Candidate: [ 1  2  1  0  0  2  1 -1  2  1  0  1  1  1  0  0  1  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 20950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  1  0  0 -1  0  1  0 -1  1  0  0  0] (Indices: [0, 2, 3, 4, 6, 7, 9, 10, 11, 14, 15, 17, 18, 19]), Candidate: [ 1  2  1  0  0  2  1 -1  2  1  0  0  1  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  1 -1  1  0 -1  1 -1  1  0  0  0  0] (Indices: [0, 2, 3, 4, 6, 7, 9, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 1  2  1  0  0  2  1 -1  2  0  1  1  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  0  1 -1  1  0 -1  1  0  0  0  0  0] (Indices: [0, 2, 3, 4, 6, 7, 10, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 1  2  1  0  0  2  1 -1  1  2 -1  2  1  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1  0  0  0 -1  1  0  0 -1  1  0 -1  1] (Indices: [0, 2, 3, 4, 6, 8, 9, 10, 11, 13, 14, 15, 17, 18]), Candidate: [1 2 1 0 0 2 0 1 1 1 0 0 2 1 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 21150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1  0 -1  1  0  0  0  0 -1  1 -1  1  0] (Indices: [0, 2, 3, 4, 6, 8, 9, 11, 12, 13, 14, 15, 17, 19]), Candidate: [1 2 1 0 0 2 0 1 1 0 1 1 1 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 21200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1 -1  1  0  0 -1  1  0 -1  1  0  0  0] (Indices: [0, 2, 3, 4, 6, 8, 10, 11, 12, 14, 15, 17, 18, 19]), Candidate: [1 2 1 0 0 2 0 1 0 2 0 1 0 2 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 21250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  1  0  0 -1  1  0  0  0 -1  1  0  0] (Indices: [0, 2, 3, 4, 6, 9, 10, 11, 13, 14, 15, 16, 18, 19]), Candidate: [1 2 1 0 0 2 0 0 2 1 0 0 2 1 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 21300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0  0  0  0  0  0 -1  0  1 -1  1  0  0] (Indices: [0, 2, 3, 4, 7, 8, 9, 10, 11, 12, 13, 16, 18, 19]), Candidate: [1 2 1 0 0 1 2 0 1 1 0 1 1 0 0 2 0 2 1 6]
 -> Valid neighbor added.
Attempt 21350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0  0  0 -1  1  0 -1  1  0 -1  1  0  0] (Indices: [0, 2, 3, 4, 7, 8, 9, 10, 12, 13, 15, 16, 18, 19]), Candidate: [ 1  2  1  0  0  1  2  0  1  1 -1  2  1  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0  0 -1  0  1 -1  1  0  0  0  0  0  0] (Indices: [0, 2, 3, 4, 7, 8, 9, 12, 14, 15, 16, 17, 18, 19]), Candidate: [1 2 1 0 0 1 2 0 1 0 0 2 0 2 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 21450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  1  0  0  0  0  0  0 -1  1  0 -1  1] (Indices: [0, 2, 3, 4, 7, 9, 10, 11, 12, 13, 14, 15, 17, 18]), Candidate: [ 1  2  1  0  0  1  2 -1  2  1  0  1  1  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1 -1  0  1 -1  1  0  0  0  0  0  0  0  0] (Indices: [0, 2, 3, 4, 7, 10, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  2  1  0  0  1  2 -1  1  2 -1  2  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  0  1 -1  1  0  0  0  0  0 -1  1  0  0  0] (Indices: [0, 2, 3, 4, 8, 10, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [1 2 1 0 0 1 1 1 0 2 0 1 1 1 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 21600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0  0  0  0  0 -1  0  0  1  0 -1  1  0] (Indices: [0, 2, 3, 5, 6, 7, 8, 9, 10, 11, 12, 16, 17, 19]), Candidate: [ 1  2  1 -1  2  1  1  0  1  1  0  1  0  1  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0  0  0 -1  1  0 -1  1  0 -1  0  1  0] (Indices: [0, 2, 3, 5, 6, 7, 8, 9, 10, 12, 13, 15, 16, 19]), Candidate: [ 1  2  1 -1  2  1  1  0  1  1 -1  2  1  0  1  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0  0 -1  1  0  0  0 -1  1 -1  0  1  0] (Indices: [0, 2, 3, 5, 6, 7, 8, 9, 11, 12, 13, 14, 16, 19]), Candidate: [ 1  2  1 -1  2  1  1  0  1  0  1  1  1  1 -1  2  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0  0 -1  0  1  0  0  0  0  0 -1  0  1] (Indices: [0, 2, 3, 5, 6, 7, 8, 9, 12, 13, 14, 15, 16, 17]), Candidate: [ 1  2  1 -1  2  1  1  0  1  0  0  2  1  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0 -1  1  0  0 -1  1  0  0 -1  0  1  0] (Indices: [0, 2, 3, 5, 6, 7, 8, 10, 11, 12, 14, 15, 16, 19]), Candidate: [ 1  2  1 -1  2  1  1  0  0  2  0  1  0  2  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 21850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0 -1  1 -1  1 -1  1  0  0  0 -1  1  0] (Indices: [0, 2, 3, 5, 6, 7, 8, 10, 12, 14, 15, 16, 17, 19]), Candidate: [ 1  2  1 -1  2  1  1  0  0  2 -1  2  0  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  1  0  0  0  0  0  0 -1  0  1 -1  1] (Indices: [0, 2, 3, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 18]), Candidate: [ 1  2  1 -1  2  1  1 -1  2  1  0  1  1  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 21950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  1  0  0 -1  0  1  0  0 -1  1  0  0] (Indices: [0, 2, 3, 5, 6, 7, 9, 10, 11, 14, 15, 16, 18, 19]), Candidate: [ 1  2  1 -1  2  1  1 -1  2  1  0  0  1  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 22000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  1 -1  1  0 -1  1  0 -1  1  0  0  0] (Indices: [0, 2, 3, 5, 6, 7, 9, 11, 12, 14, 15, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  1  1 -1  2  0  1  1  0  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 22050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  0  1 -1  1  0  0 -1  1  0  0  0  0] (Indices: [0, 2, 3, 5, 6, 7, 10, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  1  1 -1  1  2 -1  2  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1 -1]). Discarded.
Attempt 22100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1  0  0  0 -1  1  0  0  0 -1  0  1  0] (Indices: [0, 2, 3, 5, 6, 8, 9, 10, 11, 13, 14, 15, 16, 19]), Candidate: [ 1  2  1 -1  2  1  0  1  1  1  0  0  2  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1  0 -1  1  0  0  0  0 -1  1  0 -1  1] (Indices: [0, 2, 3, 5, 6, 8, 9, 11, 12, 13, 14, 15, 17, 18]), Candidate: [ 1  2  1 -1  2  1  0  1  1  0  1  1  1  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1 -1  1  0  0 -1  1  0  0 -1  1  0  0] (Indices: [0, 2, 3, 5, 6, 8, 10, 11, 12, 14, 15, 16, 18, 19]), Candidate: [ 1  2  1 -1  2  1  0  1  0  2  0  1  0  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  0  1  0  0 -1  1  0  0  0  0 -1  1  0] (Indices: [0, 2, 3, 5, 6, 9, 10, 11, 13, 14, 15, 16, 17, 19]), Candidate: [ 1  2  1 -1  2  1  0  0  2  1  0  0  2  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0  0  0  0  0  0 -1  0  1  0 -1  1  0] (Indices: [0, 2, 3, 5, 7, 8, 9, 10, 11, 12, 13, 16, 17, 19]), Candidate: [ 1  2  1 -1  2  0  2  0  1  1  0  1  1  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0  0  0 -1  1  0 -1  1  0  0 -1  1  0] (Indices: [0, 2, 3, 5, 7, 8, 9, 10, 12, 13, 15, 16, 17, 19]), Candidate: [ 1  2  1 -1  2  0  2  0  1  1 -1  2  1  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 22400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0  0 -1  0  1  0 -1  1  0  0  0  0  0] (Indices: [0, 2, 3, 5, 7, 8, 9, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  0  2  0  1  0  0  2  1  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  1  0  0  0  0  0  0  0 -1  0  1  0] (Indices: [0, 2, 3, 5, 7, 9, 10, 11, 12, 13, 14, 15, 16, 19]), Candidate: [ 1  2  1 -1  2  0  2 -1  2  1  0  1  1  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 22500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1 -1  0  1  0 -1  1  0  0  0  0  0  0  0] (Indices: [0, 2, 3, 5, 7, 10, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  0  2 -1  1  2  0  0  2  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 22550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  0  1 -1  1  0  0  0  0  0  0 -1  1  0  0] (Indices: [0, 2, 3, 5, 8, 10, 11, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 1  2  1 -1  2  0  1  1  0  2  0  1  1  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0  0  0  0  0 -1  0  1  0  0 -1  1  0] (Indices: [0, 2, 3, 6, 7, 8, 9, 10, 11, 12, 15, 16, 17, 19]), Candidate: [ 1  2  1 -1  1  2  1  0  1  1  0  1  0  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0  0  0 -1  0  1  0 -1  1  0  0  0  0] (Indices: [0, 2, 3, 6, 7, 8, 9, 10, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  2  1 -1  1  2  1  0  1  1 -1  1  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 22700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0 -1  1  0  0  0 -1  1  0  0 -1  1  0] (Indices: [0, 2, 3, 6, 7, 8, 10, 11, 12, 13, 15, 16, 17, 19]), Candidate: [ 1  2  1 -1  1  2  1  0  0  2  0  1  1  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0 -1  1  0  0  0 -1  1  0  0  0 -1  1  0] (Indices: [0, 2, 3, 6, 7, 9, 10, 11, 12, 14, 15, 16, 17, 19]), Candidate: [ 1  2  1 -1  1  2  1 -1  2  1  0  1  0  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 22800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  1  0  0  0  0  0 -1  1  0  0 -1  1  0] (Indices: [0, 2, 3, 6, 8, 9, 10, 11, 12, 13, 15, 16, 17, 19]), Candidate: [ 1  2  1 -1  1  2  0  1  1  1  0  1  1  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1 -1  0  1  0  0  0 -1  1  0  0  0  0  0  0] (Indices: [0, 2, 3, 6, 9, 10, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  2  1 -1  1  2  0  0  2  1  0  1  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  0  1  0 -1  1  0  0  0  0  0  0  0  0 -1  1] (Indices: [0, 2, 3, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 1  2  1 -1  1  1  2  0  0  2  0  1  1  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 22950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0  0  0  0  0 -1  1  0 -1  0  1 -1  1] (Indices: [0, 2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 15, 18]), Candidate: [1 2 0 1 1 1 1 0 1 1 0 1 0 2 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 23000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0  0  0  0 -1  0  0  1  0 -1  1  0  0] (Indices: [0, 2, 4, 5, 6, 7, 8, 9, 10, 11, 15, 16, 18, 19]), Candidate: [1 2 0 1 1 1 1 0 1 1 0 0 1 1 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 23050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0  0  0 -1  0  1 -1  1  0 -1  1  0  0] (Indices: [0, 2, 4, 5, 6, 7, 8, 9, 10, 13, 15, 16, 18, 19]), Candidate: [ 1  2  0  1  1  1  1  0  1  1 -1  1  2  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0  0 -1  1 -1  1  0 -1  1  0  0 -1  1] (Indices: [0, 2, 4, 5, 6, 7, 8, 9, 11, 13, 14, 16, 17, 18]), Candidate: [ 1  2  0  1  1  1  1  0  1  0  1  0  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0 -1  1  0  0  0  0 -1  0  1  0 -1  1] (Indices: [0, 2, 4, 5, 6, 7, 8, 10, 11, 12, 13, 14, 17, 18]), Candidate: [ 1  2  0  1  1  1  1  0  0  2  0  1  1  1 -1  1  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0 -1  1 -1  1  0  0  0  0 -1  1 -1  1] (Indices: [0, 2, 4, 5, 6, 7, 8, 10, 12, 13, 14, 15, 16, 18]), Candidate: [ 1  2  0  1  1  1  1  0  0  2 -1  2  1  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0 -1  0  1 -1  1  0  0  0 -1  1  0  0] (Indices: [0, 2, 4, 5, 6, 7, 8, 11, 13, 14, 15, 16, 18, 19]), Candidate: [1 2 0 1 1 1 1 0 0 1 1 0 2 1 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 23300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  1  0  0 -1  1  0  0  0 -1  0  1  0] (Indices: [0, 2, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 19]), Candidate: [ 1  2  0  1  1  1  1 -1  2  1  0  0  2  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  1 -1  1  0  0  0  0 -1  1  0 -1  1] (Indices: [0, 2, 4, 5, 6, 7, 9, 11, 12, 13, 14, 15, 17, 18]), Candidate: [ 1  2  0  1  1  1  1 -1  2  0  1  1  1  1  0  0  2  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  0  1  0  0 -1  1  0  0 -1  1  0  0] (Indices: [0, 2, 4, 5, 6, 7, 10, 11, 12, 14, 15, 16, 18, 19]), Candidate: [ 1  2  0  1  1  1  1 -1  1  2  0  1  0  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1  0  0  0  0 -1  1  0  0 -1  0  1  0] (Indices: [0, 2, 4, 5, 6, 8, 9, 10, 11, 12, 14, 15, 16, 19]), Candidate: [1 2 0 1 1 1 0 1 1 1 0 1 0 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 23500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1  0  0 -1  1 -1  1  0  0  0 -1  1  0] (Indices: [0, 2, 4, 5, 6, 8, 9, 10, 12, 14, 15, 16, 17, 19]), Candidate: [ 1  2  0  1  1  1  0  1  1  1 -1  2  0  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1 -1  1  0  0  0  0  0  0 -1  0  1  0] (Indices: [0, 2, 4, 5, 6, 8, 10, 11, 12, 13, 14, 15, 16, 19]), Candidate: [1 2 0 1 1 1 0 1 0 2 0 1 1 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 23600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  0  1  0  0  0  0  0 -1  1  0 -1  1  0] (Indices: [0, 2, 4, 5, 6, 9, 10, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 1  2  0  1  1  1  0  0  2  1  0  1  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0  0  0  0  0  0  0  0 -1  0  1 -1  1] (Indices: [0, 2, 4, 5, 7, 8, 9, 10, 11, 12, 13, 14, 15, 18]), Candidate: [1 2 0 1 1 0 2 0 1 1 0 1 1 1 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 23700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0  0  0  0 -1  0  1  0  0 -1  1  0  0] (Indices: [0, 2, 4, 5, 7, 8, 9, 10, 11, 14, 15, 16, 18, 19]), Candidate: [1 2 0 1 1 0 2 0 1 1 0 0 1 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 23750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0  0 -1  1  0 -1  1  0 -1  1  0  0  0] (Indices: [0, 2, 4, 5, 7, 8, 9, 11, 12, 14, 15, 17, 18, 19]), Candidate: [1 2 0 1 1 0 2 0 1 0 1 1 0 2 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 23800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0 -1  1 -1  1  0  0 -1  1  0  0  0  0] (Indices: [0, 2, 4, 5, 7, 8, 10, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  2  0  1  1  0  2  0  0  2 -1  2  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 23850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1 -1  1 -1  1  0  0  0  0  0  0 -1  1  0] (Indices: [0, 2, 4, 5, 7, 9, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 1  2  0  1  1  0  2 -1  2  0  1  1  1  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 23900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1  0  0 -1  1  0  0 -1  1  0  0  0  0] (Indices: [0, 2, 4, 5, 8, 9, 10, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  2  0  1  1  0  1  1  1  1 -1  2  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 23950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0  0  0  0  0  0 -1  0  1  0  0 -1  1] (Indices: [0, 2, 4, 6, 7, 8, 9, 10, 11, 12, 13, 16, 17, 18]), Candidate: [1 2 0 1 0 2 1 0 1 1 0 1 1 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 24000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0  0  0 -1  1  0 -1  1  0  0  0 -1  1] (Indices: [0, 2, 4, 6, 7, 8, 9, 10, 12, 13, 15, 16, 17, 18]), Candidate: [ 1  2  0  1  0  2  1  0  1  1 -1  2  1  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0  0 -1  0  1  0  0 -1  1  0  0  0  0] (Indices: [0, 2, 4, 6, 7, 8, 9, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  2  0  1  0  2  1  0  1  0  0  2  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  1  0  0  0  0  0  0  0 -1  1 -1  1] (Indices: [0, 2, 4, 6, 7, 9, 10, 11, 12, 13, 14, 15, 16, 18]), Candidate: [ 1  2  0  1  0  2  1 -1  2  1  0  1  1  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0 -1  0  1  0  0 -1  1  0  0  0  0  0  0] (Indices: [0, 2, 4, 6, 7, 10, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  2  0  1  0  2  1 -1  1  2  0  1  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1 -1  1 -1  1  0  0  0  0  0  0  0 -1  1  0] (Indices: [0, 2, 4, 6, 8, 10, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [1 2 0 1 0 2 0 1 0 2 0 1 1 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 24250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  0  1  0  0  0 -1  1  0  0  0  0 -1  1  0  0] (Indices: [0, 2, 4, 7, 8, 9, 10, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 1  2  0  1  0  1  2  0  1  1 -1  2  1  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0  0  0  0  0  0  0  0 -1  0  1 -1  1] (Indices: [0, 2, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 18]), Candidate: [1 2 0 0 2 1 1 0 1 1 0 1 1 1 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 24350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0  0  0  0 -1  0  1  0  0 -1  1  0  0] (Indices: [0, 2, 5, 6, 7, 8, 9, 10, 11, 14, 15, 16, 18, 19]), Candidate: [1 2 0 0 2 1 1 0 1 1 0 0 1 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 24400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0  0 -1  1  0 -1  1  0 -1  1  0  0  0] (Indices: [0, 2, 5, 6, 7, 8, 9, 11, 12, 14, 15, 17, 18, 19]), Candidate: [1 2 0 0 2 1 1 0 1 0 1 1 0 2 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 24450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0 -1  1 -1  1  0  0 -1  1  0  0  0  0] (Indices: [0, 2, 5, 6, 7, 8, 10, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  2  0  0  2  1  1  0  0  2 -1  2  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 24500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  1 -1  1  0  0  0  0  0  0 -1  1  0] (Indices: [0, 2, 5, 6, 7, 9, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 1  2  0  0  2  1  1 -1  2  0  1  1  1  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 24550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0 -1  1  0  0 -1  1  0  0 -1  1  0  0  0  0] (Indices: [0, 2, 5, 6, 8, 9, 10, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  2  0  0  2  1  0  1  1  1 -1  2  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 24600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  1  0  0  0  0  0 -1  1  0  0  0 -1  1  0] (Indices: [0, 2, 5, 7, 8, 9, 10, 11, 12, 14, 15, 16, 17, 19]), Candidate: [1 2 0 0 2 0 2 0 1 1 0 1 0 2 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 24650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1 -1  0  1  0  0  0  0  0  0  0  0  0  0 -1  1] (Indices: [0, 2, 5, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [1 2 0 0 2 0 1 1 1 1 0 1 1 1 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 24700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  1  0  0  0 -1  1  0  0  0  0  0 -1  1  0  0] (Indices: [0, 2, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 18, 19]), Candidate: [1 2 0 0 1 2 1 0 1 0 1 1 1 1 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 24750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  0  0  1  0 -1  1  0  0  0  0  0  0  0  0  0  0] (Indices: [0, 2, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [1 2 0 0 1 1 2 0 0 2 0 1 1 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 24800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0  0  0  0 -1  1 -1  1  0 -1  0  1  0] (Indices: [0, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 16, 19]), Candidate: [1 1 2 0 1 1 1 0 1 1 0 0 2 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 24850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0  0  0 -1  1 -1  1 -1  1  0 -1  1  0] (Indices: [0, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 16, 17, 19]), Candidate: [ 1  1  2  0  1  1  1  0  1  1 -1  2  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 24900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0  0 -1  1  0 -1  1  0  0 -1  1 -1  1] (Indices: [0, 3, 4, 5, 6, 7, 8, 9, 11, 12, 14, 15, 16, 18]), Candidate: [1 1 2 0 1 1 1 0 1 0 1 1 0 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 24950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0  0 -1  0  1 -1  1  0  0  0  0 -1  1] (Indices: [0, 3, 4, 5, 6, 7, 8, 9, 12, 14, 15, 16, 17, 18]), Candidate: [1 1 2 0 1 1 1 0 1 0 0 2 0 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 25000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0 -1  1  0 -1  1  0  0  0 -1  0  1  0] (Indices: [0, 3, 4, 5, 6, 7, 8, 10, 11, 13, 14, 15, 16, 19]), Candidate: [1 1 2 0 1 1 1 0 0 2 0 0 2 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 25050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0 -1  0  1  0  0  0  0 -1  1  0 -1  1] (Indices: [0, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 15, 17, 18]), Candidate: [1 1 2 0 1 1 1 0 0 1 1 1 1 1 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 25100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  1  0  0  0  0 -1  0  1  0 -1  1  0] (Indices: [0, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 16, 17, 19]), Candidate: [ 1  1  2  0  1  1  1 -1  2  1  0  1  1  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  1  0 -1  1  0 -1  1  0  0 -1  1  0] (Indices: [0, 3, 4, 5, 6, 7, 9, 10, 12, 13, 15, 16, 17, 19]), Candidate: [ 1  1  2  0  1  1  1 -1  2  1 -1  2  1  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 25200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  1 -1  0  1  0 -1  1  0  0  0  0  0] (Indices: [0, 3, 4, 5, 6, 7, 9, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 1  1  2  0  1  1  1 -1  2  0  0  2  1  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1  0  0  0  0  0  0  0 -1  0  1 -1  1] (Indices: [0, 3, 4, 5, 6, 8, 9, 10, 11, 12, 13, 14, 15, 18]), Candidate: [1 1 2 0 1 1 0 1 1 1 0 1 1 1 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 25300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1  0  0  0 -1  0  1  0  0 -1  1  0  0] (Indices: [0, 3, 4, 5, 6, 8, 9, 10, 11, 14, 15, 16, 18, 19]), Candidate: [1 1 2 0 1 1 0 1 1 1 0 0 1 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 25350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1  0 -1  1  0 -1  1  0 -1  1  0  0  0] (Indices: [0, 3, 4, 5, 6, 8, 9, 11, 12, 14, 15, 17, 18, 19]), Candidate: [1 1 2 0 1 1 0 1 1 0 1 1 0 2 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 25400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1 -1  1 -1  1  0  0 -1  1  0  0  0  0] (Indices: [0, 3, 4, 5, 6, 8, 10, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  1  2  0  1  1  0  1  0  2 -1  2  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 25450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  0  1 -1  1  0  0  0  0  0  0 -1  1  0] (Indices: [0, 3, 4, 5, 6, 9, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [1 1 2 0 1 1 0 0 2 0 1 1 1 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 25500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0  0  0  0  0 -1  0  1  0 -1  1  0  0] (Indices: [0, 3, 4, 5, 7, 8, 9, 10, 11, 12, 15, 16, 18, 19]), Candidate: [1 1 2 0 1 0 2 0 1 1 0 1 0 1 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 25550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0  0  0 -1  0  1 -1  1  0  0  0  0  0] (Indices: [0, 3, 4, 5, 7, 8, 9, 10, 13, 15, 16, 17, 18, 19]), Candidate: [ 1  1  2  0  1  0  2  0  1  1 -1  1  2  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0 -1  1  0  0  0 -1  1  0 -1  1  0  0] (Indices: [0, 3, 4, 5, 7, 8, 10, 11, 12, 13, 15, 16, 18, 19]), Candidate: [1 1 2 0 1 0 2 0 0 2 0 1 1 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 25650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  1  0  0  0 -1  1  0  0 -1  1  0  0] (Indices: [0, 3, 4, 5, 7, 9, 10, 11, 12, 14, 15, 16, 18, 19]), Candidate: [ 1  1  2  0  1  0  2 -1  2  1  0  1  0  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 25700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  1  0  0  0  0  0 -1  1  0 -1  1  0  0] (Indices: [0, 3, 4, 5, 8, 9, 10, 11, 12, 13, 15, 16, 18, 19]), Candidate: [1 1 2 0 1 0 1 1 1 1 0 1 1 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 25750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  0  0  1  0  0 -1  1  0  0  0  0  0  0  0] (Indices: [0, 3, 4, 5, 9, 10, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [1 1 2 0 1 0 1 0 2 1 0 0 2 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 25800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0  0  0  0 -1  1 -1  1  0  0 -1  1  0] (Indices: [0, 3, 4, 6, 7, 8, 9, 10, 11, 13, 15, 16, 17, 19]), Candidate: [1 1 2 0 0 2 1 0 1 1 0 0 2 0 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 25850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0  0 -1  1  0  0 -1  1  0 -1  1  0  0] (Indices: [0, 3, 4, 6, 7, 8, 9, 11, 12, 13, 15, 16, 18, 19]), Candidate: [1 1 2 0 0 2 1 0 1 0 1 1 1 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 25900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0 -1  1  0 -1  1 -1  1  0  0  0  0  0] (Indices: [0, 3, 4, 6, 7, 8, 10, 11, 13, 15, 16, 17, 18, 19]), Candidate: [1 1 2 0 0 2 1 0 0 2 0 0 2 0 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 25950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0 -1  1  0 -1  1  0  0  0 -1  1  0  0  0] (Indices: [0, 3, 4, 6, 7, 9, 10, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 1  1  2  0  0  2  1 -1  2  1 -1  2  1  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 26000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1 -1  1  0  0  0 -1  1 -1  1  0  0  0  0  0] (Indices: [0, 3, 4, 6, 8, 9, 10, 11, 13, 15, 16, 17, 18, 19]), Candidate: [1 1 2 0 0 2 0 1 1 1 0 0 2 0 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 26050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0  0  0  0  0  0 -1  1  0  0  0 -1  1] (Indices: [0, 3, 4, 7, 8, 9, 10, 11, 12, 13, 15, 16, 17, 18]), Candidate: [1 1 2 0 0 1 2 0 1 1 0 1 1 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 26100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1 -1  1  0  0  0  0 -1  1  0  0  0  0  0] (Indices: [0, 3, 4, 7, 9, 10, 11, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 1  1  2  0  0  1  2 -1  2  1  0  1  1  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0  0  0  0  0 -1  0  1  0 -1  1  0  0] (Indices: [0, 3, 5, 6, 7, 8, 9, 10, 11, 12, 15, 16, 18, 19]), Candidate: [ 1  1  2 -1  2  1  1  0  1  1  0  1  0  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0  0  0 -1  0  1 -1  1  0  0  0  0  0] (Indices: [0, 3, 5, 6, 7, 8, 9, 10, 13, 15, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  2  1  1  0  1  1 -1  1  2  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 26250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0 -1  1  0  0  0 -1  1  0 -1  1  0  0] (Indices: [0, 3, 5, 6, 7, 8, 10, 11, 12, 13, 15, 16, 18, 19]), Candidate: [ 1  1  2 -1  2  1  1  0  0  2  0  1  1  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0 -1  1  0  0  0 -1  1  0  0 -1  1  0  0] (Indices: [0, 3, 5, 6, 7, 9, 10, 11, 12, 14, 15, 16, 18, 19]), Candidate: [ 1  1  2 -1  2  1  1 -1  2  1  0  1  0  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 26350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  1  0  0  0  0  0 -1  1  0 -1  1  0  0] (Indices: [0, 3, 5, 6, 8, 9, 10, 11, 12, 13, 15, 16, 18, 19]), Candidate: [ 1  1  2 -1  2  1  0  1  1  1  0  1  1  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0 -1  0  1  0  0 -1  1  0  0  0  0  0  0  0] (Indices: [0, 3, 5, 6, 9, 10, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  2  1  0  0  2  1  0  0  2  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1 -1  1  0 -1  1  0  0  0  0  0  0  0 -1  1  0] (Indices: [0, 3, 5, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 1  1  2 -1  2  0  2  0  0  2  0  1  1  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0  0  0  0  0 -1  1  0 -1  1  0  0  0] (Indices: [0, 3, 6, 7, 8, 9, 10, 11, 12, 14, 15, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  2  1  0  1  1  0  1  0  2  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1 -1  1  0  0  0  0  0  0  0  0 -1  1  0  0] (Indices: [0, 3, 6, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 1  1  2 -1  1  2  0  1  1  1  0  1  1  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0  0  0  0  0 -1  1 -1  1  0 -1  1  0] (Indices: [0, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 16, 17, 19]), Candidate: [ 1  1  1  1  1  1  1  0  1  1  0  1  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0  0  0 -1  0  1  0  0  0  0  0 -1  1] (Indices: [0, 4, 5, 6, 7, 8, 9, 10, 13, 14, 15, 16, 17, 18]), Candidate: [ 1  1  1  1  1  1  1  0  1  1 -1  1  2  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0 -1  1  0  0  0  0 -1  1  0 -1  1  0] (Indices: [0, 4, 5, 6, 7, 8, 10, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 1  1  1  1  1  1  1  0  0  2  0  1  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0 -1  1  0  0  0  0 -1  1  0 -1  1  0  0] (Indices: [0, 4, 5, 6, 7, 9, 10, 11, 12, 13, 15, 16, 18, 19]), Candidate: [ 1  1  1  1  1  1  1 -1  2  1  0  1  1  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  1  0  0  0  0  0  0 -1  1  0 -1  1  0] (Indices: [0, 4, 5, 6, 8, 9, 10, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 1  1  1  1  1  1  0  1  1  1  0  1  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 26850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0 -1  0  1  0  0  0  0  0  0  0 -1  1  0  0] (Indices: [0, 4, 5, 6, 9, 10, 11, 12, 13, 14, 15, 16, 18, 19]), Candidate: [1 1 1 1 1 1 0 0 2 1 0 1 1 1 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 26900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0 -1  1  0  0 -1  1  0  0 -1  1  0  0  0  0  0] (Indices: [0, 4, 5, 7, 8, 9, 11, 12, 13, 15, 16, 17, 18, 19]), Candidate: [1 1 1 1 1 0 2 0 1 0 1 1 1 0 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 26950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0  0  0  0  0  0 -1  1 -1  1  0  0  0] (Indices: [0, 4, 6, 7, 8, 9, 10, 11, 12, 13, 15, 17, 18, 19]), Candidate: [1 1 1 1 0 2 1 0 1 1 0 1 1 0 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 27000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0 -1  1  0 -1  1  0  0  0  0  0  0  0  0] (Indices: [0, 4, 6, 7, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  1  1  1  0  2  1 -1  2  1 -1  2  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0  0  0  0  0  0 -1  1  0  0  0  0 -1  1  0] (Indices: [0, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 19]), Candidate: [1 1 1 0 2 1 1 0 1 1 0 0 2 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 27100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  0  1  0 -1  1  0  0  0  0 -1  1  0  0  0  0  0  0] (Indices: [0, 5, 6, 8, 9, 10, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [1 1 1 0 2 1 0 1 1 1 0 1 0 2 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 27150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0  0  0  0  0 -1  0  0  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 16, 19]), Candidate: [3 1 1 0 1 1 1 0 1 1 0 1 0 1 0 2 0 1 2 5]
 -> Valid neighbor added.
Attempt 27200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0  0  0 -1  1  0 -1  0  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 16, 19]), Candidate: [ 3  1  1  0  1  1  1  0  1  1 -1  2  1  0  0  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0  0  0 -1  0  0  1 -1  1  0  0 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 14, 16, 17, 18]), Candidate: [ 3  1  1  0  1  1  1  0  1  1 -1  1  1  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0  0 -1  1 -1  1  0 -1  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 13, 14, 16, 19]), Candidate: [ 3  1  1  0  1  1  1  0  1  0  1  0  2  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0  0 -1  0  1 -1  1  0  0 -1  1 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 9, 12, 14, 15, 16, 18]), Candidate: [3 1 1 0 1 1 1 0 1 0 0 2 0 2 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 27400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0 -1  1  0  0 -1  1  0  0 -1  0  0  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 12, 14, 15, 16]), Candidate: [3 1 1 0 1 1 1 0 0 2 0 1 0 2 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 27450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0 -1  1  0 -1  0  0  1  0  0  0 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 15, 16, 17, 18]), Candidate: [3 1 1 0 1 1 1 0 0 2 0 0 1 1 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 27500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0 -1  1 -1  0  1 -1  1  0  0  0 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 10, 13, 15, 16, 17, 18]), Candidate: [ 3  1  1  0  1  1  1  0  0  2 -1  1  2  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0 -1  0  1 -1  1  0  0 -1  1 -1  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 11, 13, 14, 15, 17, 19]), Candidate: [3 1 1 0 1 1 1 0 0 1 1 0 2 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 27600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  1  0  0  0  0 -1  1  0 -1  0  0  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 15, 16]), Candidate: [ 3  1  1  0  1  1  1 -1  2  1  0  1  1  0  1  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  1  0  0 -1  0  1  0  0  0 -1  0  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 14, 15, 16, 17]), Candidate: [ 3  1  1  0  1  1  1 -1  2  1  0  0  1  2  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  1  0 -1  0  1  0  0  0  0 -1  0  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 9, 10, 13, 14, 15, 16, 17]), Candidate: [ 3  1  1  0  1  1  1 -1  2  1 -1  1  2  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  1 -1  1  0 -1  1 -1  0  1  0  0 -1] (Indices: [1, 2, 3, 4, 5, 6, 7, 9, 11, 12, 14, 17, 18, 19]), Candidate: [ 3  1  1  0  1  1  1 -1  2  0  1  1  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 27800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  1 -1  0  0  1  0  0  0 -1  1  0 -1] (Indices: [1, 2, 3, 4, 5, 6, 7, 9, 13, 14, 15, 16, 18, 19]), Candidate: [ 3  1  1  0  1  1  1 -1  2  0  0  1  2  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  0  1  0 -1  1 -1  1  0  0  0 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 10, 11, 13, 15, 16, 17, 18]), Candidate: [ 3  1  1  0  1  1  1 -1  1  2  0  0  2  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  0  0  1  0  0 -1  1  0  0 -1  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 7, 11, 12, 13, 15, 16, 17, 19]), Candidate: [ 3  1  1  0  1  1  1 -1  1  1  1  1  1  0  1  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 27950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1  0  0  0  0 -1  0  1  0  0 -1  0  0] (Indices: [1, 2, 3, 4, 5, 6, 8, 9, 10, 11, 12, 15, 16, 17]), Candidate: [3 1 1 0 1 1 0 1 1 1 0 1 0 1 1 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 28000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1  0  0 -1  1  0  0 -1  1 -1  1 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 13, 14, 16, 18]), Candidate: [ 3  1  1  0  1  1  0  1  1  1 -1  2  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1  0  0 -1  0  0  0  1  0  0  0  0 -1] (Indices: [1, 2, 3, 4, 5, 6, 8, 9, 10, 15, 16, 17, 18, 19]), Candidate: [ 3  1  1  0  1  1  0  1  1  1 -1  1  1  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1  0 -1  1 -1  1 -1  0  1  0  0  0 -1] (Indices: [1, 2, 3, 4, 5, 6, 8, 9, 11, 13, 16, 17, 18, 19]), Candidate: [3 1 1 0 1 1 0 1 1 0 1 0 2 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 28150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1 -1  1  0  0  0 -1  1 -1  0  1  0 -1] (Indices: [1, 2, 3, 4, 5, 6, 8, 10, 11, 12, 13, 15, 18, 19]), Candidate: [3 1 1 0 1 1 0 1 0 2 0 1 1 0 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 28200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1 -1  1 -1  1  0  0 -1  0  1  0  0 -1] (Indices: [1, 2, 3, 4, 5, 6, 8, 10, 12, 13, 14, 17, 18, 19]), Candidate: [ 3  1  1  0  1  1  0  1  0  2 -1  2  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1 -1  0  0  1  0  0  0 -1  1  0  0 -1] (Indices: [1, 2, 3, 4, 5, 6, 8, 12, 13, 14, 15, 17, 18, 19]), Candidate: [3 1 1 0 1 1 0 1 0 1 0 2 1 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 28300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  1  0  0 -1  1 -1  1  0  0  0 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 9, 10, 11, 13, 15, 16, 17, 18]), Candidate: [3 1 1 0 1 1 0 0 2 1 0 0 2 0 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 28350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  1 -1  1  0  0 -1  1  0  0 -1  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 9, 11, 12, 13, 15, 16, 17, 19]), Candidate: [3 1 1 0 1 1 0 0 2 0 1 1 1 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 28400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  0  1  0 -1  1  0 -1  1  0  0  0 -1] (Indices: [1, 2, 3, 4, 5, 6, 10, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  1  1  0  1  1  0  0  1  2  0  0  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0  0  0  0  0 -1  0  1 -1  0  1  0 -1] (Indices: [1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 12, 15, 18, 19]), Candidate: [3 1 1 0 1 0 2 0 1 1 0 1 0 1 1 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 28500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0  0  0 -1  1  0 -1  1  0  0 -1  0  0] (Indices: [1, 2, 3, 4, 5, 7, 8, 9, 10, 12, 13, 15, 16, 17]), Candidate: [ 3  1  1  0  1  0  2  0  1  1 -1  2  1  0  1  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0  0 -1  1  0  0  0 -1  1  0 -1  0  0] (Indices: [1, 2, 3, 4, 5, 7, 8, 9, 11, 12, 13, 14, 16, 17]), Candidate: [ 3  1  1  0  1  0  2  0  1  0  1  1  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0  0 -1  1 -1  0  1 -1  1  0  0  0 -1] (Indices: [1, 2, 3, 4, 5, 7, 8, 9, 11, 14, 16, 17, 18, 19]), Candidate: [ 3  1  1  0  1  0  2  0  1  0  1  0  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0 -1  1  0  0 -1  1  0  0  0 -1  0  0] (Indices: [1, 2, 3, 4, 5, 7, 8, 10, 11, 12, 14, 15, 16, 17]), Candidate: [3 1 1 0 1 0 2 0 0 2 0 1 0 2 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 28700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0 -1  1 -1  1  0 -1  0  1  0  0  0 -1] (Indices: [1, 2, 3, 4, 5, 7, 8, 10, 12, 13, 16, 17, 18, 19]), Candidate: [ 3  1  1  0  1  0  2  0  0  2 -1  2  1  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  1  0  0  0  0  0  0  0 -1  0  0  0] (Indices: [1, 2, 3, 4, 5, 7, 9, 10, 11, 12, 13, 14, 15, 16]), Candidate: [ 3  1  1  0  1  0  2 -1  2  1  0  1  1  1  0  1  0  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  1  0  0 -1  0  1  0  0  0  0 -1  0] (Indices: [1, 2, 3, 4, 5, 7, 9, 10, 11, 14, 15, 16, 17, 18]), Candidate: [ 3  1  1  0  1  0  2 -1  2  1  0  0  1  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  1 -1  1  0 -1  1  0  0  0 -1  1 -1] (Indices: [1, 2, 3, 4, 5, 7, 9, 11, 12, 14, 15, 16, 17, 19]), Candidate: [ 3  1  1  0  1  0  2 -1  2  0  1  1  0  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 28900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  0  1 -1  1  0  0  0  0 -1  1  0 -1] (Indices: [1, 2, 3, 4, 5, 7, 10, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 3  1  1  0  1  0  2 -1  1  2 -1  2  1  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 28950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1  0  0  0 -1  1  0  0  0  0 -1  0  0] (Indices: [1, 2, 3, 4, 5, 8, 9, 10, 11, 13, 14, 15, 16, 17]), Candidate: [3 1 1 0 1 0 1 1 1 1 0 0 2 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 29000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1  0 -1  1  0  0  0  0  0 -1  1 -1  0] (Indices: [1, 2, 3, 4, 5, 8, 9, 11, 12, 13, 14, 15, 16, 18]), Candidate: [3 1 1 0 1 0 1 1 1 0 1 1 1 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 29050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1 -1  1  0  0 -1  1  0  0  0  0 -1  0] (Indices: [1, 2, 3, 4, 5, 8, 10, 11, 12, 14, 15, 16, 17, 18]), Candidate: [3 1 1 0 1 0 1 1 0 2 0 1 0 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 29100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  0  1  0  0  0 -1  0  1  0  0  0  0 -1] (Indices: [1, 2, 3, 4, 5, 9, 10, 11, 12, 15, 16, 17, 18, 19]), Candidate: [3 1 1 0 1 0 1 0 2 1 0 1 0 1 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 29150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0  0  0  0  0 -1  1  0  0 -1  0  0  0] (Indices: [1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 14, 15, 16]), Candidate: [3 1 1 0 0 2 1 0 1 1 0 1 0 2 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 29200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0  0  0  0 -1  0  0  1  0  0  0 -1  0] (Indices: [1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 15, 16, 17, 18]), Candidate: [3 1 1 0 0 2 1 0 1 1 0 0 1 1 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 29250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0  0  0 -1  0  1 -1  1  0  0  0 -1  0] (Indices: [1, 2, 3, 4, 6, 7, 8, 9, 10, 13, 15, 16, 17, 18]), Candidate: [ 3  1  1  0  0  2  1  0  1  1 -1  1  2  0  1  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0  0 -1  1 -1  1  0  0 -1  1 -1  1 -1] (Indices: [1, 2, 3, 4, 6, 7, 8, 9, 11, 13, 14, 15, 17, 19]), Candidate: [3 1 1 0 0 2 1 0 1 0 1 0 2 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 29350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0 -1  1  0  0  0  0 -1  1 -1  1 -1  0] (Indices: [1, 2, 3, 4, 6, 7, 8, 10, 11, 12, 13, 14, 16, 18]), Candidate: [ 3  1  1  0  0  2  1  0  0  2  0  1  1  1 -1  2  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0 -1  1  0 -1  0  0  1  0  0  0  0 -1] (Indices: [1, 2, 3, 4, 6, 7, 8, 10, 11, 15, 16, 17, 18, 19]), Candidate: [3 1 1 0 0 2 1 0 0 2 0 0 1 1 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 29450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0 -1  0  1 -1  1  0  0  0  0  0 -1  0] (Indices: [1, 2, 3, 4, 6, 7, 8, 11, 13, 14, 15, 16, 17, 18]), Candidate: [3 1 1 0 0 2 1 0 0 1 1 0 2 1 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 29500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  1  0  0 -1  1  0  0  0  0 -1  0  0] (Indices: [1, 2, 3, 4, 6, 7, 9, 10, 11, 13, 14, 15, 16, 17]), Candidate: [ 3  1  1  0  0  2  1 -1  2  1  0  0  2  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  1 -1  1  0  0  0  0  0 -1  1 -1  0] (Indices: [1, 2, 3, 4, 6, 7, 9, 11, 12, 13, 14, 15, 16, 18]), Candidate: [ 3  1  1  0  0  2  1 -1  2  0  1  1  1  1  0  1  0  2  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  0  1  0  0 -1  1  0  0  0  0 -1  0] (Indices: [1, 2, 3, 4, 6, 7, 10, 11, 12, 14, 15, 16, 17, 18]), Candidate: [ 3  1  1  0  0  2  1 -1  1  2  0  1  0  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1  0  0  0  0 -1  1  0  0  0 -1  0  0] (Indices: [1, 2, 3, 4, 6, 8, 9, 10, 11, 12, 14, 15, 16, 17]), Candidate: [3 1 1 0 0 2 0 1 1 1 0 1 0 2 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 29700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1  0  0 -1  1  0 -1  0  1  0  0  0 -1] (Indices: [1, 2, 3, 4, 6, 8, 9, 10, 12, 13, 16, 17, 18, 19]), Candidate: [ 3  1  1  0  0  2  0  1  1  1 -1  2  1  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 29750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1 -1  1  0  0  0  0  0  0  0 -1  0  0] (Indices: [1, 2, 3, 4, 6, 8, 10, 11, 12, 13, 14, 15, 16, 17]), Candidate: [3 1 1 0 0 2 0 1 0 2 0 1 1 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 29800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  0  1  0  0  0  0  0  0 -1  0  1  0 -1] (Indices: [1, 2, 3, 4, 6, 9, 10, 11, 12, 13, 14, 15, 18, 19]), Candidate: [3 1 1 0 0 2 0 0 2 1 0 1 1 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 29850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0  0  0  0  0  0  0  0  0 -1  0  0  0] (Indices: [1, 2, 3, 4, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16]), Candidate: [3 1 1 0 0 1 2 0 1 1 0 1 1 1 0 1 0 1 1 6]
 -> Valid neighbor added.
Attempt 29900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0  0  0  0 -1  0  1  0  0  0  0 -1  0] (Indices: [1, 2, 3, 4, 7, 8, 9, 10, 11, 14, 15, 16, 17, 18]), Candidate: [3 1 1 0 0 1 2 0 1 1 0 0 1 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 29950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0  0 -1  1  0 -1  1  0  0  0 -1  1 -1] (Indices: [1, 2, 3, 4, 7, 8, 9, 11, 12, 14, 15, 16, 17, 19]), Candidate: [3 1 1 0 0 1 2 0 1 0 1 1 0 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 30000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0 -1  1 -1  1  0  0  0  0 -1  1  0 -1] (Indices: [1, 2, 3, 4, 7, 8, 10, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 3  1  1  0  0  1  2  0  0  2 -1  2  1  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1 -1  1  0 -1  0  1  0  0  0  0  0  0 -1] (Indices: [1, 2, 3, 4, 7, 9, 10, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  1  1  0  0  1  2 -1  2  1 -1  1  2  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 30100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  0  1  0  0 -1  1  0  0  0  0 -1  1  0 -1] (Indices: [1, 2, 3, 4, 8, 9, 10, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 3  1  1  0  0  1  1  1  1  1 -1  2  1  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0  0  0  0  0  0 -1  0  0  0  1  0 -1] (Indices: [1, 2, 3, 5, 6, 7, 8, 9, 10, 11, 12, 13, 18, 19]), Candidate: [ 3  1  1 -1  2  1  1  0  1  1  0  1  1  0  0  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0  0  0  0 -1  0  1 -1  0  1  0  0 -1] (Indices: [1, 2, 3, 5, 6, 7, 8, 9, 10, 11, 14, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  1  1  0  1  1  0  0  1  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 30250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0  0  0 -1  0  1  0 -1  0  1  0  0 -1] (Indices: [1, 2, 3, 5, 6, 7, 8, 9, 10, 13, 14, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  1  1  0  1  1 -1  1  2  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 30300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0  0 -1  1 -1  1  0  0 -1  1  0 -1  0] (Indices: [1, 2, 3, 5, 6, 7, 8, 9, 11, 13, 14, 15, 17, 18]), Candidate: [ 3  1  1 -1  2  1  1  0  1  0  1  0  2  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0 -1  1  0  0  0  0 -1  1  0 -1  0  0] (Indices: [1, 2, 3, 5, 6, 7, 8, 10, 11, 12, 13, 14, 16, 17]), Candidate: [ 3  1  1 -1  2  1  1  0  0  2  0  1  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 30400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0 -1  1  0 -1  0  1 -1  1  0  0  0 -1] (Indices: [1, 2, 3, 5, 6, 7, 8, 10, 11, 14, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  1  1  0  0  2  0  0  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 30450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0 -1  0  1  0 -1  0  1  0  0  0  0 -1] (Indices: [1, 2, 3, 5, 6, 7, 8, 11, 12, 15, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  1  1  0  0  1  1  1  0  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  1  0  0  0 -1  0  0  1  0  0  0 -1] (Indices: [1, 2, 3, 5, 6, 7, 9, 10, 11, 12, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  1  1 -1  2  1  0  1  0  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 30550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  1 -1  1  0  0  0  0  0  0 -1  0  0] (Indices: [1, 2, 3, 5, 6, 7, 9, 11, 12, 13, 14, 15, 16, 17]), Candidate: [ 3  1  1 -1  2  1  1 -1  2  0  1  1  1  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 30600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  0  1  0  0  0 -1  0  1  0  0  0 -1] (Indices: [1, 2, 3, 5, 6, 7, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  1  1 -1  1  2  0  1  1  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 30650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1  0  0  0  0  0 -1  0  0  1  0  0 -1] (Indices: [1, 2, 3, 5, 6, 8, 9, 10, 11, 12, 13, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  1  0  1  1  1  0  1  1  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1  0  0 -1  1  0 -1  1 -1  1  0  0 -1] (Indices: [1, 2, 3, 5, 6, 8, 9, 10, 12, 13, 15, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  1  0  1  1  1 -1  2  1  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 30750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1  0 -1  0  0  1  0  0  0  0  0  0 -1] (Indices: [1, 2, 3, 5, 6, 8, 9, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  1  0  1  1  0  0  1  2  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  1  0  0  0  0  0  0 -1  1 -1  1 -1] (Indices: [1, 2, 3, 5, 6, 9, 10, 11, 12, 13, 14, 15, 17, 19]), Candidate: [ 3  1  1 -1  2  1  0  0  2  1  0  1  1  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  0  0  0  1  0  0  0  0  0  0  0  0 -1] (Indices: [1, 2, 3, 5, 6, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  1  0  0  1  1  1  1  1  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0  0  0  0 -1  1 -1  0  1  0  0  0 -1] (Indices: [1, 2, 3, 5, 7, 8, 9, 10, 11, 13, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  0  2  0  1  1  0  0  2  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 30950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0  0 -1  1  0 -1  1  0  0  0  0 -1  0] (Indices: [1, 2, 3, 5, 7, 8, 9, 11, 12, 14, 15, 16, 17, 18]), Candidate: [ 3  1  1 -1  2  0  2  0  1  0  1  1  0  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0 -1  1 -1  1  0  0  0  0  0 -1  1 -1] (Indices: [1, 2, 3, 5, 7, 8, 10, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 3  1  1 -1  2  0  2  0  0  2 -1  2  1  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1 -1  1  0 -1  1 -1  1  0  0  0  0  0 -1] (Indices: [1, 2, 3, 5, 7, 9, 10, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  0  2 -1  2  1 -1  2  0  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 31100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1  0  0 -1  1  0  0  0  0  0 -1  1 -1] (Indices: [1, 2, 3, 5, 8, 9, 10, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 3  1  1 -1  2  0  1  1  1  1 -1  2  1  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0  0  0  0  0  0 -1  1 -1  1  0 -1  0] (Indices: [1, 2, 3, 6, 7, 8, 9, 10, 11, 12, 13, 15, 17, 18]), Candidate: [ 3  1  1 -1  1  2  1  0  1  1  0  1  1  0  1  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0  0  0 -1  1  0  0 -1  1  0 -1  1 -1] (Indices: [1, 2, 3, 6, 7, 8, 9, 10, 12, 13, 14, 16, 17, 19]), Candidate: [ 3  1  1 -1  1  2  1  0  1  1 -1  2  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 31250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0  0 -1  0  1  0  0  0  0  0 -1  1 -1] (Indices: [1, 2, 3, 6, 7, 8, 9, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 3  1  1 -1  1  2  1  0  1  0  0  2  1  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0 -1  0  1 -1  1  0  0  0  0  0  0 -1] (Indices: [1, 2, 3, 6, 7, 8, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  2  1  0  0  1  1  0  2  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0 -1  0  1  0  0  0  0  0 -1  1  0  0 -1] (Indices: [1, 2, 3, 6, 7, 10, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  2  1 -1  1  2  0  1  1  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1 -1  1  0 -1  1 -1  1  0  0  0  0  0  0 -1] (Indices: [1, 2, 3, 6, 8, 9, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  2  0  1  1  0  1  0  2  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  1  0  0  0  0 -1  0  1  0  0  0  0  0 -1] (Indices: [1, 2, 3, 7, 8, 9, 10, 11, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  1  2  0  1  1  0  0  1  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 -1] (Indices: [1, 2, 3, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  1  1  0  2  1  0  1  1  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0  0  0  0 -1  1 -1  1 -1  1 -1  1 -1] (Indices: [1, 2, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19]), Candidate: [3 1 0 1 1 1 1 0 1 1 0 0 2 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 31600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0  0  0 -1  1 -1  1 -1  0  1  0  0 -1] (Indices: [1, 2, 4, 5, 6, 7, 8, 9, 10, 12, 14, 17, 18, 19]), Candidate: [ 3  1  0  1  1  1  1  0  1  1 -1  2  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0  0 -1  1  0 -1  1  0 -1  1  0 -1  0] (Indices: [1, 2, 4, 5, 6, 7, 8, 9, 11, 12, 14, 15, 17, 18]), Candidate: [3 1 0 1 1 1 1 0 1 0 1 1 0 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 31700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0  0 -1  0  1 -1  1  0  0 -1  1  0 -1] (Indices: [1, 2, 4, 5, 6, 7, 8, 9, 12, 14, 15, 16, 18, 19]), Candidate: [3 1 0 1 1 1 1 0 1 0 0 2 0 2 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 31750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0 -1  1  0 -1  1  0  0 -1  1 -1  1 -1] (Indices: [1, 2, 4, 5, 6, 7, 8, 10, 11, 13, 14, 15, 17, 19]), Candidate: [3 1 0 1 1 1 1 0 0 2 0 0 2 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 31800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0 -1  0  1  0  0  0  0 -1  0  1  0 -1] (Indices: [1, 2, 4, 5, 6, 7, 8, 11, 12, 13, 14, 15, 18, 19]), Candidate: [3 1 0 1 1 1 1 0 0 1 1 1 1 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 31850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  1  0  0  0  0 -1  0  0  1  0  0 -1] (Indices: [1, 2, 4, 5, 6, 7, 9, 10, 11, 12, 13, 17, 18, 19]), Candidate: [ 3  1  0  1  1  1  1 -1  2  1  0  1  1  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 31900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  1  0 -1  1  0 -1  1 -1  1  0  0 -1] (Indices: [1, 2, 4, 5, 6, 7, 9, 10, 12, 13, 15, 17, 18, 19]), Candidate: [ 3  1  0  1  1  1  1 -1  2  1 -1  2  1  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 31950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  1 -1  0  0  1  0  0  0  0  0  0 -1] (Indices: [1, 2, 4, 5, 6, 7, 9, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  1  0  1  1  1  1 -1  2  0  0  1  2  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1  0  0  0  0  0  0 -1  1  0 -1  0  0] (Indices: [1, 2, 4, 5, 6, 8, 9, 10, 11, 12, 13, 14, 16, 17]), Candidate: [ 3  1  0  1  1  1  0  1  1  1  0  1  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1  0  0  0 -1  0  1 -1  1  0  0  0 -1] (Indices: [1, 2, 4, 5, 6, 8, 9, 10, 11, 14, 16, 17, 18, 19]), Candidate: [ 3  1  0  1  1  1  0  1  1  1  0  0  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1  0 -1  1  0 -1  0  1  0  0  0  0 -1] (Indices: [1, 2, 4, 5, 6, 8, 9, 11, 12, 15, 16, 17, 18, 19]), Candidate: [3 1 0 1 1 1 0 1 1 0 1 1 0 1 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 32150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1 -1  1 -1  1 -1  1  0  0  0  0  0 -1] (Indices: [1, 2, 4, 5, 6, 8, 10, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  1  0  1  1  1  0  1  0  2 -1  2  0  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  0  1 -1  1  0  0  0  0 -1  1  0  0 -1] (Indices: [1, 2, 4, 5, 6, 9, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [3 1 0 1 1 1 0 0 2 0 1 1 1 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 32250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0  0  0  0  0 -1  0  0  1  0  0  0 -1] (Indices: [1, 2, 4, 5, 7, 8, 9, 10, 11, 12, 16, 17, 18, 19]), Candidate: [3 1 0 1 1 0 2 0 1 1 0 1 0 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 32300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0  0 -1  1  0  0  0  0  0  0 -1  0  0] (Indices: [1, 2, 4, 5, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17]), Candidate: [3 1 0 1 1 0 2 0 1 0 1 1 1 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 32350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0 -1  1  0  0  0 -1  0  1  0  0  0 -1] (Indices: [1, 2, 4, 5, 7, 8, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [3 1 0 1 1 0 2 0 0 2 0 1 1 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 32400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  1  0  0  0 -1  1 -1  1  0  0  0 -1] (Indices: [1, 2, 4, 5, 7, 9, 10, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 3  1  0  1  1  0  2 -1  2  1  0  1  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  1  0  0  0  0  0 -1  0  1  0  0  0 -1] (Indices: [1, 2, 4, 5, 8, 9, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [3 1 0 1 1 0 1 1 1 1 0 1 1 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 32500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  0  0  1 -1  1  0  0  0  0  0  0  0  0 -1] (Indices: [1, 2, 4, 5, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [3 1 0 1 1 0 1 0 2 0 1 1 1 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 32550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0  0  0  0 -1  1 -1  1 -1  1  0  0 -1] (Indices: [1, 2, 4, 6, 7, 8, 9, 10, 11, 13, 15, 17, 18, 19]), Candidate: [3 1 0 1 0 2 1 0 1 1 0 0 2 0 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 32600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0  0 -1  1  0  0 -1  0  1  0  0  0 -1] (Indices: [1, 2, 4, 6, 7, 8, 9, 11, 12, 13, 16, 17, 18, 19]), Candidate: [3 1 0 1 0 2 1 0 1 0 1 1 1 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 32650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0 -1  1 -1  1  0  0  0  0  0  0 -1  0] (Indices: [1, 2, 4, 6, 7, 8, 10, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 3  1  0  1  0  2  1  0  0  2 -1  2  1  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0 -1  1  0 -1  1  0 -1  1  0  0  0  0 -1] (Indices: [1, 2, 4, 6, 7, 9, 10, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 3  1  0  1  0  2  1 -1  2  1 -1  2  1  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 32750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1 -1  1  0  0 -1  1  0  0  0  0  0  0 -1  0] (Indices: [1, 2, 4, 6, 8, 9, 10, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 3  1  0  1  0  2  0  1  1  1 -1  2  1  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0  0  0  0  0  0 -1  1  0 -1  1  0 -1] (Indices: [1, 2, 4, 7, 8, 9, 10, 11, 12, 13, 15, 16, 18, 19]), Candidate: [3 1 0 1 0 1 2 0 1 1 0 1 1 0 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 32850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1 -1  1  0  0 -1  1  0  0  0  0  0  0 -1] (Indices: [1, 2, 4, 7, 9, 10, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  1  0  1  0  1  2 -1  2  1  0  0  2  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 32900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0  0  0  0  0 -1  0  0  1  0  0  0 -1] (Indices: [1, 2, 5, 6, 7, 8, 9, 10, 11, 12, 16, 17, 18, 19]), Candidate: [3 1 0 0 2 1 1 0 1 1 0 1 0 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 32950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0  0 -1  1  0  0  0  0  0  0 -1  0  0] (Indices: [1, 2, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17]), Candidate: [3 1 0 0 2 1 1 0 1 0 1 1 1 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 33000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0 -1  1  0  0  0 -1  0  1  0  0  0 -1] (Indices: [1, 2, 5, 6, 7, 8, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [3 1 0 0 2 1 1 0 0 2 0 1 1 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 33050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0 -1  1  0  0  0 -1  1 -1  1  0  0  0 -1] (Indices: [1, 2, 5, 6, 7, 9, 10, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 3  1  0  0  2  1  1 -1  2  1  0  1  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 33100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  1  0  0  0  0  0 -1  0  1  0  0  0 -1] (Indices: [1, 2, 5, 6, 8, 9, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [3 1 0 0 2 1 0 1 1 1 0 1 1 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 33150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0 -1  0  1 -1  1  0  0  0  0  0  0  0  0 -1] (Indices: [1, 2, 5, 6, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [3 1 0 0 2 1 0 0 2 0 1 1 1 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 33200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1 -1  1  0 -1  1  0  0  0  0  0 -1  1  0  0 -1] (Indices: [1, 2, 5, 7, 8, 10, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [3 1 0 0 2 0 2 0 0 2 0 1 1 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 33250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0  0  0  0  0 -1  0  1  0  0  0  0 -1] (Indices: [1, 2, 6, 7, 8, 9, 10, 11, 12, 15, 16, 17, 18, 19]), Candidate: [3 1 0 0 1 2 1 0 1 1 0 1 0 1 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 33300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1 -1  1  0  0  0  0  0  0 -1  1  0  0  0 -1] (Indices: [1, 2, 6, 8, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  1  0  0  1  2  0  1  1  1  0  1  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0  0  0  0  0 -1  0  1 -1  1 -1  1 -1] (Indices: [1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 15, 17, 19]), Candidate: [3 0 2 0 1 1 1 0 1 1 0 1 0 1 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 33400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0  0  0 -1  1  0  0 -1  0  0  1  0 -1] (Indices: [1, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 18, 19]), Candidate: [ 3  0  2  0  1  1  1  0  1  1 -1  2  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 33450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0  0 -1  1  0  0  0  0 -1  0  0  1 -1] (Indices: [1, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 19]), Candidate: [3 0 2 0 1 1 1 0 1 0 1 1 1 1 0 0 1 1 2 5]
 -> Valid neighbor added.
Attempt 33500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0  0 -1  1 -1  0  1  0 -1  1  0  0 -1] (Indices: [1, 3, 4, 5, 6, 7, 8, 9, 11, 14, 15, 17, 18, 19]), Candidate: [3 0 2 0 1 1 1 0 1 0 1 0 1 2 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 33550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0 -1  1  0  0  0 -1  0  0  1  0  0 -1] (Indices: [1, 3, 4, 5, 6, 7, 8, 10, 11, 12, 13, 17, 18, 19]), Candidate: [3 0 2 0 1 1 1 0 0 2 0 1 1 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 33600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0 -1  1 -1  1  0 -1  1 -1  1  0  0 -1] (Indices: [1, 3, 4, 5, 6, 7, 8, 10, 12, 13, 15, 17, 18, 19]), Candidate: [ 3  0  2  0  1  1  1  0  0  2 -1  2  1  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0 -1  0  0  0  1  0  0  0  0  0  0 -1] (Indices: [1, 3, 4, 5, 6, 7, 8, 13, 14, 15, 16, 17, 18, 19]), Candidate: [3 0 2 0 1 1 1 0 0 1 0 1 2 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 33700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  1  0  0 -1  1 -1  0  1  0  0  0 -1] (Indices: [1, 3, 4, 5, 6, 7, 9, 10, 11, 13, 16, 17, 18, 19]), Candidate: [ 3  0  2  0  1  1  1 -1  2  1  0  0  2  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  1 -1  1  0 -1  1  0  0  0  0 -1  0] (Indices: [1, 3, 4, 5, 6, 7, 9, 11, 12, 14, 15, 16, 17, 18]), Candidate: [ 3  0  2  0  1  1  1 -1  2  0  1  1  0  2  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 33800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  0  1 -1  1  0  0  0  0  0 -1  1 -1] (Indices: [1, 3, 4, 5, 6, 7, 10, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 3  0  2  0  1  1  1 -1  1  2 -1  2  1  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 33850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1  0  0  0  0 -1  0  0  1  0  0  0 -1] (Indices: [1, 3, 4, 5, 6, 8, 9, 10, 11, 12, 16, 17, 18, 19]), Candidate: [3 0 2 0 1 1 0 1 1 1 0 1 0 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 33900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1  0 -1  1  0  0  0  0  0  0 -1  0  0] (Indices: [1, 3, 4, 5, 6, 8, 9, 11, 12, 13, 14, 15, 16, 17]), Candidate: [3 0 2 0 1 1 0 1 1 0 1 1 1 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 33950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1 -1  1  0  0  0 -1  0  1  0  0  0 -1] (Indices: [1, 3, 4, 5, 6, 8, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [3 0 2 0 1 1 0 1 0 2 0 1 1 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 34000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  0  1  0  0  0 -1  1 -1  1  0  0  0 -1] (Indices: [1, 3, 4, 5, 6, 9, 10, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 3  0  2  0  1  1  0  0  2  1  0  1  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0  0  0  0  0  0 -1  1 -1  1 -1  1 -1] (Indices: [1, 3, 4, 5, 7, 8, 9, 10, 11, 12, 13, 15, 17, 19]), Candidate: [3 0 2 0 1 0 2 0 1 1 0 1 1 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 34100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0  0  0 -1  1  0  0 -1  1 -1  1  0 -1] (Indices: [1, 3, 4, 5, 7, 8, 9, 10, 12, 13, 14, 16, 18, 19]), Candidate: [ 3  0  2  0  1  0  2  0  1  1 -1  2  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0  0 -1  0  1  0  0  0  0 -1  1  0 -1] (Indices: [1, 3, 4, 5, 7, 8, 9, 12, 13, 14, 15, 16, 18, 19]), Candidate: [3 0 2 0 1 0 2 0 1 0 0 2 1 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 34200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0 -1  0  0  1  0  0  0  0  0  0  0 -1] (Indices: [1, 3, 4, 5, 7, 8, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [3 0 2 0 1 0 2 0 0 1 0 2 1 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 34250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  0  1  0  0  0  0 -1  1  0  0  0 -1] (Indices: [1, 3, 4, 5, 7, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  0  2  0  1  0  2 -1  1  2  0  1  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 34300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  0  1  0 -1  0  1  0  0  0  0  0  0  0 -1] (Indices: [1, 3, 4, 5, 8, 9, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [3 0 2 0 1 0 1 1 1 0 0 2 1 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 34350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0  0  0  0  0 -1  1 -1  1 -1  1  0 -1] (Indices: [1, 3, 4, 6, 7, 8, 9, 10, 11, 12, 14, 16, 18, 19]), Candidate: [ 3  0  2  0  0  2  1  0  1  1  0  1  0  2 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0  0  0 -1  0  1  0  0  0  0 -1  1 -1] (Indices: [1, 3, 4, 6, 7, 8, 9, 10, 13, 14, 15, 16, 17, 19]), Candidate: [ 3  0  2  0  0  2  1  0  1  1 -1  1  2  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0 -1  1  0  0  0  0 -1  1 -1  1  0 -1] (Indices: [1, 3, 4, 6, 7, 8, 10, 11, 12, 13, 14, 16, 18, 19]), Candidate: [ 3  0  2  0  0  2  1  0  0  2  0  1  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0 -1  1  0  0  0  0 -1  1 -1  1  0  0 -1] (Indices: [1, 3, 4, 6, 7, 9, 10, 11, 12, 13, 15, 17, 18, 19]), Candidate: [ 3  0  2  0  0  2  1 -1  2  1  0  1  1  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  1  0  0  0  0  0  0 -1  1 -1  1  0 -1] (Indices: [1, 3, 4, 6, 8, 9, 10, 11, 12, 13, 14, 16, 18, 19]), Candidate: [ 3  0  2  0  0  2  0  1  1  1  0  1  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  1  0  0  0  0  0  0 -1  1  0  0 -1] (Indices: [1, 3, 4, 6, 9, 10, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [3 0 2 0 0 2 0 0 2 1 0 1 1 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 34650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  0  1  0  0 -1  1  0 -1  1  0  0  0  0  0 -1] (Indices: [1, 3, 4, 7, 8, 9, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [3 0 2 0 0 1 2 0 1 0 1 1 0 2 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 34700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0  0  0  0  0  0 -1  1 -1  1 -1  1 -1] (Indices: [1, 3, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 17, 19]), Candidate: [ 3  0  2 -1  2  1  1  0  1  1  0  1  1  0  1  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0  0  0 -1  1  0  0 -1  1 -1  1  0 -1] (Indices: [1, 3, 5, 6, 7, 8, 9, 10, 12, 13, 14, 16, 18, 19]), Candidate: [ 3  0  2 -1  2  1  1  0  1  1 -1  2  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 34800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0  0 -1  0  1  0  0  0  0 -1  1  0 -1] (Indices: [1, 3, 5, 6, 7, 8, 9, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 3  0  2 -1  2  1  1  0  1  0  0  2  1  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0 -1  0  0  1  0  0  0  0  0  0  0 -1] (Indices: [1, 3, 5, 6, 7, 8, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  2  1  1  0  0  1  0  2  1  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 34900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0 -1  0  1  0  0  0  0 -1  1  0  0  0 -1] (Indices: [1, 3, 5, 6, 7, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  2  1  1 -1  1  2  0  1  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 34950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0 -1  1  0 -1  0  1  0  0  0  0  0  0  0 -1] (Indices: [1, 3, 5, 6, 8, 9, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  2  1  0  1  1  0  0  2  1  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0  0  0 -1  1  0  0  0  0  0  0 -1  0] (Indices: [1, 3, 5, 7, 8, 9, 10, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 3  0  2 -1  2  0  2  0  1  1 -1  2  1  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0  0  0  0  0  0  0  0  0  0 -1  0  0] (Indices: [1, 3, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17]), Candidate: [ 3  0  2 -1  1  2  1  0  1  1  0  1  1  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  0  1  0  0 -1  1  0  0  0 -1  1  0  0  0  0 -1] (Indices: [1, 3, 6, 7, 8, 10, 11, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  1  2  1  0  0  2  0  1  1  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0  0  0  0  0  0  0 -1  0  0  1  0 -1] (Indices: [1, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 18, 19]), Candidate: [ 3  0  1  1  1  1  1  0  1  1  0  1  1  1 -1  1  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0  0  0 -1  1  0  0  0 -1  1  0 -1  0] (Indices: [1, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 17, 18]), Candidate: [ 3  0  1  1  1  1  1  0  1  1 -1  2  1  1  0  0  2  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0  0 -1  1 -1  1  0 -1  1  0  0  0 -1] (Indices: [1, 4, 5, 6, 7, 8, 9, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  0  1  1  1  1  1  0  1  0  1  0  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0 -1  0  1  0  0  0  0 -1  1  0  0 -1] (Indices: [1, 4, 5, 6, 7, 8, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [3 0 1 1 1 1 1 0 0 1 1 1 1 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 35350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0 -1  1 -1  0  1  0  0  0  0  0  0  0 -1] (Indices: [1, 4, 5, 6, 7, 9, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  0  1  1  1  1  1 -1  2  0  0  2  1  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 35400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0 -1  1  0 -1  1  0  0  0  0 -1  1  0  0 -1] (Indices: [1, 4, 5, 6, 8, 9, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [3 0 1 1 1 1 0 1 1 0 1 1 1 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 35450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0  0  0  0 -1  1  0  0  0 -1  1  0 -1] (Indices: [1, 4, 5, 7, 8, 9, 10, 11, 13, 14, 15, 16, 18, 19]), Candidate: [3 0 1 1 1 0 2 0 1 1 0 0 2 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 35500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  0  1  0  0  0 -1  1  0  0  0  0  0  0 -1] (Indices: [1, 4, 5, 8, 9, 10, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [3 0 1 1 1 0 1 1 1 1 0 0 2 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 35550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1 -1  1  0  0 -1  1  0  0  0  0  0  0  0  0 -1  0] (Indices: [1, 4, 6, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [3 0 1 1 0 2 1 0 0 2 0 1 1 1 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 35600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0  0  0  0  0  0  0  0 -1  1 -1  1 -1] (Indices: [1, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 19]), Candidate: [3 0 1 0 2 1 1 0 1 1 0 1 1 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 35650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  1  0  0  0 -1  0  1  0  0  0  0  0  0  0  0 -1] (Indices: [1, 5, 6, 7, 8, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [3 0 1 0 2 1 1 0 0 1 1 1 1 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 35700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 -1] (Indices: [1, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [3 0 1 0 1 1 2 0 1 1 0 1 1 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 35750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0  0  0  0 -1  1 -1  1 -1  1 -1  1 -1] (Indices: [2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19]), Candidate: [2 2 1 0 1 1 1 0 1 1 0 0 2 0 1 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 35800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0  0  0 -1  1 -1  1 -1  0  1  0  0 -1] (Indices: [2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 17, 18, 19]), Candidate: [ 2  2  1  0  1  1  1  0  1  1 -1  2  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 35850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0  0 -1  1  0 -1  1  0 -1  1  0 -1  0] (Indices: [2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 14, 15, 17, 18]), Candidate: [2 2 1 0 1 1 1 0 1 0 1 1 0 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 35900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0  0 -1  0  1 -1  1  0  0 -1  1  0 -1] (Indices: [2, 3, 4, 5, 6, 7, 8, 9, 12, 14, 15, 16, 18, 19]), Candidate: [2 2 1 0 1 1 1 0 1 0 0 2 0 2 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 35950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0 -1  1  0 -1  1  0  0 -1  1 -1  1 -1] (Indices: [2, 3, 4, 5, 6, 7, 8, 10, 11, 13, 14, 15, 17, 19]), Candidate: [2 2 1 0 1 1 1 0 0 2 0 0 2 1 0 0 2 0 2 5]
 -> Valid neighbor added.
Attempt 36000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0 -1  0  1  0  0  0  0 -1  0  1  0 -1] (Indices: [2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 15, 18, 19]), Candidate: [2 2 1 0 1 1 1 0 0 1 1 1 1 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 36050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  1  0  0  0  0 -1  0  0  1  0  0 -1] (Indices: [2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 17, 18, 19]), Candidate: [ 2  2  1  0  1  1  1 -1  2  1  0  1  1  0  0  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  1  0 -1  1  0 -1  1 -1  1  0  0 -1] (Indices: [2, 3, 4, 5, 6, 7, 9, 10, 12, 13, 15, 17, 18, 19]), Candidate: [ 2  2  1  0  1  1  1 -1  2  1 -1  2  1  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  1 -1  0  0  1  0  0  0  0  0  0 -1] (Indices: [2, 3, 4, 5, 6, 7, 9, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  2  1  0  1  1  1 -1  2  0  0  1  2  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1  0  0  0  0  0  0 -1  1  0 -1  0  0] (Indices: [2, 3, 4, 5, 6, 8, 9, 10, 11, 12, 13, 14, 16, 17]), Candidate: [ 2  2  1  0  1  1  0  1  1  1  0  1  1  1 -1  2  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1  0  0  0 -1  0  1 -1  1  0  0  0 -1] (Indices: [2, 3, 4, 5, 6, 8, 9, 10, 11, 14, 16, 17, 18, 19]), Candidate: [ 2  2  1  0  1  1  0  1  1  1  0  0  1  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1  0 -1  1  0 -1  0  1  0  0  0  0 -1] (Indices: [2, 3, 4, 5, 6, 8, 9, 11, 12, 15, 16, 17, 18, 19]), Candidate: [2 2 1 0 1 1 0 1 1 0 1 1 0 1 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 36350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1 -1  1 -1  1 -1  1  0  0  0  0  0 -1] (Indices: [2, 3, 4, 5, 6, 8, 10, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  2  1  0  1  1  0  1  0  2 -1  2  0  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  0  1 -1  1  0  0  0  0 -1  1  0  0 -1] (Indices: [2, 3, 4, 5, 6, 9, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [2 2 1 0 1 1 0 0 2 0 1 1 1 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 36450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0  0  0  0  0 -1  0  0  1  0  0  0 -1] (Indices: [2, 3, 4, 5, 7, 8, 9, 10, 11, 12, 16, 17, 18, 19]), Candidate: [2 2 1 0 1 0 2 0 1 1 0 1 0 1 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 36500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0  0 -1  1  0  0  0  0  0  0 -1  0  0] (Indices: [2, 3, 4, 5, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17]), Candidate: [2 2 1 0 1 0 2 0 1 0 1 1 1 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 36550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0 -1  1  0  0  0 -1  0  1  0  0  0 -1] (Indices: [2, 3, 4, 5, 7, 8, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [2 2 1 0 1 0 2 0 0 2 0 1 1 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 36600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1 -1  1  0  0  0 -1  1 -1  1  0  0  0 -1] (Indices: [2, 3, 4, 5, 7, 9, 10, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  2  1  0  1  0  2 -1  2  1  0  1  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1  0  0  0  0  0 -1  0  1  0  0  0 -1] (Indices: [2, 3, 4, 5, 8, 9, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [2 2 1 0 1 0 1 1 1 1 0 1 1 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 36700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  0  1 -1  1  0  0  0  0  0  0  0  0 -1] (Indices: [2, 3, 4, 5, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 2 1 0 1 0 1 0 2 0 1 1 1 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 36750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0  0  0  0 -1  1 -1  1 -1  1  0  0 -1] (Indices: [2, 3, 4, 6, 7, 8, 9, 10, 11, 13, 15, 17, 18, 19]), Candidate: [2 2 1 0 0 2 1 0 1 1 0 0 2 0 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 36800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0  0 -1  1  0  0 -1  0  1  0  0  0 -1] (Indices: [2, 3, 4, 6, 7, 8, 9, 11, 12, 13, 16, 17, 18, 19]), Candidate: [2 2 1 0 0 2 1 0 1 0 1 1 1 0 0 2 1 1 1 5]
 -> Valid neighbor added.
Attempt 36850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0 -1  1 -1  1  0  0  0  0  0  0 -1  0] (Indices: [2, 3, 4, 6, 7, 8, 10, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  2  1  0  0  2  1  0  0  2 -1  2  1  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 36900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0 -1  1  0 -1  1  0 -1  1  0  0  0  0 -1] (Indices: [2, 3, 4, 6, 7, 9, 10, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  2  1  0  0  2  1 -1  2  1 -1  2  1  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 36950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1 -1  1  0  0 -1  1  0  0  0  0  0  0 -1  0] (Indices: [2, 3, 4, 6, 8, 9, 10, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  2  1  0  0  2  0  1  1  1 -1  2  1  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1  0  0  0  0  0  0 -1  1  0 -1  1  0 -1] (Indices: [2, 3, 4, 7, 8, 9, 10, 11, 12, 13, 15, 16, 18, 19]), Candidate: [2 2 1 0 0 1 2 0 1 1 0 1 1 0 1 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 37050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  0  1 -1  1  0  0 -1  1  0  0  0  0  0  0 -1] (Indices: [2, 3, 4, 7, 9, 10, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  2  1  0  0  1  2 -1  2  1  0  0  2  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0  0  0  0  0 -1  0  0  1  0  0  0 -1] (Indices: [2, 3, 5, 6, 7, 8, 9, 10, 11, 12, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  1  1  0  1  1  0  1  0  1  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0  0 -1  1  0  0  0  0  0  0 -1  0  0] (Indices: [2, 3, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17]), Candidate: [ 2  2  1 -1  2  1  1  0  1  0  1  1  1  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0 -1  1  0  0  0 -1  0  1  0  0  0 -1] (Indices: [2, 3, 5, 6, 7, 8, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  1  1  0  0  2  0  1  1  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  1  0  0  0 -1  1 -1  1  0  0  0 -1] (Indices: [2, 3, 5, 6, 7, 9, 10, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  1  1 -1  2  1  0  1  0  2 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 37300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  1  0  0  0  0  0 -1  0  1  0  0  0 -1] (Indices: [2, 3, 5, 6, 8, 9, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  1  0  1  1  1  0  1  1  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0 -1  0  1 -1  1  0  0  0  0  0  0  0  0 -1] (Indices: [2, 3, 5, 6, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  1  0  0  2  0  1  1  1  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1 -1  1  0 -1  1  0  0  0  0  0 -1  1  0  0 -1] (Indices: [2, 3, 5, 7, 8, 10, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  2  1 -1  2  0  2  0  0  2  0  1  1  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1  0  0  0  0  0  0 -1  0  1  0  0  0  0 -1] (Indices: [2, 3, 6, 7, 8, 9, 10, 11, 12, 15, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  1  2  1  0  1  1  0  1  0  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  0  1 -1  1  0  0  0  0  0  0 -1  1  0  0  0 -1] (Indices: [2, 3, 6, 8, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  2  1 -1  1  2  0  1  1  1  0  1  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 37550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0  0  0  0  0 -1  1 -1  0  1  0  0 -1] (Indices: [2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 17, 18, 19]), Candidate: [ 2  2  0  1  1  1  1  0  1  1  0  1  0  2 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0  0  0 -1  0  1  0  0  0 -1  1  0 -1] (Indices: [2, 4, 5, 6, 7, 8, 9, 10, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  2  0  1  1  1  1  0  1  1 -1  1  2  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0 -1  1  0  0  0  0 -1  0  1  0  0 -1] (Indices: [2, 4, 5, 6, 7, 8, 10, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  2  0  1  1  1  1  0  0  2  0  1  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0 -1  1  0  0  0  0 -1  0  1  0  0  0 -1] (Indices: [2, 4, 5, 6, 7, 9, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [ 2  2  0  1  1  1  1 -1  2  1  0  1  1  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  1  0  0  0  0  0  0 -1  0  1  0  0 -1] (Indices: [2, 4, 5, 6, 8, 9, 10, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  2  0  1  1  1  0  1  1  1  0  1  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0 -1  0  1  0  0  0  0  0 -1  1  0  0  0 -1] (Indices: [2, 4, 5, 6, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  2  0  1  1  1  0  0  2  1  0  1  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 37850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0 -1  1  0  0 -1  1 -1  1  0  0  0  0  0  0 -1] (Indices: [2, 4, 5, 7, 8, 9, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 2 0 1 1 0 2 0 1 0 1 0 2 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 37900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0  0  0  0  0 -1  1  0  0  0  0 -1  0] (Indices: [2, 4, 6, 7, 8, 9, 10, 11, 12, 14, 15, 16, 17, 18]), Candidate: [2 2 0 1 0 2 1 0 1 1 0 1 0 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 37950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0 -1  0  1  0  0  0  0  0  0  0  0  0 -1] (Indices: [2, 4, 6, 7, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  2  0  1  0  2  1 -1  1  2  0  1  1  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0  0  0  0  0  0 -1  1  0  0 -1  1  0  0 -1] (Indices: [2, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15, 17, 18, 19]), Candidate: [2 2 0 0 2 1 1 0 1 1 0 0 2 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 38050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  0  1  0 -1  1  0  0 -1  1  0  0  0  0  0  0  0 -1] (Indices: [2, 5, 6, 8, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  2  0  0  2  1  0  1  1  1 -1  2  1  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0  0  0  0  0  0 -1  0  0  1  0  0 -1] (Indices: [3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 17, 18, 19]), Candidate: [2 1 2 0 1 1 1 0 1 1 0 1 1 0 0 1 2 1 1 5]
 -> Valid neighbor added.
Attempt 38150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0  0  0 -1  1  0 -1  1 -1  1  0  0 -1] (Indices: [3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 15, 17, 18, 19]), Candidate: [ 2  1  2  0  1  1  1  0  1  1 -1  2  1  0  1  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0  0 -1  0  0  1  0  0  0  0  0  0 -1] (Indices: [3, 4, 5, 6, 7, 8, 9, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 1 2 0 1 1 1 0 1 0 0 1 2 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 38250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  1  0  0  0  0  0  0 -1  1 -1  1 -1] (Indices: [3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 17, 19]), Candidate: [ 2  1  2  0  1  1  1 -1  2  1  0  1  1  1  0  0  2  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0 -1  0  0  1  0  0  0  0  0  0  0  0 -1] (Indices: [3, 4, 5, 6, 7, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  2  0  1  1  1 -1  1  1  1  1  1  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0 -1  1 -1  1  0  0  0  0 -1  1  0  0  0 -1] (Indices: [3, 4, 5, 6, 8, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  2  0  1  1  0  1  0  2  0  1  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0  0  0 -1  1  0 -1  1  0  0  0  0 -1] (Indices: [3, 4, 5, 7, 8, 9, 10, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  1  2  0  1  0  2  0  1  1 -1  2  1  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0  0  0  0  0  0  0  0  0 -1  0  1  0 -1] (Indices: [3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 18, 19]), Candidate: [2 1 2 0 0 2 1 0 1 1 0 1 1 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 38500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0 -1  1  0 -1  1  0  0  0  0  0  0  0  0  0 -1  0] (Indices: [3, 4, 6, 7, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  1  2  0  0  2  1 -1  2  1  0  1  1  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0  0  0  0  0  0  0 -1  0  1  0  0  0 -1] (Indices: [3, 5, 6, 7, 8, 9, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  1  1  0  1  1  0  1  1  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1 -1  1  0  0 -1  1 -1  1  0  0  0  0  0  0  0  0 -1] (Indices: [3, 5, 6, 7, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  2 -1  2  1  1 -1  2  0  1  1  1  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0  0  0  0  0  0  0  0 -1  0  1  0  0 -1] (Indices: [4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  1  1  1  1  1  1  0  1  1  0  1  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 38700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  1  0  0  0  0  0 -1  1  0  0  0 -1] (Indices: [4, 5, 6, 7, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  1  1  1  1 -1  2  1  0  1  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 38750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  1  0  0  0  0  0  0  0  0  0 -1  1  0  0  0 -1] (Indices: [5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  2  1  1  0  1  1  0  1  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Finished generating neighbors. Total valid neighbors found: 14018
  Size of neighborhood t=14: 14018
  Using 'fork' start method for multiprocessing.
  No improvement found for t=14 after processing 14018 neighbors.
No improving solution found or error occurred for t=14.

Attempting neighborhood t=15 (current best cost: 98.4663)
  Exploring neighborhood t=15 in parallel (current cost: 98.4663)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Attempt 50: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0  0  0 -1  0  0  1 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 15, 17, 18]), Candidate: [2 1 1 0 1 1 1 0 1 1 0 0 1 1 1 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0  0 -1  0  1  0 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 13, 14, 17, 19]), Candidate: [ 2  1  1  0  1  1  1  0  1  1 -1  1  2  1 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0 -1  1  0 -1  1 -1  0  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 14, 17, 19]), Candidate: [ 2  1  1  0  1  1  1  0  1  0  1  1  0  2 -1  1  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0 -1  0  1  0  0  0 -1  0  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 12, 13, 14, 15, 19]), Candidate: [2 1 1 0 1 1 1 0 1 0 0 2 1 1 0 0 1 1 2 6]
 -> Valid neighbor added.
Attempt 250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0 -1  0  0  0  1  0 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 14, 15, 17, 18, 19]), Candidate: [2 1 1 0 1 1 1 0 1 0 0 1 1 2 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0 -1  1  0 -1  1 -1  1  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 13, 15, 16, 19]), Candidate: [2 1 1 0 1 1 1 0 0 2 0 0 2 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0 -1  1 -1  1 -1  1 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 17, 19]), Candidate: [ 2  1  1  0  1  1  1  0  0  2 -1  2  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0 -1  0  1  0 -1  1  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 14, 15, 16, 18]), Candidate: [2 1 1 0 1 1 1 0 0 1 1 1 0 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0 -1  0  0  1 -1  1  0  0  0  0 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 12, 14, 15, 16, 17, 18]), Candidate: [2 1 1 0 1 1 1 0 0 1 0 2 0 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  1  0  0 -1  1  0  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 18]), Candidate: [ 2  1  1  0  1  1  1 -1  2  1  0  0  2  1  0  0  1  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  1  0 -1  1  0 -1  0  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 12, 13, 16, 17, 19]), Candidate: [ 2  1  1  0  1  1  1 -1  2  1 -1  2  1  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  1 -1  1  0  0 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 9, 11, 12, 13, 15, 16, 18]), Candidate: [ 2  1  1  0  1  1  1 -1  2  0  1  1  1  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  1 -1  0  1  0  0  0 -1  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 9, 12, 13, 14, 15, 18, 19]), Candidate: [ 2  1  1  0  1  1  1 -1  2  0  0  2  1  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  0  1  0  0 -1  1 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 14, 16, 17, 19]), Candidate: [ 2  1  1  0  1  1  1 -1  1  2  0  1  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  0  1 -1  0  1  0  0  0  0  0 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 10, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  1  1  0  1  1  1 -1  1  2 -1  1  2  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1  0  0  0  0  0 -1  1 -1  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 9, 10, 11, 12, 13, 15, 18]), Candidate: [2 1 1 0 1 1 0 1 1 1 0 1 1 0 1 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1  0  0  0 -1  0  1  0  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 9, 10, 11, 14, 15, 16, 19]), Candidate: [2 1 1 0 1 1 0 1 1 1 0 0 1 2 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1  0  0 -1  0  1  0  0  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 9, 10, 13, 14, 15, 16, 19]), Candidate: [ 2  1  1  0  1  1  0  1  1  1 -1  1  2  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1  0 -1  1  0 -1  0  1  0  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 9, 11, 12, 15, 16, 17, 19]), Candidate: [2 1 1 0 1 1 0 1 1 0 1 1 0 1 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 1000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1  0 -1  0  0  1  0 -1  1  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 9, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  1  1  0  1  1  0  0  1  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1 -1  1  0 -1  1 -1  1  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 10, 11, 13, 15, 16, 18, 19]), Candidate: [2 1 1 0 1 1 0 1 0 2 0 0 2 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 1100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1 -1  0  1  0  0 -1  1 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 11, 12, 13, 15, 17, 18, 19]), Candidate: [2 1 1 0 1 1 0 1 0 1 1 1 1 0 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 1150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  1  0  0  0 -1  1 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 9, 10, 11, 12, 14, 16, 17, 19]), Candidate: [ 2  1  1  0  1  1  0  0  2  1  0  1  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  1  0 -1  0  1  0  0  0  0  0 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 9, 10, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  1  1  0  1  1  0  0  2  1 -1  1  2  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  0  1  0  0  0  0 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 10, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  1  1  0  1  1  0  0  1  2  0  1  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0  0  0  0  0  0 -1  0  0  1  0 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 12, 13, 17, 18]), Candidate: [2 1 1 0 1 0 2 0 1 1 0 1 1 0 0 1 2 1 0 7]
 -> Valid neighbor added.
Attempt 1350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0  0  0  0 -1  0  1 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 14, 16, 17, 19]), Candidate: [ 2  1  1  0  1  0  2  0  1  1  0  0  1  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0  0  0 -1  0  1  0 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 9, 10, 13, 14, 16, 17, 19]), Candidate: [ 2  1  1  0  1  0  2  0  1  1 -1  1  2  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0  0 -1  1 -1  1  0  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 9, 11, 13, 14, 15, 16, 18]), Candidate: [2 1 1 0 1 0 2 0 1 0 1 0 2 1 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 1500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0 -1  1  0  0  0  0  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 10, 11, 12, 13, 14, 15, 18]), Candidate: [2 1 1 0 1 0 2 0 0 2 0 1 1 1 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 1550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0 -1  1  0 -1  0  1  0  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 10, 11, 14, 15, 16, 18, 19]), Candidate: [2 1 1 0 1 0 2 0 0 2 0 0 1 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 1600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0 -1  0  1  0 -1  1  0 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 11, 12, 14, 15, 17, 18, 19]), Candidate: [2 1 1 0 1 0 2 0 0 1 1 1 0 2 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 1650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  1  0  0  0 -1  0  1  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 9, 10, 11, 12, 15, 16, 18, 19]), Candidate: [ 2  1  1  0  1  0  2 -1  2  1  0  1  0  1  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  1  0 -1  0  1 -1  1  0  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 9, 10, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  1  0  2 -1  2  1 -1  1  2  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  0  1  0  0  0 -1  1  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 10, 11, 12, 13, 15, 16, 18, 19]), Candidate: [ 2  1  1  0  1  0  2 -1  1  2  0  1  1  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1  0  0  0  0  0 -1  0  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 8, 9, 10, 11, 12, 13, 16, 17, 19]), Candidate: [2 1 1 0 1 0 1 1 1 1 0 1 1 0 0 2 1 0 2 6]
 -> Valid neighbor added.
Attempt 1850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1  0  0 -1  1  0 -1  1  0  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 8, 9, 10, 12, 13, 15, 16, 17, 19]), Candidate: [ 2  1  1  0  1  0  1  1  1  1 -1  2  1  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1  0 -1  0  1  0 -1  1  0  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 8, 9, 12, 13, 15, 16, 17, 18, 19]), Candidate: [2 1 1 0 1 0 1 1 1 0 0 2 1 0 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 1950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  1  0  0  0  0  0  0  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 5, 9, 10, 11, 12, 13, 14, 15, 16, 19]), Candidate: [2 1 1 0 1 0 1 0 2 1 0 1 1 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 2000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  0  1  0 -1  1  0  0  0  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 10, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 1 1 0 1 0 1 0 1 2 0 0 2 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 2050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0  0  0  0 -1  1 -1  1  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 13, 15, 16, 19]), Candidate: [2 1 1 0 0 2 1 0 1 1 0 0 2 0 1 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 2100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0  0  0 -1  1 -1  1 -1  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 9, 10, 12, 14, 16, 17, 19]), Candidate: [ 2  1  1  0  0  2  1  0  1  1 -1  2  0  2 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0  0 -1  1  0 -1  1  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 9, 11, 12, 14, 15, 16, 18]), Candidate: [2 1 1 0 0 2 1 0 1 0 1 1 0 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 2200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0  0 -1  0  1 -1  1  0  0  0  0 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 9, 12, 14, 15, 16, 17, 18]), Candidate: [2 1 1 0 0 2 1 0 1 0 0 2 0 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 2250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0 -1  1  0 -1  1  0  0  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 10, 11, 13, 14, 15, 16, 19]), Candidate: [2 1 1 0 0 2 1 0 0 2 0 0 2 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 2300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0 -1  0  1  0  0  0  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 11, 12, 13, 14, 15, 17, 18]), Candidate: [2 1 1 0 0 2 1 0 0 1 1 1 1 1 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 2350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  1  0  0  0  0 -1  0  1  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 9, 10, 11, 12, 13, 16, 17, 19]), Candidate: [ 2  1  1  0  0  2  1 -1  2  1  0  1  1  0  0  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  1  0 -1  1  0 -1  1  0  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 9, 10, 12, 13, 15, 16, 17, 19]), Candidate: [ 2  1  1  0  0  2  1 -1  2  1 -1  2  1  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  1 -1  0  1  0 -1  1  0  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 9, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  0  2  1 -1  2  0  0  2  1  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1  0  0  0  0  0  0  0 -1  0  1 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 8, 9, 10, 11, 12, 13, 14, 15, 18]), Candidate: [2 1 1 0 0 2 0 1 1 1 0 1 1 1 0 0 1 2 0 7]
 -> Valid neighbor added.
Attempt 2550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1  0  0  0 -1  0  1  0  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 6, 8, 9, 10, 11, 14, 15, 16, 18, 19]), Candidate: [2 1 1 0 0 2 0 1 1 1 0 0 1 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 2600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1  0 -1  1  0 -1  1  0 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 6, 8, 9, 11, 12, 14, 15, 17, 18, 19]), Candidate: [2 1 1 0 0 2 0 1 1 0 1 1 0 2 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 2650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1 -1  1 -1  1  0  0 -1  1  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 6, 8, 10, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  0  2  0  1  0  2 -1  2  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  0  1 -1  1  0  0  0  0  0  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 6, 9, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [2 1 1 0 0 2 0 0 2 0 1 1 1 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 2750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0  0  0  0  0 -1  0  1  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 7, 8, 9, 10, 11, 12, 15, 16, 18, 19]), Candidate: [2 1 1 0 0 1 2 0 1 1 0 1 0 1 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 2800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0  0  0 -1  0  1 -1  1  0  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 7, 8, 9, 10, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  0  1  2  0  1  1 -1  1  2  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0 -1  1  0  0  0 -1  1  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 7, 8, 10, 11, 12, 13, 15, 16, 18, 19]), Candidate: [2 1 1 0 0 1 2 0 0 2 0 1 1 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 2900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  1  0  0  0 -1  1  0  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 7, 9, 10, 11, 12, 14, 15, 16, 18, 19]), Candidate: [ 2  1  1  0  0  1  2 -1  2  1  0  1  0  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  1  0  0  0  0  0 -1  1  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 8, 9, 10, 11, 12, 13, 15, 16, 18, 19]), Candidate: [2 1 1 0 0 1 1 1 1 1 0 1 1 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 3000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  0  0  1  0  0 -1  1  0  0  0  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 9, 10, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 1 1 0 0 1 1 0 2 1 0 0 2 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 3050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0  0  0  0 -1  1 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 9, 10, 11, 13, 15, 16, 18]), Candidate: [ 2  1  1 -1  2  1  1  0  1  1  0  0  2  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0  0  0 -1  1 -1  1 -1  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 9, 10, 12, 14, 16, 17, 18]), Candidate: [ 2  1  1 -1  2  1  1  0  1  1 -1  2  0  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 3150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0  0 -1  1  0 -1  1  0  0  0 -1  0  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 9, 11, 12, 14, 15, 16, 17]), Candidate: [ 2  1  1 -1  2  1  1  0  1  0  1  1  0  2  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0  0 -1  0  1  0 -1  0  1  0  0  0  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 9, 12, 13, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  1  1  0  1  0  0  2  1  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0 -1  1  0 -1  1  0  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 10, 11, 13, 14, 15, 16, 18]), Candidate: [ 2  1  1 -1  2  1  1  0  0  2  0  0  2  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0 -1  0  1  0  0  0  0  0 -1  0  1  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 11, 12, 13, 14, 15, 16, 19]), Candidate: [ 2  1  1 -1  2  1  1  0  0  1  1  1  1  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  1  0  0  0  0 -1  0  1  0  0 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 9, 10, 11, 12, 13, 16, 17, 18]), Candidate: [ 2  1  1 -1  2  1  1 -1  2  1  0  1  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  1  0 -1  1  0 -1  1  0  0  0 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 9, 10, 12, 13, 15, 16, 17, 18]), Candidate: [ 2  1  1 -1  2  1  1 -1  2  1 -1  2  1  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 3450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  1 -1  0  1  0  0 -1  1  0  0  0  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 9, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  1  1 -1  2  0  0  2  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 3500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1  0  0  0  0  0  0  0 -1  1 -1  0  1] (Indices: [0, 1, 2, 3, 5, 6, 8, 9, 10, 11, 12, 13, 14, 15, 17]), Candidate: [ 2  1  1 -1  2  1  0  1  1  1  0  1  1  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1  0  0  0 -1  0  1  0  0  0 -1  1  0] (Indices: [0, 1, 2, 3, 5, 6, 8, 9, 10, 11, 14, 15, 16, 17, 19]), Candidate: [ 2  1  1 -1  2  1  0  1  1  1  0  0  1  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1  0 -1  1  0 -1  1  0  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 5, 6, 8, 9, 11, 12, 14, 15, 16, 18, 19]), Candidate: [ 2  1  1 -1  2  1  0  1  1  0  1  1  0  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1 -1  1 -1  1  0  0  0 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 5, 6, 8, 10, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  1  0  1  0  2 -1  2  1  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  1 -1  1  0  0  0  0  0  0  0 -1  1] (Indices: [0, 1, 2, 3, 5, 6, 9, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  1  1 -1  2  1  0  0  2  0  1  1  1  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0  0  0  0  0 -1  0  1  0  0 -1  1  0] (Indices: [0, 1, 2, 3, 5, 7, 8, 9, 10, 11, 12, 15, 16, 17, 19]), Candidate: [ 2  1  1 -1  2  0  2  0  1  1  0  1  0  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0  0  0 -1  0  1  0 -1  1  0  0  0  0] (Indices: [0, 1, 2, 3, 5, 7, 8, 9, 10, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  0  2  0  1  1 -1  1  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 3850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0 -1  1  0  0  0 -1  1  0  0 -1  1  0] (Indices: [0, 1, 2, 3, 5, 7, 8, 10, 11, 12, 13, 15, 16, 17, 19]), Candidate: [ 2  1  1 -1  2  0  2  0  0  2  0  1  1  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1 -1  1  0  0  0 -1  1  0  0  0 -1  1  0] (Indices: [0, 1, 2, 3, 5, 7, 9, 10, 11, 12, 14, 15, 16, 17, 19]), Candidate: [ 2  1  1 -1  2  0  2 -1  2  1  0  1  0  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  1  0  0  0  0  0 -1  1  0  0 -1  1  0] (Indices: [0, 1, 2, 3, 5, 8, 9, 10, 11, 12, 13, 15, 16, 17, 19]), Candidate: [ 2  1  1 -1  2  0  1  1  1  1  0  1  1  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  0  0  1  0  0  0 -1  1  0  0  0  0  0  0] (Indices: [0, 1, 2, 3, 5, 9, 10, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  0  1  0  2  1  0  1  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0  0  0  0 -1  1 -1  1  0  0  0 -1  1] (Indices: [0, 1, 2, 3, 6, 7, 8, 9, 10, 11, 13, 15, 16, 17, 18]), Candidate: [ 2  1  1 -1  1  2  1  0  1  1  0  0  2  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0  0 -1  1  0  0 -1  1  0  0 -1  1  0] (Indices: [0, 1, 2, 3, 6, 7, 8, 9, 11, 12, 13, 15, 16, 17, 19]), Candidate: [ 2  1  1 -1  1  2  1  0  1  0  1  1  1  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0 -1  1  0 -1  1  0 -1  1  0  0  0  0] (Indices: [0, 1, 2, 3, 6, 7, 8, 10, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  2  1  0  0  2  0  0  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0 -1  1  0 -1  1  0  0  0  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 6, 7, 9, 10, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  1  1 -1  1  2  1 -1  2  1 -1  2  1  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 4250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1  0  0  0 -1  1  0 -1  1  0  0  0  0] (Indices: [0, 1, 2, 3, 6, 8, 9, 10, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  2  0  1  1  1  0  0  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1  0  0  0  0  0  0  0 -1  0  1  0  0  0] (Indices: [0, 1, 2, 3, 7, 8, 9, 10, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  1  2  0  1  1  0  1  1  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  0  1 -1  1  0  0  0  0  0 -1  1  0  0  0  0] (Indices: [0, 1, 2, 3, 7, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  1  2 -1  2  1  0  1  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 4400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0  0  0  0  0 -1  0  0  1  0  0 -1  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 16, 17, 18]), Candidate: [2 1 0 1 1 1 1 0 1 1 0 1 0 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 4450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0  0  0 -1  1  0 -1  1  0 -1  1 -1  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 9, 10, 12, 13, 15, 16, 18]), Candidate: [ 2  1  0  1  1  1  1  0  1  1 -1  2  1  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0  0 -1  1  0  0  0 -1  1 -1  1 -1  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 16, 18]), Candidate: [ 2  1  0  1  1  1  1  0  1  0  1  1  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0  0 -1  1 -1  0  0  1  0  0  0  0  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 9, 11, 15, 16, 17, 18, 19]), Candidate: [2 1 0 1 1 1 1 0 1 0 1 0 1 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 4600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0 -1  1  0  0 -1  1  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 10, 11, 12, 14, 15, 16, 18]), Candidate: [2 1 0 1 1 1 1 0 0 2 0 1 0 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 4650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0 -1  1 -1  1 -1  1  0  0  0  0 -1  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 10, 12, 14, 15, 16, 17, 18]), Candidate: [ 2  1  0  1  1  1  1  0  0  2 -1  2  0  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  1  0  0  0  0  0  0 -1  1 -1  0  1] (Indices: [0, 1, 2, 4, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 17]), Candidate: [ 2  1  0  1  1  1  1 -1  2  1  0  1  1  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  1  0  0 -1  0  1  0  0  0 -1  1  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 9, 10, 11, 14, 15, 16, 17, 19]), Candidate: [ 2  1  0  1  1  1  1 -1  2  1  0  0  1  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  1 -1  1  0 -1  1  0  0 -1  1  0  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 9, 11, 12, 14, 15, 16, 18, 19]), Candidate: [ 2  1  0  1  1  1  1 -1  2  0  1  1  0  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  0  1 -1  1  0  0  0 -1  1  0  0  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 10, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  1  0  1  1  1  1 -1  1  2 -1  2  1  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1  0  0  0 -1  1  0  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 4, 5, 6, 8, 9, 10, 11, 13, 14, 15, 16, 18]), Candidate: [2 1 0 1 1 1 0 1 1 1 0 0 2 1 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 4950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1  0 -1  1  0  0  0  0  0 -1  0  1  0] (Indices: [0, 1, 2, 4, 5, 6, 8, 9, 11, 12, 13, 14, 15, 16, 19]), Candidate: [2 1 0 1 1 1 0 1 1 0 1 1 1 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 5000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1 -1  1  0  0 -1  1  0  0  0 -1  1  0] (Indices: [0, 1, 2, 4, 5, 6, 8, 10, 11, 12, 14, 15, 16, 17, 19]), Candidate: [2 1 0 1 1 1 0 1 0 2 0 1 0 2 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 5050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  1  0  0 -1  1  0  0  0  0  0 -1  1] (Indices: [0, 1, 2, 4, 5, 6, 9, 10, 11, 13, 14, 15, 16, 17, 18]), Candidate: [2 1 0 1 1 1 0 0 2 1 0 0 2 1 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 5100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0  0  0  0  0  0 -1  0  1  0  0 -1  1] (Indices: [0, 1, 2, 4, 5, 7, 8, 9, 10, 11, 12, 13, 16, 17, 18]), Candidate: [2 1 0 1 1 0 2 0 1 1 0 1 1 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 5150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0  0  0 -1  1  0 -1  1  0  0  0 -1  1] (Indices: [0, 1, 2, 4, 5, 7, 8, 9, 10, 12, 13, 15, 16, 17, 18]), Candidate: [ 2  1  0  1  1  0  2  0  1  1 -1  2  1  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0  0 -1  0  1  0  0 -1  1  0  0  0  0] (Indices: [0, 1, 2, 4, 5, 7, 8, 9, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  0  1  1  0  2  0  1  0  0  2  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  1  0  0  0  0  0  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 4, 5, 7, 9, 10, 11, 12, 13, 14, 15, 16, 18]), Candidate: [ 2  1  0  1  1  0  2 -1  2  1  0  1  1  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  0  1  0  0 -1  1  0  0  0  0  0  0] (Indices: [0, 1, 2, 4, 5, 7, 10, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  0  1  1  0  2 -1  1  2  0  1  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  0  1 -1  1  0  0  0  0  0  0  0 -1  1  0] (Indices: [0, 1, 2, 4, 5, 8, 10, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [2 1 0 1 1 0 1 1 0 2 0 1 1 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 5400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0  0  0  0  0 -1  0  1  0  0  0 -1  1] (Indices: [0, 1, 2, 4, 6, 7, 8, 9, 10, 11, 12, 15, 16, 17, 18]), Candidate: [2 1 0 1 0 2 1 0 1 1 0 1 0 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 5450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0  0  0 -1  0  1  0  0 -1  1  0  0  0] (Indices: [0, 1, 2, 4, 6, 7, 8, 9, 10, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  1  0  1  0  2  1  0  1  1 -1  1  2  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0 -1  1  0  0  0 -1  1  0  0  0 -1  1] (Indices: [0, 1, 2, 4, 6, 7, 8, 10, 11, 12, 13, 15, 16, 17, 18]), Candidate: [2 1 0 1 0 2 1 0 0 2 0 1 1 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 5550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  1  0  0  0 -1  1  0  0  0  0 -1  1] (Indices: [0, 1, 2, 4, 6, 7, 9, 10, 11, 12, 14, 15, 16, 17, 18]), Candidate: [ 2  1  0  1  0  2  1 -1  2  1  0  1  0  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  1  0  0  0  0  0 -1  1  0  0  0 -1  1] (Indices: [0, 1, 2, 4, 6, 8, 9, 10, 11, 12, 13, 15, 16, 17, 18]), Candidate: [2 1 0 1 0 2 0 1 1 1 0 1 1 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 5650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1 -1  0  1  0  0  0  0 -1  1  0  0  0  0  0] (Indices: [0, 1, 2, 4, 6, 9, 10, 11, 12, 13, 15, 16, 17, 18, 19]), Candidate: [2 1 0 1 0 2 0 0 2 1 0 1 1 0 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 5700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  0  1  0  0 -1  0  1  0  0  0  0  0  0  0  0] (Indices: [0, 1, 2, 4, 7, 8, 9, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 1 0 1 0 1 2 0 1 0 0 2 1 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 5750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0  0  0  0  0  0 -1  0  1  0  0 -1  1] (Indices: [0, 1, 2, 5, 6, 7, 8, 9, 10, 11, 12, 13, 16, 17, 18]), Candidate: [2 1 0 0 2 1 1 0 1 1 0 1 1 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 5800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0  0  0 -1  1  0 -1  1  0  0  0 -1  1] (Indices: [0, 1, 2, 5, 6, 7, 8, 9, 10, 12, 13, 15, 16, 17, 18]), Candidate: [ 2  1  0  0  2  1  1  0  1  1 -1  2  1  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0  0 -1  0  1  0  0 -1  1  0  0  0  0] (Indices: [0, 1, 2, 5, 6, 7, 8, 9, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  0  0  2  1  1  0  1  0  0  2  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  1  0  0  0  0  0  0  0 -1  1 -1  1] (Indices: [0, 1, 2, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 16, 18]), Candidate: [ 2  1  0  0  2  1  1 -1  2  1  0  1  1  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 5950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0 -1  0  1  0  0 -1  1  0  0  0  0  0  0] (Indices: [0, 1, 2, 5, 6, 7, 10, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  0  0  2  1  1 -1  1  2  0  1  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1 -1  1  0  0  0  0  0  0  0 -1  1  0] (Indices: [0, 1, 2, 5, 6, 8, 10, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [2 1 0 0 2 1 0 1 0 2 0 1 1 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 6050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1 -1  1  0  0  0 -1  1  0  0  0  0 -1  1  0  0] (Indices: [0, 1, 2, 5, 7, 8, 9, 10, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  1  0  0  2  0  2  0  1  1 -1  2  1  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0  0  0  0  0  0  0  0  0 -1  0  1  0] (Indices: [0, 1, 2, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 19]), Candidate: [2 1 0 0 1 2 1 0 1 1 0 1 1 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 6150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  0  1  0  0 -1  1  0 -1  1  0  0  0  0  0  0  0] (Indices: [0, 1, 2, 6, 7, 8, 10, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 1 0 0 1 2 1 0 0 2 0 0 2 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 6200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0  0  0  0  0  0 -1  0  1 -1  0  1  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 16, 19]), Candidate: [2 0 2 0 1 1 1 0 1 1 0 1 1 0 0 2 0 1 2 6]
 -> Valid neighbor added.
Attempt 6250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0  0  0  0 -1  0  1 -1  1  0  0 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 14, 16, 17, 18]), Candidate: [ 2  0  2  0  1  1  1  0  1  1  0  0  1  2 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0  0  0 -1  0  1  0 -1  1  0  0 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 9, 10, 13, 14, 16, 17, 18]), Candidate: [ 2  0  2  0  1  1  1  0  1  1 -1  1  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 6350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0  0 -1  1 -1  1  0  0  0  0 -1  0  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 9, 11, 13, 14, 15, 16, 17]), Candidate: [2 0 2 0 1 1 1 0 1 0 1 0 2 1 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 6400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0 -1  1  0  0  0  0  0 -1  1 -1  0  1] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 10, 11, 12, 13, 14, 15, 17]), Candidate: [2 0 2 0 1 1 1 0 0 2 0 1 1 1 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 6450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0 -1  1  0 -1  0  1  0  0  0 -1  1  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 10, 11, 14, 15, 16, 17, 19]), Candidate: [2 0 2 0 1 1 1 0 0 2 0 0 1 2 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 6500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0 -1  0  1  0 -1  1  0  0 -1  1  0  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 11, 12, 14, 15, 16, 18, 19]), Candidate: [2 0 2 0 1 1 1 0 0 1 1 1 0 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 6550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  1  0  0  0 -1  0  1  0  0 -1  1  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 9, 10, 11, 12, 15, 16, 17, 19]), Candidate: [ 2  0  2  0  1  1  1 -1  2  1  0  1  0  1  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  1  0 -1  0  1  0 -1  1  0  0  0  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 9, 10, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  0  2  0  1  1  1 -1  2  1 -1  1  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 6650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  0  1  0  0  0 -1  1  0  0 -1  1  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 10, 11, 12, 13, 15, 16, 17, 19]), Candidate: [ 2  0  2  0  1  1  1 -1  1  2  0  1  1  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1  0  0  0  0  0 -1  0  1  0  0 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 8, 9, 10, 11, 12, 13, 16, 17, 18]), Candidate: [2 0 2 0 1 1 0 1 1 1 0 1 1 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 6750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1  0  0 -1  1  0 -1  1  0  0  0 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 8, 9, 10, 12, 13, 15, 16, 17, 18]), Candidate: [ 2  0  2  0  1  1  0  1  1  1 -1  2  1  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1  0 -1  0  1  0  0 -1  1  0  0  0  0] (Indices: [0, 1, 3, 4, 5, 6, 8, 9, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  0  2  0  1  1  0  1  1  0  0  2  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 6850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  1  0  0  0  0  0  0  0 -1  1 -1  1] (Indices: [0, 1, 3, 4, 5, 6, 9, 10, 11, 12, 13, 14, 15, 16, 18]), Candidate: [2 0 2 0 1 1 0 0 2 1 0 1 1 1 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 6900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  0  0  1  0  0 -1  1  0  0  0  0  0  0] (Indices: [0, 1, 3, 4, 5, 6, 10, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [2 0 2 0 1 1 0 0 1 2 0 1 0 2 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 6950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0  0  0  0 -1  1 -1  1  0  0 -1  1  0] (Indices: [0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 13, 15, 16, 17, 19]), Candidate: [2 0 2 0 1 0 2 0 1 1 0 0 2 0 1 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 7000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0  0 -1  1  0  0 -1  1  0 -1  1  0  0] (Indices: [0, 1, 3, 4, 5, 7, 8, 9, 11, 12, 13, 15, 16, 18, 19]), Candidate: [2 0 2 0 1 0 2 0 1 0 1 1 1 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 7050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0 -1  1  0 -1  1 -1  1  0  0  0  0  0] (Indices: [0, 1, 3, 4, 5, 7, 8, 10, 11, 13, 15, 16, 17, 18, 19]), Candidate: [2 0 2 0 1 0 2 0 0 2 0 0 2 0 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 7100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1 -1  1  0 -1  1  0  0  0 -1  1  0  0  0] (Indices: [0, 1, 3, 4, 5, 7, 9, 10, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  0  2  0  1  0  2 -1  2  1 -1  2  1  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  0  1  0  0  0 -1  1 -1  1  0  0  0  0  0] (Indices: [0, 1, 3, 4, 5, 8, 9, 10, 11, 13, 15, 16, 17, 18, 19]), Candidate: [2 0 2 0 1 0 1 1 1 1 0 0 2 0 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 7200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0  0  0  0  0  0 -1  1  0  0 -1  0  1] (Indices: [0, 1, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 15, 16, 17]), Candidate: [2 0 2 0 0 2 1 0 1 1 0 1 1 0 1 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 7250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0  0  0 -1  1  0  0  0 -1  1 -1  1  0] (Indices: [0, 1, 3, 4, 6, 7, 8, 9, 10, 12, 13, 14, 15, 17, 19]), Candidate: [ 2  0  2  0  0  2  1  0  1  1 -1  2  1  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0  0 -1  1 -1  1 -1  1  0  0  0  0  0] (Indices: [0, 1, 3, 4, 6, 7, 8, 9, 11, 13, 15, 16, 17, 18, 19]), Candidate: [2 0 2 0 0 2 1 0 1 0 1 0 2 0 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 7350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0 -1  0  1  0  0  0 -1  1  0  0  0  0] (Indices: [0, 1, 3, 4, 6, 7, 8, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  0  2  0  0  2  1  0  0  1  1  1  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  0  1  0  0  0  0  0  0  0  0 -1  1] (Indices: [0, 1, 3, 4, 6, 7, 10, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  0  2  0  0  2  1 -1  1  2  0  1  1  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1 -1  1  0 -1  1  0  0  0 -1  1  0  0  0  0] (Indices: [0, 1, 3, 4, 6, 8, 9, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  0  2  0  0  2  0  1  1  0  1  1  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  1  0  0  0  0 -1  1  0  0 -1  1  0  0  0] (Indices: [0, 1, 3, 4, 7, 8, 9, 10, 11, 13, 14, 15, 17, 18, 19]), Candidate: [2 0 2 0 0 1 2 0 1 1 0 0 2 1 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 7550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  0  0  1  0  0 -1  1  0  0  0  0  0  0  0  0] (Indices: [0, 1, 3, 4, 8, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2  0  0  1  1  1  1  1 -1  2  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0  0  0  0 -1  1 -1  1  0  0 -1  1  0] (Indices: [0, 1, 3, 5, 6, 7, 8, 9, 10, 11, 13, 15, 16, 17, 19]), Candidate: [ 2  0  2 -1  2  1  1  0  1  1  0  0  2  0  1  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0  0 -1  1  0  0 -1  1  0 -1  1  0  0] (Indices: [0, 1, 3, 5, 6, 7, 8, 9, 11, 12, 13, 15, 16, 18, 19]), Candidate: [ 2  0  2 -1  2  1  1  0  1  0  1  1  1  0  1  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0 -1  1  0 -1  1 -1  1  0  0  0  0  0] (Indices: [0, 1, 3, 5, 6, 7, 8, 10, 11, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  1  1  0  0  2  0  0  2  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  1  0 -1  1  0  0  0 -1  1  0  0  0] (Indices: [0, 1, 3, 5, 6, 7, 9, 10, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  1  1 -1  2  1 -1  2  1  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 7800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0 -1  1  0  0  0 -1  1 -1  1  0  0  0  0  0] (Indices: [0, 1, 3, 5, 6, 8, 9, 10, 11, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  1  0  1  1  1  0  0  2  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1  0  0  0  0  0  0 -1  1  0  0  0 -1  1] (Indices: [0, 1, 3, 5, 7, 8, 9, 10, 11, 12, 13, 15, 16, 17, 18]), Candidate: [ 2  0  2 -1  2  0  2  0  1  1  0  1  1  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 7900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1 -1  1 -1  1  0  0  0  0 -1  1  0  0  0  0  0] (Indices: [0, 1, 3, 5, 7, 9, 10, 11, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  0  2 -1  2  1  0  1  1  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 7950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0  0  0 -1  1  0  0 -1  1  0  0  0  0] (Indices: [0, 1, 3, 6, 7, 8, 9, 10, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  2  1  0  1  1 -1  2  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 8000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  0  1  0  0  0  0  0  0  0 -1  1  0  0  0  0] (Indices: [0, 1, 3, 7, 8, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  1  2  0  1  1  0  1  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 8050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0  0  0  0 -1  1  0 -1  1  0  0 -1  1] (Indices: [0, 1, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 16, 17, 18]), Candidate: [ 2  0  1  1  1  1  1  0  1  1  0  0  2  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0  0 -1  1  0  0  0 -1  1  0 -1  1  0] (Indices: [0, 1, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  0  1  1  1  1  1  0  1  0  1  1  1  1 -1  2  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0 -1  1  0 -1  1  0  0  0  0  0 -1  1] (Indices: [0, 1, 4, 5, 6, 7, 8, 10, 11, 13, 14, 15, 16, 17, 18]), Candidate: [2 0 1 1 1 1 1 0 0 2 0 0 2 1 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 8200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  1  0  0 -1  1 -1  1  0  0  0  0  0] (Indices: [0, 1, 4, 5, 6, 7, 9, 10, 11, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  0  1  1  1  1  1 -1  2  1  0  0  2  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0 -1  1  0  0  0 -1  1  0  0  0  0  0 -1  1] (Indices: [0, 1, 4, 5, 6, 8, 9, 10, 11, 13, 14, 15, 16, 17, 18]), Candidate: [2 0 1 1 1 1 0 1 1 1 0 0 2 1 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 8300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1  0  0  0  0  0  0  0  0 -1  0  1  0  0] (Indices: [0, 1, 4, 5, 7, 8, 9, 10, 11, 12, 13, 14, 15, 18, 19]), Candidate: [2 0 1 1 1 0 2 0 1 1 0 1 1 1 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 8350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0 -1  1 -1  1  0  0  0  0  0  0  0  0  0 -1  1] (Indices: [0, 1, 4, 5, 7, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  0  1  1  1  0  2 -1  2  1  0  1  1  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1  0  0  0  0  0 -1  0  1  0  0  0  0  0  0] (Indices: [0, 1, 4, 6, 7, 8, 9, 10, 11, 14, 15, 16, 17, 18, 19]), Candidate: [2 0 1 1 0 2 1 0 1 1 0 0 1 2 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 8450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1 -1  1 -1  0  1  0  0  0  0  0  0  0  0  0  0  0] (Indices: [0, 1, 4, 6, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 0 1 1 0 2 0 0 2 1 0 1 1 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 8500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0  0 -1  1  0  0  0  0  0  0  0 -1  1] (Indices: [0, 1, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [2 0 1 0 2 1 1 0 1 0 1 1 1 1 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 8550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1 -1  1  0  0  0 -1  1  0  0  0  0  0  0  0  0] (Indices: [0, 1, 5, 7, 8, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  0  1  0  2  0  2  0  1  1 -1  2  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0  0  0  0  0 -1  0  0  1  0  0 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 16, 17, 18]), Candidate: [1 2 1 0 1 1 1 0 1 1 0 1 0 1 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 8650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0  0  0 -1  1  0 -1  1  0 -1  1 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 15, 16, 18]), Candidate: [ 1  2  1  0  1  1  1  0  1  1 -1  2  1  0  1  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0  0 -1  1  0  0  0 -1  1 -1  1 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 16, 18]), Candidate: [ 1  2  1  0  1  1  1  0  1  0  1  1  1  1 -1  2  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0  0 -1  1 -1  0  0  1  0  0  0  0  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 9, 11, 15, 16, 17, 18, 19]), Candidate: [1 2 1 0 1 1 1 0 1 0 1 0 1 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 8800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0 -1  1  0  0 -1  1  0  0 -1  1 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 10, 11, 12, 14, 15, 16, 18]), Candidate: [1 2 1 0 1 1 1 0 0 2 0 1 0 2 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 8850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0 -1  1 -1  1 -1  1  0  0  0  0 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 15, 16, 17, 18]), Candidate: [ 1  2  1  0  1  1  1  0  0  2 -1  2  0  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  1  0  0  0  0  0  0 -1  1 -1  0  1] (Indices: [0, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 17]), Candidate: [ 1  2  1  0  1  1  1 -1  2  1  0  1  1  1  0  0  2  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 8950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  1  0  0 -1  0  1  0  0  0 -1  1  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 9, 10, 11, 14, 15, 16, 17, 19]), Candidate: [ 1  2  1  0  1  1  1 -1  2  1  0  0  1  2  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  1 -1  1  0 -1  1  0  0 -1  1  0  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 9, 11, 12, 14, 15, 16, 18, 19]), Candidate: [ 1  2  1  0  1  1  1 -1  2  0  1  1  0  2  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  0  1 -1  1  0  0  0 -1  1  0  0  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 10, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 1  2  1  0  1  1  1 -1  1  2 -1  2  1  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 9100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1  0  0  0 -1  1  0  0  0 -1  1 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 8, 9, 10, 11, 13, 14, 15, 16, 18]), Candidate: [1 2 1 0 1 1 0 1 1 1 0 0 2 1 0 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 9150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1  0 -1  1  0  0  0  0  0 -1  0  1  0] (Indices: [0, 2, 3, 4, 5, 6, 8, 9, 11, 12, 13, 14, 15, 16, 19]), Candidate: [1 2 1 0 1 1 0 1 1 0 1 1 1 1 0 1 0 1 2 6]
 -> Valid neighbor added.
Attempt 9200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1 -1  1  0  0 -1  1  0  0  0 -1  1  0] (Indices: [0, 2, 3, 4, 5, 6, 8, 10, 11, 12, 14, 15, 16, 17, 19]), Candidate: [1 2 1 0 1 1 0 1 0 2 0 1 0 2 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 9250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  0  1  0  0 -1  1  0  0  0  0  0 -1  1] (Indices: [0, 2, 3, 4, 5, 6, 9, 10, 11, 13, 14, 15, 16, 17, 18]), Candidate: [1 2 1 0 1 1 0 0 2 1 0 0 2 1 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 9300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0  0  0  0  0  0 -1  0  1  0  0 -1  1] (Indices: [0, 2, 3, 4, 5, 7, 8, 9, 10, 11, 12, 13, 16, 17, 18]), Candidate: [1 2 1 0 1 0 2 0 1 1 0 1 1 0 0 2 1 1 0 7]
 -> Valid neighbor added.
Attempt 9350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0  0  0 -1  1  0 -1  1  0  0  0 -1  1] (Indices: [0, 2, 3, 4, 5, 7, 8, 9, 10, 12, 13, 15, 16, 17, 18]), Candidate: [ 1  2  1  0  1  0  2  0  1  1 -1  2  1  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0  0 -1  0  1  0  0 -1  1  0  0  0  0] (Indices: [0, 2, 3, 4, 5, 7, 8, 9, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  2  1  0  1  0  2  0  1  0  0  2  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  1  0  0  0  0  0  0  0 -1  1 -1  1] (Indices: [0, 2, 3, 4, 5, 7, 9, 10, 11, 12, 13, 14, 15, 16, 18]), Candidate: [ 1  2  1  0  1  0  2 -1  2  1  0  1  1  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1 -1  0  1  0  0 -1  1  0  0  0  0  0  0] (Indices: [0, 2, 3, 4, 5, 7, 10, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  2  1  0  1  0  2 -1  1  2  0  1  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  0  1 -1  1  0  0  0  0  0  0  0 -1  1  0] (Indices: [0, 2, 3, 4, 5, 8, 10, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [1 2 1 0 1 0 1 1 0 2 0 1 1 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 9600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0  0  0  0  0 -1  0  1  0  0  0 -1  1] (Indices: [0, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 15, 16, 17, 18]), Candidate: [1 2 1 0 0 2 1 0 1 1 0 1 0 1 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 9650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0  0  0 -1  0  1  0  0 -1  1  0  0  0] (Indices: [0, 2, 3, 4, 6, 7, 8, 9, 10, 13, 14, 15, 17, 18, 19]), Candidate: [ 1  2  1  0  0  2  1  0  1  1 -1  1  2  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0 -1  1  0  0  0 -1  1  0  0  0 -1  1] (Indices: [0, 2, 3, 4, 6, 7, 8, 10, 11, 12, 13, 15, 16, 17, 18]), Candidate: [1 2 1 0 0 2 1 0 0 2 0 1 1 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 9750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0 -1  1  0  0  0 -1  1  0  0  0  0 -1  1] (Indices: [0, 2, 3, 4, 6, 7, 9, 10, 11, 12, 14, 15, 16, 17, 18]), Candidate: [ 1  2  1  0  0  2  1 -1  2  1  0  1  0  2  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 9800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1  0  0  0  0  0 -1  1  0  0  0 -1  1] (Indices: [0, 2, 3, 4, 6, 8, 9, 10, 11, 12, 13, 15, 16, 17, 18]), Candidate: [1 2 1 0 0 2 0 1 1 1 0 1 1 0 1 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 9850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  0  1  0  0  0  0 -1  1  0  0  0  0  0] (Indices: [0, 2, 3, 4, 6, 9, 10, 11, 12, 13, 15, 16, 17, 18, 19]), Candidate: [1 2 1 0 0 2 0 0 2 1 0 1 1 0 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 9900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  0  1  0  0 -1  0  1  0  0  0  0  0  0  0  0] (Indices: [0, 2, 3, 4, 7, 8, 9, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [1 2 1 0 0 1 2 0 1 0 0 2 1 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 9950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0  0  0  0  0  0 -1  0  1  0  0 -1  1] (Indices: [0, 2, 3, 5, 6, 7, 8, 9, 10, 11, 12, 13, 16, 17, 18]), Candidate: [ 1  2  1 -1  2  1  1  0  1  1  0  1  1  0  0  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0  0  0 -1  1  0 -1  1  0  0  0 -1  1] (Indices: [0, 2, 3, 5, 6, 7, 8, 9, 10, 12, 13, 15, 16, 17, 18]), Candidate: [ 1  2  1 -1  2  1  1  0  1  1 -1  2  1  0  1  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0  0 -1  0  1  0  0 -1  1  0  0  0  0] (Indices: [0, 2, 3, 5, 6, 7, 8, 9, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  1  1  0  1  0  0  2  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  1  0  0  0  0  0  0  0 -1  1 -1  1] (Indices: [0, 2, 3, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 16, 18]), Candidate: [ 1  2  1 -1  2  1  1 -1  2  1  0  1  1  1  0  1  0  2  0  7]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0 -1  0  1  0  0 -1  1  0  0  0  0  0  0] (Indices: [0, 2, 3, 5, 6, 7, 10, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  1  1 -1  1  2  0  1  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0 -1  1 -1  1  0  0  0  0  0  0  0 -1  1  0] (Indices: [0, 2, 3, 5, 6, 8, 10, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 1  2  1 -1  2  1  0  1  0  2  0  1  1  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0  0  0 -1  1  0  0  0  0 -1  1  0  0] (Indices: [0, 2, 3, 5, 7, 8, 9, 10, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 1  2  1 -1  2  0  2  0  1  1 -1  2  1  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 10300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0  0  0  0  0  0  0  0  0 -1  0  1  0] (Indices: [0, 2, 3, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 19]), Candidate: [ 1  2  1 -1  1  2  1  0  1  1  0  1  1  1  0  1  0  1  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  0  1  0  0 -1  1  0 -1  1  0  0  0  0  0  0  0] (Indices: [0, 2, 3, 6, 7, 8, 10, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  2  1 -1  1  2  1  0  0  2  0  0  2  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0  0  0  0  0  0 -1  1  0 -1  1 -1  1] (Indices: [0, 2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 16, 18]), Candidate: [1 2 0 1 1 1 1 0 1 1 0 1 1 0 1 1 0 2 0 7]
 -> Valid neighbor added.
Attempt 10450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0  0  0 -1  1  0  0  0 -1  0  1  0  0] (Indices: [0, 2, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 18, 19]), Candidate: [ 1  2  0  1  1  1  1  0  1  1 -1  2  1  1  0  0  1  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0  0 -1  1 -1  0  1  0  0  0  0  0  0] (Indices: [0, 2, 4, 5, 6, 7, 8, 9, 11, 14, 15, 16, 17, 18, 19]), Candidate: [1 2 0 1 1 1 1 0 1 0 1 0 1 2 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 10550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0 -1  0  1  0  0 -1  1  0  0  0  0  0] (Indices: [0, 2, 4, 5, 6, 7, 8, 11, 12, 13, 15, 16, 17, 18, 19]), Candidate: [1 2 0 1 1 1 1 0 0 1 1 1 1 0 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 10600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0 -1  0  1  0  0  0  0  0  0  0 -1  1  0] (Indices: [0, 2, 4, 5, 6, 7, 10, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 1  2  0  1  1  1  1 -1  1  2  0  1  1  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0 -1  1  0 -1  1  0  0 -1  1  0  0  0  0  0] (Indices: [0, 2, 4, 5, 6, 8, 9, 11, 12, 13, 15, 16, 17, 18, 19]), Candidate: [1 2 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 10700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0  0  0  0 -1  1  0 -1  1  0  0  0  0] (Indices: [0, 2, 4, 5, 7, 8, 9, 10, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  2  0  1  1  0  2  0  1  1  0  0  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  0  1  0 -1  1  0  0  0  0  0  0  0  0  0] (Indices: [0, 2, 4, 5, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [1 2 0 1 1 0 1 1 1 0 1 1 1 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 10800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1 -1  1  0  0 -1  1  0  0  0  0  0  0 -1  1  0  0] (Indices: [0, 2, 4, 6, 7, 8, 10, 11, 12, 13, 14, 15, 16, 18, 19]), Candidate: [1 2 0 1 0 2 1 0 0 2 0 1 1 1 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 10850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0  0  0  0  0  0  0  0 -1  1  0  0 -1  1] (Indices: [0, 2, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 1  2  0  0  2  1  1  0  1  1  0  1  1  1 -1  2  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  0  1  0  0 -1  1  0  0  0  0  0  0  0  0 -1  1  0] (Indices: [0, 2, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 1  2  0  0  2  1  1 -1  2  1  0  1  1  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 10950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0  0  0  0  0  0  0  0 -1  1 -1  0  1] (Indices: [0, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17]), Candidate: [1 1 2 0 1 1 1 0 1 1 0 1 1 1 0 0 2 0 1 7]
 -> Valid neighbor added.
Attempt 11000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0  0  0  0 -1  0  1  0  0  0 -1  1  0] (Indices: [0, 3, 4, 5, 6, 7, 8, 9, 10, 11, 14, 15, 16, 17, 19]), Candidate: [1 1 2 0 1 1 1 0 1 1 0 0 1 2 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 11050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0  0 -1  1  0 -1  1  0  0 -1  1  0  0] (Indices: [0, 3, 4, 5, 6, 7, 8, 9, 11, 12, 14, 15, 16, 18, 19]), Candidate: [1 1 2 0 1 1 1 0 1 0 1 1 0 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 11100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0 -1  1 -1  1  0  0  0 -1  1  0  0  0] (Indices: [0, 3, 4, 5, 6, 7, 8, 10, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 1  1  2  0  1  1  1  0  0  2 -1  2  1  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  1 -1  1  0  0  0  0  0  0  0 -1  1] (Indices: [0, 3, 4, 5, 6, 7, 9, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 1  1  2  0  1  1  1 -1  2  0  1  1  1  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0 -1  1  0  0 -1  1  0  0  0 -1  1  0  0  0] (Indices: [0, 3, 4, 5, 6, 8, 9, 10, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 1  1  2  0  1  1  0  1  1  1 -1  2  1  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1  0  0  0  0  0 -1  1  0  0  0  0 -1  1] (Indices: [0, 3, 4, 5, 7, 8, 9, 10, 11, 12, 14, 15, 16, 17, 18]), Candidate: [1 1 2 0 1 0 2 0 1 1 0 1 0 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 11300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0 -1  1 -1  0  1  0  0  0  0  0  0  0  0  0  0] (Indices: [0, 3, 4, 5, 7, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  1  2  0  1  0  2 -1  1  2  0  1  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  1  0  0  0 -1  1  0  0  0  0  0  0 -1  1  0] (Indices: [0, 3, 4, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [1 1 2 0 0 2 1 0 1 0 1 1 1 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 11400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0 -1  0  1  0  0 -1  1  0  0  0  0  0  0  0  0  0] (Indices: [0, 3, 4, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [1 1 2 0 0 1 2 0 1 0 1 1 1 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 11450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0 -1  1  0  0  0  0  0  0  0 -1  1  0] (Indices: [0, 3, 5, 6, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 1  1  2 -1  2  1  1  0  0  2  0  1  1  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  0  1  0  0  0  0  0  0  0 -1  1  0  0  0  0  0] (Indices: [0, 3, 6, 7, 8, 9, 10, 11, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  1  2  1  0  1  1  0  1  1  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1  0  0  0  0  0 -1  1  0  0 -1  1  0  0  0  0  0] (Indices: [0, 4, 5, 6, 7, 8, 9, 11, 12, 13, 15, 16, 17, 18, 19]), Candidate: [1 1 1 1 1 1 1 0 1 0 1 1 1 0 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 11600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  0  1 -1  1  0  0  0  0  0  0  0  0  0  0  0  0 -1  1] (Indices: [0, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [1 1 1 1 0 2 1 0 1 1 0 1 1 1 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 11650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0  0  0  0  0 -1  1 -1  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 16, 19]), Candidate: [ 3  1  1  0  1  1  1  0  1  1  0  1  0  2 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0  0  0 -1  1  0  0  0 -1  1 -1  0  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 17]), Candidate: [ 3  1  1  0  1  1  1  0  1  1 -1  2  1  1  0  0  2  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0  0  0 -1  0  0  1  0  0  0 -1  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 14, 15, 16, 17, 19]), Candidate: [ 3  1  1  0  1  1  1  0  1  1 -1  1  1  2  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0  0 -1  1 -1  1 -1  1  0  0  0 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 13, 15, 16, 17, 18]), Candidate: [3 1 1 0 1 1 1 0 1 0 1 0 2 0 1 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 11850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0 -1  1  0  0  0 -1  1  0 -1  1 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 12, 13, 15, 16, 18]), Candidate: [3 1 1 0 1 1 1 0 0 2 0 1 1 0 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 11900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0 -1  1 -1  1  0  0  0 -1  0  1  0 -1] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 13, 14, 15, 18, 19]), Candidate: [ 3  1  1  0  1  1  1  0  0  2 -1  2  1  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 11950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0 -1  0  1 -1  0  1  0  0  0  0  0 -1] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 11, 14, 15, 16, 17, 18, 19]), Candidate: [3 1 1 0 1 1 1 0 0 1 1 0 1 2 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 12000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  1  0  0 -1  1  0 -1  1  0  0 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 16, 17, 18]), Candidate: [ 3  1  1  0  1  1  1 -1  2  1  0  0  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 12050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  1 -1  1  0  0  0 -1  1  0 -1  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 7, 9, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 3  1  1  0  1  1  1 -1  2  0  1  1  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 12100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  0  1  0 -1  1  0  0  0  0  0 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 10, 11, 13, 14, 15, 16, 17, 18]), Candidate: [ 3  1  1  0  1  1  1 -1  1  2  0  0  2  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1  0  0  0  0 -1  1 -1  1  0  0 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 8, 9, 10, 11, 12, 14, 16, 17, 18]), Candidate: [ 3  1  1  0  1  1  0  1  1  1  0  1  0  2 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1  0  0 -1  1 -1  0  1  0  0  0  0 -1] (Indices: [1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 16, 17, 18, 19]), Candidate: [ 3  1  1  0  1  1  0  1  1  1 -1  2  0  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1 -1  1  0  0  0  0 -1  1  0  0 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 8, 10, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 3  1  1  0  1  1  0  1  0  2  0  1  1  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  0  1  0  0  0  0 -1  1  0  0 -1  1 -1] (Indices: [1, 2, 3, 4, 5, 6, 9, 10, 11, 12, 13, 15, 16, 17, 19]), Candidate: [3 1 1 0 1 1 0 0 2 1 0 1 1 0 1 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 12350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0  0  0  0  0  0  0 -1  1 -1  0  1 -1] (Indices: [1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 12, 13, 14, 16, 19]), Candidate: [ 3  1  1  0  1  0  2  0  1  1  0  1  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0  0  0 -1  1  0  0  0  0  0 -1  0  0] (Indices: [1, 2, 3, 4, 5, 7, 8, 9, 10, 12, 13, 14, 15, 16, 17]), Candidate: [ 3  1  1  0  1  0  2  0  1  1 -1  2  1  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0  0 -1  1 -1  1  0  0  0  0 -1  1 -1] (Indices: [1, 2, 3, 4, 5, 7, 8, 9, 11, 13, 14, 15, 16, 17, 19]), Candidate: [3 1 1 0 1 0 2 0 1 0 1 0 2 1 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 12500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0 -1  0  1  0  0  0  0  0  0  0 -1  0] (Indices: [1, 2, 3, 4, 5, 7, 8, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [3 1 1 0 1 0 2 0 0 1 1 1 1 1 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 12550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1 -1  1 -1  1  0  0 -1  1  0  0  0  0 -1] (Indices: [1, 2, 3, 4, 5, 7, 9, 11, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 3  1  1  0  1  0  2 -1  2  0  1  1  1  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  0  1  0 -1  1  0  0  0  0  0  0  0 -1  0] (Indices: [1, 2, 3, 4, 5, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [3 1 1 0 1 0 1 1 1 0 1 1 1 1 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 12650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0  0  0  0  0 -1  1  0  0  0 -1  0  0] (Indices: [1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 14, 15, 16, 17]), Candidate: [3 1 1 0 0 2 1 0 1 1 0 1 0 2 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 12700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0  0  0 -1  1  0 -1  0  1  0  0  0 -1] (Indices: [1, 2, 3, 4, 6, 7, 8, 9, 10, 12, 13, 16, 17, 18, 19]), Candidate: [ 3  1  1  0  0  2  1  0  1  1 -1  2  1  0  0  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0 -1  1  0  0  0  0  0  0  0 -1  0  0] (Indices: [1, 2, 3, 4, 6, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17]), Candidate: [3 1 1 0 0 2 1 0 0 2 0 1 1 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 12800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  1  0  0  0  0  0  0 -1  0  1  0 -1] (Indices: [1, 2, 3, 4, 6, 7, 9, 10, 11, 12, 13, 14, 15, 18, 19]), Candidate: [ 3  1  1  0  0  2  1 -1  2  1  0  1  1  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 12850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1  0  0  0  0  0  0  0  0  0 -1  0  0] (Indices: [1, 2, 3, 4, 6, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17]), Candidate: [3 1 1 0 0 2 0 1 1 1 0 1 1 1 0 1 1 0 1 6]
 -> Valid neighbor added.
Attempt 12900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1 -1  1 -1  1  0  0  0 -1  1  0  0  0  0 -1] (Indices: [1, 2, 3, 4, 6, 8, 10, 11, 12, 13, 15, 16, 17, 18, 19]), Candidate: [3 1 1 0 0 2 0 1 0 2 0 1 1 0 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 12950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  0  1  0  0  0 -1  1 -1  1  0  0  0  0  0 -1] (Indices: [1, 2, 3, 4, 7, 8, 9, 10, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  1  1  0  0  1  2  0  1  1 -1  2  0  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0  0  0  0  0  0  0 -1  1 -1  0  1 -1] (Indices: [1, 2, 3, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 16, 19]), Candidate: [ 3  1  1 -1  2  1  1  0  1  1  0  1  1  1 -1  2  0  1  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 13050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0  0  0 -1  1  0  0  0  0  0 -1  0  0] (Indices: [1, 2, 3, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16, 17]), Candidate: [ 3  1  1 -1  2  1  1  0  1  1 -1  2  1  1  0  1  1  0  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 13100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0  0 -1  1 -1  1  0  0  0  0 -1  1 -1] (Indices: [1, 2, 3, 5, 6, 7, 8, 9, 11, 13, 14, 15, 16, 17, 19]), Candidate: [ 3  1  1 -1  2  1  1  0  1  0  1  0  2  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0 -1  0  1  0  0  0  0  0  0  0 -1  0] (Indices: [1, 2, 3, 5, 6, 7, 8, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 3  1  1 -1  2  1  1  0  0  1  1  1  1  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0 -1  1 -1  1  0  0 -1  1  0  0  0  0 -1] (Indices: [1, 2, 3, 5, 6, 7, 9, 11, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  1  1 -1  2  0  1  1  1  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 13250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1  0 -1  1  0  0  0  0  0  0  0 -1  0] (Indices: [1, 2, 3, 5, 6, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 3  1  1 -1  2  1  0  1  1  0  1  1  1  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  1  0  0  0  0  0 -1  0  1  0  0  0  0 -1] (Indices: [1, 2, 3, 5, 7, 8, 9, 10, 11, 12, 15, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  0  2  0  1  1  0  1  0  1  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1 -1  0  1  0  0  0  0  0  0 -1  1  0  0  0 -1] (Indices: [1, 2, 3, 5, 8, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  0  1  1  1  1  0  1  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 13400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  0  1  0  0  0 -1  1  0 -1  1  0  0  0  0  0 -1] (Indices: [1, 2, 3, 6, 7, 8, 9, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  1  1 -1  1  2  1  0  1  0  1  1  0  2  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0  0  0  0  0  0  0  0 -1  1 -1  0  0] (Indices: [1, 2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17]), Candidate: [3 1 0 1 1 1 1 0 1 1 0 1 1 1 0 0 2 0 1 6]
 -> Valid neighbor added.
Attempt 13500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0  0  0  0 -1  0  1  0  0  0 -1  1 -1] (Indices: [1, 2, 4, 5, 6, 7, 8, 9, 10, 11, 14, 15, 16, 17, 19]), Candidate: [3 1 0 1 1 1 1 0 1 1 0 0 1 2 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 13550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0  0 -1  1  0 -1  1  0  0 -1  1  0 -1] (Indices: [1, 2, 4, 5, 6, 7, 8, 9, 11, 12, 14, 15, 16, 18, 19]), Candidate: [3 1 0 1 1 1 1 0 1 0 1 1 0 2 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 13600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0 -1  1 -1  1  0  0  0 -1  1  0  0 -1] (Indices: [1, 2, 4, 5, 6, 7, 8, 10, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 3  1  0  1  1  1  1  0  0  2 -1  2  1  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  1 -1  1  0  0  0  0  0  0  0 -1  0] (Indices: [1, 2, 4, 5, 6, 7, 9, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 3  1  0  1  1  1  1 -1  2  0  1  1  1  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0 -1  1  0  0 -1  1  0  0  0 -1  1  0  0 -1] (Indices: [1, 2, 4, 5, 6, 8, 9, 10, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 3  1  0  1  1  1  0  1  1  1 -1  2  1  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1  0  0  0  0  0 -1  1  0  0  0  0 -1  0] (Indices: [1, 2, 4, 5, 7, 8, 9, 10, 11, 12, 14, 15, 16, 17, 18]), Candidate: [3 1 0 1 1 0 2 0 1 1 0 1 0 2 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 13800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0 -1  1 -1  0  1  0  0  0  0  0  0  0  0  0 -1] (Indices: [1, 2, 4, 5, 7, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  1  0  1  1  0  2 -1  1  2  0  1  1  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 13850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  1  0  0  0 -1  1  0  0  0  0  0  0 -1  1 -1] (Indices: [1, 2, 4, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [3 1 0 1 0 2 1 0 1 0 1 1 1 1 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 13900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1 -1  0  1  0  0 -1  1  0  0  0  0  0  0  0  0 -1] (Indices: [1, 2, 4, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [3 1 0 1 0 1 2 0 1 0 1 1 1 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 13950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0 -1  1  0  0  0  0  0  0  0 -1  1 -1] (Indices: [1, 2, 5, 6, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [3 1 0 0 2 1 1 0 0 2 0 1 1 1 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 14000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  0  1  0  0  0  0  0  0  0 -1  1  0  0  0  0 -1] (Indices: [1, 2, 6, 7, 8, 9, 10, 11, 12, 13, 15, 16, 17, 18, 19]), Candidate: [3 1 0 0 1 2 1 0 1 1 0 1 1 0 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 14050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0  0  0  0 -1  1  0 -1  1  0  0 -1  0] (Indices: [1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 16, 17, 18]), Candidate: [ 3  0  2  0  1  1  1  0  1  1  0  0  2  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0  0 -1  1  0  0  0 -1  1  0 -1  1 -1] (Indices: [1, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 3  0  2  0  1  1  1  0  1  0  1  1  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0 -1  1  0 -1  1  0  0  0  0  0 -1  0] (Indices: [1, 3, 4, 5, 6, 7, 8, 10, 11, 13, 14, 15, 16, 17, 18]), Candidate: [3 0 2 0 1 1 1 0 0 2 0 0 2 1 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 14200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0 -1  1  0  0 -1  1 -1  1  0  0  0  0 -1] (Indices: [1, 3, 4, 5, 6, 7, 9, 10, 11, 13, 15, 16, 17, 18, 19]), Candidate: [ 3  0  2  0  1  1  1 -1  2  1  0  0  2  0  1  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0 -1  1  0  0  0 -1  1  0  0  0  0  0 -1  0] (Indices: [1, 3, 4, 5, 6, 8, 9, 10, 11, 13, 14, 15, 16, 17, 18]), Candidate: [3 0 2 0 1 1 0 1 1 1 0 0 2 1 0 1 1 1 0 6]
 -> Valid neighbor added.
Attempt 14300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1  0  0  0  0  0  0  0  0 -1  0  1  0 -1] (Indices: [1, 3, 4, 5, 7, 8, 9, 10, 11, 12, 13, 14, 15, 18, 19]), Candidate: [3 0 2 0 1 0 2 0 1 1 0 1 1 1 0 0 1 2 1 5]
 -> Valid neighbor added.
Attempt 14350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0 -1  1 -1  1  0  0  0  0  0  0  0  0  0 -1  0] (Indices: [1, 3, 4, 5, 7, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 3  0  2  0  1  0  2 -1  2  1  0  1  1  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0  0  0  0 -1  0  1  0  0  0  0  0 -1] (Indices: [1, 3, 4, 6, 7, 8, 9, 10, 11, 14, 15, 16, 17, 18, 19]), Candidate: [3 0 2 0 0 2 1 0 1 1 0 0 1 2 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 14450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1 -1  0  1  0  0  0  0  0  0  0  0  0  0 -1] (Indices: [1, 3, 4, 6, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [3 0 2 0 0 2 0 0 2 1 0 1 1 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 14500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1  0  0  0  0 -1  1  0  0  0  0  0  0  0 -1  0] (Indices: [1, 3, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 3  0  2 -1  2  1  1  0  1  0  1  1  1  1  0  1  1  1  0  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1 -1  1 -1  1  0  0  0 -1  1  0  0  0  0  0  0  0 -1] (Indices: [1, 3, 5, 7, 8, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  0  2 -1  2  0  2  0  1  1 -1  2  1  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 14600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0  0  0  0  0  0 -1  1  0  0  0 -1  1  0  0 -1] (Indices: [1, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 3  0  1  1  1  1  1  0  1  1 -1  2  1  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  0  1  0 -1  1  0  0  0  0  0  0  0  0 -1  1  0  0 -1] (Indices: [1, 4, 5, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [3 0 1 1 1 0 2 0 1 1 0 1 1 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 14700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0  0  0  0  0  0 -1  1  0 -1  1 -1  0] (Indices: [2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 16, 18]), Candidate: [2 2 1 0 1 1 1 0 1 1 0 1 1 0 1 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 14750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0  0  0 -1  1  0  0  0 -1  0  1  0 -1] (Indices: [2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 18, 19]), Candidate: [ 2  2  1  0  1  1  1  0  1  1 -1  2  1  1  0  0  1  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0  0 -1  1 -1  0  1  0  0  0  0  0 -1] (Indices: [2, 3, 4, 5, 6, 7, 8, 9, 11, 14, 15, 16, 17, 18, 19]), Candidate: [2 2 1 0 1 1 1 0 1 0 1 0 1 2 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 14850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0 -1  0  1  0  0 -1  1  0  0  0  0 -1] (Indices: [2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 15, 16, 17, 18, 19]), Candidate: [2 2 1 0 1 1 1 0 0 1 1 1 1 0 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 14900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  0  1  0  0  0  0  0  0  0 -1  1 -1] (Indices: [2, 3, 4, 5, 6, 7, 10, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  2  1  0  1  1  1 -1  1  2  0  1  1  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 14950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0 -1  1  0 -1  1  0  0 -1  1  0  0  0  0 -1] (Indices: [2, 3, 4, 5, 6, 8, 9, 11, 12, 13, 15, 16, 17, 18, 19]), Candidate: [2 2 1 0 1 1 0 1 1 0 1 1 1 0 1 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 15000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  1  0  0  0  0 -1  1  0 -1  1  0  0  0 -1] (Indices: [2, 3, 4, 5, 7, 8, 9, 10, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  2  1  0  1  0  2  0  1  1  0  0  2  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0 -1  0  1  0 -1  1  0  0  0  0  0  0  0  0 -1] (Indices: [2, 3, 4, 5, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 2 1 0 1 0 1 1 1 0 1 1 1 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 15100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0 -1  1  0  0 -1  1  0  0  0  0  0  0 -1  1  0 -1] (Indices: [2, 3, 4, 6, 7, 8, 10, 11, 12, 13, 14, 15, 16, 18, 19]), Candidate: [2 2 1 0 0 2 1 0 0 2 0 1 1 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 15150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0  0  0  0  0  0  0 -1  1  0  0 -1  0] (Indices: [2, 3, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 16, 17, 18]), Candidate: [ 2  2  1 -1  2  1  1  0  1  1  0  1  1  1 -1  2  1  1  0  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0 -1  1  0  0  0  0  0  0  0  0 -1  1 -1] (Indices: [2, 3, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  2  1 -1  2  1  1 -1  2  1  0  1  1  1  0  1  1  0  2  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 15250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0  0  0  0  0  0  0  0  0 -1  1 -1  0] (Indices: [2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18]), Candidate: [2 2 0 1 1 1 1 0 1 1 0 1 1 1 0 1 0 2 0 6]
 -> Valid neighbor added.
Attempt 15300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1  0  0  0  0 -1  1  0  0 -1  1  0  0  0  0  0 -1] (Indices: [2, 4, 5, 6, 7, 8, 10, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [2 2 0 1 1 1 1 0 0 2 0 1 0 2 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 15350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1 -1  1 -1  1  0  0 -1  1  0  0  0  0  0  0  0  0  0 -1] (Indices: [2, 4, 6, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 2 0 1 0 2 1 0 0 2 0 1 1 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 15400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0  0  0  0  0  0 -1  1  0  0  0 -1  1  0  0 -1] (Indices: [3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  1  2  0  1  1  1  0  1  1 -1  2  1  1  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 15450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  1  0  0 -1  1  0  0  0  0  0  0  0  0 -1  1  0  0 -1] (Indices: [3, 4, 5, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [2 1 2 0 1 0 2 0 1 1 0 1 1 1 0 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 15500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  1  0  0  0 -1  1  0  0  0  0  0  0  0  0  0  0 -1] (Indices: [4, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1  1  1  1  1 -1  2  1  0  1  1  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Finished generating neighbors. Total valid neighbors found: 6272
  Size of neighborhood t=15: 6272
  Using 'fork' start method for multiprocessing.
  No improvement found for t=15 after processing 6272 neighbors.
No improving solution found or error occurred for t=15.

Attempting neighborhood t=16 (current best cost: 98.4663)
  Exploring neighborhood t=16 in parallel (current cost: 98.4663)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Attempt 50: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0  0  0 -1  1 -1  1 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19]), Candidate: [2 1 1 0 1 1 1 0 1 1 0 0 2 0 1 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0  0 -1  1 -1  1 -1  0  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 17, 18, 19]), Candidate: [ 2  1  1  0  1  1  1  0  1  1 -1  2  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0 -1  1  0 -1  1  0 -1  1  0 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 14, 15, 17, 18]), Candidate: [2 1 1 0 1 1 1 0 1 0 1 1 0 2 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0 -1  0  1 -1  1  0  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 12, 14, 15, 16, 18, 19]), Candidate: [2 1 1 0 1 1 1 0 1 0 0 2 0 2 0 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0 -1  1  0 -1  1  0  0 -1  1 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 13, 14, 15, 17, 19]), Candidate: [2 1 1 0 1 1 1 0 0 2 0 0 2 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0 -1  0  1  0  0  0  0 -1  0  1  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 15, 18, 19]), Candidate: [2 1 1 0 1 1 1 0 0 1 1 1 1 1 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  1  0  0  0  0 -1  0  0  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 17, 18, 19]), Candidate: [ 2  1  1  0  1  1  1 -1  2  1  0  1  1  0  0  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  1  0 -1  1  0 -1  1 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 12, 13, 15, 17, 18, 19]), Candidate: [ 2  1  1  0  1  1  1 -1  2  1 -1  2  1  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  1 -1  0  0  1  0  0  0  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 9, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  1  1  1 -1  2  0  0  1  2  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1  0  0  0  0  0  0 -1  1  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 9, 10, 11, 12, 13, 14, 16, 17]), Candidate: [ 2  1  1  0  1  1  0  1  1  1  0  1  1  1 -1  2  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1  0  0  0 -1  0  1 -1  1  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 9, 10, 11, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  1  1  0  1  1  1  0  0  1  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1  0 -1  1  0 -1  0  1  0  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 9, 11, 12, 15, 16, 17, 18, 19]), Candidate: [2 1 1 0 1 1 0 1 1 0 1 1 0 1 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1 -1  1 -1  1 -1  1  0  0  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 10, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  1  1  0  1  0  2 -1  2  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  0  1 -1  1  0  0  0  0 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 9, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [2 1 1 0 1 1 0 0 2 0 1 1 1 1 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0  0  0  0  0 -1  0  0  1  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 12, 16, 17, 18, 19]), Candidate: [2 1 1 0 1 0 2 0 1 1 0 1 0 1 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0  0 -1  1  0  0  0  0  0  0 -1  0  1] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17]), Candidate: [2 1 1 0 1 0 2 0 1 0 1 1 1 1 0 1 1 0 1 7]
 -> Valid neighbor added.
Attempt 850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0 -1  1  0  0  0 -1  0  1  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [2 1 1 0 1 0 2 0 0 2 0 1 1 0 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  1  0  0  0 -1  1 -1  1  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 9, 10, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  1  0  2 -1  2  1  0  1  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  1  0  0  0  0  0 -1  0  1  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 8, 9, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [2 1 1 0 1 0 1 1 1 1 0 1 1 0 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 1000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  0  0  1 -1  1  0  0  0  0  0  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 1 1 0 1 0 1 0 2 0 1 1 1 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 1050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0  0  0  0 -1  1 -1  1 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 13, 15, 17, 18, 19]), Candidate: [2 1 1 0 0 2 1 0 1 1 0 0 2 0 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 1100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0  0 -1  1  0  0 -1  0  1  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 9, 11, 12, 13, 16, 17, 18, 19]), Candidate: [2 1 1 0 0 2 1 0 1 0 1 1 1 0 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 1150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0 -1  1 -1  1  0  0  0  0  0  0 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 10, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  1  1  0  0  2  1  0  0  2 -1  2  1  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0 -1  1  0 -1  1  0 -1  1  0  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 9, 10, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  0  2  1 -1  2  1 -1  2  1  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1 -1  1  0  0 -1  1  0  0  0  0  0  0 -1  1] (Indices: [0, 1, 2, 3, 4, 6, 8, 9, 10, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  1  1  0  0  2  0  1  1  1 -1  2  1  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0  0  0  0  0  0 -1  1  0 -1  1  0  0] (Indices: [0, 1, 2, 3, 4, 7, 8, 9, 10, 11, 12, 13, 15, 16, 18, 19]), Candidate: [2 1 1 0 0 1 2 0 1 1 0 1 1 0 1 1 0 2 1 6]
 -> Valid neighbor added.
Attempt 1350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1 -1  1  0  0 -1  1  0  0  0  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 7, 9, 10, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  0  1  2 -1  2  1  0  0  2  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0  0  0  0  0 -1  0  0  1  0  0  0  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 9, 10, 11, 12, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  1  1  0  1  1  0  1  0  1  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0  0 -1  1  0  0  0  0  0  0 -1  0  1] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17]), Candidate: [ 2  1  1 -1  2  1  1  0  1  0  1  1  1  1  0  1  1  0  1  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0 -1  1  0  0  0 -1  0  1  0  0  0  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  1  1  0  0  2  0  1  1  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0 -1  1  0  0  0 -1  1 -1  1  0  0  0  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 9, 10, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  1  1 -1  2  1  0  1  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1 -1]). Discarded.
Attempt 1600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  1  0  0  0  0  0 -1  0  1  0  0  0  0] (Indices: [0, 1, 2, 3, 5, 6, 8, 9, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  1  0  1  1  1  0  1  1  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0 -1  0  1 -1  1  0  0  0  0  0  0  0  0  0] (Indices: [0, 1, 2, 3, 5, 6, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  1  0  0  2  0  1  1  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1 -1  1  0 -1  1  0  0  0  0  0 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 5, 7, 8, 10, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  0  2  0  0  2  0  1  1  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0  0  0  0  0 -1  0  1  0  0  0  0  0] (Indices: [0, 1, 2, 3, 6, 7, 8, 9, 10, 11, 12, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  2  1  0  1  1  0  1  0  1  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1 -1  1  0  0  0  0  0  0 -1  1  0  0  0  0] (Indices: [0, 1, 2, 3, 6, 8, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  2  0  1  1  1  0  1  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 1850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0  0  0  0  0 -1  1 -1  0  1  0  0  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 17, 18, 19]), Candidate: [ 2  1  0  1  1  1  1  0  1  1  0  1  0  2 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0  0  0 -1  0  1  0  0  0 -1  1  0  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 9, 10, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  1  0  1  1  1  1  0  1  1 -1  1  2  1  0  1  0  2  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0 -1  1  0  0  0  0 -1  0  1  0  0  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 10, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  1  0  1  1  1  1  0  0  2  0  1  1  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0 -1  1  0  0  0  0 -1  0  1  0  0  0  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 9, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [ 2  1  0  1  1  1  1 -1  2  1  0  1  1  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  1  0  0  0  0  0  0 -1  0  1  0  0  0] (Indices: [0, 1, 2, 4, 5, 6, 8, 9, 10, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  1  0  1  1  1  0  1  1  1  0  1  1  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0 -1  0  1  0  0  0  0  0 -1  1  0  0  0  0] (Indices: [0, 1, 2, 4, 5, 6, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  0  1  1  1  0  0  2  1  0  1  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1  0  0 -1  1 -1  1  0  0  0  0  0  0  0] (Indices: [0, 1, 2, 4, 5, 7, 8, 9, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 1 0 1 1 0 2 0 1 0 1 0 2 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 2200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0  0  0  0  0  0 -1  1  0  0  0  0 -1  1] (Indices: [0, 1, 2, 4, 6, 7, 8, 9, 10, 11, 12, 14, 15, 16, 17, 18]), Candidate: [2 1 0 1 0 2 1 0 1 1 0 1 0 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 2250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1 -1  1  0 -1  0  1  0  0  0  0  0  0  0  0  0  0] (Indices: [0, 1, 2, 4, 6, 7, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  0  1  0  2  1 -1  1  2  0  1  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0  0  0  0  0  0 -1  1  0  0 -1  1  0  0  0] (Indices: [0, 1, 2, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15, 17, 18, 19]), Candidate: [2 1 0 0 2 1 1 0 1 1 0 0 2 1 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 2350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  0  1  0 -1  1  0  0 -1  1  0  0  0  0  0  0  0  0] (Indices: [0, 1, 2, 5, 6, 8, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  0  0  2  1  0  1  1  1 -1  2  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0  0  0  0  0  0 -1  0  0  1  0  0  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 17, 18, 19]), Candidate: [2 0 2 0 1 1 1 0 1 1 0 1 1 0 0 1 2 1 1 6]
 -> Valid neighbor added.
Attempt 2450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0  0  0 -1  1  0 -1  1 -1  1  0  0  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 15, 17, 18, 19]), Candidate: [ 2  0  2  0  1  1  1  0  1  1 -1  2  1  0  1  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0  0 -1  0  0  1  0  0  0  0  0  0  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 9, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 0 2 0 1 1 1 0 1 0 0 1 2 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 2550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  1  0  0  0  0  0  0 -1  1 -1  1  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 17, 19]), Candidate: [ 2  0  2  0  1  1  1 -1  2  1  0  1  1  1  0  0  2  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0 -1  0  0  1  0  0  0  0  0  0  0  0  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2  0  1  1  1 -1  1  1  1  1  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1 -1  1  0  0  0  0 -1  1  0  0  0  0] (Indices: [0, 1, 3, 4, 5, 6, 8, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  0  2  0  1  1  0  1  0  2  0  1  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0  0  0 -1  1  0 -1  1  0  0  0  0  0] (Indices: [0, 1, 3, 4, 5, 7, 8, 9, 10, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2  0  1  0  2  0  1  1 -1  2  1  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0  0  0  0  0  0  0  0  0 -1  0  1  0  0] (Indices: [0, 1, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 18, 19]), Candidate: [2 0 2 0 0 2 1 0 1 1 0 1 1 1 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 2800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0 -1  1  0 -1  1  0  0  0  0  0  0  0  0  0 -1  1] (Indices: [0, 1, 3, 4, 6, 7, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18]), Candidate: [ 2  0  2  0  0  2  1 -1  2  1  0  1  1  1  0  1  1  1  0  7]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0  0  0  0  0  0  0 -1  0  1  0  0  0  0] (Indices: [0, 1, 3, 5, 6, 7, 8, 9, 10, 11, 12, 13, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  1  1  0  1  1  0  1  1  0  0  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 2900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  1  0  0 -1  1 -1  1  0  0  0  0  0  0  0  0  0] (Indices: [0, 1, 3, 5, 6, 7, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  2  1  1 -1  2  0  1  1  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 2950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0  0  0  0  0  0  0  0 -1  0  1  0  0  0] (Indices: [0, 1, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 2  0  1  1  1  1  1  0  1  1  0  1  1  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  1  0  0  0 -1  1  0  0  0  0  0 -1  1  0  0  0  0] (Indices: [0, 1, 4, 5, 6, 7, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  0  1  1  1  1  1 -1  2  1  0  1  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  0  0  1  0  0  0  0  0  0  0  0  0 -1  1  0  0  0  0] (Indices: [0, 1, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  0  1  0  2  1  1  0  1  1  0  1  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0  0  0  0 -1  1  0  0 -1  1 -1  1  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15, 17, 19]), Candidate: [1 2 1 0 1 1 1 0 1 1 0 0 2 1 0 0 2 0 2 6]
 -> Valid neighbor added.
Attempt 3150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0  0 -1  1  0  0  0  0 -1  0  1  0  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 18, 19]), Candidate: [1 2 1 0 1 1 1 0 1 0 1 1 1 1 0 0 1 2 1 6]
 -> Valid neighbor added.
Attempt 3200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0 -1  1  0  0 -1  1 -1  1  0  0  0  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 10, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 1  2  1  0  1  1  1  0  0  2  0  1  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0 -1  1  0  0 -1  1  0  0 -1  1  0  0  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 17, 18, 19]), Candidate: [ 1  2  1  0  1  1  1 -1  2  1  0  0  2  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0 -1  1  0  0  0  0 -1  1 -1  1  0  0  0  0] (Indices: [0, 2, 3, 4, 5, 6, 8, 9, 10, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 1  2  1  0  1  1  0  1  1  1  0  1  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0  0  0  0  0  0  0  0 -1  1  0 -1  1] (Indices: [0, 2, 3, 4, 5, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 18]), Candidate: [1 2 1 0 1 0 2 0 1 1 0 1 1 1 0 0 2 1 0 7]
 -> Valid neighbor added.
Attempt 3400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0 -1  1 -1  1  0  0  0  0  0  0  0  0] (Indices: [0, 2, 3, 4, 5, 7, 8, 10, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  2  1  0  1  0  2  0  0  2 -1  2  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1  0  0  0  0  0 -1  1  0 -1  1  0  0  0  0] (Indices: [0, 2, 3, 4, 6, 7, 8, 9, 10, 11, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  2  1  0  0  2  1  0  1  1  0  0  2  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0 -1  1 -1  1  0 -1  1  0  0  0  0  0  0  0  0  0] (Indices: [0, 2, 3, 4, 6, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [1 2 1 0 0 2 0 1 1 0 1 1 1 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 3550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1  0  0  0  0  0 -1  1 -1  1  0  0  0  0  0  0] (Indices: [0, 2, 3, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  1  1  0  1  1 -1  2  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0 -1  1 -1  1  0  0  0  0  0 -1  1  0  0  0  0  0  0] (Indices: [0, 2, 3, 5, 7, 8, 9, 10, 11, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 1  2  1 -1  2  0  2  0  1  1  0  1  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0  0  0  0  0  0 -1  1  0  0  0  0  0 -1  1  0] (Indices: [0, 2, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 1  2  0  1  1  1  1  0  1  1 -1  2  1  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0  0  0  0  0  0  0  0  0  0 -1  1  0] (Indices: [0, 2, 4, 5, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [1 2 0 1 1 0 2 0 1 1 0 1 1 1 0 1 1 0 2 6]
 -> Valid neighbor added.
Attempt 3750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0  0  0  0  0  0  0  0 -1  0  1  0  0  0] (Indices: [0, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 1  1  2  0  1  1  1  0  1  1  0  1  1  1 -1  1  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 3800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1  0  0  0  0 -1  1  0  0  0  0  0 -1  1  0  0  0  0] (Indices: [0, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  1  2  0  1  1  1 -1  2  1  0  1  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  0  1 -1  1  0  0  0  0  0  0  0  0  0 -1  1  0  0  0  0] (Indices: [0, 3, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 1  1  2 -1  2  1  1  0  1  1  0  1  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 3900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0  0  0  0  0 -1  1  0 -1  1  0 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 15, 17, 18]), Candidate: [3 1 1 0 1 1 1 0 1 1 0 1 0 2 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 3950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0  0  0 -1  1 -1  1  0  0 -1  1  0 -1] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 19]), Candidate: [ 3  1  1  0  1  1  1  0  1  1 -1  2  0  2  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0 -1  1  0  0  0  0  0 -1  1  0 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 12, 13, 14, 15, 17, 18]), Candidate: [3 1 1 0 1 1 1 0 0 2 0 1 1 1 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 4050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0 -1  1  0  0  0  0  0 -1  1 -1  1  0 -1] (Indices: [1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 14, 16, 18, 19]), Candidate: [ 3  1  1  0  1  1  1 -1  2  1  0  1  1  1 -1  2  0  2  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1  0  0  0  0  0  0  0 -1  1  0 -1  0] (Indices: [1, 2, 3, 4, 5, 6, 8, 9, 10, 11, 12, 13, 14, 15, 17, 18]), Candidate: [3 1 1 0 1 1 0 1 1 1 0 1 1 1 0 0 2 1 0 6]
 -> Valid neighbor added.
Attempt 4150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0 -1  1 -1  1 -1  1  0  0  0  0  0  0  0 -1] (Indices: [1, 2, 3, 4, 5, 6, 8, 10, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  1  1  0  1  1  0  1  0  2 -1  2  1  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0  0 -1  1  0  0  0  0  0  0 -1  1 -1] (Indices: [1, 2, 3, 4, 5, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 19]), Candidate: [3 1 1 0 1 0 2 0 1 0 1 1 1 1 0 1 1 0 2 5]
 -> Valid neighbor added.
Attempt 4250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0  0  0  0  0  0  0  0 -1  0  1  0  0 -1] (Indices: [1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 17, 18, 19]), Candidate: [ 3  1  1  0  0  2  1  0  1  1  0  1  1  1 -1  1  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0 -1  1  0 -1  1  0  0  0  0  0 -1  1  0  0  0 -1] (Indices: [1, 2, 3, 4, 6, 7, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 3  1  1  0  0  2  1 -1  2  1  0  1  1  1 -1  2  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0  0  0  0  0  0  0 -1  1  0 -1  1  0  0 -1] (Indices: [1, 2, 3, 5, 6, 7, 8, 9, 10, 11, 12, 14, 15, 17, 18, 19]), Candidate: [ 3  1  1 -1  2  1  1  0  1  1  0  1  0  2  0  0  2  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0 -1  1  0 -1  1  0  0  0  0  0  0  0  0 -1  1  0 -1] (Indices: [1, 2, 3, 5, 6, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 3  1  1 -1  2  1  0  1  1  1  0  1  1  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0  0  0  0  0  0 -1  1 -1  1  0  0 -1] (Indices: [1, 2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 17, 18, 19]), Candidate: [3 1 0 1 1 1 1 0 1 1 0 1 1 0 1 0 2 1 1 5]
 -> Valid neighbor added.
Attempt 4500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0 -1  1  0 -1  1  0  0  0  0  0  0  0 -1] (Indices: [1, 2, 4, 5, 6, 7, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  1  0  1  1  1  1 -1  2  1 -1  2  1  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 4550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  0  1  0  0  0  0  0 -1  1  0  0  0  0  0  0  0 -1] (Indices: [1, 2, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 3  1  0  0  2  1  1  0  1  1 -1  2  1  1  0  1  1  1  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0  0  0  0  0  0 -1  1 -1  1  0  0  0  0  0  0 -1] (Indices: [1, 3, 4, 5, 6, 7, 8, 9, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [3 0 2 0 1 1 1 0 1 0 1 0 2 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Attempt 4650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1 -1  1  0 -1  1  0  0  0  0  0  0  0  0  0  0 -1  1  0 -1] (Indices: [1, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18, 19]), Candidate: [3 0 2 0 0 2 1 0 1 1 0 1 1 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 4700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0  0  0  0  0  0  0  0 -1  1  0 -1  1 -1] (Indices: [2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 16, 17, 19]), Candidate: [ 2  2  1  0  1  1  1  0  1  1  0  1  1  1 -1  2  1  0  2  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0  0  0  0  0 -1  1  0  0  0  0  0  0  0 -1  1  0 -1] (Indices: [2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  2  1  0  1  1  1 -1  2  1  0  1  1  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 4800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  1  0 -1  1  0  0  0  0  0  0  0  0  0  0  0 -1  1  0 -1] (Indices: [2, 3, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 2  2  1 -1  2  1  1  0  1  1  0  1  1  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Finished generating neighbors. Total valid neighbors found: 2246
  Size of neighborhood t=16: 2246
  Using 'fork' start method for multiprocessing.
  No improvement found for t=16 after processing 2246 neighbors.
No improving solution found or error occurred for t=16.

Attempting neighborhood t=17 (current best cost: 98.4663)
  Exploring neighborhood t=17 in parallel (current cost: 98.4663)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Attempt 50: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0  0  0 -1  1 -1  0  1  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 16, 17, 18, 19]), Candidate: [2 1 1 0 1 1 1 0 1 1 0 0 2 0 0 2 1 1 1 6]
 -> Valid neighbor added.
Attempt 100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0  0 -1  1  0 -1  1  0  0  0  0 -1  1] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 14, 15, 16, 17, 18]), Candidate: [2 1 1 0 1 1 1 0 1 0 1 1 0 2 0 1 1 1 0 7]
 -> Valid neighbor added.
Attempt 150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0 -1  1 -1  1  0  0  0  0  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  1  1  0  1  1  1  0  0  2 -1  2  1  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 200: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0 -1  1  0 -1  1 -1  1  0  0  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 12, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  1  1  1 -1  2  1 -1  2  0  2  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 250: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0 -1  1  0  0 -1  1  0  0  0  0  0 -1  1  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 13, 14, 15, 16, 17, 19]), Candidate: [ 2  1  1  0  1  1  0  1  1  1 -1  2  1  1  0  1  1  0  2  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 300: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1  0  0  0  0  0  0 -1  1 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 12, 13, 15, 17, 18, 19]), Candidate: [2 1 1 0 1 0 2 0 1 1 0 1 1 0 1 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 350: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0 -1  1 -1  1  0 -1  1  0  0  0  0  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 7, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  1  0  2 -1  2  1 -1  2  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1 -1]). Discarded.
Attempt 400: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0  0  0 -1  0  1  0  0  0  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 9, 10, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  0  2  1  0  1  1 -1  1  2  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 450: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  0  1  0  0  0  0 -1  1  0  0  0  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 1 1 0 0 1 2 0 1 1 0 0 2 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 500: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  1  0  0  0  0 -1  0  1  0  0  0  0  0  0  0  0] (Indices: [0, 1, 2, 3, 5, 6, 7, 8, 9, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1 -1  2  1  1  0  1  0  0  2  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 550: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0 -1  0  1  0  0  0  0  0  0  0  0  0 -1  1  0  0  0] (Indices: [0, 1, 2, 3, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [ 2  1  1 -1  1  2  1  0  1  1  0  1  1  1  0  0  2  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 600: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0  0  0  0  0 -1  1  0  0  0  0 -1  1  0  0  0] (Indices: [0, 1, 2, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [2 1 0 1 1 1 1 0 1 0 1 1 1 1 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 650: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0 -1  1  0 -1  1 -1  1  0  0  0  0  0  0  0  0  0  0  0] (Indices: [0, 1, 2, 4, 5, 7, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  0  1  1  0  2 -1  2  1  0  1  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 700: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0  0  0  0  0  0  0 -1  1 -1  1  0  0  0  0] (Indices: [0, 1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 16, 17, 18, 19]), Candidate: [ 2  0  2  0  1  1  1  0  1  1  0  1  0  2 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 750: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0  0 -1  1  0  0  0  0  0  0  0 -1  1  0  0  0] (Indices: [0, 1, 3, 4, 5, 6, 8, 9, 10, 11, 12, 13, 14, 15, 17, 18, 19]), Candidate: [2 0 2 0 1 1 0 1 1 1 0 1 1 1 0 0 2 1 1 6]
 -> Valid neighbor added.
Attempt 800: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1 -1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0] (Indices: [0, 1, 3, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  0  2 -1  1  2  1  0  1  1  0  1  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 850: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0  0  0  0  0  0 -1  1  0 -1  1  0  0  0  0  0] (Indices: [0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 15, 16, 17, 18, 19]), Candidate: [ 1  2  1  0  1  1  1  0  1  1 -1  2  1  0  1  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 900: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1  0  0  0 -1  1  0  0  0  0  0  0 -1  1  0  0  0  0  0] (Indices: [0, 2, 3, 4, 5, 7, 8, 9, 10, 11, 12, 13, 15, 16, 17, 18, 19]), Candidate: [1 2 1 0 1 0 2 0 1 1 0 1 1 0 1 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 950: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [-1  1 -1  1  0 -1  1  0  0  0  0  0  0  0  0  0  0  0  0  0] (Indices: [0, 2, 4, 5, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [1 2 0 1 1 0 2 0 1 1 0 1 1 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Attempt 1000: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0  0  0  0  0  0 -1  1  0  0  0  0 -1  1  0 -1] (Indices: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16, 18, 19]), Candidate: [ 3  1  1  0  1  1  1  0  1  1 -1  2  1  1  0  1  0  2  1  5]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 1050: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0  0  0  0 -1  1  0  0  0  0  0  0  0  0  0 -1  1  0 -1] (Indices: [1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18, 19]), Candidate: [3 1 1 0 1 0 2 0 1 1 0 1 1 1 0 1 0 2 1 5]
 -> Valid neighbor added.
Attempt 1100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 1  0 -1  1  0  0  0  0 -1  1  0  0  0  0  0  0  0  0  0 -1] (Indices: [1, 2, 4, 5, 6, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [3 1 0 1 1 1 1 0 0 2 0 1 1 1 0 1 1 1 1 5]
 -> Valid neighbor added.
Finished generating neighbors. Total valid neighbors found: 620
  Size of neighborhood t=17: 620
  Using 'fork' start method for multiprocessing.
  No improvement found for t=17 after processing 620 neighbors.
No improving solution found or error occurred for t=17.

Attempting neighborhood t=18 (current best cost: 98.4663)
  Exploring neighborhood t=18 in parallel (current cost: 98.4663)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Attempt 50: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0  0  0  0  0 -1  1  0  0  0  0 -1  1  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 12, 13, 14, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  1  1  1  0  0  2  0  1  1  1 -1  2  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 100: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0  0  0  0 -1  1  0  0  0  0 -1  1  0  0  0  0  0  0  0  0] (Indices: [0, 1, 2, 3, 4, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [ 2  1  1  0  0  2  1  0  1  1 -1  2  1  1  0  1  1  1  1  6]
 -> Invalid neighbor (negative values: [-1]). Discarded.
Attempt 150: Base x: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6], Adjustment: [ 0 -1  1  0  0 -1  1  0  0  0  0  0  0  0  0  0  0  0  0  0] (Indices: [0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19]), Candidate: [2 0 2 0 1 0 2 0 1 1 0 1 1 1 0 1 1 1 1 6]
 -> Valid neighbor added.
Finished generating neighbors. Total valid neighbors found: 124
  Size of neighborhood t=18: 124
  Using 'fork' start method for multiprocessing.
  No improvement found for t=18 after processing 124 neighbors.
No improving solution found or error occurred for t=18.

Attempting neighborhood t=19 (current best cost: 98.4663)
  Exploring neighborhood t=19 in parallel (current cost: 98.4663)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 16
  Size of neighborhood t=19: 16
  Using 'fork' start method for multiprocessing.
  No improvement found for t=19 after processing 16 neighbors.
No improving solution found or error occurred for t=19.

Attempting neighborhood t=20 (current best cost: 98.4663)
  Exploring neighborhood t=20 in parallel (current cost: 98.4663)...
Generating neighbors for parallel processing (printing every 50th attempt if echo=True)
Finished generating neighbors. Total valid neighbors found: 1
  Size of neighborhood t=20: 1
  Using 'fork' start method for multiprocessing.
  No improvement found for t=20 after processing 1 neighbors.
No improving solution found or error occurred for t=20.
--------------------------------------------------
Variable Neighborhood Search finished.
Final solution: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6]
Final cost: 98.4663
--------------------------------------------------

--- VNS Result ---
Best solution found: [2 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 6]
Best cost found: 98.4663
Total execution time: 108.66 seconds